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: "a modified kz reduction algorithm"
  Abstract: The Korkine-Zolotareff (KZ) reduction has been used in communications and cryptography. In this paper, we modify a very recent KZ reduction algorithm proposed by Zhang et al., resulting in a new algorithm, which can be much faster and more numerically reliable, especially when the basis matrix is ill conditioned.

Connected through hyperedge HE-1 (induced by source paper "some properties of successive minima and their applications"):
  with members:
    - "integer forcing architectures for uplink cloud radio access networks"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "integer forcing source coding"
    - "an algebraic approach to physical layer network coding"
    - "partial lll reduction"
    - "integer forcing linear receivers"

Connected through hyperedge HE-2 (induced by source paper "on the kz reduction"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "boosted kz and lll algorithms"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "successive integer forcing and its sum rate optimality"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "on the proximity factors of lattice reduction aided decoding"

Connected through hyperedge HE-3 (induced by source paper "boosted kz and lll algorithms"):
  with members:
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "on the proximity factors of lattice reduction aided decoding"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

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)