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 "fast generation of random spanning trees and the effective resistance metric"):
  Abstract: We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected O(m4/3+o(1)) time. This improves over the best previously known bound of min(O(m[EQUATION]n), O(nω)) - that follows from the work of Kelner and Madry [FOCS'09] and of Colbourn et al. [J. Algorithms'96] - whenever the input graph is sufficiently sparse.#R##N##R##N#At a high level, our result stems from carefully exploiting the interplay of random spanning trees, random walks, and the notion of effective resistance, as well as from devising a way to algorithmically relate these concepts to the combinatorial structure of the graph. This involves, in particular, establishing a new connection between the effective resistance metric and the cut structure of the underlying graph.

Includes members:
  Member "an almost linear time algorithm for approximate max flow in undirected graphs and its multicommodity generalizations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "faster divergence maximization for faster maximum flow")
  Member "a simple combinatorial algorithm for solving sdd systems in nearly linear time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "circulation control for faster minimum cost flow in unit capacity graphs")
  Member "navigating central path with electrical flows from flows to matchings and back":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "faster divergence maximization for faster maximum flow")
  Member "nearly maximum flows in nearly linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "a nearly mlogn time solver for sdd linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral sparsification via bounded independence sampling")
  Member "fast approximation algorithms for cut based problems in undirected graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "approaching optimality for solving sdd systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "solving linear programs with sqrt rank linear system solves")
  Member "electrical flows laplacian systems and faster approximation of maximum flow in undirected graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a spectral approach to network design")

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)