{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:GNRFFDLGAY3V4N6O3AFHDHSWJC","short_pith_number":"pith:GNRFFDLG","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"},"canonical_sha256":"3362528d6606375e37ced80a719e5648aa496deab8a26d75c2811497da0aedd9","source":{"kind":"arxiv","id":"2109.09155","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:GNRFFDLGAY3V4N6O3AFHDHSWJC","target":"record","payload":{"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"},"canonical_sha256":"3362528d6606375e37ced80a719e5648aa496deab8a26d75c2811497da0aedd9","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"},"source_kind":"arxiv","source_id":"2109.09155","source_version":2,"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-07-05T03:56:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/pxHVKSjWJ12uLYO8k9nK8SxnFjxPP5PDwg/C1Q9RzFYXt0UGwpzLTJiYgbzrHF6TI5/uQPs9Vgjq9Md9UZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T22:22:28.866883Z"},"content_sha256":"992fa3db88bf9fa779eeb3fcd43a0134d98198e490bee3530e574279db677900","schema_version":"1.0","event_id":"sha256:992fa3db88bf9fa779eeb3fcd43a0134d98198e490bee3530e574279db677900"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:GNRFFDLGAY3V4N6O3AFHDHSWJC","target":"graph","payload":{"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"},"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-07-05T03:56:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZwUAMZ7BzVh9Bz2PmBwvzSIw3o2cNbAoEC5OVV/SrdzMv6DnLg5T9LI4FYp8VzIxVwDshOl8b9UbQzNlgyeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T22:22:28.867417Z"},"content_sha256":"f9b175f2c969ca93ca754d327bab0b2382df722c4077c84c28d02084bf40a41f","schema_version":"1.0","event_id":"sha256:f9b175f2c969ca93ca754d327bab0b2382df722c4077c84c28d02084bf40a41f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/bundle.json","state_url":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/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-08-20T22:22:28Z","links":{"resolver":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC","bundle":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/bundle.json","state":"https://pith.science/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNRFFDLGAY3V4N6O3AFHDHSWJC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OlZgi5jlgiK5s2wgHAQg970pFjxqG2ewnwBcAsBQHWUJxyuwRYLaJ0p+YC3N4sg/XsyIvwN/jKQE8wDVW5SRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T22:22:28.872692Z","bundle_sha256":"2db0f0b60f0b39dc9857d4bb05693f23243617dc3ed10ee4b663a0662da83f94"}}