{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZBCZCJUMWZ5GSKCS75SVINB2XL","short_pith_number":"pith:ZBCZCJUM","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"},"canonical_sha256":"c84591268cb67a692852ff6554343abad5a32e3bdf5903f7a70ac8237feb9e3b","source":{"kind":"arxiv","id":"1602.02610","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02610","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02610v1","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02610","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZBCZCJUMWZ5G","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZBCZCJUMWZ5GSKCS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZBCZCJUM","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZBCZCJUMWZ5GSKCS75SVINB2XL","target":"record","payload":{"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"},"canonical_sha256":"c84591268cb67a692852ff6554343abad5a32e3bdf5903f7a70ac8237feb9e3b","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"},"source_kind":"arxiv","source_id":"1602.02610","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-18T01:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnC1bVQNInDXSKP4CMwgt337MiuFQxCcC4tkphQ/xw/n+hyAS6AX+QTgMBN5yzURd+PFfFWiK0peLAskDxRvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T22:03:17.607660Z"},"content_sha256":"ffcdf9bb50f87b847d7b8a5ae8947b7c58ffa392649517eb5c7db0ff5d1b449e","schema_version":"1.0","event_id":"sha256:ffcdf9bb50f87b847d7b8a5ae8947b7c58ffa392649517eb5c7db0ff5d1b449e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZBCZCJUMWZ5GSKCS75SVINB2XL","target":"graph","payload":{"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"},"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-18T01:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1G40Q4JT4/uA/C0D/dx5iva4nPUpvUp2ihpmEFpwSPGAgKq0OzWTm4k3AOmQGPYAHNJSwpRRb6GuxwF0AyyxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T22:03:17.608389Z"},"content_sha256":"caf518483a2cfc932f8f08d701706f7ea07725b01c4bb2a8ccdeac24641df73b","schema_version":"1.0","event_id":"sha256:caf518483a2cfc932f8f08d701706f7ea07725b01c4bb2a8ccdeac24641df73b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/bundle.json","state_url":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/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-05-20T22:03:17Z","links":{"resolver":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL","bundle":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/bundle.json","state":"https://pith.science/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBCZCJUMWZ5GSKCS75SVINB2XL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZBCZCJUMWZ5GSKCS75SVINB2XL","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":"644f00cab41215fe5acffd43432b6519aa3f688ee6ff19619ae4d45010e910f5","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T15:40:03Z","title_canon_sha256":"f3ad1a9cfbc071f7a49a33bbc0b8d3945bf11d0bea7d926d73a1fb7c261b6f8a"},"schema_version":"1.0","source":{"id":"1602.02610","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02610","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02610v1","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02610","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZBCZCJUMWZ5G","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZBCZCJUMWZ5GSKCS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZBCZCJUM","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:caf518483a2cfc932f8f08d701706f7ea07725b01c4bb2a8ccdeac24641df73b","target":"graph","created_at":"2026-05-18T01:21:09Z","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 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","authors_text":"Fedor V. Fomin, M. S. Ramanujan, Petr A. Golovach, R\\'emy Belmonte","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T15:40:03Z","title":"Metric Dimension of Bounded Tree-length Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02610","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:ffcdf9bb50f87b847d7b8a5ae8947b7c58ffa392649517eb5c7db0ff5d1b449e","target":"record","created_at":"2026-05-18T01:21:09Z","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":"644f00cab41215fe5acffd43432b6519aa3f688ee6ff19619ae4d45010e910f5","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T15:40:03Z","title_canon_sha256":"f3ad1a9cfbc071f7a49a33bbc0b8d3945bf11d0bea7d926d73a1fb7c261b6f8a"},"schema_version":"1.0","source":{"id":"1602.02610","kind":"arxiv","version":1}},"canonical_sha256":"c84591268cb67a692852ff6554343abad5a32e3bdf5903f7a70ac8237feb9e3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c84591268cb67a692852ff6554343abad5a32e3bdf5903f7a70ac8237feb9e3b","first_computed_at":"2026-05-18T01:21:09.354380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:09.354380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NilbCSaBF33wvvjkf1/RUtQ6N7g9m8pn087JWrqXAcoeYhk4hP5O5VsbGjfPmLwhje8jUbcRkH7+xN1V2rOfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:09.354890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02610","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffcdf9bb50f87b847d7b8a5ae8947b7c58ffa392649517eb5c7db0ff5d1b449e","sha256:caf518483a2cfc932f8f08d701706f7ea07725b01c4bb2a8ccdeac24641df73b"],"state_sha256":"17291caf8d7870b5f4da6326e50324af02242844f3f83b9f11e6767eff906dae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdnU6ubu/TxSrn8m9IbQTaiOnASezg0Uv5RCHbKOO0J/PNcF0SfswzoFAw1Pxip4YrE0WiWNzon3OrT/1dw7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T22:03:17.612518Z","bundle_sha256":"51f474d2f946ebe844f81762525d9a4e756927240c9635ecb6cb692fffa6e836"}}