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 "channel estimation for spatially temporally correlated massive mimo systems with one bit adcs"):
  Abstract: This paper considers the channel estimation problem for massive multiple-input multiple-output (MIMO) systems that use one-bit analog-to-digital converters (ADCs). Previous channel estimation techniques for massive MIMO using one-bit ADCs are all based on single-shot estimation without exploiting the inherent temporal correlation in wireless channels. In this paper, we propose an adaptive channel estimation technique taking the spatial and temporal correlations into account for massive MIMO with one-bit ADCs. We first use the Bussgang decomposition to linearize the one-bit quantized received signals. Then, we adopt the Kalman filter to estimate the spatially and temporally correlated channels. Since the quantization noise is not Gaussian, we assume the effective noise as a Gaussian noise with the same statistics to apply the Kalman filtering. We also implement the truncated polynomial expansion-based low complexity channel estimator with negligible performance loss. Numerical results reveal that the proposed channel estimators can improve the estimation accuracy significantly by using the spatial and temporal correlations of channels.

Includes members:
  Member "channel estimation for one bit massive mimo systems exploiting spatio temporal correlations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "few bit csi acquisition for centralized cell free massive mimo with spatial correlation")
  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 "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 "hybrid architectures with few bit adc receivers achievable rates and energy rate tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "mixed adc massive mimo detectors performance analysis and design optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "channel estimation in broadband millimeter wave mimo systems with few bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "near maximum likelihood detector and channel estimator for uplink multiuser massive mimo systems with one bit adcs":
    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 "channel estimation techniques for quantized distributed reception in mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "near maximum likelihood detector and channel estimator for uplink multiuser massive mimo systems with one bit adcs")

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)