{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:R52O5K3ZRGC336VZDYGP6SLMSU","short_pith_number":"pith:R52O5K3Z","canonical_record":{"source":{"id":"1101.1841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-10T15:09:44Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"381e9edf9b625367ef8008de1eee36b973023a1fa46c63e426458cc2d2af8d22","abstract_canon_sha256":"a5b052378f4533c769fecc21b26a543e9b297a0ca8e810eb23991ba70b7725ec"},"schema_version":"1.0"},"canonical_sha256":"8f74eeab798985bdfab91e0cff496c95013ad49bb0c5480b4d7e94f2269b7bf3","source":{"kind":"arxiv","id":"1101.1841","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1841","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1841v2","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1841","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"R52O5K3ZRGC3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"R52O5K3ZRGC336VZ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"R52O5K3Z","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:R52O5K3ZRGC336VZDYGP6SLMSU","target":"record","payload":{"canonical_record":{"source":{"id":"1101.1841","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-10T15:09:44Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"381e9edf9b625367ef8008de1eee36b973023a1fa46c63e426458cc2d2af8d22","abstract_canon_sha256":"a5b052378f4533c769fecc21b26a543e9b297a0ca8e810eb23991ba70b7725ec"},"schema_version":"1.0"},"canonical_sha256":"8f74eeab798985bdfab91e0cff496c95013ad49bb0c5480b4d7e94f2269b7bf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:59.322543Z","signature_b64":"G42wNfzu/KUvGB5ozSVrYXoNrBzo0KG2WPPZLYE11JAl/hN9/8wS1C5m5h+TDJh26f644JIZDOIc6ZFVs1M/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f74eeab798985bdfab91e0cff496c95013ad49bb0c5480b4d7e94f2269b7bf3","last_reissued_at":"2026-05-18T02:22:59.321953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:59.321953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.1841","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:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fjd39u+ZoR9KUmKfOYODr0zw10DbXQhYG9SE64RnXzv4szcgFatmg3+oxUFFpyeLQmKhTEYf9wdpptw4JkFKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:55:17.211298Z"},"content_sha256":"992dcd17bbe7d72aff2450784ee86feef33dcd0368378a929d3dc1f4e781c3a3","schema_version":"1.0","event_id":"sha256:992dcd17bbe7d72aff2450784ee86feef33dcd0368378a929d3dc1f4e781c3a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:R52O5K3ZRGC336VZDYGP6SLMSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Determinization of $\\omega$-automata unified","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Hrishikesh Karmarkar, Supratik Chakraborty","submitted_at":"2011-01-10T15:09:44Z","abstract_excerpt":"We describe a uniform construction for converting $\\omega$-automata with arbitrary acceptance conditions (based on the notion of infinity sets i.e. the set of states visited infinitely often in a run of the automaton) to equivalent deterministic parity automata (DPW). Given a non-deterministic automaton with $n$ states, our construction gives a DPW with at most $2^{O(n^2 \\log n)}$ states and $O(n^2)$ parity indices. The corresponding bounds when the original automaton is deterministic are O(n!) and O(n), respectively. Our algorithm gives better asymptotic bounds on the number of states and par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1841","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:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0eP8q4unRrpqi5YBLZEUPfQBZnes4xJmnYg21xoSVer4n+8DdSfcvsL0KV5nvXqluORX+VzWMvKc3Bk9luoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:55:17.211665Z"},"content_sha256":"63d0f4eb4d74387fb97ec28f38809db046bfc41c7f74c21d2f073b2c3abad353","schema_version":"1.0","event_id":"sha256:63d0f4eb4d74387fb97ec28f38809db046bfc41c7f74c21d2f073b2c3abad353"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/bundle.json","state_url":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R52O5K3ZRGC336VZDYGP6SLMSU/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-24T16:55:17Z","links":{"resolver":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU","bundle":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/bundle.json","state":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R52O5K3ZRGC336VZDYGP6SLMSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:R52O5K3ZRGC336VZDYGP6SLMSU","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":"a5b052378f4533c769fecc21b26a543e9b297a0ca8e810eb23991ba70b7725ec","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-10T15:09:44Z","title_canon_sha256":"381e9edf9b625367ef8008de1eee36b973023a1fa46c63e426458cc2d2af8d22"},"schema_version":"1.0","source":{"id":"1101.1841","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1841","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1841v2","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1841","created_at":"2026-05-18T02:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"R52O5K3ZRGC3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"R52O5K3ZRGC336VZ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"R52O5K3Z","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:63d0f4eb4d74387fb97ec28f38809db046bfc41c7f74c21d2f073b2c3abad353","target":"graph","created_at":"2026-05-18T02:22:59Z","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":"We describe a uniform construction for converting $\\omega$-automata with arbitrary acceptance conditions (based on the notion of infinity sets i.e. the set of states visited infinitely often in a run of the automaton) to equivalent deterministic parity automata (DPW). Given a non-deterministic automaton with $n$ states, our construction gives a DPW with at most $2^{O(n^2 \\log n)}$ states and $O(n^2)$ parity indices. The corresponding bounds when the original automaton is deterministic are O(n!) and O(n), respectively. Our algorithm gives better asymptotic bounds on the number of states and par","authors_text":"Hrishikesh Karmarkar, Supratik Chakraborty","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-10T15:09:44Z","title":"Determinization of $\\omega$-automata unified"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1841","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:992dcd17bbe7d72aff2450784ee86feef33dcd0368378a929d3dc1f4e781c3a3","target":"record","created_at":"2026-05-18T02:22:59Z","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":"a5b052378f4533c769fecc21b26a543e9b297a0ca8e810eb23991ba70b7725ec","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-01-10T15:09:44Z","title_canon_sha256":"381e9edf9b625367ef8008de1eee36b973023a1fa46c63e426458cc2d2af8d22"},"schema_version":"1.0","source":{"id":"1101.1841","kind":"arxiv","version":2}},"canonical_sha256":"8f74eeab798985bdfab91e0cff496c95013ad49bb0c5480b4d7e94f2269b7bf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f74eeab798985bdfab91e0cff496c95013ad49bb0c5480b4d7e94f2269b7bf3","first_computed_at":"2026-05-18T02:22:59.321953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:59.321953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G42wNfzu/KUvGB5ozSVrYXoNrBzo0KG2WPPZLYE11JAl/hN9/8wS1C5m5h+TDJh26f644JIZDOIc6ZFVs1M/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:59.322543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1841","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:992dcd17bbe7d72aff2450784ee86feef33dcd0368378a929d3dc1f4e781c3a3","sha256:63d0f4eb4d74387fb97ec28f38809db046bfc41c7f74c21d2f073b2c3abad353"],"state_sha256":"e65f4be93396e59bf40c9abab7e179678c4313208064d644305f4fe611c8fe35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yQ6b84WtlMTEQnCk7nNXbK44/z7q0VtyapanBXupSyorwva8TxeyhUEhdIcdmPF0AJcaewfj07oBunJ0vKR8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:55:17.213632Z","bundle_sha256":"2464ebe374a4238e946d9d3331d847cda066a688ac2151875ac89b34f9eab810"}}