{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AQ57W6U5KNK7FAPKUKI2U4XAA7","short_pith_number":"pith:AQ57W6U5","schema_version":"1.0","canonical_sha256":"043bfb7a9d5355f281eaa291aa72e007df4bf054bceeabfbd05e291be51cf500","source":{"kind":"arxiv","id":"1004.1194","version":1},"attestation_state":"computed","paper":{"title":"Unified Compression-Based Acceleration of Edit-Distance Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Gad M. Landau, Oren Weimann, Shir Landau","submitted_at":"2010-04-07T21:24:27Z","abstract_excerpt":"The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming solution for this problem computes the edit-distance between a pair of strings of total length O(N) in O(N^2) time. To this date, this quadratic upper-bound has never been substantially improved for general strings. However, there are known techniques for breaking this bound in case the strings are known to compress well under a particular compression scheme. The basic idea is to first compress the strings, and then t"},"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":"1004.1194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-07T21:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"e97d83132cf5a3baf1647d6bd7b039107ed7994d827ac1af71e67e6519343e18","abstract_canon_sha256":"cd8d10f13ba665a1bb28af0af6e233aea0ff3ff8a46e6bc133f166cf22d1eb9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:24.776397Z","signature_b64":"pIku/sgBLz6qkWQsnKwh2Egv96nYfUjpuSV+efhk6yNZokutHxcIP7JlyNCxiWKmcqZ5No9wsPVYhkx1WgNIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"043bfb7a9d5355f281eaa291aa72e007df4bf054bceeabfbd05e291be51cf500","last_reissued_at":"2026-05-18T01:03:24.775659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:24.775659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unified Compression-Based Acceleration of Edit-Distance Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Gad M. Landau, Oren Weimann, Shir Landau","submitted_at":"2010-04-07T21:24:27Z","abstract_excerpt":"The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming solution for this problem computes the edit-distance between a pair of strings of total length O(N) in O(N^2) time. To this date, this quadratic upper-bound has never been substantially improved for general strings. However, there are known techniques for breaking this bound in case the strings are known to compress well under a particular compression scheme. The basic idea is to first compress the strings, and then t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1194","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":"1004.1194","created_at":"2026-05-18T01:03:24.775768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.1194v1","created_at":"2026-05-18T01:03:24.775768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1194","created_at":"2026-05-18T01:03:24.775768+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQ57W6U5KNK7","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQ57W6U5KNK7FAPK","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQ57W6U5","created_at":"2026-05-18T12:26:05.355336+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/AQ57W6U5KNK7FAPKUKI2U4XAA7","json":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7.json","graph_json":"https://pith.science/api/pith-number/AQ57W6U5KNK7FAPKUKI2U4XAA7/graph.json","events_json":"https://pith.science/api/pith-number/AQ57W6U5KNK7FAPKUKI2U4XAA7/events.json","paper":"https://pith.science/paper/AQ57W6U5"},"agent_actions":{"view_html":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7","download_json":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7.json","view_paper":"https://pith.science/paper/AQ57W6U5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.1194&json=true","fetch_graph":"https://pith.science/api/pith-number/AQ57W6U5KNK7FAPKUKI2U4XAA7/graph.json","fetch_events":"https://pith.science/api/pith-number/AQ57W6U5KNK7FAPKUKI2U4XAA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/action/storage_attestation","attest_author":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/action/author_attestation","sign_citation":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/action/citation_signature","submit_replication":"https://pith.science/pith/AQ57W6U5KNK7FAPKUKI2U4XAA7/action/replication_record"}},"created_at":"2026-05-18T01:03:24.775768+00:00","updated_at":"2026-05-18T01:03:24.775768+00:00"}