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 "dual failure resilient bfs structure"):
  Abstract: We study {\em breadth-first search (BFS)} spanning trees, and address the problem of designing a sparse {\em fault-tolerant} BFS structure, or {\em FT-BFS } for short, resilient to the failure of up to two edges in the given undirected unweighted graph $G$, i.e., a sparse subgraph $H$ of $G$ such that subsequent to the failure of up to two edges, the surviving part $H'$ of $H$ still contains a BFS spanning tree for (the surviving part of) $G$. FT-BFS structures, as well as the related notion of replacement paths, have been studied so far for the restricted case of a single failure. It has been noted widely that when concerning shortest-paths in a variety of contexts, there is a sharp qualitative difference between a single failure and two or more failures. #R##N#Our main results are as follows. We present an algorithm that for every $n$-vertex unweighted undirected graph $G$ and source node $s$ constructs a (two edge failure) FT-BFS structure rooted at $s$ with $O(n^{5/3})$ edges. To provide a useful theory of shortest paths avoiding 2 edges failures, we take a principled approach to classifying the arrangement these paths. We believe that the structural analysis provided in this paper may decrease the barrier for understanding the general case of $f\geq 2$ faults and pave the way to the future design of $f$-fault resilient structures for $f \geq 2$. We also provide a matching lower bound, which in fact holds for the general case of $f \geq 1$ and multiple sources $S \subseteq V$. It shows that for every $f\geq 1$, and integer $1 \leq \sigma \leq n$, there exist $n$-vertex graphs with a source set $S \subseteq V$ of cardinality $\sigma$ for which any FT-BFS structure rooted at each $s \in S$, resilient to up to $f$-edge faults has $\Omega(\sigma^{1/(f+1)} \cdot n^{2-1/(f+1)})$ edges.

Includes members:
  Member "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 "fault tolerant approximate bfs structures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "graph spanners a tutorial review")
  Member "fault tolerant spanners better and simpler":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)