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 "trading order for degree in creative telescoping"):
  Abstract: We analyze the differential equations produced by the method of creative telescoping applied to a hyperexponential term in two variables. We show that equations of low order have high degree, and that higher order equations have lower degree. More precisely, we derive degree bounding formulas which allow to estimate the degree of the output equations from creative telescoping as a function of the order. As an application, we show how the knowledge of these formulas can be used to improve, at least in principle, the performance of creative telescoping implementations, and we deduce bounds on the asymptotic complexity of creative telescoping for hyperexponential terms.

Includes members:
  Member "complexity of creative telescoping for bivariate rational functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an additive decomposition in s primitive towers")
  Member "a fast approach to creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constructing minimal telescopers for rational functions in three discrete variables")
  Member "a non holonomic systems approach to special function identities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "differential equations for algebraic functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear differential equations as a data structure")
  Member "computing the rank and a small nullspace basis of a polynomial matrix":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing lower rank approximations of matrix polynomials")

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)