{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DAUEOWDIIH7C52XNXHFC3QM3G6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"45261eeed31b7a49e6aff4f306931e6b40709f92c508404177d4f82e45c77c5e","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-30T07:47:08Z","title_canon_sha256":"68213328f2af50d2766aceee836573bf93c578799aaf5322f30ec048318a5dd4"},"schema_version":"1.0","source":{"id":"2201.12746","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12746","created_at":"2026-07-05T03:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12746v2","created_at":"2026-07-05T03:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12746","created_at":"2026-07-05T03:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"DAUEOWDIIH7C","created_at":"2026-07-05T03:54:27Z"},{"alias_kind":"pith_short_16","alias_value":"DAUEOWDIIH7C52XN","created_at":"2026-07-05T03:54:27Z"},{"alias_kind":"pith_short_8","alias_value":"DAUEOWDI","created_at":"2026-07-05T03:54:27Z"}],"graph_snapshots":[{"event_id":"sha256:4d53413ef2270aff79d6bbdc149bab4c8ef588ebfdd5ef3d08f341d10572e55f","target":"graph","created_at":"2026-07-05T03:54:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2201.12746/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Francisco Pernice, Mary Wootters, Ray Li","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-30T07:47:08Z","title":"Efficient Near-Optimal Codes for General Repeat Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12746","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:478b09ceecd70910236eba47a6bfb0f2387c8b28ec190ba162a1861f7365e3eb","target":"record","created_at":"2026-07-05T03:54:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"45261eeed31b7a49e6aff4f306931e6b40709f92c508404177d4f82e45c77c5e","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-30T07:47:08Z","title_canon_sha256":"68213328f2af50d2766aceee836573bf93c578799aaf5322f30ec048318a5dd4"},"schema_version":"1.0","source":{"id":"2201.12746","kind":"arxiv","version":2}},"canonical_sha256":"182847586841fe2eeaedb9ca2dc19b3791770941a956fec770fc5cbeefa20850","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"182847586841fe2eeaedb9ca2dc19b3791770941a956fec770fc5cbeefa20850","first_computed_at":"2026-07-05T03:54:27.352377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:54:27.352377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rTJdjoFDW4nF94bNXql9p1txXNHEuo7XD23Of2oUuPBTttqbpURHGzw//fSi+maw0oILCRCH5m/XGTryBL/BCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:54:27.353000Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.12746","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:478b09ceecd70910236eba47a6bfb0f2387c8b28ec190ba162a1861f7365e3eb","sha256:4d53413ef2270aff79d6bbdc149bab4c8ef588ebfdd5ef3d08f341d10572e55f"],"state_sha256":"b96498b81a1c0015b3b421a104318eb87a96defae7d69fb23bd1b0adf310bc7f"}