{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XBN4FAHYKJ4ERHSISRT5RU6DT4","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":"a0f69fb617b50ff8a08cb0f4c9a545f8437f865363bd504690f7e53dc551acd1","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-09T00:54:54Z","title_canon_sha256":"94f22ea71b1e644a7121f5c57ac843cf9867061cc8c699fc9da51d67d2b6f4c5"},"schema_version":"1.0","source":{"id":"1210.2459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2459","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2459v1","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2459","created_at":"2026-05-18T03:43:41Z"},{"alias_kind":"pith_short_12","alias_value":"XBN4FAHYKJ4E","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XBN4FAHYKJ4ERHSI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XBN4FAHY","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:9c0cee4817ee30a8fc1b3db24c34e41c835216e82a27893406ebc4867a73cbad","target":"graph","created_at":"2026-05-18T03:43:41Z","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":"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","authors_text":"Erich Gr\\\"adel, Felix Canavoi, Roman Rabinovich","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-09T00:54:54Z","title":"The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2459","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:b1d6cdd33a433bec62b4aff81cfaa6e08f3930311083bb69bdd70864cad6f5ff","target":"record","created_at":"2026-05-18T03:43:41Z","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":"a0f69fb617b50ff8a08cb0f4c9a545f8437f865363bd504690f7e53dc551acd1","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-09T00:54:54Z","title_canon_sha256":"94f22ea71b1e644a7121f5c57ac843cf9867061cc8c699fc9da51d67d2b6f4c5"},"schema_version":"1.0","source":{"id":"1210.2459","kind":"arxiv","version":1}},"canonical_sha256":"b85bc280f85278489e489467d8d3c39f30ac520977b84427fa4f6f11aba2dd19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b85bc280f85278489e489467d8d3c39f30ac520977b84427fa4f6f11aba2dd19","first_computed_at":"2026-05-18T03:43:41.437588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:41.437588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sDEz24ojZlG0tf9IpbvMtIdrMBpC2G+GIXfNnp6J1JHuMzj2BIyUiRmjLiQtiqyGz+YS6M6kt8Ox2IGYpaCjAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:41.438082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1d6cdd33a433bec62b4aff81cfaa6e08f3930311083bb69bdd70864cad6f5ff","sha256:9c0cee4817ee30a8fc1b3db24c34e41c835216e82a27893406ebc4867a73cbad"],"state_sha256":"f4a7031aa5acccd58ed2d37dd383bb2ddeb1aeb6649f43370852141fbeab7d6e"}