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: "sapo reachability computation and parameter synthesis of polynomial dynamical systems"
  Abstract: Sapo is a C++ tool for the formal analysis of polynomial dynamical systems. Its main features are: 1) Reachability computation, i.e., the calculation of the set of states reachable from a set of initial conditions, and 2) Parameter synthesis, i.e., the refinement of a set of parameters so that the system satisfies a given specification. Sapo can represent reachable sets as unions of boxes, parallelotopes, or parallelotope bundles (symbolic representation of polytopes). Sets of parameters are represented with polytopes while specifications are formalized as Signal Temporal Logic (STL) formulas.

Connected through hyperedge HE-1 (induced by source paper "toward structured proofs for dynamic logics"):
  with members:
    - "the keymaera x proof ide concepts on usability in hybrid systems theorem proving"
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "a uniform substitution calculus for differential dynamic logic"
    - "satisfiability modulo odes"
    - "a complete axiomatization of quantified differential dynamic logic for distributed hybrid systems"
    - "the structure of differential invariants and differential cut elimination"

Connected through hyperedge HE-2 (induced by source paper "tira toolbox for interval reachability analysis"):
  with members:
    - "hierarchical decomposition of ltl synthesis problem for nonlinear control systems"
    - "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"
    - "mixed monotonicity of partial first in first out traffic flow models"

Connected through hyperedge HE-3 (induced by source paper "occupation measure methods for modelling and analysis of biological hybrid automata"):
  with members:
    - "a temporal logic approach to modular design of synthetic biological circuits"

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)