{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OZT4FQEQAIOFQ6ZNBLRYBUGBOX","short_pith_number":"pith:OZT4FQEQ","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"},"canonical_sha256":"7667c2c090021c587b2d0ae380d0c175f5abbde770954d5f69ff2c45e0fce40b","source":{"kind":"arxiv","id":"1404.3320","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3320","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3320v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3320","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"OZT4FQEQAIOF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZT4FQEQAIOFQ6ZN","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZT4FQEQ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OZT4FQEQAIOFQ6ZNBLRYBUGBOX","target":"record","payload":{"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"},"canonical_sha256":"7667c2c090021c587b2d0ae380d0c175f5abbde770954d5f69ff2c45e0fce40b","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"},"source_kind":"arxiv","source_id":"1404.3320","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4dhE5j3ICu0Fg+B1oYe7uGok7ceLUej0scTWC2v88OhRPi7pRd48MgHlwviUPlEFOPyzJwiPhKbYLdSr9CRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:41:49.284139Z"},"content_sha256":"7574d45b192df39ffe1bcceee23413cb18f0eb76e2ceac246ec7ed07420c9136","schema_version":"1.0","event_id":"sha256:7574d45b192df39ffe1bcceee23413cb18f0eb76e2ceac246ec7ed07420c9136"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OZT4FQEQAIOFQ6ZNBLRYBUGBOX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOLwy2dGGhKIjhuHi3qyHjnZP3MyOTBWILPe6yxL8dB/ny7MaIFJHKy+7OmFQ6taTjNHVf+8UBLjSUkv9bn+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:41:49.284741Z"},"content_sha256":"1a1acea400809c5e770f6df7d75847f1fe872b3ab83474275d8a9fae86b784cc","schema_version":"1.0","event_id":"sha256:1a1acea400809c5e770f6df7d75847f1fe872b3ab83474275d8a9fae86b784cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/bundle.json","state_url":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T18:41:49Z","links":{"resolver":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX","bundle":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/bundle.json","state":"https://pith.science/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZT4FQEQAIOFQ6ZNBLRYBUGBOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OZT4FQEQAIOFQ6ZNBLRYBUGBOX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fe48184ba98e31af72431f934d1ba6b2a69fa9a6ec1697aa7ca34481a2523a9b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-12T21:42:05Z","title_canon_sha256":"9d014012c5d0108b492b898b69fc044054cd855928b4789b3c0ca72fbf560718"},"schema_version":"1.0","source":{"id":"1404.3320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3320","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3320v1","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3320","created_at":"2026-05-18T02:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"OZT4FQEQAIOF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZT4FQEQAIOFQ6ZN","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZT4FQEQ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:1a1acea400809c5e770f6df7d75847f1fe872b3ab83474275d8a9fae86b784cc","target":"graph","created_at":"2026-05-18T02:54:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Aviad Rubinstein, Christos Papadimitriou, Ilan Adler","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-12T21:42:05Z","title":"On Simplex Pivoting Rules and Complexity Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3320","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7574d45b192df39ffe1bcceee23413cb18f0eb76e2ceac246ec7ed07420c9136","target":"record","created_at":"2026-05-18T02:54:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fe48184ba98e31af72431f934d1ba6b2a69fa9a6ec1697aa7ca34481a2523a9b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-12T21:42:05Z","title_canon_sha256":"9d014012c5d0108b492b898b69fc044054cd855928b4789b3c0ca72fbf560718"},"schema_version":"1.0","source":{"id":"1404.3320","kind":"arxiv","version":1}},"canonical_sha256":"7667c2c090021c587b2d0ae380d0c175f5abbde770954d5f69ff2c45e0fce40b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7667c2c090021c587b2d0ae380d0c175f5abbde770954d5f69ff2c45e0fce40b","first_computed_at":"2026-05-18T02:54:15.400656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:15.400656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UMGZUigMd3MYgulxq+nQ1k/y2e+j3UDZ2AcGZ8fjRKn7bw3M0uC0eqh0b5YTqM/8/HksgFCkj3w2b1K0DCPSBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:15.401113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7574d45b192df39ffe1bcceee23413cb18f0eb76e2ceac246ec7ed07420c9136","sha256:1a1acea400809c5e770f6df7d75847f1fe872b3ab83474275d8a9fae86b784cc"],"state_sha256":"c320884b5e46186ba5378803d11193e859649cdde312468c1636cf542f201192"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anTGZCy+ZbgGH5JSYKhRErEtqv8ddQ7olzmcipJvWQIVTZRk3DPptPcZWinKSRYqNTuoVOnlhiXNW8mNdZ6ODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:41:49.288793Z","bundle_sha256":"b1cdf4b2eadcd95f14ffc8d627e583c5c0ef6fec6c51807dd1b9db6f801cb471"}}