{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E23TKHH56M2DPXBZPQD6HZ3IJZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"af458aca220908dfd6e9a01b71070f9fa053ca3590603e01e40b1bc2c6cf0370","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T10:26:49Z","title_canon_sha256":"67d9cdf1cebfe7f66de2913d8bd0d5e1ab772f4abcf85a04950637517dd362bb"},"schema_version":"1.0","source":{"id":"1511.09229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.09229","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.09229v2","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09229","created_at":"2026-05-18T01:25:24Z"},{"alias_kind":"pith_short_12","alias_value":"E23TKHH56M2D","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E23TKHH56M2DPXBZ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E23TKHH5","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:e3d77c0f36df44a25d378c27e0b309cc23f8bf33edb5f68fe8c54652614d3515","target":"graph","created_at":"2026-05-18T01:25:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Djamal Belazzougui","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T10:26:49Z","title":"Efficient Deterministic Single Round Document Exchange for Edit Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09229","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3fa5bf9964aee3fbca711a1de738238f3dd3ff6d5ad14635aee457548b3062e6","target":"record","created_at":"2026-05-18T01:25:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"af458aca220908dfd6e9a01b71070f9fa053ca3590603e01e40b1bc2c6cf0370","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-30T10:26:49Z","title_canon_sha256":"67d9cdf1cebfe7f66de2913d8bd0d5e1ab772f4abcf85a04950637517dd362bb"},"schema_version":"1.0","source":{"id":"1511.09229","kind":"arxiv","version":2}},"canonical_sha256":"26b7351cfdf33437dc397c07e3e7684e6e3a6feb743bb8aad1ca0a954cba4561","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26b7351cfdf33437dc397c07e3e7684e6e3a6feb743bb8aad1ca0a954cba4561","first_computed_at":"2026-05-18T01:25:24.054112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:24.054112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Bgjl+yMewgM+tlXIvmpOR68YdW6r5NRYq6grMYAO9++hqaTvFs/39Bpy3kaOJrQdjD3EKlIIrq8HZtmgrvrCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:24.054548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.09229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fa5bf9964aee3fbca711a1de738238f3dd3ff6d5ad14635aee457548b3062e6","sha256:e3d77c0f36df44a25d378c27e0b309cc23f8bf33edb5f68fe8c54652614d3515"],"state_sha256":"a42349c25826273a1cf53248a81cd8641c5d41836057d26bec46c184f72fb039"}