{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H2YRTOIPHYYF4U4TRUL7JWG53G","short_pith_number":"pith:H2YRTOIP","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"},"canonical_sha256":"3eb119b90f3e305e53938d17f4d8ddd990984fea17546a7cb5b60c4fec71a516","source":{"kind":"arxiv","id":"1401.4025","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4025","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4025v3","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4025","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"pith_short_12","alias_value":"H2YRTOIPHYYF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H2YRTOIPHYYF4U4T","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H2YRTOIP","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H2YRTOIPHYYF4U4TRUL7JWG53G","target":"record","payload":{"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"},"canonical_sha256":"3eb119b90f3e305e53938d17f4d8ddd990984fea17546a7cb5b60c4fec71a516","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"},"source_kind":"arxiv","source_id":"1401.4025","source_version":3,"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-18T01:15:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWA1BnhW+CrzlQj9n372/cAIJ5P2Ugn+GYEIXOlktM5UjIKXSPIiHwyYhuYX2cXQRm1cKnNVs+grRPAmwjZMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:53:56.057790Z"},"content_sha256":"5ae24ac6d40a524610226ed2cb84f2e2fa29d144fb7e13c43665d44b0acfcbda","schema_version":"1.0","event_id":"sha256:5ae24ac6d40a524610226ed2cb84f2e2fa29d144fb7e13c43665d44b0acfcbda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H2YRTOIPHYYF4U4TRUL7JWG53G","target":"graph","payload":{"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"},"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-18T01:15:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38KDlDzeG//dVKQcsUbd3Tew+FfnIpAlBqMey5RW4P50ny7gpdVw2Ru795B+PM+iY/LzF++ruL76TGjs/VKxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:53:56.058133Z"},"content_sha256":"1578745eb04dc50b4f2d8e78a7f2ddd86fd660cd1b27a7055a7a753d169517c0","schema_version":"1.0","event_id":"sha256:1578745eb04dc50b4f2d8e78a7f2ddd86fd660cd1b27a7055a7a753d169517c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/bundle.json","state_url":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/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-03T22:53:56Z","links":{"resolver":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G","bundle":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/bundle.json","state":"https://pith.science/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2YRTOIPHYYF4U4TRUL7JWG53G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H2YRTOIPHYYF4U4TRUL7JWG53G","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":"6e4aa35f0f164742c2bd39d038f814c1ec756d82bd3de0f2104ebe7c62b6dea6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-16T13:45:48Z","title_canon_sha256":"dadd8b7a127ae1237dfbf628efb87338eaceb7bbfd7d3084dee899a04fe7bfd7"},"schema_version":"1.0","source":{"id":"1401.4025","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4025","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4025v3","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4025","created_at":"2026-05-18T01:15:24Z"},{"alias_kind":"pith_short_12","alias_value":"H2YRTOIPHYYF","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H2YRTOIPHYYF4U4T","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H2YRTOIP","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:1578745eb04dc50b4f2d8e78a7f2ddd86fd660cd1b27a7055a7a753d169517c0","target":"graph","created_at":"2026-05-18T01:15: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":"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","authors_text":"Henryk Michalewski, Micha{\\l} Skrzypczak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-16T13:45:48Z","title":"Unambiguous Buchi is weak"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4025","kind":"arxiv","version":3},"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:5ae24ac6d40a524610226ed2cb84f2e2fa29d144fb7e13c43665d44b0acfcbda","target":"record","created_at":"2026-05-18T01:15: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":"6e4aa35f0f164742c2bd39d038f814c1ec756d82bd3de0f2104ebe7c62b6dea6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-16T13:45:48Z","title_canon_sha256":"dadd8b7a127ae1237dfbf628efb87338eaceb7bbfd7d3084dee899a04fe7bfd7"},"schema_version":"1.0","source":{"id":"1401.4025","kind":"arxiv","version":3}},"canonical_sha256":"3eb119b90f3e305e53938d17f4d8ddd990984fea17546a7cb5b60c4fec71a516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3eb119b90f3e305e53938d17f4d8ddd990984fea17546a7cb5b60c4fec71a516","first_computed_at":"2026-05-18T01:15:24.190472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:24.190472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrWCBJ8Zyw4kII3y7HephJEv8Ic6cAHtKsIiLY/JzmXiWGq7RdHTJW03+juv912yQGxFLj3bXpqAbBFJ4WvGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:24.191203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4025","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ae24ac6d40a524610226ed2cb84f2e2fa29d144fb7e13c43665d44b0acfcbda","sha256:1578745eb04dc50b4f2d8e78a7f2ddd86fd660cd1b27a7055a7a753d169517c0"],"state_sha256":"3c4a582f8cfc14472a86a7395ab612b9b79efc13b070690eeaf6e16145198f1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJZl+izFO1nEjuQnN4N4ByXakTU8nn6JqOh/ICWzsLbTsEx3IRT2mpXdHrEL1Oq689YJ+Jy40W8jULpTcyRaBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:53:56.060050Z","bundle_sha256":"0ca088d4576e86ae4128bc439b87d33fb2bfdec1e755b9e0b6c2780c9b44040e"}}