{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ME36LGYHLRKVZ246CCZJGB5L7P","short_pith_number":"pith:ME36LGYH","schema_version":"1.0","canonical_sha256":"6137e59b075c555ceb9e10b29307abfbd6fde5af5e4e4dfa38802793f62693a9","source":{"kind":"arxiv","id":"2210.07437","version":1},"attestation_state":"computed","paper":{"title":"Upper bounds on the Rate of Uniformly-Random Codes for the Deletion Channel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Berivan Isik, Francisco Pernice, Tsachy Weissman","submitted_at":"2022-10-14T00:43:54Z","abstract_excerpt":"We consider the maximum coding rate achievable by uniformly-random codes for the deletion channel. We prove an upper bound that's within 0.1 of the best known lower bounds for all values of the deletion probability $d,$ and much closer for small and large $d.$ We give simulation results which suggest that our upper bound is within 0.05 of the exact value for all $d$, and within $0.01$ for $d>0.75$. Despite our upper bounds, based on simulations, we conjecture that a positive rate is achievable with uniformly-random codes for all deletion probabilities less than 1. Our results imply impossibili"},"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":"2210.07437","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-14T00:43:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51e03d40df6f810ece8a425cfa9ca51ba765bc2b4a65758d88405baefee7bfd9","abstract_canon_sha256":"20501ffd34989bcf279aedb8b67975257d36ef90403c43a88ed4e9656ac2caa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:37.123114Z","signature_b64":"AKGd3nQPYYl87eKY4bj289gdB2zsTQolRSV55eZj8RZx54G901ftYH+Bk+Cy5k9yG5NWbBy90KbXG8EXxQ9bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6137e59b075c555ceb9e10b29307abfbd6fde5af5e4e4dfa38802793f62693a9","last_reissued_at":"2026-07-05T05:06:37.122749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:37.122749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds on the Rate of Uniformly-Random Codes for the Deletion Channel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Berivan Isik, Francisco Pernice, Tsachy Weissman","submitted_at":"2022-10-14T00:43:54Z","abstract_excerpt":"We consider the maximum coding rate achievable by uniformly-random codes for the deletion channel. We prove an upper bound that's within 0.1 of the best known lower bounds for all values of the deletion probability $d,$ and much closer for small and large $d.$ We give simulation results which suggest that our upper bound is within 0.05 of the exact value for all $d$, and within $0.01$ for $d>0.75$. Despite our upper bounds, based on simulations, we conjecture that a positive rate is achievable with uniformly-random codes for all deletion probabilities less than 1. Our results imply impossibili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.07437","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.07437/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.07437","created_at":"2026-07-05T05:06:37.122808+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.07437v1","created_at":"2026-07-05T05:06:37.122808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.07437","created_at":"2026-07-05T05:06:37.122808+00:00"},{"alias_kind":"pith_short_12","alias_value":"ME36LGYHLRKV","created_at":"2026-07-05T05:06:37.122808+00:00"},{"alias_kind":"pith_short_16","alias_value":"ME36LGYHLRKVZ246","created_at":"2026-07-05T05:06:37.122808+00:00"},{"alias_kind":"pith_short_8","alias_value":"ME36LGYH","created_at":"2026-07-05T05:06:37.122808+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/ME36LGYHLRKVZ246CCZJGB5L7P","json":"https://pith.science/pith/ME36LGYHLRKVZ246CCZJGB5L7P.json","graph_json":"https://pith.science/api/pith-number/ME36LGYHLRKVZ246CCZJGB5L7P/graph.json","events_json":"https://pith.science/api/pith-number/ME36LGYHLRKVZ246CCZJGB5L7P/events.json","paper":"https://pith.science/paper/ME36LGYH"},"agent_actions":{"view_html":"https://pith.science/pith/ME36LGYHLRKVZ246CCZJGB5L7P","download_json":"https://pith.science/pith/ME36LGYHLRKVZ246CCZJGB5L7P.json","view_paper":"https://pith.science/paper/ME36LGYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.07437&json=true","fetch_graph":"https://pith.science/api/pith-number/ME36LGYHLRKVZ246CCZJGB5L7P/graph.json","fetch_events":"https://pith.science/api/pith-number/ME36LGYHLRKVZ246CCZJGB5L7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ME36LGYHLRKVZ246CCZJGB5L7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ME36LGYHLRKVZ246CCZJGB5L7P/action/storage_attestation","attest_author":"https://pith.science/pith/ME36LGYHLRKVZ246CCZJGB5L7P/action/author_attestation","sign_citation":"https://pith.science/pith/ME36LGYHLRKVZ246CCZJGB5L7P/action/citation_signature","submit_replication":"https://pith.science/pith/ME36LGYHLRKVZ246CCZJGB5L7P/action/replication_record"}},"created_at":"2026-07-05T05:06:37.122808+00:00","updated_at":"2026-07-05T05:06:37.122808+00:00"}