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: "rigorous multiple precision evaluation of d finite functions in sagemath"
  Abstract: We present a new open source implementation in the SageMath computer algebra system of algorithms for the numerical solution of linear ODEs with polynomial coefficients. Our code supports regular singular connection problems and provides rigorous error bounds.

Connected through hyperedge HE-1 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems"):
  with members:
    - "computing real roots of real polynomials and now for real"
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"
    - "multiple binomial sums"
    - "computing periods of rational integrals"
    - "on the complexity of computing with planar algebraic curves"
    - "ultimate positivity is decidable for simple linear recurrence sequences"
    - "creative telescoping for rational functions using the griffiths dwork method"

Connected through hyperedge HE-2 (induced by source paper "computing the volume of compact semi algebraic sets"):
  with members:
    - "computing the homology of basic semialgebraic sets in weak exponential time"
    - "computing periods of rational integrals"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "algorithms for integrals of holonomic functions over domains defined by polynomial inequalities"
    - "a fast approach to creative telescoping"

Connected through hyperedge HE-3 (induced by source paper "effective certification of approximate solutions to systems of equations involving analytic functions"):
  with members:
    - "certifying solutions to overdetermined and singular polynomial systems over q"
    - "rigorous uniform approximation of d finite functions using chebyshev expansions"
    - "deflation and certified isolation of singular zeros of polynomial systems"
    - "numgfun a package for numerical and analytic computation with d finite functions"
    - "effective bounds for p recursive sequences"

Connected through hyperedge HE-4 (induced by source paper "computing hypergeometric functions rigorously"):
  with members:
    - "fast and rigorous arbitrary precision computation of gauss legendre quadrature nodes and weights"
    - "arb efficient arbitrary precision midpoint radius interval arithmetic"
    - "efficient implementation of elementary functions in the medium precision range"
    - "rigorous high precision computation of the hurwitz zeta function and its derivatives"
    - "evaluating parametric holonomic sequences using rectangular splitting"
    - "multiple precision evaluation of the airy ai function with reduced cancellation"
    - "numgfun a package for numerical and analytic computation with d finite functions"
    - "effective bounds for p recursive sequences"

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)