human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "adaptive compute and forward with lattice codes over algebraic integers"):
  with members:
    - "lattice index codes from algebraic number fields"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "phase precoded compute and forward with partial feedback"
    - "lattices from codes for harnessing interference an overview and generalizations"
    - "lattices over eisenstein integers for compute and forward"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "multilevel coding schemes for compute and forward with flexible decoding"

Connected through hyperedge HE-2 (induced by source paper "lattice index codes from algebraic number fields"):
  with members:
    - "capacity of coded index modulation"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "lattice index coding"
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "joint network and gelfand pinsker coding for 3 receiver gaussian broadcast channels with receiver message side information"
    - "the capacity of three receiver awgn broadcast channels with receiver message side information"
    - "fundamental limits of caching"

Connected through hyperedge HE-3 (induced by source paper "lattices from codes over mathbb z _q generalization of constructions d d and overline d"):
  with members:
    - "connections between construction d and related constructions of lattices"
    - "turbo lattices construction and error decoding performance"

Question: Please tell me which class the center node 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)