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: "on topological changes in the delaunay triangulation of moving points"
  Abstract: Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic bound, on the maximum number of discrete changes that the Delaunay triangulation $\DT(P)$ of $P$ experiences during the motion of the points of $P$. #R##N#In this paper we obtain an upper bound of $O(n^{2+\eps})$, for any $\eps>0$, under the assumptions that (i) any four points can be co-circular at most twice, and (ii) either no triple of points can be collinear more than twice, or no ordered triple of points can be collinear more than once.

Connected through hyperedge HE-1 (induced by source paper "a framework for algorithm stability"):
  with members:
    - "consistent labeling of rotating maps"
    - "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time"

Connected through hyperedge HE-2 (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"
    - "kinetic stable delaunay graphs"
    - "a kinetic triangulation scheme for moving points in the plane"

Connected through hyperedge HE-3 (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"
    - "kinetic stable delaunay graphs"

Connected through hyperedge HE-4 (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"
    - "kinetic stable delaunay graphs"
    - "a kinetic triangulation scheme for moving points in the plane"

Connected through hyperedge HE-5 (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"
    - "sharp bounds on davenport schinzel sequences of every order"
    - "kinetic stable delaunay graphs"

Connected through hyperedge HE-6 (induced by source paper "kinetic data structures for the semi yao graph and all nearest neighbors in r d"):
  with members:
    - "the θ 5 graph is a spanner"
    - "on the stretch factor of the theta 4 graph"

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)