{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IU3KMC3FXK34WV63ZTNFJEXA55","short_pith_number":"pith:IU3KMC3F","schema_version":"1.0","canonical_sha256":"4536a60b65bab7cb57dbccda5492e0ef7c97287c794d65f783b6668430e441a0","source":{"kind":"arxiv","id":"1305.3944","version":1},"attestation_state":"computed","paper":{"title":"An exponential lower bound for Cunningham's rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Avis, Oliver Friedmann","submitted_at":"2013-05-16T21:57:38Z","abstract_excerpt":"In this paper we give an exponential lower bound for Cunningham's least recently considered (round-robin) rule as applied to parity games, Markhov decision processes and linear programs. This improves a recent subexponential bound of Friedmann for this rule on these problems. The round-robin rule fixes a cyclical order of the variables and chooses the next pivot variable starting from the previously chosen variable and proceeding in the given circular order. It is perhaps the simplest example from the class of history-based pivot rules. Our results are based on a new lower bound construction f"},"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":"1305.3944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-16T21:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"4b7765da0ea0a47ef1e2fb35d8b8514b13a9362adc39d30ba2e2fa6cd192c755","abstract_canon_sha256":"5299432e41b05ff3ad7fa469f52e25e9d9be940c9c9f600da43f53b9d2c2860b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:26.751234Z","signature_b64":"E/K96Ls2hCPLsaGw+ZEy8sWZXKfKAyqNpUgM3RAtvRffMKgMXORG8ZfzS2KUKdwq5pGRE7eE6MQYnNJ/j0faCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4536a60b65bab7cb57dbccda5492e0ef7c97287c794d65f783b6668430e441a0","last_reissued_at":"2026-05-18T03:25:26.750432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:26.750432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exponential lower bound for Cunningham's rule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Avis, Oliver Friedmann","submitted_at":"2013-05-16T21:57:38Z","abstract_excerpt":"In this paper we give an exponential lower bound for Cunningham's least recently considered (round-robin) rule as applied to parity games, Markhov decision processes and linear programs. This improves a recent subexponential bound of Friedmann for this rule on these problems. The round-robin rule fixes a cyclical order of the variables and chooses the next pivot variable starting from the previously chosen variable and proceeding in the given circular order. It is perhaps the simplest example from the class of history-based pivot rules. Our results are based on a new lower bound construction f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3944","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":"1305.3944","created_at":"2026-05-18T03:25:26.750552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3944v1","created_at":"2026-05-18T03:25:26.750552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3944","created_at":"2026-05-18T03:25:26.750552+00:00"},{"alias_kind":"pith_short_12","alias_value":"IU3KMC3FXK34","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"IU3KMC3FXK34WV63","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"IU3KMC3F","created_at":"2026-05-18T12:27:49.015174+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/IU3KMC3FXK34WV63ZTNFJEXA55","json":"https://pith.science/pith/IU3KMC3FXK34WV63ZTNFJEXA55.json","graph_json":"https://pith.science/api/pith-number/IU3KMC3FXK34WV63ZTNFJEXA55/graph.json","events_json":"https://pith.science/api/pith-number/IU3KMC3FXK34WV63ZTNFJEXA55/events.json","paper":"https://pith.science/paper/IU3KMC3F"},"agent_actions":{"view_html":"https://pith.science/pith/IU3KMC3FXK34WV63ZTNFJEXA55","download_json":"https://pith.science/pith/IU3KMC3FXK34WV63ZTNFJEXA55.json","view_paper":"https://pith.science/paper/IU3KMC3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3944&json=true","fetch_graph":"https://pith.science/api/pith-number/IU3KMC3FXK34WV63ZTNFJEXA55/graph.json","fetch_events":"https://pith.science/api/pith-number/IU3KMC3FXK34WV63ZTNFJEXA55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IU3KMC3FXK34WV63ZTNFJEXA55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IU3KMC3FXK34WV63ZTNFJEXA55/action/storage_attestation","attest_author":"https://pith.science/pith/IU3KMC3FXK34WV63ZTNFJEXA55/action/author_attestation","sign_citation":"https://pith.science/pith/IU3KMC3FXK34WV63ZTNFJEXA55/action/citation_signature","submit_replication":"https://pith.science/pith/IU3KMC3FXK34WV63ZTNFJEXA55/action/replication_record"}},"created_at":"2026-05-18T03:25:26.750552+00:00","updated_at":"2026-05-18T03:25:26.750552+00:00"}