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: "downlink performance of superimposed pilots in massive mimo systems"
  Abstract: In this paper, we investigate the downlink throughput performance of a massive multiple-input multiple-output (MIMO) system that employs superimposed pilots for channel estimation. The component of downlink (DL) interference that results from transmitting data alongside pilots in the uplink (UL) is shown to decrease at a rate proportional to the square root of the number of antennas at the BS. The normalized mean-squared error (NMSE) of the channel estimate is compared with the Bayesian Cram\'{e}r-Rao lower bound that is derived for the system, and the former is also shown to diminish with increasing number of antennas at the base station (BS). Furthermore, we show that staggered pilots are a particular case of superimposed pilots and offer the downlink throughput of superimposed pilots while retaining the UL spectral and energy efficiency of regular pilots. We also extend the framework for designing a hybrid system, consisting of users that transmit either regular or superimposed pilots, to minimize both the UL and DL interference. The improved NMSE and DL rates of the channel estimator based on superimposed pilots are demonstrated by means of simulations.

Connected through hyperedge HE-1 (induced by source paper "massive mimo forward link analysis for cellular networks"):
  with members:
    - "massive mimo has unlimited capacity"
    - "modeling and analysis of cellular networks using stochastic geometry a tutorial"
    - "the meta distribution of the sir for cellular networks with power control"
    - "ergodic spectral efficiency in mimo cellular networks"
    - "wireless network signals with moderately correlated shadowing still appear poisson"
    - "no downlink pilots are needed in tdd massive mimo"
    - "analyzing uplink sinr and rate in massive mimo systems using stochastic geometry"
    - "the mean interference to signal ratio and its key role in cellular and amorphous networks"

Connected through hyperedge HE-2 (induced by source paper "covariance matrix estimation for massive mimo"):
  with members:
    - "massive mimo has unlimited capacity"
    - "superimposed pilots are superior for mitigating pilot contamination in massive mimo"
    - "massive mimo pilot decontamination and channel interpolation via wideband sparse channel estimation"
    - "massive mimo with imperfect channel covariance information"
    - "pilot contamination is not a fundamental asymptotic limitation in massive mimo"
    - "superimposed pilots are superior for mitigating pilot contamination in massive mimo part ii performance analysis and hybrid system design"
    - "massive mimo for next generation wireless systems"
    - "blind pilot decontamination"

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)