{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:E23TKHH56M2DPXBZPQD6HZ3IJZ","short_pith_number":"pith:E23TKHH5","schema_version":"1.0","canonical_sha256":"26b7351cfdf33437dc397c07e3e7684e6e3a6feb743bb8aad1ca0a954cba4561","source":{"kind":"arxiv","id":"1511.09229","version":2},"attestation_state":"computed","paper":{"title":"Efficient Deterministic Single Round Document Exchange for Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2015-11-30T10:26:49Z","abstract_excerpt":"Suppose that we have two parties that possess each a binary string. Suppose that the length of the first string (document) is $n$ and that the two strings (documents) have edit distance (minimal number of deletes, inserts and substitutions needed to transform one string into the other) at most $k$. The problem we want to solve is to devise an efficient protocol in which the first party sends a single message that allows the second party to guess the first party's string. In this paper we show an efficient deterministic protocol for this problem. The protocol runs in time $O(n\\cdot \\mathtt{poly"},"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":"1511.09229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T10:26:49Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"67d9cdf1cebfe7f66de2913d8bd0d5e1ab772f4abcf85a04950637517dd362bb","abstract_canon_sha256":"af458aca220908dfd6e9a01b71070f9fa053ca3590603e01e40b1bc2c6cf0370"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:24.054548Z","signature_b64":"0Bgjl+yMewgM+tlXIvmpOR68YdW6r5NRYq6grMYAO9++hqaTvFs/39Bpy3kaOJrQdjD3EKlIIrq8HZtmgrvrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26b7351cfdf33437dc397c07e3e7684e6e3a6feb743bb8aad1ca0a954cba4561","last_reissued_at":"2026-05-18T01:25:24.054112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:24.054112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Deterministic Single Round Document Exchange for Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui","submitted_at":"2015-11-30T10:26:49Z","abstract_excerpt":"Suppose that we have two parties that possess each a binary string. Suppose that the length of the first string (document) is $n$ and that the two strings (documents) have edit distance (minimal number of deletes, inserts and substitutions needed to transform one string into the other) at most $k$. The problem we want to solve is to devise an efficient protocol in which the first party sends a single message that allows the second party to guess the first party's string. In this paper we show an efficient deterministic protocol for this problem. The protocol runs in time $O(n\\cdot \\mathtt{poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09229","kind":"arxiv","version":2},"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":"1511.09229","created_at":"2026-05-18T01:25:24.054179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.09229v2","created_at":"2026-05-18T01:25:24.054179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09229","created_at":"2026-05-18T01:25:24.054179+00:00"},{"alias_kind":"pith_short_12","alias_value":"E23TKHH56M2D","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"E23TKHH56M2DPXBZ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"E23TKHH5","created_at":"2026-05-18T12:29:17.054201+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/E23TKHH56M2DPXBZPQD6HZ3IJZ","json":"https://pith.science/pith/E23TKHH56M2DPXBZPQD6HZ3IJZ.json","graph_json":"https://pith.science/api/pith-number/E23TKHH56M2DPXBZPQD6HZ3IJZ/graph.json","events_json":"https://pith.science/api/pith-number/E23TKHH56M2DPXBZPQD6HZ3IJZ/events.json","paper":"https://pith.science/paper/E23TKHH5"},"agent_actions":{"view_html":"https://pith.science/pith/E23TKHH56M2DPXBZPQD6HZ3IJZ","download_json":"https://pith.science/pith/E23TKHH56M2DPXBZPQD6HZ3IJZ.json","view_paper":"https://pith.science/paper/E23TKHH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.09229&json=true","fetch_graph":"https://pith.science/api/pith-number/E23TKHH56M2DPXBZPQD6HZ3IJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/E23TKHH56M2DPXBZPQD6HZ3IJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E23TKHH56M2DPXBZPQD6HZ3IJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E23TKHH56M2DPXBZPQD6HZ3IJZ/action/storage_attestation","attest_author":"https://pith.science/pith/E23TKHH56M2DPXBZPQD6HZ3IJZ/action/author_attestation","sign_citation":"https://pith.science/pith/E23TKHH56M2DPXBZPQD6HZ3IJZ/action/citation_signature","submit_replication":"https://pith.science/pith/E23TKHH56M2DPXBZPQD6HZ3IJZ/action/replication_record"}},"created_at":"2026-05-18T01:25:24.054179+00:00","updated_at":"2026-05-18T01:25:24.054179+00:00"}