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 uplink achievable rate for massive mimo with 1 bit adc and superimposed pilots"):
  Abstract: In this paper, a superimposed pilot scheme for massive multiple-input multiple-output uplink transmission with 1-bit analog-to-digital converters (ADCs) at the base station (BS) is considered. Due to the intractable complexity of obtaining true bounds on the data rate, we thus derive an approximate lower bound on the achievable data rate while assuming the BS employs the linear minimum mean square error channel estimator and maximum ratio combining receiver. The derived bound is shown to be nearly tight when the number of users is large or operating in the low signal-to-noise ratio (SNR) regime. We also obtain the closed-form expression of the optimal pilot-data power allocation maximizing the data rate. Although there is a performance gap between the quantized and unquantized (i.e., with infinite-resolution ADCs) systems, it is shown that this gap diminishes when the number of BS antennas is asymptotically large. We show that when the received pilot symbols are removed from the received signal (utilizing the estimated channel) for the data detection process, the increase in data rate is not significant when compared with the no-pilot-removal case, especially in the regimes of low SNR and a large number of users. We present some numerical results to corroborate our theoretical findings, and the insights are provided for further exploration of the quantized systems with superimposed pilots.

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 "superimposed pilots are superior for mitigating pilot contamination in massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint frame design and resource allocation for ultra reliable and low latency vehicular networks")
  Member "blind estimation of sparse broadband massive mimo channels with ideal and one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint channel estimation decoding with frequency selective channels and few bit adcs")
  Member "uplink performance of wideband massive mimo with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "a regression approach to certain information transmission problems")
  Member "an overview of signal processing techniques for millimeter wave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)