{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E5XFIBGX5BGNGUKX6QPD7APMFH","short_pith_number":"pith:E5XFIBGX","schema_version":"1.0","canonical_sha256":"276e5404d7e84cd35157f41e3f81ec29c73106f93b8ca0feed477f7fb3036084","source":{"kind":"arxiv","id":"1406.1041","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.1041","created_at":"2026-05-18T02:50:30.456030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1041v1","created_at":"2026-05-18T02:50:30.456030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1041","created_at":"2026-05-18T02:50:30.456030+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5XFIBGX5BGN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5XFIBGX5BGNGUKX","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5XFIBGX","created_at":"2026-05-18T12:28:25.294606+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/E5XFIBGX5BGNGUKX6QPD7APMFH","json":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH.json","graph_json":"https://pith.science/api/pith-number/E5XFIBGX5BGNGUKX6QPD7APMFH/graph.json","events_json":"https://pith.science/api/pith-number/E5XFIBGX5BGNGUKX6QPD7APMFH/events.json","paper":"https://pith.science/paper/E5XFIBGX"},"agent_actions":{"view_html":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH","download_json":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH.json","view_paper":"https://pith.science/paper/E5XFIBGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1041&json=true","fetch_graph":"https://pith.science/api/pith-number/E5XFIBGX5BGNGUKX6QPD7APMFH/graph.json","fetch_events":"https://pith.science/api/pith-number/E5XFIBGX5BGNGUKX6QPD7APMFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/action/storage_attestation","attest_author":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/action/author_attestation","sign_citation":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/action/citation_signature","submit_replication":"https://pith.science/pith/E5XFIBGX5BGNGUKX6QPD7APMFH/action/replication_record"}},"created_at":"2026-05-18T02:50:30.456030+00:00","updated_at":"2026-05-18T02:50:30.456030+00:00"}