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 "generic single edge fault tolerant exact distance oracle"):
  Abstract: Given an undirected unweighted graph $G$ and a source set $S$ of $|S| = \sigma $ sources, we want to build a data structure which can process the following query {\sc Q}$(s,t,e):$ find the shortest distance from $s$ to $t$ avoiding an edge $e$, where $s \in S$ and $t \in V$. When $\sigma=n$, Demetrescu, Thorup, Chowdhury and Ramachandran (SIAM Journal of Computing, 2008) designed an algorithm with $\tilde O(n^2)$ space ($\tilde O(\cdot)$ hides poly $\log n$ factor.) and $O(1)$ query time. A natural open question is to generalize this result to any number of sources. Recently, Bil{\`o} et. al. (STACS 2018) designed a data-structure of size $\tilde O(\sigma^{1/2}n^{3/2})$ with the query time of $O(\sqrt{n\sigma})$ for the above problem. We improve their result by designing a data-structure of size $\tilde O(\sigma^{1/2} n^{3/2})$ that can answer queries in $\tilde O(1)$ time. #R##N#In a related problem of finding fault tolerant subgraph, Parter and Peleg (ESA 2013) showed that if detours of the {\em replacement} paths ending at a vertex $t$ are disjoint, then the number of such paths is $O(\sqrt{n\sigma})$. This eventually gives a bound of $O( n \sqrt{n \sigma}) = O(\sigma^{1/2}n^{3/2})$ for their problem. {\em Disjointness of detours} is a very crucial property used in the above result. We show a similar result for a subset of replacement path which \textbf{may not} be disjoint. This result is the crux of our paper and may be of independent interest.?

Includes members:
  Member "multiple source dual fault tolerant bfs trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graph spanners a tutorial review")
  Member "multiple edge fault tolerant approximate shortest path trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximate distance oracles subject to multiple vertex failures")
  Member "dynamic dfs in undirected graphs breaking the o m barrier":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "depth first search in the semi streaming model")
  Member "compact and fast sensitivity oracles for single source distances":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a trivial yet optimal solution to vertex fault tolerant spanners")
  Member "dual failure resilient bfs structure":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate distance oracles subject to multiple vertex failures")
  Member "sparse fault tolerant bfs trees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "graph spanners a tutorial review")
  Member "faster replacement paths":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dynamic approximate shortest paths and beyond subquadratic and worst case update time")
  Member "approximate shortest paths avoiding a failed vertex optimal size data structures for unweighted graph":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an efficient strongly connected components algorithm in the fault tolerant model")

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)