{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:GNRFFDLGAY3V4N6O3AFHDHSWJC","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":"69182883aab84a8860ec6c9d65aa3db1ca456b8d21ff78436b7d4758022d8ec2","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2021-09-19T16:16:23Z","title_canon_sha256":"9206075c0d625ae333f1095fb1a69df4809f443fdab43fe1e9b5ee6e816a5813"},"schema_version":"1.0","source":{"id":"2109.09155","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.09155","created_at":"2026-07-05T03:56:16Z"},{"alias_kind":"arxiv_version","alias_value":"2109.09155v2","created_at":"2026-07-05T03:56:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09155","created_at":"2026-07-05T03:56:16Z"},{"alias_kind":"pith_short_12","alias_value":"GNRFFDLGAY3V","created_at":"2026-07-05T03:56:16Z"},{"alias_kind":"pith_short_16","alias_value":"GNRFFDLGAY3V4N6O","created_at":"2026-07-05T03:56:16Z"},{"alias_kind":"pith_short_8","alias_value":"GNRFFDLG","created_at":"2026-07-05T03:56:16Z"}],"graph_snapshots":[{"event_id":"sha256:f9b175f2c969ca93ca754d327bab0b2382df722c4077c84c28d02084bf40a41f","target":"graph","created_at":"2026-07-05T03:56:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.09155/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results.\n  $\\textit{Complement:}$ There is a language $L$ recognised by an $n$-state UFA such that the complement language $\\overline{L}$ requires NFAs with $n^{\\tilde{\\Omega}(\\log n)}$ states. This improves on a lower bound by Raskin.\n  $\\textit{Union:}$ There are languages $L_1$, $L_2$ recognised by $n$-state UFAs such that the union $L_1\\cup L_2$ requires UFAs with $n^{\\tilde{\\Omega}(\\log n)}$ states.\n  $\\textit{Separation:}$ There is a language $L","authors_text":"Mika G\\\"o\\\"os, Stefan Kiefer, Weiqiang Yuan","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2021-09-19T16:16:23Z","title":"Lower Bounds for Unambiguous Automata via Communication Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09155","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:992fa3db88bf9fa779eeb3fcd43a0134d98198e490bee3530e574279db677900","target":"record","created_at":"2026-07-05T03:56:16Z","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":"69182883aab84a8860ec6c9d65aa3db1ca456b8d21ff78436b7d4758022d8ec2","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2021-09-19T16:16:23Z","title_canon_sha256":"9206075c0d625ae333f1095fb1a69df4809f443fdab43fe1e9b5ee6e816a5813"},"schema_version":"1.0","source":{"id":"2109.09155","kind":"arxiv","version":2}},"canonical_sha256":"3362528d6606375e37ced80a719e5648aa496deab8a26d75c2811497da0aedd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3362528d6606375e37ced80a719e5648aa496deab8a26d75c2811497da0aedd9","first_computed_at":"2026-07-05T03:56:16.248425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:56:16.248425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GORtCxyPOUqvwCy6rM2X9ordS9BWeBBn+Ldqh9zWjbHOyZqw7CY651cq6aIIyUvldYyBsdi1gYET47ltxwS5Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:56:16.248927Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.09155","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:992fa3db88bf9fa779eeb3fcd43a0134d98198e490bee3530e574279db677900","sha256:f9b175f2c969ca93ca754d327bab0b2382df722c4077c84c28d02084bf40a41f"],"state_sha256":"9a099a45c6032d89f930c648775003caa745ba7dcbe6b19b1fd4d5f97f86dab8"}