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 generalized apagodu zeilberger algorithm"):
  Abstract: The Apagodu-Zeilberger algorithm can be used for computing annihilating operators for definite sums over hypergeometric terms, or for definite integrals over hyperexponential functions. In this paper, we propose a generalization of this algorithm which is applicable to arbitrary Δ-finite functions. In analogy to the hypergeometric case, we introduce the notion of proper Δ-finite functions. We show that the algorithm always succeeds for these functions, and we give a tight a priori bound for the order of the output operator.

Includes members:
  Member "hermite reduction and creative telescoping for hyperexponential functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an additive decomposition in s primitive towers")
  Member "creative telescoping for holonomic functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimal representations and algebraic relations for single nested products")
  Member "order degree curves for hypergeometric creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient rational creative telescoping")
  Member "trading order for degree in creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient rational creative telescoping")
  Member "a fast approach to creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)