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: "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
  Abstract: The Abramov-Petkovsek reduction computes an additive decomposition of a hypergeometric term, which extends the functionality of the Gosper algorithm for indefinite hypergeometric summation. We modify the Abramov-Petkovsek reduction so as to decompose a hypergeometric term as the sum of a summable term and a non-summable one. The outputs of the Abramov-Petkovsek reduction and our modified version share the same required properties. The modified reduction does not solve any auxiliary linear difference equation explicitly. It is also more efficient than the original reduction according to computational experiments. Based on this reduction, we design a new algorithm to compute minimal telescopers for bivariate hypergeometric terms. The new algorithm can avoid the costly computation of certificates.

Connected through hyperedge HE-1 (induced by source paper "an additive decomposition in s primitive towers"):
  with members:
    - "additive decompositions in primitive extensions"
    - "reduction based creative telescoping for algebraic functions"
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "complexity of creative telescoping for bivariate rational functions"

Connected through hyperedge HE-2 (induced by source paper "efficient rational creative telescoping"):
  with members:
    - "constructing minimal telescopers for rational functions in three discrete variables"
    - "generalized hermite reduction creative telescoping and definite integration of d finite functions"
    - "reduction based creative telescoping for algebraic functions"
    - "reduction based creative telescoping for fuchsian d finite functions"
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"
    - "a generalized apagodu zeilberger algorithm"
    - "hermite reduction and creative telescoping for hyperexponential functions"

Connected through hyperedge HE-3 (induced by source paper "constructing minimal telescopers for rational functions in three discrete variables"):
  with members:
    - "existence problem of telescopers beyond the bivariate case"
    - "reduction based creative telescoping for algebraic functions"
    - "reduction based creative telescoping for fuchsian d finite functions"
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"
    - "an algorithm for deciding the summability of bivariate rational functions"
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "creative telescoping for rational functions using the griffiths dwork method"

Connected through hyperedge HE-4 (induced by source paper "linear differential equations as a data structure"):
  with members:
    - "computing the volume of compact semi algebraic sets"
    - "generalized hermite reduction creative telescoping and definite integration of d finite functions"
    - "efficient algorithms for mixed creative telscoping"
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "reduction based creative telescoping for algebraic functions"
    - "reduction based creative telescoping for fuchsian d finite functions"
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"

Connected through hyperedge HE-5 (induced by source paper "generalized hermite reduction creative telescoping and definite integration of d finite functions"):
  with members:
    - "efficient algorithms for mixed creative telscoping"
    - "reduction based creative telescoping for algebraic functions"
    - "reduction based creative telescoping for fuchsian d finite functions"
    - "new bounds for hypergeometric creative telescoping"
    - "computing periods of rational integrals"
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "complexity of creative telescoping for bivariate rational functions"

Connected through hyperedge HE-6 (induced by source paper "some open problems related to creative telescoping"):
  with members:
    - "efficient algorithms for mixed creative telscoping"
    - "existence problem of telescopers beyond the bivariate case"
    - "computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases"
    - "reduction based creative telescoping for algebraic functions"
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"
    - "an algorithm for deciding the summability of bivariate rational functions"
    - "a generalized apagodu zeilberger algorithm"

Connected through hyperedge HE-7 (induced by source paper "efficient algorithms for mixed creative telscoping"):
  with members:
    - "computing periods of rational integrals"
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "complexity of creative telescoping for bivariate rational functions"
    - "creative telescoping for holonomic functions"
    - "on the length of integers in telescopers for proper hypergeometric terms"
    - "order degree curves for hypergeometric creative telescoping"
    - "on the existence of telescopers for mixed hypergeometric terms"

Connected through hyperedge HE-8 (induced by source paper "reduction based creative telescoping for fuchsian d finite functions"):
  with members:
    - "computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases"
    - "reduction based creative telescoping for algebraic functions"
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"
    - "computing periods of rational integrals"
    - "integral d finite functions"
    - "a generalized apagodu zeilberger algorithm"
    - "hermite reduction and creative telescoping for hyperexponential functions"

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)