{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AJNLNI5AG62J4CF2KJ7467RCZV","short_pith_number":"pith:AJNLNI5A","canonical_record":{"source":{"id":"1711.01630","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T18:17:31Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"59ae1ac092abd3355a79ee73c764ea1f15ec4b05cbc5fd8ef9149b102d86d043","abstract_canon_sha256":"a69b5e5c48900e6800b0be14bbb923d8363a09c9242524d9b3cbf17d311d1b89"},"schema_version":"1.0"},"canonical_sha256":"025ab6a3a037b49e08ba527fcf7e22cd439a01b2d3ea6bd9ce9195f0c2d5ae95","source":{"kind":"arxiv","id":"1711.01630","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01630","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01630v4","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01630","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"AJNLNI5AG62J","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AJNLNI5AG62J4CF2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AJNLNI5A","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AJNLNI5AG62J4CF2KJ7467RCZV","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01630","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T18:17:31Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"59ae1ac092abd3355a79ee73c764ea1f15ec4b05cbc5fd8ef9149b102d86d043","abstract_canon_sha256":"a69b5e5c48900e6800b0be14bbb923d8363a09c9242524d9b3cbf17d311d1b89"},"schema_version":"1.0"},"canonical_sha256":"025ab6a3a037b49e08ba527fcf7e22cd439a01b2d3ea6bd9ce9195f0c2d5ae95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:47.359275Z","signature_b64":"HcCrIC55Thh2vIXHtcpFgQoYcfCz2i648Cq7Le4t7hLxFLtyr+NWs5Ypx1GMjIzl3xsnjEGDOKQ+hmz8GkmzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025ab6a3a037b49e08ba527fcf7e22cd439a01b2d3ea6bd9ce9195f0c2d5ae95","last_reissued_at":"2026-05-18T00:13:47.358191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:47.358191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01630","source_version":4,"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-05-18T00:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/kScFY60jrxD/OX7aUY2XhFhN0VbakJiy5fbu8LSo6Zrvw766pywyEyAW3bV0kzvB435odEZdfLLPj4NetIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:43:56.959000Z"},"content_sha256":"8b32a190a7dafaa0022f05c5a1dfe2f0b963de518a08cfff03854279fae81ee0","schema_version":"1.0","event_id":"sha256:8b32a190a7dafaa0022f05c5a1dfe2f0b963de518a08cfff03854279fae81ee0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AJNLNI5AG62J4CF2KJ7467RCZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity Upper Bounds for Deletion-Type Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Mahdi Cheraghchi","submitted_at":"2017-11-05T18:17:31Z","abstract_excerpt":"We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the classical deletion channel, we give a special attention to the Poisson-repeat channel introduced by Mitzenmacher and Drinea (IEEE Transactions on Information Theory, 2006). Our framework can be applied to obtain capacity upper bounds for any repetition distribution (the deletion and Poisson-repeat channels corresponding to the special cases of Bernoulli and Po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01630","kind":"arxiv","version":4},"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"},"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-05-18T00:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBGxvBGV6x7CsKBzs/3Q5WaloptGC59VenqEA2tJ5if3ck+N2WRMkk/nwEFOLxORwsgU8cvyWHidSDinNIJ/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:43:56.959355Z"},"content_sha256":"3cccc57b29b773653afd62c1055482050441c9e195495c819b9b4a5bd689a62a","schema_version":"1.0","event_id":"sha256:3cccc57b29b773653afd62c1055482050441c9e195495c819b9b4a5bd689a62a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJNLNI5AG62J4CF2KJ7467RCZV/bundle.json","state_url":"https://pith.science/pith/AJNLNI5AG62J4CF2KJ7467RCZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJNLNI5AG62J4CF2KJ7467RCZV/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-06-02T01:43:56Z","links":{"resolver":"https://pith.science/pith/AJNLNI5AG62J4CF2KJ7467RCZV","bundle":"https://pith.science/pith/AJNLNI5AG62J4CF2KJ7467RCZV/bundle.json","state":"https://pith.science/pith/AJNLNI5AG62J4CF2KJ7467RCZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJNLNI5AG62J4CF2KJ7467RCZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AJNLNI5AG62J4CF2KJ7467RCZV","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":"a69b5e5c48900e6800b0be14bbb923d8363a09c9242524d9b3cbf17d311d1b89","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T18:17:31Z","title_canon_sha256":"59ae1ac092abd3355a79ee73c764ea1f15ec4b05cbc5fd8ef9149b102d86d043"},"schema_version":"1.0","source":{"id":"1711.01630","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01630","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01630v4","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01630","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"AJNLNI5AG62J","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AJNLNI5AG62J4CF2","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AJNLNI5A","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:3cccc57b29b773653afd62c1055482050441c9e195495c819b9b4a5bd689a62a","target":"graph","created_at":"2026-05-18T00:13:47Z","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"},"paper":{"abstract_excerpt":"We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions. Other than the classical deletion channel, we give a special attention to the Poisson-repeat channel introduced by Mitzenmacher and Drinea (IEEE Transactions on Information Theory, 2006). Our framework can be applied to obtain capacity upper bounds for any repetition distribution (the deletion and Poisson-repeat channels corresponding to the special cases of Bernoulli and Po","authors_text":"Mahdi Cheraghchi","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T18:17:31Z","title":"Capacity Upper Bounds for Deletion-Type Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01630","kind":"arxiv","version":4},"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:8b32a190a7dafaa0022f05c5a1dfe2f0b963de518a08cfff03854279fae81ee0","target":"record","created_at":"2026-05-18T00:13:47Z","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":"a69b5e5c48900e6800b0be14bbb923d8363a09c9242524d9b3cbf17d311d1b89","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-05T18:17:31Z","title_canon_sha256":"59ae1ac092abd3355a79ee73c764ea1f15ec4b05cbc5fd8ef9149b102d86d043"},"schema_version":"1.0","source":{"id":"1711.01630","kind":"arxiv","version":4}},"canonical_sha256":"025ab6a3a037b49e08ba527fcf7e22cd439a01b2d3ea6bd9ce9195f0c2d5ae95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"025ab6a3a037b49e08ba527fcf7e22cd439a01b2d3ea6bd9ce9195f0c2d5ae95","first_computed_at":"2026-05-18T00:13:47.358191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:47.358191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HcCrIC55Thh2vIXHtcpFgQoYcfCz2i648Cq7Le4t7hLxFLtyr+NWs5Ypx1GMjIzl3xsnjEGDOKQ+hmz8GkmzAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:47.359275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01630","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b32a190a7dafaa0022f05c5a1dfe2f0b963de518a08cfff03854279fae81ee0","sha256:3cccc57b29b773653afd62c1055482050441c9e195495c819b9b4a5bd689a62a"],"state_sha256":"9093b8f87ad5a8cc3e104edd54fad9105ed9051f2c2be742b6ef4e9b2f0ed085"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASfh/4vUalN9+FfzrqSPSqOsK2aLqDg5TqsQ/BO2fw98bA86dL59CKObkvwDUZolSfNL/s21NF48BCpUq9pCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:43:56.961282Z","bundle_sha256":"1edf15159f40626effb670f965a7356679e14d7c303d749bdea988bec08ff1f3"}}