human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "channel estimation for one bit massive mimo systems exploiting spatio temporal correlations"
  Abstract: Massive multiple-input multiple-output (MIMO) can improve the overall system performance significantly. Massive MIMO systems, however, may require a large number of radio frequency (RF) chains that could cause high cost and power consumption issues. One of promising approaches to resolve these issues is using low-resolution analog-to-digital converters (ADCs) at base stations. Channel estimation becomes a difficult task by using low-resolution ADCs though. This paper addresses the channel estimation problem for massive MIMO systems using one-bit ADCs when the channels are spatially and temporally correlated. Based on the Bussgang decomposition, which reformulates a non-linear one-bit quantization to a statistically equivalent linear operator, the Kalman filter is used to estimate the spatially and temporally correlated channel by assuming the quantized noise follows a Gaussian distribution. Numerical results show that the proposed technique can improve the channel estimation quality significantly by properly exploiting the spatial and temporal correlations of channels.

Connected through hyperedge HE-1 (induced by source paper "channel estimation for spatially temporally correlated massive mimo systems with one bit adcs"):
  with members:
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "bayes optimal joint channel and data estimation for massive mimo with low precision adcs"
    - "hybrid architectures with few bit adc receivers achievable rates and energy rate tradeoffs"
    - "mixed adc massive mimo detectors performance analysis and design optimization"
    - "channel estimation in broadband millimeter wave mimo systems with few bit adcs"
    - "near maximum likelihood detector and channel estimator for uplink multiuser massive mimo systems with one bit adcs"
    - "channel estimation techniques for quantized distributed reception in mimo systems"
    - "massive mimo for next generation wireless systems"

Connected through hyperedge HE-2 (induced by source paper "few bit csi acquisition for centralized cell free massive mimo with spatial correlation"):
  with members:
    - "on the uplink throughput of zero forcing in cell free massive mimo with coarse quantization"
    - "cell free massive mimo with limited backhaul"
    - "enhanced max min sinr for uplink cell free massive mimo systems"
    - "recent advances in cloud radio access networks system architectures key techniques and open issues"
    - "cell free massive mimo versus small cells"

Question: Please tell me which class the center node 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)