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: "aviation time minimization of uav for data collection over wireless sensor networks"
  Abstract: In this paper, we consider a scenario where an unmanned aerial vehicle (UAV) collects data from a set of sensors on a straight line. The UAV can either cruise or hover while communicating with the sensors. The objective is to minimize the UAV's total aviation time from a starting point to a destination while allowing each sensor to successfully upload a certain amount of data using a given amount of energy. The whole trajectory is divided into non-overlapping data collection intervals, in each of which one sensor is served by the UAV. The data collection intervals, the UAV's navigation speed and the sensors' transmit powers are jointly optimized. The formulated aviation time minimization problem is difficult to solve. We first show that when only one sensor node is present, the sensor's transmit power follows a water-filling policy and the UAV aviation speed can be found efficiently by bisection search. Then we show that for the general case with multiple sensors, the aviation time minimization problem can be equivalently reformulated as a dynamic programming (DP) problem. The subproblem involved in each stage of the DP reduces to handle the case with only one sensor node. Numerical results present insightful behaviors of the UAV and the sensors. Specifically, it is observed that the UAV's optimal speed is proportional to the given energy and the inter-sensor distance, but inversely proportional to the data upload requirement.

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)