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 "multilevel code construction for compound fading channels"):
  Abstract: We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with negligible probability of error for any channel realization and normalized log-density approaching the Poltyrev limit. Capacity analyses and numerical results on the achievable rates for each partition level are provided. The proposed codes have several enjoyable properties such as constructiveness and good decoding complexity, as compared to random one-level codes. Numerical results for finite-dimensional multi-level lattices based on polar codes are exhibited.

Includes members:
  Member "polar codes and polar lattices for independent fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling convergence analysis and enhancement")
  Member "algebraic lattice codes achieve the capacity of the compound block fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ring compute and forward over block fading channels")
  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 "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "polar coding for fading channels binary and exponential channel cases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes over fading channels with power and delay constraints")
  Member "universal polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp 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)