{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2IQRXI7KP2VSVIDFPY622A6GQ2","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":"4bed46980ebe92d6d1c254a286aa3ddc17c078434250e03d342737410420b564","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-10T13:21:30Z","title_canon_sha256":"06a39f8e2ad071eedcd374e9063e3f442322e615b90f2a7075a8776622f39a75"},"schema_version":"1.0","source":{"id":"1512.03246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03246","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03246v1","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03246","created_at":"2026-05-18T01:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"2IQRXI7KP2VS","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2IQRXI7KP2VSVIDF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2IQRXI7K","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:c3c0b88ca47451575cbe8e00e3051e6d799c64217560843523a39da8b6cee9db","target":"graph","created_at":"2026-05-18T01:24:37Z","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":"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","authors_text":"Clemens R\\\"osner, Heiko R\\\"oglin, Matthias Mnich","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-10T13:21:30Z","title":"New Deterministic Algorithms for Solving Parity Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03246","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:607be43c28aa3fd2b16941fa24ecf573f71481737e233626043b64c587b16ebb","target":"record","created_at":"2026-05-18T01:24:37Z","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":"4bed46980ebe92d6d1c254a286aa3ddc17c078434250e03d342737410420b564","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-10T13:21:30Z","title_canon_sha256":"06a39f8e2ad071eedcd374e9063e3f442322e615b90f2a7075a8776622f39a75"},"schema_version":"1.0","source":{"id":"1512.03246","kind":"arxiv","version":1}},"canonical_sha256":"d2211ba3ea7eab2aa0657e3dad03c686bc5cb9295104c2a2855c456fb4567535","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2211ba3ea7eab2aa0657e3dad03c686bc5cb9295104c2a2855c456fb4567535","first_computed_at":"2026-05-18T01:24:37.252541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:37.252541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWEq7ojQ4MbPDvxuKM9fgaxBcTaN6ml/EDUtcOtkimX1SUJvM3Ws/m4cI1TGOqA6qaSCW3LXx3l4rEytqP0yAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:37.252947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:607be43c28aa3fd2b16941fa24ecf573f71481737e233626043b64c587b16ebb","sha256:c3c0b88ca47451575cbe8e00e3051e6d799c64217560843523a39da8b6cee9db"],"state_sha256":"a5c2e36ff8acda13784b9ec88eee2ad56ec35c815856ac4592dd066b590d16be"}