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 "approximate gram matrix interpolation for wideband massive mu mimo systems"):
  Abstract: Numerous linear and non-linear data-detection and precoding algorithms for wideband massive multi-user (MU) multiple-input multiple-output (MIMO) wireless systems that rely on orthogonal frequency-division multiplexing (OFDM) or single-carrier frequency-division multiple access (SC-FDMA) require the computation of the Gram matrix for each active subcarrier. Computing the Gram matrix for each active subcarrier, however, results in excessively high computational complexity. In this paper, we propose novel, approximate algorithms that significantly reduce the complexity of Gram-matrix computation by simultaneously exploiting correlation across subcarriers and channel hardening. We show analytically that a small fraction of Gram-matrix computations in combination with approximate interpolation schemes are sufficient to achieve near-optimal error-rate performance at low computational complexity in massive MU-MIMO systems. We also demonstrate that the proposed methods exhibit improved robustness against channel-estimation errors compared to exact Gram-matrix interpolation algorithms that typically require high computational complexity.

Includes members:
  Member "on the performance of mismatched data detection in large mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decentralized equalization with feedforward architectures for massive mu mimo")
  Member "large scale mimo detection for 3gpp lte algorithms and fpga implementations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decentralized equalization with feedforward architectures for massive mu mimo")
  Member "conjugate gradient based soft output detection and precoding in massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a proximal jacobian admm approach for fast massive mimo signal detection in low latency communications")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "channel hardening exploiting message passing chemp receiver in large scale mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")
  Member "massive mimo how many antennas do we need":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)