{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DZQGCBWY5OAFVAFSEEC5VOEZWE","short_pith_number":"pith:DZQGCBWY","canonical_record":{"source":{"id":"1508.04095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-17T17:41:47Z","cross_cats_sorted":["cs.DS","math.IT","quant-ph"],"title_canon_sha256":"b7b65584d641d2783957385278b0a06ac3c9950b232b1bd8976e35f774b3103f","abstract_canon_sha256":"4da24c607eedb3ecbc460e30b7a090baee41b6ce0526b3fb99f00eb6cc7a914a"},"schema_version":"1.0"},"canonical_sha256":"1e606106d8eb805a80b22105dab899b11ea55ad2d40e076a0c6c6bbdafa0ea49","source":{"kind":"arxiv","id":"1508.04095","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04095","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04095v2","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04095","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"DZQGCBWY5OAF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZQGCBWY5OAFVAFS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZQGCBWY","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DZQGCBWY5OAFVAFSEEC5VOEZWE","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-17T17:41:47Z","cross_cats_sorted":["cs.DS","math.IT","quant-ph"],"title_canon_sha256":"b7b65584d641d2783957385278b0a06ac3c9950b232b1bd8976e35f774b3103f","abstract_canon_sha256":"4da24c607eedb3ecbc460e30b7a090baee41b6ce0526b3fb99f00eb6cc7a914a"},"schema_version":"1.0"},"canonical_sha256":"1e606106d8eb805a80b22105dab899b11ea55ad2d40e076a0c6c6bbdafa0ea49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:41.031953Z","signature_b64":"XHP+lKXuS5UAeM89hEH7Wxu73RbsoVFSKw1zBdn8S2M5tVDcoT4y/Bt0/v8KjLW05N8aT6ebT+bl1eVBb8pFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e606106d8eb805a80b22105dab899b11ea55ad2d40e076a0c6c6bbdafa0ea49","last_reissued_at":"2026-05-18T00:12:41.031491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:41.031491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04095","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:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmkJvIkXqE6bfnmWkpFLn7K5yzgVFXNDljKU8bQACFjFi5k1VFlo6CgV8IrOCXLRMI9+wdckHu1Dj7be8i37BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T01:29:59.090002Z"},"content_sha256":"391c4e38258ee121330b9c1a7b348e1009da674a47060787dee21d595283b24c","schema_version":"1.0","event_id":"sha256:391c4e38258ee121330b9c1a7b348e1009da674a47060787dee21d595283b24c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DZQGCBWY5OAFVAFSEEC5VOEZWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Aspects of Optimal Channel Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Omar Fawzi, Siddharth Barman","submitted_at":"2015-08-17T17:41:47Z","abstract_excerpt":"A central question in information theory is to determine the maximum success probability that can be achieved in sending a fixed number of messages over a noisy channel. This was first studied in the pioneering work of Shannon who established a simple expression characterizing this quantity in the limit of multiple independent uses of the channel. Here we consider the general setting with only one use of the channel. We observe that the maximum success probability can be expressed as the maximum value of a submodular function. Using this connection, we establish the following results:\n  1. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04095","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:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Z6Hdlfiyaw4HFjV/qMQQ4FXN6h1KFdG2P0q9R8DOjR/dUb75mAc7luTCCn4FVrvyjWUjDkzBRrbuGefvm/jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T01:29:59.090778Z"},"content_sha256":"72ad18a8dfacbd18254370acbb6977e30325f2cba1486fb30dfd120be51b8132","schema_version":"1.0","event_id":"sha256:72ad18a8dfacbd18254370acbb6977e30325f2cba1486fb30dfd120be51b8132"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZQGCBWY5OAFVAFSEEC5VOEZWE/bundle.json","state_url":"https://pith.science/pith/DZQGCBWY5OAFVAFSEEC5VOEZWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZQGCBWY5OAFVAFSEEC5VOEZWE/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-05-23T01:29:59Z","links":{"resolver":"https://pith.science/pith/DZQGCBWY5OAFVAFSEEC5VOEZWE","bundle":"https://pith.science/pith/DZQGCBWY5OAFVAFSEEC5VOEZWE/bundle.json","state":"https://pith.science/pith/DZQGCBWY5OAFVAFSEEC5VOEZWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZQGCBWY5OAFVAFSEEC5VOEZWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DZQGCBWY5OAFVAFSEEC5VOEZWE","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":"4da24c607eedb3ecbc460e30b7a090baee41b6ce0526b3fb99f00eb6cc7a914a","cross_cats_sorted":["cs.DS","math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-17T17:41:47Z","title_canon_sha256":"b7b65584d641d2783957385278b0a06ac3c9950b232b1bd8976e35f774b3103f"},"schema_version":"1.0","source":{"id":"1508.04095","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04095","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04095v2","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04095","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"DZQGCBWY5OAF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DZQGCBWY5OAFVAFS","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DZQGCBWY","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:72ad18a8dfacbd18254370acbb6977e30325f2cba1486fb30dfd120be51b8132","target":"graph","created_at":"2026-05-18T00:12:41Z","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":"A central question in information theory is to determine the maximum success probability that can be achieved in sending a fixed number of messages over a noisy channel. This was first studied in the pioneering work of Shannon who established a simple expression characterizing this quantity in the limit of multiple independent uses of the channel. Here we consider the general setting with only one use of the channel. We observe that the maximum success probability can be expressed as the maximum value of a submodular function. Using this connection, we establish the following results:\n  1. The","authors_text":"Omar Fawzi, Siddharth Barman","cross_cats":["cs.DS","math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-17T17:41:47Z","title":"Algorithmic Aspects of Optimal Channel Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04095","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:391c4e38258ee121330b9c1a7b348e1009da674a47060787dee21d595283b24c","target":"record","created_at":"2026-05-18T00:12:41Z","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":"4da24c607eedb3ecbc460e30b7a090baee41b6ce0526b3fb99f00eb6cc7a914a","cross_cats_sorted":["cs.DS","math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-17T17:41:47Z","title_canon_sha256":"b7b65584d641d2783957385278b0a06ac3c9950b232b1bd8976e35f774b3103f"},"schema_version":"1.0","source":{"id":"1508.04095","kind":"arxiv","version":2}},"canonical_sha256":"1e606106d8eb805a80b22105dab899b11ea55ad2d40e076a0c6c6bbdafa0ea49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e606106d8eb805a80b22105dab899b11ea55ad2d40e076a0c6c6bbdafa0ea49","first_computed_at":"2026-05-18T00:12:41.031491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:41.031491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XHP+lKXuS5UAeM89hEH7Wxu73RbsoVFSKw1zBdn8S2M5tVDcoT4y/Bt0/v8KjLW05N8aT6ebT+bl1eVBb8pFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:41.031953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04095","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:391c4e38258ee121330b9c1a7b348e1009da674a47060787dee21d595283b24c","sha256:72ad18a8dfacbd18254370acbb6977e30325f2cba1486fb30dfd120be51b8132"],"state_sha256":"5f6ca163f73ca05888a88642db63555167d9ce59f563c755c1dd973a91963d23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JcWVD6SmJR6wd49msb0KKrpiFTQM1lXIKdcgttrPNj/419mMu/qxFGUPdH3Y7J0GgjgAFsEvGEqXrwZXZ9HnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T01:29:59.093541Z","bundle_sha256":"a4199252ea78a1199b3e232e4d29e300c55c84c3df2d5a78c7f1829ecdc7fb02"}}