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 "channel estimation and data equalization in frequency selective mimo systems with one bit quantization"):
  Abstract: This paper addresses channel estimation and data equalization on frequency-selective 1-bit quantized Multiple Input-Multiple Output (MIMO) systems. No joint processing or Channel State Information is assumed at the transmitter, and therefore our findings are also applicable to the uplink of Multi-User MIMO systems. System models for both Orthogonal Division Frequency Multiplexing (OFDM) and single-carrier schemes are developed. A Cram\'er-Rao Lower Bound for the estimation problems is derived. The two nonlinear algorithms Expectation Maximization (EM) and Generalized Approximate Message Passing (GAMP) are adapted to the problems, and a linear method based on the Bussgang theorem is proposed. In the OFDM case, the linear method enables subcarrier-wise estimation, greatly reducing computational complexity. Simulations are carried out to compare the algorithms with different settings. The results turn out to be close to the Cram\'er-Rao bound in the low Signal to Noise Ratio (SNR) region. The OFDM setting is more suitable for the nonlinear algorithms, and that the linear methods incur a performance loss with respect to the nonlinear approaches. In the relevant low and medium SNR regions, the loss amounts to 2-3 dB and might well be justified in exchange for the reduced computational effort, especially in Massive MIMO settings.

Includes members:
  Member "bayes optimal joint channel and data estimation for massive mimo with low precision adcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "capacity analysis of one bit quantized mimo systems with transmitter channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  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 "five disruptive technology directions for 5g":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep learning enabled optimization of downlink beamforming under per antenna power constraints algorithms and experimental demonstration")
  Member "generalized approximate message passing for estimation with random linear mixing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

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)