{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BJGIOJF43HBX7DIHL3IXQGLRKB","short_pith_number":"pith:BJGIOJF4","canonical_record":{"source":{"id":"1604.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-05T21:43:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc6fc77e43fa2d08d12a3726afd2724fa8983f0519258b1a4e3922c9dbdfbdeb","abstract_canon_sha256":"4198c3a5f5ea2ae7471f297ed65aa43533b22d5656d1f603b4bf28784f49e8b2"},"schema_version":"1.0"},"canonical_sha256":"0a4c8724bcd9c37f8d075ed178197150744d3c097e351e7888b0d8193662b7a9","source":{"kind":"arxiv","id":"1604.01434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01434","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01434v1","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01434","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"BJGIOJF43HBX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BJGIOJF43HBX7DIH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BJGIOJF4","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BJGIOJF43HBX7DIHL3IXQGLRKB","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-05T21:43:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cc6fc77e43fa2d08d12a3726afd2724fa8983f0519258b1a4e3922c9dbdfbdeb","abstract_canon_sha256":"4198c3a5f5ea2ae7471f297ed65aa43533b22d5656d1f603b4bf28784f49e8b2"},"schema_version":"1.0"},"canonical_sha256":"0a4c8724bcd9c37f8d075ed178197150744d3c097e351e7888b0d8193662b7a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:36.403812Z","signature_b64":"AdXtGxaXEeSWokSV31oRkz5BCrfmucboOdiRb72qJxAU2nF/CAz1phk5v3wWgM7m0n69JeiilSVsGY2yu6rrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4c8724bcd9c37f8d075ed178197150744d3c097e351e7888b0d8193662b7a9","last_reissued_at":"2026-05-18T01:17:36.403181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:36.403181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01434","source_version":1,"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-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLOgIcmKjakySmWs5za7Y7nbH+dFofQQnxQ2yJBgcrw0kMEKaJ2btt4iMOhiuRW/FnIbA2QV3saRJbPG/2DPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:11:52.455462Z"},"content_sha256":"42509904062f5a2cb8a959225fb1cda8ffeaa3731458737ca1e9262a8a87090b","schema_version":"1.0","event_id":"sha256:42509904062f5a2cb8a959225fb1cda8ffeaa3731458737ca1e9262a8a87090b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BJGIOJF43HBX7DIHL3IXQGLRKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Formula for Compound Channel Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Sergey Loyka","submitted_at":"2016-04-05T21:43:25Z","abstract_excerpt":"A general formula for the capacity of arbitrary compound channels with the receiver channel state information is obtained using the information density approach. No assumptions of ergodicity, stationarity or information stability are made and the channel state set is arbitrary. A direct (constructive) proof is given. To prove achievability, we generalize Feinstein Lemma to the compound channel setting, and to prove converse, we generalize Verdu-Han Lemma to the same compound setting. A notion of a uniform compound channel is introduced and the general formula is shown to reduce to the familiar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01434","kind":"arxiv","version":1},"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-18T01:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtHzUDAwP4CRxZK1+nnvtSFJOkXlccY2pI+9Qa79HslNtQoNtr95NUBxf8BA1L4i9Sp7jsLjJ2FLxYFm1uOAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:11:52.455817Z"},"content_sha256":"9131c94f9e098149f8d1374a19a6086b66e85d4b6d13390f134e78b3fbdda260","schema_version":"1.0","event_id":"sha256:9131c94f9e098149f8d1374a19a6086b66e85d4b6d13390f134e78b3fbdda260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJGIOJF43HBX7DIHL3IXQGLRKB/bundle.json","state_url":"https://pith.science/pith/BJGIOJF43HBX7DIHL3IXQGLRKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJGIOJF43HBX7DIHL3IXQGLRKB/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-03T09:11:52Z","links":{"resolver":"https://pith.science/pith/BJGIOJF43HBX7DIHL3IXQGLRKB","bundle":"https://pith.science/pith/BJGIOJF43HBX7DIHL3IXQGLRKB/bundle.json","state":"https://pith.science/pith/BJGIOJF43HBX7DIHL3IXQGLRKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJGIOJF43HBX7DIHL3IXQGLRKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BJGIOJF43HBX7DIHL3IXQGLRKB","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":"4198c3a5f5ea2ae7471f297ed65aa43533b22d5656d1f603b4bf28784f49e8b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-05T21:43:25Z","title_canon_sha256":"cc6fc77e43fa2d08d12a3726afd2724fa8983f0519258b1a4e3922c9dbdfbdeb"},"schema_version":"1.0","source":{"id":"1604.01434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01434","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01434v1","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01434","created_at":"2026-05-18T01:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"BJGIOJF43HBX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BJGIOJF43HBX7DIH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BJGIOJF4","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:9131c94f9e098149f8d1374a19a6086b66e85d4b6d13390f134e78b3fbdda260","target":"graph","created_at":"2026-05-18T01:17:36Z","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 general formula for the capacity of arbitrary compound channels with the receiver channel state information is obtained using the information density approach. No assumptions of ergodicity, stationarity or information stability are made and the channel state set is arbitrary. A direct (constructive) proof is given. To prove achievability, we generalize Feinstein Lemma to the compound channel setting, and to prove converse, we generalize Verdu-Han Lemma to the same compound setting. A notion of a uniform compound channel is introduced and the general formula is shown to reduce to the familiar","authors_text":"Charalambos D. Charalambous, Sergey Loyka","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-05T21:43:25Z","title":"A General Formula for Compound Channel Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01434","kind":"arxiv","version":1},"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:42509904062f5a2cb8a959225fb1cda8ffeaa3731458737ca1e9262a8a87090b","target":"record","created_at":"2026-05-18T01:17:36Z","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":"4198c3a5f5ea2ae7471f297ed65aa43533b22d5656d1f603b4bf28784f49e8b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-05T21:43:25Z","title_canon_sha256":"cc6fc77e43fa2d08d12a3726afd2724fa8983f0519258b1a4e3922c9dbdfbdeb"},"schema_version":"1.0","source":{"id":"1604.01434","kind":"arxiv","version":1}},"canonical_sha256":"0a4c8724bcd9c37f8d075ed178197150744d3c097e351e7888b0d8193662b7a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a4c8724bcd9c37f8d075ed178197150744d3c097e351e7888b0d8193662b7a9","first_computed_at":"2026-05-18T01:17:36.403181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:36.403181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AdXtGxaXEeSWokSV31oRkz5BCrfmucboOdiRb72qJxAU2nF/CAz1phk5v3wWgM7m0n69JeiilSVsGY2yu6rrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:36.403812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42509904062f5a2cb8a959225fb1cda8ffeaa3731458737ca1e9262a8a87090b","sha256:9131c94f9e098149f8d1374a19a6086b66e85d4b6d13390f134e78b3fbdda260"],"state_sha256":"ebdd9ef2991265eea83500bbd5c2523a1abf9fce68b34faebb9fecbc442e44cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjINZqguJgNPFv8PmbUtBEOynva7r8mTg3mw0SYviRJ5+ev69qAcDCOfOqyzR1mJaJC/lg7PFU16Ieqs8QpHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:11:52.457867Z","bundle_sha256":"cf7820f4e610b556175e9a02593c10e51eb2438d17029f520423d1c01ab0c42f"}}