{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZP7LKTOHKFOMNGV3MC7SBA7BN6","short_pith_number":"pith:ZP7LKTOH","canonical_record":{"source":{"id":"1412.5159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-15T15:38:03Z","cross_cats_sorted":["cs.FL","cs.GT"],"title_canon_sha256":"86c622cd80216f6d604c7185fde702468305528a1c47088a05d708862d733d01","abstract_canon_sha256":"53c04ef71c6581501da0dfd99e141f19f15d09a0cec5ff9870bcb85846656213"},"schema_version":"1.0"},"canonical_sha256":"cbfeb54dc7515cc69abb60bf2083e16fbb97951f5ab4be95435bb1c05d309890","source":{"kind":"arxiv","id":"1412.5159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5159","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5159v2","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5159","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZP7LKTOHKFOM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZP7LKTOHKFOMNGV3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZP7LKTOH","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZP7LKTOHKFOMNGV3MC7SBA7BN6","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-15T15:38:03Z","cross_cats_sorted":["cs.FL","cs.GT"],"title_canon_sha256":"86c622cd80216f6d604c7185fde702468305528a1c47088a05d708862d733d01","abstract_canon_sha256":"53c04ef71c6581501da0dfd99e141f19f15d09a0cec5ff9870bcb85846656213"},"schema_version":"1.0"},"canonical_sha256":"cbfeb54dc7515cc69abb60bf2083e16fbb97951f5ab4be95435bb1c05d309890","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:54.507394Z","signature_b64":"H5dCpSNKVUOGjFFfZ6reT5REYaDwsMFXk0KiwwzIX2qD2wMGNRiIv5enDNGbXXwidiGWQB4RcWm3ezUjEgBwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbfeb54dc7515cc69abb60bf2083e16fbb97951f5ab4be95435bb1c05d309890","last_reissued_at":"2026-05-18T02:30:54.506893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:54.506893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5159","source_version":2,"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-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BOU6PLnk+0HTHohxvuOvxJ227z9mvle8+KU87ctjcdpmVmoO9kmiv//iqhQ9F7hcSOBri1eNtlG7RdUBzoYQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:44:05.232438Z"},"content_sha256":"9b52dc217cbd932145271777a3da9f4e7d694185fe3eb949845fbee5bf3ffab9","schema_version":"1.0","event_id":"sha256:9b52dc217cbd932145271777a3da9f4e7d694185fe3eb949845fbee5bf3ffab9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZP7LKTOHKFOMNGV3MC7SBA7BN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving 3-Color Parity Games in $ O(n^2) $ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT"],"primary_cat":"cs.LO","authors_text":"Felix Klein","submitted_at":"2014-12-15T15:38:03Z","abstract_excerpt":"Parity games are an expressive framework to consider realizability questions for omega-regular languages. However, it is open whether they can be solved in polynomial time, making them unamenable for practical usage. To overcome this restriction, we consider 3-color parity games, which can be solved in polynomial time. They still cover an expressive fragment of specifications, as they include the classical B\\\"uchi and co-B\\\"uchi winning conditions as well as their union and intersection. This already suffices to express many useful combinations of safety and liveness properties, as for example"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5159","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"},"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-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvQ6a6n/rVGJdKhjoZE4VL7bcJNmXjPPKpVCGmy+pgaPrBXG1u/g3hkIQwH4XOEkasLea30i8Qro9iZ/PQ6XDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:44:05.233061Z"},"content_sha256":"de93e3297a3a5faf0f604882b1117eb0326c44ba5b993a281b819d8ebb23ecbf","schema_version":"1.0","event_id":"sha256:de93e3297a3a5faf0f604882b1117eb0326c44ba5b993a281b819d8ebb23ecbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZP7LKTOHKFOMNGV3MC7SBA7BN6/bundle.json","state_url":"https://pith.science/pith/ZP7LKTOHKFOMNGV3MC7SBA7BN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZP7LKTOHKFOMNGV3MC7SBA7BN6/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-06-11T11:44:05Z","links":{"resolver":"https://pith.science/pith/ZP7LKTOHKFOMNGV3MC7SBA7BN6","bundle":"https://pith.science/pith/ZP7LKTOHKFOMNGV3MC7SBA7BN6/bundle.json","state":"https://pith.science/pith/ZP7LKTOHKFOMNGV3MC7SBA7BN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZP7LKTOHKFOMNGV3MC7SBA7BN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZP7LKTOHKFOMNGV3MC7SBA7BN6","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":"53c04ef71c6581501da0dfd99e141f19f15d09a0cec5ff9870bcb85846656213","cross_cats_sorted":["cs.FL","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-15T15:38:03Z","title_canon_sha256":"86c622cd80216f6d604c7185fde702468305528a1c47088a05d708862d733d01"},"schema_version":"1.0","source":{"id":"1412.5159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5159","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5159v2","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5159","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZP7LKTOHKFOM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZP7LKTOHKFOMNGV3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZP7LKTOH","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:de93e3297a3a5faf0f604882b1117eb0326c44ba5b993a281b819d8ebb23ecbf","target":"graph","created_at":"2026-05-18T02:30:54Z","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":"Parity games are an expressive framework to consider realizability questions for omega-regular languages. However, it is open whether they can be solved in polynomial time, making them unamenable for practical usage. To overcome this restriction, we consider 3-color parity games, which can be solved in polynomial time. They still cover an expressive fragment of specifications, as they include the classical B\\\"uchi and co-B\\\"uchi winning conditions as well as their union and intersection. This already suffices to express many useful combinations of safety and liveness properties, as for example","authors_text":"Felix Klein","cross_cats":["cs.FL","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-15T15:38:03Z","title":"Solving 3-Color Parity Games in $ O(n^2) $ Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5159","kind":"arxiv","version":2},"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:9b52dc217cbd932145271777a3da9f4e7d694185fe3eb949845fbee5bf3ffab9","target":"record","created_at":"2026-05-18T02:30:54Z","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":"53c04ef71c6581501da0dfd99e141f19f15d09a0cec5ff9870bcb85846656213","cross_cats_sorted":["cs.FL","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-15T15:38:03Z","title_canon_sha256":"86c622cd80216f6d604c7185fde702468305528a1c47088a05d708862d733d01"},"schema_version":"1.0","source":{"id":"1412.5159","kind":"arxiv","version":2}},"canonical_sha256":"cbfeb54dc7515cc69abb60bf2083e16fbb97951f5ab4be95435bb1c05d309890","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbfeb54dc7515cc69abb60bf2083e16fbb97951f5ab4be95435bb1c05d309890","first_computed_at":"2026-05-18T02:30:54.506893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:54.506893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H5dCpSNKVUOGjFFfZ6reT5REYaDwsMFXk0KiwwzIX2qD2wMGNRiIv5enDNGbXXwidiGWQB4RcWm3ezUjEgBwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:54.507394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b52dc217cbd932145271777a3da9f4e7d694185fe3eb949845fbee5bf3ffab9","sha256:de93e3297a3a5faf0f604882b1117eb0326c44ba5b993a281b819d8ebb23ecbf"],"state_sha256":"09184c075d26e9edb9da1484c5e024c0fc2e5dc4d12ba14d0f2e6625e81417b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WIfxx3Feh8srFEXNkpkb26sji+05fx3tLFZtX1yoiuodz5eEmTwrxaPwH9Io/jkuPqYV9uURah/40PAjvpvEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:44:05.236859Z","bundle_sha256":"9ab894a6c7a1b46ff015b41f15918b6fe91dfc06536efe9a6311fd6107a6277f"}}