{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XBN4FAHYKJ4ERHSISRT5RU6DT4","short_pith_number":"pith:XBN4FAHY","schema_version":"1.0","canonical_sha256":"b85bc280f85278489e489467d8d3c39f30ac520977b84427fa4f6f11aba2dd19","source":{"kind":"arxiv","id":"1210.2459","version":1},"attestation_state":"computed","paper":{"title":"The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Erich Gr\\\"adel, Felix Canavoi, Roman Rabinovich","submitted_at":"2012-10-09T00:54:54Z","abstract_excerpt":"For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge  had been considered as a candidate for solving parity games in polynomial time. However, it has recently been proved by Oliver Friedmann that the strategy improvement algorithm requires super-polynomially many iteration steps, for all popular local improvements rules, including switch-all (also with Fearnley's snare memorisation), switch-best, random-facet, random-edge, switch-half, least-recently-considered, and Zadeh's Pivoting rule.\n  We analyse the examples provided by Friedmann in terms of complexity mea"},"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":"1210.2459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-09T00:54:54Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"94f22ea71b1e644a7121f5c57ac843cf9867061cc8c699fc9da51d67d2b6f4c5","abstract_canon_sha256":"a0f69fb617b50ff8a08cb0f4c9a545f8437f865363bd504690f7e53dc551acd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:41.438082Z","signature_b64":"sDEz24ojZlG0tf9IpbvMtIdrMBpC2G+GIXfNnp6J1JHuMzj2BIyUiRmjLiQtiqyGz+YS6M6kt8Ox2IGYpaCjAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b85bc280f85278489e489467d8d3c39f30ac520977b84427fa4f6f11aba2dd19","last_reissued_at":"2026-05-18T03:43:41.437588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:41.437588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Erich Gr\\\"adel, Felix Canavoi, Roman Rabinovich","submitted_at":"2012-10-09T00:54:54Z","abstract_excerpt":"For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge  had been considered as a candidate for solving parity games in polynomial time. However, it has recently been proved by Oliver Friedmann that the strategy improvement algorithm requires super-polynomially many iteration steps, for all popular local improvements rules, including switch-all (also with Fearnley's snare memorisation), switch-best, random-facet, random-edge, switch-half, least-recently-considered, and Zadeh's Pivoting rule.\n  We analyse the examples provided by Friedmann in terms of complexity mea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2459","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":"1210.2459","created_at":"2026-05-18T03:43:41.437667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2459v1","created_at":"2026-05-18T03:43:41.437667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2459","created_at":"2026-05-18T03:43:41.437667+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBN4FAHYKJ4E","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBN4FAHYKJ4ERHSI","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBN4FAHY","created_at":"2026-05-18T12:27:27.928770+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/XBN4FAHYKJ4ERHSISRT5RU6DT4","json":"https://pith.science/pith/XBN4FAHYKJ4ERHSISRT5RU6DT4.json","graph_json":"https://pith.science/api/pith-number/XBN4FAHYKJ4ERHSISRT5RU6DT4/graph.json","events_json":"https://pith.science/api/pith-number/XBN4FAHYKJ4ERHSISRT5RU6DT4/events.json","paper":"https://pith.science/paper/XBN4FAHY"},"agent_actions":{"view_html":"https://pith.science/pith/XBN4FAHYKJ4ERHSISRT5RU6DT4","download_json":"https://pith.science/pith/XBN4FAHYKJ4ERHSISRT5RU6DT4.json","view_paper":"https://pith.science/paper/XBN4FAHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2459&json=true","fetch_graph":"https://pith.science/api/pith-number/XBN4FAHYKJ4ERHSISRT5RU6DT4/graph.json","fetch_events":"https://pith.science/api/pith-number/XBN4FAHYKJ4ERHSISRT5RU6DT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBN4FAHYKJ4ERHSISRT5RU6DT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBN4FAHYKJ4ERHSISRT5RU6DT4/action/storage_attestation","attest_author":"https://pith.science/pith/XBN4FAHYKJ4ERHSISRT5RU6DT4/action/author_attestation","sign_citation":"https://pith.science/pith/XBN4FAHYKJ4ERHSISRT5RU6DT4/action/citation_signature","submit_replication":"https://pith.science/pith/XBN4FAHYKJ4ERHSISRT5RU6DT4/action/replication_record"}},"created_at":"2026-05-18T03:43:41.437667+00:00","updated_at":"2026-05-18T03:43:41.437667+00:00"}