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 shortest path trees"
  Abstract: Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of $G$ with a \emph{sparse} set of \emph{auxiliary} edges selected from $E$, in order to create a structure which tolerates effectively a \emph{path failure} in the SPT. This consists of a simultaneous fault of a set $F$ of at most $f$ adjacent edges along a shortest path emanating from the source, and it is recognized as one of the most frequent disruption in an SPT. We show that, for any integer parameter $k \geq 1$, it is possible to provide a very sparse (i.e., of size $O(kn\cdot f^{1+1/k})$) auxiliary structure that carefully approximates (i.e., within a stretch factor of $(2k-1)(2|F|+1)$) the true shortest paths from the source during the lifetime of the failure. Moreover, we show that our construction can be further refined to get a stretch factor of $3$ and a size of $O(n \log n)$ for the special case $f=2$, and that it can be converted into a very efficient \emph{approximate-distance sensitivity oracle}, that allows to quickly (even in optimal time, if $k=1$) reconstruct the shortest paths (w.r.t. our structure) from the source after a path failure, thus permitting to perform promptly the needed rerouting operations. Our structure compares favorably with previous known solutions, as we discuss in the paper, and moreover it is also very effective in practice, as we assess through a large set of experiments.

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 "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 bfs structures"

Connected through hyperedge HE-3 (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 bfs structures"

Connected through hyperedge HE-4 (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 bfs structures"
    - "vertex fault tolerant additive spanners"

Connected through hyperedge HE-5 (induced by source paper "effective edge fault tolerant single source spanners via best or good swap edges"):
  with members:
    - "improved purely additive fault tolerant spanners"
    - "sensitivity analysis of minimum spanning trees in sub inverse ackermann time"
    - "fault tolerant spanners better and simpler"

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

Connected through hyperedge HE-7 (induced by source paper "improved purely additive fault tolerant spanners"):
  with members:
    - "fault tolerant approximate bfs structures"
    - "vertex fault tolerant additive spanners"
    - "sparse fault tolerant bfs trees"
    - "on pairwise spanners"
    - "on resilient graph spanners"
    - "fault tolerant spanners better and simpler"

Connected through hyperedge HE-8 (induced by source paper "dual failure resilient bfs structure"):
  with members:
    - "fault tolerant approximate bfs structures"
    - "vertex fault tolerant additive spanners"
    - "sparse fault tolerant bfs trees"
    - "fault tolerant spanners better and simpler"

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)