{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BMWJ776MYEJBP2P4MRIDCURCJ5","short_pith_number":"pith:BMWJ776M","canonical_record":{"source":{"id":"1304.2077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-07T23:42:35Z","cross_cats_sorted":[],"title_canon_sha256":"b568687ba80ca029bea5f17bcce1edc851fddfd01f155d34c028135e834d7325","abstract_canon_sha256":"9ed3325b31112c7998e127a8be7317269386429dce0b7e5c02da40a4268589a9"},"schema_version":"1.0"},"canonical_sha256":"0b2c9fffccc11217e9fc64503152224f677a9b0cb073e0151720ba2bf51d213c","source":{"kind":"arxiv","id":"1304.2077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2077","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2077v1","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2077","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"BMWJ776MYEJB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BMWJ776MYEJBP2P4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BMWJ776M","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BMWJ776MYEJBP2P4MRIDCURCJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-07T23:42:35Z","cross_cats_sorted":[],"title_canon_sha256":"b568687ba80ca029bea5f17bcce1edc851fddfd01f155d34c028135e834d7325","abstract_canon_sha256":"9ed3325b31112c7998e127a8be7317269386429dce0b7e5c02da40a4268589a9"},"schema_version":"1.0"},"canonical_sha256":"0b2c9fffccc11217e9fc64503152224f677a9b0cb073e0151720ba2bf51d213c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:44.115965Z","signature_b64":"AiSo926UF6PgjtTPMituVvLOS9PfMx/zGraKf9zga+u3q3piVWq72sJwVJA7KIInXqAd/XOV7JivBOAh80kpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b2c9fffccc11217e9fc64503152224f677a9b0cb073e0151720ba2bf51d213c","last_reissued_at":"2026-05-18T03:28:44.115076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:44.115076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2077","source_version":1,"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-18T03:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5/dnI2XtgWmOhtL8S3cki39xD/FpHGSeccUqlo4THK+AIPQReZCptiI2hUlnUO+mos3xVFzJ3ZDg4vL0Hv4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:47:37.308343Z"},"content_sha256":"09d6e1a8bd0e829fee30375807b3663bcb4e8b98ab8e778650ef7c46533ae1ee","schema_version":"1.0","event_id":"sha256:09d6e1a8bd0e829fee30375807b3663bcb4e8b98ab8e778650ef7c46533ae1ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BMWJ776MYEJBP2P4MRIDCURCJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Maximum Flows in Nearly Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jonah Sherman","submitted_at":"2013-04-07T23:42:35Z","abstract_excerpt":"We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using $\\alpha$-\\emph{congestion-approximators}: easy-to-compute functions that approximate the congestion required to route single-commodity demands in a graph to within a factor of $\\alpha$. Our algorithm maintains an arbitrary flow that may have some residual excess and deficits, while taking steps to minimize a potential function measuring the congestion of the current flow plus an over-estimate of the congestion required to route the residual demand. Since the residual term over-estimates, the descent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2077","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"},"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-18T03:28:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtGQuY1V/zqvhhO48Pn7s/Ck3LPIbobVz2soR1m+NJlQy4O67koGLwgyx/YbChsr9ZbEWO3N05GpUYkGIPv5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:47:37.309047Z"},"content_sha256":"51d622af6fb6cd917e1b1e0f367ced755282034e43dbbaa21c7fe3ff7f052d73","schema_version":"1.0","event_id":"sha256:51d622af6fb6cd917e1b1e0f367ced755282034e43dbbaa21c7fe3ff7f052d73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/bundle.json","state_url":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/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-26T23:47:37Z","links":{"resolver":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5","bundle":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/bundle.json","state":"https://pith.science/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMWJ776MYEJBP2P4MRIDCURCJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BMWJ776MYEJBP2P4MRIDCURCJ5","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":"9ed3325b31112c7998e127a8be7317269386429dce0b7e5c02da40a4268589a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-07T23:42:35Z","title_canon_sha256":"b568687ba80ca029bea5f17bcce1edc851fddfd01f155d34c028135e834d7325"},"schema_version":"1.0","source":{"id":"1304.2077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2077","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2077v1","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2077","created_at":"2026-05-18T03:28:44Z"},{"alias_kind":"pith_short_12","alias_value":"BMWJ776MYEJB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BMWJ776MYEJBP2P4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BMWJ776M","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:51d622af6fb6cd917e1b1e0f367ced755282034e43dbbaa21c7fe3ff7f052d73","target":"graph","created_at":"2026-05-18T03:28:44Z","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":"We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using $\\alpha$-\\emph{congestion-approximators}: easy-to-compute functions that approximate the congestion required to route single-commodity demands in a graph to within a factor of $\\alpha$. Our algorithm maintains an arbitrary flow that may have some residual excess and deficits, while taking steps to minimize a potential function measuring the congestion of the current flow plus an over-estimate of the congestion required to route the residual demand. Since the residual term over-estimates, the descent","authors_text":"Jonah Sherman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-07T23:42:35Z","title":"Nearly Maximum Flows in Nearly Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2077","kind":"arxiv","version":1},"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:09d6e1a8bd0e829fee30375807b3663bcb4e8b98ab8e778650ef7c46533ae1ee","target":"record","created_at":"2026-05-18T03:28:44Z","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":"9ed3325b31112c7998e127a8be7317269386429dce0b7e5c02da40a4268589a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-07T23:42:35Z","title_canon_sha256":"b568687ba80ca029bea5f17bcce1edc851fddfd01f155d34c028135e834d7325"},"schema_version":"1.0","source":{"id":"1304.2077","kind":"arxiv","version":1}},"canonical_sha256":"0b2c9fffccc11217e9fc64503152224f677a9b0cb073e0151720ba2bf51d213c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b2c9fffccc11217e9fc64503152224f677a9b0cb073e0151720ba2bf51d213c","first_computed_at":"2026-05-18T03:28:44.115076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:44.115076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AiSo926UF6PgjtTPMituVvLOS9PfMx/zGraKf9zga+u3q3piVWq72sJwVJA7KIInXqAd/XOV7JivBOAh80kpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:44.115965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09d6e1a8bd0e829fee30375807b3663bcb4e8b98ab8e778650ef7c46533ae1ee","sha256:51d622af6fb6cd917e1b1e0f367ced755282034e43dbbaa21c7fe3ff7f052d73"],"state_sha256":"6a7f3fef41efd3b246adf72ea4bf7a07abfc8fc820ea6a0dd32c719bd147d5c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Kfjr13H1tM4eIEtE4QiFa13BW7VpAujCcEqJKmxa1eotWuSeculsdmLP+cN+jX2+8lsDAeU3tANuOQrrCY0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:47:37.312572Z","bundle_sha256":"6bd715a9871fb44bbb563e6bf0a4e3ab4527ee41bab81bf119ebb56dc6179185"}}