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 "polar codes and polar lattices for independent fading channels"):
  Abstract: In this paper, we design polar codes and polar lattices for i.i.d. fading channels when the channel state information is only available to the receiver. For the binary input case, we propose a new design of polar codes through single-stage polarization to achieve the ergodic capacity. For the non-binary input case, polar codes are further extended to polar lattices to achieve the egodic Poltyrev capacity, i.e., the capacity without power limit. When the power constraint is taken into consideration, we show that polar lattices with lattice Gaussian shaping achieve the egodic capacity of fading channels. The coding and shaping are both explicit, and the overall complexity of encoding and decoding is $O(N \log^2 N)$.

Includes members:
  Member "algebraic lattice codes achieve the capacity of the compound block fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ring compute and forward over block fading channels")
  Member "polar codes for broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes simplicity random codes durability")
  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 "construction of capacity achieving lattice codes polar lattices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse regression codes")
  Member "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "universal lattice codes for mimo channels")
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "how to achieve the capacity of asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "achieving awgn channel capacity with lattice gaussian coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap 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)