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 "the fault tolerant metric dimension of cographs"):
  Abstract: A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a \textit{resolving set} for $G$ if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distance between $u$ and $w$ and the distance between $v$ and $w$ are different. A resolving set $U$ is {\em fault-tolerant} if for every vertex $u\in U$ set $U\setminus \{u\}$ is still a resolving set. {The \em (fault-tolerant) Metric Dimension} of $G$ is the size of a smallest (fault-tolerant) resolving set for $G$. The {\em weighted (fault-tolerant) Metric Dimension} for a given cost function $c: V \longrightarrow \mathbb{R}_+$ is the minimum weight of all (fault-tolerant) resolving sets. Deciding whether a given graph $G$ has (fault-tolerant) Metric Dimension at most $k$ for some integer $k$ is known to be NP-complete. The weighted fault-tolerant Metric Dimension problem has not been studied extensively so far. In this paper we show that the weighted fault-tolerant metric dimension problem can be solved in linear time on cographs.

Includes members:
  Member "computing the metric dimension by decomposing graphs into extended biconnected components":
    also connected through other hyperedges:
      (none)
  Member "identification location domination and metric dimension on interval and permutation graphs i bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "metric dimension parameterized by treewidth")
  Member "metric dimension of bounded tree length graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "metric dimension parameterized by treewidth")
  Member "metric dimension for gabriel unit disk graphs is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "metric dimension parameterized by treewidth")
  Member "on the parameterized and approximation hardness of metric dimension":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "metric dimension parameterized by treewidth")
  Member "on the complexity of metric dimension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing the metric dimension by decomposing graphs into extended biconnected components")

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)