{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BMPRVU5SBQLE7T25XO4TJJEFWT","short_pith_number":"pith:BMPRVU5S","canonical_record":{"source":{"id":"1509.02129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T17:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"f3fb601329177c99056bc603c8e5054c5dc295319c67040de766938b3825cb34","abstract_canon_sha256":"da444c266f1055611d7dc7119c11d92b2a693d74a2daef9c40493a586128d4ad"},"schema_version":"1.0"},"canonical_sha256":"0b1f1ad3b20c164fcf5dbbb934a485b4d9a17bc22ccb2a74e40fddfefa2ebdb5","source":{"kind":"arxiv","id":"1509.02129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02129","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02129v1","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02129","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"BMPRVU5SBQLE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BMPRVU5SBQLE7T25","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BMPRVU5S","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BMPRVU5SBQLE7T25XO4TJJEFWT","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T17:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"f3fb601329177c99056bc603c8e5054c5dc295319c67040de766938b3825cb34","abstract_canon_sha256":"da444c266f1055611d7dc7119c11d92b2a693d74a2daef9c40493a586128d4ad"},"schema_version":"1.0"},"canonical_sha256":"0b1f1ad3b20c164fcf5dbbb934a485b4d9a17bc22ccb2a74e40fddfefa2ebdb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:49.676421Z","signature_b64":"1vWocdQ2xJgFfe722P9hNd6VtvSKHPY2UwMfDKSHMnseRDK/ChcE0YaUpbMnxiE7U4FgqkqyiSsvx5TaoOu3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b1f1ad3b20c164fcf5dbbb934a485b4d9a17bc22ccb2a74e40fddfefa2ebdb5","last_reissued_at":"2026-05-18T01:33:49.675884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:49.675884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02129","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:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTHWQuEukT3s6LuR8UdMWZbPFn/8hFozOxJsy8UlXzKCh9TFeVAcCL5ca22W/zFA/nsn6UX+u5Kr/vpvm/v9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:24:02.753578Z"},"content_sha256":"19151dd1359eddff9e825804bf954e3b910046250f761f53de27569da677c88a","schema_version":"1.0","event_id":"sha256:19151dd1359eddff9e825804bf954e3b910046250f761f53de27569da677c88a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BMPRVU5SBQLE7T25XO4TJJEFWT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A characterization of some graphs with metric dimension two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akbar Davoodi, Ali Behtoei, Behnaz Omoomi, Mohsen Jannesari","submitted_at":"2015-09-07T17:18:17Z","abstract_excerpt":"A set W \\subseteq V (G) is called a resolving set, if for each pair of distinct vertices u,v \\in V (G) there exists t \\in W such that d(u,t) \\neq d(v,t), where d(x,y) is the distance between vertices x and y. The cardinality of a minimum resolving set for G is called the metric dimension of G and is denoted by dim_M(G). A k-tree is a chordal graph all of whose maximal cliques are the same size k + 1 and all of whose minimal clique separators are also all the same size k. A k-path is a k-tree with maximum degree 2k, where for each integer j, k \\leq j < 2k, there exists a unique pair of vertices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02129","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:33:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaR8XOLSgklWBzr93LgCkUTkoypa04lnGWSmeYSe+0RW8X5uL9q/JqA0qYU8daxr1O37axS+sOMavTnmmyneCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:24:02.753915Z"},"content_sha256":"25fc2c6961439a7abb3728abbd22e13386187ae0a0380c97fe00cdc967bb3a08","schema_version":"1.0","event_id":"sha256:25fc2c6961439a7abb3728abbd22e13386187ae0a0380c97fe00cdc967bb3a08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMPRVU5SBQLE7T25XO4TJJEFWT/bundle.json","state_url":"https://pith.science/pith/BMPRVU5SBQLE7T25XO4TJJEFWT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMPRVU5SBQLE7T25XO4TJJEFWT/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-06-22T12:24:02Z","links":{"resolver":"https://pith.science/pith/BMPRVU5SBQLE7T25XO4TJJEFWT","bundle":"https://pith.science/pith/BMPRVU5SBQLE7T25XO4TJJEFWT/bundle.json","state":"https://pith.science/pith/BMPRVU5SBQLE7T25XO4TJJEFWT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMPRVU5SBQLE7T25XO4TJJEFWT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BMPRVU5SBQLE7T25XO4TJJEFWT","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":"da444c266f1055611d7dc7119c11d92b2a693d74a2daef9c40493a586128d4ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T17:18:17Z","title_canon_sha256":"f3fb601329177c99056bc603c8e5054c5dc295319c67040de766938b3825cb34"},"schema_version":"1.0","source":{"id":"1509.02129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02129","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02129v1","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02129","created_at":"2026-05-18T01:33:49Z"},{"alias_kind":"pith_short_12","alias_value":"BMPRVU5SBQLE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BMPRVU5SBQLE7T25","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BMPRVU5S","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:25fc2c6961439a7abb3728abbd22e13386187ae0a0380c97fe00cdc967bb3a08","target":"graph","created_at":"2026-05-18T01:33:49Z","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":"A set W \\subseteq V (G) is called a resolving set, if for each pair of distinct vertices u,v \\in V (G) there exists t \\in W such that d(u,t) \\neq d(v,t), where d(x,y) is the distance between vertices x and y. The cardinality of a minimum resolving set for G is called the metric dimension of G and is denoted by dim_M(G). A k-tree is a chordal graph all of whose maximal cliques are the same size k + 1 and all of whose minimal clique separators are also all the same size k. A k-path is a k-tree with maximum degree 2k, where for each integer j, k \\leq j < 2k, there exists a unique pair of vertices","authors_text":"Akbar Davoodi, Ali Behtoei, Behnaz Omoomi, Mohsen Jannesari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T17:18:17Z","title":"A characterization of some graphs with metric dimension two"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02129","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:19151dd1359eddff9e825804bf954e3b910046250f761f53de27569da677c88a","target":"record","created_at":"2026-05-18T01:33:49Z","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":"da444c266f1055611d7dc7119c11d92b2a693d74a2daef9c40493a586128d4ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-07T17:18:17Z","title_canon_sha256":"f3fb601329177c99056bc603c8e5054c5dc295319c67040de766938b3825cb34"},"schema_version":"1.0","source":{"id":"1509.02129","kind":"arxiv","version":1}},"canonical_sha256":"0b1f1ad3b20c164fcf5dbbb934a485b4d9a17bc22ccb2a74e40fddfefa2ebdb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b1f1ad3b20c164fcf5dbbb934a485b4d9a17bc22ccb2a74e40fddfefa2ebdb5","first_computed_at":"2026-05-18T01:33:49.675884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:49.675884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1vWocdQ2xJgFfe722P9hNd6VtvSKHPY2UwMfDKSHMnseRDK/ChcE0YaUpbMnxiE7U4FgqkqyiSsvx5TaoOu3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:49.676421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19151dd1359eddff9e825804bf954e3b910046250f761f53de27569da677c88a","sha256:25fc2c6961439a7abb3728abbd22e13386187ae0a0380c97fe00cdc967bb3a08"],"state_sha256":"721bab28e4ad7492fb89a6be5eb4f7a5660ee3bdf4fc40432d01d28ece660795"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"546PPvbU37d8gZL2cwYYKgKhuiUn/tcLqTND2Pu5phDUgWd7r67Ry35Cgm5kNrIOo1gueu64MIHWuuI/3ItsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:24:02.755788Z","bundle_sha256":"88b5c5ce388c0f209796bea20753b8867b6cff525473ebada21272deb9bf593b"}}