{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QWZS7RYE7VVZPUS7KLIXLEAJGM","short_pith_number":"pith:QWZS7RYE","schema_version":"1.0","canonical_sha256":"85b32fc704fd6b97d25f52d175900933009a4d8d83952a87c7207baadafbc10e","source":{"kind":"arxiv","id":"1211.1636","version":1},"attestation_state":"computed","paper":{"title":"On the Parameterized and Approximation Hardness of Metric Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e Nichterlein, Sepp Hartung","submitted_at":"2012-11-07T18:50:44Z","abstract_excerpt":"The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the distance (length of a shortest path) between v and u is different from the distance of v and w. We give a polynomial-time computable reduction from the Bipartite Dominating Set problem to Metric Dimension on maximum degree three graphs such that there is a one-to-one correspondence between the solution sets of both problems. There are two main consequences of this:"},"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":"1211.1636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T18:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"fd08c4be22ddc758d9250e9a5332c47bdecaf0d6b3469953c92cec1e4c45aa9f","abstract_canon_sha256":"ae5338a8364c3bd358a91ca1e7572bb1a9d780505c07bcd793011426a6d02279"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:20.603575Z","signature_b64":"vvJZ1Gg3PAQctrW2AYRCXAHZHd703nUdRGjmDo4mT7BLsX09o1m7wtjaHeVzdzUjCE8RsVVz5PMnB+D7h+n0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85b32fc704fd6b97d25f52d175900933009a4d8d83952a87c7207baadafbc10e","last_reissued_at":"2026-05-18T03:41:20.603123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:20.603123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Parameterized and Approximation Hardness of Metric Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andr\\'e Nichterlein, Sepp Hartung","submitted_at":"2012-11-07T18:50:44Z","abstract_excerpt":"The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the distance (length of a shortest path) between v and u is different from the distance of v and w. We give a polynomial-time computable reduction from the Bipartite Dominating Set problem to Metric Dimension on maximum degree three graphs such that there is a one-to-one correspondence between the solution sets of both problems. There are two main consequences of this:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1636","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":"1211.1636","created_at":"2026-05-18T03:41:20.603193+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1636v1","created_at":"2026-05-18T03:41:20.603193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1636","created_at":"2026-05-18T03:41:20.603193+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWZS7RYE7VVZ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWZS7RYE7VVZPUS7","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWZS7RYE","created_at":"2026-05-18T12:27:20.899486+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/QWZS7RYE7VVZPUS7KLIXLEAJGM","json":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM.json","graph_json":"https://pith.science/api/pith-number/QWZS7RYE7VVZPUS7KLIXLEAJGM/graph.json","events_json":"https://pith.science/api/pith-number/QWZS7RYE7VVZPUS7KLIXLEAJGM/events.json","paper":"https://pith.science/paper/QWZS7RYE"},"agent_actions":{"view_html":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM","download_json":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM.json","view_paper":"https://pith.science/paper/QWZS7RYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1636&json=true","fetch_graph":"https://pith.science/api/pith-number/QWZS7RYE7VVZPUS7KLIXLEAJGM/graph.json","fetch_events":"https://pith.science/api/pith-number/QWZS7RYE7VVZPUS7KLIXLEAJGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/action/storage_attestation","attest_author":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/action/author_attestation","sign_citation":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/action/citation_signature","submit_replication":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/action/replication_record"}},"created_at":"2026-05-18T03:41:20.603193+00:00","updated_at":"2026-05-18T03:41:20.603193+00:00"}