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 "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.

Includes members:
  Member "a generalized apagodu zeilberger algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient rational creative telescoping")
  Member "hermite reduction and creative telescoping for hyperexponential functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an additive decomposition in s primitive towers")
  Member "creative telescoping for rational functions using the griffiths dwork method":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "complexity of creative telescoping for bivariate rational functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an additive decomposition in s primitive towers")
  Member "order degree curves for hypergeometric creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient rational creative telescoping")
  Member "trading order for degree in creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient rational creative telescoping")

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)