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: "fully retroactive approximate range and nearest neighbor searching"
  Abstract: We describe fully retroactive dynamic data structures for approximate range reporting and approximate nearest neighbor reporting. We show how to maintain, for any positive constant $d$, a set of $n$ points in $\R^d$ indexed by time such that we can perform insertions or deletions at any point in the timeline in $O(\log n)$ amortized time. We support, for any small constant $\epsilon>0$, $(1+\epsilon)$-approximate range reporting queries at any point in the timeline in $O(\log n + k)$ time, where $k$ is the output size. We also show how to answer $(1+\epsilon)$-approximate nearest neighbor queries for any point in the past or present in $O(\log n)$ time.

Connected through hyperedge HE-1 (induced by source paper "upper and lower bounds for fully retroactive graph problems"):
  with members:
    - "a deamortization approach for dynamic spanner and dynamic maximal matching"
    - "fully dynamic maximal matching in constant update time"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "faster fully dynamic minimum spanning forest"
    - "cloning voronoi diagrams via retroactive data structures"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-2 (induced by source paper "nearly optimal separation between partially and fully retroactive data structures"):
  with members:
    - "conditional lower bounds for space time tradeoffs"
    - "conditional hardness for sensitivity problems"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"
    - "threesomes degenerates and love triangles"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "higher lower bounds from the 3sum conjecture"
    - "searching in dynamic catalogs on a tree"

Connected through hyperedge HE-3 (induced by source paper "windows into geometric events data structures for time windowed querying of temporal point sets"):
  with members:
    - "triangulating the square and squaring the triangle quadtrees and delaunay triangulations are equivalent"
    - "windows into relational events data structures for contiguous subsequences of edges"
    - "orthogonal range searching on the ram revisited"
    - "the skip quadtree a simple dynamic data structure for multidimensional data"
    - "internet packet filter management and rectangle geometry"

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)