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: "the capacity of three receiver awgn broadcast channels with receiver message side information"
  Abstract: This paper investigates the capacity region of three-receiver AWGN broadcast channels where the receivers (i) have private-message requests and (ii) know the messages requested by some other receivers as side information. We classify these channels based on their side information into eight groups, and construct different transmission schemes for the groups. For six groups, we characterize the capacity region, and show that it improves both the best known inner and outer bounds. For the remaining two groups, we improve the best known inner bound by using side information during channel decoding at the receivers.

Connected through hyperedge HE-1 (induced by source paper "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information"):
  with members:
    - "capacity of coded index modulation"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "a lattice approach for optimal rate diverse wireless network coding"
    - "lattice index coding"
    - "index coding with coded side information"
    - "lattice index codes from algebraic number fields"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "achieving awgn channel capacity with lattice gaussian coding"

Connected through hyperedge HE-2 (induced by source paper "lattice index codes from algebraic number fields"):
  with members:
    - "capacity of coded index modulation"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "lattice index coding"
    - "construction pi_a and pi_d lattices construction goodness and decoding algorithms"
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "fundamental limits of caching"

Connected through hyperedge HE-3 (induced by source paper "lattice index coding"):
  with members:
    - "capacity of coded index modulation"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "lattice index codes from algebraic number fields"
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "index coding via linear programming"
    - "broadcast capacity region of two phase bidirectional relaying"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-4 (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"
    - "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"
    - "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-5 (induced by source paper "capacity of coded index modulation"):
  with members:
    - "lattice index coding"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "on the index coding problem and its relation to network coding and matroid theory"
    - "broadcasting with side information"

Connected through hyperedge HE-6 (induced by source paper "index codes for the gaussian broadcast channel using quadrature amplitude modulation"):
  with members:
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "error correction for index coding with side information"
    - "on the index coding problem and its relation to network coding and matroid theory"
    - "broadcasting with side information"

Connected through hyperedge HE-7 (induced by source paper "a unified scheme for two receiver broadcast channels 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"
    - "broadcast capacity region of two phase bidirectional relaying"

Connected through hyperedge HE-8 (induced by source paper "coding schemes for a class of receiver message side information in awgn broadcast channels"):
  with members:
    - "on the equal rate capacity of the awgn multiway relay channel"
    - "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)