{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3NZ4A6RMLCGOFKTG3OEUW5CWUP","short_pith_number":"pith:3NZ4A6RM","schema_version":"1.0","canonical_sha256":"db73c07a2c588ce2aa66db894b7456a3d286591164aafd7ab2e54a210bd72a0f","source":{"kind":"arxiv","id":"2101.05719","version":2},"attestation_state":"computed","paper":{"title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Di Wang, Jan van den Brand, Thatchaphol Saranurak, Yang P. Liu, Yin Tat Lee, Zhao Song","submitted_at":"2021-01-14T16:50:13Z","abstract_excerpt":"In this paper we provide new randomized algorithms with improved runtimes for solving linear programs with two-sided constraints. In the special case of the minimum cost flow problem on $n$-vertex $m$-edge graphs with integer polynomially-bounded costs and capacities we obtain a randomized method which solves the problem in $\\tilde{O}(m+n^{1.5})$ time. This improves upon the previous best runtime of $\\tilde{O}(m\\sqrt{n})$ (Lee-Sidford 2014) and, in the special case of unit-capacity maximum flow, improves upon the previous best runtimes of $m^{4/3+o(1)}$ (Liu-Sidford 2020, Kathuria 2020) and $\\"},"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.05719","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-14T16:50:13Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"09b0544a16a406a019189549d0ef1b2642cb93450c8f56008b6ddfeab5f583d2","abstract_canon_sha256":"3fcd63d524e95f9b77bf1d2876d1ec14c8989572ca4292bddc8e8fef431895dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:46.292818Z","signature_b64":"rXVRs0ORbQU7dkmFjNm0hOCp/KDSaG8gXmISKYG/O4Y+rSEPfFAYnuqKMs55U7z2u3ckSH8XlidIyA3LJgAjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db73c07a2c588ce2aa66db894b7456a3d286591164aafd7ab2e54a210bd72a0f","last_reissued_at":"2026-07-05T03:07:46.292394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:46.292394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Di Wang, Jan van den Brand, Thatchaphol Saranurak, Yang P. Liu, Yin Tat Lee, Zhao Song","submitted_at":"2021-01-14T16:50:13Z","abstract_excerpt":"In this paper we provide new randomized algorithms with improved runtimes for solving linear programs with two-sided constraints. In the special case of the minimum cost flow problem on $n$-vertex $m$-edge graphs with integer polynomially-bounded costs and capacities we obtain a randomized method which solves the problem in $\\tilde{O}(m+n^{1.5})$ time. This improves upon the previous best runtime of $\\tilde{O}(m\\sqrt{n})$ (Lee-Sidford 2014) and, in the special case of unit-capacity maximum flow, improves upon the previous best runtimes of $m^{4/3+o(1)}$ (Liu-Sidford 2020, Kathuria 2020) and $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05719","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.05719/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.05719","created_at":"2026-07-05T03:07:46.292451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.05719v2","created_at":"2026-07-05T03:07:46.292451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05719","created_at":"2026-07-05T03:07:46.292451+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NZ4A6RMLCGO","created_at":"2026-07-05T03:07:46.292451+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NZ4A6RMLCGOFKTG","created_at":"2026-07-05T03:07:46.292451+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NZ4A6RM","created_at":"2026-07-05T03:07:46.292451+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04438","citing_title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP","json":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP.json","graph_json":"https://pith.science/api/pith-number/3NZ4A6RMLCGOFKTG3OEUW5CWUP/graph.json","events_json":"https://pith.science/api/pith-number/3NZ4A6RMLCGOFKTG3OEUW5CWUP/events.json","paper":"https://pith.science/paper/3NZ4A6RM"},"agent_actions":{"view_html":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP","download_json":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP.json","view_paper":"https://pith.science/paper/3NZ4A6RM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.05719&json=true","fetch_graph":"https://pith.science/api/pith-number/3NZ4A6RMLCGOFKTG3OEUW5CWUP/graph.json","fetch_events":"https://pith.science/api/pith-number/3NZ4A6RMLCGOFKTG3OEUW5CWUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/action/storage_attestation","attest_author":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/action/author_attestation","sign_citation":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/action/citation_signature","submit_replication":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/action/replication_record"}},"created_at":"2026-07-05T03:07:46.292451+00:00","updated_at":"2026-07-05T03:07:46.292451+00:00"}