{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EVIH2UI2ESKS4BKG3DWRO6UVA3","short_pith_number":"pith:EVIH2UI2","schema_version":"1.0","canonical_sha256":"25507d511a24952e0546d8ed177a9506dacffcdab26be07e66d177384a88e15d","source":{"kind":"arxiv","id":"2502.09105","version":2},"attestation_state":"computed","paper":{"title":"Incremental Approximate Maximum Flow via Residual Graph Sparsification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A. R. Sricharan, Gramoz Goranci, Harald R\\\"acke, Monika Henzinger","submitted_at":"2025-02-13T09:27:10Z","abstract_excerpt":"We give an algorithm that, with high probability, maintains a $(1-\\epsilon)$-approximate $s$-$t$ maximum flow in undirected, uncapacitated $n$-vertex graphs undergoing $m$ edge insertions in $\\tilde{O}(m+ n F^*/\\epsilon)$ total update time, where $F^{*}$ is the maximum flow on the final graph. This is the first algorithm to achieve polylogarithmic amortized update time for dense graphs ($m = \\Omega(n^2)$), and more generally, for graphs where $F^*= \\tilde{O}(m/n)$.\n  At the heart of our incremental algorithm is the residual graph sparsification technique of Karger and Levine [STOC '02, SICOMP "},"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":"2502.09105","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-13T09:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"07b604ad2d91fbf7f4605d44e133fd30b7ce8f3b21fb8053ca10ff499ad3c37a","abstract_canon_sha256":"a2ede37d4f64fb47a6da95bf5b8a25e82d9a34e85c95b5a3250fe44c1272ee58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:41.375619Z","signature_b64":"0+nNpjS4iDuoLQ4M3jTPiCqhp5KtIYLoyFaAcCwUXmP6kfXUsCtZu1XsWMMKkOE1BsXbFz1Z4KOXpc9qKg7+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25507d511a24952e0546d8ed177a9506dacffcdab26be07e66d177384a88e15d","last_reissued_at":"2026-05-22T01:03:41.374685Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:41.374685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Approximate Maximum Flow via Residual Graph Sparsification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"A. R. Sricharan, Gramoz Goranci, Harald R\\\"acke, Monika Henzinger","submitted_at":"2025-02-13T09:27:10Z","abstract_excerpt":"We give an algorithm that, with high probability, maintains a $(1-\\epsilon)$-approximate $s$-$t$ maximum flow in undirected, uncapacitated $n$-vertex graphs undergoing $m$ edge insertions in $\\tilde{O}(m+ n F^*/\\epsilon)$ total update time, where $F^{*}$ is the maximum flow on the final graph. This is the first algorithm to achieve polylogarithmic amortized update time for dense graphs ($m = \\Omega(n^2)$), and more generally, for graphs where $F^*= \\tilde{O}(m/n)$.\n  At the heart of our incremental algorithm is the residual graph sparsification technique of Karger and Levine [STOC '02, SICOMP "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09105","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.09105/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.09105","created_at":"2026-05-22T01:03:41.374841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09105v2","created_at":"2026-05-22T01:03:41.374841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09105","created_at":"2026-05-22T01:03:41.374841+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVIH2UI2ESKS","created_at":"2026-05-22T01:03:41.374841+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVIH2UI2ESKS4BKG","created_at":"2026-05-22T01:03:41.374841+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVIH2UI2","created_at":"2026-05-22T01:03:41.374841+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/EVIH2UI2ESKS4BKG3DWRO6UVA3","json":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3.json","graph_json":"https://pith.science/api/pith-number/EVIH2UI2ESKS4BKG3DWRO6UVA3/graph.json","events_json":"https://pith.science/api/pith-number/EVIH2UI2ESKS4BKG3DWRO6UVA3/events.json","paper":"https://pith.science/paper/EVIH2UI2"},"agent_actions":{"view_html":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3","download_json":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3.json","view_paper":"https://pith.science/paper/EVIH2UI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09105&json=true","fetch_graph":"https://pith.science/api/pith-number/EVIH2UI2ESKS4BKG3DWRO6UVA3/graph.json","fetch_events":"https://pith.science/api/pith-number/EVIH2UI2ESKS4BKG3DWRO6UVA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/action/storage_attestation","attest_author":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/action/author_attestation","sign_citation":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/action/citation_signature","submit_replication":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/action/replication_record"}},"created_at":"2026-05-22T01:03:41.374841+00:00","updated_at":"2026-05-22T01:03:41.374841+00:00"}