{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2IQRXI7KP2VSVIDFPY622A6GQ2","short_pith_number":"pith:2IQRXI7K","schema_version":"1.0","canonical_sha256":"d2211ba3ea7eab2aa0657e3dad03c686bc5cb9295104c2a2855c456fb4567535","source":{"kind":"arxiv","id":"1512.03246","version":1},"attestation_state":"computed","paper":{"title":"New Deterministic Algorithms for Solving Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Clemens R\\\"osner, Heiko R\\\"oglin, Matthias Mnich","submitted_at":"2015-12-10T13:21:30Z","abstract_excerpt":"We study parity games in which one of the two players controls only a small number $k$ of nodes and the other player controls the $n-k$ other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity games in time $k^{O(\\sqrt{k})}\\cdot O(n^3)$, and general parity games in time $(p+k)^{O(\\sqrt{k})} \\cdot O(pnm)$, where $p$ is the number of distinct priorities and $m$ is the number of edges. For all games with $k = o(n)$ this improves the previously fastest algorithm by Jurdzi{\\'n}ski, Paterson, and Zwick (SICOMP 2008). We also obtain novel kernelization resu"},"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":"1512.03246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-10T13:21:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"06a39f8e2ad071eedcd374e9063e3f442322e615b90f2a7075a8776622f39a75","abstract_canon_sha256":"4bed46980ebe92d6d1c254a286aa3ddc17c078434250e03d342737410420b564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:37.252947Z","signature_b64":"RWEq7ojQ4MbPDvxuKM9fgaxBcTaN6ml/EDUtcOtkimX1SUJvM3Ws/m4cI1TGOqA6qaSCW3LXx3l4rEytqP0yAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2211ba3ea7eab2aa0657e3dad03c686bc5cb9295104c2a2855c456fb4567535","last_reissued_at":"2026-05-18T01:24:37.252541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:37.252541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Deterministic Algorithms for Solving Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Clemens R\\\"osner, Heiko R\\\"oglin, Matthias Mnich","submitted_at":"2015-12-10T13:21:30Z","abstract_excerpt":"We study parity games in which one of the two players controls only a small number $k$ of nodes and the other player controls the $n-k$ other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity games in time $k^{O(\\sqrt{k})}\\cdot O(n^3)$, and general parity games in time $(p+k)^{O(\\sqrt{k})} \\cdot O(pnm)$, where $p$ is the number of distinct priorities and $m$ is the number of edges. For all games with $k = o(n)$ this improves the previously fastest algorithm by Jurdzi{\\'n}ski, Paterson, and Zwick (SICOMP 2008). We also obtain novel kernelization resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03246","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":"1512.03246","created_at":"2026-05-18T01:24:37.252608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03246v1","created_at":"2026-05-18T01:24:37.252608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03246","created_at":"2026-05-18T01:24:37.252608+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IQRXI7KP2VS","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IQRXI7KP2VSVIDF","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IQRXI7K","created_at":"2026-05-18T12:28:59.999130+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/2IQRXI7KP2VSVIDFPY622A6GQ2","json":"https://pith.science/pith/2IQRXI7KP2VSVIDFPY622A6GQ2.json","graph_json":"https://pith.science/api/pith-number/2IQRXI7KP2VSVIDFPY622A6GQ2/graph.json","events_json":"https://pith.science/api/pith-number/2IQRXI7KP2VSVIDFPY622A6GQ2/events.json","paper":"https://pith.science/paper/2IQRXI7K"},"agent_actions":{"view_html":"https://pith.science/pith/2IQRXI7KP2VSVIDFPY622A6GQ2","download_json":"https://pith.science/pith/2IQRXI7KP2VSVIDFPY622A6GQ2.json","view_paper":"https://pith.science/paper/2IQRXI7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03246&json=true","fetch_graph":"https://pith.science/api/pith-number/2IQRXI7KP2VSVIDFPY622A6GQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/2IQRXI7KP2VSVIDFPY622A6GQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IQRXI7KP2VSVIDFPY622A6GQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IQRXI7KP2VSVIDFPY622A6GQ2/action/storage_attestation","attest_author":"https://pith.science/pith/2IQRXI7KP2VSVIDFPY622A6GQ2/action/author_attestation","sign_citation":"https://pith.science/pith/2IQRXI7KP2VSVIDFPY622A6GQ2/action/citation_signature","submit_replication":"https://pith.science/pith/2IQRXI7KP2VSVIDFPY622A6GQ2/action/replication_record"}},"created_at":"2026-05-18T01:24:37.252608+00:00","updated_at":"2026-05-18T01:24:37.252608+00:00"}