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 "computing the volume of compact semi algebraic sets"):
  Abstract: Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defining $S$ and an integer $p\geq 0$ and returns the $n$-dimensional volume of $S$ at absolute precision $2^{-p}$.Our algorithm relies on the relationship between volumes of semi-algebraic sets and periods of rational integrals. It makes use of algorithms computing the Picard-Fuchs differential equation of appropriate periods, properties of critical points, and high-precision numerical integration of differential equations.The algorithm runs in essentially linear time with respect to~$p$. This improves upon the previous exponential bounds obtained by Monte-Carlo or moment-based methods. Assuming a conjecture of Dimca, the arithmetic cost of the algebraic subroutines for computing Picard-Fuchs equations and critical points is singly exponential in $n$ and polynomial in the maximum degree of the input.

Includes members:
  Member "computing the homology of basic semialgebraic sets in weak exponential time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "smooth points on semi algebraic sets")
  Member "rigorous multiple precision evaluation of d finite functions in sagemath":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "computing periods of rational integrals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing the homology of basic semialgebraic sets in weak exponential time")
  Member "creative telescoping for rational functions using the griffiths dwork method":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "algorithms for integrals of holonomic functions over domains defined by polynomial inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "calculation of orthant probabilities by the holonomic gradient method")
  Member "a fast approach to creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "constructing minimal telescopers for rational functions in three discrete variables")

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