{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OPS6Q6MZ4Y3D3SH5MHQDFRVNVW","short_pith_number":"pith:OPS6Q6MZ","schema_version":"1.0","canonical_sha256":"73e5e87999e6363dc8fd61e032c6adad9ee7963f1b6f43902a01347a1ab65858","source":{"kind":"arxiv","id":"1904.11810","version":4},"attestation_state":"computed","paper":{"title":"Improving the complexity of Parys' recursive algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Dominik Wojtczak, Karoliina Lehtinen, Sven Schewe","submitted_at":"2019-04-26T12:49:13Z","abstract_excerpt":"Parys has recently proposed a quasi-polynomial version of Zielonka's recursive algorithm for solving parity games. In this brief note we suggest a variation of his algorithm that improves the complexity to meet the state-of-the-art complexity of broadly $2^{O((\\log n)(\\log c))}$, while providing polynomial bounds when the number of colours is logarithmic."},"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":"1904.11810","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-26T12:49:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"51a2f81836f58efd596f6a8d26756cc3a057383c110265cf867304632e055a93","abstract_canon_sha256":"36816770fe5a05f19dd8c762d1c26240050e9088b26137c8b07d99228ccfe66e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:06.893493Z","signature_b64":"785jBKJBtJ1EBXSZb9QMNxf4vvHXjh7p8uFn8g2VJxzlyBVGCESBqbKXc1KNxcpJCmpgB5TtaFCWE9XJXhuPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73e5e87999e6363dc8fd61e032c6adad9ee7963f1b6f43902a01347a1ab65858","last_reissued_at":"2026-05-17T23:44:06.893009Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:06.893009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the complexity of Parys' recursive algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Dominik Wojtczak, Karoliina Lehtinen, Sven Schewe","submitted_at":"2019-04-26T12:49:13Z","abstract_excerpt":"Parys has recently proposed a quasi-polynomial version of Zielonka's recursive algorithm for solving parity games. In this brief note we suggest a variation of his algorithm that improves the complexity to meet the state-of-the-art complexity of broadly $2^{O((\\log n)(\\log c))}$, while providing polynomial bounds when the number of colours is logarithmic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11810","kind":"arxiv","version":4},"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":"1904.11810","created_at":"2026-05-17T23:44:06.893083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11810v4","created_at":"2026-05-17T23:44:06.893083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11810","created_at":"2026-05-17T23:44:06.893083+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPS6Q6MZ4Y3D","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPS6Q6MZ4Y3D3SH5","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPS6Q6MZ","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19954","citing_title":"Equilibria in Multiplayer Graph Games: An Algorithmic Study","ref_index":203,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW","json":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW.json","graph_json":"https://pith.science/api/pith-number/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/graph.json","events_json":"https://pith.science/api/pith-number/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/events.json","paper":"https://pith.science/paper/OPS6Q6MZ"},"agent_actions":{"view_html":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW","download_json":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW.json","view_paper":"https://pith.science/paper/OPS6Q6MZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11810&json=true","fetch_graph":"https://pith.science/api/pith-number/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/graph.json","fetch_events":"https://pith.science/api/pith-number/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/action/storage_attestation","attest_author":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/action/author_attestation","sign_citation":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/action/citation_signature","submit_replication":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/action/replication_record"}},"created_at":"2026-05-17T23:44:06.893083+00:00","updated_at":"2026-05-17T23:44:06.893083+00:00"}