{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QWZS7RYE7VVZPUS7KLIXLEAJGM","short_pith_number":"pith:QWZS7RYE","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"},"canonical_sha256":"85b32fc704fd6b97d25f52d175900933009a4d8d83952a87c7207baadafbc10e","source":{"kind":"arxiv","id":"1211.1636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1636","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1636v1","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1636","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"QWZS7RYE7VVZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QWZS7RYE7VVZPUS7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QWZS7RYE","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QWZS7RYE7VVZPUS7KLIXLEAJGM","target":"record","payload":{"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"},"canonical_sha256":"85b32fc704fd6b97d25f52d175900933009a4d8d83952a87c7207baadafbc10e","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"},"source_kind":"arxiv","source_id":"1211.1636","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cc6MKXWkc1pt4iBZSuxQqat/6Xnkriwn4KE5f6E2qa2ZZPf07bICgXJvVAVm+/tAVYN0vsQfAIn6U1d0KRSpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:40:13.496225Z"},"content_sha256":"9958ded3795549b73725e3b91f284aad6980edb38183fbc71d295566a16478f8","schema_version":"1.0","event_id":"sha256:9958ded3795549b73725e3b91f284aad6980edb38183fbc71d295566a16478f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QWZS7RYE7VVZPUS7KLIXLEAJGM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMeVY67RJZJ0ZXaXNFG9andPo8pOOdU/ZS/gjLQQsgJFvUM1gr3RprnyLtH8wIGhLgPQuvi0EIyhMPLvTqqSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:40:13.496604Z"},"content_sha256":"96c4715450d0193a863ed69c2d4ca19deae659a3fc32af802f5a735988019fcb","schema_version":"1.0","event_id":"sha256:96c4715450d0193a863ed69c2d4ca19deae659a3fc32af802f5a735988019fcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/bundle.json","state_url":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T03:40:13Z","links":{"resolver":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM","bundle":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/bundle.json","state":"https://pith.science/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWZS7RYE7VVZPUS7KLIXLEAJGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QWZS7RYE7VVZPUS7KLIXLEAJGM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ae5338a8364c3bd358a91ca1e7572bb1a9d780505c07bcd793011426a6d02279","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T18:50:44Z","title_canon_sha256":"fd08c4be22ddc758d9250e9a5332c47bdecaf0d6b3469953c92cec1e4c45aa9f"},"schema_version":"1.0","source":{"id":"1211.1636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1636","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1636v1","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1636","created_at":"2026-05-18T03:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"QWZS7RYE7VVZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QWZS7RYE7VVZPUS7","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QWZS7RYE","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:96c4715450d0193a863ed69c2d4ca19deae659a3fc32af802f5a735988019fcb","target":"graph","created_at":"2026-05-18T03:41:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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:","authors_text":"Andr\\'e Nichterlein, Sepp Hartung","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T18:50:44Z","title":"On the Parameterized and Approximation Hardness of Metric Dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1636","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9958ded3795549b73725e3b91f284aad6980edb38183fbc71d295566a16478f8","target":"record","created_at":"2026-05-18T03:41:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ae5338a8364c3bd358a91ca1e7572bb1a9d780505c07bcd793011426a6d02279","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-07T18:50:44Z","title_canon_sha256":"fd08c4be22ddc758d9250e9a5332c47bdecaf0d6b3469953c92cec1e4c45aa9f"},"schema_version":"1.0","source":{"id":"1211.1636","kind":"arxiv","version":1}},"canonical_sha256":"85b32fc704fd6b97d25f52d175900933009a4d8d83952a87c7207baadafbc10e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85b32fc704fd6b97d25f52d175900933009a4d8d83952a87c7207baadafbc10e","first_computed_at":"2026-05-18T03:41:20.603123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:20.603123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vvJZ1Gg3PAQctrW2AYRCXAHZHd703nUdRGjmDo4mT7BLsX09o1m7wtjaHeVzdzUjCE8RsVVz5PMnB+D7h+n0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:20.603575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9958ded3795549b73725e3b91f284aad6980edb38183fbc71d295566a16478f8","sha256:96c4715450d0193a863ed69c2d4ca19deae659a3fc32af802f5a735988019fcb"],"state_sha256":"3089b6cb6c83f0ef95ed2936085d7b741b8ed610360add2358fb4fbc2584a382"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUkJN7yANUDGKLMtbjmwvgtlQkasJGgCZMeJGE9IiaRqP+I+bP/R5LJbrOKXmklfmCofY7uqIywZm70UqeoPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:40:13.498737Z","bundle_sha256":"f93bdb166fe194745def12285d4fc384cc7f9bdb062771481783e0c816670b2c"}}