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: "lattices from codes for harnessing interference an overview and generalizations"
  Abstract: In this paper, using compute-and-forward as an example, we provide an overview of constructions of lattices from codes that possess the right algebraic structures for harnessing interference. This includes Construction A, Construction D, and Construction $\pi_A$ (previously called product construction) recently proposed by the authors. We then discuss two generalizations where the first one is a general construction of lattices named Construction $\pi_D$ subsuming the above three constructions as special cases and the second one is to go beyond principal ideal domains and build lattices over algebraic integers.

Connected through hyperedge HE-1 (induced by source paper "robust successive compute and forward over multi user multi relay networks"):
  with members:
    - "full diversity unitary precoded integer forcing"
    - "compute and forward finding the best equation"
    - "phase precoded compute and forward with partial feedback"
    - "compute and forward two way relaying"
    - "compute and forward on a multi user multi relay channel"
    - "successive integer forcing and its sum rate optimality"
    - "asynchronous physical layer network coding with quasi cyclic codes"
    - "convolutional network coded cooperation in multi source networks with a multi antenna relay"

Connected through hyperedge HE-2 (induced by source paper "construction pi_a and pi_d lattices construction goodness and decoding algorithms"):
  with members:
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "polar lattices for lossy compression"
    - "construction of capacity achieving lattice codes polar lattices"
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "lattices over eisenstein integers for compute and forward"
    - "connections between construction d and related constructions of lattices"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"

Connected through hyperedge HE-3 (induced by source paper "adaptive compute and forward with lattice codes over algebraic integers"):
  with members:
    - "construction pi_a and pi_d lattices construction goodness and decoding algorithms"
    - "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 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"

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)