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: "complexity estimates for two uncoupling algorithms"
  Abstract: Uncoupling algorithms transform a linear differential system of first order into one or several scalar differential equations. We examine two approaches to uncoupling: the cyclic-vector method (CVM) and the Danilevski-Barkatou-Z\"urcher algorithm (DBZ). We give tight size bounds on the scalar equations produced by CVM, and design a fast variant of CVM whose complexity is quasi-optimal with respect to the output size. We exhibit a strong structural link between CVM and DBZ enabling to show that, in the generic case, DBZ has polynomial complexity and that it produces a single equation, strongly related to the output of CVM. We prove that algorithm CVM is faster than DBZ by almost two orders of magnitude, and provide experimental results that validate the theoretical complexity analyses.

Connected through hyperedge HE-1 (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"
    - "a toolbox to solve coupled systems of differential and difference equations"
    - "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"
    - "ore polynomials in sage"
    - "a symbolic summation approach to feynman integral calculus"

Connected through hyperedge HE-2 (induced by source paper "refined holonomic summation algorithms in particle physics"):
  with members:
    - "representing q hypergeometric products and mixed versions in difference rings"
    - "a difference ring theory for symbolic summation"
    - "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "a symbolic summation approach to feynman integral calculus"
    - "advanced computer algebra algorithms for the expansion of feynman integrals"
    - "a fast approach to creative telescoping"
    - "a refined difference field theory for symbolic summation"

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"
    - "a toolbox to solve coupled systems of differential and difference equations"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "a toolbox to solve coupled systems of differential and difference equations"):
  with members:
    - "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"
    - "simplifying multiple sums in difference fields"
    - "a symbolic summation approach to feynman integral calculus"
    - "parameterized telescoping proves algebraic independence of sums"

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)