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: "communication over mimo broadcast channels using lattice basis reduction"
  Abstract: A new viewpoint for adopting the lattice reduction in communication over multiple-input multiple-output (MIMO) broadcast channels is introduced. Lattice basis reduction helps us to reduce the average transmitted energy by modifying the region which includes the constellation points. The new viewpoint helps us to generalize the idea of lattice-reduction-aided (LRA) preceding for the case of unequal-rate transmission, and obtain analytic results for the asymptotic behavior (signal-to-noise ratio (SNR) rarr infin) of the symbol error rate for the LRA precoding and the perturbation technique. Also, the outage probability for both cases of fixed-rate users and fixed sum rate is analyzed. It is shown that the LRA method, using the Lenstra-Lenstra-Lovasz (LLL) algorithm, achieves the optimum asymptotic slope of symbol error rate (called the precoding diversity).

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"
    - "on the proximity factors of lattice reduction aided decoding"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"

Connected through hyperedge HE-2 (induced by source paper "modulus zero forcing detection for mimo channels"):
  with members:
    - "fifty years of mimo detection the road to large scale mimos"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "faster recursions in sphere decoding"
    - "compute and forward harnessing interference through structured codes"
    - "lll reduction achieves the receive diversity in mimo decoding"

Connected through hyperedge HE-3 (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-4 (induced by source paper "uplink downlink duality for integer forcing"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "lattices over eisenstein integers for compute and forward"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing source coding"
    - "an algebraic approach to physical layer network coding"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-5 (induced by source paper "on complex lll algorithm for integer forcing linear receivers"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"
    - "asymptotic performance of linear receivers in mimo fading channels"
    - "compute and forward harnessing interference through structured codes"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "lll reduction achieves the receive diversity in mimo decoding"

Connected through hyperedge HE-6 (induced by source paper "proximity factors of lattice reduction aided precoding for multiantenna broadcast"):
  with members:
    - "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 "integer forcing mimo linear receivers based on lattice reduction"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "practical encoders and decoders for euclidean codes from barnes wall lattices"
    - "on the proximity factors of lattice reduction aided decoding"
    - "diversity of mmse mimo receivers"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"

Connected through hyperedge HE-8 (induced by source paper "integer forcing linear receivers"):
  with members:
    - "lattices over eisenstein integers for compute and forward"
    - "successive integer forcing and its sum rate optimality"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "an algebraic approach to physical layer network coding"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "achieving a vanishing snr gap to exact lattice decoding at a subexponential complexity"

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)