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 "constructing minimal telescopers for rational functions in three discrete variables"):
  Abstract: We present a new algorithm for constructing minimal telescopers for rational functions in three discrete variables. This is the first discrete reduction-based algorithm that goes beyond the bivariate case. The termination of the algorithm is guaranteed by a known existence criterion of telescopers. Our approach has the important feature that it avoids the potentially costly computation of certificates. Computational experiments are also provided so as to illustrate the efficiency of our approach.

Includes members:
  Member "existence problem of telescopers beyond the bivariate case":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "reduction based creative telescoping for algebraic functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "integral p recursive sequences")
  Member "new bounds for hypergeometric creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient rational creative telescoping")
  Member "multiple binomial sums":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient rational creative telescoping")
  Member "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an additive decomposition in s primitive towers")
  Member "an algorithm for deciding the summability of bivariate rational functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "hermite reduction and creative telescoping for hyperexponential functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an additive decomposition in s primitive towers")

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)