{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FV5XUHX3OXEZD73YITEDAS7XRX","short_pith_number":"pith:FV5XUHX3","schema_version":"1.0","canonical_sha256":"2d7b7a1efb75c991ff7844c8304bf78dc68f170f62ba4f8447b65b9ef79d81cc","source":{"kind":"arxiv","id":"1312.6677","version":3},"attestation_state":"computed","paper":{"title":"Path Finding I :Solving Linear Programs with \\~O(sqrt(rank)) Linear System Solves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Yin Tat Lee","submitted_at":"2013-12-23T20:54:43Z","abstract_excerpt":"In this paper we present a new algorithm for solving linear programs that requires only $\\tilde{O}(\\sqrt{rank(A)}L)$ iterations to solve a linear program with $m$ constraints, $n$ variables, and constraint matrix $A$, and bit complexity $L$. Each iteration of our method consists of solving $\\tilde{O}(1)$ linear systems and additional nearly linear time computation.\n  Our method improves upon the previous best iteration bound by factor of $\\tilde{\\Omega}((m/rank(A))^{1/4})$ for methods with polynomial time computable iterations and by $\\tilde{\\Omega}((m/rank(A))^{1/2})$ for methods which solve "},"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":"1312.6677","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-23T20:54:43Z","cross_cats_sorted":["math.NA","math.OC"],"title_canon_sha256":"f143678c656e1b3965dd11c7e3ec9610ef7f68a87b4731c4e2937d7f55487a96","abstract_canon_sha256":"a8828a70de1e8cab844f6a2ab396d08a904342468de7f6e11fd36f54744b4e49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:34.253299Z","signature_b64":"JigxB0BmKlrCHLgDIgg3fDuVclm9p1EylQoHoz/PyC2zZvPn+0s6a5+fI4APdrLAS58jIw2itnVAOUftZxBFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d7b7a1efb75c991ff7844c8304bf78dc68f170f62ba4f8447b65b9ef79d81cc","last_reissued_at":"2026-05-18T02:25:34.252909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:34.252909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Finding I :Solving Linear Programs with \\~O(sqrt(rank)) Linear System Solves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Yin Tat Lee","submitted_at":"2013-12-23T20:54:43Z","abstract_excerpt":"In this paper we present a new algorithm for solving linear programs that requires only $\\tilde{O}(\\sqrt{rank(A)}L)$ iterations to solve a linear program with $m$ constraints, $n$ variables, and constraint matrix $A$, and bit complexity $L$. Each iteration of our method consists of solving $\\tilde{O}(1)$ linear systems and additional nearly linear time computation.\n  Our method improves upon the previous best iteration bound by factor of $\\tilde{\\Omega}((m/rank(A))^{1/4})$ for methods with polynomial time computable iterations and by $\\tilde{\\Omega}((m/rank(A))^{1/2})$ for methods which solve "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6677","kind":"arxiv","version":3},"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":"1312.6677","created_at":"2026-05-18T02:25:34.252966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6677v3","created_at":"2026-05-18T02:25:34.252966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6677","created_at":"2026-05-18T02:25:34.252966+00:00"},{"alias_kind":"pith_short_12","alias_value":"FV5XUHX3OXEZ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FV5XUHX3OXEZD73Y","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FV5XUHX3","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20141","citing_title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","ref_index":1983,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX","json":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX.json","graph_json":"https://pith.science/api/pith-number/FV5XUHX3OXEZD73YITEDAS7XRX/graph.json","events_json":"https://pith.science/api/pith-number/FV5XUHX3OXEZD73YITEDAS7XRX/events.json","paper":"https://pith.science/paper/FV5XUHX3"},"agent_actions":{"view_html":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX","download_json":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX.json","view_paper":"https://pith.science/paper/FV5XUHX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6677&json=true","fetch_graph":"https://pith.science/api/pith-number/FV5XUHX3OXEZD73YITEDAS7XRX/graph.json","fetch_events":"https://pith.science/api/pith-number/FV5XUHX3OXEZD73YITEDAS7XRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/action/storage_attestation","attest_author":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/action/author_attestation","sign_citation":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/action/citation_signature","submit_replication":"https://pith.science/pith/FV5XUHX3OXEZD73YITEDAS7XRX/action/replication_record"}},"created_at":"2026-05-18T02:25:34.252966+00:00","updated_at":"2026-05-18T02:25:34.252966+00:00"}