{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BDKYK6XSD77TCOF6KFIMYQ5FBU","short_pith_number":"pith:BDKYK6XS","schema_version":"1.0","canonical_sha256":"08d5857af21fff3138be5150cc43a50d299d8d155e2c46d60b13ea6c117fa442","source":{"kind":"arxiv","id":"1906.10340","version":1},"attestation_state":"computed","paper":{"title":"Flows in Almost Linear Time via Adaptive Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Di Wang, Rasmus Kyng, Richard Peng, Sushant Sachdeva","submitted_at":"2019-06-25T06:34:40Z","abstract_excerpt":"We present algorithms for solving a large class of flow and regression problems on unit weighted graphs to $(1 + 1 / poly(n))$ accuracy in almost-linear time. These problems include $\\ell_p$-norm minimizing flow for $p$ large ($p \\in [\\omega(1), o(\\log^{2/3} n) ]$), and their duals, $\\ell_p$-norm semi-supervised learning for $p$ close to $1$.\n  As $p$ tends to infinity, $\\ell_p$-norm flow and its dual tend to max-flow and min-cut respectively. Using this connection and our algorithms, we give an alternate approach for approximating undirected max-flow, and the first almost-linear time approxim"},"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":"1906.10340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-25T06:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"8fea5cf126be0b042b8a3c7969a77cdbdb6d636d55a19e63a14fc6bdb538bbbd","abstract_canon_sha256":"b819d4380c925f9e711cda7762e2af4443f6169f5567677b6daaa8c73d7dc252"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:31.557491Z","signature_b64":"qB5cJP12nsUhuPCOQabz7a+K9lnu6ARqQQRNOYXB805R8k7sHvm16ZP4VsZ/6oTe6XtpHQgbb/j07/+Vv8hZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08d5857af21fff3138be5150cc43a50d299d8d155e2c46d60b13ea6c117fa442","last_reissued_at":"2026-05-17T23:42:31.556863Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:31.556863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flows in Almost Linear Time via Adaptive Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Di Wang, Rasmus Kyng, Richard Peng, Sushant Sachdeva","submitted_at":"2019-06-25T06:34:40Z","abstract_excerpt":"We present algorithms for solving a large class of flow and regression problems on unit weighted graphs to $(1 + 1 / poly(n))$ accuracy in almost-linear time. These problems include $\\ell_p$-norm minimizing flow for $p$ large ($p \\in [\\omega(1), o(\\log^{2/3} n) ]$), and their duals, $\\ell_p$-norm semi-supervised learning for $p$ close to $1$.\n  As $p$ tends to infinity, $\\ell_p$-norm flow and its dual tend to max-flow and min-cut respectively. Using this connection and our algorithms, we give an alternate approach for approximating undirected max-flow, and the first almost-linear time approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10340","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.10340","created_at":"2026-05-17T23:42:31.556954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10340v1","created_at":"2026-05-17T23:42:31.556954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10340","created_at":"2026-05-17T23:42:31.556954+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDKYK6XSD77T","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDKYK6XSD77TCOF6","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDKYK6XS","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU","json":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU.json","graph_json":"https://pith.science/api/pith-number/BDKYK6XSD77TCOF6KFIMYQ5FBU/graph.json","events_json":"https://pith.science/api/pith-number/BDKYK6XSD77TCOF6KFIMYQ5FBU/events.json","paper":"https://pith.science/paper/BDKYK6XS"},"agent_actions":{"view_html":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU","download_json":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU.json","view_paper":"https://pith.science/paper/BDKYK6XS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10340&json=true","fetch_graph":"https://pith.science/api/pith-number/BDKYK6XSD77TCOF6KFIMYQ5FBU/graph.json","fetch_events":"https://pith.science/api/pith-number/BDKYK6XSD77TCOF6KFIMYQ5FBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/action/storage_attestation","attest_author":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/action/author_attestation","sign_citation":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/action/citation_signature","submit_replication":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/action/replication_record"}},"created_at":"2026-05-17T23:42:31.556954+00:00","updated_at":"2026-05-17T23:42:31.556954+00:00"}