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: "a worst case bound for topology computation of algebraic curves"
  Abstract: Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with coefficients bounded by $2^\rho$, the topology of the induced curve can be computed with $\tilde{O}(n^8(n+\rho^2))$ bit operations deterministically, and with $\tilde{O}(n^8\rho^2)$ bit operations with a randomized algorithm in expectation. Our analysis improves previous best known complexity bounds by a factor of $n^2$. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and by the consequent amortized analysis of the critical fibers of the algebraic curve.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of computing with planar algebraic curves"):
  with members:
    - "improved algorithm for computing separating linear forms for bivariate systems"
    - "fast approximate polynomial multipoint evaluation and applications"
    - "a generic position based method for real root isolation of zero dimensional polynomial systems"
    - "rational univariate representations of bivariate systems and applications"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "separating linear forms for bivariate systems"
    - "exact symbolic numeric computation of planar algebraic curves"
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"

Connected through hyperedge HE-2 (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"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "a generic position based method for real root isolation of zero dimensional polynomial systems"):
  with members:
    - "exact symbolic numeric computation of planar algebraic curves"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "on the complexity of solving a bivariate polynomial system"
    - "root isolation of zero dimensional polynomial systems with linear univariate representation"
    - "parallel computation of real solving bivariate polynomial systems by zero matching method"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-4 (induced by source paper "separating linear forms for bivariate systems"):
  with members:
    - "solving bivariate systems efficient worst case algorithm for computing rational univariate representations and applications"
    - "rational univariate representations of bivariate systems and applications"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "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-5 (induced by source paper "on the complexity of solving a bivariate polynomial system"):
  with members:
    - "arrangement computation for planar algebraic curves"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "univariate real root isolation in an extension field"
    - "the dmm bound multivariate aggregate separation bounds"
    - "on the complexity of real root isolation"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"
    - "fast multipoint evaluation of bivariate polynomials"

Connected through hyperedge HE-6 (induced by source paper "root refinement for real polynomials"):
  with members:
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "on the complexity of real root isolation"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"

Connected through hyperedge HE-7 (induced by source paper "on the complexity of real root isolation"):
  with members:
    - "univariate real root isolation in an extension field"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

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)