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 "asymptotic analysis of the performance of las algorithm for large mimo detection"):
  Abstract: In our recent work, we reported an exhaustive study on the simulated bit error rate (BER) performance of a low-complexity likelihood ascent search (LAS) algorithm for detection in large multiple-input multiple-output (MIMO) systems with large number of antennas that achieve high spectral efficiencies. Though the algorithm was shown to achieve increasingly closer to near maximum-likelihood (ML) performance through simulations, no BER analysis was reported. Here, we extend our work on LAS and report an asymptotic BER analysis of the LAS algorithm in the large system limit, where $N_t,N_r \to \infty$ with $N_t=N_r$, where $N_t$ and $N_r$ are the number of transmit and receive antennas. We prove that the error performance of the LAS detector in V-BLAST with 4-QAM in i.i.d. Rayleigh fading converges to that of the ML detector as $N_t,N_r \to \infty$.

Includes members:
  Member "belief propagation based decoding of large non orthogonal stbcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convergence and density evolution of a low complexity mimo detector based on forward backward recursion over a ring")
  Member "low complexity near ml decoding of large non orthogonal stbcs using reactive tabu search":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "groupwise neighbor examination for tabu search detection in large mimo systems")
  Member "high rate space time coded large mimo systems low complexity detection and channel estimation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fifty years of mimo detection the road to large scale mimos")
  Member "large mimo detection a low complexity detector at high spectral efficiencies":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "high rate space time coded large mimo systems low complexity detection and channel estimation")
  Member "reduced complexity sphere decoding for square qam via a new lattice representation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "full diversity precoding design of bit interleaved coded multiple beamforming with orthogonal frequency division multiplexing")
  Member "belief propagation based multi user detection":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity achieving mimo noma iterative lmmse detection")

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)