{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EVIH2UI2ESKS4BKG3DWRO6UVA3","short_pith_number":"pith:EVIH2UI2","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"},"canonical_sha256":"25507d511a24952e0546d8ed177a9506dacffcdab26be07e66d177384a88e15d","source":{"kind":"arxiv","id":"2502.09105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09105","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09105v2","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09105","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"EVIH2UI2ESKS","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"pith_short_16","alias_value":"EVIH2UI2ESKS4BKG","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"pith_short_8","alias_value":"EVIH2UI2","created_at":"2026-05-22T01:03:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EVIH2UI2ESKS4BKG3DWRO6UVA3","target":"record","payload":{"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"},"canonical_sha256":"25507d511a24952e0546d8ed177a9506dacffcdab26be07e66d177384a88e15d","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"},"source_kind":"arxiv","source_id":"2502.09105","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhpgUY6z4nYjtyYEPOuDxlicUKpouLcwzTKs+s7uuEaO3Kkk+Av6hDxFp+1/JmndW4mTz6shgfNKIQjLpY9XDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:43:40.271631Z"},"content_sha256":"ec7192b5cb2c3ca16d2e5fcb5818a23f653461b37737a08ed88c09d242b8357a","schema_version":"1.0","event_id":"sha256:ec7192b5cb2c3ca16d2e5fcb5818a23f653461b37737a08ed88c09d242b8357a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EVIH2UI2ESKS4BKG3DWRO6UVA3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-22T01:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeyEsrpm5jXUUBUdebgcq1AgJ4d9qd8JIbap4YVzp9GadH+/Khxlk7i3c3cZA/VOQQCXdzN/DQUBI7xyDtg0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:43:40.272382Z"},"content_sha256":"633eca4347624bccb04b70d44e4053e64b37f6ad491c1b8c7a4d1efa3072cd34","schema_version":"1.0","event_id":"sha256:633eca4347624bccb04b70d44e4053e64b37f6ad491c1b8c7a4d1efa3072cd34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/bundle.json","state_url":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T08:43:40Z","links":{"resolver":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3","bundle":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/bundle.json","state":"https://pith.science/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVIH2UI2ESKS4BKG3DWRO6UVA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EVIH2UI2ESKS4BKG3DWRO6UVA3","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":"a2ede37d4f64fb47a6da95bf5b8a25e82d9a34e85c95b5a3250fe44c1272ee58","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-13T09:27:10Z","title_canon_sha256":"07b604ad2d91fbf7f4605d44e133fd30b7ce8f3b21fb8053ca10ff499ad3c37a"},"schema_version":"1.0","source":{"id":"2502.09105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09105","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09105v2","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09105","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"EVIH2UI2ESKS","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"pith_short_16","alias_value":"EVIH2UI2ESKS4BKG","created_at":"2026-05-22T01:03:41Z"},{"alias_kind":"pith_short_8","alias_value":"EVIH2UI2","created_at":"2026-05-22T01:03:41Z"}],"graph_snapshots":[{"event_id":"sha256:633eca4347624bccb04b70d44e4053e64b37f6ad491c1b8c7a4d1efa3072cd34","target":"graph","created_at":"2026-05-22T01:03:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.09105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"A. R. Sricharan, Gramoz Goranci, Harald R\\\"acke, Monika Henzinger","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-13T09:27:10Z","title":"Incremental Approximate Maximum Flow via Residual Graph Sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09105","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:ec7192b5cb2c3ca16d2e5fcb5818a23f653461b37737a08ed88c09d242b8357a","target":"record","created_at":"2026-05-22T01:03:41Z","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":"a2ede37d4f64fb47a6da95bf5b8a25e82d9a34e85c95b5a3250fe44c1272ee58","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-02-13T09:27:10Z","title_canon_sha256":"07b604ad2d91fbf7f4605d44e133fd30b7ce8f3b21fb8053ca10ff499ad3c37a"},"schema_version":"1.0","source":{"id":"2502.09105","kind":"arxiv","version":2}},"canonical_sha256":"25507d511a24952e0546d8ed177a9506dacffcdab26be07e66d177384a88e15d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25507d511a24952e0546d8ed177a9506dacffcdab26be07e66d177384a88e15d","first_computed_at":"2026-05-22T01:03:41.374685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:41.374685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0+nNpjS4iDuoLQ4M3jTPiCqhp5KtIYLoyFaAcCwUXmP6kfXUsCtZu1XsWMMKkOE1BsXbFz1Z4KOXpc9qKg7+DA==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:41.375619Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.09105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec7192b5cb2c3ca16d2e5fcb5818a23f653461b37737a08ed88c09d242b8357a","sha256:633eca4347624bccb04b70d44e4053e64b37f6ad491c1b8c7a4d1efa3072cd34"],"state_sha256":"5ac71eb426599c6d8fafa3bfb1c930aabb9082dc212e1f3cf26ce43d6c7e2b25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRa87tsqrJZ5kQQ6nv8NND1Pg8UiSwQxrrLL3dGwIGef9wgvBlYrVtTjyYgiKLAhqMw1vWIiqZlKAc1bR3pdBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:43:40.276418Z","bundle_sha256":"ff96d6a4d7fce0039e1b268b0f9757141fba031668598209213396b38b4dae35"}}