{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:QGRC7OLZWKSE2SSJEU6YSHG6ZY","short_pith_number":"pith:QGRC7OLZ","canonical_record":{"source":{"id":"0705.2205","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-05-15T18:08:15Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"02bdd2800b14ad6462f24b634b46d64c260f3494ea7b2d65945b202f59640740","abstract_canon_sha256":"4149f1585ab38aa38ca64dbca55bd562bbf5ab26baa5ef60ee00fea15b740aef"},"schema_version":"1.0"},"canonical_sha256":"81a22fb979b2a44d4a49253d891cdece0b5c44d825b5c5263b53a35b0b03ba14","source":{"kind":"arxiv","id":"0705.2205","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.2205","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"0705.2205v2","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.2205","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"QGRC7OLZWKSE","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"QGRC7OLZWKSE2SSJ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"QGRC7OLZ","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:QGRC7OLZWKSE2SSJEU6YSHG6ZY","target":"record","payload":{"canonical_record":{"source":{"id":"0705.2205","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-05-15T18:08:15Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"02bdd2800b14ad6462f24b634b46d64c260f3494ea7b2d65945b202f59640740","abstract_canon_sha256":"4149f1585ab38aa38ca64dbca55bd562bbf5ab26baa5ef60ee00fea15b740aef"},"schema_version":"1.0"},"canonical_sha256":"81a22fb979b2a44d4a49253d891cdece0b5c44d825b5c5263b53a35b0b03ba14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.240467Z","signature_b64":"+8c6/50PWL3caWe80Oe0Ifk4sofCwPd77fV9Gwo4AaaaSxCmBYjquMUiKUfHx+TEit2hCAZ2XQCDYV6MbKuxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81a22fb979b2a44d4a49253d891cdece0b5c44d825b5c5263b53a35b0b03ba14","last_reissued_at":"2026-05-17T23:51:24.239983Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.239983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0705.2205","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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xqwi2JregusEGTV2uhNoqTRZ5W957c9TXJEVmdJOE8IZgKOwKCDeo92km41ibYXBSt9fUfFoQ278WuU6F9TmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:02:23.313382Z"},"content_sha256":"06d01659e4a5de8b54892cf1a3d7a2b8ec910099aff74df9a52fadcf7335e62f","schema_version":"1.0","event_id":"sha256:06d01659e4a5de8b54892cf1a3d7a2b8ec910099aff74df9a52fadcf7335e62f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:QGRC7OLZWKSE2SSJEU6YSHG6ZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Nondeterministic B\\\"uchi and Streett Automata to Deterministic Parity Automata","license":"","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Nir Piterman","submitted_at":"2007-05-15T18:08:15Z","abstract_excerpt":"In this paper we revisit Safra's determinization constructions for automata on infinite words. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Determinization is used in numerous applications, such as reasoning about tree automata, satisfiability of CTL*, and realizability and synthesis of logical specifications. The upper bounds for all these applications are reduced by using the smaller deterministic automata produced by our construction. In addition, the parity acceptance conditions allows to use more efficient algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.2205","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-17T23:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYc/nw7SNTe2RdbOY+BofzkutKVBkQcYuAqu1BZW1BRKjOe6P1S1uKNQi7G0ZW7OifqvnKtKPhXe74wyb30nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:02:23.314112Z"},"content_sha256":"d29b9acfe5f5ad079063cd6a8865978235dad6d068782e841d73d7c798f1aa2b","schema_version":"1.0","event_id":"sha256:d29b9acfe5f5ad079063cd6a8865978235dad6d068782e841d73d7c798f1aa2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGRC7OLZWKSE2SSJEU6YSHG6ZY/bundle.json","state_url":"https://pith.science/pith/QGRC7OLZWKSE2SSJEU6YSHG6ZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGRC7OLZWKSE2SSJEU6YSHG6ZY/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-06T19:02:23Z","links":{"resolver":"https://pith.science/pith/QGRC7OLZWKSE2SSJEU6YSHG6ZY","bundle":"https://pith.science/pith/QGRC7OLZWKSE2SSJEU6YSHG6ZY/bundle.json","state":"https://pith.science/pith/QGRC7OLZWKSE2SSJEU6YSHG6ZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGRC7OLZWKSE2SSJEU6YSHG6ZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:QGRC7OLZWKSE2SSJEU6YSHG6ZY","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":"4149f1585ab38aa38ca64dbca55bd562bbf5ab26baa5ef60ee00fea15b740aef","cross_cats_sorted":["cs.FL"],"license":"","primary_cat":"cs.LO","submitted_at":"2007-05-15T18:08:15Z","title_canon_sha256":"02bdd2800b14ad6462f24b634b46d64c260f3494ea7b2d65945b202f59640740"},"schema_version":"1.0","source":{"id":"0705.2205","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.2205","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"0705.2205v2","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.2205","created_at":"2026-05-17T23:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"QGRC7OLZWKSE","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"QGRC7OLZWKSE2SSJ","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"QGRC7OLZ","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:d29b9acfe5f5ad079063cd6a8865978235dad6d068782e841d73d7c798f1aa2b","target":"graph","created_at":"2026-05-17T23:51:24Z","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":"In this paper we revisit Safra's determinization constructions for automata on infinite words. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Determinization is used in numerous applications, such as reasoning about tree automata, satisfiability of CTL*, and realizability and synthesis of logical specifications. The upper bounds for all these applications are reduced by using the smaller deterministic automata produced by our construction. In addition, the parity acceptance conditions allows to use more efficient algorithm","authors_text":"Nir Piterman","cross_cats":["cs.FL"],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2007-05-15T18:08:15Z","title":"From Nondeterministic B\\\"uchi and Streett Automata to Deterministic Parity Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.2205","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:06d01659e4a5de8b54892cf1a3d7a2b8ec910099aff74df9a52fadcf7335e62f","target":"record","created_at":"2026-05-17T23:51:24Z","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":"4149f1585ab38aa38ca64dbca55bd562bbf5ab26baa5ef60ee00fea15b740aef","cross_cats_sorted":["cs.FL"],"license":"","primary_cat":"cs.LO","submitted_at":"2007-05-15T18:08:15Z","title_canon_sha256":"02bdd2800b14ad6462f24b634b46d64c260f3494ea7b2d65945b202f59640740"},"schema_version":"1.0","source":{"id":"0705.2205","kind":"arxiv","version":2}},"canonical_sha256":"81a22fb979b2a44d4a49253d891cdece0b5c44d825b5c5263b53a35b0b03ba14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81a22fb979b2a44d4a49253d891cdece0b5c44d825b5c5263b53a35b0b03ba14","first_computed_at":"2026-05-17T23:51:24.239983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:24.239983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+8c6/50PWL3caWe80Oe0Ifk4sofCwPd77fV9Gwo4AaaaSxCmBYjquMUiKUfHx+TEit2hCAZ2XQCDYV6MbKuxCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:24.240467Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.2205","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06d01659e4a5de8b54892cf1a3d7a2b8ec910099aff74df9a52fadcf7335e62f","sha256:d29b9acfe5f5ad079063cd6a8865978235dad6d068782e841d73d7c798f1aa2b"],"state_sha256":"c4ab027d986af9174b56ef4525f607fda10b115600f63861a2a15ff27f7b5b26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uk40KOCELZCOLRIPexPzHYkTBHdNJiy5JqY7tqs1sznevK9UsaGnfuPai+pk9NkLwb3hGNne/U5YTN3djb1ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:02:23.318167Z","bundle_sha256":"9c95f9975249757aeb50f270226eefb40bdcc5dc09ae3c9963d2b4840c36ee13"}}