human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a toolbox to solve coupled systems of differential and difference equations"
  Abstract: We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases. Here we assume that the desired solution has a power series representation and we seek for the coefficients in closed form. In particular, if the coefficients depend on a small parameter $\ep$ (the dimensional parameter), we assume that the coefficients themselves can be expanded in formal Laurent series w.r.t.\ $\ep$ and we try to compute the first terms in closed form. More precisely, we have a decision algorithm which solves the following problem: if the terms can be represented by an indefinite nested hypergeometric sum expression (covering as special cases the harmonic sums, cyclotomic sums, generalized harmonic sums or nested binomial sums), then we can calculate them. If the algorithm fails, we obtain a proof that the terms cannot be represented by the class of indefinite nested hypergeometric sum expressions. Internally, this problem is reduced by holonomic closure properties to solving a coupled system of linear difference equations. The underlying method in this setting relies on decoupling algorithms, difference ring algorithms and recurrence solving. We demonstrate by a concrete example how this algorithm can be applied with the new Mathematica package \texttt{SolveCoupledSystem} which is based on the packages \texttt{Sigma}, \texttt{HarmonicSums} and \texttt{OreSys}. In all applications the representation in $x$-space is obtained as an iterated integral representation over general alphabets, generalizing Poincar\'{e} iterated integrals.

Connected through hyperedge HE-1 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations"):
  with members:
    - "minimal representations and algebraic relations for single nested products"
    - "computing the inverse mellin transform of holonomic sequences using kovacic s algorithm"
    - "representing q hypergeometric products and mixed versions in difference rings"
    - "algorithms to solve coupled systems of differential equations in terms of power series"
    - "algebraic independence of sequences generated by cyclotomic harmonic sums"
    - "a difference ring theory for symbolic summation"
    - "the package harmonicsums computer algebra and analytic aspects of nested sums"
    - "recent symbolic summation methods to solve coupled systems of differential and difference equations"

Connected through hyperedge HE-2 (induced by source paper "computer algebra tools for feynman integrals and related multi sums"):
  with members:
    - "representing q hypergeometric products and mixed versions in difference rings"
    - "algebraic independence of sequences generated by cyclotomic harmonic sums"
    - "a difference ring theory for symbolic summation"
    - "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction"
    - "complexity estimates for two uncoupling algorithms"
    - "ore polynomials in sage"
    - "a symbolic summation approach to feynman integral calculus"

Connected through hyperedge HE-3 (induced by source paper "algorithms to solve coupled systems of differential equations in terms of power series"):
  with members:
    - "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects"
    - "inverse mellin transform of holonomic sequences"
    - "algebraic independence of cyclotomic harmonic sums"
    - "a difference ring theory for symbolic summation"
    - "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem"
    - "recent symbolic summation methods to solve coupled systems of differential and difference equations"
    - "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction"
    - "complexity estimates for two uncoupling algorithms"

Question: Please tell me which class the center node 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)