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 lattices are good for lossy compression"):
  Abstract: Polar lattices, which are constructed from polar codes, have recently been proved to be able to achieve the capacity of the additive white Gaussian noise (AWGN) channel. In this work, we show that polar lattices can also solve the dual problem, i.e., achieving the rate-distortion bound of a memoryless Gaussian source, which means that polar lattices can also be good for the lossy compression of continuous sources. The structure of the proposed polar lattices enables us to integrate the post-entropy coding process into the lattice quantizer, which simplifies the quantization process. Moreover, the nesting structure of polar lattices further provides solutions for some multi-terminal coding problems. The Wyner-Ziv coding problem for a Gaussian source can be solved by an AWGN capacity achieving polar lattice nested in a rate-distortion bound achieving one, and the Gelfand-Pinsker problem can be solved in a reversed manner.

Includes members:
  Member "some goodness properties of lda lattices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "leech constellations of construction a lattices")
  Member "construction of capacity achieving lattice codes polar lattices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sparse regression codes")
  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 "achieving awgn channel capacity with lattice gaussian coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "how to construct polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "polar codes are optimal for lossy source coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reed muller codes theory and algorithms")

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)