{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UIGTMPQ6ZL65IYLV7INEYQ5OB6","short_pith_number":"pith:UIGTMPQ6","canonical_record":{"source":{"id":"1405.0386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-02T11:45:18Z","cross_cats_sorted":[],"title_canon_sha256":"f9f1b97880e83f2edb607aec8c0e010270fc1fbcfd3942121067a128ecc77cf0","abstract_canon_sha256":"cc2cdd7c7fde7f2c0f60c9f54885c18c82e210339954e285915d62fd5524b5f4"},"schema_version":"1.0"},"canonical_sha256":"a20d363e1ecafdd46175fa1a4c43ae0fa030f4793280a191b1e2ebfe19d774bc","source":{"kind":"arxiv","id":"1405.0386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0386","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0386v2","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0386","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"UIGTMPQ6ZL65","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UIGTMPQ6ZL65IYLV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UIGTMPQ6","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UIGTMPQ6ZL65IYLV7INEYQ5OB6","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-02T11:45:18Z","cross_cats_sorted":[],"title_canon_sha256":"f9f1b97880e83f2edb607aec8c0e010270fc1fbcfd3942121067a128ecc77cf0","abstract_canon_sha256":"cc2cdd7c7fde7f2c0f60c9f54885c18c82e210339954e285915d62fd5524b5f4"},"schema_version":"1.0"},"canonical_sha256":"a20d363e1ecafdd46175fa1a4c43ae0fa030f4793280a191b1e2ebfe19d774bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:41.312931Z","signature_b64":"6C7JneUiQ8tzrWlhEi8y6Bas/zKv7PO8O5L/0b2HTT78UXuIuKMN+cmaNokhm5iOLFKNafBfcha8C8JdGpmACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a20d363e1ecafdd46175fa1a4c43ae0fa030f4793280a191b1e2ebfe19d774bc","last_reissued_at":"2026-05-18T02:51:41.312352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:41.312352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0386","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:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KZY6lLTr1h8CTZWbGIwFrwGjv3HjvgHU5gtWIg/h/wQYn0JZuQO5CG55Fh4jCWuhWE4DMLQvqHLZg12Iy0SCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:13:18.999217Z"},"content_sha256":"79d496ae1cb20d590e3aa8a05330012516ef45243b53b91749c08a46881d7a59","schema_version":"1.0","event_id":"sha256:79d496ae1cb20d590e3aa8a05330012516ef45243b53b91749c08a46881d7a59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UIGTMPQ6ZL65IYLV7INEYQ5OB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fatal Attractors in Parity Games: Building Blocks for Partial Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jim Huan-Pu Kuo, Michael Huth, Nir Piterman","submitted_at":"2014-05-02T11:45:18Z","abstract_excerpt":"Attractors in parity games are a technical device for solving \"alternating\" reachability of given node sets. A well known solver of parity games - Zielonka's algorithm - uses such attractor computations recursively. We here propose new forms of attractors that are monotone in that they are aware of specific static patterns of colors encountered in reaching a given node set in alternating fashion. Then we demonstrate how these new forms of attractors can be embedded within greatest fixed-point computations to design solvers of parity games that run in polynomial time but are partial in that the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0386","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:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SK1PsquTH/6u9J0xDmg9OWRHaTdytQdqmbK3UkTzCqRRsHpGwmmltpj5HDGYwemg8BkKD/ycTA43cn3SGsR1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:13:18.999575Z"},"content_sha256":"3e610d52af99f9fbbd06c6ec2b93266e12ae2b5098a5dc22ccc604f4b2b011cc","schema_version":"1.0","event_id":"sha256:3e610d52af99f9fbbd06c6ec2b93266e12ae2b5098a5dc22ccc604f4b2b011cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIGTMPQ6ZL65IYLV7INEYQ5OB6/bundle.json","state_url":"https://pith.science/pith/UIGTMPQ6ZL65IYLV7INEYQ5OB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIGTMPQ6ZL65IYLV7INEYQ5OB6/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-03T06:13:19Z","links":{"resolver":"https://pith.science/pith/UIGTMPQ6ZL65IYLV7INEYQ5OB6","bundle":"https://pith.science/pith/UIGTMPQ6ZL65IYLV7INEYQ5OB6/bundle.json","state":"https://pith.science/pith/UIGTMPQ6ZL65IYLV7INEYQ5OB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIGTMPQ6ZL65IYLV7INEYQ5OB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UIGTMPQ6ZL65IYLV7INEYQ5OB6","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":"cc2cdd7c7fde7f2c0f60c9f54885c18c82e210339954e285915d62fd5524b5f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-02T11:45:18Z","title_canon_sha256":"f9f1b97880e83f2edb607aec8c0e010270fc1fbcfd3942121067a128ecc77cf0"},"schema_version":"1.0","source":{"id":"1405.0386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0386","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0386v2","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0386","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"UIGTMPQ6ZL65","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UIGTMPQ6ZL65IYLV","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UIGTMPQ6","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:3e610d52af99f9fbbd06c6ec2b93266e12ae2b5098a5dc22ccc604f4b2b011cc","target":"graph","created_at":"2026-05-18T02:51:41Z","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":"Attractors in parity games are a technical device for solving \"alternating\" reachability of given node sets. A well known solver of parity games - Zielonka's algorithm - uses such attractor computations recursively. We here propose new forms of attractors that are monotone in that they are aware of specific static patterns of colors encountered in reaching a given node set in alternating fashion. Then we demonstrate how these new forms of attractors can be embedded within greatest fixed-point computations to design solvers of parity games that run in polynomial time but are partial in that the","authors_text":"Jim Huan-Pu Kuo, Michael Huth, Nir Piterman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-02T11:45:18Z","title":"Fatal Attractors in Parity Games: Building Blocks for Partial Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0386","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:79d496ae1cb20d590e3aa8a05330012516ef45243b53b91749c08a46881d7a59","target":"record","created_at":"2026-05-18T02:51:41Z","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":"cc2cdd7c7fde7f2c0f60c9f54885c18c82e210339954e285915d62fd5524b5f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-05-02T11:45:18Z","title_canon_sha256":"f9f1b97880e83f2edb607aec8c0e010270fc1fbcfd3942121067a128ecc77cf0"},"schema_version":"1.0","source":{"id":"1405.0386","kind":"arxiv","version":2}},"canonical_sha256":"a20d363e1ecafdd46175fa1a4c43ae0fa030f4793280a191b1e2ebfe19d774bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a20d363e1ecafdd46175fa1a4c43ae0fa030f4793280a191b1e2ebfe19d774bc","first_computed_at":"2026-05-18T02:51:41.312352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:41.312352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6C7JneUiQ8tzrWlhEi8y6Bas/zKv7PO8O5L/0b2HTT78UXuIuKMN+cmaNokhm5iOLFKNafBfcha8C8JdGpmACA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:41.312931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79d496ae1cb20d590e3aa8a05330012516ef45243b53b91749c08a46881d7a59","sha256:3e610d52af99f9fbbd06c6ec2b93266e12ae2b5098a5dc22ccc604f4b2b011cc"],"state_sha256":"3adcfe8dfff256f2996507612c759646bdcd4a4471006b745a6a4c1afc96bae2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVGXavY3XEa9m9trlncNN9f+jRIFTmjEajEK8yiRFnBF30ZocwN4MPaFDHDyI3maESDe0Q0tqq68RpBf3XhTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:13:19.001734Z","bundle_sha256":"15c4fa6d354143fc766245861a8dd69405400388d5e433579fddcb9acf8abd49"}}