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 "multipair massive mimo relaying systems with one bit adc s and dac s"):
  Abstract: This paper considers a multipair amplify-and-forward massive multipair multiple-input multiple-output relaying system with one-bit analog-to-digital converters and one-bit digital-to-analog converters at the relay. The channel state information is estimated via pilot training, and then utilized by the relay to perform simple maximum-ratio combining/maximum-ratio transmission processing. Leveraging on the Bussgang decomposition, an exact achievable rate is derived for the system with correlated quantization noise. Based on this, a closed-form asymptotic approximation for the achievable rate is presented, thereby enabling efficient evaluation of the impact of key parameters on the system performance. Furthermore, power scaling laws are characterized to study the potential energy efficiency associated with deploying massive one-bit antenna arrays at the relay. In addition, a power allocation strategy is designed to compensate for the rate degradation caused by the coarse quantization. Our results suggest that the quality of the channel estimates depends on the specific orthogonal pilot sequences that are used, contrary to unquantized systems where any set of orthogonal pilot sequences gives the same result. Moreover, the sum rate gap between the double-quantized relay system and an ideal nonquantized system is a moderate factor of    ${\text{4}}/\pi ^2$   in the low power regime.

Includes members:
  Member "throughput analysis of massive mimo uplink with low resolution adcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "channel estimation and performance analysis of one bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "achievable uplink rates for massive mimo with coarse quantization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hardware distortion correlation has negligible impact on ul massive mimo spectral efficiency")
  Member "bayes optimal joint channel and data estimation for massive mimo with low precision adcs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "downlink achievable rate analysis in massive mimo systems with one bit dacs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "adc bit allocation under a power constraint for mmwave massive mimo communication receivers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "antenna selection for large scale mimo systems with low resolution adcs")
  Member "mixed adc massive mimo uplink in frequency selective channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "massive mu mimo ofdm uplink with direct rf sampling and 1 bit adcs")
  Member "spectral efficiency of mixed adc receivers for massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spectral efficiency of one bit sigma delta massive 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)