{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BMWJ776MYEJBP2P4MRIDCURCJ5","short_pith_number":"pith:BMWJ776M","schema_version":"1.0","canonical_sha256":"0b2c9fffccc11217e9fc64503152224f677a9b0cb073e0151720ba2bf51d213c","source":{"kind":"arxiv","id":"1304.2077","version":1},"attestation_state":"computed","paper":{"title":"Nearly Maximum Flows in Nearly Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jonah Sherman","submitted_at":"2013-04-07T23:42:35Z","abstract_excerpt":"We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using $\\alpha$-\\emph{congestion-approximators}: easy-to-compute functions that approximate the congestion required to route single-commodity demands in a graph to within a factor of $\\alpha$. Our algorithm maintains an arbitrary flow that may have some residual excess and deficits, while taking steps to minimize a potential function measuring the congestion of the current flow plus an over-estimate of the congestion required to route the residual demand. Since the residual term over-estimates, the descent"},"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":"1304.2077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-07T23:42:35Z","cross_cats_sorted":[],"title_canon_sha256":"b568687ba80ca029bea5f17bcce1edc851fddfd01f155d34c028135e834d7325","abstract_canon_sha256":"9ed3325b31112c7998e127a8be7317269386429dce0b7e5c02da40a4268589a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:44.115965Z","signature_b64":"AiSo926UF6PgjtTPMituVvLOS9PfMx/zGraKf9zga+u3q3piVWq72sJwVJA7KIInXqAd/XOV7JivBOAh80kpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b2c9fffccc11217e9fc64503152224f677a9b0cb073e0151720ba2bf51d213c","last_reissued_at":"2026-05-18T03:28:44.115076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:44.115076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Maximum Flows in Nearly Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jonah Sherman","submitted_at":"2013-04-07T23:42:35Z","abstract_excerpt":"We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using $\\alpha$-\\emph{congestion-approximators}: easy-to-compute functions that approximate the congestion required to route single-commodity demands in a graph to within a factor of $\\alpha$. Our algorithm maintains an arbitrary flow that may have some residual excess and deficits, while taking steps to minimize a potential function measuring the congestion of the current flow plus an over-estimate of the congestion required to route the residual demand. Since the residual term over-estimates, the descent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2077","kind":"arxiv","version":1},"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":"1304.2077","created_at":"2026-05-18T03:28:44.115222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2077v1","created_at":"2026-05-18T03:28:44.115222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2077","created_at":"2026-05-18T03:28:44.115222+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMWJ776MYEJB","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMWJ776MYEJBP2P4","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMWJ776M","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10340","citing_title":"Flows in Almost Linear Time via Adaptive Preconditioning","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5","json":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5.json","graph_json":"https://pith.science/api/pith-number/BMWJ776MYEJBP2P4MRIDCURCJ5/graph.json","events_json":"https://pith.science/api/pith-number/BMWJ776MYEJBP2P4MRIDCURCJ5/events.json","paper":"https://pith.science/paper/BMWJ776M"},"agent_actions":{"view_html":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5","download_json":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5.json","view_paper":"https://pith.science/paper/BMWJ776M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2077&json=true","fetch_graph":"https://pith.science/api/pith-number/BMWJ776MYEJBP2P4MRIDCURCJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/BMWJ776MYEJBP2P4MRIDCURCJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/action/storage_attestation","attest_author":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/action/author_attestation","sign_citation":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/action/citation_signature","submit_replication":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/action/replication_record"}},"created_at":"2026-05-18T03:28:44.115222+00:00","updated_at":"2026-05-18T03:28:44.115222+00:00"}