{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KLTJVQTO4GFHXDRYUIYMECU2GB","short_pith_number":"pith:KLTJVQTO","schema_version":"1.0","canonical_sha256":"52e69ac26ee18a7b8e38a230c20a9a307997f7daf56350454df6cd3cae2ce71b","source":{"kind":"arxiv","id":"1806.10389","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.10389","created_at":"2026-05-18T00:12:12.561053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10389v1","created_at":"2026-05-18T00:12:12.561053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10389","created_at":"2026-05-18T00:12:12.561053+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLTJVQTO4GFH","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLTJVQTO4GFHXDRY","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLTJVQTO","created_at":"2026-05-18T12:32:33.847187+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/KLTJVQTO4GFHXDRYUIYMECU2GB","json":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB.json","graph_json":"https://pith.science/api/pith-number/KLTJVQTO4GFHXDRYUIYMECU2GB/graph.json","events_json":"https://pith.science/api/pith-number/KLTJVQTO4GFHXDRYUIYMECU2GB/events.json","paper":"https://pith.science/paper/KLTJVQTO"},"agent_actions":{"view_html":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB","download_json":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB.json","view_paper":"https://pith.science/paper/KLTJVQTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10389&json=true","fetch_graph":"https://pith.science/api/pith-number/KLTJVQTO4GFHXDRYUIYMECU2GB/graph.json","fetch_events":"https://pith.science/api/pith-number/KLTJVQTO4GFHXDRYUIYMECU2GB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/action/storage_attestation","attest_author":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/action/author_attestation","sign_citation":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/action/citation_signature","submit_replication":"https://pith.science/pith/KLTJVQTO4GFHXDRYUIYMECU2GB/action/replication_record"}},"created_at":"2026-05-18T00:12:12.561053+00:00","updated_at":"2026-05-18T00:12:12.561053+00:00"}