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: "connections between construction d and related constructions of lattices"
  Abstract: Most practical constructions of lattice codes with high coding gains are multilevel constructions where each level corresponds to an underlying code component. Construction D, Construction D$'$, and Forney's code formula are classical constructions that produce such lattices explicitly from a family of nested binary linear codes. In this paper, we investigate these three closely related constructions along with the recently developed Construction A$'$ of lattices from codes over the polynomial ring $\mathbb{F}_2[u]/u^a$. We show that Construction by Code Formula produces a lattice packing if and only if the nested codes being used are closed under Schur product, thus proving the similarity of Construction D and Construction by Code Formula when applied to Reed-Muller codes. In addition, we relate Construction by Code Formula to Construction A$'$ by finding a correspondence between nested binary codes and codes over $\mathbb{F}_2[u]/u^a$. This proves that any lattice constructible using Construction by Code Formula is also constructible using Construction A$'$. Finally, we show that Construction A$'$ produces a lattice if and only if the corresponding code over $\mathbb{F}_2[u]/u^a$ is closed under shifted Schur product.

Connected through hyperedge HE-1 (induced by source paper "multilevel constructions coding packing and geometric uniformity"):
  with members:
    - "construction c an inter level coded version of construction c"
    - "uniformity properties of construction c"

Connected through hyperedge HE-2 (induced by source paper "multilevel ldpc lattices with efficient encoding and decoding and a generalization of construction d"):
  with members:
    - "ldpc lattice codes for full duplex relay channels"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "construction of capacity achieving lattice codes polar lattices"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "on the performance of 1 level ldpc lattices"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "integer forcing linear receivers"

Connected through hyperedge HE-3 (induced by source paper "construction c an inter level coded version of construction c"):
  with members:
    - "uniformity properties of construction c"

Connected through hyperedge HE-4 (induced by source paper "encoding and indexing of lattice codes"):
  with members:
    - "phase precoded compute and forward with partial feedback"
    - "an algebraic approach to physical layer network coding"
    - "turbo lattices construction and error decoding performance"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "compute and forward harnessing interference through structured codes"
    - "low density lattice codes"

Connected through hyperedge HE-5 (induced by source paper "uniformity properties of construction c"):
  with members:
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-6 (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 from codes for harnessing interference an overview and generalizations"
    - "lattices over eisenstein integers for compute and forward"
    - "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-7 (induced by source paper "squares of random linear codes"):
  with members:
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "new identities relating wild goppa codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "asymptotically good binary linear codes with asymptotically good self intersection spans"
    - "bilinear complexity of algebras and the chudnovsky chudnovsky interpolation method"

Connected through hyperedge HE-8 (induced by source paper "lattices from codes over mathbb z _q generalization of constructions d d and overline d"):
  with members:
    - "construction pi_a and pi_d lattices construction goodness and decoding algorithms"
    - "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)