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 "network design problems with bounded distances via shallow light steiner trees"):
  Abstract: In a directed graph $G$ with non-correlated edge lengths and costs, the \emph{network design problem with bounded distances} asks for a cost-minimal spanning subgraph subject to a length bound for all node pairs. We give a bi-criteria $(2+\varepsilon,O(n^{0.5+\varepsilon}))$-approximation for this problem. This improves on the currently best known linear approximation bound, at the cost of violating the distance bound by a factor of at most~$2+\varepsilon$. #R##N#In the course of proving this result, the related problem of \emph{directed shallow-light Steiner trees} arises as a subproblem. In the context of directed graphs, approximations to this problem have been elusive. We present the first non-trivial result by proposing a $(1+\varepsilon,O(|R|^{\varepsilon}))$-ap\-proxi\-ma\-tion, where $R$ are the terminals. #R##N#Finally, we show how to apply our results to obtain an $(\alpha+\varepsilon,O(n^{0.5+\varepsilon}))$-approximation for \emph{light-weight directed $\alpha$-spanners}. For this, no non-trivial approximation algorithm has been known before. All running times depends on $n$ and $\varepsilon$ and are polynomial in $n$ for any fixed $\varepsilon>0$.

Includes members:
  Member "directed spanners via flow based linear programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lasserre integrality gaps for graph spanners and related problems")
  Member "transitive closure spanners":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient and simple algorithms for fault tolerant spanners")

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)