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: "proving inequalities and solving global optimization problems via simplified cad projection"
  Abstract: Let $\xx_n=(x_1,\ldots,x_n)$ and $f\in \R[\xx_n,k]$. The problem of finding all $k_0$ such that $f(\xx_n,k_0)\ge 0$ on $\mathbb{R}^n$ is considered in this paper, which obviously takes as a special case the problem of computing the global infimum or proving the semi-definiteness of a polynomial. #R##N#For solving the problems, we propose a simplified Brown's CAD projection operator, \Nproj, of which the projection scale is always no larger than that of Brown's. For many problems, the scale is much smaller than that of Brown's. As a result, the lifting phase is also simplified. Some new algorithms based on \Nproj\ for solving those problems are designed and proved to be correct. Comparison to some existing tools on some examples is reported to illustrate the effectiveness of our new algorithms.

Connected through hyperedge HE-1 (induced by source paper "finding polynomial loop invariants for probabilistic programs"):
  with members:
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "counterexample guided polynomial loop invariant generation by lagrange interpolation"
    - "on the hardness of almost sure termination"
    - "generating non linear interpolants by semidefinite programming"

Connected through hyperedge HE-2 (induced by source paper "finding best possible constant for a polynomial inequality"):
  with members:
    - "a successive resultant projection for cylindrical algebraic decomposition"

Connected through hyperedge HE-3 (induced by source paper "open weak cad and its applications"):
  with members:
    - "constructing fewer open cells by gcd computation in cad projection"

Connected through hyperedge HE-4 (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"
    - "computing semi algebraic invariants for polynomial dynamical systems"
    - "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)