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 "a near linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals"):
  Abstract: For an undirected edge-weighted graph G and a set R of pairs of vertices called pairs of terminals, a multicut is a set of edges such that removing these edges from G disconnects each pair in R. We provide an algorithm computing a $(1+\varepsilon)$-approximation of the minimum multicut of a graph G in time $(g+t)^{(O(g+t)^3)}\cdot(1/\varepsilon)^{O(g+t)} \cdot n \log n$, where g is the genus of G and t is the number of terminals. #R##N#This result is tight in several aspects, as the minimum multicut problem is for example both APX-hard and W[1]-hard (parameterized by the number of terminals), even on planar graphs (equivalently, when g=0). #R##N#In order to achieve this, our article leverages on a novel characterization of a minimum multicut as a Steiner tree in the universal cover of a surface on which G is embedded. The algorithm heavily relies on topological techniques, and in particular on the use of homotopical tools and computations in covering spaces, which we blend with ideas stemming from approximation schemes for planar graphs and low-dimensional geometric inputs.

Includes members:
  Member "approximating multicut and the demand graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "global and fixed terminal cuts in digraphs")
  Member "multicuts in planar and bounded genus graphs with bounded number of terminals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "almost tight lower bounds for hard cutting problems in embedded graphs")
  Member "all pairs minimum cuts in near linear time for surface embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimum cuts in surface graphs")
  Member "cops robbers and threatening skeletons padded decomposition for minor free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "scattering and sparse partitions and their applications")
  Member "fixed parameter tractability of multicut parameterized by the size of the cutset":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the computational complexity of finding temporal paths under waiting time constraints")
  Member "polynomial time approximation schemes for subset connectivity problems in bounded genus graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "minimum cuts in surface graphs")
  Member "approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")

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)