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 "low snr asymptotic rates of vector channels with one bit outputs"):
  Abstract: We analyze the performance of multiple-input multiple-output (MIMO) links with one-bit output quantization in terms of achievable rates and characterize their performance loss compared to unquantized systems for general channel statistical models and general channel state information (CSI) at the receiver. One-bit ADCs are particularly suitable for large-scale millimeter wave MIMO Communications (massive MIMO) to reduce the hardware complexity. In such applications, the signal-to-noise ratio per antenna is rather low due to the propagation loss. Thus, it is crucial to analyze the performance of MIMO systems in this regime by means of information theoretical methods. Since an exact and general information-theoretic analysis is not possible, we resort to the derivation of a general asymptotic expression for the mutual information in terms of a second order expansion around zero SNR. We show that up to second order in the SNR, the mutual information of a system with two-level (sign) output signals incorporates only a power penalty factor of pi/2 (1.96 dB) compared to system with infinite resolution for all channels of practical interest with perfect or statistical CSI. An essential aspect of the derivation is that we do not rely on the common pseudo-quantization noise model.

Includes members:
  Member "gaussian multiple access channels with one bit quantizer at the receiver":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on multiterminal communication over mimo channels with one bit adcs at the receivers")
  Member "throughput analysis of massive mimo uplink with low resolution adcs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "uplink performance of wideband massive mimo with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "how much training is needed in one bit massive mimo systems at low snr":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "training for channel estimation in nonlinear multi antenna transceivers")
  Member "mixed adc massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a regression approach to certain information transmission problems")
  Member "channel estimation and uplink achievable rates in one bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "one bit ofdm receivers via deep learning")
  Member "one bit massive mimo channel estimation and high order modulations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")

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)