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 "exact distance oracles for planar graphs with failing vertices"):
  Abstract: We consider exact distance oracles for directed weighted planar graphs in the presence of failing vertices. Given a source vertex $u$, a target vertex $v$ and a set $X$ of $k$ failed vertices, such an oracle returns the length of a shortest $u$-to-$v$ path that avoids all vertices in $X$. We propose oracles that can handle any number $k$ of failures. More specifically, for a directed weighted planar graph with $n$ vertices, any constant $k$, and for any $q \in [1,\sqrt n]$, we propose an oracle of size $\tilde{\mathcal{O}}(\frac{n^{k+3/2}}{q^{2k+1}})$ that answers queries in $\tilde{\mathcal{O}}(q)$ time. In particular, we show an $\tilde{\mathcal{O}}(n)$-size, $\tilde{\mathcal{O}}(\sqrt{n})$-query-time oracle for any constant $k$. This matches, up to polylogarithmic factors, the fastest failure-free distance oracles with nearly linear space. For single vertex failures ($k=1$), our $\tilde{\mathcal{O}}(\frac{n^{5/2}}{q^3})$-size, $\tilde{\mathcal{O}}(q)$-query-time oracle improves over the previously best known tradeoff of Baswana et al. [SODA 2012] by polynomial factors for $q = \Omega(n^t)$, $t \in (1/4,1/2]$. For multiple failures, no planarity exploiting results were previously known.

Includes members:
  Member "almost optimal distance oracles for planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "labelings vs embeddings on distributed representations of distances")
  Member "fast and compact exact distance oracle for planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "planar diameter via metric compression")
  Member "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "planar diameter via metric compression")
  Member "improved bounds for shortest paths in dense distance graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "min cost flow in unit capacity planar graphs")
  Member "popular conjectures as a barrier for dynamic planar graph algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rounding dynamic matchings against an adaptive adversary")
  Member "structured recursive separator decompositions for planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the edge crossings of the greedy spanner")
  Member "multiple source shortest paths in embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimum cuts in surface graphs")
  Member "exact distance oracles for planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)