{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZRMQ5VT6RA74AN2KOOPRZYA5EG","short_pith_number":"pith:ZRMQ5VT6","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"},"canonical_sha256":"cc590ed67e883fc0374a739f1ce01d21afe971d0a2d477725cc5e9be013bb0a8","source":{"kind":"arxiv","id":"1706.09380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09380","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09380v1","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09380","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZRMQ5VT6RA74","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZRMQ5VT6RA74AN2K","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZRMQ5VT6","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZRMQ5VT6RA74AN2KOOPRZYA5EG","target":"record","payload":{"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"},"canonical_sha256":"cc590ed67e883fc0374a739f1ce01d21afe971d0a2d477725cc5e9be013bb0a8","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"},"source_kind":"arxiv","source_id":"1706.09380","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-18T00:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgKM9BdTIMimNKqiJLrD9MwMOgUr/LbHb7wwY37ESzOt2kjwEz28hMweBXO7nE1p9jIkUfAqJupu5/NFWDgwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T10:21:46.495608Z"},"content_sha256":"90cbe3befd8121ec9bfdb458543916b8cb291de92538915dbd4782fb7d1e92da","schema_version":"1.0","event_id":"sha256:90cbe3befd8121ec9bfdb458543916b8cb291de92538915dbd4782fb7d1e92da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZRMQ5VT6RA74AN2KOOPRZYA5EG","target":"graph","payload":{"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"},"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-18T00:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOmyfJRDcsARYwXIB3fipMvYjl1XfMSveabNnMUE4UnDHadp2SgPvX2P9bWC1M8MsGbKON30f7HpJUuwl1hzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T10:21:46.495956Z"},"content_sha256":"af382813e035eb81267ae2998bbbabccca6243bfa3de6b6dd36e6bde73b348af","schema_version":"1.0","event_id":"sha256:af382813e035eb81267ae2998bbbabccca6243bfa3de6b6dd36e6bde73b348af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/bundle.json","state_url":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/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-20T10:21:46Z","links":{"resolver":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG","bundle":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/bundle.json","state":"https://pith.science/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRMQ5VT6RA74AN2KOOPRZYA5EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZRMQ5VT6RA74AN2KOOPRZYA5EG","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":"f3a6360441f07aa95e0c7a3c4bf43757da035659a631f54634655c2506102021","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-28T17:47:20Z","title_canon_sha256":"6be2a2d8abcf33cf5a8d08a94013c74f85a4747e6dfa11c7cd0375433f817b88"},"schema_version":"1.0","source":{"id":"1706.09380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09380","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09380v1","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09380","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZRMQ5VT6RA74","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZRMQ5VT6RA74AN2K","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZRMQ5VT6","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:af382813e035eb81267ae2998bbbabccca6243bfa3de6b6dd36e6bde73b348af","target":"graph","created_at":"2026-05-18T00:41:18Z","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":"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","authors_text":"Antonis Thomas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-28T17:47:20Z","title":"Exponential lower bounds for history-based simplex pivot rules on abstract cubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09380","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:90cbe3befd8121ec9bfdb458543916b8cb291de92538915dbd4782fb7d1e92da","target":"record","created_at":"2026-05-18T00:41:18Z","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":"f3a6360441f07aa95e0c7a3c4bf43757da035659a631f54634655c2506102021","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-28T17:47:20Z","title_canon_sha256":"6be2a2d8abcf33cf5a8d08a94013c74f85a4747e6dfa11c7cd0375433f817b88"},"schema_version":"1.0","source":{"id":"1706.09380","kind":"arxiv","version":1}},"canonical_sha256":"cc590ed67e883fc0374a739f1ce01d21afe971d0a2d477725cc5e9be013bb0a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc590ed67e883fc0374a739f1ce01d21afe971d0a2d477725cc5e9be013bb0a8","first_computed_at":"2026-05-18T00:41:18.796902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:18.796902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nbC8qbGrMJF7yrORNEpy0Q0ZvQ9KYLB2/shci0iBx5Leey1BRLXzIFe4cPdlRQCFLGhbffrESKIBZapwIoQTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:18.797643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90cbe3befd8121ec9bfdb458543916b8cb291de92538915dbd4782fb7d1e92da","sha256:af382813e035eb81267ae2998bbbabccca6243bfa3de6b6dd36e6bde73b348af"],"state_sha256":"612841c59225b04b36585d5aec5c1d3a8bcdc1fae6c609007fef2db6bdfdb1ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHxBMEdtrlJz+8qgSdV5hG1H31AKCpm5Yt7+p91Q1Kyst9RZqcvP/XqQgh9Bm5j8Jbi0/OdiHKrlZPyrvDxwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T10:21:46.498293Z","bundle_sha256":"0d617a2b39e9becefb000eeaeb25413452a832b68a8fd8b7afb28a457b7958b4"}}