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: "on the proximity factors of lattice reduction aided decoding"
  Abstract: Lattice reduction-aided decoding (LRAD) features reduced decoding complexity and near-optimum performance in multiinput multioutput communications. In this paper, a quantitative error-rate analysis of LRAD is presented. To this aim, the proximity factors are defined to measure the worst-case losses in decoding distances associated with the decision region relative to infinite lattice decoding (ILD), namely, closest point search in an infinite lattice. Upper bounds on the proximity factors are derived, which are functions of the dimension n of the lattice alone. The study is then extended to the dual-basis reduction. It is found that the bounds for dual basis reduction may be smaller. Reasonably good bounds are derived in many cases. Proximity factors not only imply the same diversity order in fading channels, but also relate the error probabilities of ILD and LRAD.

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"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "scaling up mimo opportunities and challenges with very large arrays"
    - "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 "deterministic sampling decoding where sphere decoding meets lattice gaussian distribution"):
  with members:
    - "lattice gaussian sampling by markov chain monte carlo bounded distance decoding and trapdoor sampling"
    - "on the geometric ergodicity of metropolis hastings algorithms for lattice gaussian sampling"
    - "discrete gaussian sampling reduces to cvp and svp"
    - "optimized markov chain monte carlo for signal detection in mimo systems an analysis of the stationary distribution and mixing time"
    - "markov chain monte carlo algorithms for lattice gaussian sampling"
    - "massive mimo for next generation wireless systems"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "scaling up mimo opportunities and challenges with very large arrays"

Connected through hyperedge HE-3 (induced by source paper "improved upper bounds on the hermite and kz constants"):
  with members:
    - "on the kz reduction"
    - "boosted kz and lll algorithms"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "hybrid vector perturbation precoding the blessing of approximate message passing"):
  with members:
    - "boosted kz and lll algorithms"
    - "hybrid approximate message passing"
    - "on the performance of mismatched data detection in large mimo systems"
    - "channel pre inversion and max sinr vector perturbation for large scale broadcast channels"
    - "convergence analysis and assurance for gaussian message passing iterative detector in massive mu mimo systems"
    - "optimality of large mimo detection via approximate message passing"
    - "massive mimo for next generation wireless systems"
    - "expectation propagation for approximate bayesian inference"

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

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"
    - "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"
    - "improved analysis of kannan s shortest lattice vector algorithm"

Connected through hyperedge HE-7 (induced by source paper "boosted kz and lll algorithms"):
  with members:
    - "a modified kz reduction algorithm"
    - "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"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "fifty years of mimo detection the road to large scale mimos"):
  with members:
    - "large scale mimo detection for 3gpp lte algorithms and fpga implementations"
    - "an esprit based approach for 2 d localization of incoherently distributed sources in massive mimo systems"
    - "massive mimo for next generation wireless systems"
    - "what will 5g be"
    - "approximate bayesian probabilistic data association aided iterative detection for mimo systems using arbitrary m ary modulation"
    - "channel hardening exploiting message passing chemp receiver in large scale mimo systems"
    - "five disruptive technology directions for 5g"
    - "scaling up mimo opportunities and challenges with very large arrays"

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)