{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M2ZYUWQUSTLHR64Q7Y4WHWOX4R","short_pith_number":"pith:M2ZYUWQU","schema_version":"1.0","canonical_sha256":"66b38a5a1494d678fb90fe3963d9d7e47fe15f19a5fa4751893b89c1972f1be3","source":{"kind":"arxiv","id":"1411.7631","version":2},"attestation_state":"computed","paper":{"title":"Approximate Undirected Maximum Flows in O(m polylog(n)) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Richard Peng","submitted_at":"2014-11-27T15:48:55Z","abstract_excerpt":"We give the first O(m polylog(n)) time algorithms for approximating maximum flows in undirected graphs and constructing polylog(n) -quality cut-approximating hierarchical tree decompositions. Our algorithm invokes existing algorithms for these two problems recursively while gradually incorporating size reductions. These size reductions are in turn obtained via ultra-sparsifiers, which are key tools in solvers for symmetric diagonally dominant (SDD) linear systems."},"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":"1411.7631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-27T15:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"3154b0bcd35dcd56625fa90839c0d6570428917f25ed4a4df2f861aea08dceb8","abstract_canon_sha256":"c847bfde1f22f7a50a086a299a7a6df040d19cfe415720febc74e97bea3ef8c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:50.441813Z","signature_b64":"5Atp6WWINidiBDibGzSU9jHqOK+hNNGLDYMOs7cHR9ir483hOd9WQD+MaCZDbRUeL1c8vp+mD2ekIlJjGWDSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66b38a5a1494d678fb90fe3963d9d7e47fe15f19a5fa4751893b89c1972f1be3","last_reissued_at":"2026-05-18T01:26:50.441162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:50.441162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Undirected Maximum Flows in O(m polylog(n)) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Richard Peng","submitted_at":"2014-11-27T15:48:55Z","abstract_excerpt":"We give the first O(m polylog(n)) time algorithms for approximating maximum flows in undirected graphs and constructing polylog(n) -quality cut-approximating hierarchical tree decompositions. Our algorithm invokes existing algorithms for these two problems recursively while gradually incorporating size reductions. These size reductions are in turn obtained via ultra-sparsifiers, which are key tools in solvers for symmetric diagonally dominant (SDD) linear systems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7631","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":""},"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":"1411.7631","created_at":"2026-05-18T01:26:50.441245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7631v2","created_at":"2026-05-18T01:26:50.441245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7631","created_at":"2026-05-18T01:26:50.441245+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2ZYUWQUSTLH","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2ZYUWQUSTLHR64Q","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2ZYUWQU","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10340","citing_title":"Flows in Almost Linear Time via Adaptive Preconditioning","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R","json":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R.json","graph_json":"https://pith.science/api/pith-number/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/graph.json","events_json":"https://pith.science/api/pith-number/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/events.json","paper":"https://pith.science/paper/M2ZYUWQU"},"agent_actions":{"view_html":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R","download_json":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R.json","view_paper":"https://pith.science/paper/M2ZYUWQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7631&json=true","fetch_graph":"https://pith.science/api/pith-number/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/graph.json","fetch_events":"https://pith.science/api/pith-number/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/action/storage_attestation","attest_author":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/action/author_attestation","sign_citation":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/action/citation_signature","submit_replication":"https://pith.science/pith/M2ZYUWQUSTLHR64Q7Y4WHWOX4R/action/replication_record"}},"created_at":"2026-05-18T01:26:50.441245+00:00","updated_at":"2026-05-18T01:26:50.441245+00:00"}