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: "massive mimo asymptotics for ray based propagation channels"
  Abstract: Favorable propagation (FP) and channel hardening (CH) are desired properties in massive multiple-input multiple-output (MIMO) systems. To date, these properties have primarily been analyzed for classical \textit{statistical} channel models, or \textit{ray-based} models with very specific angular parameters and distributions. This paper presents a thorough mathematical analysis of the asymptotic system behavior for ray-based channels with \textit{arbitrary} ray distributions, and considers \textit{two} types of antenna array structures at the cellular base station: a uniform linear array (ULA) and a uniform planar array (UPA). In addition to FP and channel hardening, we analyze the \textit{large system potential} (LSP) which measures the asymptotic ratio of the expected power in the desired channel to the expected total interference power when both the antenna and user numbers grow. LSP is said to hold when this ratio converges to a positive constant. The results demonstrate that while FP is guaranteed in ray-based channels, CH may or may not occur depending on the nature of the model. Furthermore, we demonstrate that LSP will not normally hold as the expected interference power grows logarithmically for both ULAs and UPAs relative to the power in the desired channel as the system size increases. Nevertheless, we identify some fundamental and attractive properties of massive MIMO in this limiting regime.

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)