{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZRMQ5VT6RA74AN2KOOPRZYA5EG","short_pith_number":"pith:ZRMQ5VT6","schema_version":"1.0","canonical_sha256":"cc590ed67e883fc0374a739f1ce01d21afe971d0a2d477725cc5e9be013bb0a8","source":{"kind":"arxiv","id":"1706.09380","version":1},"attestation_state":"computed","paper":{"title":"Exponential lower bounds for history-based simplex pivot rules on abstract cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Antonis Thomas","submitted_at":"2017-06-28T17:47:20Z","abstract_excerpt":"The behavior of the simplex algorithm is a widely studied subject. Specifically, the question of the existence of a polynomial pivot rule for the simplex algorithm is of major importance. Here, we give exponential lower bounds for three history-based pivot rules. Those rules decide their next step based on memory of the past steps. In particular, we study Zadeh's least entered rule, Johnson's least-recently basic rule and Cunningham's least-recently considered (or round-robin) rule. We give exponential lower bounds on Acyclic Unique Sink Orientations (AUSO) of the abstract cube, for all of the"},"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":"1706.09380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-28T17:47:20Z","cross_cats_sorted":[],"title_canon_sha256":"6be2a2d8abcf33cf5a8d08a94013c74f85a4747e6dfa11c7cd0375433f817b88","abstract_canon_sha256":"f3a6360441f07aa95e0c7a3c4bf43757da035659a631f54634655c2506102021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:18.797643Z","signature_b64":"nbC8qbGrMJF7yrORNEpy0Q0ZvQ9KYLB2/shci0iBx5Leey1BRLXzIFe4cPdlRQCFLGhbffrESKIBZapwIoQTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc590ed67e883fc0374a739f1ce01d21afe971d0a2d477725cc5e9be013bb0a8","last_reissued_at":"2026-05-18T00:41:18.796902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:18.796902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential lower bounds for history-based simplex pivot rules on abstract cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Antonis Thomas","submitted_at":"2017-06-28T17:47:20Z","abstract_excerpt":"The behavior of the simplex algorithm is a widely studied subject. Specifically, the question of the existence of a polynomial pivot rule for the simplex algorithm is of major importance. Here, we give exponential lower bounds for three history-based pivot rules. Those rules decide their next step based on memory of the past steps. In particular, we study Zadeh's least entered rule, Johnson's least-recently basic rule and Cunningham's least-recently considered (or round-robin) rule. We give exponential lower bounds on Acyclic Unique Sink Orientations (AUSO) of the abstract cube, for all of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09380","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":"1706.09380","created_at":"2026-05-18T00:41:18.797027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09380v1","created_at":"2026-05-18T00:41:18.797027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09380","created_at":"2026-05-18T00:41:18.797027+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRMQ5VT6RA74","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRMQ5VT6RA74AN2K","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRMQ5VT6","created_at":"2026-05-18T12:31:59.375834+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/ZRMQ5VT6RA74AN2KOOPRZYA5EG","json":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG.json","graph_json":"https://pith.science/api/pith-number/ZRMQ5VT6RA74AN2KOOPRZYA5EG/graph.json","events_json":"https://pith.science/api/pith-number/ZRMQ5VT6RA74AN2KOOPRZYA5EG/events.json","paper":"https://pith.science/paper/ZRMQ5VT6"},"agent_actions":{"view_html":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG","download_json":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG.json","view_paper":"https://pith.science/paper/ZRMQ5VT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09380&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRMQ5VT6RA74AN2KOOPRZYA5EG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRMQ5VT6RA74AN2KOOPRZYA5EG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/action/storage_attestation","attest_author":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/action/author_attestation","sign_citation":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/action/citation_signature","submit_replication":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/action/replication_record"}},"created_at":"2026-05-18T00:41:18.797027+00:00","updated_at":"2026-05-18T00:41:18.797027+00:00"}