{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KLTJVQTO4GFHXDRYUIYMECU2GB","short_pith_number":"pith:KLTJVQTO","canonical_record":{"source":{"id":"1806.10389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-27T10:12:55Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ef55e7ea4bb67b2d6f49405a214b1a088d5b610013f9dc4e1eaa5ced91640cb9","abstract_canon_sha256":"4141b0ffdcfdcbdbea2add5c53bff6766f4617be74664b5378524ecf2fd0b6cc"},"schema_version":"1.0"},"canonical_sha256":"52e69ac26ee18a7b8e38a230c20a9a307997f7daf56350454df6cd3cae2ce71b","source":{"kind":"arxiv","id":"1806.10389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10389","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10389v1","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10389","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"KLTJVQTO4GFH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KLTJVQTO4GFHXDRY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KLTJVQTO","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KLTJVQTO4GFHXDRYUIYMECU2GB","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-27T10:12:55Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ef55e7ea4bb67b2d6f49405a214b1a088d5b610013f9dc4e1eaa5ced91640cb9","abstract_canon_sha256":"4141b0ffdcfdcbdbea2add5c53bff6766f4617be74664b5378524ecf2fd0b6cc"},"schema_version":"1.0"},"canonical_sha256":"52e69ac26ee18a7b8e38a230c20a9a307997f7daf56350454df6cd3cae2ce71b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:12.561635Z","signature_b64":"/Ed/DDQVUJIE8n4xDzy3yQZ0qZYLFdKoyPvVyFNZwW67KTfMd9JOeigNijUpFTt/eWpDWqqFlLJqqce0oNx3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52e69ac26ee18a7b8e38a230c20a9a307997f7daf56350454df6cd3cae2ce71b","last_reissued_at":"2026-05-18T00:12:12.560946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:12.560946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10389","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-18T00:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osc7OGxU4ZxGGO1XMghnZLVXe++g9viKKqn5tRxu4lCoYaHI81qhKCIP9eCBRibpk6hX3yr9MC8GcyeDoE3bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:28:55.163035Z"},"content_sha256":"17845d5ebc06763947498c32110c24abe9643983ef1d6ce4464b37b1793a2d07","schema_version":"1.0","event_id":"sha256:17845d5ebc06763947498c32110c24abe9643983ef1d6ce4464b37b1793a2d07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KLTJVQTO4GFHXDRYUIYMECU2GB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the metric dimension by decomposing graphs into extended biconnected components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Duygu Vietz, Egon Wanke, Stefan Hoffmann","submitted_at":"2018-06-27T10:12:55Z","abstract_excerpt":"A vertex set $U \\subseteq V$ of an undirected graph $G=(V,E)$ is a $\\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \\in V$ there is a vertex $w \\in U$ such that the distances between $u$ and $w$ and the distance between $v$ and $w$ are different. The $\\textit{Metric Dimension}$ of $G$ is the size of a smallest resolving set for $G$. Deciding whether a given graph $G$ has Metric Dimension at most $k$ for some integer $k$ is well-known to be NP-complete. Many research has been done to understand the complexity of this problem on restricted graph classes. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10389","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-18T00:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5+BJvcn8SxkN4b41mQC9OX1jv0QnZiOdy/6dmVOzMxbF+Xtd2Cv2cUxxNTI/cEWhGY4il7+dX6z3WWEifwdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:28:55.163398Z"},"content_sha256":"82a9c52872a360ee3cc67936dc52e680b02e7ac78b87ef950154d9f3b26d21c9","schema_version":"1.0","event_id":"sha256:82a9c52872a360ee3cc67936dc52e680b02e7ac78b87ef950154d9f3b26d21c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/bundle.json","state_url":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/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-27T13:28:55Z","links":{"resolver":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB","bundle":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/bundle.json","state":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KLTJVQTO4GFHXDRYUIYMECU2GB","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":"4141b0ffdcfdcbdbea2add5c53bff6766f4617be74664b5378524ecf2fd0b6cc","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-27T10:12:55Z","title_canon_sha256":"ef55e7ea4bb67b2d6f49405a214b1a088d5b610013f9dc4e1eaa5ced91640cb9"},"schema_version":"1.0","source":{"id":"1806.10389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10389","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10389v1","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10389","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"KLTJVQTO4GFH","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KLTJVQTO4GFHXDRY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KLTJVQTO","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:82a9c52872a360ee3cc67936dc52e680b02e7ac78b87ef950154d9f3b26d21c9","target":"graph","created_at":"2026-05-18T00:12:12Z","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 vertex set $U \\subseteq V$ of an undirected graph $G=(V,E)$ is a $\\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \\in V$ there is a vertex $w \\in U$ such that the distances between $u$ and $w$ and the distance between $v$ and $w$ are different. The $\\textit{Metric Dimension}$ of $G$ is the size of a smallest resolving set for $G$. Deciding whether a given graph $G$ has Metric Dimension at most $k$ for some integer $k$ is well-known to be NP-complete. Many research has been done to understand the complexity of this problem on restricted graph classes. In this paper, w","authors_text":"Duygu Vietz, Egon Wanke, Stefan Hoffmann","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-27T10:12:55Z","title":"Computing the metric dimension by decomposing graphs into extended biconnected components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10389","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:17845d5ebc06763947498c32110c24abe9643983ef1d6ce4464b37b1793a2d07","target":"record","created_at":"2026-05-18T00:12:12Z","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":"4141b0ffdcfdcbdbea2add5c53bff6766f4617be74664b5378524ecf2fd0b6cc","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-27T10:12:55Z","title_canon_sha256":"ef55e7ea4bb67b2d6f49405a214b1a088d5b610013f9dc4e1eaa5ced91640cb9"},"schema_version":"1.0","source":{"id":"1806.10389","kind":"arxiv","version":1}},"canonical_sha256":"52e69ac26ee18a7b8e38a230c20a9a307997f7daf56350454df6cd3cae2ce71b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52e69ac26ee18a7b8e38a230c20a9a307997f7daf56350454df6cd3cae2ce71b","first_computed_at":"2026-05-18T00:12:12.560946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:12.560946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Ed/DDQVUJIE8n4xDzy3yQZ0qZYLFdKoyPvVyFNZwW67KTfMd9JOeigNijUpFTt/eWpDWqqFlLJqqce0oNx3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:12.561635Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17845d5ebc06763947498c32110c24abe9643983ef1d6ce4464b37b1793a2d07","sha256:82a9c52872a360ee3cc67936dc52e680b02e7ac78b87ef950154d9f3b26d21c9"],"state_sha256":"a6c6aa10e5daa07554b3e16f72c092e17b7abc2ec30a715bb0c2b0b7bd827282"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOu+gPtCST7ShBdVd1Qdcr198T1xrnTci/3uWG9Bv219X5O8Q51ASiF+E+aOCbbqkmqHVm34pCrNCzHZpkuvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:28:55.165257Z","bundle_sha256":"dfe03fd3eda7e8167c97f39663175e6e6dce3807717b370ec79336713b870aad"}}