{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3NZ4A6RMLCGOFKTG3OEUW5CWUP","short_pith_number":"pith:3NZ4A6RM","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"},"canonical_sha256":"db73c07a2c588ce2aa66db894b7456a3d286591164aafd7ab2e54a210bd72a0f","source":{"kind":"arxiv","id":"2101.05719","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.05719","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"arxiv_version","alias_value":"2101.05719v2","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05719","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"pith_short_12","alias_value":"3NZ4A6RMLCGO","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"pith_short_16","alias_value":"3NZ4A6RMLCGOFKTG","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"pith_short_8","alias_value":"3NZ4A6RM","created_at":"2026-07-05T03:07:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3NZ4A6RMLCGOFKTG3OEUW5CWUP","target":"record","payload":{"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"},"canonical_sha256":"db73c07a2c588ce2aa66db894b7456a3d286591164aafd7ab2e54a210bd72a0f","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"},"source_kind":"arxiv","source_id":"2101.05719","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-05T03:07:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbJZu0IB35hOzMVLechbtVIKu4xhL6O5fH6tczlOwdfKkqdk2mR3TX5e1MqIhhNjMXIcEWW94ZTUu+9WDg/uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T22:41:30.770592Z"},"content_sha256":"bc1ff568336b7eb5615462d81bbdd9ada590afabea073bf8a51517e6573c176a","schema_version":"1.0","event_id":"sha256:bc1ff568336b7eb5615462d81bbdd9ada590afabea073bf8a51517e6573c176a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3NZ4A6RMLCGOFKTG3OEUW5CWUP","target":"graph","payload":{"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"},"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-05T03:07:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3SY1EpLfQy6adZSllwFafIyDe5CPw6uYD1tcy1WJkdU1tAIta1uqXSRfjqZ88vWdNGaaEy7UQUudOlHc/yxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T22:41:30.771111Z"},"content_sha256":"27ac7713bbbeb3d79a98d1c6d3bc3b49620ecb0ac0604d14ac0910567581e4d5","schema_version":"1.0","event_id":"sha256:27ac7713bbbeb3d79a98d1c6d3bc3b49620ecb0ac0604d14ac0910567581e4d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/bundle.json","state_url":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/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-18T22:41:30Z","links":{"resolver":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP","bundle":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/bundle.json","state":"https://pith.science/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NZ4A6RMLCGOFKTG3OEUW5CWUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3NZ4A6RMLCGOFKTG3OEUW5CWUP","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":"3fcd63d524e95f9b77bf1d2876d1ec14c8989572ca4292bddc8e8fef431895dc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-14T16:50:13Z","title_canon_sha256":"09b0544a16a406a019189549d0ef1b2642cb93450c8f56008b6ddfeab5f583d2"},"schema_version":"1.0","source":{"id":"2101.05719","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.05719","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"arxiv_version","alias_value":"2101.05719v2","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05719","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"pith_short_12","alias_value":"3NZ4A6RMLCGO","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"pith_short_16","alias_value":"3NZ4A6RMLCGOFKTG","created_at":"2026-07-05T03:07:46Z"},{"alias_kind":"pith_short_8","alias_value":"3NZ4A6RM","created_at":"2026-07-05T03:07:46Z"}],"graph_snapshots":[{"event_id":"sha256:27ac7713bbbeb3d79a98d1c6d3bc3b49620ecb0ac0604d14ac0910567581e4d5","target":"graph","created_at":"2026-07-05T03:07:46Z","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.05719/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 $\\","authors_text":"Aaron Sidford, Di Wang, Jan van den Brand, Thatchaphol Saranurak, Yang P. Liu, Yin Tat Lee, Zhao Song","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-14T16:50:13Z","title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05719","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:bc1ff568336b7eb5615462d81bbdd9ada590afabea073bf8a51517e6573c176a","target":"record","created_at":"2026-07-05T03:07:46Z","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":"3fcd63d524e95f9b77bf1d2876d1ec14c8989572ca4292bddc8e8fef431895dc","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-01-14T16:50:13Z","title_canon_sha256":"09b0544a16a406a019189549d0ef1b2642cb93450c8f56008b6ddfeab5f583d2"},"schema_version":"1.0","source":{"id":"2101.05719","kind":"arxiv","version":2}},"canonical_sha256":"db73c07a2c588ce2aa66db894b7456a3d286591164aafd7ab2e54a210bd72a0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db73c07a2c588ce2aa66db894b7456a3d286591164aafd7ab2e54a210bd72a0f","first_computed_at":"2026-07-05T03:07:46.292394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:07:46.292394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rXVRs0ORbQU7dkmFjNm0hOCp/KDSaG8gXmISKYG/O4Y+rSEPfFAYnuqKMs55U7z2u3ckSH8XlidIyA3LJgAjAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:07:46.292818Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.05719","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc1ff568336b7eb5615462d81bbdd9ada590afabea073bf8a51517e6573c176a","sha256:27ac7713bbbeb3d79a98d1c6d3bc3b49620ecb0ac0604d14ac0910567581e4d5"],"state_sha256":"7cae8ca97d1df24fd88c1e124a14f7645b636dc73e7612ca784a07342a29a6ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ph3fSTkpYFc7KiGltlfV8Uh4aRDZNKxgen9YjEldW9pZBmLd4VMMOBreJpktcwiIofLx2jmeav+tHFSrF5KCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T22:41:30.775982Z","bundle_sha256":"8c1302647afd1a96b5f6ebac6284c951d0a73d629f56314bbcd21a61190a6aaa"}}