human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a simple faster method for kinetic proximity problems"):
  Abstract: For a set of $n$ points in the plane, this paper presents simple kinetic data structures (KDS's) for solutions to some fundamental proximity problems, namely, the all nearest neighbors problem, the closest pair problem, and the Euclidean minimum spanning tree (EMST) problem. Also, the paper introduces KDS's for maintenance of two well-studied sparse proximity graphs, the Yao graph and the Semi-Yao graph. #R##N#We use sparse graph representations, the Pie Delaunay graph and the Equilateral Delaunay graph, to provide new solutions for the proximity problems. Then we design KDS's that efficiently maintain these sparse graphs on a set of $n$ moving points, where the trajectory of each point is assumed to be an algebraic function of constant maximum degree $s$. We use the kinetic Pie Delaunay graph and the kinetic Equilateral Delaunay graph to create KDS's for maintenance of the Yao graph, the Semi-Yao graph, all the nearest neighbors, the closest pair, and the EMST. Our KDS's use $O(n)$ space and $O(n\log n)$ preprocessing time. #R##N#We provide the first KDS's for maintenance of the Semi-Yao graph and the Yao graph. Our KDS processes $O(n^2\beta_{2s+2}(n))$ (resp. $O(n^3\beta_{2s+2}^2(n)\log n)$) events to maintain the Semi-Yao graph (resp. the Yao graph); each event can be processed in time $O(\log n)$ in an amortized sense. Here, $\beta_s(n)$ is an extremely slow-growing function. #R##N#Our KDS for maintenance of all the nearest neighbors and the closest pair processes $O(n^2\beta^2_{2s+2}(n)\log n)$ events. For maintenance of the EMST, our KDS processes $O(n^3\beta_{2s+2}^2(n)\log n)$ events. For all three of these problems, each event can be handled in time $O(\log n)$ in an amortized sense. #R##N#We improve the previous randomized kinetic algorithm for maintenance of all the nearest neighbors by Agarwal, Kaplan, and Sharir, and the previous EMST KDS by Rahmati and Zarei.

Includes members:
  Member "on kinetic delaunay triangulations a near quadratic bound for unit speed motions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "kinetic geodesic voronoi diagrams in a simple polygon")
  Member "on topological changes in the delaunay triangulation of moving points":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a framework for algorithm stability")
  Member "sharp bounds on davenport schinzel sequences of every order":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an algorithm for bounding extremal functions of forbidden sequences")
  Member "kinetic stable delaunay graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stable delaunay graphs")

Question: Please tell me which class the source paper 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)