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: "lda lattices without dithering achieve capacity on the gaussian channel"
  Abstract: This paper deals with Low-Density Construction-A (LDA) lattices, which are obtained via Construction A from non-binary Low-Density Parity-Check codes. More precisely, a proof is provided that Voronoi constellations of LDA lattices achieve the capacity of the AWGN channel under lattice encoding and decoding. This is obtained after showing the same result for more general Construction-A lattice constellations. The theoretical analysis is carried out in a way that allows to describe how the prime number underlying Construction A behaves as a function of the lattice dimension. Moreover, no dithering is required in the transmission scheme, simplifying some previous solutions of the problem. Remarkably, capacity is achievable with LDA lattice codes whose parity-check matrices have constant row and column Hamming weights. Some expansion properties of random bipartite graphs constitute an extremely important tool for dealing with sparse matrices and allow to find a lower bound of the minimum Euclidean distance of LDA lattices in our ensemble.

Connected through hyperedge HE-1 (induced by source paper "lattice coding for downlink multiuser transmission"):
  with members:
    - "downlink non orthogonal multiple access without sic for block fading channels an algebraic rotation approach"
    - "joint pilot and payload power control for uplink mimo noma with mrc sic receivers"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "a multi beam noma framework for hybrid mmwave systems"
    - "optimal resource allocation for power efficient mc noma with imperfect channel state information"
    - "improved decoding and error floor analysis of staircase codes"
    - "performance analysis of a hybrid downlink uplink cooperative noma scheme"
    - "on non orthogonal multiple access with finite alphabet inputs in z channels"

Connected through hyperedge HE-2 (induced by source paper "awgn goodness is enough capacity achieving lattice codes based on dithered probabilistic shaping"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "almost universal codes for fading wiretap channels"
    - "construction of capacity achieving lattice codes polar lattices"
    - "on the lattice smoothing parameter problem"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-3 (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"
    - "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"
    - "connections between construction d and related constructions of lattices"
    - "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-4 (induced by source paper "some goodness properties of lda lattices"):
  with members:
    - "secure compute and forward in a bidirectional relay"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "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"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "secrecy gain a wiretap lattice code design"
    - "compute and forward harnessing interference through structured codes"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-5 (induced by source paper "leech constellations of construction a lattices"):
  with members:
    - "some goodness properties of lda lattices"
    - "encoding and indexing of lattice codes"
    - "low dimensional shaping for high dimensional lattice codes"
    - "construction of capacity achieving lattice codes polar lattices"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "on the performance of 1 level ldpc lattices"
    - "finite dimensional infinite constellations"
    - "turbo lattices construction and error decoding performance"

Connected through hyperedge HE-6 (induced by source paper "practical encoder and decoder for power constrained qc ldpc lattices"):
  with members:
    - "some goodness properties of lda lattices"
    - "low density lattice codes"

Connected through hyperedge HE-7 (induced by source paper "construction pi_a and pi_d lattices construction goodness and decoding algorithms"):
  with members:
    - "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"
    - "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"

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)