{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DAUEOWDIIH7C52XNXHFC3QM3G6","short_pith_number":"pith:DAUEOWDI","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"},"canonical_sha256":"182847586841fe2eeaedb9ca2dc19b3791770941a956fec770fc5cbeefa20850","source":{"kind":"arxiv","id":"2201.12746","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DAUEOWDIIH7C52XNXHFC3QM3G6","target":"record","payload":{"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"},"canonical_sha256":"182847586841fe2eeaedb9ca2dc19b3791770941a956fec770fc5cbeefa20850","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"},"source_kind":"arxiv","source_id":"2201.12746","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8u4z6++JFN0l8IrMBx74N/npWVkexIaa9Br3V1te1DL0Mp36QlTF6VoGn7Kmy5sPvgdDQoGkuRVGwxa40celAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T17:57:33.180736Z"},"content_sha256":"478b09ceecd70910236eba47a6bfb0f2387c8b28ec190ba162a1861f7365e3eb","schema_version":"1.0","event_id":"sha256:478b09ceecd70910236eba47a6bfb0f2387c8b28ec190ba162a1861f7365e3eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DAUEOWDIIH7C52XNXHFC3QM3G6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T03:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luxWEwmIdyg/7aO+AEpHCBJlE5QM3cAxwVzwO7ApBgynOIisrQj2wceW3hUlQf8AZAfBCcH/DlHupTBuvCc1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T17:57:33.181101Z"},"content_sha256":"4d53413ef2270aff79d6bbdc149bab4c8ef588ebfdd5ef3d08f341d10572e55f","schema_version":"1.0","event_id":"sha256:4d53413ef2270aff79d6bbdc149bab4c8ef588ebfdd5ef3d08f341d10572e55f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/bundle.json","state_url":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-22T17:57:33Z","links":{"resolver":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6","bundle":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/bundle.json","state":"https://pith.science/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAUEOWDIIH7C52XNXHFC3QM3G6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJ5MfxBZ2/8wgJA11lRxOn0JpUT/F7SPwjuL3pDoWU90Np/u5+MI0wQzr2T2v9D4Nz53/7N5P3p4PZkurZMdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-22T17:57:33.183461Z","bundle_sha256":"43506b3b665e01bdaee8490c7de9a705ddba0561f874f35187bcda0e7e94faed"}}