{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OF3MEC5M363Y4XT2UCFQCCVPVO","short_pith_number":"pith:OF3MEC5M","schema_version":"1.0","canonical_sha256":"7176c20bacdfb78e5e7aa08b010aafabb80d5d63489b0a4bbda1b56c462f7c8a","source":{"kind":"arxiv","id":"2606.11820","version":1},"attestation_state":"computed","paper":{"title":"On finding exact solutions of linear programs in the oracle model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Daniel Dadush, Giacomo Zambelli, L\\'aszl\\'o A. V\\'egh","submitted_at":"2026-06-10T08:54:38Z","abstract_excerpt":"We consider linear programming in the oracle model: $\\max\\{c^\\top x \\,:\\, x\\in P\\}$, where the polyhedron $P=\\{x\\in\\mathbb{R}^n\\,:\\, Ax\\le b\\}$ is given by a separation oracle. We present an algorithm that finds exact primal and dual solutions using $O(n^2\\log(n/\\delta))$ oracle calls and $O(n^4\\log(n/\\delta)+n^5\\log\\log(1/\\delta))$ arithmetic operations, where $\\delta$ is a geometric condition number associated with the system $(A,b)$. These bounds do not depend on the cost vector $c$ and do not require a priori knowledge of $\\delta$. For rational data, $\\log(1/\\delta)$ is polynomially bounde"},"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":"2606.11820","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-10T08:54:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a04421b826560b9f4229f3fdf646487ccd6f683833e16dc958503542fbb12b9a","abstract_canon_sha256":"4cabbc04dc071250a078b45f5c25360a17e861dddaca6d5171a962d50d3f6b28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:09.855939Z","signature_b64":"q/Hy01O771oJ3ReTx+IuWDWyNJsEyrFv3XbanTzho4bSsd5CvRza+c7VHB+qgFsWKeIAu+LZ1/FGijPIX065Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7176c20bacdfb78e5e7aa08b010aafabb80d5d63489b0a4bbda1b56c462f7c8a","last_reissued_at":"2026-06-11T01:10:09.855179Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:09.855179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On finding exact solutions of linear programs in the oracle model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Daniel Dadush, Giacomo Zambelli, L\\'aszl\\'o A. V\\'egh","submitted_at":"2026-06-10T08:54:38Z","abstract_excerpt":"We consider linear programming in the oracle model: $\\max\\{c^\\top x \\,:\\, x\\in P\\}$, where the polyhedron $P=\\{x\\in\\mathbb{R}^n\\,:\\, Ax\\le b\\}$ is given by a separation oracle. We present an algorithm that finds exact primal and dual solutions using $O(n^2\\log(n/\\delta))$ oracle calls and $O(n^4\\log(n/\\delta)+n^5\\log\\log(1/\\delta))$ arithmetic operations, where $\\delta$ is a geometric condition number associated with the system $(A,b)$. These bounds do not depend on the cost vector $c$ and do not require a priori knowledge of $\\delta$. For rational data, $\\log(1/\\delta)$ is polynomially bounde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11820","kind":"arxiv","version":1},"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/2606.11820/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":"2606.11820","created_at":"2026-06-11T01:10:09.855294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11820v1","created_at":"2026-06-11T01:10:09.855294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11820","created_at":"2026-06-11T01:10:09.855294+00:00"},{"alias_kind":"pith_short_12","alias_value":"OF3MEC5M363Y","created_at":"2026-06-11T01:10:09.855294+00:00"},{"alias_kind":"pith_short_16","alias_value":"OF3MEC5M363Y4XT2","created_at":"2026-06-11T01:10:09.855294+00:00"},{"alias_kind":"pith_short_8","alias_value":"OF3MEC5M","created_at":"2026-06-11T01:10:09.855294+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO","json":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO.json","graph_json":"https://pith.science/api/pith-number/OF3MEC5M363Y4XT2UCFQCCVPVO/graph.json","events_json":"https://pith.science/api/pith-number/OF3MEC5M363Y4XT2UCFQCCVPVO/events.json","paper":"https://pith.science/paper/OF3MEC5M"},"agent_actions":{"view_html":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO","download_json":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO.json","view_paper":"https://pith.science/paper/OF3MEC5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11820&json=true","fetch_graph":"https://pith.science/api/pith-number/OF3MEC5M363Y4XT2UCFQCCVPVO/graph.json","fetch_events":"https://pith.science/api/pith-number/OF3MEC5M363Y4XT2UCFQCCVPVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO/action/storage_attestation","attest_author":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO/action/author_attestation","sign_citation":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO/action/citation_signature","submit_replication":"https://pith.science/pith/OF3MEC5M363Y4XT2UCFQCCVPVO/action/replication_record"}},"created_at":"2026-06-11T01:10:09.855294+00:00","updated_at":"2026-06-11T01:10:09.855294+00:00"}