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 "holiest minimum cost paths and flows in surface graphs"):
  Abstract: Let $G$ be an edge-weighted directed graph with $n$ vertices embedded on an orientable surface of genus $g$. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows and shortest paths in $G$. The perturbations take $O(gn)$ time to compute. We use our perturbation scheme in a black box manner to derive a deterministic $O(n \log \log n)$ time algorithm for minimum cut in \emph{directed} edge-weighted planar graphs and a deterministic $O(g^2 n \log n)$ time proprocessing scheme for the multiple-source shortest paths problem of computing a shortest path oracle for all vertices lying on a common face of a surface embedded graph. The latter result yields faster deterministic near-linear time algorithms for a variety of problems in constant genus surface embedded graphs. #R##N#Finally, we open the black box in order to generalize a recent linear-time algorithm for multiple-source shortest paths in unweighted undirected planar graphs to work in arbitrary orientable surfaces. Our algorithm runs in $O(g^2 n \log g)$ time in this setting, and it can be used to give improved linear time algorithms for several problems in unweighted undirected surface embedded graphs of constant genus including the computation of minimum cuts, shortest topologically non-trivial cycles, and minimum homology bases.

Includes members:
  Member "minimum cycle and homology bases of surface embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimum cuts in surface graphs")
  Member "minimum cut of directed planar graphs in o nloglogn time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimum cuts in surface graphs")
  Member "faster parametric shortest path and minimum balance algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "discovering interesting cycles in directed graphs")
  Member "all pairs minimum cuts in near linear time for surface embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimum cuts in surface graphs")
  Member "computing the girth of a planar graph in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "triangles and girth in disk graphs and transmission graphs")
  Member "lattices and maximum flow algorithms in planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on generalizations of network design problems with degree bounds")
  Member "multiple source shortest paths in embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimum cuts in surface graphs")
  Member "multiple source multiple sink maximum flow in directed planar graphs in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "minimum cuts in surface graphs")

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)