{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RLICFDDUOLKA5DH2NRNAKL7XAY","short_pith_number":"pith:RLICFDDU","canonical_record":{"source":{"id":"1212.1346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-12-06T15:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"f57c98433c03a9aaeeceae75524c9523709fc4de978e42009997450be7339bfb","abstract_canon_sha256":"7116e57baf53597beca4f162fbbfbdd239810d253ceeb5c005019aca907e4524"},"schema_version":"1.0"},"canonical_sha256":"8ad0228c7472d40e8cfa6c5a052ff7061f54c2e1864436e04f8206e066ebc8df","source":{"kind":"arxiv","id":"1212.1346","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1346","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1346v2","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1346","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"RLICFDDUOLKA","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RLICFDDUOLKA5DH2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RLICFDDU","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RLICFDDUOLKA5DH2NRNAKL7XAY","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-12-06T15:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"f57c98433c03a9aaeeceae75524c9523709fc4de978e42009997450be7339bfb","abstract_canon_sha256":"7116e57baf53597beca4f162fbbfbdd239810d253ceeb5c005019aca907e4524"},"schema_version":"1.0"},"canonical_sha256":"8ad0228c7472d40e8cfa6c5a052ff7061f54c2e1864436e04f8206e066ebc8df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:45.717800Z","signature_b64":"NHLIu33fRfm+6xmY2U4ib97uc3jAX1cL9MX/JoOryaV1nESWGDxasQdTaQwJ4MfA3+F2EZU5KGcr8Cj3BOGAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ad0228c7472d40e8cfa6c5a052ff7061f54c2e1864436e04f8206e066ebc8df","last_reissued_at":"2026-05-18T03:38:45.717098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:45.717098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1346","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-18T03:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YPr8dDdSvvJtc2h56WMG9zPl2W26b4niXj0c+zFbf1D8NoVe8o/mZkMGs9mm/2Ey8peS5NV6eQRDt28T7CoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:18.638476Z"},"content_sha256":"018a1563de666869fbcd412402c77f95389640780d8d9cf02314ca011a88aa3b","schema_version":"1.0","event_id":"sha256:018a1563de666869fbcd412402c77f95389640780d8d9cf02314ca011a88aa3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RLICFDDUOLKA5DH2NRNAKL7XAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki","submitted_at":"2012-12-06T15:15:17Z","abstract_excerpt":"We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a descriptional complexity point of view.\n  We prove that for each one-way nondeterministic automaton with $n$ states there exist Parikh equivalent one-way and two-way deterministic automata with $e^{O(\\sqrt{n \\ln n})}$ and $p(n)$ states, respectively, where $p(n)$ is a polynomial. Furthermore, these costs are tight. In contrast, if all the words accepted by the given automaton contain at least two different letters, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1346","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-18T03:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcexgmY8DyoRcu74Xh3rC1tFHWUeUQQzqI/lA1bKJgrbydUEe2nuJ4QFzcVB8Yt++xeKqVBtw96U3iFwSVf5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:18.638827Z"},"content_sha256":"477cf87732ca54544316f7f459f6660a4d6ff16f768906b9778a9765310db2dd","schema_version":"1.0","event_id":"sha256:477cf87732ca54544316f7f459f6660a4d6ff16f768906b9778a9765310db2dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/bundle.json","state_url":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/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-31T00:26:18Z","links":{"resolver":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY","bundle":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/bundle.json","state":"https://pith.science/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLICFDDUOLKA5DH2NRNAKL7XAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RLICFDDUOLKA5DH2NRNAKL7XAY","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":"7116e57baf53597beca4f162fbbfbdd239810d253ceeb5c005019aca907e4524","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-12-06T15:15:17Z","title_canon_sha256":"f57c98433c03a9aaeeceae75524c9523709fc4de978e42009997450be7339bfb"},"schema_version":"1.0","source":{"id":"1212.1346","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1346","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1346v2","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1346","created_at":"2026-05-18T03:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"RLICFDDUOLKA","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RLICFDDUOLKA5DH2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RLICFDDU","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:477cf87732ca54544316f7f459f6660a4d6ff16f768906b9778a9765310db2dd","target":"graph","created_at":"2026-05-18T03:38:45Z","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 investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a descriptional complexity point of view.\n  We prove that for each one-way nondeterministic automaton with $n$ states there exist Parikh equivalent one-way and two-way deterministic automata with $e^{O(\\sqrt{n \\ln n})}$ and $p(n)$ states, respectively, where $p(n)$ is a polynomial. Furthermore, these costs are tight. In contrast, if all the words accepted by the given automaton contain at least two different letters, ","authors_text":"Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-12-06T15:15:17Z","title":"Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1346","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:018a1563de666869fbcd412402c77f95389640780d8d9cf02314ca011a88aa3b","target":"record","created_at":"2026-05-18T03:38:45Z","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":"7116e57baf53597beca4f162fbbfbdd239810d253ceeb5c005019aca907e4524","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-12-06T15:15:17Z","title_canon_sha256":"f57c98433c03a9aaeeceae75524c9523709fc4de978e42009997450be7339bfb"},"schema_version":"1.0","source":{"id":"1212.1346","kind":"arxiv","version":2}},"canonical_sha256":"8ad0228c7472d40e8cfa6c5a052ff7061f54c2e1864436e04f8206e066ebc8df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ad0228c7472d40e8cfa6c5a052ff7061f54c2e1864436e04f8206e066ebc8df","first_computed_at":"2026-05-18T03:38:45.717098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:45.717098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NHLIu33fRfm+6xmY2U4ib97uc3jAX1cL9MX/JoOryaV1nESWGDxasQdTaQwJ4MfA3+F2EZU5KGcr8Cj3BOGAAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:45.717800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1346","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:018a1563de666869fbcd412402c77f95389640780d8d9cf02314ca011a88aa3b","sha256:477cf87732ca54544316f7f459f6660a4d6ff16f768906b9778a9765310db2dd"],"state_sha256":"02e4987694e9af189788969631f2e194390bc46465dd31ed1c643a1265b564b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bEIMKl+/291h9f4JpkEgScdunkRcF8AtJPvpmXFyAayADSWJ+VXNZALb9grNkaredR6OPE+ehAvHwBo9P1uMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:26:18.640948Z","bundle_sha256":"79748a64d09c75dae419810a34f5e15b16a20ae01bcebce07706b02e1a0e457b"}}