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: "leech constellations of construction a lattices"
  Abstract: The problem of communicating over the additive white Gaussian noise (AWGN) channel with lattice codes is addressed in this paper. Theoretically, Voronoi constellations have proved to yield very powerful lattice codes when the fine lattice is AWGN-good and the coarse lattice has an optimal shaping gain. However, achieving Shannon capacity with these premises and practically implementable encoding algorithms is in general not an easy task. In this work, lattice codes called Leech constellations are proposed. They involve Construction-A lattices as fine lattices and a direct sum of multiple copies of the Leech lattice for shaping. The combination of these two ingredients allows to design finite lattice constellations of Low-Density Construction-A (LDA) lattices whose numerically measured waterfall region is situated at less than 0:8 dB from Shannon capacity. The LDA lattices embedded inside our Leech constellations are based on dual-diagonal non-binary low-density parity-check codes. A detailed explanation on how to perform encoding and demapping is given. A very appreciable feature of the proposed Leech constellations is that encoding, decoding, and demapping have all linear complexity in the blocklength.

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 "neural lattice decoders"):
  with members:
    - "a neural network lattice decoding algorithm"
    - "learning to decode linear codes using deep learning"
    - "construction of capacity achieving lattice codes polar lattices"
    - "low density lattice codes"

Connected through hyperedge HE-3 (induced by source paper "repeat accumulate signal codes"):
  with members:
    - "on the design of multi dimensional irregular repeat accumulate lattice codes"
    - "turbo lattices construction and error decoding performance"
    - "threshold improvement of low density lattice codes via spatial coupling"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "on the design of multi dimensional irregular repeat accumulate lattice codes"):
  with members:
    - "lattice partition multiple access a new method of downlink non orthogonal multiuser transmissions"
    - "construction of full diversity ldpc lattices for block fading channels"
    - "lattice index coding"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "lattice index codes from algebraic number fields"
    - "lattices over eisenstein integers for compute and forward"
    - "low density lattice codes"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "probabilistic shaping and non binary codes"):
  with members:
    - "experimental demonstration of capacity increase and rate adaptation by probabilistically shaped 64 qam"
    - "constant composition distribution matching"
    - "how to achieve the capacity of asymmetric channels"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "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)