{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VUJQILMAFY6EKOZT6TLNDQUALC","short_pith_number":"pith:VUJQILMA","schema_version":"1.0","canonical_sha256":"ad13042d802e3c453b33f4d6d1c28058a7252207a464fcc3e5071d4085e18921","source":{"kind":"arxiv","id":"1703.01296","version":2},"attestation_state":"computed","paper":{"title":"An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dominik Wojtczak, Frank Stephan, John Fearnley, Sanjay Jain, Sven Schewe","submitted_at":"2017-03-03T16:25:46Z","abstract_excerpt":"Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic player that allows for determining her rational move without changing the outcome of the game. We provide "},"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":"1703.01296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-03-03T16:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"c37534cca2b712998b2f0bd9340bd279f8f39fde6ae720baf6357845851acd25","abstract_canon_sha256":"bcb7780f65edacf93775ad52873ed61b89eb71a0841ed44d52838a2180e266b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:01.933324Z","signature_b64":"ATiTa34o7XcyAYFgzotv9/mXcyZDu4gSc7VRunRP+OirVy8koPebQIyjDRsC9z/apKzo85BGp8P2I2fk4qjfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad13042d802e3c453b33f4d6d1c28058a7252207a464fcc3e5071d4085e18921","last_reissued_at":"2026-05-18T00:25:01.932812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:01.932812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dominik Wojtczak, Frank Stephan, John Fearnley, Sanjay Jain, Sven Schewe","submitted_at":"2017-03-03T16:25:46Z","abstract_excerpt":"Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic player that allows for determining her rational move without changing the outcome of the game. We provide "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01296","kind":"arxiv","version":2},"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":"1703.01296","created_at":"2026-05-18T00:25:01.932907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01296v2","created_at":"2026-05-18T00:25:01.932907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01296","created_at":"2026-05-18T00:25:01.932907+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUJQILMAFY6E","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUJQILMAFY6EKOZT","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUJQILMA","created_at":"2026-05-18T12:31:49.984773+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/VUJQILMAFY6EKOZT6TLNDQUALC","json":"https://pith.science/pith/VUJQILMAFY6EKOZT6TLNDQUALC.json","graph_json":"https://pith.science/api/pith-number/VUJQILMAFY6EKOZT6TLNDQUALC/graph.json","events_json":"https://pith.science/api/pith-number/VUJQILMAFY6EKOZT6TLNDQUALC/events.json","paper":"https://pith.science/paper/VUJQILMA"},"agent_actions":{"view_html":"https://pith.science/pith/VUJQILMAFY6EKOZT6TLNDQUALC","download_json":"https://pith.science/pith/VUJQILMAFY6EKOZT6TLNDQUALC.json","view_paper":"https://pith.science/paper/VUJQILMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01296&json=true","fetch_graph":"https://pith.science/api/pith-number/VUJQILMAFY6EKOZT6TLNDQUALC/graph.json","fetch_events":"https://pith.science/api/pith-number/VUJQILMAFY6EKOZT6TLNDQUALC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUJQILMAFY6EKOZT6TLNDQUALC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUJQILMAFY6EKOZT6TLNDQUALC/action/storage_attestation","attest_author":"https://pith.science/pith/VUJQILMAFY6EKOZT6TLNDQUALC/action/author_attestation","sign_citation":"https://pith.science/pith/VUJQILMAFY6EKOZT6TLNDQUALC/action/citation_signature","submit_replication":"https://pith.science/pith/VUJQILMAFY6EKOZT6TLNDQUALC/action/replication_record"}},"created_at":"2026-05-18T00:25:01.932907+00:00","updated_at":"2026-05-18T00:25:01.932907+00:00"}