human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "inductive certificate synthesis for control design"):
  Abstract: The focus of this thesis is developing a framework for designing correct-by-construction controllers using control certificates. We use nonlinear dynamical systems to model the physical environment (plants). The goal is to synthesize controllers for these plants while guaranteeing formal correctness w.r.t. given specifications. We consider different fundamental specifications including stability, safety, and reach-while-stay. Stability specification states that the execution traces of the system remain close to an equilibrium state and approach it asymptotically. Safety specification requires the execution traces to stay in a safe region. Finally, for reach-while-stay specification, safety is needed until a target set is reached. #R##N#The design task consists of two phases. In the first phase, the control design problem is reduced to the question of finding a control certificate. More precisely, the goal of the first phase is to define a class of control certificates with a specific structure. This definition should guarantee the following: "Having a control certificate, one can systematically design a controller and prove its correctness at the same time." The goal in the second phase is to find such a control certificate. We define a potential control certificate space (hypothesis space) using parameterized functions. Next, we provide an inductive search framework to find proper parameters, which yield a control certificate. #R##N#Finally, we evaluate our framework. We show that discovering control certificates is practically feasible and demonstrate the effectiveness of the automatically designed controllers through simulations and real physical systems experiments.

Includes members:
  Member "learning control lyapunov functions from counterexamples and demonstrations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep learning tubes for tube mpc")
  Member "path following through control funnel functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning control lyapunov functions from counterexamples and demonstrations")
  Member "the reach avoid problem for constant rate multi mode systems":
    also connected through other hyperedges:
      (none)
  Member "automated formal synthesis of digital controllers for state space physical plants":
    also connected through other hyperedges:
      (none)
  Member "learning lyapunov potential functions from counterexamples and demonstrations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "episodic learning with control lyapunov functions for uncertain robotic systems")
  Member "a theory of formal synthesis via inductive learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analyzing cyber physical systems from the perspective of artificial intelligence")
  Member "counterexample guided synthesis of switched controllers for reach while stay properties":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning control lyapunov functions from counterexamples and demonstrations")
  Member "controller synthesis with inductive proofs for piecewise linear systems an smt based algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hyperproperties for robotics planning via hyperltl")

Question: Please tell me which class the source paper 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)