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

Includes members:
  Member "lr aided mmse lattice decoding is dmt optimal for all approximately universal codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling lattice reduction and decoding optimization")
  Member "lll reduction achieves the receive diversity in mimo decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "on the limitations of the naive lattice decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling lattice reduction and decoding optimization")
  Member "towards the optimal amplify and forward cooperative diversity scheme":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "relay pair selection in buffer aided successive opportunistic relaying using a multi antenna source")

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)