{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:E5XFIBGX5BGNGUKX6QPD7APMFH","short_pith_number":"pith:E5XFIBGX","canonical_record":{"source":{"id":"1406.1041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-04T13:33:57Z","cross_cats_sorted":[],"title_canon_sha256":"96e4433c1f163b6b4fc039d471a48706d7213fae7eb6afa694a26783965da4ea","abstract_canon_sha256":"42b81dfd571592f566bcdaf35d5237b46182f6ee0ab246d7ab3c85d9f53206eb"},"schema_version":"1.0"},"canonical_sha256":"276e5404d7e84cd35157f41e3f81ec29c73106f93b8ca0feed477f7fb3036084","source":{"kind":"arxiv","id":"1406.1041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1041","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1041v1","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1041","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"E5XFIBGX5BGN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E5XFIBGX5BGNGUKX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E5XFIBGX","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:E5XFIBGX5BGNGUKX6QPD7APMFH","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-04T13:33:57Z","cross_cats_sorted":[],"title_canon_sha256":"96e4433c1f163b6b4fc039d471a48706d7213fae7eb6afa694a26783965da4ea","abstract_canon_sha256":"42b81dfd571592f566bcdaf35d5237b46182f6ee0ab246d7ab3c85d9f53206eb"},"schema_version":"1.0"},"canonical_sha256":"276e5404d7e84cd35157f41e3f81ec29c73106f93b8ca0feed477f7fb3036084","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:30.456542Z","signature_b64":"uPdfHSr+jAlQRzCfTiVx1dIM+qEGKwom4TLc5nQj0njfYC4RCq0OSSjanJ++kp1r8kVHDHHkgnkjAkBHLBwdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276e5404d7e84cd35157f41e3f81ec29c73106f93b8ca0feed477f7fb3036084","last_reissued_at":"2026-05-18T02:50:30.455922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:30.455922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1041","source_version":1,"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:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuzelYUG8SkhJLfpG1gmo5uGgccaVK64D4ElkpiaAYj6Im5oAEm/NYJ/0C2UjjDAYop4fD7jOElXwt3K7wDyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:00:53.526668Z"},"content_sha256":"f4b60883df99f261ee67964c201aa02530ed8dbc20a3f8afe4ab82d579efbbb3","schema_version":"1.0","event_id":"sha256:f4b60883df99f261ee67964c201aa02530ed8dbc20a3f8afe4ab82d579efbbb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:E5XFIBGX5BGNGUKX6QPD7APMFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient algorithm for computing the edit distance of a regular language via input-altering transducers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Lila Kari, Meng Yang, Stavros Konstantinidis, Steffen Kopecki","submitted_at":"2014-06-04T13:33:57Z","abstract_excerpt":"We revisit the problem of computing the edit distance of a regular language given via an NFA. This problem relates to the inherent maximal error-detecting capability of the language in question. We present an efficient algorithm for solving this problem which executes in time $O(r^2n^2d)$, where $r$ is the cardinality of the alphabet involved, $n$ is the number of transitions in the given NFA, and $d$ is the computed edit distance. We have implemented the algorithm and present here performance tests. The correctness of the algorithm is based on the result (also presented here) that the particu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1041","kind":"arxiv","version":1},"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:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5csnGPiwa3CXt5EK0JaRmNiUx5Cd5TV+sHywrC/mvMiAMXT2/+5yuiwurLVWahTKsy6WQ/omsfTC/H3caRVwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:00:53.527290Z"},"content_sha256":"9b775c45fc270c07ff7d5afa1f3bd59196e9ab45135ed49c23050a2298b1335a","schema_version":"1.0","event_id":"sha256:9b775c45fc270c07ff7d5afa1f3bd59196e9ab45135ed49c23050a2298b1335a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/bundle.json","state_url":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/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-31T11:00:53Z","links":{"resolver":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH","bundle":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/bundle.json","state":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E5XFIBGX5BGNGUKX6QPD7APMFH","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":"42b81dfd571592f566bcdaf35d5237b46182f6ee0ab246d7ab3c85d9f53206eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-04T13:33:57Z","title_canon_sha256":"96e4433c1f163b6b4fc039d471a48706d7213fae7eb6afa694a26783965da4ea"},"schema_version":"1.0","source":{"id":"1406.1041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1041","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1041v1","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1041","created_at":"2026-05-18T02:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"E5XFIBGX5BGN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E5XFIBGX5BGNGUKX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E5XFIBGX","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:9b775c45fc270c07ff7d5afa1f3bd59196e9ab45135ed49c23050a2298b1335a","target":"graph","created_at":"2026-05-18T02:50:30Z","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 revisit the problem of computing the edit distance of a regular language given via an NFA. This problem relates to the inherent maximal error-detecting capability of the language in question. We present an efficient algorithm for solving this problem which executes in time $O(r^2n^2d)$, where $r$ is the cardinality of the alphabet involved, $n$ is the number of transitions in the given NFA, and $d$ is the computed edit distance. We have implemented the algorithm and present here performance tests. The correctness of the algorithm is based on the result (also presented here) that the particu","authors_text":"Lila Kari, Meng Yang, Stavros Konstantinidis, Steffen Kopecki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-04T13:33:57Z","title":"An efficient algorithm for computing the edit distance of a regular language via input-altering transducers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1041","kind":"arxiv","version":1},"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:f4b60883df99f261ee67964c201aa02530ed8dbc20a3f8afe4ab82d579efbbb3","target":"record","created_at":"2026-05-18T02:50:30Z","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":"42b81dfd571592f566bcdaf35d5237b46182f6ee0ab246d7ab3c85d9f53206eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-06-04T13:33:57Z","title_canon_sha256":"96e4433c1f163b6b4fc039d471a48706d7213fae7eb6afa694a26783965da4ea"},"schema_version":"1.0","source":{"id":"1406.1041","kind":"arxiv","version":1}},"canonical_sha256":"276e5404d7e84cd35157f41e3f81ec29c73106f93b8ca0feed477f7fb3036084","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"276e5404d7e84cd35157f41e3f81ec29c73106f93b8ca0feed477f7fb3036084","first_computed_at":"2026-05-18T02:50:30.455922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:30.455922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uPdfHSr+jAlQRzCfTiVx1dIM+qEGKwom4TLc5nQj0njfYC4RCq0OSSjanJ++kp1r8kVHDHHkgnkjAkBHLBwdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:30.456542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4b60883df99f261ee67964c201aa02530ed8dbc20a3f8afe4ab82d579efbbb3","sha256:9b775c45fc270c07ff7d5afa1f3bd59196e9ab45135ed49c23050a2298b1335a"],"state_sha256":"3a51f50874483423cf0185d9e610f568394e4c3561aedcd8771eca83497de0b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEx9sHDVlIYEPKDUO+ABNjhIOnizRaRUSB5VK4ucoH+hMRTrjBawtkPfIEWWP6ushZzADSeivPdVZbRgw11VBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:00:53.531278Z","bundle_sha256":"9926386a6ba0887defa462c3b23b7e843998e7760fd6feab07afb82677ee7eb8"}}