{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZEF2O34MHWL4A7BOXZTYJBCOYS","short_pith_number":"pith:ZEF2O34M","canonical_record":{"source":{"id":"1705.09569","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-24T20:16:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b430dd5a49b87bf3622d304aec49101873ed6dd5a1897bbaed4d8ec7e198a89","abstract_canon_sha256":"4171f342a1e184fa201dcc94f12ea9365510d3af7de7c72051b0950215d14b77"},"schema_version":"1.0"},"canonical_sha256":"c90ba76f8c3d97c07c2ebe6784844ec486bb11a42aa6c0409aad08f4b59f659b","source":{"kind":"arxiv","id":"1705.09569","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09569","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09569v3","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09569","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZEF2O34MHWL4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZEF2O34MHWL4A7BO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZEF2O34M","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZEF2O34MHWL4A7BOXZTYJBCOYS","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09569","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-24T20:16:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b430dd5a49b87bf3622d304aec49101873ed6dd5a1897bbaed4d8ec7e198a89","abstract_canon_sha256":"4171f342a1e184fa201dcc94f12ea9365510d3af7de7c72051b0950215d14b77"},"schema_version":"1.0"},"canonical_sha256":"c90ba76f8c3d97c07c2ebe6784844ec486bb11a42aa6c0409aad08f4b59f659b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:05.518415Z","signature_b64":"lcGbXUjzehR+Sp+W0+/UlDvS43cqQgULiMnGJlramjUz79tOmpQCAoNq+KFYzoWYCdoDjiqNoFQXURTL6d1hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c90ba76f8c3d97c07c2ebe6784844ec486bb11a42aa6c0409aad08f4b59f659b","last_reissued_at":"2026-05-18T00:15:05.517504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:05.517504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09569","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPX93kumxC1Q6doSHRSZgzqY0DyWhgMHSyp9nHJ2xupKg9yG0onw3W2XMkPAQzEyFhz6IFsr5X8YJpl3x0gWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:10:58.953574Z"},"content_sha256":"bc06dfb411cfc3053d501faa8c4c6bda500ef78d0249e7622c09fe0aad9b01db","schema_version":"1.0","event_id":"sha256:bc06dfb411cfc3053d501faa8c4c6bda500ef78d0249e7622c09fe0aad9b01db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZEF2O34MHWL4A7BOXZTYJBCOYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guess & Check Codes for Deletions, Insertions, and Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Salim El Rouayheb, Serge Kas Hanna","submitted_at":"2017-05-24T20:16:59Z","abstract_excerpt":"We consider the problem of constructing codes that can correct $\\delta$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes, dating back to 1965, are zero-error single deletion $(\\delta=1)$ correcting codes, and have an asymptotically optimal redundancy. Finding similar codes for $\\delta \\geq 2$ deletions remains an open problem. In this work, we relax the standard zero-error (i.e., worst-case) decoding requirement by assuming that the positions of the $\\delta$ deletions (or insertions) are independent of the codeword. Our contribution is a new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09569","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UR5gM4KvXQr2VMzL39Z0GKyLGmmRFC/vXO97DGmFw3JiH5YJRMXI9D7zees7/xt4w6kFrR8EjGtlv3Zwj2cAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:10:58.953923Z"},"content_sha256":"e680c516b98a22b91f72eee73ea518751e3c6fbcf4039a1126400d0234817df1","schema_version":"1.0","event_id":"sha256:e680c516b98a22b91f72eee73ea518751e3c6fbcf4039a1126400d0234817df1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZEF2O34MHWL4A7BOXZTYJBCOYS/bundle.json","state_url":"https://pith.science/pith/ZEF2O34MHWL4A7BOXZTYJBCOYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZEF2O34MHWL4A7BOXZTYJBCOYS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T10:10:58Z","links":{"resolver":"https://pith.science/pith/ZEF2O34MHWL4A7BOXZTYJBCOYS","bundle":"https://pith.science/pith/ZEF2O34MHWL4A7BOXZTYJBCOYS/bundle.json","state":"https://pith.science/pith/ZEF2O34MHWL4A7BOXZTYJBCOYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZEF2O34MHWL4A7BOXZTYJBCOYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZEF2O34MHWL4A7BOXZTYJBCOYS","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":"4171f342a1e184fa201dcc94f12ea9365510d3af7de7c72051b0950215d14b77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-24T20:16:59Z","title_canon_sha256":"2b430dd5a49b87bf3622d304aec49101873ed6dd5a1897bbaed4d8ec7e198a89"},"schema_version":"1.0","source":{"id":"1705.09569","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09569","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09569v3","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09569","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZEF2O34MHWL4","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZEF2O34MHWL4A7BO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZEF2O34M","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:e680c516b98a22b91f72eee73ea518751e3c6fbcf4039a1126400d0234817df1","target":"graph","created_at":"2026-05-18T00:15:05Z","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":"We consider the problem of constructing codes that can correct $\\delta$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes, dating back to 1965, are zero-error single deletion $(\\delta=1)$ correcting codes, and have an asymptotically optimal redundancy. Finding similar codes for $\\delta \\geq 2$ deletions remains an open problem. In this work, we relax the standard zero-error (i.e., worst-case) decoding requirement by assuming that the positions of the $\\delta$ deletions (or insertions) are independent of the codeword. Our contribution is a new","authors_text":"Salim El Rouayheb, Serge Kas Hanna","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-24T20:16:59Z","title":"Guess & Check Codes for Deletions, Insertions, and Synchronization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09569","kind":"arxiv","version":3},"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:bc06dfb411cfc3053d501faa8c4c6bda500ef78d0249e7622c09fe0aad9b01db","target":"record","created_at":"2026-05-18T00:15:05Z","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":"4171f342a1e184fa201dcc94f12ea9365510d3af7de7c72051b0950215d14b77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-24T20:16:59Z","title_canon_sha256":"2b430dd5a49b87bf3622d304aec49101873ed6dd5a1897bbaed4d8ec7e198a89"},"schema_version":"1.0","source":{"id":"1705.09569","kind":"arxiv","version":3}},"canonical_sha256":"c90ba76f8c3d97c07c2ebe6784844ec486bb11a42aa6c0409aad08f4b59f659b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c90ba76f8c3d97c07c2ebe6784844ec486bb11a42aa6c0409aad08f4b59f659b","first_computed_at":"2026-05-18T00:15:05.517504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:05.517504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lcGbXUjzehR+Sp+W0+/UlDvS43cqQgULiMnGJlramjUz79tOmpQCAoNq+KFYzoWYCdoDjiqNoFQXURTL6d1hDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:05.518415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09569","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc06dfb411cfc3053d501faa8c4c6bda500ef78d0249e7622c09fe0aad9b01db","sha256:e680c516b98a22b91f72eee73ea518751e3c6fbcf4039a1126400d0234817df1"],"state_sha256":"2ac4d8f186db0909eb10ba77a45c1a63d66c1524b7980aea232775770a170a63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTAw2xd7buu1iNHIxY2LotqzpQxU0orm2uOKRETa9cUgn038fTwne5XqT3dAHM1W0Ufgr+V7F38tjoOP45EbCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:10:58.956017Z","bundle_sha256":"bf532d041cc35793443c13e4651d5190fab362677240413a83e8ec84e9e9d892"}}