human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "lattice index coding"):
  Abstract: The index coding problem involves a sender with    $K$    messages to be transmitted across a broadcast channel, and a set of receivers each of which demands a subset of the    $K$    messages while having a prior knowledge of a different subset as side information. We consider the specific case of noisy index coding where the broadcast channel is Gaussian and every receiver demands all the messages from the source. Instances of this communication problem arise in wireless relay networks, sensor networks, and retransmissions in broadcast channels. We construct lattice index codes for this channel by encoding the    $K$    messages individually using    $K$    modulo lattice constellations and transmitting their sum modulo a coarse lattice. We introduce a design metric called side information gain that measures the advantage of a code in utilizing the side information at the receivers, and hence, its goodness as an index code. Based on the Chinese remainder theorem, we then construct lattice index codes with large side information gains using lattices over the following principal ideal domains: 1) rational integers; 2) Gaussian integers; 3) Eisenstein integers; and 4) Hurwitz quaternions. Among all lattice index codes constructed using any densest lattice of a given dimension, our codes achieve the maximum side information gain. Finally, using an example, we illustrate how the proposed lattice index codes can benefit Gaussian broadcast channels with more general message demands.

Includes members:
  Member "capacity of coded index modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "index coding with erroneous side information")
  Member "index codes for the gaussian broadcast channel using quadrature amplitude modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "index coding with erroneous side information")
  Member "lattice index codes from algebraic number fields":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "multistage compute and forward with multilevel lattice codes based on product constructions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "construction pi_a and pi_d lattices construction goodness and decoding algorithms")
  Member "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "layered space time index coding")
  Member "the capacity of three receiver awgn broadcast channels with receiver message side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information")
  Member "index coding via linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "embedded index coding")
  Member "broadcast capacity region of two phase bidirectional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")

Question: Please tell me which class the source paper 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)