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: "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"
  Abstract: Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on subdivision algorithms because of their adaptive complexity and ease of implementation. Plantinga and Vegter gave a numerical subdivision algorithm that is exact when the curve S is bounded and non-singular. They used a computational model that relied only on function evaluation and interval arithmetic. We generalize their algorithm to any bounded (but possibly non-simply connected) region that does not contain singularities of S. With this generalization as a subroutine, we provide a method to detect isolated algebraic singularities and their branching degree. This appears to be the first complete purely numerical method to compute isotopic approximations of algebraic curves with isolated singularities.

Connected through hyperedge HE-1 (induced by source paper "visualizing planar and space implicit real algebraic curves with singularities"):
  with members:
    - "triangular decomposition of semi algebraic systems"

Connected through hyperedge HE-2 (induced by source paper "the complexity of subdivision for diameter distance tests"):
  with members:
    - "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"
    - "root isolation of zero dimensional polynomial systems with linear univariate representation"

Connected through hyperedge HE-3 (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"
    - "a worst case bound for topology computation of algebraic curves"

Connected through hyperedge HE-4 (induced by source paper "numeric certified algorithm for the topology of resultant and discriminant curves"):
  with members:
    - "on the complexity of solving a bivariate polynomial system"
    - "explicit factors of some iterated resultants and discriminants"

Connected through hyperedge HE-5 (induced by source paper "applications of continuous amortization to bisection based root isolation"):
  with members:
    - "computing real roots of real polynomials"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "on the complexity of real root isolation"

Connected through hyperedge HE-6 (induced by source paper "exact symbolic numeric computation of planar algebraic curves"):
  with members:
    - "arrangement computation for planar 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-7 (induced by source paper "certified rational parametric approximation of real algebraic space curves with local generic position method"):
  with members:
    - "exact symbolic numeric computation of planar algebraic curves"
    - "root isolation of zero dimensional polynomial systems with linear univariate representation"

Connected through hyperedge HE-8 (induced by source paper "a worst case bound for topology computation of algebraic curves"):
  with members:
    - "arrangement computation for planar 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.CG(Computational Geometry)