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 "a kz reduction algorithm"):
  Abstract: The Korkine-Zolotareff (KZ) reduction is one of the often used reduction strategies for decoding lattices. A KZ reduction algorithm involves solving shortest vector problems (SVPs) and basis expansion. In this paper, first we improve the commonly used Schnorr-Euchner search strategy for solving SVPs. Then, we derive upper bounds on the magnitudes of the entries of any solution of a SVP when its basis matrix is LLL reduced. These upper bounds only involve the parameter of the LLL reduction and the dimension of the solution and they are useful for analyzing the complexity of the basis expansion in a KZ reduction algorithm. Finally, we modify the basis expansion method proposed by Zhang et al. and combine it with the improved Schnorr-Euchner search strategy to give a new KZ reduction algorithm. Simulation results show that the new KZ reduction algorithm is much faster and numerically more stable than the KZ reduction algorithm proposed by Zhang et al., especially when the basis matrix is ill conditioned.

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 "an efficient optimal algorithm for the successive minima problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "successive integer forcing and its sum rate optimality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "integer forcing mimo linear receivers based on lattice reduction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "closed form word error rate analysis for successive interference cancellation decoders")
  Member "on the proximity factors of lattice reduction aided decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "improved analysis of kannan s shortest lattice vector algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "improved provable algorithms for the shortest vector problem via bounded distance decoding")

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)