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: "energy efficient optimization of wireless powered 5g full duplex cellular networks a mean field game approach"
  Abstract: This paper studies the power allocation of an ultra-dense cellular network consisting of multiple full-duplex (FD) base stations (BSs) serving a large number of half-duplex (HD) user equipments (UEs) located in a wide geographical area. Each BS consists of a baseband unit (BBU) that is responsible for signal processing and base station control, and a radio remote unit (RRU) that corresponds to a radio transceiver remotely built closer to the UEs. We consider a wireless-powered cellular network in which the BBU can periodically charge the RRU. We model the energy efficiency and coverage optimization problem for this network as a mean field game. We consider the weighted energy efficiency of the BS as the main performance metrics and evaluate the optimal strategy that can be adopted by the FD BSs in an ultra-dense network setting. Based on the interference and network energy efficiency models of the mean field game theory, Nash equilibrium of our proposed game is derived. Utilizing solutions of Hamilton-Jacobi-Bellman (HJB) and Fokker-Planck-Kolmogorov (FPK) equations, a new power transmission strategy is developed for the BSs to optimize the energy efficiency of 5G cellular networks with full duplex transmissions. Simulation results indicate that the proposed strategy not only improves the energy efficiency but also ensures the average network coverage probability converges to a stable level.

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.NI(Networking and Internet Architecture)