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 "vertex sparsifiers for c edge connectivity"):
  Abstract: We show the existence of O(f(c)k) sized vertex sparsifiers that preserve all edge-connectivity values up to c between a set of k terminal vertices, where f(c) is a function that only depends on c, the edge-connectivity value. This construction is algorithmic: we also provide an algorithm whose running time depends linearly on k, but exponentially in c. It implies that for constant values of c, an offline sequence of edge insertions/deletions and c-edge-connectivity queries can be answered in polylog time per operation. These results are obtained by combining structural results about minimum terminal separating cuts in undirected graphs with recent developments in expander decomposition based methods for finding small vertex/edge cuts in graphs.

Includes members:
  Member "a faster local algorithm for detecting bounded size cuts with applications to higher connectivity problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic graph cuts in subquadratic time sparse balanced and k vertex")
  Member "fully dynamic spectral vertex sparsifiers and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "breaking quadratic time for small vertex connectivity and an approximation scheme":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "dynamic effective resistances and approximate schur complement on separable graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fully dynamic spectral vertex sparsifiers and applications")
  Member "expander decomposition and pruning faster stronger and simpler":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "improved guarantees for vertex sparsification in planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scattering and sparse partitions and their applications")
  Member "the power of vertex sparsifiers in dynamic graph algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fully dynamic spectral vertex sparsifiers and applications")
  Member "sampling random spanning trees faster than matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)