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: "success probability of the babai estimators for box constrained integer linear models"
  Abstract: To estimate the box-constrained integer parameter vector $\hbx$ in a linear model, a typical method is to solve a box-constrained integer least squares (BILS) problem. However, due to its high complexity, the box-constrained Babai integer point $\x^\sBB$ is commonly used as a suboptimal solution. #R##N#First we derive formulas for the success probability $P^\sBB$ of $\x^\sBB$ and the success probability $P^\sOB$ of the ordinary Babai integer point $\x^\sOB$ when $\hbx$ is uniformly distributed over the constraint box. Some properties of $P^\sBB$ and $P^\sOB$ and the relationship between them are studied. #R##N#Then we investigate the effects of some column permutation strategies on $\P^\sBB$. The V-BLAST and SQRD column permutation strategies are often used to get better Babai integer points. The permutation strategy involved in the well-known LLL lattice reduction, to be referred to as LLL-P, can also be used for this purpose. On the one hand we show that under a condition LLL-P always increases $P^\sBB$ and argue why both V-BLAST and SQRD often increase $P^\sBB$ under the same condition; and on the other hand we show that under an opposite condition LLL-P always decreases $P^\sBB$ and argue why both V-BLAST and SQRD often decrease $P^\sBB$ under the same condition. We also derive a column permutation invariant bound on $P^\sBB$, which is an upper bound and a lower bound under the two opposite conditions, respectively. Numerical results will be given to demonstrate our findings. #R##N#Finally we consider a conjecture concerning the ordinary Babai integer point proposed by Ma et al. We first construct an example to show that the conjecture does not hold in general, and then show that the conjecture does hold under some conditions.

Connected through hyperedge HE-1 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction"):
  with members:
    - "on the kz reduction"
    - "boosted kz and lll algorithms"
    - "gfclll a greedy selection based approach for fixed complexity lll reduction"
    - "on the geometric ergodicity of metropolis hastings algorithms for lattice gaussian sampling"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "on the proximity factors of lattice reduction aided decoding"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "communication over mimo broadcast channels using lattice basis reduction"

Connected through hyperedge HE-2 (induced by source paper "an optimal condition of robust low rank matrices recovery"):
  with members:
    - "nonconvex regularization based sparse recovery and demixing with application to color image inpainting"
    - "nearly optimal bounds for orthogonal least squares"
    - "nonconvex nonsmooth low rank minimization via iteratively reweighted nuclear norm"
    - "sparse representation of a polytope and recovery of sparse signals and low rank matrices"
    - "sharp rip bound for sparse signal and low rank matrix recovery"

Connected through hyperedge HE-3 (induced by source paper "closed form word error rate analysis for successive interference cancellation decoders"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "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-4 (induced by source paper "effects of some lattice reductions on the success probability of the zero forcing decoder"):
  with members:
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "lll reduction achieves the receive diversity in mimo decoding"

Connected through hyperedge HE-5 (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"
    - "a modified kz reduction algorithm"
    - "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-6 (induced by source paper "a kz reduction algorithm"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "an efficient optimal algorithm for the successive minima problem"
    - "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-7 (induced by source paper "an efficient optimal algorithm for the successive minima problem"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "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"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"

Connected through hyperedge HE-8 (induced by source paper "gfclll a greedy selection based approach for fixed complexity lll reduction"):
  with members:
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "on the limitations of the naive lattice decoding"

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)