{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QC7VKNGW4WF5HHVIXFJQRZ5TPT","short_pith_number":"pith:QC7VKNGW","schema_version":"1.0","canonical_sha256":"80bf5534d6e58bd39ea8b95308e7b37ccd36b4a67f180aa6af4b78d221def3fe","source":{"kind":"arxiv","id":"2101.07233","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2101.07233","created_at":"2026-07-05T02:47:58.687020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.07233v2","created_at":"2026-07-05T02:47:58.687020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07233","created_at":"2026-07-05T02:47:58.687020+00:00"},{"alias_kind":"pith_short_12","alias_value":"QC7VKNGW4WF5","created_at":"2026-07-05T02:47:58.687020+00:00"},{"alias_kind":"pith_short_16","alias_value":"QC7VKNGW4WF5HHVI","created_at":"2026-07-05T02:47:58.687020+00:00"},{"alias_kind":"pith_short_8","alias_value":"QC7VKNGW","created_at":"2026-07-05T02:47:58.687020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14666","citing_title":"Approximate Spanning Tree Counting from Uncorrelated Edge Sets","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT","json":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT.json","graph_json":"https://pith.science/api/pith-number/QC7VKNGW4WF5HHVIXFJQRZ5TPT/graph.json","events_json":"https://pith.science/api/pith-number/QC7VKNGW4WF5HHVIXFJQRZ5TPT/events.json","paper":"https://pith.science/paper/QC7VKNGW"},"agent_actions":{"view_html":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT","download_json":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT.json","view_paper":"https://pith.science/paper/QC7VKNGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.07233&json=true","fetch_graph":"https://pith.science/api/pith-number/QC7VKNGW4WF5HHVIXFJQRZ5TPT/graph.json","fetch_events":"https://pith.science/api/pith-number/QC7VKNGW4WF5HHVIXFJQRZ5TPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/action/storage_attestation","attest_author":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/action/author_attestation","sign_citation":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/action/citation_signature","submit_replication":"https://pith.science/pith/QC7VKNGW4WF5HHVIXFJQRZ5TPT/action/replication_record"}},"created_at":"2026-07-05T02:47:58.687020+00:00","updated_at":"2026-07-05T02:47:58.687020+00:00"}