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: "ore polynomials in sage"
  Abstract: We present a Sage implementation of Ore algebras. The main features for the most common instances include basic arithmetic and actions; gcrd and lclm; D-finite closure properties; natural transformations between related algebras; guessing; desingularization; solvers for polynomials, rational functions and (generalized) power series. This paper is a tutorial on how to use the package.

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"
    - "the package harmonicsums computer algebra and analytic aspects of nested sums"

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"
    - "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"
    - "complexity estimates for two uncoupling algorithms"
    - "a symbolic summation approach to feynman integral calculus"

Connected through hyperedge HE-3 (induced by source paper "desingularization of ore operators"):
  with members:
    - "desingularization explains order degree curves for ore operators"
    - "fast computation of common left multiples of linear ordinary differential operators"
    - "order degree curves for hypergeometric creative telescoping"
    - "trading order for degree in creative telescoping"

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)