{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WTFP55ICYK2TYFGBLRWTE2KVEN","short_pith_number":"pith:WTFP55IC","schema_version":"1.0","canonical_sha256":"b4cafef502c2b53c14c15c6d3269552349eeb38ddeba7c607c61867df09acaaa","source":{"kind":"arxiv","id":"1207.0290","version":2},"attestation_state":"computed","paper":{"title":"A Deterministic Polynomial-Time Protocol for Synchronizing from Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lara Dolecek, S. M. Sadegh Tabatabaei Yazdi","submitted_at":"2012-07-02T06:36:55Z","abstract_excerpt":"In this paper, we consider a synchronization problem between nodes $A$ and $B$ that are connected through a two--way communication channel. {Node $A$} contains a binary file $X$ of length $n$ and {node $B$} contains a binary file $Y$ that is generated by randomly deleting bits from $X$, by a small deletion rate $\\beta$. The location of deleted bits is not known to either node $A$ or node $B$. We offer a deterministic synchronization scheme between nodes $A$ and $B$ that needs a total of $O(n\\beta\\log \\frac{1}{\\beta})$ transmitted bits and reconstructs $X$ at node $B$ with probability of error "},"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":"1207.0290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-02T06:36:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61bcfb25b4c24501ba3df9b1b4cfa4e6318d050615cc4aae34531967e880b28c","abstract_canon_sha256":"abcecbc02e9234c6c888254b9d82d4cb1200b84a311f0224f47f0c887b175e95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:32.674185Z","signature_b64":"OWDwZjCujYwUc9quMKyUu7KfONcpf+9o6+8rj+A2vVV6vRBTEZOSmxBQh2TMZ7WfNX+3OzpI541OaZjTa7OQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4cafef502c2b53c14c15c6d3269552349eeb38ddeba7c607c61867df09acaaa","last_reissued_at":"2026-05-18T03:15:32.673373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:32.673373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Polynomial-Time Protocol for Synchronizing from Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lara Dolecek, S. M. Sadegh Tabatabaei Yazdi","submitted_at":"2012-07-02T06:36:55Z","abstract_excerpt":"In this paper, we consider a synchronization problem between nodes $A$ and $B$ that are connected through a two--way communication channel. {Node $A$} contains a binary file $X$ of length $n$ and {node $B$} contains a binary file $Y$ that is generated by randomly deleting bits from $X$, by a small deletion rate $\\beta$. The location of deleted bits is not known to either node $A$ or node $B$. We offer a deterministic synchronization scheme between nodes $A$ and $B$ that needs a total of $O(n\\beta\\log \\frac{1}{\\beta})$ transmitted bits and reconstructs $X$ at node $B$ with probability of error "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0290","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":"1207.0290","created_at":"2026-05-18T03:15:32.673500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0290v2","created_at":"2026-05-18T03:15:32.673500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0290","created_at":"2026-05-18T03:15:32.673500+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTFP55ICYK2T","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTFP55ICYK2TYFGB","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTFP55IC","created_at":"2026-05-18T12:27:27.928770+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/WTFP55ICYK2TYFGBLRWTE2KVEN","json":"https://pith.science/pith/WTFP55ICYK2TYFGBLRWTE2KVEN.json","graph_json":"https://pith.science/api/pith-number/WTFP55ICYK2TYFGBLRWTE2KVEN/graph.json","events_json":"https://pith.science/api/pith-number/WTFP55ICYK2TYFGBLRWTE2KVEN/events.json","paper":"https://pith.science/paper/WTFP55IC"},"agent_actions":{"view_html":"https://pith.science/pith/WTFP55ICYK2TYFGBLRWTE2KVEN","download_json":"https://pith.science/pith/WTFP55ICYK2TYFGBLRWTE2KVEN.json","view_paper":"https://pith.science/paper/WTFP55IC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0290&json=true","fetch_graph":"https://pith.science/api/pith-number/WTFP55ICYK2TYFGBLRWTE2KVEN/graph.json","fetch_events":"https://pith.science/api/pith-number/WTFP55ICYK2TYFGBLRWTE2KVEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTFP55ICYK2TYFGBLRWTE2KVEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTFP55ICYK2TYFGBLRWTE2KVEN/action/storage_attestation","attest_author":"https://pith.science/pith/WTFP55ICYK2TYFGBLRWTE2KVEN/action/author_attestation","sign_citation":"https://pith.science/pith/WTFP55ICYK2TYFGBLRWTE2KVEN/action/citation_signature","submit_replication":"https://pith.science/pith/WTFP55ICYK2TYFGBLRWTE2KVEN/action/replication_record"}},"created_at":"2026-05-18T03:15:32.673500+00:00","updated_at":"2026-05-18T03:15:32.673500+00:00"}