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 "an efficient optimal algorithm for the successive minima problem"):
  Abstract: In many applications including integer-forcing linear multiple-input and multiple-output (MIMO) receiver design, one needs to solve a successive minima problem (SMP) on an $n$-dimensional lattice to get an optimal integer coefficient matrix $\A^\star\in \mathbb{Z}^{n\times n}$. In this paper, we first propose an efficient optimal SMP algorithm with an $\bigO(n^2)$ memory complexity. The main idea behind the new algorithm is it first initializes with a suitable suboptimal solution, which is then updated, via a novel algorithm with only $\bigO(n^2)$ flops in each updating, until $\A^{\star}$ is obtained. Different from existing algorithms which find $\A^\star$ column by column through using a sphere decoding search strategy $n$ times, the new algorithm uses a search strategy once only. We then rigorously prove the optimality of the proposed algorithm. Furthermore, we theoretically analyze its complexity. In particular, we not only show that the new algorithm is $\Omega(n)$ times faster than the most efficient existing algorithm with polynomial memory complexity, but also assert that it is even more efficient than the most efficient existing algorithm with exponential memory complexity. Finally, numerical simulations are presented to illustrate the optimality and efficiency of our novel SMP algorithm.

Includes members:
  Member "effects of some lattice reductions on the success probability of the zero forcing decoder":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "closed form word error rate analysis for successive interference cancellation decoders")
  Member "on the kz reduction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "boosted kz and lll algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution")
  Member "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "compute compress and forward exploiting asymmetry of wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized compute compress and forward")
  Member "full diversity unitary precoded integer forcing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "success probability of the babai estimators for box constrained integer linear models":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")

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)