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 "how to compute modulo prime power sums"):
  Abstract: The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes (QGC). A QGC is a subset of a group code. These codes are not closed under the group addition. We investigate some properties of QGC's, and provide a packing and a covering bound. Next, we use these bounds to derived achievable rates for distributed source coding as well as computation over MAC. We show that strict improvements over the previously known schemes can be obtained using QGC's.

Includes members:
  Member "on the necessity of structured codes for communications over mac with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the reliability function of discrete memoryless multiple access channel with feedback")
  Member "a new achievable rate region for multiple access channel with states":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "structured mappings and conferencing common information for multiple access channels")
  Member "trade off between communication and cooperation in the interference channel":
    also connected through other hyperedges:
      (none)
  Member "a joint typicality approach to algebraic network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "homologous codes for multiple access channels")
  Member "achievable rate region for three user discrete broadcast channel based on coset codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "computing sum of sources over an arbitrary multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "achievable rate region based on coset codes for multiple access channel with states":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "homologous codes for multiple access channels")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private information retrieval over gaussian mac")

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)