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: "fast precise and dynamic distance queries"
  Abstract: We present an approximate distance oracle for a point set S with n points and doubling dimension {\lambda}. For every {\epsilon}>0, the oracle supports (1+{\epsilon})-approximate distance queries in (universal) constant time, occupies space [{\epsilon}^{-O({\lambda})} + 2^{O({\lambda} log {\lambda})}]n, and can be constructed in [2^{O({\lambda})} log3 n + {\epsilon}^{-O({\lambda})} + 2^{O({\lambda} log {\lambda})}]n expected time. This improves upon the best previously known constructions, presented by Har-Peled and Mendel. Furthermore, the oracle can be made fully dynamic with expected O(1) query time and only 2^{O({\lambda})} log n + {\epsilon}^{-O({\lambda})} + 2^{O({\lambda} log {\lambda})} update time. This is the first fully dynamic (1+{\epsilon})-distance oracle.

Connected through hyperedge HE-1 (induced by source paper "on strong diameter padded decompositions"):
  with members:
    - "light spanners for high dimensional norms via stochastic decompositions"
    - "ramsey spanning trees and their applications"
    - "the greedy spanner is existentially optimal"
    - "efficient algorithms for constructing very sparse spanners and emulators"
    - "a linear size logarithmic stretch path reporting distance oracle for general graphs"
    - "a light metric spanner"
    - "metric decompositions of path separable graphs"
    - "space efficient path reporting approximate distance oracles"

Connected through hyperedge HE-2 (induced by source paper "near linear time approximation schemes for clustering in doubling metrics"):
  with members:
    - "travelling on graphs with small highway dimension"
    - "the parameterized hardness of the k center problem in transportation networks"
    - "approximation schemes for capacitated clustering in doubling metrics"
    - "a fast approximation scheme for low dimensional k means"
    - "approximation schemes for clustering with outliers"
    - "constant approximation for k median and k means with outliers via iterative rounding"
    - "a ptas for the steiner forest problem in doubling metrics"
    - "better guarantees for k means and euclidean k median by primal dual algorithms"

Connected through hyperedge HE-3 (induced by source paper "hierarchical oracles for time dependent networks"):
  with members:
    - "route planning in transportation networks"
    - "distance oracles for time dependent networks"
    - "approximate distance oracles with improved query time"
    - "approximate distance oracles with improved preprocessing time"

Connected through hyperedge HE-4 (induced by source paper "hierarchical time dependent oracles"):
  with members:
    - "route planning in transportation networks"
    - "distance oracles for time dependent networks"
    - "approximate distance oracles with improved query time"
    - "approximate distance oracles with improved preprocessing time"

Connected through hyperedge HE-5 (induced by source paper "dimension reduction techniques for ell_p 1 le p infty with applications"):
  with members:
    - "approximate nearest neighbor search in ell_p"
    - "a nonlinear approach to dimension reduction"
    - "fast construction of nets in low dimensional metrics and their applications"
    - "entropy based nearest neighbor search in high dimensions"
    - "minimum enclosing polytope in high dimensions"

Connected through hyperedge HE-6 (induced by source paper "linear space approximate distance oracles for planar bounded genus and minor free graphs"):
  with members:
    - "improved distance queries in planar graphs"
    - "exact distance oracles for planar graphs"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"
    - "ramsey partitions and proximity data structures"
    - "fast construction of nets in low dimensional metrics and their applications"
    - "maintaining information in fully dynamic trees with top trees"
    - "dynamic generators of topologically embedded graphs"

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.DS(Data Structures and Algorithms)