{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B27B2JKRCWIJ2VFXBNSTEFLRAW","short_pith_number":"pith:B27B2JKR","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"},"canonical_sha256":"0ebe1d255115909d54b70b65321571059860a66a6d851eec1438243514309995","source":{"kind":"arxiv","id":"1907.08093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08093","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08093v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08093","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"B27B2JKRCWIJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B27B2JKRCWIJ2VFX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B27B2JKR","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B27B2JKRCWIJ2VFXBNSTEFLRAW","target":"record","payload":{"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"},"canonical_sha256":"0ebe1d255115909d54b70b65321571059860a66a6d851eec1438243514309995","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"},"source_kind":"arxiv","source_id":"1907.08093","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-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQ+IiUhCcCecSW7u7NKHHYPfxEeIZoYOo/tK7tTcoE9hZalcMdeZRo9eXsZq7SwEY+n4H5UpoyQ6xw4Fr0HtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:49:18.678212Z"},"content_sha256":"944c8381c707c5c401f54a705d9ab66007658f0ffa3e66a13aa2f83748ae51c4","schema_version":"1.0","event_id":"sha256:944c8381c707c5c401f54a705d9ab66007658f0ffa3e66a13aa2f83748ae51c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B27B2JKRCWIJ2VFXBNSTEFLRAW","target":"graph","payload":{"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"},"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-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Km3Gr5rVABSx8SFB1DIJWoHtPtEwqdu0nfJV7rf+yDQtZDXpXF6aaU6vxC6Sx9Qc7Z+CLLwl7i4Ze7/FEY4AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:49:18.678752Z"},"content_sha256":"d0a34a73e7833b14ef80b310599fe3f1ca4a70f5b4fc4c1473858ca59ab19d0e","schema_version":"1.0","event_id":"sha256:d0a34a73e7833b14ef80b310599fe3f1ca4a70f5b4fc4c1473858ca59ab19d0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/bundle.json","state_url":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/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-05-26T22:49:18Z","links":{"resolver":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW","bundle":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/bundle.json","state":"https://pith.science/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B27B2JKRCWIJ2VFXBNSTEFLRAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B27B2JKRCWIJ2VFXBNSTEFLRAW","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":"aa355a8c7b7ba0919e24170fc7d1f1f2cafdec44fd8bd39c1bfc94744e5eb04f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-18T14:46:20Z","title_canon_sha256":"a0c4ca908ddd2aa52a2b2789dd9e6f8d3472663abaf93e13e3631d399c3e20c9"},"schema_version":"1.0","source":{"id":"1907.08093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08093","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08093v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08093","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"B27B2JKRCWIJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B27B2JKRCWIJ2VFX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B27B2JKR","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:d0a34a73e7833b14ef80b310599fe3f1ca4a70f5b4fc4c1473858ca59ab19d0e","target":"graph","created_at":"2026-05-17T23:40:15Z","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":"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","authors_text":"\\'Edouard Bonnet, Nidhi Purohit","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-18T14:46:20Z","title":"Metric Dimension Parameterized by Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08093","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:944c8381c707c5c401f54a705d9ab66007658f0ffa3e66a13aa2f83748ae51c4","target":"record","created_at":"2026-05-17T23:40:15Z","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":"aa355a8c7b7ba0919e24170fc7d1f1f2cafdec44fd8bd39c1bfc94744e5eb04f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-18T14:46:20Z","title_canon_sha256":"a0c4ca908ddd2aa52a2b2789dd9e6f8d3472663abaf93e13e3631d399c3e20c9"},"schema_version":"1.0","source":{"id":"1907.08093","kind":"arxiv","version":1}},"canonical_sha256":"0ebe1d255115909d54b70b65321571059860a66a6d851eec1438243514309995","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ebe1d255115909d54b70b65321571059860a66a6d851eec1438243514309995","first_computed_at":"2026-05-17T23:40:15.123572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:15.123572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"57N1fI5zp6hWhodwdfLhdh3dBnRgVgUrqvK6gOHoE7EZMh60z3pRWuu7q3qOxUPs6HuVBiCGRRMeFJx8aB6rAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:15.124279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:944c8381c707c5c401f54a705d9ab66007658f0ffa3e66a13aa2f83748ae51c4","sha256:d0a34a73e7833b14ef80b310599fe3f1ca4a70f5b4fc4c1473858ca59ab19d0e"],"state_sha256":"3357c48de524339d95a4220312df540f4536362d54cab9f61d2d7ac286ae1997"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M9p6nUBwiqftoGUCMuo3xW5HGnHxdSPj1SKfMdyiTPXOx1nZ1whEATHe2DSqc0u6jKRE3jsP/JKKnl15BVufBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:49:18.682358Z","bundle_sha256":"a6f43573c35e25b28960fb4c8b14d768b50e57bb0d0b055724f6ffbdc6c6aeb7"}}