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 "fault tolerant approximate bfs structures"):
  Abstract: This paper addresses the problem of designing a {\em fault-tolerant} $(\alpha, \beta)$ approximate BFS structure (or {\em FT-ABFS structure} for short), namely, a subgraph $H$ of the network $G$ such that subsequent to the failure of some subset $F$ of edges or vertices, the surviving part of $H$ still contains an \emph{approximate} BFS spanning tree for (the surviving part of) $G$, satisfying $dist(s,v,H\setminus F) \leq \alpha \cdot dist(s,v,G\setminus F)+\beta$ for every $v \in V$. We first consider {\em multiplicative} $(\alpha,0)$ FT-ABFS structures resilient to a failure of a single edge and present an algorithm that given an $n$-vertex unweighted undirected graph $G$ and a source $s$ constructs a $(3,0)$ FT-ABFS structure rooted at $s$ with at most $4n$ edges (improving by an $O(\log n)$ factor on the near-tight result of \cite{BS10} for the special case of edge failures). Assuming at most $f$ edge failures, for constant integer $f>1$, we prove that there exists a (poly-time constructible) $(3(f+1), (f+1) \log n)$ FT-ABFS structure with $O(f n)$ edges. #R##N#We then consider {\em additive} $(1,\beta)$ FT-ABFS structures. In contrast to the linear size of $(\alpha,0)$ FT-ABFS structures, we show that for every $\beta \in [1, O(\log n)]$ there exists an $n$-vertex graph $G$ with a source $s$ for which any $(1,\beta)$ FT-ABFS structure rooted at $s$ has $\Omega(n^{1+\epsilon(\beta)})$ edges, for some function $\epsilon(\beta) \in (0,1)$. In particular, $(1,3)$ FT-ABFS structures admit a lower bound of $\Omega(n^{5/4})$ edges. Our lower bounds are complemented by an upper bound, showing that there exists a poly-time algorithm that for every $n$-vertex unweighted undirected graph $G$ and source $s$ constructs a $(1,4)$ FT-ABFS structure rooted at $s$ with at most $O(n^{4/3})$ edges.

Includes members:
  Member "preserving distances in very faulty graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximate distance oracles subject to multiple vertex failures")
  Member "the 4 3 additive spanner exponent is tight":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weighted additive spanners")
  Member "improved purely additive fault tolerant spanners":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph spanners a tutorial review")
  Member "fault tolerant approximate shortest path trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-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 "on pairwise spanners":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "weighted additive spanners")
  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)