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: "a simple dft aided spatial basis expansion model and channel estimation strategy for massive mimo systems"
  Abstract: This paper proposes a new transmission strategy for the multiuser massive multiple-input multiple-output (MIMO) systems, including uplink/downlink channel estimation and user scheduling for data transmission. A discrete Fourier transform (DFT) aided spatial basis expansion model (SBEM) is first introduced to represent the uplink/downlink channels with much few parameter dimensions by exploiting angle reciprocity and the physical characteristics of the uniform linear array (ULA). With SBEM, both uplink and downlink channel estimation of multiuser can be carried out with very few amount of training resources, which significantly reduces the training overhead and feedback cost. Meanwhile, the pilot contamination problem in the uplink raining is immediately relieved by exploiting the spatial information of users. To enhance the spectral efficiency and to fully utilize the spatial resources, we also design a greedy user scheduling scheme during the data transmission period. Compared to existing low-rank models, the newly proposed SBEM offers an alternative for channel acquisition without need of channel statistics for both TDD and FDD systems based on the angle reciprocity. Moreover, the proposed method can be efficiently deployed by the fast Fourier transform (FFT). Various numerical results are provided to corroborate the proposed studies.

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)