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 "multiple source shortest paths in embedded graphs"):
  Abstract: Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe a randomized algorithm to preprocess the graph in O(gn log n) time with high probability, so that the shortest-path distance from any vertex on the boundary of f to any other vertex in G can be retrieved in O(log n) time. Our result directly generalizes the O(n log n)-time algorithm of Klein [SODA 2005] for multiple-source shortest paths in planar graphs. Intuitively, our preprocessing algorithm maintains a shortest-path tree as its source point moves continuously around the boundary of f. As an application of our algorithm, we describe algorithms to compute a shortest non-contractible or non-separating cycle in embedded, undirected graphs in O(g^2 n log n) time with high probability. Our high-probability time bounds hold in the worst-case for generic edge weights, or with an additional O(log n) factor for arbitrary edge weights.

Includes members:
  Member "faster parametric shortest path and minimum balance algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "discovering interesting cycles in directed graphs")
  Member "linear space approximate distance oracles for planar bounded genus and minor free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "holiest minimum cost paths and flows 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 "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 "approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")
  Member "optimal embedding into star metrics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimally fast incremental manhattan plane embedding and planar tight span construction")
  Member "computing shortest non trivial cycles on orientable surfaces of bounded genus in almost 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)