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: "order degree curves for hypergeometric creative telescoping"
  Abstract: Creative telescoping applied to a bivariate proper hypergeometric term produces linear recurrence operators with polynomial coefficients, called telescopers. We provide bounds for the degrees of the polynomials appearing in these operators. Our bounds are expressed as curves in the (r,d)-plane which assign to every order r a bound on the degree d of the telescopers. These curves are hyperbolas, which reflect the phenomenon that higher order telescopers tend to have lower degree, and vice versa.

Connected through hyperedge HE-1 (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 modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
    - "a generalized apagodu zeilberger algorithm"

Connected through hyperedge HE-2 (induced by source paper "minimal representations and algebraic relations for single nested products"):
  with members:
    - "a difference ring theory for symbolic summation"
    - "on the structure of compatible rational functions"
    - "creative telescoping for holonomic functions"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "fast computation of smith forms of sparse matrices over local rings"
    - "a symbolic summation approach to find optimal nested sum representations"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-3 (induced by source paper "bounds for substituting algebraic functions into d finite functions"):
  with members:
    - "bounds for d finite closure properties"
    - "desingularization of ore operators"
    - "desingularization explains order degree curves for ore operators"
    - "trading order for degree in creative telescoping"
    - "differential equations for algebraic functions"

Connected through hyperedge HE-4 (induced by source paper "bounds for d finite substitution"):
  with members:
    - "desingularization explains order degree curves for ore operators"
    - "trading order for degree in creative telescoping"
    - "differential equations for algebraic functions"

Connected through hyperedge HE-5 (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"
    - "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
    - "an algorithm for deciding the summability of bivariate rational functions"

Connected through hyperedge HE-6 (induced by source paper "efficient algorithms for mixed creative telscoping"):
  with members:
    - "computing periods of rational integrals"
    - "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
    - "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"
    - "on the existence of telescopers for mixed hypergeometric terms"

Connected through hyperedge HE-7 (induced by source paper "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects"):
  with members:
    - "algebraic independence of cyclotomic harmonic sums"
    - "a difference ring theory for symbolic summation"
    - "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem"
    - "simplifying multiple sums in difference fields"
    - "creative telescoping for holonomic functions"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "on the existence of telescopers for mixed hypergeometric terms"
    - "parameterized telescoping proves algebraic independence of sums"

Connected through hyperedge HE-8 (induced by source paper "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"):
  with members:
    - "a generalized apagodu zeilberger algorithm"
    - "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"
    - "trading order for degree in creative telescoping"

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)