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 performance of quantized transceiver in multiuser massive mimo downlinks"):
  Abstract: Low-resolution digital-to-analog converters (DACs) and analog-to-digital converters (ADCs) are considered to reduce cost and power consumption in multiuser massive multiple-input multiple-output (MIMO). Using the Bussgang theorem, we derive the asymptotic downlink achievable rate w.r.t the resolutions of both DACs and ADCs, i.e., $b_{DA}$ and $b_{AD}$, under the assumption of large antenna number, $N$, and fixed user load ratio, $\beta$. We characterize the rate loss caused by finite-bit-resolution converters and reveal that the quantization distortion is ignorable at low signal-to-noise ratio (SNR) even with low-resolution converters at both sides. While for maintaining the same rate loss at high SNR, it is discovered that one-more-bit DAC resolution is needed when more users are scheduled with $\beta$ increased by four times. More specifically for one-bit rate loss requirement, $b_{DA}$ can be set by $\left\lceil b_{AD}+\frac{1}{2}\log\beta \right\rceil$ given $b_{AD}$. Similar observations on ADCs are also obtained with numerical verifications.

Includes members:
  Member "analysis of one bit quantized precoding for the multiuser massive mimo downlink":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "hybrid architectures with few bit adc receivers achievable rates and energy rate tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  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 "low complexity hybrid precoding in massive multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")

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)