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 "one bit massive mimo channel estimation and high order modulations"):
  Abstract: We investigate the information-theoretic throughout achievable on a fading communication link when the receiver is equipped with one-bit analog-to-digital converters (ADCs). The analysis is conducted for the setting where neither the transmitter nor the receiver have a priori information on the realization of the fading channels. This means that channel-state information needs to be acquired at the receiver on the basis of the one-bit quantized channel outputs. We show that least-squares (LS) channel estimation combined with joint pilot and data processing is capacity achieving in the single-user, single-receive-antenna case. #R##N#We also investigate the achievable uplink throughput in a massive multiple-input multiple-output system where each element of the antenna array at the receiver base-station feeds a one-bit ADC. We show that LS channel estimation and maximum-ratio combining are sufficient to support both multiuser operation and the use of high-order constellations. This holds in spite of the severe nonlinearity introduced by the one-bit ADCs.

Includes members:
  Member "capacity analysis of one bit quantized mimo systems with transmitter channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  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 "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "throughput analysis of massive mimo uplink with low resolution adcs")
  Member "massive mimo with 1 bit adc":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "at low snr asymmetric quantizers are better":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "on the gain of joint processing of pilot and data symbols in stationary rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "short packets over block memoryless fading channels pilot assisted or noncoherent transmission")
  Member "mutual information of iid complex gaussian signals on block rayleigh faded channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal discrete spatial compression for beamspace massive mimo signals")
  Member "increased capacity per unit cost by oversampling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bandlimited communication with one bit quantization and oversampling transceiver design and performance evaluation")

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)