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 "massive mimo with low resolution adcs"):
  Abstract: We investigate the information-theoretic throughput that is achievable over a fading communication link when the receiver is equipped with low-resolution analog-to-digital converters (ADCs). We focus on the case where neither the transmitter, nor the receiver have any a priori channel state information. This means that the fading realizations have to be learned through pilot transmission followed by channel estimation at the receiver, based on coarsely quantized observations. For the extreme case of one-bit ADCs and for the single-user single-input single-output case, we show that least squares (LS) estimation combined with joint pilot-data processing is optimal in terms of the achievable rate. We also investigate the uplink throughput achievable by a massive multiple-input multiple-output system in which the base station is equipped with low-resolution ADCs. We show that for the one-bit quantized case, LS estimation together with maximal ratio combing or zero-forcing detection is sufficient to support reliable multi-user transmission with high-order constellations. Numerical results show that the rates achievable in the infinite-precision (no quantization) case can be approached using ADCs with only a few bits of resolution. The robustness of the low-resolution ADC system against receive power imbalances between the different users, caused for example by imperfect power control, is also investigated.

Includes members:
  Member "channel estimation and performance analysis of one bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "bayes optimal joint channel and data estimation for massive mimo with low precision adcs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "mixed adc massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "one bit ofdm receivers via deep learning")
  Member "short packet communications over multiple antenna rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "mixed adc massive mimo detectors performance analysis and design optimization":
    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 "quantized precoding for massive mu mimo":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")

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)