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: "trajectory optimization for cellular connected uav under outage duration constraint"
  Abstract: Enabling cellular access for unmanned aerial vehicles (UAVs) is a practically appealing solution to realize their high-quality communications with the ground for ensuring safe and efficient operations. In this paper, we study the trajectory design for a cellular-connected UAV that needs to fly from given initial to final locations, while communicating with the ground base stations (GBSs) subject to a minimum signal-to-noise ratio (SNR) requirement along its flight. However, due to various practical considerations such as GBSs' locations and coverage range as well as UAV's trajectory and mobility constraints, the SNR target may not be met at certain time periods during the flight, each termed as an outage duration. In this paper, we first propose a general outage cost function in terms of outage durations in the flight, which includes the two commonly used metrics, namely total outage duration and maximum outage duration as special cases. Based on it, we formulate a UAV trajectory optimization problem to minimize its mission completion time, subject to a constraint on the maximum tolerable outage cost. To tackle this challenging (non-convex) optimization problem, we first transform it into a tractable form and thereby reveal some useful properties of the optimal trajectory solution. Based on these properties, we further simplify the problem and propose efficient algorithms to check its feasibility and obtain optimal as well as low-complexity suboptimal solutions for it by leveraging graph theory and convex optimization techniques. Numerical results show that our proposed trajectory designs outperform that by the conventional method of dynamic programming, in terms of both performance and complexity.

Connected through hyperedge HE-1 (induced by source paper "mobility in the sky performance and mobility analysis for cellular connected uavs"):
  with members:
    - "capacity and coverage enhancement using long endurance tethered airborne base stations"
    - "trajectory design for cellular connected uav under outage duration constraint"
    - "interference management for cellular connected uavs a deep reinforcement learning approach"
    - "a vision of 6g wireless systems applications trends technologies and open research problems"
    - "cellular connectivity for uavs network modeling performance analysis and design guidelines"
    - "on the 3 d placement of airborne base stations using tethered uavs"
    - "drones in distress a game theoretic countermeasure for protecting uavs against gps spoofing"
    - "beyond 5g with uavs foundations of a 3d wireless cellular network"

Connected through hyperedge HE-2 (induced by source paper "radio map based 3d path planning for cellular connected uav"):
  with members:
    - "trajectory design for cellular connected uav under outage duration constraint"
    - "interference management for cellular connected uavs a deep reinforcement learning approach"
    - "connectivity aware uav path planning with aerial coverage maps"
    - "hybrid offline online design for uav enabled data harvesting in probabilistic los channel"
    - "3d trajectory optimization in rician fading for uav enabled data harvesting"
    - "cognitive uav communication via joint maneuver and power control"
    - "comp in the sky uav placement and movement optimization for multi user communications"
    - "exploiting noma for multi beam uav communication in cellular uplink"

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)