{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z5L5VG6RGNB6BFGY3CBIQBCQ5D","short_pith_number":"pith:Z5L5VG6R","schema_version":"1.0","canonical_sha256":"cf57da9bd13343e094d8d882880450e8f43c54531fa39ba96072c2711918ad65","source":{"kind":"arxiv","id":"1803.06163","version":4},"attestation_state":"computed","paper":{"title":"Unambiguous languages exhaust the index hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Micha{\\l} Skrzypczak","submitted_at":"2018-03-16T11:08:07Z","abstract_excerpt":"This work is a study of the expressive power of unambiguity in the case of automata over infinite trees. An automaton is called unambiguous if it has at most one accepting run on every input, the language of such an automaton is called an unambiguous language. It is known that not every regular language of infinite trees is unambiguous. Except that, very little is known about which regular tree languages are unambiguous.\n  This paper answers the question whether unambiguous languages are of bounded complexity among all regular tree languages. The notion of complexity is the canonical one, call"},"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":"1803.06163","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-03-16T11:08:07Z","cross_cats_sorted":[],"title_canon_sha256":"2cffa95a6fbf805637f2eb4b4b29505f511b5bdb1157e698df744c5da5adc070","abstract_canon_sha256":"bfead4cc141b5b6856183cdeaec8569a97cd9e4831e42ab366f8f4a0adad8e44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:59.500562Z","signature_b64":"4XYwgQ1bbZcknSK8BZjrdhdndp3LvYHF9twLElS1zrD8dIIK9Hvg6lcNhKsyeneGQt1rOWS6MGVegDxEmYWECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf57da9bd13343e094d8d882880450e8f43c54531fa39ba96072c2711918ad65","last_reissued_at":"2026-05-18T00:17:59.499824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:59.499824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unambiguous languages exhaust the index hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Micha{\\l} Skrzypczak","submitted_at":"2018-03-16T11:08:07Z","abstract_excerpt":"This work is a study of the expressive power of unambiguity in the case of automata over infinite trees. An automaton is called unambiguous if it has at most one accepting run on every input, the language of such an automaton is called an unambiguous language. It is known that not every regular language of infinite trees is unambiguous. Except that, very little is known about which regular tree languages are unambiguous.\n  This paper answers the question whether unambiguous languages are of bounded complexity among all regular tree languages. The notion of complexity is the canonical one, call"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06163","kind":"arxiv","version":4},"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":"1803.06163","created_at":"2026-05-18T00:17:59.499936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06163v4","created_at":"2026-05-18T00:17:59.499936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06163","created_at":"2026-05-18T00:17:59.499936+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5L5VG6RGNB6","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5L5VG6RGNB6BFGY","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5L5VG6R","created_at":"2026-05-18T12:33:04.347982+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/Z5L5VG6RGNB6BFGY3CBIQBCQ5D","json":"https://pith.science/pith/Z5L5VG6RGNB6BFGY3CBIQBCQ5D.json","graph_json":"https://pith.science/api/pith-number/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/graph.json","events_json":"https://pith.science/api/pith-number/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/events.json","paper":"https://pith.science/paper/Z5L5VG6R"},"agent_actions":{"view_html":"https://pith.science/pith/Z5L5VG6RGNB6BFGY3CBIQBCQ5D","download_json":"https://pith.science/pith/Z5L5VG6RGNB6BFGY3CBIQBCQ5D.json","view_paper":"https://pith.science/paper/Z5L5VG6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06163&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/action/storage_attestation","attest_author":"https://pith.science/pith/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/action/author_attestation","sign_citation":"https://pith.science/pith/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/action/citation_signature","submit_replication":"https://pith.science/pith/Z5L5VG6RGNB6BFGY3CBIQBCQ5D/action/replication_record"}},"created_at":"2026-05-18T00:17:59.499936+00:00","updated_at":"2026-05-18T00:17:59.499936+00:00"}