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: "improved algorithms for decremental single source reachability on directed graphs"
  Abstract: Recently we presented the first algorithm for maintaining the set of nodes reachable from a source node in a directed graph that is modified by edge deletions with \(o(mn)\) total update time, where \(m\) is the number of edges and \(n\) is the number of nodes in the graph [Henzinger et al. STOC 2014]. The algorithm is a combination of several different algorithms, each for a different \(m\) vs. \(n\) trade-off. For the case of \(m = \varTheta (n^{1.5})\) the running time is \(O(n^{2.47})\), just barely below \(mn = \varTheta (n^{2.5})\). In this paper we simplify the previous algorithm using new algorithmic ideas and achieve an improved running time of \(\tilde{O}(\min ( m^{7/6} n^{2/3}, m^{3/4} n^{5/4 + o(1)}, m^{2/3} n^{4/3+o(1)} + m^{3/7} n^{12/7+o(1)}))\). This gives, e.g., \(O(n^{2.36})\) for the notorious case \(m = \varTheta (n^{1.5})\). We obtain the same upper bounds for the problem of maintaining the strongly connected components of a directed graph undergoing edge deletions. Our algorithms are correct with high probabililty against an oblivious adversary.

Connected through hyperedge HE-1 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs"):
  with members:
    - "decremental sssp in weighted digraphs faster and against an adaptive adversary"
    - "fully dynamic all pairs shortest paths improved worst case time and space bounds"
    - "deterministic algorithms for decremental approximate shortest paths faster and simpler"
    - "decremental strongly connected components and single source reachability in near linear time"
    - "graph pattern detection hardness for all induced patterns and faster non induced cycles"
    - "limits on all known and some unknown approaches to matrix multiplication"
    - "diameter spanners eccentricity spanners and approximating extremal distances"
    - "limits on the universal method for matrix multiplication"

Connected through hyperedge HE-2 (induced by source paper "deterministic algorithms for decremental approximate shortest paths faster and simpler"):
  with members:
    - "decremental sssp in weighted digraphs faster and against an adaptive adversary"
    - "fully dynamic all pairs shortest paths improved worst case time and space bounds"
    - "dynamic approximate shortest paths and beyond subquadratic and worst case update time"
    - "decremental strongly connected components and single source reachability in near linear time"
    - "algorithms and hardness for diameter in dynamic graphs"
    - "diameter spanner eccentricity spanner and approximating extremal graph distances static dynamic and fault tolerant"
    - "deterministic partially dynamic single source shortest paths in weighted graphs"
    - "thorup zwick emulators are universally optimal hopsets"

Connected through hyperedge HE-3 (induced by source paper "deterministic combinatorial replacement paths and distance sensitivity oracles"):
  with members:
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "dynamic matching reducing integral algorithms to approximately maximal fractional algorithms"
    - "generating families of practical fast matrix multiplication algorithms"
    - "a framework for practical parallel fast matrix multiplication"
    - "decremental single source shortest paths on undirected graphs in near linear total update time"
    - "sublinear time decremental algorithms for single source reachability and shortest paths on directed graphs"
    - "replacement paths via row minima of concise matrices"

Connected through hyperedge HE-4 (induced by source paper "decremental strongly connected components and single source reachability in near linear time"):
  with members:
    - "decremental single source reachability in planar digraphs"
    - "dynamic minimum spanning forest with subpolynomial worst case update time"
    - "fully dynamic connectivity in o log n log log n 2 amortized expected time"
    - "decremental single source shortest paths on undirected graphs in near linear total update time"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "faster deterministic fully dynamic graph connectivity"

Connected through hyperedge HE-5 (induced by source paper "fully dynamic single source reachability in practice an experimental study"):
  with members:
    - "decremental strongly connected components and single source reachability in near linear time"
    - "snap a general purpose network analysis and graph mining library"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "sublinear time decremental algorithms for single source reachability and shortest paths on directed graphs"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "preach a fast lightweight reachability index using pruning and contraction hierarchies"

Connected through hyperedge HE-6 (induced by source paper "dynamic parameterized problems and algorithms"):
  with members:
    - "fully dynamic maximal matching in constant update time"
    - "fully dynamic connectivity in o log n log log n 2 amortized expected time"
    - "linear time kernelization for feedback vertex set"
    - "a linear time parameterized algorithm for directed feedback vertex set"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "dynamic graph connectivity with improved worst case update time and sublinear space"
    - "fast dynamic graph algorithms for parameterized problems"
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-7 (induced by source paper "decremental single source reachability in planar digraphs"):
  with members:
    - "faster algorithms for computing maximal 2 connected subgraphs in sparse directed graphs"
    - "improved bounds for shortest paths in dense distance graphs"
    - "fully dynamic maximal matching in constant update time"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "sublinear time decremental algorithms for single source reachability and shortest paths on directed graphs"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "optimal decremental connectivity in planar graphs"

Connected through hyperedge HE-8 (induced by source paper "dynamic matching reducing integral algorithms to approximately maximal fractional algorithms"):
  with members:
    - "fully dynamic approximate maximum matching and minimum vertex cover in o log 3 n worst case update time"
    - "fully dynamic almost maximal matching breaking the polynomial barrier for worst case time bounds"
    - "fully dynamic maximal matching in constant update time"
    - "new deterministic approximation algorithms for fully dynamic matching"
    - "fully dynamic all pairs shortest paths with worst case update time revisited"
    - "fully dynamic matching in bipartite graphs"
    - "decremental single source shortest paths on undirected graphs in near linear total update time"
    - "sublinear time decremental algorithms for single source reachability and shortest paths on directed graphs"

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)