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 "homologous codes for multiple access channels"):
  Abstract: Building on recent development by Padakandla and Pradhan, and by Lim, Feng, Pastore, Nazer, and Gastpar, this paper studies the potential of structured nested coset coding as a complete replacement for random coding in network information theory. The roles of two techniques used in nested coset coding to generate nonuniform codewords, namely, shaping and channel transformation, are clarified and illustrated via the simple example of the two-sender multiple access channel. While individually deficient, the optimal combination of shaping and channel transformation is shown to achieve the same performance as traditional random codes for the general two-sender multiple access channel. The achievability proof of the capacity region is extended to the multiple access channels with more than two senders, and with one or more receivers. A quantization argument consistent with the construction of nested coset codes is presented to prove achievability for their Gaussian counterparts. These results open up new possibilities of utilizing nested coset codes with the same generator matrix for a broader class of applications.

Includes members:
  Member "on general lattice quantization noise":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nested lattice codes for arbitrary continuous sources and channels")
  Member "towards an algebraic network information theory simultaneous joint typicality decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "communication versus computation duality for multiple access channels and source coding")
  Member "communication versus computation duality for multiple access channels and source coding":
    also connected through other hyperedges:
      (none)
  Member "an achievable rate region for the three user interference channel based on coset codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "a joint typicality approach to algebraic network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gaussian multiple access via compute and forward")
  Member "optimal achievable rates for interference networks with random codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance of multi cell massive mimo systems with interference decoding")
  Member "computing sum of sources over an arbitrary multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")

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)