human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "effective certification of approximate solutions to systems of equations involving analytic functions"):
  Abstract: We develop algorithms for certifying an approximation to a nonsingular solution of a square system of equations built from univariate analytic functions. These algorithms are based on the existence of oracles for evaluating basic data about the input analytic functions. One approach for certification is based on alpha-theory while the other is based on the Krawczyk generalization of Newton's iteration. We show that the necessary oracles exist for D-finite functions and compare the two algorithmic approaches for this case using our software implementation in SageMath.

Includes members:
  Member "rigorous multiple precision evaluation of d finite functions in sagemath":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "certifying solutions to overdetermined and singular polynomial systems over q":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "smooth points on semi algebraic sets")
  Member "rigorous uniform approximation of d finite functions using chebyshev expansions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear differential equations as a data structure")
  Member "deflation and certified isolation of singular zeros of polynomial systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "certifying solutions to overdetermined and singular polynomial systems over q")
  Member "numgfun a package for numerical and analytic computation with d finite functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "effective bounds for p recursive sequences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "linear differential equations as a data structure")

Question: Please tell me which class the source paper 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)