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: "large system analysis of massive mimo with optimal m mmse processing"
  Abstract: We consider the uplink of a Massive MIMO network with $L$ cells, each comprising a BS with $M$ antennas and $K$ single-antenna user equipments. Recently, \cite{BHS18A} studied the asymptotic spectral efficiency of such networks with optimal multicell minimum mean-squared error (M-MMSE) processing when $M\to \infty$ and $K$ is kept fixed. Remarkably, \cite{BHS18A} proved that, for practical channels with spatial correlation, the spectral efficiency grows unboundedly, even with pilot contamination. In this paper, we extend the analysis from \cite{BHS18A} to the alternative regime in which $M,K\to \infty$ with a given ratio. Tools from random matrix theory are used to compute low-complexity approximations which are proved to be asymptotically tight, but accurate for realistic system dimensions, as shown by simulations.

Connected through hyperedge HE-1 (induced by source paper "spatial characterization of holographic mimo channels"):
  with members:
    - "degrees of freedom of holographic mimo channels"
    - "beyond massive mimo the potential of data transmission with large intelligent surfaces"
    - "massive mimo has unlimited capacity"
    - "optimal pilot and payload power control in single cell massive mimo systems"
    - "space constrained massive mimo hitting the wall of favorable propagation"
    - "a generalized spatial correlation model for 3d mimo channels based on the fourier coefficients of power spectrums"
    - "on landau s eigenvalue theorem and information cut sets"
    - "optimal design of energy efficient multi user mimo systems is massive mimo the answer"

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)