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: "computing real roots of real polynomials"
  Abstract: Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, and the natural sciences. For isolating as well as for approximating all complex roots, the best algorithm known is based on an almost optimal method for approximate polynomial factorization, introduced by Pan in 2002. Pan's factorization algorithm goes back to the splitting circle method from Schoenhage in 1982. The main drawbacks of Pan's method are that it is quite involved and that all roots have to be computed at the same time. For the important special case, where only the real roots have to be computed, much simpler methods are used in practice; however, they considerably lag behind Pan's method with respect to complexity. #R##N#In this paper, we resolve this discrepancy by introducing a hybrid of the Descartes method and Newton iteration, denoted ANEWDSC, which is simpler than Pan's method, but achieves a run-time comparable to it. Our algorithm computes isolating intervals for the real roots of any real square-free polynomial, given by an oracle that provides arbitrary good approximations of the polynomial's coefficients. ANEWDSC can also be used to only isolate the roots in a given interval and to refine the isolating intervals to an arbitrary small size; it achieves near optimal complexity for the latter task.

Connected through hyperedge HE-1 (induced by source paper "alternating minimization based trajectory generation for quadrotor aggressive flight"):
  with members:
    - "detailed proofs of alternating minimization based trajectory generation for quadrotor aggressive flight"
    - "teach repeat replan a complete and robust system for aggressive flight in complex environments"
    - "fast uav trajectory optimization using bilevel optimization with analytical gradients"
    - "vins mono a robust and versatile monocular visual inertial state estimator"
    - "a hybrid method for online trajectory planning of mobile robots in cluttered environments"
    - "sampling based algorithms for optimal motion planning"
    - "univariate polynomial real root isolation continued fractions revisited"

Connected through hyperedge HE-2 (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-3 (induced by source paper "new practical advances in polynomial root clustering"):
  with members:
    - "implementation of a near optimal complex root clustering algorithm"
    - "polynomial factorization is simple and helpful more so than it seems to be"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "polynomial root clustering and explicit deflation"):
  with members:
    - "polynomial factorization is simple and helpful more so than it seems to be"
    - "computing real roots of real polynomials and now for real"

Connected through hyperedge HE-5 (induced by source paper "implementation of a near optimal complex root clustering algorithm"):
  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"

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

Connected through hyperedge HE-7 (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"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-8 (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"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"

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)