{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EGAJZZKDNFB6SCPS6CE7VIL6L3","short_pith_number":"pith:EGAJZZKD","schema_version":"1.0","canonical_sha256":"21809ce5436943e909f2f089faa17e5ecd553423806ff04ef8731d5b0603b8c0","source":{"kind":"arxiv","id":"1810.07896","version":3},"attestation_state":"computed","paper":{"title":"Solving Linear Programs in the Current Matrix Multiplication Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael B. Cohen, Yin Tat Lee, Zhao Song","submitted_at":"2018-10-18T04:37:51Z","abstract_excerpt":"This paper shows how to solve linear programs of the form $\\min_{Ax=b,x\\geq0} c^\\top x$ with $n$ variables in time $$O^*((n^{\\omega}+n^{2.5-\\alpha/2}+n^{2+1/6}) \\log(n/\\delta))$$ where $\\omega$ is the exponent of matrix multiplication, $\\alpha$ is the dual exponent of matrix multiplication, and $\\delta$ is the relative accuracy. For the current value of $\\omega\\sim2.37$ and $\\alpha\\sim0.31$, our algorithm takes $O^*(n^{\\omega} \\log(n/\\delta))$ time. When $\\omega = 2$, our algorithm takes $O^*(n^{2+1/6} \\log(n/\\delta))$ time.\n  Our algorithm utilizes several new concepts that we believe may be "},"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":"1810.07896","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T04:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"994b90ed64f1c19c100fa5958c826709ac0db729ad8452f4c054eebc7574f1fa","abstract_canon_sha256":"90dbd36580483e762b59bf314c35ae3dfc175876fa965541bdc03d9fd9ae2c12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:44:07.247379Z","signature_b64":"lefsODJQHbzq8eIogfeX0P1sB090KkONsESSFCtoVEWjCzZ0/lX1IQGhDl1UN7Zdem2BnqUid/iMMbrofjt+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21809ce5436943e909f2f089faa17e5ecd553423806ff04ef8731d5b0603b8c0","last_reissued_at":"2026-07-05T01:44:07.246983Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:44:07.246983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Linear Programs in the Current Matrix Multiplication Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael B. Cohen, Yin Tat Lee, Zhao Song","submitted_at":"2018-10-18T04:37:51Z","abstract_excerpt":"This paper shows how to solve linear programs of the form $\\min_{Ax=b,x\\geq0} c^\\top x$ with $n$ variables in time $$O^*((n^{\\omega}+n^{2.5-\\alpha/2}+n^{2+1/6}) \\log(n/\\delta))$$ where $\\omega$ is the exponent of matrix multiplication, $\\alpha$ is the dual exponent of matrix multiplication, and $\\delta$ is the relative accuracy. For the current value of $\\omega\\sim2.37$ and $\\alpha\\sim0.31$, our algorithm takes $O^*(n^{\\omega} \\log(n/\\delta))$ time. When $\\omega = 2$, our algorithm takes $O^*(n^{2+1/6} \\log(n/\\delta))$ time.\n  Our algorithm utilizes several new concepts that we believe may be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07896","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.07896/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":"1810.07896","created_at":"2026-07-05T01:44:07.247037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07896v3","created_at":"2026-07-05T01:44:07.247037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07896","created_at":"2026-07-05T01:44:07.247037+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGAJZZKDNFB6","created_at":"2026-07-05T01:44:07.247037+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGAJZZKDNFB6SCPS","created_at":"2026-07-05T01:44:07.247037+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGAJZZKD","created_at":"2026-07-05T01:44:07.247037+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":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3","json":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3.json","graph_json":"https://pith.science/api/pith-number/EGAJZZKDNFB6SCPS6CE7VIL6L3/graph.json","events_json":"https://pith.science/api/pith-number/EGAJZZKDNFB6SCPS6CE7VIL6L3/events.json","paper":"https://pith.science/paper/EGAJZZKD"},"agent_actions":{"view_html":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3","download_json":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3.json","view_paper":"https://pith.science/paper/EGAJZZKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07896&json=true","fetch_graph":"https://pith.science/api/pith-number/EGAJZZKDNFB6SCPS6CE7VIL6L3/graph.json","fetch_events":"https://pith.science/api/pith-number/EGAJZZKDNFB6SCPS6CE7VIL6L3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3/action/storage_attestation","attest_author":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3/action/author_attestation","sign_citation":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3/action/citation_signature","submit_replication":"https://pith.science/pith/EGAJZZKDNFB6SCPS6CE7VIL6L3/action/replication_record"}},"created_at":"2026-07-05T01:44:07.247037+00:00","updated_at":"2026-07-05T01:44:07.247037+00:00"}