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: "delaunay stability via perturbations"
  Abstract: We present an algorithm that takes as input a finite point set in Euclidean space, and performs a perturbation that guarantees that the Delaunay triangulation of the resulting perturbed point set has quantifiable stability with respect to the metric and the point positions. There is also a guarantee on the quality of the simplices: they cannot be too flat. The algorithm provides an alternative tool to the weighting or refinement methods to remove poorly shaped simplices in Delaunay triangulations of arbitrary dimension, but in addition it provides a guarantee of stability for the resulting triangulation.

Connected through hyperedge HE-1 (induced by source paper "delaunay simplices in diagonally distorted lattices"):
  with members:
    - "anisotropic triangulations via discrete riemannian voronoi diagrams"
    - "polynomial sized topological approximations using the permutahedron"
    - "sphere packing with limited overlap"
    - "only distances are required to reconstruct submanifolds"
    - "the stability of delaunay triangulations"

Connected through hyperedge HE-2 (induced by source paper "a probabilistic approach to reducing the algebraic complexity of computing delaunay triangulations"):
  with members:
    - "the simplex tree an efficient data structure for general simplicial complexes"
    - "only distances are required to reconstruct submanifolds"
    - "the stability of delaunay triangulations"
    - "a constructive proof of the general lovasz local lemma"

Connected through hyperedge HE-3 (induced by source paper "only distances are required to reconstruct submanifolds"):
  with members:
    - "the simplex tree an efficient data structure for general simplicial complexes"
    - "the stability of delaunay triangulations"
    - "constructing intrinsic delaunay triangulations of submanifolds"
    - "towards persistence based reconstruction in euclidean spaces"

Connected through hyperedge HE-4 (induced by source paper "delaunay triangulation of manifolds"):
  with members:
    - "technical note delaunay hodge star"
    - "the stability of delaunay triangulations"
    - "constructing intrinsic delaunay triangulations of submanifolds"

Connected through hyperedge HE-5 (induced by source paper "the stability of delaunay triangulations"):
  with members:
    - "delaunay triangulation of manifolds"
    - "kinetic stable delaunay graphs"
    - "duals of orphan free anisotropic voronoi diagrams are triangulations"

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)