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 "efficient optimal joint channel estimation and data detection for massive mimo systems"):
  Abstract: In this paper, we propose an efficient optimal joint channel estimation and data detection algorithm for massive MIMO wireless systems. Our algorithm is optimal in terms of the generalized likelihood ratio test (GLRT). For massive MIMO systems, we show that the expected complexity of our algorithm grows polynomially in the channel coherence time. Simulation results demonstrate significant performance gains of our algorithm compared with suboptimal non-coherent detection algorithms. To the best of our knowledge, this is the first algorithm which efficiently achieves GLRT-optimal non-coherent detections for massive MIMO systems with general constellations.

Includes members:
  Member "optimality of large mimo detection via approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "joint channel and data estimation for large mimo systems with low precision adcs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low snr asymptotic rates of vector channels with one bit outputs")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "optimal non coherent data detection for massive simo wireless systems a polynomial complexity solution":
    also connected through other hyperedges:
      (none)
  Member "blind pilot decontamination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")
  Member "massive mimo and small cells improving energy efficiency by optimal soft cell coordination":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a data aided channel estimation scheme for decoupled systems in heterogeneous networks")
  Member "massive mu mimo downlink tdd systems with linear precoding and downlink pilots":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "channel estimation method and phase shift design for reconfigurable intelligent surface assisted mimo networks")
  Member "massive mimo how many antennas do we need":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "decentralized equalization with feedforward architectures for massive mu mimo")

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)