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 "from hierarchical partitions to hierarchical covers optimal fault tolerant spanners for doubling metrics"):
  Abstract: In this paper we devise an optimal construction of fault-tolerant spanners for doubling metrics. Specifically, for any $n$-point doubling metric, any $\eps > 0$, and any integer $0 \le k \le n-2$, our construction provides a $k$-fault-tolerant $(1+\eps)$-spanner with optimal degree $O(k)$ within optimal time $O(n \log n + k n)$. #R##N#We then strengthen this result to provide near-optimal (up to a factor of $\log k$) guarantees on the diameter and weight of our spanners, namely, diameter $O(\log n)$ and weight $O(k^2 + k \log n) \cdot \omega(MST)$, while preserving the optimal guarantees on the degree $O(k)$ and the running time $O(n \log n + k n)$. #R##N#Our result settles several fundamental open questions in this area, culminating a long line of research that started with the STOC'95 paper of Arya et al.\ and the STOC'98 paper of Levcopoulos et al. #R##N#On the way to this result we develop a new technique for constructing spanners in doubling metrics. Our spanner construction is based on a novel \emph{hierarchical cover} of the metric, whereas most previous constructions of spanners for doubling and Euclidean metrics (such as the net-tree spanner) are based on \emph{hierarchical partitions} of the metric. We demonstrate the power of hierarchical covers in the context of geometric spanners by improving the state-of-the-art results in this area.

Includes members:
  Member "the traveling salesman problem low dimensionality implies a polynomial time approximation scheme":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a quasi polynomial algorithm for well spaced hyperbolic tsp")
  Member "sparse fault tolerant bfs trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "graph spanners a tutorial review")
  Member "efficient construction of spanners in d dimensions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on locality sensitive orderings and their applications")
  Member "on resilient graph spanners":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph spanners a tutorial review")
  Member "fault tolerant spanners for doubling metrics better and simpler":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the minimum edge compact spanner network design problem")
  Member "robust geometric spanners":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "piecewise linear regressions for approximating distance metrics")
  Member "optimal euclidean spanners really short thin and lanky":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "graph spanners a tutorial review")
  Member "incubators vs zombies fault tolerant short thin and lanky spanners for doubling metrics":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal euclidean spanners really short thin and lanky")

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)