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: "linear space approximate distance oracles for planar bounded genus and minor free graphs"
  Abstract: A (1+e)-approximate distance oracle for a graph is a data structure that supports approximate point-to-point shortest-path-distance queries. The most relevant measures for a distance-oracle construction are: space, query time, and preprocessing time.#R##N##R##N#There are strong distance-oracle constructions known for planar graphs (Thorup, JACM'04) and, subsequently, minor-excluded graphs (Abraham and Gavoille, PODC'06). However, these require Ω(e-1n lg n) space for n-node graphs.#R##N##R##N#In this paper, for planar graphs, bounded-genus graphs, and minor-excluded graphs we give distance-oracle constructions that require only O(n) space. The big O hides only a fixed constant, independent of e and independent of genus or size of an excluded minor. The preprocessing times for our distance oracle are also faster than those for the previously known constructions. For planar graphs, the preprocessing time is O(nlg2 n). However, our constructions have slower query times. For planar graphs, the query time is O(e-2 lg2 n).#R##N##R##N#For all our linear-space results, we can in fact ensure, for any δ > 0, that the space required is only 1 + δ times the space required just to represent the graph itself.

Connected through hyperedge HE-1 (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 shortest paths in embedded graphs"
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"

Connected through hyperedge HE-2 (induced by source paper "a ptas for subset tsp in minor free graphs"):
  with members:
    - "truly optimal euclidean spanners"
    - "greedy spanners are optimal in doubling metrics"
    - "on subexponential parameterized algorithms for steiner tree and directed subset tsp on planar graphs"
    - "minor free graphs have light spanners"
    - "the greedy spanner is existentially optimal"
    - "linear size distance preservers"
    - "graph minors for preserving terminal distances approximately lower and upper bounds"
    - "a light metric spanner"

Connected through hyperedge HE-3 (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-4 (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"

Connected through hyperedge HE-5 (induced by source paper "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs"):
  with members:
    - "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"
    - "better tradeoffs for exact distance oracles in planar graphs"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "faster shortest paths in dense distance graphs with applications"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "multiple source shortest paths in embedded graphs"
    - "approximating the diameter of planar graphs in near linear time"

Connected through hyperedge HE-6 (induced by source paper "pruning based distance sketches with provable guarantees on random graphs"):
  with members:
    - "an axiomatic and an average case analysis of algorithms and heuristics for metric properties of graphs"
    - "algorithmic and hardness results for the hub labeling problem"
    - "on the complexity of hub labeling"
    - "sublinear distance labeling for sparse graphs"
    - "route planning in transportation networks"
    - "hop doubling label indexing for point to point distance querying on scale free networks"
    - "a scalable generative graph model with community structure"
    - "separating hierarchical and general hub labelings"

Connected through hyperedge HE-7 (induced by source paper "fast and compact exact distance oracle for planar graphs"):
  with members:
    - "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time"
    - "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs"
    - "improved bounds for shortest paths in dense distance graphs"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"
    - "approximate distance oracles for planar graphs with improved query time space tradeoff"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "approximate distance oracles with improved preprocessing time"
    - "improved distance queries in planar graphs"

Connected through hyperedge HE-8 (induced by source paper "a survey of shortest path algorithms"):
  with members:
    - "faster parametric shortest path and minimum balance algorithms"
    - "dynamic approximate all pairs shortest paths breaking the o mn barrier and derandomization"
    - "transit node routing reconsidered"
    - "randomized speedup of the bellman ford algorithm"
    - "exact distance oracles for planar graphs"
    - "fast paths in large scale dynamic road networks"

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)