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: "multiuser scheduling for minimizing age of information in uplink mimo systems"
  Abstract: This paper studies the user scheduling problem in a multiuser multiple-input multi-output (MIMO) status update system, in which multiple single-antenna devices aim to send their latest statuses to a multiple-antenna information-fusion access point (AP) via a shared wireless channel. The information freshness in the considered system is quantified by a recently proposed metric, termed age of information (AoI). Thanks to the extra spatial degrees-of-freedom brought about by the multiple antennas at the AP, multiple devices can be granted to transmit simultaneously in each time slot. We aim to seek the optimal scheduling policy that can minimize the network-wide AoI by optimally deciding which device or group of devices to be scheduled for transmission in each slot given the instantaneous AoI values of all devices at the beginning of the slot. To that end, we formulate the multiuser scheduling problem as a Markov decision process (MDP). We attain the optimal policy by resolving the formulated MDP problem and develop a low-complexity sub-optimal policy. Simulation results show that the proposed optimal and sub-optimal policies significantly outperform the state-of-the-art benchmark schemes.

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)