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 "construction of capacity achieving lattice codes polar lattices"):
  Abstract: In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity $\frac{1}{2}\log(1+\text{SNR})$ of the additive white Gaussian-noise (AWGN) channel for any signal-to-noise ratio (SNR). Our construction follows the multilevel approach of Forney et al., where on each level we construct a capacity-achieving polar code. The component polar codes are naturally nested, thereby fulfilling the requirement of the multilevel lattice construction. We prove that polar lattices are AWGN-good, in the sense that the error probability (for infinite lattice decoding) vanishes for any fixed volume-to-noise ratio (VNR) greater than $2\pi e$. Furthermore, using the technique of source polarization, we propose discrete Gaussian shaping over the polar lattice to satisfy the power constraint. The proposed polar lattices permit low-complexity multistage successive cancellation decoding. Both the construction and shaping are explicit, and the overall complexity of encoding and decoding is $O(N\log N)$ for any fixed target error probability.

Includes members:
  Member "lattice index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cache aided modulation for heterogeneous coded caching over a gaussian broadcast channel")
  Member "finite length scaling for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reed muller codes theory and algorithms")
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar codes speed of polarization and polynomial gap to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes simplicity random codes durability")
  Member "multilevel polar coded modulation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "low complexity receiver for multi level polar coded modulation in non orthogonal multiple access")
  Member "improved bounds on the finite length scaling of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes simplicity random codes durability")
  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)