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: "distributed multi user wireless charging power allocation"
  Abstract: Wireless power charging enables portable devices to be permanently unplugged. Due to its low transmission power and low transmission efficiency, it requires much longer time slot to charge users compared with that for data transmission in wireless communication networks. Besides, each user's demand urgency needs to be taken into consideration for power allocation. Therefore, new algorithms are essential for wireless power allocation in multi-user wireless charging networks. In this paper, this problem is formulated as a static noncooperative game. It is shown that there exists a unique Nash equilibrium, which is the static state of the wireless power charging network. A distributed power allocation algorithm is proposed to compute the Nash equilibrium of the game. The main result of the paper consists of rigorous analysis of the distributed algorithm for power allocation. The algorithm is shown to converge to Nash equilibrium of the game with exponentially convergence rate for arbitrary initial value with synchronous scheduling. Moreover, the distributed algorithm is also convergence guaranteed with asynchronous scheduling under communication delay and packet drops. Numerical simulations prove the correctness of the analysis and demonstrate the fast convergence of the algorithm and the robustness to synchronous scheduling.

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)