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: "computing semi algebraic invariants for polynomial dynamical systems"
  Abstract: In this paper, we consider an extended concept of invariant for polynomial dynamical system (PDS) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAI) for such PDSs. The main idea is encoding relevant dynamical properties as conditions on the high order Lie derivatives of polynomials occurring in the SAI. A direct consequence of this criterion is a relatively complete method of SAI generation based on template assumption and semi-algebraic constraint solving. Relative completeness means if there is an SAI in the form of a predefined template, then our method can indeed find one using this template.

Connected through hyperedge HE-1 (induced by source paper "generalized property directed reachability for hybrid systems"):
  with members:
    - "sharper and simpler nonlinear interpolants for program verification"
    - "refinement type inference via horn constraint optimization"
    - "ic3 modulo theories via implicit predicate abstraction"
    - "smt based induction methods for timed systems"

Connected through hyperedge HE-2 (induced by source paper "an axiomatic approach to liveness for differential equations"):
  with members:
    - "differential equation axiomatization the impressive power of differential ghosts"
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "differential hybrid games"

Connected through hyperedge HE-3 (induced by source paper "differential equation invariance axiomatization"):
  with members:
    - "abstraction of elementary hybrid systems by variable transformation"
    - "a heuristic prover for real inequalities"
    - "delta decidability over the reals"

Connected through hyperedge HE-4 (induced by source paper "differential equation axiomatization the impressive power of differential ghosts"):
  with members:
    - "a complete uniform substitution calculus for differential dynamic logic"
    - "the structure of differential invariants and differential cut elimination"

Connected through hyperedge HE-5 (induced by source paper "complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial ode s"):
  with members:
    - "algebra coalgebra and minimization in polynomial differential equations"
    - "essential convexity and complexity of semi algebraic constraints"
    - "the structure of differential invariants and differential cut elimination"

Connected through hyperedge HE-6 (induced by source paper "abstraction of elementary hybrid systems by variable transformation"):
  with members:
    - "exponential condition based barrier certificate generation for safety verification of hybrid systems"
    - "change of bases abstractions for non linear systems"

Connected through hyperedge HE-7 (induced by source paper "automata theory meets barrier certificates temporal logic verification of nonlinear systems"):
  with members:
    - "the structure of differential invariants and differential cut elimination"

Connected through hyperedge HE-8 (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"
    - "exact safety verification of hybrid systems using sums of squares representation"

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.SC(Symbolic Computation)