{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OZT4FQEQAIOFQ6ZNBLRYBUGBOX","short_pith_number":"pith:OZT4FQEQ","schema_version":"1.0","canonical_sha256":"7667c2c090021c587b2d0ae380d0c175f5abbde770954d5f69ff2c45e0fce40b","source":{"kind":"arxiv","id":"1404.3320","version":1},"attestation_state":"computed","paper":{"title":"On Simplex Pivoting Rules and Complexity Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Aviad Rubinstein, Christos Papadimitriou, Ilan Adler","submitted_at":"2014-04-12T21:42:05Z","abstract_excerpt":"We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE. We conjecture that the same can be shown for most known variants of the simplex method. However, we also point out that Dantzig's shadow vertex algorithm has a polynomial path problem. Finally, we discuss in the same context randomized pivoting rules."},"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.3320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-12T21:42:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9d014012c5d0108b492b898b69fc044054cd855928b4789b3c0ca72fbf560718","abstract_canon_sha256":"fe48184ba98e31af72431f934d1ba6b2a69fa9a6ec1697aa7ca34481a2523a9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:15.401113Z","signature_b64":"UMGZUigMd3MYgulxq+nQ1k/y2e+j3UDZ2AcGZ8fjRKn7bw3M0uC0eqh0b5YTqM/8/HksgFCkj3w2b1K0DCPSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7667c2c090021c587b2d0ae380d0c175f5abbde770954d5f69ff2c45e0fce40b","last_reissued_at":"2026-05-18T02:54:15.400656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:15.400656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Simplex Pivoting Rules and Complexity Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Aviad Rubinstein, Christos Papadimitriou, Ilan Adler","submitted_at":"2014-04-12T21:42:05Z","abstract_excerpt":"We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE. We conjecture that the same can be shown for most known variants of the simplex method. However, we also point out that Dantzig's shadow vertex algorithm has a polynomial path problem. Finally, we discuss in the same context randomized pivoting rules."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3320","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":""},"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.3320","created_at":"2026-05-18T02:54:15.400733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3320v1","created_at":"2026-05-18T02:54:15.400733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3320","created_at":"2026-05-18T02:54:15.400733+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZT4FQEQAIOF","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZT4FQEQAIOFQ6ZN","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZT4FQEQ","created_at":"2026-05-18T12:28:43.426989+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/OZT4FQEQAIOFQ6ZNBLRYBUGBOX","json":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX.json","graph_json":"https://pith.science/api/pith-number/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/graph.json","events_json":"https://pith.science/api/pith-number/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/events.json","paper":"https://pith.science/paper/OZT4FQEQ"},"agent_actions":{"view_html":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX","download_json":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX.json","view_paper":"https://pith.science/paper/OZT4FQEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3320&json=true","fetch_graph":"https://pith.science/api/pith-number/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/graph.json","fetch_events":"https://pith.science/api/pith-number/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/action/storage_attestation","attest_author":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/action/author_attestation","sign_citation":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/action/citation_signature","submit_replication":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/action/replication_record"}},"created_at":"2026-05-18T02:54:15.400733+00:00","updated_at":"2026-05-18T02:54:15.400733+00:00"}