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 "fully dynamic single source reachability in practice an experimental study"):
  Abstract: Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subject to edge deletions and insertions. While there has been theoretical work on this problem, showing both linear conditional lower bounds for the fully dynamic problem and insertions-only and deletions-only upper bounds beating these conditional lower bounds, there has been no experimental study that compares the performance of fully dynamic reachability algorithms in practice. Previous experimental studies in this area concentrated only on the more general all-pairs reachability or transitive closure problem and did not use real-world dynamic graphs. #R##N#In this paper, we bridge this gap by empirically studying an extensive set of algorithms for the single-source reachability problem in the fully dynamic setting. In particular, we design several fully dynamic variants of well-known approaches to obtain and maintain reachability information with respect to a distinguished source. Moreover, we extend the existing insertions-only or deletions-only upper bounds into fully dynamic algorithms. Even though the worst-case time per operation of all the fully dynamic algorithms we evaluate is at least linear in the number of edges in the graph (as is to be expected given the conditional lower bounds) we show in our extensive experimental evaluation that their performance differs greatly, both on random as well as on real-world instances.

Includes members:
  Member "decremental strongly connected components and single source reachability in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "snap a general purpose network analysis and graph mining library":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adaptive low level storage of very large knowledge graphs")
  Member "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "improved algorithms for decremental single source reachability on directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "sublinear time decremental algorithms for single source reachability and shortest paths on directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate distance oracles subject to multiple vertex failures")
  Member "popular conjectures imply strong lower bounds for dynamic problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "preach a fast lightweight reachability index using pruning and contraction hierarchies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on methods and systems for graph compression")

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)