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 "a low complexity gaussian message passing iterative detector for massive mu mimo systems"):
  Abstract: This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) method over a pairwise graph for a massive Multiuser Multiple-Input Multiple-Output (MU-MIMO) system, in which a base station with M antennas serves K Gaussian sources simultaneously. Both K and M are large numbers and we consider the cases that K   (√2 − l)2. Therefore, a new convergent GMPID with equally low complexity called SA-GMPID is proposed, which converges to the MMSE detection for any K < M with a faster convergence speed. Finally, numerical results are provided to verify the validity and accuracy of the proposed theoretical results.

Includes members:
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "energy and spectral efficiency of very large multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "belief propagation based multi user detection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)