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: "hierarchical decomposition of ltl synthesis problem for nonlinear control systems"
  Abstract: This paper deals with the control synthesis problem for a continuous nonlinear dynamical system under a linear temporal logic (LTL) formula. The proposed solution is a top-down hierarchical decomposition of the control problem involving three abstraction layers of the problem, iteratively solved from the coarsest to the finest. The LTL planning is first solved on a small transition system only describing the regions of interest involved in the LTL formula. For each pair of consecutive regions of interest in the resulting accepting path satisfying the LTL formula, a discrete plan is then constructed in the partitioned workspace to connect these two regions while avoiding unsafe regions. Finally, an abstraction refinement approach is applied to synthesize a controller for the dynamical system to follow each discrete plan. The second main contribution, used in the third abstraction layer, is a new monotonicity-based method to overapproximate the finite-time reachable set of any continuously differentiable system. The proposed framework is demonstrated in simulation for a motion planning problem of a mobile robot modeled as a disturbed unicycle.

Connected through hyperedge HE-1 (induced by source paper "a sequential composition framework for coordinating multi robot behaviors"):
  with members:
    - "control barrier functions theory and applications"
    - "resilience by reconfiguration exploiting heterogeneity in robot teams"
    - "hierarchically consistent motion primitives for quadrotor coordination"
    - "composition of safety constraints with applications to decentralized fixed wing collision avoidance"
    - "fault tolerant control for networked mobile robots"
    - "fast and in sync periodic swarm patterns for quadrotors"
    - "control of multi agent systems with finite time control barrier certificates and temporal logic"
    - "survey of important issues in uav communication networks"

Connected through hyperedge HE-2 (induced by source paper "tira toolbox for interval reachability analysis"):
  with members:
    - "a benchmark problem in transportation networks"
    - "sampled data reachability analysis using sensitivity and mixed monotonicity"
    - "simulation based reachability analysis for nonlinear systems using componentwise contraction properties"
    - "sapo reachability computation and parameter synthesis of polynomial dynamical systems"
    - "mixed monotonicity of partial first in first out traffic flow models"

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.SY(Systems and Control)