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: "coding schemes for a class of receiver message side information in awgn broadcast channels"
  Abstract: This paper considers the three-receiver AWGN broadcast channel where the receivers (i) have private-message requests and (ii) know some of the messages requested by other receivers as side information. For this setup, all possible side information configurations have been recently classified into eight groups and the capacity of the channel has been established for six groups (Asadi et al., ISIT 2014). We propose inner and outer bounds for the two remaining groups, groups 4 and 7. A distinguishing feature of these two groups is that the weakest receiver knows the requested message of the strongest receiver as side information while the in-between receiver does not. For group 4, the inner and outer bounds coincide at certain regions. For group 7, the inner and outer bounds coincide, thereby establishing the capacity, for four members out of all eight members of the group; for the remaining four members, the proposed bounds reduce the gap between the best known inner and outer bounds.

Connected through hyperedge HE-1 (induced by source paper "optimal coding schemes for the three receiver awgn broadcast channel with receiver message side information"):
  with members:
    - "on index coding in noisy broadcast channels with receiver message side information"
    - "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-2 (induced by source paper "a unified scheme for two receiver broadcast channels with receiver message side information"):
  with members:
    - "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"
    - "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)