{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XUG2LTUKESJOO2SRODIVGY3F2O","short_pith_number":"pith:XUG2LTUK","schema_version":"1.0","canonical_sha256":"bd0da5ce8a2492e76a5170d1536365d39929bcf89f802e43b3f838e2be08a7b3","source":{"kind":"arxiv","id":"1705.01963","version":3},"attestation_state":"computed","paper":{"title":"Polynomial time decodable codes for the binary deletion channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Venkatesan Guruswami","submitted_at":"2017-05-04T18:18:07Z","abstract_excerpt":"In the random deletion channel, each bit is deleted independently with probability $p$. For the random deletion channel, the existence of codes of rate $(1-p)/9$, and thus bounded away from $0$ for any $p < 1$, has been known. We give an explicit construction with polynomial time encoding and deletion correction algorithms with rate $c_0 (1-p)$ for an absolute constant $c_0 > 0$."},"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":"1705.01963","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-04T18:18:07Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"e85727cf99a5a1aee2844a22efe48102d6f1898dcf4367b3bc49cb6876720e3a","abstract_canon_sha256":"d71eb3e671bb64ea87c8cd78e1c3d890f6e2cf5c906ca8ad2420f0bef3137931"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:33.508715Z","signature_b64":"KDEg8kA55RvNKCP6rTrHJyHI64IZOKSybLBJIkSONsanqx0UKRSHb5ECqATaiNLkLjR5sALis63WSxMb6YVjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd0da5ce8a2492e76a5170d1536365d39929bcf89f802e43b3f838e2be08a7b3","last_reissued_at":"2026-05-17T23:43:33.508349Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:33.508349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial time decodable codes for the binary deletion channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Venkatesan Guruswami","submitted_at":"2017-05-04T18:18:07Z","abstract_excerpt":"In the random deletion channel, each bit is deleted independently with probability $p$. For the random deletion channel, the existence of codes of rate $(1-p)/9$, and thus bounded away from $0$ for any $p < 1$, has been known. We give an explicit construction with polynomial time encoding and deletion correction algorithms with rate $c_0 (1-p)$ for an absolute constant $c_0 > 0$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01963","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.01963","created_at":"2026-05-17T23:43:33.508410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01963v3","created_at":"2026-05-17T23:43:33.508410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01963","created_at":"2026-05-17T23:43:33.508410+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUG2LTUKESJO","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUG2LTUKESJOO2SR","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUG2LTUK","created_at":"2026-05-18T12:31:56.362134+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/XUG2LTUKESJOO2SRODIVGY3F2O","json":"https://pith.science/pith/XUG2LTUKESJOO2SRODIVGY3F2O.json","graph_json":"https://pith.science/api/pith-number/XUG2LTUKESJOO2SRODIVGY3F2O/graph.json","events_json":"https://pith.science/api/pith-number/XUG2LTUKESJOO2SRODIVGY3F2O/events.json","paper":"https://pith.science/paper/XUG2LTUK"},"agent_actions":{"view_html":"https://pith.science/pith/XUG2LTUKESJOO2SRODIVGY3F2O","download_json":"https://pith.science/pith/XUG2LTUKESJOO2SRODIVGY3F2O.json","view_paper":"https://pith.science/paper/XUG2LTUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01963&json=true","fetch_graph":"https://pith.science/api/pith-number/XUG2LTUKESJOO2SRODIVGY3F2O/graph.json","fetch_events":"https://pith.science/api/pith-number/XUG2LTUKESJOO2SRODIVGY3F2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUG2LTUKESJOO2SRODIVGY3F2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUG2LTUKESJOO2SRODIVGY3F2O/action/storage_attestation","attest_author":"https://pith.science/pith/XUG2LTUKESJOO2SRODIVGY3F2O/action/author_attestation","sign_citation":"https://pith.science/pith/XUG2LTUKESJOO2SRODIVGY3F2O/action/citation_signature","submit_replication":"https://pith.science/pith/XUG2LTUKESJOO2SRODIVGY3F2O/action/replication_record"}},"created_at":"2026-05-17T23:43:33.508410+00:00","updated_at":"2026-05-17T23:43:33.508410+00:00"}