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: "on the performance of 1 level ldpc lattices"
  Abstract: The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower coding gain, 1-level regular LDPC lattices have remarkable performances. The lower complexity nature of the decoding algorithm for these type of lattices allows us to run it for higher dimensions easily. Our simulation results show that a 1-level LDPC lattice of size 10000 can work as close as 1.1 dB at normalized error probability (NEP) of $10^{-5}$.This can also be reported as 0.6 dB at symbol error rate (SER) of $10^{-5}$ with sum-product algorithm.

Connected through hyperedge HE-1 (induced by source paper "a lattice based joint encryption encoding and modulation scheme"):
  with members:
    - "ldpc lattice codes for full duplex relay channels"
    - "low density lattice codes"

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"
    - "connections between construction d and related constructions of 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 "leech constellations of construction a lattices"):
  with members:
    - "some goodness properties of lda lattices"
    - "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"
    - "finite dimensional infinite constellations"
    - "turbo lattices construction and error decoding performance"

Connected through hyperedge HE-4 (induced by source paper "lda lattices without dithering achieve capacity on the gaussian channel"):
  with members:
    - "some goodness properties of lda lattices"
    - "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"
    - "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-5 (induced by source paper "ldpc lattice codes for full duplex relay channels"):
  with members:
    - "practical encoder and decoder for power constrained qc ldpc lattices"
    - "an algebraic approach to physical layer network coding"
    - "wireless network information flow a deterministic approach"
    - "lattice codes for the gaussian relay channel decode and forward and compress and forward"
    - "interference channel with an out of band relay"
    - "compute and forward harnessing interference through structured codes"
    - "low density lattice codes"

Connected through hyperedge HE-6 (induced by source paper "low dimensional shaping for high dimensional lattice codes"):
  with members:
    - "construction of capacity achieving lattice codes polar lattices"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "compute and forward harnessing interference through structured codes"
    - "low density lattice codes"

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)