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 "constant query time 1 epsilon approximate distance oracle for planar graphs"):
  Abstract: We give a $(1+\epsilon)$-approximate distance oracle with $O(1)$ query time for an undirected planar graph $G$ with $n$ vertices and non-negative edge lengths. For $\epsilon>0$ and any two vertices $u$ and $v$ in $G$, our oracle gives a distance $\tilde{d}(u,v)$ with stretch $(1+\epsilon)$ in $O(1)$ time. The oracle has size $O(n\log n ((\log n)/\epsilon+f(\epsilon)))$ and pre-processing time $O(n\log n((\log^3 n)/\epsilon^2+f(\epsilon)))$, where $f(\epsilon)=2^{O(1/\epsilon)}$. This is the first $(1+\epsilon)$-approximate distance oracle with $O(1)$ query time independent of $\epsilon$ and the size and pre-processing time nearly linear in $n$, and improves the query time $O(1/\epsilon)$ of previous $(1+\epsilon)$-approximate distance oracle with size nearly linear in $n$.

Includes members:
  Member "approximate distance oracles for planar graphs with improved query time space tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "almost optimal distance oracles for planar graphs")
  Member "approximate distance oracle with constant query time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "almost shortest paths and pram distance oracles in weighted graphs")
  Member "structured recursive separator decompositions for planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the edge crossings of the greedy spanner")
  Member "approximating the diameter of planar graphs in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "planar diameter via metric compression")
  Member "exact distance oracles for planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a divide and conquer algorithm for two point l_1 shortest path queries in polygonal domains")

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