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: "kinetic stable delaunay graphs"
  Abstract: We consider the problem of maintaining the Euclidean Delaunay triangulation $\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the number of topological changes in the full $\DT$ is nearly cubic, we seek to maintain a suitable portion of it that is less volatile yet retains many useful properties. We introduce the notion of a stable Delaunay graph, which is a dynamic subgraph of the Delaunay triangulation. The stable Delaunay graph (a) is easy to define, (b) experiences only a nearly quadratic number of discrete changes, (c) is robust under small changes of the norm, and (d) possesses certain useful properties. #R##N#The stable Delaunay graph ($\SDG$ in short) is defined in terms of a parameter $\alpha>0$, and consists of Delaunay edges $pq$ for which the angles at which $p$ and $q$ see their Voronoi edge $e_{pq}$ are at least $\alpha$. We show that (i) $\SDG$ always contains at least roughly one third of the Delaunay edges; (ii) it contains the $\beta$-skeleton of $P$, for $\beta=1+\Omega(\alpha^2)$; (iii) it is stable, in the sense that its edges survive for long periods of time, as long as the orientations of the segments connecting (nearby) points of $P$ do not change by much; and (iv) stable Delaunay edges remain stable (with an appropriate redefinition of stability) if we replace the Euclidean norm by any sufficiently close norm. #R##N#In particular, we can approximate the Euclidean norm by a polygonal norm (namely, a regular $k$-gon, with $k=\Theta(1/\alpha)$), and keep track of a Euclidean $\SDG$ by maintaining the full Delaunay triangulation of $P$ under the polygonal norm. #R##N#We describe two kinetic data structures for maintaining $\SDG$. Both structures use $O^*(n)$ storage and process $O^*(n^2)$ events during the motion, each in $O^*(1)$ time.

Connected through hyperedge HE-1 (induced by source paper "stable delaunay graphs"):
  with members:
    - "kinetic voronoi diagrams and delaunay triangulations under polygonal distance functions"
    - "on kinetic delaunay triangulations a near quadratic bound for unit speed motions"
    - "a simple faster method for kinetic proximity problems"
    - "on topological changes in the delaunay triangulation of moving points"
    - "a kinetic triangulation scheme for moving points in the plane"

Connected through hyperedge HE-2 (induced by source paper "kinetic voronoi diagrams and delaunay triangulations under polygonal distance functions"):
  with members:
    - "stable delaunay graphs"
    - "on kinetic delaunay triangulations a near quadratic bound for unit speed motions"
    - "on topological changes in the delaunay triangulation of moving points"

Connected through hyperedge HE-3 (induced by source paper "on kinetic delaunay triangulations a near quadratic bound for unit speed motions"):
  with members:
    - "kinetic voronoi diagrams and delaunay triangulations under polygonal distance functions"
    - "on topological changes in the delaunay triangulation of moving points"
    - "a kinetic triangulation scheme for moving points in the plane"

Connected through hyperedge HE-4 (induced by source paper "a simple faster method for kinetic proximity problems"):
  with members:
    - "on kinetic delaunay triangulations a near quadratic bound for unit speed motions"
    - "on topological changes in the delaunay triangulation of moving points"
    - "sharp bounds on davenport schinzel sequences of every order"

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

Connected through hyperedge HE-6 (induced by source paper "on topological changes in the delaunay triangulation of moving points"):
  with members:
    - "on kinetic delaunay triangulations a near quadratic bound for unit speed motions"
    - "a kinetic triangulation scheme for moving points in the plane"

Connected through hyperedge HE-7 (induced by source paper "the geometric stability of voronoi diagrams in normed spaces which are not uniformly convex"):
  with members:
    - "on the computation of zone and double zone diagrams"
    - "the geometric stability of voronoi diagrams with respect to small changes of the sites"
    - "distance k sectors exist"

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)