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: "asymptotic performance analysis of gsvd noma systems with a large scale antenna array"
  Abstract: This paper considers a multiple-input multiple-output (MIMO) downlink communication scenario with one base station and two users, where each user is equipped with m antennas and the base station is equipped with n antennas. To efficiently exploit the spectrum resources, we propose a transmission protocol which combines generalized singular value decomposition (GSVD) and non-orthogonal multiple access (NOMA). The average data rates achieved by the two users are adopted as performance metrics for evaluation of the proposed GSVD-NOMA scheme. In particular, we first characterize the limiting distribution of the squared generalized singular values of the two users' channel matrices for the asymptotic case where the numbers of transmit and receive antennas approach infinity. Then, we calculate the normalized average individual rates of the users in the considered asymptotic regime. Furthermore, we extend the proposed GSVD-NOMA scheme to the MIMO downlink communication scenario with more than two users by using a hybrid multiple access (MA) approach, where the base station first divides the users into different groups, then the proposed GSVD-NOMA scheme is implemented within each group, and different groups are allocated with orthogonal bandwidth resources. Finally, numerical results are provided to validate the effectiveness of the proposed GSVD-NOMA protocol, and the accuracy of the developed analytical results.

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)