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 "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.

Includes members:
  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-1 (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-2 (induced by source paper "lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information")
  Member "error correction for index coding with side information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches")
  Member "on the index coding problem and its relation to network coding and matroid theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient 3d road map data exchange for intelligent vehicles in vehicular fog networks")
  Member "broadcasting with side information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "privacy utility tradeoff in a guessing framework inspired by index coding")

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)