{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SF642BULHS5SU7XBU7ZUOG52JD","short_pith_number":"pith:SF642BUL","canonical_record":{"source":{"id":"1003.3904","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-20T03:56:55Z","cross_cats_sorted":["cs.DM","cs.NI","math.MG"],"title_canon_sha256":"74792c589058d302726bccfe283bce2e418ddff07984ad813dd5236012bd0436","abstract_canon_sha256":"94d1aee1ea393440c07594438f332f5b799151dbe45884a89b1e8baf561b5d84"},"schema_version":"1.0"},"canonical_sha256":"917dcd068b3cbb2a7ee1a7f3471bba48c657346650e183f14d0d142ebfee4d89","source":{"kind":"arxiv","id":"1003.3904","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3904","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3904v4","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3904","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"SF642BULHS5S","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SF642BULHS5SU7XB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SF642BUL","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SF642BULHS5SU7XBU7ZUOG52JD","target":"record","payload":{"canonical_record":{"source":{"id":"1003.3904","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-20T03:56:55Z","cross_cats_sorted":["cs.DM","cs.NI","math.MG"],"title_canon_sha256":"74792c589058d302726bccfe283bce2e418ddff07984ad813dd5236012bd0436","abstract_canon_sha256":"94d1aee1ea393440c07594438f332f5b799151dbe45884a89b1e8baf561b5d84"},"schema_version":"1.0"},"canonical_sha256":"917dcd068b3cbb2a7ee1a7f3471bba48c657346650e183f14d0d142ebfee4d89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:44.878055Z","signature_b64":"4uUNz9i/Vrg3NszqVJWn1GMVHJyPd0bWgO8KavtyKi22zk3VXH/Nyra/OB6772RCRy506iYAEV1qAK36+po9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"917dcd068b3cbb2a7ee1a7f3471bba48c657346650e183f14d0d142ebfee4d89","last_reissued_at":"2026-05-18T04:12:44.877353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:44.877353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.3904","source_version":4,"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:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d0QJtMgxaQdx79PZnPWiJNCIXt0ZcGbB01BG5ZhzvxkHn3ynyaqLEQ6Ee94AX4fQOc5LNAnsyT+1u+iFUv9sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:44:45.944793Z"},"content_sha256":"9b8dba11ea161aebb5b499efc6d77ea0670d2f7ccaf63c18a46296085ef99064","schema_version":"1.0","event_id":"sha256:9b8dba11ea161aebb5b499efc6d77ea0670d2f7ccaf63c18a46296085ef99064"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SF642BULHS5SU7XBU7ZUOG52JD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The graph bottleneck identity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.NI","math.MG"],"primary_cat":"math.CO","authors_text":"Pavel Chebotarev","submitted_at":"2010-03-20T03:56:55Z","abstract_excerpt":"A matrix $S=(s_{ij})\\in{\\mathbb R}^{n\\times n}$ is said to determine a \\emph{transitional measure} for a digraph $G$ on $n$ vertices if for all $i,j,k\\in\\{1,\\...,n\\},$ the \\emph{transition inequality} $s_{ij} s_{jk}\\le s_{ik} s_{jj}$ holds and reduces to the equality (called the \\emph{graph bottleneck identity}) if and only if every path in $G$ from $i$ to $k$ contains $j$. We show that every positive transitional measure produces a distance by means of a logarithmic transformation. Moreover, the resulting distance $d(\\cdot,\\cdot)$ is \\emph{graph-geodetic}, that is, $d(i,j)+d(j,k)=d(i,k)$ hold"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3904","kind":"arxiv","version":4},"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:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+0pfYkxbKazhuuZihipy4F5yDURJL3op8ljfxusGXySQIx1/Vd4VRP6XlYTHybunHYsuBgNtdXBxOFfnNKPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:44:45.945139Z"},"content_sha256":"f42613a268f64496e8026cced206131e3e4a75346fa48a8e20449c5d80faa2fc","schema_version":"1.0","event_id":"sha256:f42613a268f64496e8026cced206131e3e4a75346fa48a8e20449c5d80faa2fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/bundle.json","state_url":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SF642BULHS5SU7XBU7ZUOG52JD/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-06T18:44:45Z","links":{"resolver":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD","bundle":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/bundle.json","state":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SF642BULHS5SU7XBU7ZUOG52JD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SF642BULHS5SU7XBU7ZUOG52JD","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":"94d1aee1ea393440c07594438f332f5b799151dbe45884a89b1e8baf561b5d84","cross_cats_sorted":["cs.DM","cs.NI","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-20T03:56:55Z","title_canon_sha256":"74792c589058d302726bccfe283bce2e418ddff07984ad813dd5236012bd0436"},"schema_version":"1.0","source":{"id":"1003.3904","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3904","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3904v4","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3904","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"SF642BULHS5S","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SF642BULHS5SU7XB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SF642BUL","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:f42613a268f64496e8026cced206131e3e4a75346fa48a8e20449c5d80faa2fc","target":"graph","created_at":"2026-05-18T04:12:44Z","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 matrix $S=(s_{ij})\\in{\\mathbb R}^{n\\times n}$ is said to determine a \\emph{transitional measure} for a digraph $G$ on $n$ vertices if for all $i,j,k\\in\\{1,\\...,n\\},$ the \\emph{transition inequality} $s_{ij} s_{jk}\\le s_{ik} s_{jj}$ holds and reduces to the equality (called the \\emph{graph bottleneck identity}) if and only if every path in $G$ from $i$ to $k$ contains $j$. We show that every positive transitional measure produces a distance by means of a logarithmic transformation. Moreover, the resulting distance $d(\\cdot,\\cdot)$ is \\emph{graph-geodetic}, that is, $d(i,j)+d(j,k)=d(i,k)$ hold","authors_text":"Pavel Chebotarev","cross_cats":["cs.DM","cs.NI","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-20T03:56:55Z","title":"The graph bottleneck identity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3904","kind":"arxiv","version":4},"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:9b8dba11ea161aebb5b499efc6d77ea0670d2f7ccaf63c18a46296085ef99064","target":"record","created_at":"2026-05-18T04:12:44Z","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":"94d1aee1ea393440c07594438f332f5b799151dbe45884a89b1e8baf561b5d84","cross_cats_sorted":["cs.DM","cs.NI","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-20T03:56:55Z","title_canon_sha256":"74792c589058d302726bccfe283bce2e418ddff07984ad813dd5236012bd0436"},"schema_version":"1.0","source":{"id":"1003.3904","kind":"arxiv","version":4}},"canonical_sha256":"917dcd068b3cbb2a7ee1a7f3471bba48c657346650e183f14d0d142ebfee4d89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"917dcd068b3cbb2a7ee1a7f3471bba48c657346650e183f14d0d142ebfee4d89","first_computed_at":"2026-05-18T04:12:44.877353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:44.877353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4uUNz9i/Vrg3NszqVJWn1GMVHJyPd0bWgO8KavtyKi22zk3VXH/Nyra/OB6772RCRy506iYAEV1qAK36+po9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:44.878055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.3904","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b8dba11ea161aebb5b499efc6d77ea0670d2f7ccaf63c18a46296085ef99064","sha256:f42613a268f64496e8026cced206131e3e4a75346fa48a8e20449c5d80faa2fc"],"state_sha256":"969a0478e1552ff29512b4f144c75246de8e8e1fba762b20850f63626be579bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wfia+fUrsU6cH0aeDHSrWzjzU7hLgPtgaprwKlTeTHAc01ThC4VNAq57AgxQZZkybuTwdMlcm2UjCp5oSiZuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:44:45.946993Z","bundle_sha256":"251f499e402f266add58afc926bb7107a84981611d651de7355defdc86a09018"}}