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 "fast and compact exact distance oracle for planar graphs"):
  Abstract: For a given a graph, a distance oracle is a data structure that answers distance queries between pairs of vertices. We introduce an $O(n^{5/3})$-space distance oracle which answers exact distance queries in $O(\log n)$ time for $n$-vertex planar edge-weighted digraphs. All previous distance oracles for planar graphs with truly subquadratic space i.e., space $O(n^{2 - \epsilon})$ for some constant $\epsilon > 0$) either required query time polynomial in $n$ or could only answer approximate distance queries. #R##N#Furthermore, we show how to trade-off time and space: for any $S \ge n^{3/2}$, we show how to obtain an $S$-space distance oracle that answers queries in time $O((n^{5/2}/ S^{3/2}) \log n)$. This is a polynomial improvement over the previous planar distance oracles with $o(n^{1/4})$ query time.

Includes members:
  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-1 (induced by source paper "planar diameter via metric compression")
  Member "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "rounding dynamic matchings against an adaptive adversary")
  Member "approximate distance oracles for planar graphs with improved query time space tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "almost optimal distance oracles for planar graphs")
  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 "approximate distance oracles with improved preprocessing time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "faster approximation algorithms for computing shortest cycles on weighted graphs")
  Member "linear space approximate distance oracles for planar bounded genus and minor free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "holiest minimum cost paths and flows in surface 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.DS(Data Structures and Algorithms)