human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "cooperative binning for semideterministic channels"
  Abstract: The capacity regions of semideterministic multiuser channels, such as the semideterministic relay channel and the multiple access channel with partially cribbing encoders, have been characterized using the idea of partial-decode-forward. However, the requirement to explicitly decode part of the message at intermediate nodes can be restrictive in some settings; for example, when nodes have different side information regarding the state of the channel. In this paper, we generalize this scheme to cooperative-bin-forward by building on the observation that explicit recovering of part of the message is not needed to induce cooperation. Instead, encoders can bin their received signals and cooperatively forward the bin index to the decoder. The main advantage of this new scheme is illustrated by considering state-dependent extensions of the aforementioned semideterministic setups. While partial-decode-forward is suboptimal in these new setups, cooperative-bin-forward continues to achieve capacity.

Connected through hyperedge HE-1 (induced by source paper "cooperative binning for semi deterministic channels with non causal state information"):
  with members:
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "capacity of a class of state dependent orthogonal relay channels"
    - "multiple access channels with combined cooperation and partial cribbing"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "two way source coding with a helper"

Connected through hyperedge HE-2 (induced by source paper "channels with cooperation links that may be absent"):
  with members:
    - "broadcast channels with cooperating decoders"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-3 (induced by source paper "capacity of a class of state dependent orthogonal relay channels"):
  with members:
    - "relay channel with orthogonal components and structured interference known at the source"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "message and state cooperation in a relay channel when only the relay knows the state"
    - "bounds on the capacity of the relay channel with noncausal state information at source"
    - "capacity of a class of diamond channels"
    - "capacity of a class of deterministic relay channels"
    - "capacity of a class of modulo sum relay channels"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)