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 uav backscatter communication with joint trajectory design and resource optimization"
  Abstract: Backscatter communication which enables wireless-powered backscatter devices (BDs) to transmit information by reflecting incident signals, is an energy- and cost-efficient communication technology for Internet-of-Things. This paper considers an unmanned aerial vehicle (UAV)-assisted backscatter communication network (UBCN) consisting of multiple BDs and carrier emitters (CEs) on the ground as well as a UAV. A communicate-while-fly scheme is first designed, in which the BDs illuminated by their associated CEs transmit information to the flying UAV in a time-division-multiple-access manner. Considering the critical issue of the UAV's limited on-board energy and the CEs' transmission energy, we maximize the energy efficiency (EE) of the UBCN by jointly optimizing the UAV's trajectory, the BDs' scheduling, and the CEs' transmission power, subject to the BDs' throughput constraints and harvested energy constraints, as well as other practical constraints. Furthermore, we propose an iterative algorithm based on the block coordinated decent method to solve the formulated mixed-integer non-convex problem, in each iteration of which the variables are alternatively optimized by leveraging the cutting-plane technique, the Dinkelbach's method and the successive convex approximation technique. Also, the convergence and complexity of the proposed algorithm are analyzed. Finally, simulation results show that the proposed communicate-while-fly scheme achieves significant EE gains compared with the benchmark hover-and-fly scheme. Useful insights on the optimal trajectory design and resource allocation are also obtained.

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)