{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GNRFFDLGAY3V4N6O3AFHDHSWJC","short_pith_number":"pith:GNRFFDLG","schema_version":"1.0","canonical_sha256":"3362528d6606375e37ced80a719e5648aa496deab8a26d75c2811497da0aedd9","source":{"kind":"arxiv","id":"2109.09155","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds for Unambiguous Automata via Communication Complexity","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Mika G\\\"o\\\"os, Stefan Kiefer, Weiqiang Yuan","submitted_at":"2021-09-19T16:16:23Z","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"},"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":"2109.09155","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2021-09-19T16:16:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9206075c0d625ae333f1095fb1a69df4809f443fdab43fe1e9b5ee6e816a5813","abstract_canon_sha256":"69182883aab84a8860ec6c9d65aa3db1ca456b8d21ff78436b7d4758022d8ec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:16.248927Z","signature_b64":"GORtCxyPOUqvwCy6rM2X9ordS9BWeBBn+Ldqh9zWjbHOyZqw7CY651cq6aIIyUvldYyBsdi1gYET47ltxwS5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3362528d6606375e37ced80a719e5648aa496deab8a26d75c2811497da0aedd9","last_reissued_at":"2026-07-05T03:56:16.248425Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:16.248425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Unambiguous Automata via Communication Complexity","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Mika G\\\"o\\\"os, Stefan Kiefer, Weiqiang Yuan","submitted_at":"2021-09-19T16:16:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09155","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.09155/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.09155","created_at":"2026-07-05T03:56:16.248487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09155v2","created_at":"2026-07-05T03:56:16.248487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09155","created_at":"2026-07-05T03:56:16.248487+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNRFFDLGAY3V","created_at":"2026-07-05T03:56:16.248487+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNRFFDLGAY3V4N6O","created_at":"2026-07-05T03:56:16.248487+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNRFFDLG","created_at":"2026-07-05T03:56:16.248487+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/GNRFFDLGAY3V4N6O3AFHDHSWJC","json":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC.json","graph_json":"https://pith.science/api/pith-number/GNRFFDLGAY3V4N6O3AFHDHSWJC/graph.json","events_json":"https://pith.science/api/pith-number/GNRFFDLGAY3V4N6O3AFHDHSWJC/events.json","paper":"https://pith.science/paper/GNRFFDLG"},"agent_actions":{"view_html":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC","download_json":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC.json","view_paper":"https://pith.science/paper/GNRFFDLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09155&json=true","fetch_graph":"https://pith.science/api/pith-number/GNRFFDLGAY3V4N6O3AFHDHSWJC/graph.json","fetch_events":"https://pith.science/api/pith-number/GNRFFDLGAY3V4N6O3AFHDHSWJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/action/storage_attestation","attest_author":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/action/author_attestation","sign_citation":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/action/citation_signature","submit_replication":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/action/replication_record"}},"created_at":"2026-07-05T03:56:16.248487+00:00","updated_at":"2026-07-05T03:56:16.248487+00:00"}