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 "bounds for substituting algebraic functions into d finite functions"):
  Abstract: It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis of removable singularities leads to an order-degree curve which is much more accurate than the order-degree curve obtained from the usual linear algebra reasoning.

Includes members:
  Member "bounds for d finite closure properties":
    also connected through other hyperedges:
      (none)
  Member "desingularization of ore operators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "desingularization in the q weyl algebra")
  Member "desingularization explains order degree curves for ore operators":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear differential equations as a data structure")
  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 "differential equations for algebraic functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "linear differential equations as a data structure")

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)