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 "fast algorithms for refined parameterized telescoping in difference fields"):
  Abstract: Parameterized telescoping (including telescoping and creative telescoping) and refined versions of it play a central role in the research area of symbolic summation. Karr introduced 1981 $\Pi\Sigma$-fields, a general class of difference fields, that enables one to consider this problem for indefinite nested sums and products covering as special cases, e.g., the ($q$--)hypergeometric case and their mixed versions. This survey article presents the available algorithms in the framework of $\Pi\Sigma$-extensions and elaborates new results concerning efficiency.

Includes members:
  Member "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "simplifying multiple sums in difference fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "desingularization explains order degree curves for ore operators":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear differential equations as a data structure")
  Member "creative telescoping for holonomic functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimal representations and algebraic relations for single nested products")
  Member "order degree curves for hypergeometric creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient rational creative telescoping")
  Member "a symbolic summation approach to feynman integral calculus":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "a symbolic summation approach to find optimal nested sum representations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimal representations and algebraic relations for single nested products")
  Member "parameterized telescoping proves algebraic independence of sums":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the existence of telescopers for rational functions in three variables")

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)