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: "arrangement computation for planar algebraic curves"
  Abstract: We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition of the plane. Compared to previous approaches, we improve in two main aspects: Firstly, we significantly reduce the amount of exact operations, that is, our algorithms only uses resultant and gcd as purely symbolic operations. Secondly, we introduce a new hybrid method in the lifting step of our algorithm which combines the usage of a certified numerical complex root solver and information derived from the resultant computation. Additionally, we never consider any coordinate transformation and the output is also given with respect to the initial coordinate system. We implemented our algorithm as a prototypical package of the C++-library CGAL. Our implementation exploits graphics hardware to expedite the resultant and gcd computation. We also compared our implementation with the current reference implementation, that is, CGAL's curve analysis and arrangement for algebraic curves. For various series of challenging instances, our experiments show that the new implementation outperforms the existing one.

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"
    - "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-2 (induced by source paper "exact symbolic numeric computation of planar algebraic curves"):
  with members:
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"
    - "on the complexity of solving a bivariate polynomial system"
    - "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-3 (induced by source paper "homeomorphic approximation of the intersection curve of two rational surfaces"):
  with members:
    - "certified approximation of parametric space curves with cubic b spline curves"
    - "ambient isotopic meshing of implicit algebraic surface with singularities"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of solving a bivariate polynomial system"):
  with members:
    - "a worst case bound for topology computation of 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-5 (induced by source paper "a worst case bound for topology computation of algebraic curves"):
  with members:
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"
    - "root refinement for real polynomials"
    - "on the complexity of real root isolation"
    - "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)