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 "metric dimension parameterized by treewidth"):
  Abstract: A resolving set $S$ of a graph $G$ is a subset of its vertices such that no two vertices of $G$ have the same distance vector to $S$. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer. This problem is NP-complete, and remains so in very restricted classes of graphs. It is also W[2]-complete with respect to the size of the solution. Metric Dimension has proven elusive on graphs of bounded treewidth. On the algorithmic side, a polytime algorithm is known for trees, and even for outerplanar graphs, but the general case of treewidth at most two is open. On the complexity side, no parameterized hardness is known. This has led several papers on the topic to ask for the parameterized complexity of Metric Dimension with respect to treewidth. We provide a first answer to the question. #R##N#We show that Metric Dimension parameterized by the treewidth of the input graph is W[1]-hard. More refinedly we prove that, unless the Exponential Time Hypothesis fails, there is no algorithm solving Metric Dimension in time $f(\text{pw})n^{o(\text{pw})}$ on $n$-vertex graphs of constant degree, with $\text{pw}$ the pathwidth of the input graph, and $f$ any computable function. This is in stark contrast with an FPT algorithm of Belmonte et al. [SIAM J. Discrete Math. '17] with respect to the combined parameter $\text{tl}+\Delta$, where $\text{tl}$ is the tree-length and $\Delta$ the maximum-degree of the input graph.

Includes members:
  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 "the fault tolerant metric dimension of cographs")
  Member "metric dimension of bounded tree length graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the fault tolerant metric dimension of cographs")
  Member "metric dimension parameterized by max leaf number":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized complexity of geodetic set")
  Member "metric dimension for gabriel unit disk graphs is np complete":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the fault tolerant metric dimension of cographs")
  Member "on the parameterized and approximation hardness of metric dimension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the fault tolerant metric dimension of cographs")
  Member "complexity of metric dimension on planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "alternative parameterizations of metric 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.CC(Computational Complexity)