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: "lattices over eisenstein integers for compute and forward"
  Abstract: In this paper, we consider the use of lattice codes over Eisenstein integers for implementing a compute-and-forward protocol in wireless networks when channel state information is not available at the transmitter. We extend the compute-and-forward paradigm of Nazer and Gastpar to decoding Eisenstein integer combinations of transmitted messages at relays by proving the existence of a sequence of pairs of nested lattices over Eisenstein integers in which the coarse lattice is good for covering and the fine lattice can achieve the Poltyrev limit. Using this result, we show that both the outage performance and error-correcting performance of nested lattice codebooks over Eisenstein integers surpasses lattice codebooks over integers considered by Nazer and Gastpar with no additional computational complexity.

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 "secure modulo sum via multiple access channel"):
  with members:
    - "secure computation and forward with linear codes"
    - "secure physical layer network coding versus secure network coding"
    - "physical layer network coding a random coding error exponent perspective"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "on secure computation over the binary modulo 2 adder multiple access wiretap channel"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "secure compute and forward in a bidirectional relay"
    - "adaptive compute and forward with lattice codes over algebraic integers"

Connected through hyperedge HE-3 (induced by source paper "ring compute and forward over block fading channels"):
  with members:
    - "boosted kz and lll algorithms"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "universal lattice codes for mimo channels"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-4 (induced by source paper "low complexity coefficient selection algorithms for compute and forward"):
  with members:
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "efficient integer coefficient search for compute and forward"
    - "cell free massive mimo versus small cells"
    - "compute and forward in cell free massive mimo great performance with low backhaul load"
    - "a linearithmic time algorithm for a shortest vector problem in compute and forward design"
    - "cell free massive mimo uniformly great service for everyone"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "a multilevel framework for lattice network coding"

Connected through hyperedge HE-5 (induced by source paper "on the design of multi dimensional irregular repeat accumulate lattice codes"):
  with members:
    - "leech constellations of construction a lattices"
    - "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"
    - "low density lattice codes"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "compute and forward for block fading channels via algebraic lattice codes"):
  with members:
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "an algebraic approach to physical layer network coding"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-7 (induced by source paper "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"):
  with members:
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "a joint typicality approach to algebraic network information theory"
    - "secure compute and forward in a bidirectional relay"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiple access via compute and forward"
    - "uplink downlink duality for integer forcing"
    - "successive integer forcing and its sum rate optimality"

Connected through hyperedge HE-8 (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"
    - "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"

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)