{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EGX4R7WOS5RSGYC7GJQXNZM2HK","short_pith_number":"pith:EGX4R7WO","schema_version":"1.0","canonical_sha256":"21afc8fece976323605f326176e59a3abdf5ffcac132deec4ed90f9b62c37837","source":{"kind":"arxiv","id":"1804.10670","version":1},"attestation_state":"computed","paper":{"title":"Alternative parameterizations of Metric Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Gregory Gutin, Magnus Wahlstr\\\"om, M. S. Ramanujan","submitted_at":"2018-04-27T20:14:11Z","abstract_excerpt":"A set of vertices $W$ in a graph $G$ is called resolving if for any two distinct $x,y\\in V(G)$, there is $v\\in W$ such that ${\\rm dist}_G(v,x)\\neq{\\rm dist}_G(v,y)$, where ${\\rm dist}_G(u,v)$ denotes the length of a shortest path between $u$ and $v$ in the graph $G$. The metric dimension ${\\rm md}(G)$ of $G$ is the minimum cardinality of a resolving set. The Metric Dimension problem, i.e. deciding whether ${\\rm md}(G)\\le k$, is NP-complete even for interval graphs (Foucaud et al., 2017). We study Metric Dimension (for arbitrary graphs) from the lens of parameterized complexity. The problem par"},"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":"1804.10670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-27T20:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"4c31559cb5978adba07243aaffe6e2ac27ef5f003b06e4766be889fc55ebb571","abstract_canon_sha256":"fc62245788262f347860d94bed7faf51df9a5140dc13e23a5a3d1db88955e831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.907778Z","signature_b64":"RTMxGy0wtYwy5xFp3ggbEmoqoRCpzheM6jARxfKVD4AmeNqbS86AHA6qYu4F7kFFICi0xuR5GSbw6EgloDFhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21afc8fece976323605f326176e59a3abdf5ffcac132deec4ed90f9b62c37837","last_reissued_at":"2026-05-18T00:17:15.907303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.907303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternative parameterizations of Metric Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Gregory Gutin, Magnus Wahlstr\\\"om, M. S. Ramanujan","submitted_at":"2018-04-27T20:14:11Z","abstract_excerpt":"A set of vertices $W$ in a graph $G$ is called resolving if for any two distinct $x,y\\in V(G)$, there is $v\\in W$ such that ${\\rm dist}_G(v,x)\\neq{\\rm dist}_G(v,y)$, where ${\\rm dist}_G(u,v)$ denotes the length of a shortest path between $u$ and $v$ in the graph $G$. The metric dimension ${\\rm md}(G)$ of $G$ is the minimum cardinality of a resolving set. The Metric Dimension problem, i.e. deciding whether ${\\rm md}(G)\\le k$, is NP-complete even for interval graphs (Foucaud et al., 2017). We study Metric Dimension (for arbitrary graphs) from the lens of parameterized complexity. The problem par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10670","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":"1804.10670","created_at":"2026-05-18T00:17:15.907378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10670v1","created_at":"2026-05-18T00:17:15.907378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10670","created_at":"2026-05-18T00:17:15.907378+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGX4R7WOS5RS","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGX4R7WOS5RSGYC7","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGX4R7WO","created_at":"2026-05-18T12:32:22.470017+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/EGX4R7WOS5RSGYC7GJQXNZM2HK","json":"https://pith.science/pith/EGX4R7WOS5RSGYC7GJQXNZM2HK.json","graph_json":"https://pith.science/api/pith-number/EGX4R7WOS5RSGYC7GJQXNZM2HK/graph.json","events_json":"https://pith.science/api/pith-number/EGX4R7WOS5RSGYC7GJQXNZM2HK/events.json","paper":"https://pith.science/paper/EGX4R7WO"},"agent_actions":{"view_html":"https://pith.science/pith/EGX4R7WOS5RSGYC7GJQXNZM2HK","download_json":"https://pith.science/pith/EGX4R7WOS5RSGYC7GJQXNZM2HK.json","view_paper":"https://pith.science/paper/EGX4R7WO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10670&json=true","fetch_graph":"https://pith.science/api/pith-number/EGX4R7WOS5RSGYC7GJQXNZM2HK/graph.json","fetch_events":"https://pith.science/api/pith-number/EGX4R7WOS5RSGYC7GJQXNZM2HK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGX4R7WOS5RSGYC7GJQXNZM2HK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGX4R7WOS5RSGYC7GJQXNZM2HK/action/storage_attestation","attest_author":"https://pith.science/pith/EGX4R7WOS5RSGYC7GJQXNZM2HK/action/author_attestation","sign_citation":"https://pith.science/pith/EGX4R7WOS5RSGYC7GJQXNZM2HK/action/citation_signature","submit_replication":"https://pith.science/pith/EGX4R7WOS5RSGYC7GJQXNZM2HK/action/replication_record"}},"created_at":"2026-05-18T00:17:15.907378+00:00","updated_at":"2026-05-18T00:17:15.907378+00:00"}