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: "linear massive mimo precoders in the presence of phase noise a large scale analysis"
  Abstract: We study the impact of phase noise on the downlink performance of a multi-user multiple-input multiple-output system, where the base station (BS) employs a large number of transmit antennas $M$. We consider a setup where the BS employs $M_{\mathrm{osc}}$ free-running oscillators, and $M/M_{\mathrm{osc}}$ antennas are connected to each oscillator. For this configuration, we analyze the impact of phase noise on the performance of the regularized zero-forcing (RZF), when $M$ and the number of users $K$ are asymptotically large, while the ratio $M/K=\beta$ is fixed. We analytically show that the impact of phase noise on the signal-to-interference-plus-noise ratio (SINR) can be quantified as an effective reduction in the quality of the channel state information available at the BS when compared to a system without phase noise. As a consequence, we observe that as $M_{\mathrm{osc}}$ increases, the SINR performance of all considered precoders degrades. On the other hand, the variance of the random phase variations caused by the BS oscillators reduces with increasing $M_{\mathrm{osc}}$. Through Monte-Carlo simulations, we verify our analytical results, and compare the performance of the precoders for different phase noise and channel noise variances. For all considered precoders, we show that when $\beta$ is small, the performance of the setup where all BS antennas are connected to a single oscillator is superior to that of the setup where each BS antenna has its own oscillator. However, the opposite is true when $\beta$ is large and the signal-to-noise ratio at the users is low.

Connected through hyperedge HE-1 (induced by source paper "achievable rate of rician large scale mimo channels with transceiver hardware impairments"):
  with members:
    - "on the ergodic capacity of mimo free space optical systems over turbulence channels"
    - "asymptotic analysis of su mimo channels with transmitter noise and mismatched joint decoding"
    - "uplink performance of time reversal mrc in massive mimo systems subject to phase noise"
    - "massive mimo with non ideal arbitrary arrays hardware scaling laws and circuit aware design"
    - "power scaling of uplink massive mimo systems with arbitrary rank channel means"
    - "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits"
    - "on the mimo capacity with residual transceiver hardware impairments"
    - "capacity limits and multiplexing gains of mimo channels with transceiver impairments"

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)