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: "compute and forward finding the best equation"
  Abstract: Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel fading state. Optimizing these coefficients is a Shortest Lattice Vector (SLV) problem. In general, the SLV problem is known to be prohibitively complex. In this paper, we show that the particular SLV instance resulting from the Compute-and-Forward problem can be solved in low polynomial complexity and give an explicit deterministic algorithm that is guaranteed to find the optimal solution.

Connected through hyperedge HE-1 (induced by source paper "asymptotically optimal scheduling for compute and forward"):
  with members:
    - "the necessity of scheduling in compute and forward"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-2 (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-3 (induced by source paper "the necessity of scheduling in compute and forward"):
  with members:
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "integer forcing linear receivers"
    - "enumerative lattice algorithms in any norm via m ellipsoid coverings"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "robust successive compute and forward over multi user multi relay networks"):
  with members:
    - "full diversity unitary precoded integer forcing"
    - "phase precoded compute and forward with partial feedback"
    - "lattices from codes for harnessing interference an overview and generalizations"
    - "compute and forward two way relaying"
    - "compute and forward on a multi user multi relay channel"
    - "successive integer forcing and its sum rate optimality"
    - "asynchronous physical layer network coding with quasi cyclic codes"
    - "convolutional network coded cooperation in multi source networks with a multi antenna relay"

Connected through hyperedge HE-5 (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"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "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-6 (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"
    - "a linearithmic time algorithm for a shortest vector problem in compute and forward design"
    - "cell free massive mimo uniformly great service for everyone"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "a linearithmic time algorithm for a shortest vector problem in compute and forward design"):
  with members:
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "compute and forward protocol design based on improved sphere decoding"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "lattice codes for many to one interference channels with and without cognitive messages"):
  with members:
    - "asymmetric compute and forward with csit"
    - "multiuser cognitive radio networks an information theoretic perspective"
    - "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
    - "is non unique decoding necessary"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"

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)