{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WTFP55ICYK2TYFGBLRWTE2KVEN","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":"abcecbc02e9234c6c888254b9d82d4cb1200b84a311f0224f47f0c887b175e95","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-02T06:36:55Z","title_canon_sha256":"61bcfb25b4c24501ba3df9b1b4cfa4e6318d050615cc4aae34531967e880b28c"},"schema_version":"1.0","source":{"id":"1207.0290","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0290","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0290v2","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0290","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"WTFP55ICYK2T","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WTFP55ICYK2TYFGB","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WTFP55IC","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:b39af4102038ea12904d4582573c6567ef084d24f3b84c2e785fd124436aa225","target":"graph","created_at":"2026-05-18T03:15:32Z","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":"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 ","authors_text":"Lara Dolecek, S. M. Sadegh Tabatabaei Yazdi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-02T06:36:55Z","title":"A Deterministic Polynomial-Time Protocol for Synchronizing from Deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0290","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:9c8ce11b52adf747ef280708346281f58677259e3dc941f0c3e9f86461194166","target":"record","created_at":"2026-05-18T03:15:32Z","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":"abcecbc02e9234c6c888254b9d82d4cb1200b84a311f0224f47f0c887b175e95","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-02T06:36:55Z","title_canon_sha256":"61bcfb25b4c24501ba3df9b1b4cfa4e6318d050615cc4aae34531967e880b28c"},"schema_version":"1.0","source":{"id":"1207.0290","kind":"arxiv","version":2}},"canonical_sha256":"b4cafef502c2b53c14c15c6d3269552349eeb38ddeba7c607c61867df09acaaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4cafef502c2b53c14c15c6d3269552349eeb38ddeba7c607c61867df09acaaa","first_computed_at":"2026-05-18T03:15:32.673373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:32.673373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OWDwZjCujYwUc9quMKyUu7KfONcpf+9o6+8rj+A2vVV6vRBTEZOSmxBQh2TMZ7WfNX+3OzpI541OaZjTa7OQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:32.674185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0290","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c8ce11b52adf747ef280708346281f58677259e3dc941f0c3e9f86461194166","sha256:b39af4102038ea12904d4582573c6567ef084d24f3b84c2e785fd124436aa225"],"state_sha256":"53962c4acb0c733321c35a42948ad86ba3b791ddde0c97cb1302b95c3da15c53"}