{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YONAKNHMEEHICC5C2S5MOIP2AT","short_pith_number":"pith:YONAKNHM","schema_version":"1.0","canonical_sha256":"c39a0534ec210e810ba2d4bac721fa04d192636a3f644ea4ff662a08245fcaa9","source":{"kind":"arxiv","id":"1304.2338","version":2},"attestation_state":"computed","paper":{"title":"An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Jonathan A. Kelner, Lorenzo Orecchia, Yin Tat Lee","submitted_at":"2013-04-08T20:06:45Z","abstract_excerpt":"In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum $s$-$t$ flow and maximum concurrent multicommodity flow problems. For graphs with $n$ vertices and $m$ edges, it allows us to find an $\\epsilon$-approximate maximum $s$-$t$ flow in time $O(m^{1+o(1)}\\epsilon^{-2})$, improving on the previous best bound of $\\tilde{O}(mn^{1/3} poly(1/\\epsilon))$. Applying the same framework in the multicommodity setting solves a maximum concurrent multicommodity flow problem"},"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.2338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T20:06:45Z","cross_cats_sorted":[],"title_canon_sha256":"236f85a1c7df700ad9094439f0255451cfafc65aef982431116b48c0faf16413","abstract_canon_sha256":"be6c1e887f93afefcabe53b2d375a74dd87f28ea5ad0b00d284a6e5bd25e4687"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:34.922771Z","signature_b64":"VkxLJ9ziyjIMpgYynofmXasSN2JGcxpFkECUVKgdmwz69hZG9cHE/5EDIC24/RKbg3y7HlPFs0eiotffJF8FCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c39a0534ec210e810ba2d4bac721fa04d192636a3f644ea4ff662a08245fcaa9","last_reissued_at":"2026-05-18T03:12:34.921859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:34.921859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Jonathan A. Kelner, Lorenzo Orecchia, Yin Tat Lee","submitted_at":"2013-04-08T20:06:45Z","abstract_excerpt":"In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum $s$-$t$ flow and maximum concurrent multicommodity flow problems. For graphs with $n$ vertices and $m$ edges, it allows us to find an $\\epsilon$-approximate maximum $s$-$t$ flow in time $O(m^{1+o(1)}\\epsilon^{-2})$, improving on the previous best bound of $\\tilde{O}(mn^{1/3} poly(1/\\epsilon))$. Applying the same framework in the multicommodity setting solves a maximum concurrent multicommodity flow problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2338","kind":"arxiv","version":2},"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.2338","created_at":"2026-05-18T03:12:34.922019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2338v2","created_at":"2026-05-18T03:12:34.922019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2338","created_at":"2026-05-18T03:12:34.922019+00:00"},{"alias_kind":"pith_short_12","alias_value":"YONAKNHMEEHI","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YONAKNHMEEHICC5C","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YONAKNHM","created_at":"2026-05-18T12:28:06.772260+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":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT","json":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT.json","graph_json":"https://pith.science/api/pith-number/YONAKNHMEEHICC5C2S5MOIP2AT/graph.json","events_json":"https://pith.science/api/pith-number/YONAKNHMEEHICC5C2S5MOIP2AT/events.json","paper":"https://pith.science/paper/YONAKNHM"},"agent_actions":{"view_html":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT","download_json":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT.json","view_paper":"https://pith.science/paper/YONAKNHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2338&json=true","fetch_graph":"https://pith.science/api/pith-number/YONAKNHMEEHICC5C2S5MOIP2AT/graph.json","fetch_events":"https://pith.science/api/pith-number/YONAKNHMEEHICC5C2S5MOIP2AT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT/action/storage_attestation","attest_author":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT/action/author_attestation","sign_citation":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT/action/citation_signature","submit_replication":"https://pith.science/pith/YONAKNHMEEHICC5C2S5MOIP2AT/action/replication_record"}},"created_at":"2026-05-18T03:12:34.922019+00:00","updated_at":"2026-05-18T03:12:34.922019+00:00"}