What was already known
Trees (treewidth one) admit a polynomial-time algorithm. Earlier bounded-treewidth hardness gave an upper bound of 24 on the threshold.
AI involvement
Tristan Benoit states that under his direction Claude Fable 5.1 found an obstruction to a proposed algorithm and turned it into the hardness reduction. Claude produced the construction, proofs and Lean formalization. Benoit reviewed each statement and rewrote the presentation with the model.
- Metric Dimension is NP-complete on Graphs of Treewidth TwoMetric Dimension is NP-complete on Graphs of Treewidth Two
Importance
The paper places the hardness threshold at treewidth two, one above trees.
Technical verification
The author reports Lean checking of the reduction’s connectivity, series–parallel structure, widths, metric-dimension identities and normalization. NP membership and running time are outside the Lean formalization.
Formal checking
The author reports Lean checking of the reduction’s connectivity, series–parallel structure, widths, metric-dimension identities and normalization. NP membership and running time are outside the Lean formalization.
- Checker
- Tristan Benoit, reporting Lean checks
- Scope
- The author reports Lean checking of the reduction’s connectivity, series–parallel structure, widths, metric-dimension identities and normalization. NP membership and running time are outside the Lean formalization.
- Basis
- Reported by the linked checker
- Lean 4 formalization of Metric Dimension is NP-complete on Graphs of Treewidth TwoLean 4 formalization of Metric Dimension is NP-complete on Graphs of Treewidth Two
Human understanding
The author reports reviewing statements and rewriting the presentation. A human explanation of the central obstruction is undocumented.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision