human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "efficient integer coefficient search for compute and forward"):
  Abstract: Integer coefficient selection is an important decoding step in the implementation of compute-and-forward (C-F) relaying scheme. Choosing the optimal integer coefficients in C-F has been shown to be a shortest vector problem, which is known to be NP-hard in its general form. Exhaustive search of the integer coefficients is only feasible in complexity for small number of users while approximation algorithms, such as Lenstra–Lenstra–Lovasz lattice reduction algorithm, only find a vector within an exponential factor of the shortest vector. An optimal deterministic algorithm was proposed for C-F by Sahraei and Gastpar specifically for the real valued channel case. In this paper, we adapt their idea to the complex valued channel and propose an efficient search algorithm to find the optimal integer coefficient vectors over the ring of Gaussian integers and the ring of Eisenstein integers. A second algorithm is then proposed that generalizes our search algorithm to the integer-forcing multiple-input multiple-output (MIMO) C-F receiver. Performance and efficiency of the proposed algorithms are evaluated through simulations and theoretical analysis.

Includes members:
  Member "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "a linearithmic time algorithm for a shortest vector problem in compute and forward design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low complexity coefficient selection algorithms for compute and forward")
  Member "adaptive compute and forward with lattice codes over algebraic integers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure modulo sum via multiple access channel")
  Member "compute and forward finding the best equation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "asymptotically optimal scheduling for compute and forward")
  Member "phase precoding for the compute and forward protocol":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compute compress and forward exploiting asymmetry of wireless relay networks")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "integer forcing mimo linear receivers based on lattice reduction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "integer forcing linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "private information retrieval over gaussian mac")

Question: Please tell me which class the source paper 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)