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 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.

Connected through hyperedge HE-1 (induced by source paper "planar diameter via metric compression"):
  with members:
    - "exact distance oracles for planar graphs with failing vertices"
    - "minor excluded network families admit fast distributed algorithms"
    - "distributed treewidth computation"
    - "faster distributed shortest path approximations via shortcuts"
    - "constant query time 1 epsilon approximate distance oracle for planar graphs"
    - "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time"
    - "better tradeoffs for exact distance oracles in planar graphs"
    - "a faster distributed single source shortest paths algorithm"

Connected through hyperedge HE-2 (induced by source paper "almost optimal distance oracles for planar graphs"):
  with members:
    - "holiest minimum cost paths and flows in surface graphs"
    - "exact distance oracles for planar graphs with failing vertices"
    - "constant query time 1 epsilon approximate distance oracle for planar graphs"
    - "better tradeoffs for exact distance oracles in planar graphs"
    - "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs"
    - "approximate distance oracles for planar graphs with improved query time space tradeoff"
    - "minimum cut of directed planar graphs in o nloglogn time"
    - "structured recursive separator decompositions for planar graphs in linear time"

Connected through hyperedge HE-3 (induced by source paper "exact distance oracles for planar graphs with failing vertices"):
  with members:
    - "almost optimal distance oracles for planar graphs"
    - "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time"
    - "improved bounds for shortest paths in dense distance graphs"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "multiple source shortest paths in embedded graphs"
    - "exact distance oracles for planar graphs"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"

Connected through hyperedge HE-4 (induced by source paper "exploiting hopsets improved distance oracles for graphs of constant highway dimension and beyond"):
  with members:
    - "linear size hopsets with small hopbound and distributed routing with low memory"
    - "better tradeoffs for exact distance oracles in planar graphs"
    - "beyond highway dimension small distance labels using tree skeletons"
    - "algorithmic and hardness results for the hub labeling problem"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "sublinear space distance labeling using hubs"
    - "sublinear distance labeling"

Connected through hyperedge HE-5 (induced by source paper "exact distance oracles using hopsets"):
  with members:
    - "linear size hopsets with small hopbound and distributed routing with low memory"
    - "beyond highway dimension small distance labels using tree skeletons"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "sublinear space distance labeling using hubs"
    - "transitive closure spanners"

Connected through hyperedge HE-6 (induced by source paper "dynamic all scores matrices for lcs score"):
  with members:
    - "multiple source shortest paths in embedded graphs"
    - "exact distance oracles for planar graphs"
    - "semi local string comparison algorithmic techniques and applications"

Connected through hyperedge HE-7 (induced by source paper "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs"):
  with members:
    - "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time"
    - "better tradeoffs for exact distance oracles in planar graphs"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "faster shortest paths in dense distance graphs with applications"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "multiple source shortest paths in embedded graphs"
    - "approximating the diameter of planar graphs in near linear time"
    - "linear space approximate distance oracles for planar bounded genus and minor free graphs"

Connected through hyperedge HE-8 (induced by source paper "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time"):
  with members:
    - "tree edit distance cannot be computed in strongly subcubic time unless apsp can"
    - "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs"
    - "improving viterbi is hard better runtimes imply faster clique algorithms"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "exact weight subgraphs and the k sum conjecture"
    - "faster all pairs shortest paths via circuit complexity"

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)