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 pi_a and pi_d lattices construction goodness and decoding algorithms"):
  Abstract: A novel construction of lattices is proposed. This construction can be thought of as a special class of Construction A from codes over finite rings that can be represented as the Cartesian product of $L$ linear codes over $\mathbb{F}_{p_1},\ldots,\mathbb{F}_{p_L}$, respectively, and hence is referred to as Construction $\pi_A$. The existence of a sequence of such lattices that is good for channel coding (i.e., Poltyrev-limit achieving) under multistage decoding is shown. A new family of multilevel nested lattice codes based on Construction $\pi_A$ lattices is proposed and its achievable rate for the additive white Gaussian channel is analyzed. A generalization named Construction $\pi_D$ is also investigated which subsumes Construction A with codes over prime fields, Construction D, and Construction $\pi_A$ as special cases.

Includes members:
  Member "lda lattices without dithering achieve capacity on the gaussian channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "polar lattices for lossy compression":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes and polar lattices for the heegard berger problem")
  Member "construction of capacity achieving lattice codes polar lattices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sparse regression codes")
  Member "multistage compute and forward with multilevel lattice codes based on product constructions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adaptive compute and forward with lattice codes over algebraic integers")
  Member "lattices from codes for harnessing interference an overview and generalizations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust successive compute and forward over multi user multi relay networks")
  Member "lattices over eisenstein integers for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "connections between construction d and related constructions of lattices":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multilevel constructions coding packing and geometric uniformity")
  Member "a simple proof for the existence of good pairs of nested lattices":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "private information retrieval over gaussian mac")

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)