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 "on the capacity of massive mimo with 1 bit adcs and dacs at the receiver and at the transmitter"):
  Abstract: In this paper, we investigate the capacity of massive multiple-input multiple-output (MIMO) systems corrupted by complex-valued additive white Gaussian noise (AWGN) when both the transmitter and the receiver employ 1-bit digital-to-analog converters (DACs) and 1-bit analog-to-digital-converters (ADCs). As a result of 1-bit DACs and ADCs, the transmitted and received symbols, as well as the transmit- and receive-side channel state information (CSI), are assumed to be quantized to 1-bit of information. The derived results show that the capacity of the considered massive MIMO system is $2N$ and $2M$ bits per channel use when $N$ is fixed and $M\to\infty$ and when $M$ is fixed and $N\to\infty$, respectively, where $M$ and $N$ denote the number of transmit and receive antennas, respectively. These coincide with the respective capacities with full CSI at both the transmitter and the receiver. In both cases, we showed that the derived capacities can be achieved with noisy 1-bit CSI at the transmitter-end or at the receiver-end, and without any CSI at the other end. Moreover, we showed that the capacity can be achieved in one channel use without employing channel coding, which results in a latency of one channel use.

Includes members:
  Member "on mimo channel capacity with output quantization constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "a general framework for low resolution receivers for mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "uplink performance of wideband massive mimo with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "uplink achievable rate for massive mimo systems with low resolution adc":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "capacity analysis of one bit quantized mimo systems with transmitter channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "near maximum likelihood detector and channel estimator for uplink multiuser massive mimo systems with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "massive mimo with 1 bit adc":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "robust 1 bit compressive sensing via binary stable embeddings of sparse vectors":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "serial quantization for sparse time sequences")

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)