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: "exact safety verification of hybrid systems using sums of squares representation"
  Abstract: In this paper we discuss how to generate inductive invariants for safety verification of hybrid systems. A hybrid symbolic-numeric method is presented to compute inequality inductive invariants of the given systems. A numerical invariant of the given system can be obtained by solving a parameterized polynomial optimization problem via sum-of-squares (SOS) relaxation. And a method based on Gauss-Newton refinement and rational vector recovery is deployed to obtain the invariants with rational coefficients, which exactly satisfy the conditions of invariants. Several examples are given to illustrate our algorithm.

Connected through hyperedge HE-1 (induced by source paper "property based polynomial invariant generation using sums of squares optimization"):
  with members:
    - "a sums of squares extension of policy iterations"
    - "a bi directional refinement algorithm for the calculus of co inductive constructions"
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"

Connected through hyperedge HE-2 (induced by source paper "polynomial template generation using sum of squares programming"):
  with members:
    - "certification of bounds of non linear functions the templates method"
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"

Connected through hyperedge HE-3 (induced by source paper "barrier certificates revisited"):
  with members:
    - "abstraction of elementary hybrid systems by variable transformation"
    - "exponential condition based barrier certificate generation for safety verification of hybrid systems"
    - "generating non linear interpolants by semidefinite programming"
    - "proving inequalities and solving global optimization problems via simplified cad projection"
    - "computing semi algebraic invariants for polynomial dynamical systems"

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.SE(Software Engineering)