{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZBCZCJUMWZ5GSKCS75SVINB2XL","short_pith_number":"pith:ZBCZCJUM","schema_version":"1.0","canonical_sha256":"c84591268cb67a692852ff6554343abad5a32e3bdf5903f7a70ac8237feb9e3b","source":{"kind":"arxiv","id":"1602.02610","version":1},"attestation_state":"computed","paper":{"title":"Metric Dimension of Bounded Tree-length Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, M. S. Ramanujan, Petr A. Golovach, R\\'emy Belmonte","submitted_at":"2016-02-08T15:40:03Z","abstract_excerpt":"The notion of resolving sets in a graph was introduced by Slater (1975) and Harary and Melter (1976) as a way of uniquely identifying every vertex in a graph. A set of vertices in a graph is a resolving set if for any pair of vertices x and y there is a vertex in the set which has distinct distances to x and y. A smallest resolving set in a graph is called a metric basis and its size, the metric dimension of the graph. The problem of computing the metric dimension of a graph is a well-known NP-hard problem and while it was known to be polynomial time solvable on trees, it is only recently that"},"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":"1602.02610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T15:40:03Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"f3ad1a9cfbc071f7a49a33bbc0b8d3945bf11d0bea7d926d73a1fb7c261b6f8a","abstract_canon_sha256":"644f00cab41215fe5acffd43432b6519aa3f688ee6ff19619ae4d45010e910f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:09.354890Z","signature_b64":"NilbCSaBF33wvvjkf1/RUtQ6N7g9m8pn087JWrqXAcoeYhk4hP5O5VsbGjfPmLwhje8jUbcRkH7+xN1V2rOfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c84591268cb67a692852ff6554343abad5a32e3bdf5903f7a70ac8237feb9e3b","last_reissued_at":"2026-05-18T01:21:09.354380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:09.354380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Dimension of Bounded Tree-length Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, M. S. Ramanujan, Petr A. Golovach, R\\'emy Belmonte","submitted_at":"2016-02-08T15:40:03Z","abstract_excerpt":"The notion of resolving sets in a graph was introduced by Slater (1975) and Harary and Melter (1976) as a way of uniquely identifying every vertex in a graph. A set of vertices in a graph is a resolving set if for any pair of vertices x and y there is a vertex in the set which has distinct distances to x and y. A smallest resolving set in a graph is called a metric basis and its size, the metric dimension of the graph. The problem of computing the metric dimension of a graph is a well-known NP-hard problem and while it was known to be polynomial time solvable on trees, it is only recently that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02610","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":"1602.02610","created_at":"2026-05-18T01:21:09.354460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02610v1","created_at":"2026-05-18T01:21:09.354460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02610","created_at":"2026-05-18T01:21:09.354460+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBCZCJUMWZ5G","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBCZCJUMWZ5GSKCS","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBCZCJUM","created_at":"2026-05-18T12:30:53.716459+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/ZBCZCJUMWZ5GSKCS75SVINB2XL","json":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL.json","graph_json":"https://pith.science/api/pith-number/ZBCZCJUMWZ5GSKCS75SVINB2XL/graph.json","events_json":"https://pith.science/api/pith-number/ZBCZCJUMWZ5GSKCS75SVINB2XL/events.json","paper":"https://pith.science/paper/ZBCZCJUM"},"agent_actions":{"view_html":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL","download_json":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL.json","view_paper":"https://pith.science/paper/ZBCZCJUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02610&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBCZCJUMWZ5GSKCS75SVINB2XL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBCZCJUMWZ5GSKCS75SVINB2XL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/action/storage_attestation","attest_author":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/action/author_attestation","sign_citation":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/action/citation_signature","submit_replication":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/action/replication_record"}},"created_at":"2026-05-18T01:21:09.354460+00:00","updated_at":"2026-05-18T01:21:09.354460+00:00"}