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 "algebraic lattice codes achieve the capacity of the compound block fading channel"):
  Abstract: We propose a lattice coding scheme that achieves the capacity of the compound block-fading channel. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned channel realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. A by-product of our results is the proof that the lattice Gaussian distribution is capacity-achieving in the AWGN channel for any signal-to-noise ratio.

Includes members:
  Member "adaptive compute and forward with lattice codes over algebraic integers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure modulo sum via multiple access channel")
  Member "construction a of lattices over number fields and block fading wiretap coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "almost universal codes achieving ergodic mimo capacity within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the separability of ergodic fading mimo channels a lattice coding approach")
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "achieving awgn channel capacity with lattice gaussian coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "dispersion analysis of infinite constellations in ergodic fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the separability of ergodic fading mimo channels a lattice coding approach")
  Member "fundamental limits of infinite constellations in mimo fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "universal lattice codes for mimo channels")

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)