{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6F6XMNDQUOBDCQRRHW2V63YL46","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":"f7c924190fc20a7932a9db5191c457da41fc9a9fedd73656abcfe586430b0611","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-12T12:07:33Z","title_canon_sha256":"a81121dee11335c1923e78af84ecc3ec1fb555e24e327ad9ee2b6b45a1b43f7d"},"schema_version":"1.0","source":{"id":"1107.2256","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2256","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2256v5","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2256","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"6F6XMNDQUOBD","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6F6XMNDQUOBDCQRR","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6F6XMNDQ","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:61ce2f77e11363b386259a51f6cfd886de23ff3afc59ae90a664dd8b96bd281f","target":"graph","created_at":"2026-05-18T01:11:13Z","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 metric dimension of a graph $G$ is the size of a smallest subset $L \\subseteq V(G)$ such that for any $x,y \\in V(G)$ with $x\\not= y$ there is a $z \\in L$ such that the graph distance between $x$ and $z$ differs from the graph distance between $y$ and $z$. Even though this notion has been part of the literature for almost 40 years, prior to our work the computational complexity of determining the metric dimension of a graph was still very unclear. In this paper, we show tight complexity boundaries for the Metric Dimension problem. We achieve this by giving two complementary results. First, ","authors_text":"Erik Jan van Leeuwen, Josep Diaz, Maria Serna, Olli Pottonen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-12T12:07:33Z","title":"Complexity of Metric Dimension on Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2256","kind":"arxiv","version":5},"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:1aecf4c880f9c90cc2167c43c650ff2aaf66b60fcc3b1c9e069d5f8c11cd6329","target":"record","created_at":"2026-05-18T01:11:13Z","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":"f7c924190fc20a7932a9db5191c457da41fc9a9fedd73656abcfe586430b0611","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-12T12:07:33Z","title_canon_sha256":"a81121dee11335c1923e78af84ecc3ec1fb555e24e327ad9ee2b6b45a1b43f7d"},"schema_version":"1.0","source":{"id":"1107.2256","kind":"arxiv","version":5}},"canonical_sha256":"f17d763470a3823142313db55f6f0be7ad08cade60f5a3467d98c5b2ff97c194","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f17d763470a3823142313db55f6f0be7ad08cade60f5a3467d98c5b2ff97c194","first_computed_at":"2026-05-18T01:11:13.917389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:13.917389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6MKvey/Xr//EWHs6gFK2K4ZDhJ0Vn2i7V1qpwwAV1PxUdi3wmLsGjjOTpC8PKAsCyWaB0aOxkl1jkjo+g3CTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:13.917953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2256","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aecf4c880f9c90cc2167c43c650ff2aaf66b60fcc3b1c9e069d5f8c11cd6329","sha256:61ce2f77e11363b386259a51f6cfd886de23ff3afc59ae90a664dd8b96bd281f"],"state_sha256":"86309e22f7a72d748617ca908b4003ea1caba8d14bd7ec8a8b82e20f5eeb5116"}