{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:GHB45ZIL73PLWSWNLI5KKX65V2","short_pith_number":"pith:GHB45ZIL","canonical_record":{"source":{"id":"0810.2717","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-10-15T16:07:04Z","cross_cats_sorted":["cs.DM","math.MG"],"title_canon_sha256":"f5056694a957db0f4c7ffb143e71368db9d856661a69b61f79121e6fbde7acb4","abstract_canon_sha256":"bf06fc7ad40e5c6c3ba5a4f05799d827a2c5d241b35b23526839754dc4375879"},"schema_version":"1.0"},"canonical_sha256":"31c3cee50bfedebb4acd5a3aa55fddae8dfb6ed866964156bd83f4f923bd4ca1","source":{"kind":"arxiv","id":"0810.2717","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.2717","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"0810.2717v8","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.2717","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"GHB45ZIL73PL","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GHB45ZIL73PLWSWN","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GHB45ZIL","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:GHB45ZIL73PLWSWNLI5KKX65V2","target":"record","payload":{"canonical_record":{"source":{"id":"0810.2717","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-10-15T16:07:04Z","cross_cats_sorted":["cs.DM","math.MG"],"title_canon_sha256":"f5056694a957db0f4c7ffb143e71368db9d856661a69b61f79121e6fbde7acb4","abstract_canon_sha256":"bf06fc7ad40e5c6c3ba5a4f05799d827a2c5d241b35b23526839754dc4375879"},"schema_version":"1.0"},"canonical_sha256":"31c3cee50bfedebb4acd5a3aa55fddae8dfb6ed866964156bd83f4f923bd4ca1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:12.257186Z","signature_b64":"jDGSEqXXgWaJVAnwueo2Otvt08nTEmCFWMLF5LSkZ/tzvUD2tIn75RCbbywLXjGavcrlCEX4fPq9Tvc5cNkrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31c3cee50bfedebb4acd5a3aa55fddae8dfb6ed866964156bd83f4f923bd4ca1","last_reissued_at":"2026-05-18T04:31:12.256631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:12.256631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0810.2717","source_version":8,"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-18T04:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQavrfZ1TXBefl2OQlzyItiYRhQYSVv08gME0suyzHEc9T2AKHRZGHJWN/ykT5row+kA4o0XfMd0aa/fw5s4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:53:59.482549Z"},"content_sha256":"a10234c828083997b4ffe1944c92c0baaba99617514cebc6ba266582b2a54db7","schema_version":"1.0","event_id":"sha256:a10234c828083997b4ffe1944c92c0baaba99617514cebc6ba266582b2a54db7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:GHB45ZIL73PLWSWNLI5KKX65V2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.MG"],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev","submitted_at":"2008-10-15T16:07:04Z","abstract_excerpt":"A new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family parameters. The main property of the class is that all distances it comprises are graph-geodetic: $d(i,j)+d(j,k)=d(i,k)$ if and only if every path from $i$ to $k$ passes through $j$. The construction of the class is based on the matrix forest theorem and the transition inequality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.2717","kind":"arxiv","version":8},"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-18T04:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJF/BXFS+yOABXdzxyg4ew9qWranRamLRbQVhh0voC0ixthTIhaltYg5rkN6yZe7lT94swFS/CcchLx8QndlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:53:59.482899Z"},"content_sha256":"e63f25ef9f90274e771126da5ad260d4edc8d813a7500ca9558b8ce27c7a9415","schema_version":"1.0","event_id":"sha256:e63f25ef9f90274e771126da5ad260d4edc8d813a7500ca9558b8ce27c7a9415"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/bundle.json","state_url":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHB45ZIL73PLWSWNLI5KKX65V2/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-07-07T04:53:59Z","links":{"resolver":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2","bundle":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/bundle.json","state":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHB45ZIL73PLWSWNLI5KKX65V2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:GHB45ZIL73PLWSWNLI5KKX65V2","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":"bf06fc7ad40e5c6c3ba5a4f05799d827a2c5d241b35b23526839754dc4375879","cross_cats_sorted":["cs.DM","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-10-15T16:07:04Z","title_canon_sha256":"f5056694a957db0f4c7ffb143e71368db9d856661a69b61f79121e6fbde7acb4"},"schema_version":"1.0","source":{"id":"0810.2717","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.2717","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"0810.2717v8","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.2717","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"GHB45ZIL73PL","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GHB45ZIL73PLWSWN","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GHB45ZIL","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:e63f25ef9f90274e771126da5ad260d4edc8d813a7500ca9558b8ce27c7a9415","target":"graph","created_at":"2026-05-18T04:31:12Z","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 new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family parameters. The main property of the class is that all distances it comprises are graph-geodetic: $d(i,j)+d(j,k)=d(i,k)$ if and only if every path from $i$ to $k$ passes through $j$. The construction of the class is based on the matrix forest theorem and the transition inequality.","authors_text":"Pavel Chebotarev","cross_cats":["cs.DM","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-10-15T16:07:04Z","title":"A Class of Graph-Geodetic Distances Generalizing the Shortest-Path and the Resistance Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.2717","kind":"arxiv","version":8},"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:a10234c828083997b4ffe1944c92c0baaba99617514cebc6ba266582b2a54db7","target":"record","created_at":"2026-05-18T04:31:12Z","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":"bf06fc7ad40e5c6c3ba5a4f05799d827a2c5d241b35b23526839754dc4375879","cross_cats_sorted":["cs.DM","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-10-15T16:07:04Z","title_canon_sha256":"f5056694a957db0f4c7ffb143e71368db9d856661a69b61f79121e6fbde7acb4"},"schema_version":"1.0","source":{"id":"0810.2717","kind":"arxiv","version":8}},"canonical_sha256":"31c3cee50bfedebb4acd5a3aa55fddae8dfb6ed866964156bd83f4f923bd4ca1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31c3cee50bfedebb4acd5a3aa55fddae8dfb6ed866964156bd83f4f923bd4ca1","first_computed_at":"2026-05-18T04:31:12.256631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:12.256631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jDGSEqXXgWaJVAnwueo2Otvt08nTEmCFWMLF5LSkZ/tzvUD2tIn75RCbbywLXjGavcrlCEX4fPq9Tvc5cNkrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:12.257186Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.2717","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a10234c828083997b4ffe1944c92c0baaba99617514cebc6ba266582b2a54db7","sha256:e63f25ef9f90274e771126da5ad260d4edc8d813a7500ca9558b8ce27c7a9415"],"state_sha256":"bab56c57ebb24e7b664c0cbb6a23430baa81c4335ccdc63a4f2d25ddf5c85d20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/r/v9KwrXg6vJsjD7DSFPv/jZranHq16SumhYgJYiSsUHlJpmKfr9SBA+SNM9HhrKx2JnEhgIma6qK6UAaVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:53:59.484994Z","bundle_sha256":"b30a79c24a3d9e453c524058df2709616a4bf29f66616b03aa406ccf00681ff3"}}