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: "a simple algorithm for minimum cuts in near linear time"
  Abstract: We consider the minimum cut problem in undirected, weighted graphs. We give a simple algorithm to find a minimum cut that $2$-respects (cuts two edges of) a spanning tree $T$ of a graph $G$. This procedure can be used in place of the complicated subroutine given in Karger's near-linear time minimum cut algorithm (J. ACM, 2000). We give a self-contained version of Karger's algorithm with the new procedure, which is easy to state and relatively simple to implement. It produces a minimum cut on an $m$-edge, $n$-vertex graph in $O(m \log^3 n)$ time with high probability. This performance matches that achieved by Karger, thereby matching the current state of the art.

Connected through hyperedge HE-1 (induced by source paper "weighted min cut sequential cut query and streaming algorithms"):
  with members:
    - "polynomial pass lower bounds for graph streaming algorithms"
    - "faster algorithms for edge connectivity via random 2 out contractions"
    - "local flow partitioning for faster edge connectivity"
    - "computing exact minimum cuts without knowing the graph"
    - "deterministic edge connectivity in near linear time"
    - "single pass spectral sparsification in dynamic streams"
    - "single pass sparsification in the streaming model with edge deletions"
    - "minimum cuts in near linear time"

Connected through hyperedge HE-2 (induced by source paper "minimum cut in o m log 2 n time"):
  with members:
    - "faster algorithms for edge connectivity via random 2 out contractions"
    - "parallel minimum cuts in near linear work and low depth"
    - "local flow partitioning for faster edge connectivity"
    - "computing maximum flow with augmenting electrical flows"
    - "deterministic edge connectivity in near linear time"
    - "maintaining information in fully dynamic trees with top trees"
    - "randomized rounding without solving the linear program"
    - "minimum cuts in near linear time"

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)