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: "numeric certified algorithm for the topology of resultant and discriminant curves"
  Abstract: Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of#R##N#  two polynomials (resp. by the discriminant of a polynomial). Geometrically#R##N#  such a curve is the projection of the intersection of the surfaces#R##N#  $P(x,y,z)=Q(x,y,z)=0$ (resp.#R##N#  $P(x,y,z)=\frac{\partial P}{\partial z}(x,y,z)=0$), and generically its#R##N#  singularities are nodes (resp. nodes and ordinary cusps).  State-of-the-art#R##N#  numerical algorithms compute the topology of smooth curves but usually fail to#R##N#  certify the topology of singular ones. The main challenge is to find practical#R##N#  numerical criteria that guarantee the existence and the uniqueness of a#R##N#  singularity inside a given box $B$, while ensuring that $B$ does not contain#R##N#  any closed loop of $\mathcal{C}$.  We solve this problem by first providing a#R##N#  square deflation system, based on subresultants, that can be used to certify#R##N#  numerically whether $B$ contains a unique singularity $p$ or not.  Then we#R##N#  introduce a numeric adaptive separation criterion based on interval arithmetic#R##N#  to ensure that the topology of $\mathcal C$ in $B$ is homeomorphic to the#R##N#  local topology at $p$.  Our algorithms are implemented and experiments show#R##N#  their efficiency compared to state-of-the-art symbolic or homotopic methods.

Connected through hyperedge HE-1 (induced by source paper "a fast algorithm for computing the truncated resultant"):
  with members:
    - "on the complexity of computing with planar algebraic curves"
    - "improved algorithm for computing separating linear forms for bivariate systems"
    - "rational univariate representations of bivariate systems and applications"
    - "separating linear forms for bivariate systems"
    - "on the complexity of solving a bivariate polynomial system"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"

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)