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: "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
  Abstract: We propose index codes, based on multidimensional QAM constellations, for the Gaussian broadcast channel, where every receiver demands all the messages from the source. The efficiency with which an index code exploits receiver side information in this broadcast channel is characterised by a code design metric called   side information gain  . The known index codes for this broadcast channel enjoy large side information gains, but do not encode all the source messages at the same rate, and do not admit message sizes that are powers of two. The index codes proposed in this letter, which are based on linear codes over integer rings, overcome both these drawbacks and yet provide large values of side information gain. With the aid of a computer search, we obtain QAM index codes for encoding up to 5 messages with message sizes    $2^{\boldsymbol{m}}$  ,    $\boldsymbol{m} \le 6$  . We also present the simulated performance of a new 16-QAM index code, concatenated with an off-the-shelf LDPC code, which is observed to operate within 4.3 dB of the broadcast channel capacity.

Connected through hyperedge HE-1 (induced by source paper "index coding with erroneous side information"):
  with members:
    - "error correction for index coding with coded side information"
    - "capacity of coded index modulation"
    - "index coding with coded side information"
    - "blind index coding"
    - "topological interference management through index coding"
    - "an equivalence between network coding and index coding"
    - "dynamic index coding for wireless broadcast networks"
    - "error correction for index coding with side information"

Connected through hyperedge HE-2 (induced by source paper "layered space time index coding"):
  with members:
    - "golden coded index coding"
    - "lattice index coding"
    - "index coded psk modulation"
    - "optimal coding schemes for the three receiver awgn broadcast channel with receiver message 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"
    - "fundamental limits of caching"
    - "broadcast capacity region of two phase bidirectional relaying"

Connected through hyperedge HE-3 (induced by source paper "golden coded index coding"):
  with members:
    - "wireless caching technical misconceptions and business barriers"
    - "lattice index coding"
    - "fundamental limits of caching in wireless d2d networks"
    - "fundamental limits of caching"
    - "golden space time trellis coded modulation"

Connected through hyperedge HE-4 (induced by source paper "maximum likelihood decoder for index coded psk modulation for priority ordered receivers"):
  with members:
    - "on the number of optimal index codes"
    - "index coded psk modulation"
    - "on the number of optimal linear index codes for unicast index coding problems"
    - "optimal index codes for a class of multicast networks with receiver side information"

Connected through hyperedge HE-5 (induced by source paper "noisy index coding with psk and qam"):
  with members:
    - "noisy index coding with quadrature amplitude modulation qam"
    - "index coded psk modulation"
    - "optimal index codes for a class of multicast networks with receiver side information"
    - "error correction for index coding with side information"

Connected through hyperedge HE-6 (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"
    - "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"
    - "the capacity of three receiver awgn broadcast channels with receiver message side information"
    - "achieving awgn channel capacity with lattice gaussian coding"

Connected through hyperedge HE-7 (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"
    - "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"
    - "the capacity of three receiver awgn broadcast channels with receiver message side information"
    - "fundamental limits of caching"

Connected through hyperedge HE-8 (induced by source paper "lattice index coding"):
  with members:
    - "capacity of coded index 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"
    - "the capacity of three receiver awgn 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"

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)