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: "effects of some lattice reductions on the success probability of the zero forcing decoder"
  Abstract: Zero-forcing (ZF) decoder is a commonly used approximation solution of the integer least squares problem which arises in communications and many other applications. Numerically simulations have shown that the LLL reduction can usually improve the success probability $P_{ZF}$ of the ZF decoder. In this paper, we first rigorously show that both SQRD and V-BLAST, two commonly used lattice reductions, have no effect on $P_{ZF}$. Then, we show that LLL reduction can improve $P_{ZF}$ when $n=2$, we also analyze how the parameter $\delta$ in the LLL reduction affects the enhancement of $P_{ZF}$. Finally, an example is given which shows that the LLL reduction decrease $P_{ZF}$ when $n\geq3$.

Connected through hyperedge HE-1 (induced by source paper "closed form word error rate analysis for successive interference cancellation decoders"):
  with members:
    - "success probability of the babai estimators for box constrained integer linear models"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "column reordering for box constrained integer least squares problems"
    - "lll reduction achieves the receive diversity in mimo decoding"
    - "on the limitations of the naive lattice decoding"

Connected through hyperedge HE-2 (induced by source paper "on the kz reduction"):
  with members:
    - "boosted kz and lll algorithms"
    - "a modified kz reduction algorithm"
    - "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 "a kz reduction algorithm"):
  with members:
    - "an efficient optimal algorithm for the successive minima problem"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "successive integer forcing and its sum rate 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"
    - "improved analysis of kannan s shortest lattice vector algorithm"

Connected through hyperedge HE-4 (induced by source paper "on the success probability of the box constrained rounding and babai detectors"):
  with members:
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"

Connected through hyperedge HE-5 (induced by source paper "an efficient optimal algorithm for the successive minima problem"):
  with members:
    - "on the kz reduction"
    - "boosted kz and lll algorithms"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "compute compress and forward exploiting asymmetry of wireless relay networks"
    - "full diversity unitary precoded integer forcing"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"

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)