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: "broadcast channels with cooperating decoders"
  Abstract: We consider the problem of communicating over the general discrete memoryless broadcast channel (DMBC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper, we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case

Connected through hyperedge HE-1 (induced by source paper "the capacity on degraded relay broadcast channel"):
  with members:
    - "achievable rate regions for cooperative relay broadcast channels with rate limited feedback"
    - "rate regions for relay broadcast channels"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-2 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation"):
  with members:
    - "enhancing multiuser mimo through opportunistic d2d cooperation"
    - "on the achievable rates of multihop virtual full duplex relay channels"
    - "noisy network coding with partial df"
    - "a survey on device to device communication in cellular networks"
    - "massive mimo multicasting in noncooperative cellular networks"
    - "spectrum sharing for device to device communication in cellular networks"
    - "modeling analysis and optimization of multicast device to device transmissions"
    - "short message noisy network coding with rate splitting"

Connected through hyperedge HE-3 (induced by source paper "channels with cooperation links that may be absent"):
  with members:
    - "cooperative binning for semideterministic channels"
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-4 (induced by source paper "the broadcast channel with degraded message sets and unreliable conference"):
  with members:
    - "cooperative relay broadcast channels"

Connected through hyperedge HE-5 (induced by source paper "strong secrecy for cooperative broadcast channels"):
  with members:
    - "broadcast channels with privacy leakage constraints"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "the likelihood encoder for lossy compression"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "on state dependent broadcast channels with cooperation"
    - "the henchman problem measuring secrecy by the minimum distortion in a list"

Connected through hyperedge HE-6 (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"
    - "compound multiple access channels with partial cooperation"

Connected through hyperedge HE-7 (induced by source paper "conferencing in wyner s asymmetric interference network effect of number of rounds"):
  with members:
    - "cognitive wyner networks with clustered decoding"
    - "cellular interference alignment"
    - "interference mitigation through limited transmitter cooperation"
    - "interference mitigation through limited receiver cooperation"
    - "on cognitive interference networks"

Connected through hyperedge HE-8 (induced by source paper "achievable rate regions for cooperative relay broadcast channels with rate limited feedback"):
  with members:
    - "coding schemes with rate limited feedback that improve over the nofeedback capacity for a large class of broadcast channels"
    - "an achievable rate region for the broadcast channel with feedback"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "rate regions for relay broadcast channels"
    - "cooperative relay broadcast 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)