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 "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"):
  Abstract: A particular instance of the shortest vector problem (SVP) appears in the context of compute-and-forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order    $O(n\psi \log (n\psi ))$   , where    $\psi = \sqrt {P\|{\text{h}}\|^{2}+1}$    depends on the transmission power and the norm of the channel vector. We will then extend our results to integer-forcing and finally introduce a more general class of lattices for which the SVP and the closest vector problem can be approximated within a constant factor.

Includes members:
  Member "low complexity coefficient selection algorithms for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compute and forward in cell free massive mimo great performance with low backhaul load")
  Member "efficient integer coefficient search for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "a linearithmic time algorithm for a shortest vector problem in compute and forward design":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low complexity coefficient selection algorithms for compute and forward")
  Member "a low complexity message recovery method for compute and forward relaying":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decoding in compute and forward relaying real lattices and the flatness of lattice sums")
  Member "asymmetric compute and forward with csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized compute compress and forward")
  Member "an efficient algorithm for optimally solving a shortest vector problem in compute and forward protocol design":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "success probability of the babai estimators for box constrained integer linear models")
  Member "compute and forward protocol design based on improved sphere decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a linearithmic time algorithm for a shortest vector problem in compute and forward design")
  Member "simplified compute and forward and its performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "integer forcing message recovering in interference channels")

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)