{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TZL43TOV4RDKHOS2GICOC2UXEW","short_pith_number":"pith:TZL43TOV","schema_version":"1.0","canonical_sha256":"9e57cdcdd5e446a3ba5a3204e16a9725aa461348b8e759743aae9ca5d1d1960e","source":{"kind":"arxiv","id":"1906.07887","version":1},"attestation_state":"computed","paper":{"title":"Tutorial on algebraic deletion correction codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","eess.SP","math.IT"],"primary_cat":"cs.DS","authors_text":"Kedar Tatwawadi, Shubham Chandak","submitted_at":"2019-06-19T02:56:11Z","abstract_excerpt":"The deletion channel is known to be a notoriously diffcult channel to design error-correction codes for. In spite of this difficulty, there are some beautiful code constructions which give some intuition about the channel and about what good deletion codes look like. In this tutorial we will take a look at some of them. This document is a transcript of my talk at the coding theory reading group on some interesting works on deletion channel. It is not intended to be an exhaustive survey of works on deletion channel, but more as a tutorial to some of the important and cute ideas in this area. Fo"},"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":"1906.07887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-06-19T02:56:11Z","cross_cats_sorted":["cs.IT","eess.SP","math.IT"],"title_canon_sha256":"f970e7c8de19587baa4099c7109163b25250417fefef8fde40d57cc40fd957c6","abstract_canon_sha256":"05b647b583c60097406a45e68ecfcf046bc08de91751ad7406c8d28ba36d521e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:57.424041Z","signature_b64":"38V83QcuGC9Yzmgxx5pmIGopD6IOu2imR4FZ7KKow60Q7VNsShMdGigglluIVxGbbOK7TTk8cd1OC0q6MWNkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e57cdcdd5e446a3ba5a3204e16a9725aa461348b8e759743aae9ca5d1d1960e","last_reissued_at":"2026-05-17T23:42:57.423340Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:57.423340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tutorial on algebraic deletion correction codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","eess.SP","math.IT"],"primary_cat":"cs.DS","authors_text":"Kedar Tatwawadi, Shubham Chandak","submitted_at":"2019-06-19T02:56:11Z","abstract_excerpt":"The deletion channel is known to be a notoriously diffcult channel to design error-correction codes for. In spite of this difficulty, there are some beautiful code constructions which give some intuition about the channel and about what good deletion codes look like. In this tutorial we will take a look at some of them. This document is a transcript of my talk at the coding theory reading group on some interesting works on deletion channel. It is not intended to be an exhaustive survey of works on deletion channel, but more as a tutorial to some of the important and cute ideas in this area. Fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07887","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":"1906.07887","created_at":"2026-05-17T23:42:57.423446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07887v1","created_at":"2026-05-17T23:42:57.423446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07887","created_at":"2026-05-17T23:42:57.423446+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZL43TOV4RDK","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZL43TOV4RDKHOS2","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZL43TOV","created_at":"2026-05-18T12:33:30.264802+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/TZL43TOV4RDKHOS2GICOC2UXEW","json":"https://pith.science/pith/TZL43TOV4RDKHOS2GICOC2UXEW.json","graph_json":"https://pith.science/api/pith-number/TZL43TOV4RDKHOS2GICOC2UXEW/graph.json","events_json":"https://pith.science/api/pith-number/TZL43TOV4RDKHOS2GICOC2UXEW/events.json","paper":"https://pith.science/paper/TZL43TOV"},"agent_actions":{"view_html":"https://pith.science/pith/TZL43TOV4RDKHOS2GICOC2UXEW","download_json":"https://pith.science/pith/TZL43TOV4RDKHOS2GICOC2UXEW.json","view_paper":"https://pith.science/paper/TZL43TOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07887&json=true","fetch_graph":"https://pith.science/api/pith-number/TZL43TOV4RDKHOS2GICOC2UXEW/graph.json","fetch_events":"https://pith.science/api/pith-number/TZL43TOV4RDKHOS2GICOC2UXEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZL43TOV4RDKHOS2GICOC2UXEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZL43TOV4RDKHOS2GICOC2UXEW/action/storage_attestation","attest_author":"https://pith.science/pith/TZL43TOV4RDKHOS2GICOC2UXEW/action/author_attestation","sign_citation":"https://pith.science/pith/TZL43TOV4RDKHOS2GICOC2UXEW/action/citation_signature","submit_replication":"https://pith.science/pith/TZL43TOV4RDKHOS2GICOC2UXEW/action/replication_record"}},"created_at":"2026-05-17T23:42:57.423446+00:00","updated_at":"2026-05-17T23:42:57.423446+00:00"}