{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JN2HNXYUVMJSPM3HVZM27QASEU","short_pith_number":"pith:JN2HNXYU","canonical_record":{"source":{"id":"1410.2737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-10T10:56:02Z","cross_cats_sorted":[],"title_canon_sha256":"b8b7f2727a8d6fdce3fa30b14692aced500126af78327fe60f60630a35a71ba1","abstract_canon_sha256":"fcc7c6ceb2842f3765237d404c356948607ce01d6920de425bf84091bd594190"},"schema_version":"1.0"},"canonical_sha256":"4b7476df14ab1327b367ae59afc012251149f99645f33c6232325ab8c229d08e","source":{"kind":"arxiv","id":"1410.2737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2737","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2737v2","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2737","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"pith_short_12","alias_value":"JN2HNXYUVMJS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JN2HNXYUVMJSPM3H","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JN2HNXYU","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JN2HNXYUVMJSPM3HVZM27QASEU","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-10T10:56:02Z","cross_cats_sorted":[],"title_canon_sha256":"b8b7f2727a8d6fdce3fa30b14692aced500126af78327fe60f60630a35a71ba1","abstract_canon_sha256":"fcc7c6ceb2842f3765237d404c356948607ce01d6920de425bf84091bd594190"},"schema_version":"1.0"},"canonical_sha256":"4b7476df14ab1327b367ae59afc012251149f99645f33c6232325ab8c229d08e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:31.541055Z","signature_b64":"OpbxlAuCuzqU0LdtbfNNwgtWeYQUfmoKPdgT0bZTgTx/ScZBOpjWV38pAf4679GXOySchVVSEN6aooanpazmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b7476df14ab1327b367ae59afc012251149f99645f33c6232325ab8c229d08e","last_reissued_at":"2026-05-18T02:39:31.540624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:31.540624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2737","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-05-18T02:39:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9iDp3gXV8g5xwZB9U4djdOrlljStPIZEZOLOZhZkDKfESJa2gRkcVd9HCFtKrjrgRbiR8Whp0ITM6fugndlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:04:47.409167Z"},"content_sha256":"67cef3d2c2f6534b0acc3e050247acc0344ffa2c7d3a6bbf2a09f16d348da652","schema_version":"1.0","event_id":"sha256:67cef3d2c2f6534b0acc3e050247acc0344ffa2c7d3a6bbf2a09f16d348da652"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JN2HNXYUVMJSPM3HVZM27QASEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Bachmeier, Maximilian Schlund, Michael Luttenberger","submitted_at":"2014-10-10T10:56:02Z","abstract_excerpt":"We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of $2^{\\mathcal{O}(n)}$ on the size of nondeterministic finite automata (NFAs) representing the subword closure of a CFG of size $n$. (2) We present a family of CFGs for which the minimal deterministic finite automata representing their subword closure matches the upper-bound of $2^{2^{\\mathcal{O}(n)}}$ following from (1). Furthermore, we prove that the inequivalence problem for NFAs representing su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2737","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":""},"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-18T02:39:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qxE93mHSFQ3Ds9KRn5p9yY72EnzIu9nwv9o2tRNIlukPdRvlopoIETzB7yMqa6tMnYNzMKhOPecfAPf3FF+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:04:47.409897Z"},"content_sha256":"8e6f0824422b85b526bcba6d07393996d696828c498706d6113ff16de54b4c70","schema_version":"1.0","event_id":"sha256:8e6f0824422b85b526bcba6d07393996d696828c498706d6113ff16de54b4c70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JN2HNXYUVMJSPM3HVZM27QASEU/bundle.json","state_url":"https://pith.science/pith/JN2HNXYUVMJSPM3HVZM27QASEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JN2HNXYUVMJSPM3HVZM27QASEU/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-05-28T00:04:47Z","links":{"resolver":"https://pith.science/pith/JN2HNXYUVMJSPM3HVZM27QASEU","bundle":"https://pith.science/pith/JN2HNXYUVMJSPM3HVZM27QASEU/bundle.json","state":"https://pith.science/pith/JN2HNXYUVMJSPM3HVZM27QASEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JN2HNXYUVMJSPM3HVZM27QASEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JN2HNXYUVMJSPM3HVZM27QASEU","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":"fcc7c6ceb2842f3765237d404c356948607ce01d6920de425bf84091bd594190","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-10T10:56:02Z","title_canon_sha256":"b8b7f2727a8d6fdce3fa30b14692aced500126af78327fe60f60630a35a71ba1"},"schema_version":"1.0","source":{"id":"1410.2737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2737","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2737v2","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2737","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"pith_short_12","alias_value":"JN2HNXYUVMJS","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JN2HNXYUVMJSPM3H","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JN2HNXYU","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:8e6f0824422b85b526bcba6d07393996d696828c498706d6113ff16de54b4c70","target":"graph","created_at":"2026-05-18T02:39:31Z","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":"We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of $2^{\\mathcal{O}(n)}$ on the size of nondeterministic finite automata (NFAs) representing the subword closure of a CFG of size $n$. (2) We present a family of CFGs for which the minimal deterministic finite automata representing their subword closure matches the upper-bound of $2^{2^{\\mathcal{O}(n)}}$ following from (1). Furthermore, we prove that the inequivalence problem for NFAs representing su","authors_text":"Georg Bachmeier, Maximilian Schlund, Michael Luttenberger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-10T10:56:02Z","title":"Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2737","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:67cef3d2c2f6534b0acc3e050247acc0344ffa2c7d3a6bbf2a09f16d348da652","target":"record","created_at":"2026-05-18T02:39:31Z","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":"fcc7c6ceb2842f3765237d404c356948607ce01d6920de425bf84091bd594190","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-10-10T10:56:02Z","title_canon_sha256":"b8b7f2727a8d6fdce3fa30b14692aced500126af78327fe60f60630a35a71ba1"},"schema_version":"1.0","source":{"id":"1410.2737","kind":"arxiv","version":2}},"canonical_sha256":"4b7476df14ab1327b367ae59afc012251149f99645f33c6232325ab8c229d08e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b7476df14ab1327b367ae59afc012251149f99645f33c6232325ab8c229d08e","first_computed_at":"2026-05-18T02:39:31.540624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:31.540624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OpbxlAuCuzqU0LdtbfNNwgtWeYQUfmoKPdgT0bZTgTx/ScZBOpjWV38pAf4679GXOySchVVSEN6aooanpazmAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:31.541055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67cef3d2c2f6534b0acc3e050247acc0344ffa2c7d3a6bbf2a09f16d348da652","sha256:8e6f0824422b85b526bcba6d07393996d696828c498706d6113ff16de54b4c70"],"state_sha256":"c62d0ad43f7b458ca755b293ab5cb07d4c7bdd00ca7cf6d94040029a78798c41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxXSls8yST354GIrJ5iEnOZ2NUHQ+1gn0uc0wU+ZpfHIJGnt9tKZqPtccvwDLeuWjgBjfPgbcSD8xEEx778jDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:04:47.413849Z","bundle_sha256":"bd0153d61d3ddc0c6defa2d33c305b7f2f95fa9a34dbbad29231d95fdaec3312"}}