{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:37MPAJ2QX4AVRQK7W3U5QSCU23","short_pith_number":"pith:37MPAJ2Q","schema_version":"1.0","canonical_sha256":"dfd8f02750bf0158c15fb6e9d84854d6f3454ff5c45ecaa2da8696146518413e","source":{"kind":"arxiv","id":"1310.2026","version":6},"attestation_state":"computed","paper":{"title":"Low-Complexity Interactive Algorithms for Synchronization from Deletions, Insertions, and Substitutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Ramji Venkataramanan, Vasuki Narasimha Swamy","submitted_at":"2013-10-08T08:03:46Z","abstract_excerpt":"Consider two remote nodes having binary sequences $X$ and $Y$, respectively. $Y$ is an edited version of ${X}$, where the editing involves random deletions, insertions, and substitutions, possibly in bursts. The goal is for the node with $Y$ to reconstruct $X$ with minimal exchange of information over a noiseless link. The communication is measured in terms of both the total number of bits exchanged and the number of interactive rounds of communication.\n  This paper focuses on the setting where the number of edits is $o(\\tfrac{n}{\\log n})$, where $n$ is the length of $X$. We first consider the"},"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":"1310.2026","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-08T08:03:46Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"5e113fe1921c8356d776fdd420effd73ebab63574da1f86d37b42a5c4f12f191","abstract_canon_sha256":"13c8a01540871cedd33d068c951c238d25ff3a29a4691d148e744e6e612fad97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:16.881701Z","signature_b64":"WjLkbLAlOPQkduQK2+NUNGrcu2A9jylqjJFXFcAybp3JzKJnzf1usDVSHw6s4w9hIvIyTbOEkZ0hX4CwrRWwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfd8f02750bf0158c15fb6e9d84854d6f3454ff5c45ecaa2da8696146518413e","last_reissued_at":"2026-05-18T01:33:16.881100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:16.881100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Complexity Interactive Algorithms for Synchronization from Deletions, Insertions, and Substitutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Ramji Venkataramanan, Vasuki Narasimha Swamy","submitted_at":"2013-10-08T08:03:46Z","abstract_excerpt":"Consider two remote nodes having binary sequences $X$ and $Y$, respectively. $Y$ is an edited version of ${X}$, where the editing involves random deletions, insertions, and substitutions, possibly in bursts. The goal is for the node with $Y$ to reconstruct $X$ with minimal exchange of information over a noiseless link. The communication is measured in terms of both the total number of bits exchanged and the number of interactive rounds of communication.\n  This paper focuses on the setting where the number of edits is $o(\\tfrac{n}{\\log n})$, where $n$ is the length of $X$. We first consider the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2026","kind":"arxiv","version":6},"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":"1310.2026","created_at":"2026-05-18T01:33:16.881194+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2026v6","created_at":"2026-05-18T01:33:16.881194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2026","created_at":"2026-05-18T01:33:16.881194+00:00"},{"alias_kind":"pith_short_12","alias_value":"37MPAJ2QX4AV","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"37MPAJ2QX4AVRQK7","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"37MPAJ2Q","created_at":"2026-05-18T12:27:32.513160+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/37MPAJ2QX4AVRQK7W3U5QSCU23","json":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23.json","graph_json":"https://pith.science/api/pith-number/37MPAJ2QX4AVRQK7W3U5QSCU23/graph.json","events_json":"https://pith.science/api/pith-number/37MPAJ2QX4AVRQK7W3U5QSCU23/events.json","paper":"https://pith.science/paper/37MPAJ2Q"},"agent_actions":{"view_html":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23","download_json":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23.json","view_paper":"https://pith.science/paper/37MPAJ2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2026&json=true","fetch_graph":"https://pith.science/api/pith-number/37MPAJ2QX4AVRQK7W3U5QSCU23/graph.json","fetch_events":"https://pith.science/api/pith-number/37MPAJ2QX4AVRQK7W3U5QSCU23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/action/storage_attestation","attest_author":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/action/author_attestation","sign_citation":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/action/citation_signature","submit_replication":"https://pith.science/pith/37MPAJ2QX4AVRQK7W3U5QSCU23/action/replication_record"}},"created_at":"2026-05-18T01:33:16.881194+00:00","updated_at":"2026-05-18T01:33:16.881194+00:00"}