{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:GHB45ZIL73PLWSWNLI5KKX65V2","short_pith_number":"pith:GHB45ZIL","schema_version":"1.0","canonical_sha256":"31c3cee50bfedebb4acd5a3aa55fddae8dfb6ed866964156bd83f4f923bd4ca1","source":{"kind":"arxiv","id":"0810.2717","version":8},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0810.2717","created_at":"2026-05-18T04:31:12.256716+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.2717v8","created_at":"2026-05-18T04:31:12.256716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.2717","created_at":"2026-05-18T04:31:12.256716+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHB45ZIL73PL","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHB45ZIL73PLWSWN","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHB45ZIL","created_at":"2026-05-18T12:25:57.157939+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/GHB45ZIL73PLWSWNLI5KKX65V2","json":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2.json","graph_json":"https://pith.science/api/pith-number/GHB45ZIL73PLWSWNLI5KKX65V2/graph.json","events_json":"https://pith.science/api/pith-number/GHB45ZIL73PLWSWNLI5KKX65V2/events.json","paper":"https://pith.science/paper/GHB45ZIL"},"agent_actions":{"view_html":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2","download_json":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2.json","view_paper":"https://pith.science/paper/GHB45ZIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.2717&json=true","fetch_graph":"https://pith.science/api/pith-number/GHB45ZIL73PLWSWNLI5KKX65V2/graph.json","fetch_events":"https://pith.science/api/pith-number/GHB45ZIL73PLWSWNLI5KKX65V2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/action/storage_attestation","attest_author":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/action/author_attestation","sign_citation":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/action/citation_signature","submit_replication":"https://pith.science/pith/GHB45ZIL73PLWSWNLI5KKX65V2/action/replication_record"}},"created_at":"2026-05-18T04:31:12.256716+00:00","updated_at":"2026-05-18T04:31:12.256716+00:00"}