{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:QC7VKNGW4WF5HHVIXFJQRZ5TPT","short_pith_number":"pith:QC7VKNGW","canonical_record":{"source":{"id":"2101.07233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-18T18:38:34Z","cross_cats_sorted":[],"title_canon_sha256":"5d88ea8c204fb18290a59466e813bc78b423269b94f36e2ced71995d6446149e","abstract_canon_sha256":"ce0e5155877d54433a4bf6ada0380f27ed1f4c0266e37dc04a3e9abbd22c9e6b"},"schema_version":"1.0"},"canonical_sha256":"80bf5534d6e58bd39ea8b95308e7b37ccd36b4a67f180aa6af4b78d221def3fe","source":{"kind":"arxiv","id":"2101.07233","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.07233","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"arxiv_version","alias_value":"2101.07233v2","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07233","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"pith_short_12","alias_value":"QC7VKNGW4WF5","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"pith_short_16","alias_value":"QC7VKNGW4WF5HHVI","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"pith_short_8","alias_value":"QC7VKNGW","created_at":"2026-07-05T02:47:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:QC7VKNGW4WF5HHVIXFJQRZ5TPT","target":"record","payload":{"canonical_record":{"source":{"id":"2101.07233","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-18T18:38:34Z","cross_cats_sorted":[],"title_canon_sha256":"5d88ea8c204fb18290a59466e813bc78b423269b94f36e2ced71995d6446149e","abstract_canon_sha256":"ce0e5155877d54433a4bf6ada0380f27ed1f4c0266e37dc04a3e9abbd22c9e6b"},"schema_version":"1.0"},"canonical_sha256":"80bf5534d6e58bd39ea8b95308e7b37ccd36b4a67f180aa6af4b78d221def3fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:58.687445Z","signature_b64":"JkKqqJZpOv+WPvfWiVLWqYWwhpYbhFURSqeVUO9LSyfarbsfZdj+g/kh825LtBJjrM/xJ+QjJRfGEHMNcz+jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80bf5534d6e58bd39ea8b95308e7b37ccd36b4a67f180aa6af4b78d221def3fe","last_reissued_at":"2026-07-05T02:47:58.686968Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:58.686968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.07233","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-07-05T02:47:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOVjl+yiDXEO/sifmYySbdG9z+EKt1M8+eD4d7ORyvOdhVtDR/Zf/+FI9Z05U/KLqDCZ8XscoratNtgGyXGlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T11:56:36.344350Z"},"content_sha256":"90768763a92b5a34ef183a1980ad3a5bb4eacf0863274fb1157efdf669199296","schema_version":"1.0","event_id":"sha256:90768763a92b5a34ef183a1980ad3a5bb4eacf0863274fb1157efdf669199296"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:QC7VKNGW4WF5HHVIXFJQRZ5TPT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Richard Peng, Yang P. Liu, Yu Gao","submitted_at":"2021-01-18T18:38:34Z","abstract_excerpt":"We give an algorithm for computing exact maximum flows on graphs with $m$ edges and integer capacities in the range $[1, U]$ in $\\widetilde{O}(m^{\\frac{3}{2} - \\frac{1}{328}} \\log U)$ time. For sparse graphs with polynomially bounded integer capacities, this is the first improvement over the $\\widetilde{O}(m^{1.5} \\log U)$ time bound from [Goldberg-Rao JACM `98].\n  Our algorithm revolves around dynamically maintaining the augmenting electrical flows at the core of the interior point method based algorithm from [M\\k{a}dry JACM `16]. This entails designing data structures that, in limited settin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07233","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/2101.07233/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-07-05T02:47:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YntB3LeAPl6sYvzgPTlp17hjk0GN0ZAjEK3seB4AnVvdrTqR2mZNJ1Y/SXgUcyKrPnAMxiqE+ovrVIPuwm+/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T11:56:36.344852Z"},"content_sha256":"044b092714269c24255c5e9d503217ec870ac6d70ed0007d4fabf499a484a772","schema_version":"1.0","event_id":"sha256:044b092714269c24255c5e9d503217ec870ac6d70ed0007d4fabf499a484a772"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/bundle.json","state_url":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/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-08-18T11:56:36Z","links":{"resolver":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT","bundle":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/bundle.json","state":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:QC7VKNGW4WF5HHVIXFJQRZ5TPT","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":"ce0e5155877d54433a4bf6ada0380f27ed1f4c0266e37dc04a3e9abbd22c9e6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-18T18:38:34Z","title_canon_sha256":"5d88ea8c204fb18290a59466e813bc78b423269b94f36e2ced71995d6446149e"},"schema_version":"1.0","source":{"id":"2101.07233","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.07233","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"arxiv_version","alias_value":"2101.07233v2","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07233","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"pith_short_12","alias_value":"QC7VKNGW4WF5","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"pith_short_16","alias_value":"QC7VKNGW4WF5HHVI","created_at":"2026-07-05T02:47:58Z"},{"alias_kind":"pith_short_8","alias_value":"QC7VKNGW","created_at":"2026-07-05T02:47:58Z"}],"graph_snapshots":[{"event_id":"sha256:044b092714269c24255c5e9d503217ec870ac6d70ed0007d4fabf499a484a772","target":"graph","created_at":"2026-07-05T02:47:58Z","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/2101.07233/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give an algorithm for computing exact maximum flows on graphs with $m$ edges and integer capacities in the range $[1, U]$ in $\\widetilde{O}(m^{\\frac{3}{2} - \\frac{1}{328}} \\log U)$ time. For sparse graphs with polynomially bounded integer capacities, this is the first improvement over the $\\widetilde{O}(m^{1.5} \\log U)$ time bound from [Goldberg-Rao JACM `98].\n  Our algorithm revolves around dynamically maintaining the augmenting electrical flows at the core of the interior point method based algorithm from [M\\k{a}dry JACM `16]. This entails designing data structures that, in limited settin","authors_text":"Richard Peng, Yang P. Liu, Yu Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-18T18:38:34Z","title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07233","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:90768763a92b5a34ef183a1980ad3a5bb4eacf0863274fb1157efdf669199296","target":"record","created_at":"2026-07-05T02:47:58Z","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":"ce0e5155877d54433a4bf6ada0380f27ed1f4c0266e37dc04a3e9abbd22c9e6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-18T18:38:34Z","title_canon_sha256":"5d88ea8c204fb18290a59466e813bc78b423269b94f36e2ced71995d6446149e"},"schema_version":"1.0","source":{"id":"2101.07233","kind":"arxiv","version":2}},"canonical_sha256":"80bf5534d6e58bd39ea8b95308e7b37ccd36b4a67f180aa6af4b78d221def3fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80bf5534d6e58bd39ea8b95308e7b37ccd36b4a67f180aa6af4b78d221def3fe","first_computed_at":"2026-07-05T02:47:58.686968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:47:58.686968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JkKqqJZpOv+WPvfWiVLWqYWwhpYbhFURSqeVUO9LSyfarbsfZdj+g/kh825LtBJjrM/xJ+QjJRfGEHMNcz+jBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:47:58.687445Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.07233","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90768763a92b5a34ef183a1980ad3a5bb4eacf0863274fb1157efdf669199296","sha256:044b092714269c24255c5e9d503217ec870ac6d70ed0007d4fabf499a484a772"],"state_sha256":"855f76b2cb9830820bde2558774ce6516d766504e0a8e544709a54a1e3721608"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYyyYMXVlXcl+3Je2FS76Y0oYyjqTOYZeRavDyCTcV6sB8nvcO9BoIkDlcF6Kj6bBaZmy/5iuvqECGGYYHzQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T11:56:36.350767Z","bundle_sha256":"eba74fe42bcf5ef105f4bfc846e361c8e131c15e723d7ab3c89fd31935e5af16"}}