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 "efficient rational creative telescoping"):
  Abstract: We present a new algorithm to compute minimal telescopers for rational functions in two discrete variables. As with recent reduction-based approach, our algorithm has the nice feature that the computation of a telescoper is independent of its certificate. Moreover, our algorithm uses a sparse representation of the certificate, which allows it to be easily manipulated and analyzed without knowing the precise expanded form. This representation hides potential expression swell until the final (and optional) expansion, which can be accomplished in time polynomial in the size of the expanded certificate. A complexity analysis, along with a Maple implementation, suggests that our algorithm has better theoretical and practical performance than the reduction-based approach in the rational case.

Includes members:
  Member "constructing minimal telescopers for rational functions in three discrete variables":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "generalized hermite reduction creative telescoping and definite integration of d finite functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear differential equations as a data structure")
  Member "reduction based creative telescoping for algebraic functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an additive decomposition in s primitive towers")
  Member "reduction based creative telescoping for fuchsian d finite functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "integral p recursive sequences")
  Member "new bounds for hypergeometric creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constructing minimal telescopers for rational functions in three discrete variables")
  Member "multiple binomial sums":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an additive decomposition in s primitive towers")
  Member "a generalized apagodu zeilberger algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "some open problems related to creative telescoping")

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)