{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C5EWXCUUMRFBTPMTFSQFXDVZIN","short_pith_number":"pith:C5EWXCUU","schema_version":"1.0","canonical_sha256":"17496b8a94644a19bd932ca05b8eb943756f412b9523ccae377d497db08cdee9","source":{"kind":"arxiv","id":"1910.08033","version":2},"attestation_state":"computed","paper":{"title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Yin Tat Lee","submitted_at":"2019-10-17T16:59:29Z","abstract_excerpt":"We present an algorithm that given a linear program with $n$ variables, $m$ constraints, and constraint matrix $A$, computes an $\\epsilon$-approximate solution in $\\tilde{O}(\\sqrt{rank(A)}\\log(1/\\epsilon))$ iterations with high probability. Each iteration of our method consists of solving $\\tilde{O}(1)$ linear systems and additional nearly linear time computation, improving by a factor of $\\tilde{\\Omega}((m/rank(A))^{1/2})$ over the previous fastest method with this iteration cost due to Renegar (1988). Further, we provide a deterministic polynomial time computable $\\tilde{O}(rank(A))$-self-co"},"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":"1910.08033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-17T16:59:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"73bee2703812cd8294ba6e462b4cf201fa52136d77f8ef0f9e7eb999c887e9ba","abstract_canon_sha256":"1f67cfaa214e8fe6440784957e354e4d2cb8718c5c82567529ce3b3580e543d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:49.954839Z","signature_b64":"Rku170p/AbDu0gym8hurok3pOB60siitmoNXT7IBH2oba45GiMYmqdAZVMgtbzV6rLQWCkMi8Il0Ile5S5FsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17496b8a94644a19bd932ca05b8eb943756f412b9523ccae377d497db08cdee9","last_reissued_at":"2026-07-05T01:31:49.954414Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:49.954414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Yin Tat Lee","submitted_at":"2019-10-17T16:59:29Z","abstract_excerpt":"We present an algorithm that given a linear program with $n$ variables, $m$ constraints, and constraint matrix $A$, computes an $\\epsilon$-approximate solution in $\\tilde{O}(\\sqrt{rank(A)}\\log(1/\\epsilon))$ iterations with high probability. Each iteration of our method consists of solving $\\tilde{O}(1)$ linear systems and additional nearly linear time computation, improving by a factor of $\\tilde{\\Omega}((m/rank(A))^{1/2})$ over the previous fastest method with this iteration cost due to Renegar (1988). Further, we provide a deterministic polynomial time computable $\\tilde{O}(rank(A))$-self-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.08033","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/1910.08033/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":"1910.08033","created_at":"2026-07-05T01:31:49.954472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.08033v2","created_at":"2026-07-05T01:31:49.954472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.08033","created_at":"2026-07-05T01:31:49.954472+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5EWXCUUMRFB","created_at":"2026-07-05T01:31:49.954472+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5EWXCUUMRFBTPMT","created_at":"2026-07-05T01:31:49.954472+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5EWXCUU","created_at":"2026-07-05T01:31:49.954472+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11820","citing_title":"On finding exact solutions of linear programs in the oracle model","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00252","citing_title":"Distributionally Robust Linear Regression With Block Lewis Weights","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24488","citing_title":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN","json":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN.json","graph_json":"https://pith.science/api/pith-number/C5EWXCUUMRFBTPMTFSQFXDVZIN/graph.json","events_json":"https://pith.science/api/pith-number/C5EWXCUUMRFBTPMTFSQFXDVZIN/events.json","paper":"https://pith.science/paper/C5EWXCUU"},"agent_actions":{"view_html":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN","download_json":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN.json","view_paper":"https://pith.science/paper/C5EWXCUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.08033&json=true","fetch_graph":"https://pith.science/api/pith-number/C5EWXCUUMRFBTPMTFSQFXDVZIN/graph.json","fetch_events":"https://pith.science/api/pith-number/C5EWXCUUMRFBTPMTFSQFXDVZIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/action/storage_attestation","attest_author":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/action/author_attestation","sign_citation":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/action/citation_signature","submit_replication":"https://pith.science/pith/C5EWXCUUMRFBTPMTFSQFXDVZIN/action/replication_record"}},"created_at":"2026-07-05T01:31:49.954472+00:00","updated_at":"2026-07-05T01:31:49.954472+00:00"}