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: "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
  Abstract: We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also works for polynomials with multiple roots provided that the number $k$ of distinct roots is given as part of the input. It outputs $k$ pairwise disjoint disks each containing one of the distinct roots of $p$, and its multiplicity. The algorithm uses approximate factorization as a subroutine. #R##N#In addition, we apply the new root isolation algorithm to a recent algorithm for computing the topology of a real planar algebraic curve specified as the zero set of a bivariate integer polynomial and for isolating the real solutions of a bivariate polynomial system. For input polynomials of degree $n$ and bitsize $\tau$, we improve the currently best running time from $\tO(n^{9}\tau+n^{8}\tau^{2})$ (deterministic) to $\tO(n^{6}+n^{5}\tau)$ (randomized) for topology computation and from $\tO(n^{8}+n^{7}\tau)$ (deterministic) to $\tO(n^{6}+n^{5}\tau)$ (randomized) for solving bivariate systems.

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 "algorithms for weighted sums of squares decomposition of non negative univariate polynomials"):
  with members:
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "formal proofs for nonlinear optimization"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "univariate real root isolation in an extension field"

Connected through hyperedge HE-3 (induced by source paper "efficiently computing real roots of sparse polynomials"):
  with members:
    - "computing real roots of real polynomials and now for real"
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"
    - "a near optimal algorithm for computing real roots of sparse polynomials"
    - "computing real roots of real polynomials"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of solving zero dimensional polynomial systems via projection"):
  with members:
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"
    - "on the complexity of computing with planar algebraic curves"
    - "powers of tensors and fast matrix multiplication"
    - "on the complexity of solving a bivariate polynomial system"
    - "root isolation of zero dimensional polynomial systems with linear univariate representation"
    - "the dmm bound multivariate aggregate separation bounds"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-5 (induced by source paper "symbolic numeric tools for analytic combinatorics in several variables"):
  with members:
    - "multiple binomial sums"
    - "on the complexity of computing with planar algebraic curves"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "computing real roots of real polynomials"
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-6 (induced by source paper "computing real roots of real polynomials and now for real"):
  with members:
    - "on the complexity of computing with planar algebraic curves"
    - "computing real roots of real polynomials"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"

Connected through hyperedge HE-7 (induced by source paper "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"):
  with members:
    - "computing real roots of real polynomials and now for real"
    - "a near optimal algorithm for computing real roots of sparse polynomials"
    - "fast approximate polynomial multipoint evaluation and applications"
    - "computing real roots of real polynomials"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "sqfreeeval an almost optimal real root isolation algorithm"

Connected through hyperedge HE-8 (induced by source paper "accelerated approximation of the complex roots and factors of a univariate polynomial"):
  with members:
    - "fast approximate polynomial multipoint evaluation and applications"

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)