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 "barrier certificates revisited"):
  Abstract: A barrier certificate can separate the state space of a con- sidered hybrid system (HS) into safe and unsafe parts ac- cording to the safety property to be verified. Therefore this notion has been widely used in the verification of HSs. A stronger condition on barrier certificates means that less expressive barrier certificates can be synthesized. On the other hand, synthesizing more expressive barrier certificates often means high complexity. In [9], Kong et al consid- ered how to relax the condition of barrier certificates while still keeping their convexity so that one can synthesize more expressive barrier certificates efficiently using semi-definite programming (SDP). In this paper, we first discuss how to relax the condition of barrier certificates in a general way, while still keeping their convexity. Particularly, one can then utilize different weaker conditions flexibly to synthesize dif- ferent kinds of barrier certificates with more expressiveness efficiently using SDP. These barriers give more opportuni- ties to verify the considered system. We also show how to combine two functions together to form a combined barrier certificate in order to prove a safety property under consid- eration, whereas neither of them can be used as a barrier certificate separately, even according to any relaxed condi- tion. Another contribution of this paper is that we discuss how to discover certificates from the general relaxed condi- tion by SDP. In particular, we focus on how to avoid the unsoundness because of numeric error caused by SDP with symbolic checking

Includes members:
  Member "abstraction of elementary hybrid systems by variable transformation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "synthesizing basic semialgebraic invariants by semidefinite programming")
  Member "exponential condition based barrier certificate generation for safety verification of hybrid systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an inductive synthesis framework for verifiable reinforcement learning")
  Member "generating non linear interpolants by semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "synthesizing basic semialgebraic invariants by semidefinite programming")
  Member "proving inequalities and solving global optimization problems via simplified cad projection":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finding polynomial loop invariants for probabilistic programs")
  Member "computing semi algebraic invariants for polynomial dynamical systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized property directed reachability for hybrid systems")
  Member "exact safety verification of hybrid systems using sums of squares representation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "property based polynomial invariant generation using sums of squares optimization")

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)