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: "three receiver broadcast channels with side information"
  Abstract: Three-receiver broadcast channel (BC) is of interest due to its information theoretical differences with two receiver one. In this paper, we derive achievable rate regions for two classes of 3-receiver BC with side information available at the transmitter, Multilevel BC and 3-receiver less noisy BC, by using superposition coding, Gel'fand-Pinsker binning scheme and Nair-El Gamal indirect decoding. Our rate region for multilevel BC subsumes the Steinberg rate region for 2-receiver degraded BC with side information as its special case. We also find the capacity region of 3-receiver less noisy BC when side information is available both at the transmitter and at the receivers.

Connected through hyperedge HE-1 (induced by source paper "on the security analysis of a cooperative incremental relaying protocol in the presence of an active eavesdropper"):
  with members:
    - "power allocation and cooperative diversity in two way non regenerative cognitive radio networks"
    - "security versus reliability analysis of opportunistic relaying"
    - "opportunistic secrecy with a strict delay constraint"
    - "intercept probability analysis of cooperative wireless networks with best relay selection in the presence of eavesdropping attack"
    - "on the design of artificial noise aided secure multi antenna transmission in slow fading channels"
    - "a secure communication game with a relay helping the eavesdropper"
    - "joint relay and jammer selection for secure two way relay networks"
    - "buffers improve the performance of relay selection"

Connected through hyperedge HE-2 (induced by source paper "capacity bounds and a certain capacity region for special three receiver broadcast channels with side information"):
  with members:
    - "capacity bounds for wireless ergodic fading broadcast channels with partial csit"
    - "duality between channel capacity and rate distortion with two sided state information"

Connected through hyperedge HE-3 (induced by source paper "state dependent z channel"):
  with members:
    - "compound multiple access channel with common message and intersymbol interference"
    - "state dependent multiple access channels with feedback"
    - "lattice strategies for the dirty multiple access channel"
    - "rate regions for 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)