{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:R52O5K3ZRGC336VZDYGP6SLMSU","short_pith_number":"pith:R52O5K3Z","schema_version":"1.0","canonical_sha256":"8f74eeab798985bdfab91e0cff496c95013ad49bb0c5480b4d7e94f2269b7bf3","source":{"kind":"arxiv","id":"1101.1841","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.1841","created_at":"2026-05-18T02:22:59.322037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1841v2","created_at":"2026-05-18T02:22:59.322037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1841","created_at":"2026-05-18T02:22:59.322037+00:00"},{"alias_kind":"pith_short_12","alias_value":"R52O5K3ZRGC3","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"R52O5K3ZRGC336VZ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"R52O5K3Z","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU","json":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU.json","graph_json":"https://pith.science/api/pith-number/R52O5K3ZRGC336VZDYGP6SLMSU/graph.json","events_json":"https://pith.science/api/pith-number/R52O5K3ZRGC336VZDYGP6SLMSU/events.json","paper":"https://pith.science/paper/R52O5K3Z"},"agent_actions":{"view_html":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU","download_json":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU.json","view_paper":"https://pith.science/paper/R52O5K3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1841&json=true","fetch_graph":"https://pith.science/api/pith-number/R52O5K3ZRGC336VZDYGP6SLMSU/graph.json","fetch_events":"https://pith.science/api/pith-number/R52O5K3ZRGC336VZDYGP6SLMSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/action/storage_attestation","attest_author":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/action/author_attestation","sign_citation":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/action/citation_signature","submit_replication":"https://pith.science/pith/R52O5K3ZRGC336VZDYGP6SLMSU/action/replication_record"}},"created_at":"2026-05-18T02:22:59.322037+00:00","updated_at":"2026-05-18T02:22:59.322037+00:00"}