{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V4XY2WJR2KS4KQKBIFHBKUWR2Y","short_pith_number":"pith:V4XY2WJR","schema_version":"1.0","canonical_sha256":"af2f8d5931d2a5c54141414e1552d1d6371b16fb2a1dabb0bdd44f893d43cb76","source":{"kind":"arxiv","id":"1612.06335","version":4},"attestation_state":"computed","paper":{"title":"Coding against deletions in oblivious and online models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Venkatesan Guruswami","submitted_at":"2016-12-19T20:36:01Z","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"},"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":"1612.06335","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-19T20:36:01Z","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"title_canon_sha256":"91ceef915a0f3f8a94436376a07fc5991ca598ef13c33589042a51f737b3faf4","abstract_canon_sha256":"73e8bcef7787ade41fa3db2c38592312aa112bf28f1a447f46f2d138d7a2c987"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:28.814767Z","signature_b64":"bRcb+ZRX78OovYc5A/Uz6lOCh+Vo5SQlh32Vqhkk2umyIsMH8WrqY9KnqJnaHW/WNEhCyEPPdL7Lnq2qINuqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af2f8d5931d2a5c54141414e1552d1d6371b16fb2a1dabb0bdd44f893d43cb76","last_reissued_at":"2026-05-18T00:39:28.814108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:28.814108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding against deletions in oblivious and online models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Venkatesan Guruswami","submitted_at":"2016-12-19T20:36:01Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06335","kind":"arxiv","version":4},"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":"1612.06335","created_at":"2026-05-18T00:39:28.814215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06335v4","created_at":"2026-05-18T00:39:28.814215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06335","created_at":"2026-05-18T00:39:28.814215+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4XY2WJR2KS4","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4XY2WJR2KS4KQKB","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4XY2WJR","created_at":"2026-05-18T12:30:46.583412+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/V4XY2WJR2KS4KQKBIFHBKUWR2Y","json":"https://pith.science/pith/V4XY2WJR2KS4KQKBIFHBKUWR2Y.json","graph_json":"https://pith.science/api/pith-number/V4XY2WJR2KS4KQKBIFHBKUWR2Y/graph.json","events_json":"https://pith.science/api/pith-number/V4XY2WJR2KS4KQKBIFHBKUWR2Y/events.json","paper":"https://pith.science/paper/V4XY2WJR"},"agent_actions":{"view_html":"https://pith.science/pith/V4XY2WJR2KS4KQKBIFHBKUWR2Y","download_json":"https://pith.science/pith/V4XY2WJR2KS4KQKBIFHBKUWR2Y.json","view_paper":"https://pith.science/paper/V4XY2WJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06335&json=true","fetch_graph":"https://pith.science/api/pith-number/V4XY2WJR2KS4KQKBIFHBKUWR2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/V4XY2WJR2KS4KQKBIFHBKUWR2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4XY2WJR2KS4KQKBIFHBKUWR2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4XY2WJR2KS4KQKBIFHBKUWR2Y/action/storage_attestation","attest_author":"https://pith.science/pith/V4XY2WJR2KS4KQKBIFHBKUWR2Y/action/author_attestation","sign_citation":"https://pith.science/pith/V4XY2WJR2KS4KQKBIFHBKUWR2Y/action/citation_signature","submit_replication":"https://pith.science/pith/V4XY2WJR2KS4KQKBIFHBKUWR2Y/action/replication_record"}},"created_at":"2026-05-18T00:39:28.814215+00:00","updated_at":"2026-05-18T00:39:28.814215+00:00"}