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: "optimal coding schemes for the three receiver awgn broadcast channel with receiver message side information"
  Abstract: This paper investigates the capacity region of the three-receiver AWGN broadcast channel where the receivers: 1) have private-message requests and 2) may know some of the messages requested by other receivers as side information. We first classify all 64 possible side information configurations into eight groups, each consisting of eight members. We next construct transmission schemes, and derive new inner and outer bounds for the groups. This establishes the capacity region for 52 out of 64 possible side information configurations. For six groups (i.e., groups 1, 2, 3, 5, 6, and 8 in our terminology), we establish the capacity region for all their members, and show that it tightens both the best-known inner and outer bounds. For group 4, our inner and outer bounds tighten the best-known inner bound and/or outer bound for all the group members. Moreover, our bounds coincide at certain regions, which can be characterized by two thresholds. For group 7, our inner and outer bounds coincide for four members, and thereby establishing the capacity region. For the remaining four members, our bounds tighten both the best-known inner and outer bounds.

Connected through hyperedge HE-1 (induced by source paper "layered space time index coding"):
  with members:
    - "golden coded index coding"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "lattice index coding"
    - "index coded psk modulation"
    - "lattice index codes from algebraic number fields"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "fundamental limits of caching"
    - "broadcast capacity region of two phase bidirectional relaying"

Connected through hyperedge HE-2 (induced by source paper "the dof region of the three receiver mimo broadcast channel with side information and its relation to index coding capacity"):
  with members:
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"
    - "on the capacity region for index coding"
    - "on the equal rate capacity of the awgn multiway relay channel"

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)