{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EG7RGUJSUSXODZUKYWQ23AFRPV","short_pith_number":"pith:EG7RGUJS","schema_version":"1.0","canonical_sha256":"21bf135132a4aee1e68ac5a1ad80b17d76e08132eaba05a6b7aea87829791349","source":{"kind":"arxiv","id":"1607.03718","version":1},"attestation_state":"computed","paper":{"title":"Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Diptarka Chakraborty, Elazar Goldenberg, Michal Kouck\\'y","submitted_at":"2016-07-13T13:16:17Z","abstract_excerpt":"The edit distance is a way of quantifying how similar two strings are to one another by counting the minimum number of character insertions, deletions, and substitutions required to transform one string into the other.\n  In this paper we study the computational problem of computing the edit distance between a pair of strings where their distance is bounded by a parameter $k\\ll n$. We present two streaming algorithms for computing edit distance: One runs in time $O(n+k^2)$ and the other $n+O(k^3)$. By writing $n+O(k^3)$ we want to emphasize that the number of operations per an input symbol is a"},"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":"1607.03718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T13:16:17Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a98001cfd8fe800c2c31f7d6bdc0b1d95ceecaf0a1998891ceae3e9b835e62a3","abstract_canon_sha256":"078b1de3f75f462f818371ed95b28329cd1c466481e1e5d959a2a357dbc7c8f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:05.884635Z","signature_b64":"X9amkHoUy6V1Yz6coFj3D++5FbWgehG9ZvBlIqWkpyx/xvkItS8UowHtjCmQT6w9slWTEUWwcsSX3WORR5JRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21bf135132a4aee1e68ac5a1ad80b17d76e08132eaba05a6b7aea87829791349","last_reissued_at":"2026-05-18T01:11:05.884035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:05.884035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Diptarka Chakraborty, Elazar Goldenberg, Michal Kouck\\'y","submitted_at":"2016-07-13T13:16:17Z","abstract_excerpt":"The edit distance is a way of quantifying how similar two strings are to one another by counting the minimum number of character insertions, deletions, and substitutions required to transform one string into the other.\n  In this paper we study the computational problem of computing the edit distance between a pair of strings where their distance is bounded by a parameter $k\\ll n$. We present two streaming algorithms for computing edit distance: One runs in time $O(n+k^2)$ and the other $n+O(k^3)$. By writing $n+O(k^3)$ we want to emphasize that the number of operations per an input symbol is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03718","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":"1607.03718","created_at":"2026-05-18T01:11:05.884114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03718v1","created_at":"2026-05-18T01:11:05.884114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03718","created_at":"2026-05-18T01:11:05.884114+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG7RGUJSUSXO","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG7RGUJSUSXODZUK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG7RGUJS","created_at":"2026-05-18T12:30:12.583610+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/EG7RGUJSUSXODZUKYWQ23AFRPV","json":"https://pith.science/pith/EG7RGUJSUSXODZUKYWQ23AFRPV.json","graph_json":"https://pith.science/api/pith-number/EG7RGUJSUSXODZUKYWQ23AFRPV/graph.json","events_json":"https://pith.science/api/pith-number/EG7RGUJSUSXODZUKYWQ23AFRPV/events.json","paper":"https://pith.science/paper/EG7RGUJS"},"agent_actions":{"view_html":"https://pith.science/pith/EG7RGUJSUSXODZUKYWQ23AFRPV","download_json":"https://pith.science/pith/EG7RGUJSUSXODZUKYWQ23AFRPV.json","view_paper":"https://pith.science/paper/EG7RGUJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03718&json=true","fetch_graph":"https://pith.science/api/pith-number/EG7RGUJSUSXODZUKYWQ23AFRPV/graph.json","fetch_events":"https://pith.science/api/pith-number/EG7RGUJSUSXODZUKYWQ23AFRPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG7RGUJSUSXODZUKYWQ23AFRPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG7RGUJSUSXODZUKYWQ23AFRPV/action/storage_attestation","attest_author":"https://pith.science/pith/EG7RGUJSUSXODZUKYWQ23AFRPV/action/author_attestation","sign_citation":"https://pith.science/pith/EG7RGUJSUSXODZUKYWQ23AFRPV/action/citation_signature","submit_replication":"https://pith.science/pith/EG7RGUJSUSXODZUKYWQ23AFRPV/action/replication_record"}},"created_at":"2026-05-18T01:11:05.884114+00:00","updated_at":"2026-05-18T01:11:05.884114+00:00"}