{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:B27B2JKRCWIJ2VFXBNSTEFLRAW","short_pith_number":"pith:B27B2JKR","schema_version":"1.0","canonical_sha256":"0ebe1d255115909d54b70b65321571059860a66a6d851eec1438243514309995","source":{"kind":"arxiv","id":"1907.08093","version":1},"attestation_state":"computed","paper":{"title":"Metric Dimension Parameterized by Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"\\'Edouard Bonnet, Nidhi Purohit","submitted_at":"2019-07-18T14:46:20Z","abstract_excerpt":"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 graph"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.08093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-18T14:46:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a0c4ca908ddd2aa52a2b2789dd9e6f8d3472663abaf93e13e3631d399c3e20c9","abstract_canon_sha256":"aa355a8c7b7ba0919e24170fc7d1f1f2cafdec44fd8bd39c1bfc94744e5eb04f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.124279Z","signature_b64":"57N1fI5zp6hWhodwdfLhdh3dBnRgVgUrqvK6gOHoE7EZMh60z3pRWuu7q3qOxUPs6HuVBiCGRRMeFJx8aB6rAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ebe1d255115909d54b70b65321571059860a66a6d851eec1438243514309995","last_reissued_at":"2026-05-17T23:40:15.123572Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.123572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Dimension Parameterized by Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"\\'Edouard Bonnet, Nidhi Purohit","submitted_at":"2019-07-18T14:46:20Z","abstract_excerpt":"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 graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08093","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.08093","created_at":"2026-05-17T23:40:15.123697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08093v1","created_at":"2026-05-17T23:40:15.123697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08093","created_at":"2026-05-17T23:40:15.123697+00:00"},{"alias_kind":"pith_short_12","alias_value":"B27B2JKRCWIJ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"B27B2JKRCWIJ2VFX","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"B27B2JKR","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW","json":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW.json","graph_json":"https://pith.science/api/pith-number/B27B2JKRCWIJ2VFXBNSTEFLRAW/graph.json","events_json":"https://pith.science/api/pith-number/B27B2JKRCWIJ2VFXBNSTEFLRAW/events.json","paper":"https://pith.science/paper/B27B2JKR"},"agent_actions":{"view_html":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW","download_json":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW.json","view_paper":"https://pith.science/paper/B27B2JKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08093&json=true","fetch_graph":"https://pith.science/api/pith-number/B27B2JKRCWIJ2VFXBNSTEFLRAW/graph.json","fetch_events":"https://pith.science/api/pith-number/B27B2JKRCWIJ2VFXBNSTEFLRAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/action/storage_attestation","attest_author":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/action/author_attestation","sign_citation":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/action/citation_signature","submit_replication":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/action/replication_record"}},"created_at":"2026-05-17T23:40:15.123697+00:00","updated_at":"2026-05-17T23:40:15.123697+00:00"}