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 "work efficient batch incremental minimum spanning trees with applications to the sliding window model"):
  Abstract: Algorithms for dynamically maintaining minimum spanning trees (MSTs) have received much attention in both the parallel and sequential settings. While previous work has given optimal algorithms for dense graphs, all existing parallel batch-dynamic algorithms perform polynomial work per update in the worst case for sparse graphs. In this paper, we present the first work-efficient parallel batch-dynamic algorithm for incremental MST, which can insert $\ell$ edges in $O(\ell \log(1+n/\ell))$ work in expectation and $O(\text{polylog}(n))$ span w.h.p. The key ingredient of our algorithm is an algorithm for constructing a compressed path tree of an edge-weighted tree, which is a smaller tree that contains all pairwise heaviest edges between a given set of marked vertices. Using our batch-incremental MST algorithm, we demonstrate a range of applications that become efficiently solvable in parallel in the sliding-window model, such as graph connectivity, approximate MSTs, testing bipartiteness, $k$-certificates, cycle-freeness, and maintaining sparsifiers.

Includes members:
  Member "batch dynamic algorithms via parallel change propagation and applications to dynamic trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "parallel batch dynamic graph connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "faster algorithms for edge connectivity via random 2 out contractions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "improved worst case deterministic parallel dynamic minimum spanning forest":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parallel batch dynamic graph connectivity")
  Member "parallel minimum cuts in near linear work and low depth":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "faster algorithms for edge connectivity via random 2 out contractions")
  Member "faster fully dynamic minimum spanning forest":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fully dynamic spectral vertex sparsifiers and applications")
  Member "single pass sparsification in the streaming model with edge deletions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "faster spectral sparsification in dynamic streams")
  Member "maintaining information in fully dynamic trees with top trees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "coarse grained complexity for dynamic algorithms")

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)