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: "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
  Abstract: We introduce a new algorithm denoted DSC2 to isolate the real roots of a univariate square-free polynomial f with integer coefficients. The algorithm iteratively subdivides an initial interval which is known to contain all real roots of f. The main novelty of our approach is that we combine Descartes' Rule of Signs and Newton iteration. More precisely, instead of using a fixed subdivision strategy such as bisection in each iteration, a Newton step based on the number of sign variations for an actual interval is considered, and, only if the Newton step fails, we fall back to bisection. Following this approach, our analysis shows that, for most iterations, we can achieve quadratic convergence towards the real roots. In terms of complexity, our method induces a recursion tree of almost optimal size O(nlog(n tau)), where n denotes the degree of the polynomial and tau the bitsize of its coefficients. The latter bound constitutes an improvement by a factor of tau upon all existing subdivision methods for the task of isolating the real roots. In addition, we provide a bit complexity analysis showing that DSC2 needs only \tilde{O}(n^3tau) bit operations to isolate all real roots of f. This matches the best bound known for this fundamental problem. However, in comparison to the much more involved algorithms by Pan and Sch\"onhage (for the task of isolating all complex roots) which achieve the same bit complexity, DSC2 focuses on real root isolation, is very easy to access and easy to implement.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of computing the topology of real algebraic space curves"):
  with members:
    - "a generic position based method for real root isolation of zero dimensional polynomial systems"
    - "rational univariate representations of bivariate systems and applications"
    - "arrangement computation for planar algebraic curves"
    - "on the complexity of solving a bivariate polynomial system"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-2 (induced by source paper "the complexity of subdivision for diameter distance tests"):
  with members:
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "root isolation of zero dimensional polynomial systems with linear univariate representation"

Connected through hyperedge HE-3 (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"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"

Connected through hyperedge HE-4 (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"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "sqfreeeval an almost optimal real root isolation algorithm"

Connected through hyperedge HE-5 (induced by source paper "near optimal subdivision algorithms for real root isolation"):
  with members:
    - "applications of continuous amortization to bisection based root isolation"

Connected through hyperedge HE-6 (induced by source paper "a near optimal algorithm for computing real roots of sparse polynomials"):
  with members:
    - "rational univariate representations of bivariate systems and applications"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "on the complexity of solving a bivariate polynomial system"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-7 (induced by source paper "theorem of three circles in coq"):
  with members:
    - "formal proofs in real algebraic geometry from ordered fields to quantifier elimination"

Connected through hyperedge HE-8 (induced by source paper "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"):
  with members:
    - "solving bivariate systems efficient worst case algorithm for computing rational univariate representations and applications"
    - "rational univariate representations of bivariate systems and applications"
    - "separating linear forms for bivariate systems"
    - "exact symbolic numeric computation of planar algebraic curves"
    - "a worst case bound for topology computation of algebraic curves"
    - "on the complexity of solving a bivariate polynomial system"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "univariate real root isolation in an extension field"

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)