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: "secure communication for spatially sparse millimeter wave massive mimo channels via hybrid precoding"
  Abstract: In this paper, we investigate secure communication over sparse millimeter-wave (mm-Wave) massive multiple-input multiple-output (MIMO) channels by exploiting the spatial sparsity of legitimate user's channel. We propose a secure communication scheme in which information data is precoded onto dominant angle components of the sparse channel through a limited number of radio-frequency (RF) chains, while artificial noise (AN) is broadcast over the remaining nondominant angles interfering only with the eavesdropper with a high probability. It is shown that the channel sparsity plays a fundamental role analogous to secret keys in achieving secure communication. Hence, by defining two statistical measures of the channel sparsity, we analytically characterize its impact on secrecy rate. In particular, a substantial improvement on secrecy rate can be obtained by the proposed scheme due to the uncertainty, i.e., "entropy", introduced by the channel sparsity which is unknown to the eavesdropper. It is revealed that sparsity in the power domain can always contribute to the secrecy rate. In contrast, in the angle domain, there exists an optimal level of sparsity that maximizes the secrecy rate. The effectiveness of the proposed scheme and derived results are verified by numerical simulations.

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)