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: "a linearithmic time algorithm for a shortest vector problem in compute and forward design"
  Abstract: We propose an algorithm with expected complexity of $\bigO(n\log n)$ arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where $n$ is the dimension of the channel vector. This algorithm is more efficient than the best known algorithms with proved complexity.

Connected through hyperedge HE-1 (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"
    - "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"
    - "compute and forward finding the best equation"

Connected through hyperedge HE-2 (induced by source paper "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"):
  with members:
    - "low complexity coefficient selection algorithms for compute and forward"
    - "efficient integer coefficient search for compute and forward"
    - "a low complexity message recovery method for compute and forward relaying"
    - "asymmetric compute and forward with csit"
    - "an efficient algorithm for optimally solving a shortest vector problem in compute and forward protocol design"
    - "compute and forward protocol design based on improved sphere decoding"
    - "simplified compute and forward and its performance analysis"
    - "integer forcing mimo linear receivers based on lattice reduction"

Connected through hyperedge HE-3 (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"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "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-4 (induced by source paper "compute and forward in cell free massive mimo great performance with low backhaul load"):
  with members:
    - "low complexity coefficient selection algorithms for compute and forward"
    - "cell free massive mimo versus small cells"
    - "cell free massive mimo uniformly great service for everyone"
    - "compute and forward finding the best equation"
    - "an algebraic approach to physical layer network coding"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "compute and forward harnessing interference through structured 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)