{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3PB2MRZMTBVGUQ2DYIYJZH2JPN","short_pith_number":"pith:3PB2MRZM","schema_version":"1.0","canonical_sha256":"dbc3a6472c986a6a4343c2309c9f497b7b45786cef865b686623570949c6e0b3","source":{"kind":"arxiv","id":"1901.01412","version":4},"attestation_state":"computed","paper":{"title":"New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Ohad Trabelsi, Robert Krauthgamer","submitted_at":"2019-01-05T13:20:46Z","abstract_excerpt":"We investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with $n$ nodes and $m$ edges, compute for all pairs of nodes the maximum-flow value between them. If Max-Flow (the version with a given source-sink pair $s,t$) can be solved in time $T(m)$, then an $O(n^2) \\cdot T(m)$ is a trivial upper bound. But can we do better?\n  For directed graphs, recent results in fine-grained complexity suggest that this time bound is essentially optimal. In contrast, for undirected graphs with edge capacities, a seminal algorithm of Gomory and Hu (1961) runs in much faster time $O(n)\\"},"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":"1901.01412","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-05T13:20:46Z","cross_cats_sorted":[],"title_canon_sha256":"f3644d24e97ec5cd1b3677795b0fc55b52d823995b2f7ca80f1b0d0d494889b8","abstract_canon_sha256":"914b4d7ef3aa798038279a209020d96efa0aad9bf71644aa8b628557e2ea1815"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:00.939064Z","signature_b64":"tgIfY9o12UPHUj6UKHV9b2mtSrQPXWPicWP5F4QWjTf8IVsC63tki+HZz5jB4Fo0gry7Sadf0mHD7KetzphnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc3a6472c986a6a4343c2309c9f497b7b45786cef865b686623570949c6e0b3","last_reissued_at":"2026-05-17T23:41:00.938437Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:00.938437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Ohad Trabelsi, Robert Krauthgamer","submitted_at":"2019-01-05T13:20:46Z","abstract_excerpt":"We investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with $n$ nodes and $m$ edges, compute for all pairs of nodes the maximum-flow value between them. If Max-Flow (the version with a given source-sink pair $s,t$) can be solved in time $T(m)$, then an $O(n^2) \\cdot T(m)$ is a trivial upper bound. But can we do better?\n  For directed graphs, recent results in fine-grained complexity suggest that this time bound is essentially optimal. In contrast, for undirected graphs with edge capacities, a seminal algorithm of Gomory and Hu (1961) runs in much faster time $O(n)\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01412","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":"1901.01412","created_at":"2026-05-17T23:41:00.938536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01412v4","created_at":"2026-05-17T23:41:00.938536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01412","created_at":"2026-05-17T23:41:00.938536+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PB2MRZMTBVG","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PB2MRZMTBVGUQ2D","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PB2MRZM","created_at":"2026-05-18T12:33:07.085635+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/3PB2MRZMTBVGUQ2DYIYJZH2JPN","json":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN.json","graph_json":"https://pith.science/api/pith-number/3PB2MRZMTBVGUQ2DYIYJZH2JPN/graph.json","events_json":"https://pith.science/api/pith-number/3PB2MRZMTBVGUQ2DYIYJZH2JPN/events.json","paper":"https://pith.science/paper/3PB2MRZM"},"agent_actions":{"view_html":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN","download_json":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN.json","view_paper":"https://pith.science/paper/3PB2MRZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01412&json=true","fetch_graph":"https://pith.science/api/pith-number/3PB2MRZMTBVGUQ2DYIYJZH2JPN/graph.json","fetch_events":"https://pith.science/api/pith-number/3PB2MRZMTBVGUQ2DYIYJZH2JPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/action/storage_attestation","attest_author":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/action/author_attestation","sign_citation":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/action/citation_signature","submit_replication":"https://pith.science/pith/3PB2MRZMTBVGUQ2DYIYJZH2JPN/action/replication_record"}},"created_at":"2026-05-17T23:41:00.938536+00:00","updated_at":"2026-05-17T23:41:00.938536+00:00"}