{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HTSTY3PC7B5EFFWTUGIZJAH4GA","short_pith_number":"pith:HTSTY3PC","schema_version":"1.0","canonical_sha256":"3ce53c6de2f87a4296d3a1919480fc302f14f3b04d32f3711d6458d7d0466214","source":{"kind":"arxiv","id":"1102.0040","version":1},"attestation_state":"computed","paper":{"title":"On the Zero-Error Capacity Threshold for Deletion Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ian A. Kash, Jonathan Ullman, Justin Thaler, Michael Mitzenmacher","submitted_at":"2011-01-31T23:41:41Z","abstract_excerpt":"We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook ${\\cal C}$ consisting of strings of $n$ bits, and our model of the channel corresponds to an adversary who may delete up to $pn$ of these bits for a constant $p$. Our goal is to decode correctly without error regardless of the actions of the adversary. We consider what values of $p$ allow non-zero capacity in this setting. We suggest multiple approaches, one of which makes use of the natural connection between this problem and the problem of finding the expected length of "},"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":"1102.0040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T23:41:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"319e2bc33b0ea7b2ee1f2b09fdf1a02c7b22804026d13ed5237e7e8804cc187d","abstract_canon_sha256":"33dbc9d4320300fa4884de760c7e6f18431ab13afb05923f469d4d682124c9ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:13.302019Z","signature_b64":"bsQcQriB1Q9+rARm5o6ziRnX7XEXYuIJgB2PQhGsy2wpUdGp5rxZJHbkYp8csAKherp0/yVQHtl+jIrd1L8BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ce53c6de2f87a4296d3a1919480fc302f14f3b04d32f3711d6458d7d0466214","last_reissued_at":"2026-05-18T04:30:13.301438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:13.301438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Zero-Error Capacity Threshold for Deletion Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ian A. Kash, Jonathan Ullman, Justin Thaler, Michael Mitzenmacher","submitted_at":"2011-01-31T23:41:41Z","abstract_excerpt":"We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook ${\\cal C}$ consisting of strings of $n$ bits, and our model of the channel corresponds to an adversary who may delete up to $pn$ of these bits for a constant $p$. Our goal is to decode correctly without error regardless of the actions of the adversary. We consider what values of $p$ allow non-zero capacity in this setting. We suggest multiple approaches, one of which makes use of the natural connection between this problem and the problem of finding the expected length of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0040","kind":"arxiv","version":1},"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":"1102.0040","created_at":"2026-05-18T04:30:13.301529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0040v1","created_at":"2026-05-18T04:30:13.301529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0040","created_at":"2026-05-18T04:30:13.301529+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTSTY3PC7B5E","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTSTY3PC7B5EFFWT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTSTY3PC","created_at":"2026-05-18T12:26:30.835961+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/HTSTY3PC7B5EFFWTUGIZJAH4GA","json":"https://pith.science/pith/HTSTY3PC7B5EFFWTUGIZJAH4GA.json","graph_json":"https://pith.science/api/pith-number/HTSTY3PC7B5EFFWTUGIZJAH4GA/graph.json","events_json":"https://pith.science/api/pith-number/HTSTY3PC7B5EFFWTUGIZJAH4GA/events.json","paper":"https://pith.science/paper/HTSTY3PC"},"agent_actions":{"view_html":"https://pith.science/pith/HTSTY3PC7B5EFFWTUGIZJAH4GA","download_json":"https://pith.science/pith/HTSTY3PC7B5EFFWTUGIZJAH4GA.json","view_paper":"https://pith.science/paper/HTSTY3PC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0040&json=true","fetch_graph":"https://pith.science/api/pith-number/HTSTY3PC7B5EFFWTUGIZJAH4GA/graph.json","fetch_events":"https://pith.science/api/pith-number/HTSTY3PC7B5EFFWTUGIZJAH4GA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTSTY3PC7B5EFFWTUGIZJAH4GA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTSTY3PC7B5EFFWTUGIZJAH4GA/action/storage_attestation","attest_author":"https://pith.science/pith/HTSTY3PC7B5EFFWTUGIZJAH4GA/action/author_attestation","sign_citation":"https://pith.science/pith/HTSTY3PC7B5EFFWTUGIZJAH4GA/action/citation_signature","submit_replication":"https://pith.science/pith/HTSTY3PC7B5EFFWTUGIZJAH4GA/action/replication_record"}},"created_at":"2026-05-18T04:30:13.301529+00:00","updated_at":"2026-05-18T04:30:13.301529+00:00"}