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: "time constrained temporal logic control of multi affine systems"
  Abstract: In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically co-safe linear temporal logic formulas over rectangular regions in the state space. The proposed algorithm is based on the estimation of time bounds for facet reachability problems and solving a time optimal reachability problem on the product between a weighted transition system and an automaton that enforces the satisfaction of the specification. A random optimization algorithm is used to iteratively improve the solution.

Connected through hyperedge HE-1 (induced by source paper "control of multi agent systems with finite time control barrier certificates and temporal logic"):
  with members:
    - "safety barrier certificates for heterogeneous multi robot systems"
    - "the robotarium a remotely accessible swarm robotics research testbed"
    - "automata theory meets barrier certificates temporal logic verification of nonlinear systems"
    - "multi robot deployment from ltl specifications with reduced communication"

Connected through hyperedge HE-2 (induced by source paper "control synthesis for multi agent systems under metric interval temporal logic specifications"):
  with members:
    - "timed automata approach for motion planning using metric interval temporal logic"
    - "cooperative planning for coupled multi agent systems under timed temporal specifications"
    - "cooperative task planning of multi agent systems under timed temporal specifications"
    - "computational methods for stochastic control with metric interval temporal logic specifications"
    - "on mitl and alternating timed automata"
    - "multi robot deployment from ltl specifications with reduced communication"

Connected through hyperedge HE-3 (induced by source paper "cooperative planning for coupled multi agent systems under timed temporal specifications"):
  with members:
    - "timed automata approach for motion planning using metric interval temporal logic"
    - "decentralized abstractions for multi agent systems under coupled constraints"
    - "optimal mission planner with timed temporal logic constraints"
    - "cooperative task planning of multi agent systems under timed temporal specifications"
    - "robust connectivity analysis for multi agent systems"
    - "computational methods for stochastic control with metric interval temporal logic specifications"
    - "optimal multi robot path planning with temporal logic constraints"
    - "multi robot deployment from ltl specifications with reduced communication"

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)