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: "compact and fast sensitivity oracles for single source distances"
  Abstract: Let $s$ denote a distinguished source vertex of a non-negatively real weighted and undirected graph $G$ with $n$ vertices and $m$ edges. In this paper we present two efficient \emph{single-source approximate-distance sensitivity oracles}, namely \emph{compact} data structures which are able to \emph{quickly} report an approximate (by a multiplicative stretch factor) distance from $s$ to any node of $G$ following the failure of any edge in $G$. More precisely, we first present a sensitivity oracle of size $O(n)$ which is able to report 2-approximate distances from the source in $O(1)$ time. Then, we further develop our construction by building, for any $0<\epsilon<1$, another sensitivity oracle having size $O\left(n\cdot \frac{1}{\epsilon} \log \frac{1}{\epsilon}\right)$, and which is able to report a $(1+\epsilon)$-approximate distance from $s$ to any vertex of $G$ in $O\left(\log n\cdot \frac{1}{\epsilon} \log \frac{1}{\epsilon}\right)$ time. Thus, this latter oracle is essentially optimal as far as size and stretch are concerned, and it only asks for a logarithmic query time. Finally, our results are complemented with a space lower bound for the related class of single-source \emph{additively-stretched} sensitivity oracles, which is helpful to realize the hardness of designing compact oracles of this type.

Connected through hyperedge HE-1 (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"
    - "dual failure resilient bfs structure"
    - "the 4 3 additive spanner exponent is tight"
    - "fault tolerant approximate bfs structures"
    - "sparse fault tolerant bfs trees"

Connected through hyperedge HE-2 (induced by source paper "generic single edge fault tolerant exact distance oracle"):
  with members:
    - "multiple source dual fault tolerant bfs trees"
    - "multiple edge fault tolerant approximate shortest path trees"
    - "dynamic dfs in undirected graphs breaking the o m barrier"
    - "dual failure resilient bfs structure"
    - "sparse fault tolerant bfs trees"
    - "faster replacement paths"
    - "approximate shortest paths avoiding a failed vertex optimal size data structures for unweighted graph"

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"
    - "dual failure resilient bfs structure"
    - "improved purely additive fault tolerant spanners"
    - "fault tolerant approximate shortest path trees"
    - "fault tolerant approximate bfs structures"

Connected through hyperedge HE-4 (induced by source paper "an efficient strongly connected components algorithm in the fault tolerant model"):
  with members:
    - "preserving distances in very faulty graphs"
    - "multiple source dual fault tolerant bfs trees"
    - "connectivity oracles for graphs subject to vertex failures"
    - "multiple edge fault tolerant approximate shortest path trees"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "dual failure resilient bfs structure"
    - "improved algorithms for decremental single source reachability on directed graphs"
    - "improved purely additive fault tolerant spanners"

Connected through hyperedge HE-5 (induced by source paper "fault tolerant approximate shortest path trees"):
  with members:
    - "multiple edge fault tolerant approximate shortest path trees"
    - "dual failure resilient bfs structure"
    - "improved purely additive fault tolerant spanners"
    - "fault tolerant approximate bfs structures"
    - "vertex fault tolerant additive spanners"
    - "sparse fault tolerant bfs trees"
    - "approximate distance oracle with constant query time"
    - "on pairwise spanners"

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)