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 "near optimal distance emulator for planar graphs"):
  Abstract: Given a graph $G$ and a set of terminals $T$, a \emph{distance emulator} of $G$ is another graph $H$ (not necessarily a subgraph of $G$) containing $T$, such that all the pairwise distances in $G$ between vertices of $T$ are preserved in $H$. An important open question is to find the smallest possible distance emulator. #R##N#We prove that, given any subset of $k$ terminals in an $n$-vertex undirected unweighted planar graph, we can construct in $\tilde O(n)$ time a distance emulator of size $\tilde O(\min(k^2,\sqrt{k\cdot n}))$. This is optimal up to logarithmic factors. The existence of such distance emulator provides a straightforward framework to solve distance-related problems on planar graphs: Replace the input graph with the distance emulator, and apply whatever algorithm available to the resulting emulator. In particular, our result implies that, on any unweighted undirected planar graph, one can compute all-pairs shortest path distances among $k$ terminals in $\tilde O(n)$ time when $k=O(n^{1/3})$.

Includes members:
  Member "near optimal compression for the planar graph metric":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "shorter labels for routing in trees")
  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 "a hierarchy of lower bounds for sublinear additive spanners":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "linear size distance preservers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weighted additive spanners")
  Member "graph minors for preserving terminal distances approximately lower and upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "scattering and sparse partitions and their applications")
  Member "a linear size logarithmic stretch path reporting distance oracle for general graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on strong diameter padded decompositions")
  Member "sublinear space distance labeling using hubs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "shorter labels for routing in trees")
  Member "submatrix maximum queries in monge matrices are equivalent to predecessor search":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths")

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)