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 "a light metric spanner"):
  Abstract: It has long been known that $d$-dimensional Euclidean point sets admit $(1+\epsilon)$-stretch spanners with lightness $W_E = \epsilon^{-O(d)}$, that is total edge weight at most $W_E$ times the weight of the minimum spaning tree of the set [DHN93]. Whether or not a similar result holds for metric spaces with low doubling dimension has remained an important open problem, and has resisted numerous attempts at resolution. In this paper, we resolve the question in the affirmative, and show that doubling spaces admit $(1+\epsilon)$-stretch spanners with lightness $W_D = (ddim/\epsilon)^{O(ddim)}$. #R##N#Important in its own right, our result also implies a much faster polynomial-time approximation scheme for the traveling salesman problemin doubling metric spaces, improving upon the bound presented in [BGK-12].

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 "light spanners for snowflake metrics":
    also connected through other hyperedges:
      (none)
  Member "from hierarchical partitions to hierarchical covers optimal fault tolerant spanners for doubling metrics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "truly optimal euclidean spanners")
  Member "optimal euclidean spanners really short thin and lanky":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph spanners a tutorial review")
  Member "light spanners in bounded pathwidth graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minor free graphs have light spanners")
  Member "efficient regression in metric spaces via approximate lipschitz extension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "truly optimal euclidean spanners")
  Member "shallow low and light trees and tight lower bounds for euclidean spanners":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "truly optimal euclidean spanners")
  Member "fast construction of nets in low dimensional metrics and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a data dependent algorithm for querying earth mover s distance with low doubling dimension")

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.CG(Computational Geometry)