human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "minimum cuts in surface graphs"):
  with members:
    - "holiest minimum cost paths and flows in surface graphs"
    - "computational topology and the unique games conjecture"
    - "finding all useless arcs in directed planar graphs"
    - "local flow partitioning for faster edge connectivity"
    - "minor free graphs have light spanners"
    - "minimum cycle and homology bases of surface embedded graphs"
    - "recognizing weakly simple polygons"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"

Connected through hyperedge HE-2 (induced by source paper "min cost flow in unit capacity planar graphs"):
  with members:
    - "a faster algorithm for minimum cost bipartite matching in minor free graphs"
    - "nc algorithms for weighted planar perfect matching and related problems"
    - "improved bounds for shortest paths in dense distance graphs"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"
    - "faster approximate lossy generalized flow via interior point algorithms"

Connected through hyperedge HE-3 (induced by source paper "holiest minimum cost paths and flows in surface graphs"):
  with members:
    - "minimum cycle and homology bases of surface embedded graphs"
    - "minimum cut of directed planar graphs in o nloglogn time"
    - "faster parametric shortest path and minimum balance algorithms"
    - "all pairs minimum cuts in near linear time for surface embedded graphs"
    - "computing the girth of a planar graph in linear time"
    - "lattices and maximum flow algorithms in planar graphs"
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"
    - "linear space approximate distance oracles for planar bounded genus and minor free graphs"

Connected through hyperedge HE-4 (induced by source paper "almost optimal distance oracles for planar graphs"):
  with members:
    - "holiest minimum cost paths and flows in surface graphs"
    - "exact distance oracles for planar graphs with failing vertices"
    - "constant query time 1 epsilon approximate distance oracle for planar graphs"
    - "fast and compact exact distance oracle for planar graphs"
    - "better tradeoffs for exact distance oracles in planar graphs"
    - "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs"
    - "approximate distance oracles for planar graphs with improved query time space tradeoff"
    - "minimum cut of directed planar graphs in o nloglogn time"

Connected through hyperedge HE-5 (induced by source paper "exact distance oracles for planar graphs with failing vertices"):
  with members:
    - "almost optimal distance oracles for planar graphs"
    - "fast and compact exact distance oracle for planar graphs"
    - "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time"
    - "improved bounds for shortest paths in dense distance graphs"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "exact distance oracles for planar graphs"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"

Connected through hyperedge HE-6 (induced by source paper "topologically trivial closed walks in directed surface graphs"):
  with members:
    - "holiest minimum cost paths and flows in surface graphs"
    - "minimum cut of directed planar graphs in o nloglogn time"
    - "computing the geometric intersection number of curves"
    - "on the homotopy test on surfaces"
    - "shortest non trivial cycles in directed and undirected surface graphs"

Connected through hyperedge HE-7 (induced by source paper "dynamic all scores matrices for lcs score"):
  with members:
    - "fast and compact exact distance oracle for planar graphs"
    - "exact distance oracles for planar graphs"
    - "semi local string comparison algorithmic techniques and applications"

Connected through hyperedge HE-8 (induced by source paper "computational topology of graphs on surfaces"):
  with members:
    - "untangling planar curves"
    - "shortest path embeddings of graphs on surfaces"
    - "a direct proof of the strong hanani tutte theorem on the projective plane"
    - "minimum cycle and homology bases of surface embedded graphs"
    - "crossing number is hard for kernelization"
    - "computing the geometric intersection number of curves"
    - "how to walk your dog in the mountains with no magic leash"
    - "beyond the euler characteristic approximating the genus of general graphs"

Question: Please tell me which class the center node 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)