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 "minimum cycle and homology bases of surface embedded graphs"):
  Abstract: We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the $1$-dimensional ($\mathbb{Z}_2$)-homology classes) of an undirected graph embedded on a surface. The problems are closely related, because the minimum cycle basis of a graph contains its minimum homology basis, and the minimum homology basis of the $1$-skeleton of any graph is exactly its minimum cycle basis. #R##N#For the minimum cycle basis problem, we give a deterministic $O(n^\omega+2^{2g}n^2+m)$-time algorithm for graphs embedded on an orientable surface of genus $g$. The best known existing algorithms for surface embedded graphs are those for general graphs: an $O(m^\omega)$ time Monte Carlo algorithm and a deterministic $O(nm^2/\log n + n^2 m)$ time algorithm. For the minimum homology basis problem, we give a deterministic $O((g+b)^3 n \log n + m)$-time algorithm for graphs embedded on an orientable or non-orientable surface of genus $g$ with $b$ boundary components, assuming shortest paths are unique, improving on existing algorithms for many values of $g$ and $n$. The assumption of unique shortest paths can be avoided with high probability using randomization or deterministically by increasing the running time of the homology basis algorithm by a factor of $O(\log n)$.

Includes members:
  Member "multiple source shortest paths in embedded graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimum cuts in surface graphs")
  Member "shortest non trivial cycles in directed and undirected surface graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimum cuts in surface graphs")
  Member "min st cut oracle for planar graphs with near linear preprocessing time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimum cuts in surface graphs")
  Member "minimum cycle basis and all pairs min cut of a planar graph in subquadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "holiest minimum cost paths and flows in surface graphs")
  Member "approximating loops in a shortest homology basis from point data":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing minimal persistent cycles polynomial and hard cases")
  Member "dynamic generators of topologically embedded graphs":
    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)