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 "a simple proof for the existence of good pairs of nested lattices"):
  Abstract: This paper provides a simplified proof for the existence of nested lattice codebooks allowing to achieve the capacity of the additive white Gaussian noise channel, as well as the optimal rate-distortion trade-off for a Gaussian source. The proof is self-contained and relies only on basic probabilistic and geometrical arguments. An ensemble of nested lattices that is different, and more elementary, than the one used in previous proofs is introduced. This ensemble is based on lifting different subcodes of a linear code to the Euclidean space using Construction A. In addition to being simpler, our analysis is less sensitive to the assumption that the additive noise is Gaussian. In particular, for additive ergodic noise channels it is shown that the achievable rates of the nested lattice coding scheme depend on the noise distribution only via its power. Similarly, the nested lattice source coding scheme attains the same rate-distortion trade-off for all ergodic sources with the same second moment.

Includes members:
  Member "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "achieving awgn channel capacity with lattice gaussian coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private information retrieval over gaussian mac")
  Member "nested lattice codes for gaussian relay networks with interference":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized compute compress and forward")
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "lattice strategies for the dirty multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "compute and forward harnessing interference through structured codes":
    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)