{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TL5EVE7RVJR77T5OX5BTSD3M2C","short_pith_number":"pith:TL5EVE7R","schema_version":"1.0","canonical_sha256":"9afa4a93f1aa63ffcfaebf43390f6cd0851967ec6b762517f8a27d861a51ab29","source":{"kind":"arxiv","id":"1504.08259","version":4},"attestation_state":"computed","paper":{"title":"Edit Distance for Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jan Otop, Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Thomas A. Henzinger","submitted_at":"2015-04-30T14:56:25Z","abstract_excerpt":"The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$. The edit distance generalizes to languages $\\mathcal{L}_1, \\mathcal{L}_2$, where the edit distance from $\\mathcal{L}_1$ to $\\mathcal{L}_2$ is the minimal number $k$ such that for every word from $\\mathcal{L}_1$ there exists a word in $\\mathcal{L}_2$ with edit distance at most $k$. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pu"},"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":"1504.08259","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-30T14:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"69ea454fbc895e42c280d166b43b8ed4893f8c876b3e67133010718977056e59","abstract_canon_sha256":"1380094f6e7405e7b26cd41872d5cc975c8e77277e740863d408062fa97086f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:23.915697Z","signature_b64":"wRhKIXvUyACpsNDkg5lpOkoPChme3CN3CG1MlUlmpYZj2gHTK8ZA044m/FRxhjNVhPPJKfBplQ0A0tWXrI+gBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9afa4a93f1aa63ffcfaebf43390f6cd0851967ec6b762517f8a27d861a51ab29","last_reissued_at":"2026-05-17T23:51:23.915054Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:23.915054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edit Distance for Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jan Otop, Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Thomas A. Henzinger","submitted_at":"2015-04-30T14:56:25Z","abstract_excerpt":"The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$. The edit distance generalizes to languages $\\mathcal{L}_1, \\mathcal{L}_2$, where the edit distance from $\\mathcal{L}_1$ to $\\mathcal{L}_2$ is the minimal number $k$ such that for every word from $\\mathcal{L}_1$ there exists a word in $\\mathcal{L}_2$ with edit distance at most $k$. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08259","kind":"arxiv","version":4},"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":"1504.08259","created_at":"2026-05-17T23:51:23.915149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.08259v4","created_at":"2026-05-17T23:51:23.915149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08259","created_at":"2026-05-17T23:51:23.915149+00:00"},{"alias_kind":"pith_short_12","alias_value":"TL5EVE7RVJR7","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TL5EVE7RVJR77T5O","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TL5EVE7R","created_at":"2026-05-18T12:29:42.218222+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/TL5EVE7RVJR77T5OX5BTSD3M2C","json":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C.json","graph_json":"https://pith.science/api/pith-number/TL5EVE7RVJR77T5OX5BTSD3M2C/graph.json","events_json":"https://pith.science/api/pith-number/TL5EVE7RVJR77T5OX5BTSD3M2C/events.json","paper":"https://pith.science/paper/TL5EVE7R"},"agent_actions":{"view_html":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C","download_json":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C.json","view_paper":"https://pith.science/paper/TL5EVE7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.08259&json=true","fetch_graph":"https://pith.science/api/pith-number/TL5EVE7RVJR77T5OX5BTSD3M2C/graph.json","fetch_events":"https://pith.science/api/pith-number/TL5EVE7RVJR77T5OX5BTSD3M2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/action/storage_attestation","attest_author":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/action/author_attestation","sign_citation":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/action/citation_signature","submit_replication":"https://pith.science/pith/TL5EVE7RVJR77T5OX5BTSD3M2C/action/replication_record"}},"created_at":"2026-05-17T23:51:23.915149+00:00","updated_at":"2026-05-17T23:51:23.915149+00:00"}