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 "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs"):
  Abstract: We show how to compute for $n$-vertex planar graphs in $O(n^{11/6}{\rm polylog}(n))$ expected time the diameter and the sum of the pairwise distances. The algorithms work for directed graphs with real weights and no negative cycles. In $O(n^{15/8}{\rm polylog}(n))$ expected time we can also compute the number of pairs of vertices at distance smaller than a given threshold. These are the first algorithms for these problems using time $O(n^c)$ for some constant $c<2$, even when restricted to undirected, unweighted planar graphs.

Includes members:
  Member "fast and compact exact distance oracle for planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "planar diameter via metric compression")
  Member "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "planar diameter via metric compression")
  Member "better tradeoffs for exact distance oracles in planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "planar diameter via metric compression")
  Member "optimal parameterized algorithms for planar facility location problems using voronoi diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "grundy coloring friends half graphs bicliques")
  Member "faster shortest paths in dense distance graphs with applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved bounds for shortest paths in dense distance graphs")
  Member "structured recursive separator decompositions for planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the edge crossings of the greedy spanner")
  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 "approximating the diameter of planar graphs in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "planar diameter via metric compression")

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)