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 "lr aided mmse lattice decoding is dmt optimal for all approximately universal codes"):
  Abstract: Currently for the nt x nr MIMO channel, any explicitly constructed space-time (ST) designs that achieve optimality with respect to the diversity multiplexing tradeoff (DMT) are known to do so only when decoded using maximum likelihood (ML) decoding, which may incur prohibitive decoding complexity. In this paper we prove that MMSE regularized lattice decoding, as well as the computationally efficient lattice reduction (LR) aided MMSE decoder, allows for efficient and DMT optimal decoding of any approximately universal lattice-based code. The result identifies for the first time an explicitly constructed encoder and a computationally efficient decoder that achieve DMT optimality for all multiplexing gains and all channel dimensions. The results hold irrespective of the fading statistics.

Includes members:
  Member "lll reduction achieves the receive diversity in mimo decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling lattice reduction and decoding optimization")
  Member "complex lattice reduction algorithm for low complexity mimo detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fifty years of mimo detection the road to large scale mimos")
  Member "multigroup decodable stbcs from clifford algebras":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "construction of block orthogonal stbcs and reducing their sphere decoding complexity")
  Member "approximately universal codes over slow fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "space time signal design for multilevel polar coding in slow fading broadcast 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)