{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:H2YRTOIPHYYF4U4TRUL7JWG53G","short_pith_number":"pith:H2YRTOIP","schema_version":"1.0","canonical_sha256":"3eb119b90f3e305e53938d17f4d8ddd990984fea17546a7cb5b60c4fec71a516","source":{"kind":"arxiv","id":"1401.4025","version":3},"attestation_state":"computed","paper":{"title":"Unambiguous Buchi is weak","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Henryk Michalewski, Micha{\\l} Skrzypczak","submitted_at":"2014-01-16T13:45:48Z","abstract_excerpt":"A non-deterministic automaton running on infinite trees is unambiguous if it has at most one accepting run on every tree. The class of languages recognisable by unambiguous tree automata is still not well-understood. In particular, decidability of the problem whether a given language is recognisable by some unambiguous automaton is open. Moreover, there are no known upper bounds on the descriptive complexity of unambiguous languages among all regular tree languages.\n  In this paper we show the following complexity collapse: if a non-deterministic parity tree automaton $A$ is unambiguous and it"},"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":"1401.4025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-16T13:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"dadd8b7a127ae1237dfbf628efb87338eaceb7bbfd7d3084dee899a04fe7bfd7","abstract_canon_sha256":"6e4aa35f0f164742c2bd39d038f814c1ec756d82bd3de0f2104ebe7c62b6dea6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:24.191203Z","signature_b64":"MrWCBJ8Zyw4kII3y7HephJEv8Ic6cAHtKsIiLY/JzmXiWGq7RdHTJW03+juv912yQGxFLj3bXpqAbBFJ4WvGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eb119b90f3e305e53938d17f4d8ddd990984fea17546a7cb5b60c4fec71a516","last_reissued_at":"2026-05-18T01:15:24.190472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:24.190472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unambiguous Buchi is weak","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Henryk Michalewski, Micha{\\l} Skrzypczak","submitted_at":"2014-01-16T13:45:48Z","abstract_excerpt":"A non-deterministic automaton running on infinite trees is unambiguous if it has at most one accepting run on every tree. The class of languages recognisable by unambiguous tree automata is still not well-understood. In particular, decidability of the problem whether a given language is recognisable by some unambiguous automaton is open. Moreover, there are no known upper bounds on the descriptive complexity of unambiguous languages among all regular tree languages.\n  In this paper we show the following complexity collapse: if a non-deterministic parity tree automaton $A$ is unambiguous and it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4025","kind":"arxiv","version":3},"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":"1401.4025","created_at":"2026-05-18T01:15:24.190604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4025v3","created_at":"2026-05-18T01:15:24.190604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4025","created_at":"2026-05-18T01:15:24.190604+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2YRTOIPHYYF","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2YRTOIPHYYF4U4T","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2YRTOIP","created_at":"2026-05-18T12:28:30.664211+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/H2YRTOIPHYYF4U4TRUL7JWG53G","json":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G.json","graph_json":"https://pith.science/api/pith-number/H2YRTOIPHYYF4U4TRUL7JWG53G/graph.json","events_json":"https://pith.science/api/pith-number/H2YRTOIPHYYF4U4TRUL7JWG53G/events.json","paper":"https://pith.science/paper/H2YRTOIP"},"agent_actions":{"view_html":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G","download_json":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G.json","view_paper":"https://pith.science/paper/H2YRTOIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4025&json=true","fetch_graph":"https://pith.science/api/pith-number/H2YRTOIPHYYF4U4TRUL7JWG53G/graph.json","fetch_events":"https://pith.science/api/pith-number/H2YRTOIPHYYF4U4TRUL7JWG53G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/action/storage_attestation","attest_author":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/action/author_attestation","sign_citation":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/action/citation_signature","submit_replication":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/action/replication_record"}},"created_at":"2026-05-18T01:15:24.190604+00:00","updated_at":"2026-05-18T01:15:24.190604+00:00"}