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: "a non holonomic systems approach to special function identities"
  Abstract: We extend Zeilberger's approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals involving Stirling or Bernoulli numbers, incomplete Gamma function or polylogarithms, which are not covered by the holonomic framework. The basic idea is to take into account the dimension of appropriate ideals in Ore algebras. This unifies several earlier extensions and provides algorithms for summation and integration in classes that had not been accessible to computer algebra before.

Connected through hyperedge HE-1 (induced by source paper "on the existence of telescopers for rational functions in three variables"):
  with members:
    - "constructing minimal telescopers for rational functions in three discrete variables"
    - "existence problem of telescopers for rational functions in three variables the mixed cases"
    - "bivariate extensions of abramov s algorithm for rational summation"
    - "existence problem of telescopers beyond the bivariate case"
    - "some open problems related to creative telescoping"
    - "computing periods of rational integrals"
    - "an algorithm for deciding the summability of bivariate rational functions"
    - "testing equivalence of polynomials under shifts"

Connected through hyperedge HE-2 (induced by source paper "existence problem of telescopers for rational functions in three variables the mixed cases"):
  with members:
    - "bivariate extensions of abramov s algorithm for rational summation"
    - "existence problem of telescopers beyond the bivariate case"
    - "an algorithm for deciding the summability of bivariate rational functions"
    - "parallel telescoping and parameterized picard vessiot theory"
    - "testing equivalence of polynomials under shifts"
    - "telescopers for rational and algebraic functions via residues"
    - "on the existence of telescopers for mixed hypergeometric terms"
    - "parameterized telescoping proves algebraic independence of sums"

Connected through hyperedge HE-3 (induced by source paper "linear differential equations as a data structure"):
  with members:
    - "computing the volume of compact semi algebraic sets"
    - "generalized hermite reduction creative telescoping and definite integration of d finite functions"
    - "efficient algorithms for mixed creative telscoping"
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "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"

Connected through hyperedge HE-4 (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-5 (induced by source paper "existence problem of telescopers beyond the bivariate case"):
  with members:
    - "an algorithm for deciding the summability of bivariate rational functions"
    - "testing equivalence of polynomials under shifts"
    - "on the existence of telescopers for mixed hypergeometric terms"

Connected through hyperedge HE-6 (induced by source paper "creative telescoping for holonomic functions"):
  with members:
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "simplifying multiple sums in difference fields"
    - "advanced computer algebra for determinants"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "complexity of creative telescoping for bivariate rational functions"
    - "order degree curves for hypergeometric creative telescoping"
    - "telescopers for rational and algebraic functions via residues"
    - "on the existence of telescopers for mixed hypergeometric terms"

Connected through hyperedge HE-7 (induced by source paper "on the existence of telescopers for mixed hypergeometric terms"):
  with members:
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "on the structure of compatible rational functions"
    - "telescopers for rational and algebraic functions via residues"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a recursive method for determining the one dimensional submodules of laurent ore modules"

Connected through hyperedge HE-8 (induced by source paper "trading order for degree in creative telescoping"):
  with members:
    - "complexity of creative telescoping for bivariate rational functions"
    - "a fast approach to creative telescoping"
    - "differential equations for algebraic functions"
    - "computing the rank and a small nullspace basis of a polynomial matrix"

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)