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 "recent symbolic summation methods to solve coupled systems of differential and difference equations"):
  Abstract: We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $\epsilon$: given such a system and given sufficiently many initial values, we can determine the first coefficients of the Laurent-series solutions in $\epsilon$ if they are expressible in terms of indefinite nested sums and products. This systematic approach is based on symbolic summation algorithms in the context of difference rings/fields and uncoupling algorithms. The proposed method gives rise to new interesting applications in connection with integration by parts (IBP) methods. As an illustrative example, we will demonstrate how one can calculate the $\epsilon$-expansion of a ladder graph with 6 massive fermion lines.

Includes members:
  Member "simplifying multiple sums in difference fields":
    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 "a symbolic summation approach to feynman integral calculus":
    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 "advanced computer algebra algorithms for the expansion of feynman integrals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "refined holonomic summation algorithms in particle physics")
  Member "a symbolic summation approach to find optimal nested sum representations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "a refined difference field theory for symbolic summation":
    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")

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)