{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F22CUKRJSP2SPYVF755L5MIUWI","short_pith_number":"pith:F22CUKRJ","schema_version":"1.0","canonical_sha256":"2eb42a2a2993f527e2a5ff7abeb114b21f9c3335b807aab3ad5f512a7b581c21","source":{"kind":"arxiv","id":"1608.06016","version":1},"attestation_state":"computed","paper":{"title":"Computing Maximum Flow with Augmenting Electrical Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Madry","submitted_at":"2016-08-21T23:53:22Z","abstract_excerpt":"We present an $\\tilde{O}\\left(m^{\\frac{10}{7}}U^{\\frac{1}{7}}\\right)$-time algorithm for the maximum $s$-$t$ flow problem and the minimum $s$-$t$ cut problem in directed graphs with $m$ arcs and largest integer capacity $U$. This matches the running time of the $\\tilde{O}\\left((mU)^{\\frac{10}{7}}\\right)$-time algorithm of M\\k{a}dry (FOCS 2013) in the unit-capacity case, and improves over it, as well as over the $\\tilde{O}\\left(m \\sqrt{n} \\log U\\right)$-time algorithm of Lee and Sidford (FOCS 2014), whenever $U$ is moderately large and the graph is sufficiently sparse. By well-known reductions,"},"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":"1608.06016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-21T23:53:22Z","cross_cats_sorted":[],"title_canon_sha256":"01787f952af8c217bb834832323662718ce4aaaa15a493ecd9a015626a5bfe07","abstract_canon_sha256":"48973bbadb51bb76537bac533e5c7c37a67e52cd4c46f9d1d5371269c8993bc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:22.541379Z","signature_b64":"qu61faiuKbR1291w+gyp6EQ3u1rX37pizyaUVhcxFTpVdd/QoDWa7cEliKu8asZPLT9HBBDsMUXX3/ZNjbLDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb42a2a2993f527e2a5ff7abeb114b21f9c3335b807aab3ad5f512a7b581c21","last_reissued_at":"2026-05-18T01:08:22.540705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:22.540705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Maximum Flow with Augmenting Electrical Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aleksander Madry","submitted_at":"2016-08-21T23:53:22Z","abstract_excerpt":"We present an $\\tilde{O}\\left(m^{\\frac{10}{7}}U^{\\frac{1}{7}}\\right)$-time algorithm for the maximum $s$-$t$ flow problem and the minimum $s$-$t$ cut problem in directed graphs with $m$ arcs and largest integer capacity $U$. This matches the running time of the $\\tilde{O}\\left((mU)^{\\frac{10}{7}}\\right)$-time algorithm of M\\k{a}dry (FOCS 2013) in the unit-capacity case, and improves over it, as well as over the $\\tilde{O}\\left(m \\sqrt{n} \\log U\\right)$-time algorithm of Lee and Sidford (FOCS 2014), whenever $U$ is moderately large and the graph is sufficiently sparse. By well-known reductions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06016","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":"1608.06016","created_at":"2026-05-18T01:08:22.540831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06016v1","created_at":"2026-05-18T01:08:22.540831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06016","created_at":"2026-05-18T01:08:22.540831+00:00"},{"alias_kind":"pith_short_12","alias_value":"F22CUKRJSP2S","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F22CUKRJSP2SPYVF","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F22CUKRJ","created_at":"2026-05-18T12:30:15.759754+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":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI","json":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI.json","graph_json":"https://pith.science/api/pith-number/F22CUKRJSP2SPYVF755L5MIUWI/graph.json","events_json":"https://pith.science/api/pith-number/F22CUKRJSP2SPYVF755L5MIUWI/events.json","paper":"https://pith.science/paper/F22CUKRJ"},"agent_actions":{"view_html":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI","download_json":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI.json","view_paper":"https://pith.science/paper/F22CUKRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06016&json=true","fetch_graph":"https://pith.science/api/pith-number/F22CUKRJSP2SPYVF755L5MIUWI/graph.json","fetch_events":"https://pith.science/api/pith-number/F22CUKRJSP2SPYVF755L5MIUWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI/action/storage_attestation","attest_author":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI/action/author_attestation","sign_citation":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI/action/citation_signature","submit_replication":"https://pith.science/pith/F22CUKRJSP2SPYVF755L5MIUWI/action/replication_record"}},"created_at":"2026-05-18T01:08:22.540831+00:00","updated_at":"2026-05-18T01:08:22.540831+00:00"}