{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SF642BULHS5SU7XBU7ZUOG52JD","short_pith_number":"pith:SF642BUL","schema_version":"1.0","canonical_sha256":"917dcd068b3cbb2a7ee1a7f3471bba48c657346650e183f14d0d142ebfee4d89","source":{"kind":"arxiv","id":"1003.3904","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1003.3904","created_at":"2026-05-18T04:12:44.877456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.3904v4","created_at":"2026-05-18T04:12:44.877456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3904","created_at":"2026-05-18T04:12:44.877456+00:00"},{"alias_kind":"pith_short_12","alias_value":"SF642BULHS5S","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SF642BULHS5SU7XB","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SF642BUL","created_at":"2026-05-18T12:26:13.927090+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/SF642BULHS5SU7XBU7ZUOG52JD","json":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD.json","graph_json":"https://pith.science/api/pith-number/SF642BULHS5SU7XBU7ZUOG52JD/graph.json","events_json":"https://pith.science/api/pith-number/SF642BULHS5SU7XBU7ZUOG52JD/events.json","paper":"https://pith.science/paper/SF642BUL"},"agent_actions":{"view_html":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD","download_json":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD.json","view_paper":"https://pith.science/paper/SF642BUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.3904&json=true","fetch_graph":"https://pith.science/api/pith-number/SF642BULHS5SU7XBU7ZUOG52JD/graph.json","fetch_events":"https://pith.science/api/pith-number/SF642BULHS5SU7XBU7ZUOG52JD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/action/storage_attestation","attest_author":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/action/author_attestation","sign_citation":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/action/citation_signature","submit_replication":"https://pith.science/pith/SF642BULHS5SU7XBU7ZUOG52JD/action/replication_record"}},"created_at":"2026-05-18T04:12:44.877456+00:00","updated_at":"2026-05-18T04:12:44.877456+00:00"}