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 coded psk modulation"):
  Abstract: In this paper we consider noisy index coding problem over AWGN channel. We give an algorithm to map the index coded bits to appropriate sized PSK symbols such that for the given index code, in general, the receiver with large amount of side information will gain in probability of error performance compared to the ones with lesser amount, depending upon the index code used. We call this the \textbf{PSK side information coding gain}. Also, we show that receivers with large amount of side information obtain this coding gain in addition to the bandwidth gain whereas receivers with lesser amount of side information trade off this coding gain with bandwidth gain. Moreover, in general, the difference between the best and worst performance among the receivers is shown to be proportional to the length of the index code employed.

Includes members:
  Member "index codes for the gaussian broadcast channel using quadrature amplitude modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "index coding with erroneous side information")
  Member "optimal index codes for a class of multicast networks with receiver side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cooperative multi sender index coding")
  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")

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)