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: "on index coding in noisy broadcast channels with receiver message side information"
  Abstract: This letter investigates the role of index coding in the capacity of AWGN broadcast channels with receiver message side information. We first show that index coding is unnecessary where there are two receivers; multiplexing coding and superposition coding are sufficient to achieve the capacity region. We next show that, for more than two receivers, multiplexing coding and superposition coding alone can be suboptimal. We give an example where these two coding schemes alone cannot achieve the capacity region, but adding index coding can. This demonstrates that, in contrast to the two-receiver case, multiplexing coding cannot fulfill the function of index coding where there are three or more receivers.

Connected through hyperedge HE-1 (induced by source paper "optimal rate diverse wireless network coding"):
  with members:
    - "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information"
    - "lattice index coding"
    - "wireless network coding via modified 802 11 mac phy design and implementation on sdr"
    - "compute and forward harnessing interference through structured codes"
    - "broadcast capacity region of two phase bidirectional relaying"
    - "low density lattice codes"

Connected through hyperedge HE-2 (induced by source paper "optimal coding schemes for the three receiver awgn broadcast channel with receiver message side information"):
  with members:
    - "coding schemes for a class of receiver message side information in awgn broadcast channels"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "the capacity of three receiver awgn broadcast channels with receiver message side information"
    - "on the equal rate capacity of the awgn multiway relay channel"
    - "wireless network information flow a deterministic approach"
    - "broadcast capacity region of two phase bidirectional relaying"

Connected through hyperedge HE-3 (induced by source paper "the capacity of three receiver awgn broadcast channels with receiver message side information"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "broadcast capacity region of two phase bidirectional relaying"

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)