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: "some goodness properties of lda lattices"
  Abstract: We study some structural properties of Construction-A lattices obtained from low density parity check codes over prime fields. Such lattices are called low density Construction-A (LDA) lattices, and permit low-complexity belief propagation decoding for transmission over Gaussian channels. It has been shown that LDA lattices achieve the capacity of the power constrained additive white Gaussian noise (AWGN) channel with closest lattice-point decoding, and simulations suggested that they perform well under belief propagation decoding. We continue this line of work and prove that these lattices are good for packing and mean squared error quantization and that their duals are good for packing. With this, we can conclude that codes constructed using nested LDA lattices can achieve the capacity of the power constrained AWGN channel, the capacity of the dirty paper channel, the rates guaranteed by the computeand-forward protocol, and the best known rates for bidirectional relaying with perfect secrecy.

Connected through hyperedge HE-1 (induced by source paper "leech constellations of construction a lattices"):
  with members:
    - "encoding and indexing of lattice codes"
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "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-2 (induced by source paper "lda lattices without dithering achieve capacity on the gaussian channel"):
  with members:
    - "ldpc lattice codes for full duplex relay channels"
    - "construction of capacity achieving lattice codes polar lattices"
    - "lattices over eisenstein integers for compute and forward"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "on the performance of 1 level ldpc lattices"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "turbo lattices construction and error decoding performance"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-3 (induced by source paper "practical encoder and decoder for power constrained qc ldpc lattices"):
  with members:
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "low density lattice codes"

Connected through hyperedge HE-4 (induced by source paper "polar lattices for lossy compression"):
  with members:
    - "lossy compression via sparse linear regression computationally efficient encoding and decoding"
    - "lossy compression via sparse linear regression performance under minimum distance encoding"
    - "construction of capacity achieving lattice codes polar lattices"
    - "on the construction of polar codes"
    - "wyner ziv coding based on multidimensional nested lattices"
    - "how to construct polar codes"
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "polar lattices are good for lossy compression"):
  with members:
    - "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"
    - "how to construct polar codes"
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless 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)