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: "algorithms for integrals of holonomic functions over domains defined by polynomial inequalities"
  Abstract: A holonomic function is a differentiable or generalized function which satisfies a holonomic system of linear partial or ordinary differential equations with polynomial coefficients. The main purpose of this paper is to present algorithms for computing a holonomic system for the definite integral of a holonomic function with parameters over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including parameters, then a holonomic difference-differential system for the integral can also be computed. In the algorithms, holonomic distributions (generalized functions in the sense of L. Schwartz) are inevitably involved even if the integrand is a usual function.

Connected through hyperedge HE-1 (induced by source paper "computing the volume of compact semi algebraic sets"):
  with members:
    - "computing the homology of basic semialgebraic sets in weak exponential time"
    - "rigorous multiple precision evaluation of d finite functions in sagemath"
    - "computing periods of rational integrals"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "a fast approach to creative telescoping"

Connected through hyperedge HE-2 (induced by source paper "calculation of orthant probabilities by the holonomic gradient method"):
  with members:
    - "holonomic gradient descent and its application to fisher bingham integral"

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)