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 "multiple source dual fault tolerant bfs trees"):
  Abstract: Let $G=(V,E)$ be a graph with $n$ vertices and $m$ edges, with a designated set of $\sigma$ sources $S\subseteq V$. The fault tolerant subgraph for any graph problem maintains a sparse subgraph $H$ of $G$, such that for any set $F$ of $k$ failures, the solution for the graph problem on $G\setminus F$ is maintained in $H\setminus F$. We address the problem of maintaining a fault tolerant subgraph for Breath First Search tree (BFS) of the graph from a single source $s\in V$ (referred as $k$ FT-BFS) or multiple sources $S\subseteq V$ (referred as $k$ FT-MBFS). #R##N#The problem of $k$ FT-BFS was first studied by Parter and Peleg [ESA13]. They designed an algorithm to compute FT-BFS subgraph of size $O(n^{3/2})$. Further, they showed how their algorithm can be easily extended to FT-MBFS requiring $O(\sigma^{1/2}n^{3/2})$ space. They also presented matching lower bounds for these results. The result was later extended to solve dual FT-BFS by Parter [PODC15] requiring $O(n^{5/3})$ space, again with matching lower bounds. However, their result was limited to only edge failures in undirected graphs and involved very complex analysis. Moreover, their solution doesn't seems to be directly extendible for dual FT-MBFS problem. #R##N#We present a similar algorithm to solve dual FT-BFS problem with a much simpler analysis. Moreover, our algorithm also works for vertex failures and directed graphs, and can be easily extended to handle dual FT-MBFS problem, matching the lower bound of $O(\sigma^{1/3}n^{5/3})$ space described by Parter [PODC15].The key difference in our approach is a much simpler classification of path interactions which formed the basis of the analysis by Parter [PODC15]. Our dual FT-MBFS structure also seamlessly gives a dual fault tolerant spanner with additive stretch of +2 having size $O(n^{7/8})$.

Includes members:
  Member "multiple edge fault tolerant approximate shortest path trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "depth first search in the semi streaming model")
  Member "dual failure resilient bfs structure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate distance oracles subject to multiple vertex failures")
  Member "improved purely additive fault tolerant spanners":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph spanners a tutorial review")
  Member "fault tolerant approximate bfs structures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate distance oracles subject to multiple vertex failures")
  Member "vertex fault tolerant additive spanners":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "graph spanners a tutorial review")
  Member "fault tolerant spanners better and simpler":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximate distance oracles subject to multiple vertex failures")

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)