{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZRZ6WLID7EXE4YQ3T7GGS33RQ5","short_pith_number":"pith:ZRZ6WLID","canonical_record":{"source":{"id":"1806.06218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-16T10:36:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4f8b784ca63a8d72464cdf6806102834b381cf7645174645297c07742fc08262","abstract_canon_sha256":"da3a15d7ac348909d737a0a39e0c3f88401549fe3ed89e7b24ff898a515d4b79"},"schema_version":"1.0"},"canonical_sha256":"cc73eb2d03f92e4e621b9fcc696f718744a87c4c02e55e63ec0ab166888885f0","source":{"kind":"arxiv","id":"1806.06218","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06218","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06218v2","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06218","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZRZ6WLID7EXE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZRZ6WLID7EXE4YQ3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZRZ6WLID","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZRZ6WLID7EXE4YQ3T7GGS33RQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1806.06218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-16T10:36:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4f8b784ca63a8d72464cdf6806102834b381cf7645174645297c07742fc08262","abstract_canon_sha256":"da3a15d7ac348909d737a0a39e0c3f88401549fe3ed89e7b24ff898a515d4b79"},"schema_version":"1.0"},"canonical_sha256":"cc73eb2d03f92e4e621b9fcc696f718744a87c4c02e55e63ec0ab166888885f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:27.657253Z","signature_b64":"5hMOm3RogPDKr6V00SLBRQyNw6rjBb/EMX1xdKsnr+dYv7vhp0u7Da/L9D+aY/Jsxi6mcDHzk5j6k10Q//GyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc73eb2d03f92e4e621b9fcc696f718744a87c4c02e55e63ec0ab166888885f0","last_reissued_at":"2026-05-18T00:10:27.656524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:27.656524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.06218","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-05-18T00:10:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFhloSreS+1kJ8ib+dBloFpmwH7leO1IO81AKh6jJp/8gMbBYUkIDGlzcP+78Up3iCUz8N4gjjdNWYDOWtfMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:36:01.337807Z"},"content_sha256":"bb27c9073f48770cfb2c7c5dd5ae1145d6898a437485f06a3f6a32471e1f640f","schema_version":"1.0","event_id":"sha256:bb27c9073f48770cfb2c7c5dd5ae1145d6898a437485f06a3f6a32471e1f640f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZRZ6WLID7EXE4YQ3T7GGS33RQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jo\\~ao Ribeiro, Mahdi Cheraghchi","submitted_at":"2018-06-16T10:36:09Z","abstract_excerpt":"We study natural examples of binary channels with synchronization errors. These include the duplication channel, which independently outputs a given bit once or twice, and geometric channels that repeat a given bit according to a geometric rule, with or without the possibility of bit deletion. We apply the general framework of Cheraghchi (STOC 2018) to obtain sharp analytical upper bounds on the capacity of these channels. Previously, upper bounds were known via numerical computations involving the computation of finite approximations of the channels by a computer and then using the obtained n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06218","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":""},"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:10:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ku5LliwfNmnixPOW2znT7DEhUxsLKTXvWstGHIPE6HjY7iNCntKbk/gBjRqLPtjLihFWBK2oEvikTG+yYf3bDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:36:01.338154Z"},"content_sha256":"4256c4bb72c804063a9f22234e7fee92e33b56573303077a1814b9e1591c043a","schema_version":"1.0","event_id":"sha256:4256c4bb72c804063a9f22234e7fee92e33b56573303077a1814b9e1591c043a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRZ6WLID7EXE4YQ3T7GGS33RQ5/bundle.json","state_url":"https://pith.science/pith/ZRZ6WLID7EXE4YQ3T7GGS33RQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRZ6WLID7EXE4YQ3T7GGS33RQ5/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-01T21:36:01Z","links":{"resolver":"https://pith.science/pith/ZRZ6WLID7EXE4YQ3T7GGS33RQ5","bundle":"https://pith.science/pith/ZRZ6WLID7EXE4YQ3T7GGS33RQ5/bundle.json","state":"https://pith.science/pith/ZRZ6WLID7EXE4YQ3T7GGS33RQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRZ6WLID7EXE4YQ3T7GGS33RQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZRZ6WLID7EXE4YQ3T7GGS33RQ5","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":"da3a15d7ac348909d737a0a39e0c3f88401549fe3ed89e7b24ff898a515d4b79","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-16T10:36:09Z","title_canon_sha256":"4f8b784ca63a8d72464cdf6806102834b381cf7645174645297c07742fc08262"},"schema_version":"1.0","source":{"id":"1806.06218","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.06218","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"arxiv_version","alias_value":"1806.06218v2","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06218","created_at":"2026-05-18T00:10:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZRZ6WLID7EXE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZRZ6WLID7EXE4YQ3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZRZ6WLID","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:4256c4bb72c804063a9f22234e7fee92e33b56573303077a1814b9e1591c043a","target":"graph","created_at":"2026-05-18T00:10: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"},"paper":{"abstract_excerpt":"We study natural examples of binary channels with synchronization errors. These include the duplication channel, which independently outputs a given bit once or twice, and geometric channels that repeat a given bit according to a geometric rule, with or without the possibility of bit deletion. We apply the general framework of Cheraghchi (STOC 2018) to obtain sharp analytical upper bounds on the capacity of these channels. Previously, upper bounds were known via numerical computations involving the computation of finite approximations of the channels by a computer and then using the obtained n","authors_text":"Jo\\~ao Ribeiro, Mahdi Cheraghchi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-16T10:36:09Z","title":"Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06218","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:bb27c9073f48770cfb2c7c5dd5ae1145d6898a437485f06a3f6a32471e1f640f","target":"record","created_at":"2026-05-18T00:10: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":"da3a15d7ac348909d737a0a39e0c3f88401549fe3ed89e7b24ff898a515d4b79","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-16T10:36:09Z","title_canon_sha256":"4f8b784ca63a8d72464cdf6806102834b381cf7645174645297c07742fc08262"},"schema_version":"1.0","source":{"id":"1806.06218","kind":"arxiv","version":2}},"canonical_sha256":"cc73eb2d03f92e4e621b9fcc696f718744a87c4c02e55e63ec0ab166888885f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc73eb2d03f92e4e621b9fcc696f718744a87c4c02e55e63ec0ab166888885f0","first_computed_at":"2026-05-18T00:10:27.656524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:27.656524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5hMOm3RogPDKr6V00SLBRQyNw6rjBb/EMX1xdKsnr+dYv7vhp0u7Da/L9D+aY/Jsxi6mcDHzk5j6k10Q//GyDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:27.657253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.06218","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb27c9073f48770cfb2c7c5dd5ae1145d6898a437485f06a3f6a32471e1f640f","sha256:4256c4bb72c804063a9f22234e7fee92e33b56573303077a1814b9e1591c043a"],"state_sha256":"5a0253858512ca3552659d0c9d8ca6ea1560ed0cb07a2a6cc1cafcdfb3af68d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXQU4DZSao+I0/SOIIjmppisHyp5QVXOf5949HdbCexYjDe8nrZ6vb0iV5S5zikm+/HecjRVbV6tR5DyHriqBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:36:01.340141Z","bundle_sha256":"e06e12479b82f26345b446b5b1515771dcee8446f4dbb07fd842b1657029a1bc"}}