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 "algorithms to solve coupled systems of differential equations in terms of power series"):
  Abstract: Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations, and that sufficiently many initial values of the integrals are given. Then there exist algorithms that decide constructively if the coefficients of their power series representations can be given within the class of nested sums over hypergeometric products. In this article we will work out the calculation steps that solve this problem. First, we will present a successful tactic that has been applied recently to challenging problems coming from massive 3-loop Feynman integrals. Here our main tool is to solve scalar linear recurrences within the class of nested sums over hypergeometric products. Second, we will present a new variation of this tactic which relies on more involved summation technologies but succeeds in reducing the problem to solve scalar recurrences with lower recurrence orders. The article will work out the different challenges of this new tactic and demonstrates how they can be treated efficiently with our existing summation technologies.

Includes members:
  Member "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards a symbolic summation theory for unspecified sequences")
  Member "a toolbox to solve coupled systems of differential and difference equations":
    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 "inverse mellin transform of holonomic sequences":
    also connected through other hyperedges:
      (none)
  Member "algebraic independence of cyclotomic harmonic sums":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects")
  Member "a difference ring theory for symbolic summation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards a symbolic summation theory for unspecified sequences")
  Member "recent symbolic summation methods to solve coupled systems of differential and difference equations":
    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 "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")

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)