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 "computing the inverse geodesic length in planar graphs and graphs of bounded treewidth"):
  Abstract: The inverse geodesic length of a graph $G$ is the sum of the inverse of the distances between all pairs of distinct vertices of $G$. In some domains it is known as the Harary index or the global efficiency of the graph. We show that, if $G$ is planar and has $n$ vertices, then the inverse geodesic length of $G$ can be computed in roughly $O(n^{9/5})$ time. We also show that, if $G$ has $n$ vertices and treewidth at most $k$, then the inverse geodesic length of $G$ can be computed in $O(n \log^{O(k)}n)$ time. In both cases we use techniques developed for computing the sum of the distances, which does not have ``inverse'' component, together with batched evaluations of rational functions.

Includes members:
  Member "minimizing and computing the inverse geodesic length on trees":
    also connected through other hyperedges:
      (none)
  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-1 (induced by source paper "planar diameter via metric compression")
  Member "subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "planar diameter via metric compression")
  Member "batched point location in sinr diagrams via algebraic tools":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing shapley values for mean width in 3 d")
  Member "structured recursive separator decompositions for planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the edge crossings of the greedy spanner")
  Member "computing the distance between piecewise linear bivariate functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing shapley values in the plane")

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)