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: "adaptive compute and forward with lattice codes over algebraic integers"
  Abstract: We consider the compute-and-forward relay network with limited feedback. A novel scheme called adaptive compute-and-forward is proposed to exploit the channel knowledge by working with the best ring of imaginary quadratic integers. This is enabled by generalizing Construction A lattices to other rings of imaginary quadratic integers which may not form principal ideal domains and by showing such construction can produce good lattices for coding in the sense of Poltyrev and for MSE quantization. Since there are channel coefficients (complex numbers) which are closer to elements of rings of imaginary quadratic integers other than Gaussian and Eisenstein integers, by always working with the best ring among them, one expects to obtain a better performance than that provided by working over Gaussian or Eisenstein integers.

Connected through hyperedge HE-1 (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"
    - "lattices over eisenstein integers for compute and forward"

Connected through hyperedge HE-2 (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"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "lattices over eisenstein integers for compute and forward"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-3 (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"
    - "a multilevel framework for lattice network coding"
    - "compute and forward finding the best equation"

Connected through hyperedge HE-4 (induced by source paper "random ensembles of lattices from generalized reductions"):
  with members:
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "lattice index codes from algebraic number fields"
    - "semantically secure lattice codes for the gaussian wiretap channel"

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

Connected through hyperedge HE-6 (induced by source paper "universal lattice codes for mimo channels"):
  with members:
    - "random ensembles of lattices from generalized reductions"
    - "awgn goodness is enough capacity achieving lattice codes based on dithered probabilistic shaping"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "almost universal codes for fading wiretap channels"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "efficient integer coefficient search for compute and forward"):
  with members:
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "a linearithmic time algorithm for a shortest vector problem in compute and forward design"
    - "compute and forward finding the best equation"
    - "phase precoding for the compute and forward protocol"
    - "an algebraic approach to physical layer network coding"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "algebraic lattice codes achieve the capacity of the compound block fading channel"):
  with members:
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "fundamental limits of infinite constellations in mimo fading 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)