{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5LQND6RXBT2FBNOASRFEQFPF2K","short_pith_number":"pith:5LQND6RX","schema_version":"1.0","canonical_sha256":"eae0d1fa370cf450b5c0944a4815e5d28751f188c46605e578eff51db5e6dd32","source":{"kind":"arxiv","id":"1404.0605","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of the Simplex Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Fearnley, Rahul Savani","submitted_at":"2014-04-02T16:33:31Z","abstract_excerpt":"The simplex method is a well-studied and widely-used pivoting method for solving linear programs. When Dantzig originally formulated the simplex method, he gave a natural pivot rule that pivots into the basis a variable with the most violated reduced cost. In their seminal work, Klee and Minty showed that this pivot rule takes exponential time in the worst case. We prove two main results on the simplex method. Firstly, we show that it is PSPACE-complete to find the solution that is computed by the simplex method using Dantzig's pivot rule. Secondly, we prove that deciding whether Dantzig's rul"},"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":"1404.0605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-02T16:33:31Z","cross_cats_sorted":[],"title_canon_sha256":"36134075b820e2e52be5b088f10a4ba91c33e0a4b6efe248ab2f086092ee8cf8","abstract_canon_sha256":"46c0c134f3c0656daeca416a6edd654705f2aa8f3abd581bc1a5a69105c4a39f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:04.651807Z","signature_b64":"0UNKOhh/BjaWC6gk1crg+gqNX1zaShiuytR+AcLAOnllPSYaGYTlirSeMhkxpXRxlRSJQyk3RYhaRaZ611vPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eae0d1fa370cf450b5c0944a4815e5d28751f188c46605e578eff51db5e6dd32","last_reissued_at":"2026-05-18T02:54:04.651167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:04.651167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of the Simplex Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Fearnley, Rahul Savani","submitted_at":"2014-04-02T16:33:31Z","abstract_excerpt":"The simplex method is a well-studied and widely-used pivoting method for solving linear programs. When Dantzig originally formulated the simplex method, he gave a natural pivot rule that pivots into the basis a variable with the most violated reduced cost. In their seminal work, Klee and Minty showed that this pivot rule takes exponential time in the worst case. We prove two main results on the simplex method. Firstly, we show that it is PSPACE-complete to find the solution that is computed by the simplex method using Dantzig's pivot rule. Secondly, we prove that deciding whether Dantzig's rul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0605","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":""},"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":"1404.0605","created_at":"2026-05-18T02:54:04.651268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0605v2","created_at":"2026-05-18T02:54:04.651268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0605","created_at":"2026-05-18T02:54:04.651268+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LQND6RXBT2F","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LQND6RXBT2FBNOA","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LQND6RX","created_at":"2026-05-18T12:28:14.216126+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/5LQND6RXBT2FBNOASRFEQFPF2K","json":"https://pith.science/pith/5LQND6RXBT2FBNOASRFEQFPF2K.json","graph_json":"https://pith.science/api/pith-number/5LQND6RXBT2FBNOASRFEQFPF2K/graph.json","events_json":"https://pith.science/api/pith-number/5LQND6RXBT2FBNOASRFEQFPF2K/events.json","paper":"https://pith.science/paper/5LQND6RX"},"agent_actions":{"view_html":"https://pith.science/pith/5LQND6RXBT2FBNOASRFEQFPF2K","download_json":"https://pith.science/pith/5LQND6RXBT2FBNOASRFEQFPF2K.json","view_paper":"https://pith.science/paper/5LQND6RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0605&json=true","fetch_graph":"https://pith.science/api/pith-number/5LQND6RXBT2FBNOASRFEQFPF2K/graph.json","fetch_events":"https://pith.science/api/pith-number/5LQND6RXBT2FBNOASRFEQFPF2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LQND6RXBT2FBNOASRFEQFPF2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LQND6RXBT2FBNOASRFEQFPF2K/action/storage_attestation","attest_author":"https://pith.science/pith/5LQND6RXBT2FBNOASRFEQFPF2K/action/author_attestation","sign_citation":"https://pith.science/pith/5LQND6RXBT2FBNOASRFEQFPF2K/action/citation_signature","submit_replication":"https://pith.science/pith/5LQND6RXBT2FBNOASRFEQFPF2K/action/replication_record"}},"created_at":"2026-05-18T02:54:04.651268+00:00","updated_at":"2026-05-18T02:54:04.651268+00:00"}