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: "compound multiple access channels with partial cooperation"
  Abstract: A two-user discrete memoryless compound multiple-access channel (MAC) with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional cooperation, and achievable rate regions are provided for the general case. The results are then extended to the corresponding Gaussian model. In the Gaussian setup, the provided achievable rates are shown to lie within some constant number of bits from the boundary of the capacity region in several special cases. An alternative model, in which the encoders are connected by conferencing links rather than having a common message, is studied as well, and the capacity region for this model is also determined for the cases of physically degraded channels and unidirectional cooperation. Numerical results are also provided to obtain insights about the potential gains of conferencing at the decoders and encoders.

Connected through hyperedge HE-1 (induced by source paper "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"):
  with members:
    - "empirical coordination in a triangular multiterminal network"
    - "successive refinement with decoder cooperation and its channel coding duals"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "mac with action dependent state information at one encoder"
    - "the state dependent semideterministic broadcast channel"
    - "multiterminal source coding under logarithmic loss"
    - "the compound multiple access channel with partially cooperating encoders"
    - "evaluation of marton s inner bound for the general broadcast channel"

Connected through hyperedge HE-2 (induced by source paper "novel outer bounds and capacity results for the interference channel with conferencing receivers"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "the k user interference channel strong interference regime"
    - "on the capacity region of the two user interference channel"
    - "an outer bound for the memoryless two user interference channel with general cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "interference mitigation through limited receiver cooperation"
    - "on the symmetric gaussian interference channel with partial unidirectional cooperation"

Connected through hyperedge HE-3 (induced by source paper "the finite state mac with cooperative encoders and delayed csi"):
  with members:
    - "dedicated relay vs user cooperation in time duplexed multiaccess networks"
    - "interference channels with source cooperation"
    - "source coding when the side information may be delayed"
    - "interference channels with destination cooperation"
    - "on the capacity of memoryless finite state multiple access channels with asymmetric state information at the encoders"
    - "interference mitigation through limited receiver cooperation symmetric case"
    - "on the symmetric gaussian interference channel with partial unidirectional cooperation"
    - "the gaussian mac with conferencing encoders"

Connected through hyperedge HE-4 (induced by source paper "semi deterministic broadcast channels with cooperation and a dual source coding problem"):
  with members:
    - "empirical coordination in a triangular multiterminal network"
    - "the state dependent semideterministic broadcast channel"
    - "multiterminal source coding under logarithmic loss"
    - "the compound multiple access channel with partially cooperating encoders"
    - "the gaussian mac with conferencing encoders"
    - "rate regions for relay broadcast channels"
    - "broadcast channels with cooperating decoders"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-5 (induced by source paper "multiple access channel with common message and secrecy constraint"):
  with members:
    - "compound multiple access channel with confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "multiple access channels with generalized feedback and confidential messages"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-6 (induced by source paper "on state dependent broadcast channels with cooperation"):
  with members:
    - "multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "broadcast channels with cooperating decoders"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-7 (induced by source paper "compound multiple access channel with confidential messages"):
  with members:
    - "multiple access channels with generalized feedback and confidential messages"
    - "the discrete memoryless multiple access channel with confidential messages"

Connected through hyperedge HE-8 (induced by source paper "successive refinement with decoder cooperation and its channel coding duals"):
  with members:
    - "channel coding and source coding with increased partial side information"
    - "coordination using implicit communication"
    - "multiple access channel with partial and controlled cribbing encoders"
    - "interference channels with destination cooperation"
    - "cascade and triangular source coding with side information at the first two nodes"
    - "cascade triangular and two way source coding with degraded side information at the second user"
    - "lecture notes on network information theory"
    - "the compound multiple access channel with partially cooperating encoders"

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)