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 fixed parameter tractable approximation scheme for the optimal cut graph of a surface"):
  Abstract: Given a graph $G$ cellularly embedded on a surface $\Sigma$ of genus $g$, a cut graph is a subgraph of $G$ such that cutting $\Sigma$ along $G$ yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any $\varepsilon >0$, we show how to compute a $(1+ \varepsilon)$ approximation of the shortest cut graph in time $f(\varepsilon, g)n^3$. #R##N#Our techniques first rely on the computation of a spanner for the problem using the technique of brick decompositions, to reduce the problem to the case of bounded tree-width. Then, to solve the bounded tree-width case, we introduce a variant of the surface-cut decomposition of Ru\'e, Sau and Thilikos, which may be of independent interest.

Includes members:
  Member "network sparsification for steiner problems on planar and bounded genus graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a relaxation of the directed disjoint paths problem a global congestion metric helps")
  Member "dynamic programming for graphs on surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "c planarity testing of embedded clustered graphs with bounded dual carving width")
  Member "surface split decompositions and subgraph isomorphism in graphs on surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subgraph isomorphism on graph classes that exclude a substructure")
  Member "tree width of hypergraphs and surface duality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hypermap homology quantum codes ph d thesis")
  Member "polynomial time approximation schemes for subset connectivity problems in bounded genus graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimum cuts in surface graphs")
  Member "optimally cutting a surface into a disk":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "obtaining a canonical polygonal schema from a greedy homotopy basis with minimal mesh refinement")

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)