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: "numgfun a package for numerical and analytic computation with d finite functions"
  Abstract: This article describes the implementation in the software package NumGfun of classical algorithms that operate on solutions of linear differential equations or recurrence relations with polynomial coefficients, including what seems to be the first general implementation of the fast high-precision numerical evaluation algorithms of Chudnovsky & Chudnovsky. In some cases, our descriptions contain improvements over existing algorithms. We also provide references to relevant ideas not currently used in NumGfun.

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"
    - "rigorous multiple precision evaluation of d finite functions in sagemath"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "effective certification of approximate solutions to systems of equations involving analytic functions"):
  with members:
    - "rigorous multiple precision evaluation of d finite functions in sagemath"
    - "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"
    - "effective bounds for p recursive sequences"

Connected through hyperedge HE-3 (induced by source paper "linear differential equations as a data structure"):
  with members:
    - "computing the volume of compact semi algebraic sets"
    - "generalized hermite reduction creative telescoping and definite integration of d finite functions"
    - "efficient algorithms for mixed creative telscoping"
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "reduction based creative telescoping for algebraic functions"
    - "reduction based creative telescoping for fuchsian d finite functions"
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"

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"
    - "rigorous multiple precision evaluation of d finite functions in sagemath"
    - "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"
    - "effective bounds for p recursive sequences"

Connected through hyperedge HE-5 (induced by source paper "finding hyperexponential solutions of linear odes by numerical evaluation"):
  with members:
    - "desingularization explains order degree curves for ore operators"

Connected through hyperedge HE-6 (induced by source paper "evaluating parametric holonomic sequences using rectangular splitting"):
  with members:
    - "fast multi evaluation of linearly recurrent sequences improvements and applications"

Connected through hyperedge HE-7 (induced by source paper "a note on the space complexity of fast d finite function evaluation"):
  with members:
    - "a simple algorithm for the evaluation of the hypergeometric series using quasi linear time and linear space"
    - "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)