human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "approximate distance oracles subject to multiple vertex failures"):
  with members:
    - "sensitive distance and reachability oracles for large batch updates"
    - "generic single edge fault tolerant exact distance oracle"
    - "a trivial yet optimal solution to vertex fault tolerant spanners"
    - "exact distance oracles for planar graphs with failing vertices"
    - "preserving distances in very faulty graphs"
    - "optimal vertex fault tolerant spanners for fixed stretch"
    - "connectivity oracles for graphs subject to vertex failures"
    - "multiple edge fault tolerant approximate shortest path trees"

Connected through hyperedge HE-2 (induced by source paper "a trivial yet optimal solution to vertex fault tolerant spanners"):
  with members:
    - "preserving distances in very faulty graphs"
    - "optimal vertex fault tolerant spanners for fixed stretch"
    - "the greedy spanner is existentially optimal"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "compact and fast sensitivity oracles for single source distances"
    - "dual failure resilient bfs structure"
    - "the 4 3 additive spanner exponent is tight"
    - "sparse fault tolerant bfs trees"

Connected through hyperedge HE-3 (induced by source paper "preserving distances in very faulty graphs"):
  with members:
    - "connectivity oracles for graphs subject to vertex failures"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "linear size distance preservers"
    - "dual failure resilient bfs structure"
    - "better distance preservers and additive spanners"
    - "the 4 3 additive spanner exponent is tight"
    - "improved purely additive fault tolerant spanners"
    - "fault tolerant approximate shortest path trees"

Connected through hyperedge HE-4 (induced by source paper "optimal vertex fault tolerant spanners for fixed stretch"):
  with members:
    - "preserving distances in very faulty graphs"
    - "connectivity oracles for graphs subject to vertex failures"
    - "multiple edge fault tolerant approximate shortest path trees"
    - "improved distance sensitivity oracles via tree partitioning"
    - "compact and fast sensitivity oracles for single source distances"
    - "dual failure resilient bfs structure"
    - "improved purely additive fault tolerant spanners"
    - "fault tolerant approximate shortest path trees"

Connected through hyperedge HE-5 (induced by source paper "near optimal sized weight tolerant subgraph for single source shortest path"):
  with members:
    - "multiple edge fault tolerant approximate shortest path trees"
    - "an efficient strongly connected components algorithm in the fault tolerant model"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "dual failure resilient bfs structure"
    - "the 4 3 additive spanner exponent is tight"
    - "improved purely additive fault tolerant spanners"
    - "fault tolerant approximate shortest path trees"
    - "vertex fault tolerant additive spanners"

Connected through hyperedge HE-6 (induced by source paper "multiple source dual fault tolerant bfs trees"):
  with members:
    - "multiple edge fault tolerant approximate shortest path trees"
    - "dynamic dfs in undirected graphs breaking the o m barrier"
    - "dual failure resilient bfs structure"
    - "improved purely additive fault tolerant spanners"
    - "vertex fault tolerant additive spanners"
    - "sparse fault tolerant bfs trees"
    - "fault tolerant spanners better and simpler"

Connected through hyperedge HE-7 (induced by source paper "connectivity oracles for graphs subject to vertex failures"):
  with members:
    - "dynamic minimum spanning forest with subpolynomial worst case update time"
    - "improved algorithms for maintaining dfs tree in undirected graphs"
    - "fully dynamic connectivity in o log n log log n 2 amortized expected time"
    - "faster randomized worst case update time for dynamic subgraph connectivity"
    - "dynamic dfs in undirected graphs breaking the o m barrier"
    - "incremental and fully dynamic subgraph connectivity for emergency planning"
    - "faster online matrix vector multiplication"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"

Connected through hyperedge HE-8 (induced by source paper "compact and fast sensitivity oracles for single source distances"):
  with members:
    - "dual failure resilient bfs structure"
    - "fault tolerant approximate shortest path trees"
    - "sparse fault tolerant bfs trees"

Question: Please tell me which class the center node 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)