{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DAUEOWDIIH7C52XNXHFC3QM3G6","short_pith_number":"pith:DAUEOWDI","schema_version":"1.0","canonical_sha256":"182847586841fe2eeaedb9ca2dc19b3791770941a956fec770fc5cbeefa20850","source":{"kind":"arxiv","id":"2201.12746","version":2},"attestation_state":"computed","paper":{"title":"Efficient Near-Optimal Codes for General Repeat Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Francisco Pernice, Mary Wootters, Ray Li","submitted_at":"2022-01-30T07:47:08Z","abstract_excerpt":"Given a probability distribution $\\mathcal{D}$ over the non-negative integers, a $\\mathcal{D}$-repeat channel acts on an input symbol by repeating it a number of times distributed as $\\mathcal{D}$. For example, the binary deletion channel ($\\mathcal{D}=Bernoulli$) and the Poisson repeat channel ($\\mathcal{D}=Poisson$) are special cases. We say a $\\mathcal{D}$-repeat channel is square-integrable if $\\mathcal{D}$ has finite first and second moments. In this paper, we construct explicit codes for all square-integrable $\\mathcal{D}$-repeat channels with rate arbitrarily close to the capacity, that"},"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":"2201.12746","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-30T07:47:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68213328f2af50d2766aceee836573bf93c578799aaf5322f30ec048318a5dd4","abstract_canon_sha256":"45261eeed31b7a49e6aff4f306931e6b40709f92c508404177d4f82e45c77c5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:27.353000Z","signature_b64":"rTJdjoFDW4nF94bNXql9p1txXNHEuo7XD23Of2oUuPBTttqbpURHGzw//fSi+maw0oILCRCH5m/XGTryBL/BCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182847586841fe2eeaedb9ca2dc19b3791770941a956fec770fc5cbeefa20850","last_reissued_at":"2026-07-05T03:54:27.352377Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:27.352377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Near-Optimal Codes for General Repeat Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Francisco Pernice, Mary Wootters, Ray Li","submitted_at":"2022-01-30T07:47:08Z","abstract_excerpt":"Given a probability distribution $\\mathcal{D}$ over the non-negative integers, a $\\mathcal{D}$-repeat channel acts on an input symbol by repeating it a number of times distributed as $\\mathcal{D}$. For example, the binary deletion channel ($\\mathcal{D}=Bernoulli$) and the Poisson repeat channel ($\\mathcal{D}=Poisson$) are special cases. We say a $\\mathcal{D}$-repeat channel is square-integrable if $\\mathcal{D}$ has finite first and second moments. In this paper, we construct explicit codes for all square-integrable $\\mathcal{D}$-repeat channels with rate arbitrarily close to the capacity, that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12746","kind":"arxiv","version":2},"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/2201.12746/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":"2201.12746","created_at":"2026-07-05T03:54:27.352455+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.12746v2","created_at":"2026-07-05T03:54:27.352455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12746","created_at":"2026-07-05T03:54:27.352455+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAUEOWDIIH7C","created_at":"2026-07-05T03:54:27.352455+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAUEOWDIIH7C52XN","created_at":"2026-07-05T03:54:27.352455+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAUEOWDI","created_at":"2026-07-05T03:54:27.352455+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/DAUEOWDIIH7C52XNXHFC3QM3G6","json":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6.json","graph_json":"https://pith.science/api/pith-number/DAUEOWDIIH7C52XNXHFC3QM3G6/graph.json","events_json":"https://pith.science/api/pith-number/DAUEOWDIIH7C52XNXHFC3QM3G6/events.json","paper":"https://pith.science/paper/DAUEOWDI"},"agent_actions":{"view_html":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6","download_json":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6.json","view_paper":"https://pith.science/paper/DAUEOWDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.12746&json=true","fetch_graph":"https://pith.science/api/pith-number/DAUEOWDIIH7C52XNXHFC3QM3G6/graph.json","fetch_events":"https://pith.science/api/pith-number/DAUEOWDIIH7C52XNXHFC3QM3G6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/action/storage_attestation","attest_author":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/action/author_attestation","sign_citation":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/action/citation_signature","submit_replication":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/action/replication_record"}},"created_at":"2026-07-05T03:54:27.352455+00:00","updated_at":"2026-07-05T03:54:27.352455+00:00"}