{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YONAKNHMEEHICC5C2S5MOIP2AT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be6c1e887f93afefcabe53b2d375a74dd87f28ea5ad0b00d284a6e5bd25e4687","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T20:06:45Z","title_canon_sha256":"236f85a1c7df700ad9094439f0255451cfafc65aef982431116b48c0faf16413"},"schema_version":"1.0","source":{"id":"1304.2338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2338","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2338v2","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2338","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"YONAKNHMEEHI","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YONAKNHMEEHICC5C","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YONAKNHM","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:cfcb486adbfc525696d4790f615e3a2a30520eddc737e87bdf7cd23f24d22149","target":"graph","created_at":"2026-05-18T03:12:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aaron Sidford, Jonathan A. Kelner, Lorenzo Orecchia, Yin Tat Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T20:06:45Z","title":"An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2338","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:289fead4e4c772532baf20b87fb0dfa6503e48b4455687ab3b48533345418538","target":"record","created_at":"2026-05-18T03:12:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be6c1e887f93afefcabe53b2d375a74dd87f28ea5ad0b00d284a6e5bd25e4687","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T20:06:45Z","title_canon_sha256":"236f85a1c7df700ad9094439f0255451cfafc65aef982431116b48c0faf16413"},"schema_version":"1.0","source":{"id":"1304.2338","kind":"arxiv","version":2}},"canonical_sha256":"c39a0534ec210e810ba2d4bac721fa04d192636a3f644ea4ff662a08245fcaa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c39a0534ec210e810ba2d4bac721fa04d192636a3f644ea4ff662a08245fcaa9","first_computed_at":"2026-05-18T03:12:34.921859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:34.921859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VkxLJ9ziyjIMpgYynofmXasSN2JGcxpFkECUVKgdmwz69hZG9cHE/5EDIC24/RKbg3y7HlPFs0eiotffJF8FCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:34.922771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:289fead4e4c772532baf20b87fb0dfa6503e48b4455687ab3b48533345418538","sha256:cfcb486adbfc525696d4790f615e3a2a30520eddc737e87bdf7cd23f24d22149"],"state_sha256":"3fa794ed9894a8b2b6b41df9924bedd09b47b392a78eb6ea9ce8d56d1724dbe7"}