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: "on the existence of telescopers for mixed hypergeometric terms"
  Abstract: We present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on multiplicative and additive decompositions. The criterion enables us to determine the termination of Zeilberger's algorithms for mixed hypergeometric inputs.

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"
    - "a non holonomic systems approach to special function identities"
    - "parameterized telescoping proves algebraic independence of sums"

Connected through hyperedge HE-3 (induced by source paper "bivariate extensions of abramov s algorithm for rational summation"):
  with members:
    - "existence problem of telescopers beyond the bivariate case"
    - "reduction based creative telescoping for algebraic functions"
    - "reduction based creative telescoping for fuchsian d finite functions"
    - "some open problems related to creative telescoping"
    - "an algorithm for deciding the summability of bivariate rational functions"
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "telescopers for rational and algebraic functions via residues"

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 "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"
    - "order degree curves for hypergeometric creative telescoping"

Connected through hyperedge HE-6 (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"
    - "order degree curves for hypergeometric creative telescoping"
    - "parameterized telescoping proves algebraic independence of sums"

Connected through hyperedge HE-7 (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"
    - "a non holonomic systems approach to special function identities"

Connected through hyperedge HE-8 (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"
    - "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)