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: "the package harmonicsums computer algebra and analytic aspects of nested sums"
  Abstract: This paper summarizes the essential functionality of the computer algebra package HarmonicSums. On the one hand HarmonicSums can work with nested sums such as harmonic sums and their generalizations and on the other hand it can treat iterated integrals of the Poincare and Chen-type, such as harmonic polylogarithms and their generalizations. The interplay of these representations and the analytic aspects are illustrated by concrete examples.

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"
    - "algebraic independence of sequences generated by cyclotomic harmonic sums"
    - "a difference ring theory for symbolic summation"
    - "recent symbolic summation methods to solve coupled systems of differential and difference equations"

Connected through hyperedge HE-2 (induced by source paper "algebraic independence of cyclotomic harmonic sums"):
  with members:
    - "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 symbolic summation approach to find optimal nested sum representations"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-3 (induced by source paper "algebraic independence of sequences generated by cyclotomic harmonic sums"):
  with members:
    - "a difference ring theory for symbolic summation"
    - "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem"
    - "simplifying multiple sums in difference fields"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "a symbolic summation approach to find optimal nested sum representations"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

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)