{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ORLF4ZCN26DKED3AZAZBT6MEMJ","short_pith_number":"pith:ORLF4ZCN","canonical_record":{"source":{"id":"1909.04983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-09-11T11:45:25Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"231abbea09e693b094db8acf5cb28910bb8efd8d362a080fa0226abf3efb2dde","abstract_canon_sha256":"08fb76bbdf03bbb2e986a416b7d695b6aa45bb058a789918bf37724026b1808d"},"schema_version":"1.0"},"canonical_sha256":"74565e644dd786a20f60c83219f984625b296e19fbba70ef36ff53e2dd2650be","source":{"kind":"arxiv","id":"1909.04983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.04983","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1909.04983v1","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04983","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"ORLF4ZCN26DK","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"pith_short_16","alias_value":"ORLF4ZCN26DKED3A","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"pith_short_8","alias_value":"ORLF4ZCN","created_at":"2026-07-05T00:04:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ORLF4ZCN26DKED3AZAZBT6MEMJ","target":"record","payload":{"canonical_record":{"source":{"id":"1909.04983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-09-11T11:45:25Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"231abbea09e693b094db8acf5cb28910bb8efd8d362a080fa0226abf3efb2dde","abstract_canon_sha256":"08fb76bbdf03bbb2e986a416b7d695b6aa45bb058a789918bf37724026b1808d"},"schema_version":"1.0"},"canonical_sha256":"74565e644dd786a20f60c83219f984625b296e19fbba70ef36ff53e2dd2650be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:02.072342Z","signature_b64":"Te62fhXXTu+HDJf+Kp7Y7vw4jO76EHqj6u5OJ8vrVgJS5YII4TA5J/I0XczCUMVYXEhHf7K0FacXGA2OtVzkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74565e644dd786a20f60c83219f984625b296e19fbba70ef36ff53e2dd2650be","last_reissued_at":"2026-07-05T00:04:02.071952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:02.071952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.04983","source_version":1,"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-07-05T00:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xkfSMystU8uqv60OAY3zzmhh0LNUb3H7sdmPv0QimHivAWbmvuzBdxEmvc9UhKpCSRxkyt4pfuCN103ZsY84CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:23:10.833368Z"},"content_sha256":"5f4832620fe5c183fdc8eb8432be578f8cb3d8f187b94a21694a997d7e8d247a","schema_version":"1.0","event_id":"sha256:5f4832620fe5c183fdc8eb8432be578f8cb3d8f187b94a21694a997d7e8d247a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ORLF4ZCN26DKED3AZAZBT6MEMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quasipolynomial Set-Based Symbolic Algorithms for Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Alexander Svozil, Krishnendu Chatterjee, Monika Henzinger, Wolfgang Dvo\\v{r}\\'ak","submitted_at":"2019-09-11T11:45:25Z","abstract_excerpt":"Solving parity games, which are equivalent to modal $\\mu$-calculus model checking, is a central algorithmic problem in formal methods. Besides the standard computation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04983","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.04983/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Yh9rJ6sHSpYWqHDDo+7SZG5Rr6wQD8XmcRn8vTnSn3OYK2Ln/RDoiyz6mDsEZWFPzw3EAiNq6igjRMQl5M3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:23:10.834324Z"},"content_sha256":"ee3852a55b669650d97b93c72bb2be3b438e34d7db88babee3542997e35b6814","schema_version":"1.0","event_id":"sha256:ee3852a55b669650d97b93c72bb2be3b438e34d7db88babee3542997e35b6814"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORLF4ZCN26DKED3AZAZBT6MEMJ/bundle.json","state_url":"https://pith.science/pith/ORLF4ZCN26DKED3AZAZBT6MEMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORLF4ZCN26DKED3AZAZBT6MEMJ/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-08-15T15:23:10Z","links":{"resolver":"https://pith.science/pith/ORLF4ZCN26DKED3AZAZBT6MEMJ","bundle":"https://pith.science/pith/ORLF4ZCN26DKED3AZAZBT6MEMJ/bundle.json","state":"https://pith.science/pith/ORLF4ZCN26DKED3AZAZBT6MEMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORLF4ZCN26DKED3AZAZBT6MEMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ORLF4ZCN26DKED3AZAZBT6MEMJ","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":"08fb76bbdf03bbb2e986a416b7d695b6aa45bb058a789918bf37724026b1808d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-09-11T11:45:25Z","title_canon_sha256":"231abbea09e693b094db8acf5cb28910bb8efd8d362a080fa0226abf3efb2dde"},"schema_version":"1.0","source":{"id":"1909.04983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.04983","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1909.04983v1","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04983","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"ORLF4ZCN26DK","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"pith_short_16","alias_value":"ORLF4ZCN26DKED3A","created_at":"2026-07-05T00:04:02Z"},{"alias_kind":"pith_short_8","alias_value":"ORLF4ZCN","created_at":"2026-07-05T00:04:02Z"}],"graph_snapshots":[{"event_id":"sha256:ee3852a55b669650d97b93c72bb2be3b438e34d7db88babee3542997e35b6814","target":"graph","created_at":"2026-07-05T00:04:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.04983/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Solving parity games, which are equivalent to modal $\\mu$-calculus model checking, is a central algorithmic problem in formal methods. Besides the standard computation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well","authors_text":"Alexander Svozil, Krishnendu Chatterjee, Monika Henzinger, Wolfgang Dvo\\v{r}\\'ak","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-09-11T11:45:25Z","title":"Quasipolynomial Set-Based Symbolic Algorithms for Parity Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04983","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:5f4832620fe5c183fdc8eb8432be578f8cb3d8f187b94a21694a997d7e8d247a","target":"record","created_at":"2026-07-05T00:04:02Z","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":"08fb76bbdf03bbb2e986a416b7d695b6aa45bb058a789918bf37724026b1808d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-09-11T11:45:25Z","title_canon_sha256":"231abbea09e693b094db8acf5cb28910bb8efd8d362a080fa0226abf3efb2dde"},"schema_version":"1.0","source":{"id":"1909.04983","kind":"arxiv","version":1}},"canonical_sha256":"74565e644dd786a20f60c83219f984625b296e19fbba70ef36ff53e2dd2650be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74565e644dd786a20f60c83219f984625b296e19fbba70ef36ff53e2dd2650be","first_computed_at":"2026-07-05T00:04:02.071952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:02.071952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Te62fhXXTu+HDJf+Kp7Y7vw4jO76EHqj6u5OJ8vrVgJS5YII4TA5J/I0XczCUMVYXEhHf7K0FacXGA2OtVzkBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:02.072342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.04983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f4832620fe5c183fdc8eb8432be578f8cb3d8f187b94a21694a997d7e8d247a","sha256:ee3852a55b669650d97b93c72bb2be3b438e34d7db88babee3542997e35b6814"],"state_sha256":"aa3fce14398f6eaacc2d471b9b3c493f2fa14672abbecb3678a1053fae4b837a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LY2eH/C70XdKJ/lpY2JPDPsyM9bpJTyD0e4f52rlvYe3SFY2fRgMA2oaRxfiXmC8ZBWfLaufTxQfDpcbr/eBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:23:10.841544Z","bundle_sha256":"424973360bf949aab1753b07fcb94a26a4fc99359e1e0f45640feeb8b84ab013"}}