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 saving deployment algorithms of uav swarm for sustainable wireless coverage"
  Abstract: Recent years have witnessed increasingly more uses of Unmanned Aerial Vehicle (UAV) swarms for rapidly providing wireless coverage to ground users. Each UAV is constrained in its energy storage and wireless coverage, and it consumes most energy when flying to the top of the target area, leaving limited leftover energy for hovering at its deployed position and keeping wireless coverage. The literature largely overlooks this sustainability issue of deploying UAV swarm deployment, and we aim to maximize the minimum leftover energy storage among all the UAVs after their deployment. Our new energy-saving deployment problem captures that each UAV's wireless coverage is adjustable by its service altitude, and also takes the no-fly-zone (NFZ) constraint into account. Despite of this, we propose an optimal energy-saving deployment algorithm by jointly balancing heterogeneous UAVs' flying distances on the ground and final service altitudes in the sky. We show that a UAV with larger initial energy storage in the UAV swarm should be deployed further away from the UAV station. Moreover, when $n$ homogeneous UAVs are dispatched from different initial locations, we first prove that any two UAVs of the same initial energy storage will not fly across each other, and then design an approximation algorithm of complexity $n \log \frac{1}{\epsilon}$ to arbitrarily approach the optimum with error $\epsilon$. Finally, we consider that UAVs may have different initial energy storages, and we prove this problem is NP-hard. Despite of this, we successfully propose a heuristic algorithm to solve it by balancing the efficiency and computation complexity well.

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)