{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V4XY2WJR2KS4KQKBIFHBKUWR2Y","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":"73e8bcef7787ade41fa3db2c38592312aa112bf28f1a447f46f2d138d7a2c987","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-19T20:36:01Z","title_canon_sha256":"91ceef915a0f3f8a94436376a07fc5991ca598ef13c33589042a51f737b3faf4"},"schema_version":"1.0","source":{"id":"1612.06335","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06335","created_at":"2026-05-18T00:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06335v4","created_at":"2026-05-18T00:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06335","created_at":"2026-05-18T00:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"V4XY2WJR2KS4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V4XY2WJR2KS4KQKB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V4XY2WJR","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:20a0f2af93de7de9c7433f946be4e68ca3c87ae6abb039170ace9375961e9e11","target":"graph","created_at":"2026-05-18T00:39:28Z","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 binary error correcting codes when errors are deletions. A basic challenge concerning deletion codes is determining $p_0^{(adv)}$, the zero-rate threshold of adversarial deletions, defined to be the supremum of all $p$ for which there exists a code family with rate bounded away from 0 capable of correcting a fraction $p$ of adversarial deletions. A recent construction of deletion-correcting codes [Bukh et al 17] shows that $p_0^{(adv)} \\ge \\sqrt{2}-1$, and the trivial upper bound, $p_0^{(adv)}\\le\\frac{1}{2}$, is the best known. Perhaps surprisingly, we do not know whether or not $p","authors_text":"Ray Li, Venkatesan Guruswami","cross_cats":["cs.CC","cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-19T20:36:01Z","title":"Coding against deletions in oblivious and online models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06335","kind":"arxiv","version":4},"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:f3fb253bcb97e09d20f25374e008ae5c80fb21f1ce3591a500a19c1624b27dec","target":"record","created_at":"2026-05-18T00:39:28Z","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":"73e8bcef7787ade41fa3db2c38592312aa112bf28f1a447f46f2d138d7a2c987","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-19T20:36:01Z","title_canon_sha256":"91ceef915a0f3f8a94436376a07fc5991ca598ef13c33589042a51f737b3faf4"},"schema_version":"1.0","source":{"id":"1612.06335","kind":"arxiv","version":4}},"canonical_sha256":"af2f8d5931d2a5c54141414e1552d1d6371b16fb2a1dabb0bdd44f893d43cb76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af2f8d5931d2a5c54141414e1552d1d6371b16fb2a1dabb0bdd44f893d43cb76","first_computed_at":"2026-05-18T00:39:28.814108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:28.814108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bRcb+ZRX78OovYc5A/Uz6lOCh+Vo5SQlh32Vqhkk2umyIsMH8WrqY9KnqJnaHW/WNEhCyEPPdL7Lnq2qINuqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:28.814767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06335","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3fb253bcb97e09d20f25374e008ae5c80fb21f1ce3591a500a19c1624b27dec","sha256:20a0f2af93de7de9c7433f946be4e68ca3c87ae6abb039170ace9375961e9e11"],"state_sha256":"09341f69885b453a10a3317542d9088d7047f01c32de124a877e889bdbb55be2"}