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: "algebraic independence of sequences generated by cyclotomic harmonic sums"
  Abstract: An expression in terms of (cyclotomic) harmonic sums can be simplified by the quasi-shuffle algebra in terms of the so-called basis sums. By construction, these sums are algebraically independent within the quasi-shuffle algebra. In this article we show that the basis sums can be represented within a tower of difference ring extensions where the constants remain unchanged. This property enables one to embed this difference ring for the (cyclotomic) harmonic sums into the ring of sequences. This construction implies that the sequences produced by the basis sums are algebraically independent over the rational sequences adjoined with the alternating sequence.

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"
    - "a toolbox to solve coupled systems of differential and difference equations"
    - "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 "towards a symbolic summation theory for unspecified sequences"):
  with members:
    - "representing q hypergeometric products and mixed versions in difference rings"
    - "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects"
    - "a difference ring theory for symbolic summation"
    - "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-3 (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"
    - "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"

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)