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 "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.

Includes members:
  Member "an efficient algorithm for optimally solving a shortest vector problem in compute and forward protocol design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward")
  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-2 (induced by source paper "closed form word error rate analysis for successive interference cancellation decoders")
  Member "error performance of multidimensional lattice constellations part i a parallelotope geometry based approach for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "error performance of multidimensional lattice constellations part ii evaluation over fading channels")

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)