{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X3PY2DEKNJWEQ3RR43XFV3DBXO","short_pith_number":"pith:X3PY2DEK","schema_version":"1.0","canonical_sha256":"bedf8d0c8a6a6c486e31e6ee5aec61bb837293ca8667b0ce22e07a291870ffbc","source":{"kind":"arxiv","id":"1701.06134","version":1},"attestation_state":"computed","paper":{"title":"On Practical Accuracy of Edit Distance Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Atsuyoshi Nakamura, Hiroyuki Hanada, Mineichi Kudo","submitted_at":"2017-01-22T07:40:52Z","abstract_excerpt":"The edit distance is a basic string similarity measure used in many applications such as text mining, signal processing, bioinformatics, and so on. However, the computational cost can be a problem when we repeat many distance calculations as seen in real-life searching situations. A promising solution to cope with the problem is to approximate the edit distance by another distance with a lower computational cost. There are, indeed, many distances have been proposed for approximating the edit distance. However, their approximation accuracies are evaluated only theoretically: many of them are ev"},"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":"1701.06134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-22T07:40:52Z","cross_cats_sorted":[],"title_canon_sha256":"420977d2c51a300f7ac8378b9c8ff4f581df20c719be18d1655db0d1ed7c69e6","abstract_canon_sha256":"24f73d5bc24c772ba79677caa63427f065b6fac8489584a4f80b949f7f569e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:19.202091Z","signature_b64":"6mTq3YyY+UMKCVB2kxmDLRHxtWKRo54vwY81vCzT6iCGn41KDY3zrJXZWo3onvYuKl6zgI4o6C7Ptjog0wvyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bedf8d0c8a6a6c486e31e6ee5aec61bb837293ca8667b0ce22e07a291870ffbc","last_reissued_at":"2026-05-18T00:52:19.201437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:19.201437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Practical Accuracy of Edit Distance Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Atsuyoshi Nakamura, Hiroyuki Hanada, Mineichi Kudo","submitted_at":"2017-01-22T07:40:52Z","abstract_excerpt":"The edit distance is a basic string similarity measure used in many applications such as text mining, signal processing, bioinformatics, and so on. However, the computational cost can be a problem when we repeat many distance calculations as seen in real-life searching situations. A promising solution to cope with the problem is to approximate the edit distance by another distance with a lower computational cost. There are, indeed, many distances have been proposed for approximating the edit distance. However, their approximation accuracies are evaluated only theoretically: many of them are ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06134","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":"1701.06134","created_at":"2026-05-18T00:52:19.201535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06134v1","created_at":"2026-05-18T00:52:19.201535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06134","created_at":"2026-05-18T00:52:19.201535+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3PY2DEKNJWE","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3PY2DEKNJWEQ3RR","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3PY2DEK","created_at":"2026-05-18T12:31:53.515858+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/X3PY2DEKNJWEQ3RR43XFV3DBXO","json":"https://pith.science/pith/X3PY2DEKNJWEQ3RR43XFV3DBXO.json","graph_json":"https://pith.science/api/pith-number/X3PY2DEKNJWEQ3RR43XFV3DBXO/graph.json","events_json":"https://pith.science/api/pith-number/X3PY2DEKNJWEQ3RR43XFV3DBXO/events.json","paper":"https://pith.science/paper/X3PY2DEK"},"agent_actions":{"view_html":"https://pith.science/pith/X3PY2DEKNJWEQ3RR43XFV3DBXO","download_json":"https://pith.science/pith/X3PY2DEKNJWEQ3RR43XFV3DBXO.json","view_paper":"https://pith.science/paper/X3PY2DEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06134&json=true","fetch_graph":"https://pith.science/api/pith-number/X3PY2DEKNJWEQ3RR43XFV3DBXO/graph.json","fetch_events":"https://pith.science/api/pith-number/X3PY2DEKNJWEQ3RR43XFV3DBXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3PY2DEKNJWEQ3RR43XFV3DBXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3PY2DEKNJWEQ3RR43XFV3DBXO/action/storage_attestation","attest_author":"https://pith.science/pith/X3PY2DEKNJWEQ3RR43XFV3DBXO/action/author_attestation","sign_citation":"https://pith.science/pith/X3PY2DEKNJWEQ3RR43XFV3DBXO/action/citation_signature","submit_replication":"https://pith.science/pith/X3PY2DEKNJWEQ3RR43XFV3DBXO/action/replication_record"}},"created_at":"2026-05-18T00:52:19.201535+00:00","updated_at":"2026-05-18T00:52:19.201535+00:00"}