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: "simplified compute and forward and its performance analysis"
  Abstract: The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference toward achieving higher network throughput. The CMF was primarily introduced by means of information theory tools. While there have been some recent works discussing different aspects of efficient and practical implementation of CMF, there are still some issues that are not covered. In this paper, we first introduce a method to decrease the implementation complexity of the CMF method. We then evaluate the exact outage probability of our proposed simplified CMF scheme, and hereby provide an upper bound on the outage probability of the optimum CMF in all SNR values, and a close approximation of its outage probability in low SNR regimes. We also evaluate the effect of the channel estimation error (CEE) on the performance of both optimum and our proposed simplified CMF by simulations. Our simulation results indicate that the proposed method is more robust against CEE than the optimum CMF method for the examples considered.

Connected through hyperedge HE-1 (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 linearithmic time algorithm for a shortest vector problem in compute and forward design"
    - "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"
    - "integer forcing mimo linear receivers based on lattice reduction"

Connected through hyperedge HE-2 (induced by source paper "integer forcing message recovering in interference channels"):
  with members:
    - "integer forcing and forward transceiver design for mimo multipair two way relaying"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "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-3 (induced by source paper "compute and forward finding the best equation"):
  with members:
    - "finding short vectors in a lattice of voronoi s first kind"
    - "linear time nearest point algorithms for coxeter lattices"
    - "enumerative lattice algorithms in any norm via m ellipsoid coverings"
    - "compute and forward harnessing interference through structured codes"
    - "joint physical layer coding and network coding for bi directional relaying"

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)