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 "optimal offline dynamic 2 3 edge vertex connectivity"):
  Abstract: We give offline algorithms for processing a sequence of $2$ and $3$ edge and vertex connectivity queries in a fully-dynamic undirected graph. While the current best fully-dynamic online data structures for $3$-edge and $3$-vertex connectivity require $O(n^{2/3})$ and $O(n)$ time per update, respectively, our per-operation cost is only $O(\log n)$, optimal due to the dynamic connectivity lower bound of Patrascu and Demaine. Our approach utilizes a divide and conquer scheme that transforms a graph into smaller equivalents that preserve connectivity information. This construction of equivalents is closely-related to the development of vertex sparsifiers, and shares important connections to several upcoming results in dynamic graph data structures, outside of just the offline model.

Includes members:
  Member "fully dynamic spectral vertex sparsifiers and applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "maximizing the number of spanning trees in a connected graph":
    also connected through other hyperedges:
      (none)
  Member "kirchhoff index as a measure of edge centrality in weighted networks nearly linear time algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fully dynamic spectral vertex sparsifiers and applications")
  Member "dynamic effective resistances and approximate schur complement on separable graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fully dynamic spectral vertex sparsifiers and applications")
  Member "dynamic bridge finding in tilde o log 2 n amortized time":
    also connected through other hyperedges:
      (none)
  Member "the power of vertex sparsifiers in dynamic graph algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fully dynamic spectral vertex sparsifiers and applications")
  Member "fully dynamic connectivity in o log n log log n 2 amortized expected time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "sampling random spanning trees faster than matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fully dynamic spectral vertex sparsifiers and applications")

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)