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: "fast approximation algorithms for cut based problems in undirected graphs"
  Abstract: We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees, allows approximating it almost as quickly on general graphs while only losing a poly-logarithmic factor in the approximation guarantee. #R##N#To illustrate the applicability of our paradigm, we focus our attention on the undirected sparsest cut problem with general demands and the balanced separator problem. By a simple use of our framework, we obtain poly-logarithmic approximation algorithms for these problems that run in time close to linear. #R##N#The main tool behind our result is an efficient procedure that decomposes general graphs into simpler ones while approximately preserving the cut-flow structure. This decomposition is inspired by the cut-based graph decomposition of R\"acke that was developed in the context of oblivious routing schemes, as well as, by the construction of the ultrasparsifiers due to Spielman and Teng that was employed to preconditioning symmetric diagonally-dominant matrices.

Connected through hyperedge HE-1 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond"):
  with members:
    - "faster p norm minimizing flows via smoothed q norm problems"
    - "fast provably convergent irls algorithm for p norm linear regression"
    - "distributed edge connectivity in sublinear time"
    - "improved distributed expander decomposition and nearly optimal triangle enumeration"
    - "flows in almost linear time via adaptive preconditioning"
    - "breaking quadratic time for small vertex connectivity and an approximation scheme"
    - "a new algorithm for decremental single source shortest paths with applications to vertex capacitated flow and cut problems"
    - "graph sparsification spectral sketches and faster resistance computation via short cycle decompositions"

Connected through hyperedge HE-2 (induced by source paper "fully dynamic spectral vertex sparsifiers and applications"):
  with members:
    - "dynamic low stretch trees via dynamic low diameter decompositions"
    - "graph reduction by local variation"
    - "kirchhoff index as a measure of edge centrality in weighted networks nearly linear time algorithms"
    - "dynamic effective resistances and approximate schur complement on separable graphs"
    - "on solving linear systems in sublinear time"
    - "spectrally approximating large graphs with smaller graphs"
    - "an almost linear time algorithm for uniform random spanning tree generation"
    - "density independent algorithms for sparsifying k step random walks"

Connected through hyperedge HE-3 (induced by source paper "flows in almost linear time via adaptive preconditioning"):
  with members:
    - "graph sparsification spectral sketches and faster resistance computation via short cycle decompositions"
    - "expander decomposition and pruning faster stronger and simpler"
    - "solving directed laplacian systems in nearly linear time through sparse lu factorizations"
    - "an almost linear time algorithm for uniform random spanning tree generation"
    - "much faster algorithms for matrix scaling"
    - "matrix scaling and balancing via box constrained newton s method and interior point methods"
    - "near optimal approximate shortest paths and transshipment in distributed and streaming models"
    - "asymptotic behavior of ell_p based laplacian regularization in semi supervised learning"

Connected through hyperedge HE-4 (induced by source paper "deterministic graph cuts in subquadratic time sparse balanced and k vertex"):
  with members:
    - "a faster local algorithm for detecting bounded size cuts with applications to higher connectivity problems"
    - "computing and testing small vertex connectivity in near linear time and queries"
    - "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond"
    - "distributed edge connectivity in sublinear time"
    - "breaking quadratic time for small vertex connectivity and an approximation scheme"
    - "graph sketching against adaptive adversaries applied to the minimum degree algorithm"
    - "expander decomposition and pruning faster stronger and simpler"
    - "faster algorithms for computing maximal 2 connected subgraphs in sparse directed graphs"

Connected through hyperedge HE-5 (induced by source paper "faster parallel algorithm for approximate shortest path"):
  with members:
    - "preconditioning for the geometric transportation problem"
    - "parallel approximate undirected shortest paths via low hop emulators"
    - "nearly work efficient parallel algorithm for digraph reachability"
    - "near optimal approximate shortest paths and transshipment in distributed and streaming models"
    - "efficient algorithms for constructing very sparse spanners and emulators"
    - "approximate undirected maximum flows in o m polylog n time"
    - "a combinatorial tilde o m 3 2 time algorithm for the min cost flow problem"
    - "an almost linear time algorithm for approximate max flow in undirected graphs and its multicommodity generalizations"

Connected through hyperedge HE-6 (induced by source paper "strong self concordance and sampling"):
  with members:
    - "faster polytope rounding sampling and volume computation via a sublinear ball walk"
    - "solving linear programs with sqrt rank linear system solves"
    - "convergence rate of riemannian hamiltonian monte carlo and faster polytope volume computation"
    - "geodesic walks in polytopes"
    - "the mixing time of the dikin walk in a polytope a simple proof"
    - "approximate undirected maximum flows in o m polylog n time"
    - "navigating central path with electrical flows from flows to matchings and back"
    - "nearly maximum flows in nearly linear time"

Connected through hyperedge HE-7 (induced by source paper "graph sparsification spectral sketches and faster resistance computation via short cycle decompositions"):
  with members:
    - "current flow group closeness centrality for complex networks"
    - "massively parallel algorithms for finding well connected components in sparse graphs"
    - "kirchhoff index as a measure of edge centrality in weighted networks nearly linear time algorithms"
    - "fully dynamic effective resistances"
    - "spectrum approximation beyond fast matrix multiplication algorithms and hardness"
    - "an sdp based algorithm for linear sized spectral sparsification"
    - "an almost linear time algorithm for uniform random spanning tree generation"
    - "nearly tight bounds for sandpile transience on the grid"

Connected through hyperedge HE-8 (induced by source paper "solving directed laplacian systems in nearly linear time through sparse lu factorizations"):
  with members:
    - "sampling random spanning trees faster than matrix multiplication"
    - "faster algorithms for computing the stationary distribution simulating random walks and more"
    - "computing maximum flow with augmenting electrical flows"
    - "on fully dynamic graph sparsifiers"
    - "approximate gaussian elimination for laplacians fast sparse and simple"
    - "almost linear time algorithms for markov chains and new spectral primitives for directed graphs"
    - "sparsified cholesky and multigrid solvers for connection laplacians"
    - "sparsified cholesky solvers for sdd linear systems"

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)