{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OPS6Q6MZ4Y3D3SH5MHQDFRVNVW","short_pith_number":"pith:OPS6Q6MZ","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"},"canonical_sha256":"73e5e87999e6363dc8fd61e032c6adad9ee7963f1b6f43902a01347a1ab65858","source":{"kind":"arxiv","id":"1904.11810","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11810","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11810v4","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11810","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"OPS6Q6MZ4Y3D","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OPS6Q6MZ4Y3D3SH5","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OPS6Q6MZ","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OPS6Q6MZ4Y3D3SH5MHQDFRVNVW","target":"record","payload":{"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"},"canonical_sha256":"73e5e87999e6363dc8fd61e032c6adad9ee7963f1b6f43902a01347a1ab65858","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"},"source_kind":"arxiv","source_id":"1904.11810","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4bP/wpqUXYWh8EBNEeEknBl8ocMQFqulx8xvlip5UGiKboWo6GMMNX+EGqHKc+q4+zgssxLF5vk1bw8WSwnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:58:55.627823Z"},"content_sha256":"7a539918f26111da33dc414aacfe1e10ae8d7673708a3d84b353e94ce91ec398","schema_version":"1.0","event_id":"sha256:7a539918f26111da33dc414aacfe1e10ae8d7673708a3d84b353e94ce91ec398"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OPS6Q6MZ4Y3D3SH5MHQDFRVNVW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6blAHazcUCIZ4GsQJ5gicOuR3G3SJlb7yz0+kIrFG4AzPmtRXghNzWckRySWr0K57mkaH7GHFrjpyIYhNYyyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:58:55.628556Z"},"content_sha256":"36ee26112643cdd5be4741fc8f966749a00ad30c1455bc57d1ff6084c16d8060","schema_version":"1.0","event_id":"sha256:36ee26112643cdd5be4741fc8f966749a00ad30c1455bc57d1ff6084c16d8060"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/bundle.json","state_url":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T03:58:55Z","links":{"resolver":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW","bundle":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/bundle.json","state":"https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OPS6Q6MZ4Y3D3SH5MHQDFRVNVW","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":"36816770fe5a05f19dd8c762d1c26240050e9088b26137c8b07d99228ccfe66e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-26T12:49:13Z","title_canon_sha256":"51a2f81836f58efd596f6a8d26756cc3a057383c110265cf867304632e055a93"},"schema_version":"1.0","source":{"id":"1904.11810","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11810","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11810v4","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11810","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"OPS6Q6MZ4Y3D","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OPS6Q6MZ4Y3D3SH5","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OPS6Q6MZ","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:36ee26112643cdd5be4741fc8f966749a00ad30c1455bc57d1ff6084c16d8060","target":"graph","created_at":"2026-05-17T23:44:06Z","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":"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.","authors_text":"Dominik Wojtczak, Karoliina Lehtinen, Sven Schewe","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-26T12:49:13Z","title":"Improving the complexity of Parys' recursive algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11810","kind":"arxiv","version":4},"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:7a539918f26111da33dc414aacfe1e10ae8d7673708a3d84b353e94ce91ec398","target":"record","created_at":"2026-05-17T23:44:06Z","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":"36816770fe5a05f19dd8c762d1c26240050e9088b26137c8b07d99228ccfe66e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-04-26T12:49:13Z","title_canon_sha256":"51a2f81836f58efd596f6a8d26756cc3a057383c110265cf867304632e055a93"},"schema_version":"1.0","source":{"id":"1904.11810","kind":"arxiv","version":4}},"canonical_sha256":"73e5e87999e6363dc8fd61e032c6adad9ee7963f1b6f43902a01347a1ab65858","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73e5e87999e6363dc8fd61e032c6adad9ee7963f1b6f43902a01347a1ab65858","first_computed_at":"2026-05-17T23:44:06.893009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:06.893009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"785jBKJBtJ1EBXSZb9QMNxf4vvHXjh7p8uFn8g2VJxzlyBVGCESBqbKXc1KNxcpJCmpgB5TtaFCWE9XJXhuPBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:06.893493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11810","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a539918f26111da33dc414aacfe1e10ae8d7673708a3d84b353e94ce91ec398","sha256:36ee26112643cdd5be4741fc8f966749a00ad30c1455bc57d1ff6084c16d8060"],"state_sha256":"a310a47150cda03fbb191a0ccab7829c056ffc8ed417fafeb1e9fd78519b70ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SK+j++ShNoWshxEWoxnyn7FJLafSalOxsq2rKHwlqmGrfsGxZC0T62khn9pBHemi5qZ8sSmLAFu4kbnAnW1qCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:58:55.632212Z","bundle_sha256":"139cc00570bb9a45702ea0efe329126b1fcf53a1fcc9514287e80f97ad32aceb"}}