{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:76VRW4KP2KOLZ5EIIML57NOXP7","short_pith_number":"pith:76VRW4KP","canonical_record":{"source":{"id":"1812.01475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T15:07:57Z","cross_cats_sorted":["math.IT","q-bio.NC"],"title_canon_sha256":"9171f87efc55d12dfd5485797dcedf66a08baa52adf9709a8638bff0559123f6","abstract_canon_sha256":"2c0acefd486f0e403a29cbac3ed10e6b614e27eb2278f9f22be5c2b3b8dd2ce3"},"schema_version":"1.0"},"canonical_sha256":"ffab1b714fd29cbcf4884317dfb5d77ffb3ac4c6708f7b2844f0f2fe0b30c656","source":{"kind":"arxiv","id":"1812.01475","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01475","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01475v2","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01475","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"76VRW4KP2KOL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"76VRW4KP2KOLZ5EI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"76VRW4KP","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:76VRW4KP2KOLZ5EIIML57NOXP7","target":"record","payload":{"canonical_record":{"source":{"id":"1812.01475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T15:07:57Z","cross_cats_sorted":["math.IT","q-bio.NC"],"title_canon_sha256":"9171f87efc55d12dfd5485797dcedf66a08baa52adf9709a8638bff0559123f6","abstract_canon_sha256":"2c0acefd486f0e403a29cbac3ed10e6b614e27eb2278f9f22be5c2b3b8dd2ce3"},"schema_version":"1.0"},"canonical_sha256":"ffab1b714fd29cbcf4884317dfb5d77ffb3ac4c6708f7b2844f0f2fe0b30c656","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:33.298599Z","signature_b64":"e6sHLCeaKDoooEOoqcrpYn5ddwvEQ3TpwFjRDuuppoZwyaeI+1k+KnESjtwQ+CokJ5tJAyGt6U+SJif+HLjADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffab1b714fd29cbcf4884317dfb5d77ffb3ac4c6708f7b2844f0f2fe0b30c656","last_reissued_at":"2026-05-17T23:56:33.298127Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:33.298127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.01475","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-17T23:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmzIblDURMGUNy00T3P1NLhsb+u+6qKU++ppAUyu/ht14lWOQR6i6DOvLSlEE0erNgFv/6Gw5/rknpj/fyPxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:07:26.997493Z"},"content_sha256":"40a6fc78af8ab0c58adab7166301858b97d9fce734dd58e28915371ed2559b76","schema_version":"1.0","event_id":"sha256:40a6fc78af8ab0c58adab7166301858b97d9fce734dd58e28915371ed2559b76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:76VRW4KP2KOLZ5EIIML57NOXP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tight Upper Bound on Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","q-bio.NC"],"primary_cat":"cs.IT","authors_text":"Ga\\v{s}per Tka\\v{c}ik, Michal Hled\\'ik, Thomas R. Sokolowski","submitted_at":"2018-12-04T15:07:57Z","abstract_excerpt":"We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01475","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-17T23:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhZVFyt+xPSKszgCTnbZnX/nny2wutGoS/9J4m6pbK8I1dRZBbJkbHm6QzqAJeo6LEhXY9rL/26AwhwBj2+4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:07:26.997976Z"},"content_sha256":"622e9c0c5eb447f924d003b07280344f213262da8e6594e4b8425591a9ab7581","schema_version":"1.0","event_id":"sha256:622e9c0c5eb447f924d003b07280344f213262da8e6594e4b8425591a9ab7581"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76VRW4KP2KOLZ5EIIML57NOXP7/bundle.json","state_url":"https://pith.science/pith/76VRW4KP2KOLZ5EIIML57NOXP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76VRW4KP2KOLZ5EIIML57NOXP7/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-26T16:07:26Z","links":{"resolver":"https://pith.science/pith/76VRW4KP2KOLZ5EIIML57NOXP7","bundle":"https://pith.science/pith/76VRW4KP2KOLZ5EIIML57NOXP7/bundle.json","state":"https://pith.science/pith/76VRW4KP2KOLZ5EIIML57NOXP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76VRW4KP2KOLZ5EIIML57NOXP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:76VRW4KP2KOLZ5EIIML57NOXP7","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":"2c0acefd486f0e403a29cbac3ed10e6b614e27eb2278f9f22be5c2b3b8dd2ce3","cross_cats_sorted":["math.IT","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T15:07:57Z","title_canon_sha256":"9171f87efc55d12dfd5485797dcedf66a08baa52adf9709a8638bff0559123f6"},"schema_version":"1.0","source":{"id":"1812.01475","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01475","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01475v2","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01475","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"76VRW4KP2KOL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"76VRW4KP2KOLZ5EI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"76VRW4KP","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:622e9c0c5eb447f924d003b07280344f213262da8e6594e4b8425591a9ab7581","target":"graph","created_at":"2026-05-17T23:56:33Z","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 derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is","authors_text":"Ga\\v{s}per Tka\\v{c}ik, Michal Hled\\'ik, Thomas R. Sokolowski","cross_cats":["math.IT","q-bio.NC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T15:07:57Z","title":"A Tight Upper Bound on Mutual Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01475","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:40a6fc78af8ab0c58adab7166301858b97d9fce734dd58e28915371ed2559b76","target":"record","created_at":"2026-05-17T23:56:33Z","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":"2c0acefd486f0e403a29cbac3ed10e6b614e27eb2278f9f22be5c2b3b8dd2ce3","cross_cats_sorted":["math.IT","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T15:07:57Z","title_canon_sha256":"9171f87efc55d12dfd5485797dcedf66a08baa52adf9709a8638bff0559123f6"},"schema_version":"1.0","source":{"id":"1812.01475","kind":"arxiv","version":2}},"canonical_sha256":"ffab1b714fd29cbcf4884317dfb5d77ffb3ac4c6708f7b2844f0f2fe0b30c656","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffab1b714fd29cbcf4884317dfb5d77ffb3ac4c6708f7b2844f0f2fe0b30c656","first_computed_at":"2026-05-17T23:56:33.298127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:33.298127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e6sHLCeaKDoooEOoqcrpYn5ddwvEQ3TpwFjRDuuppoZwyaeI+1k+KnESjtwQ+CokJ5tJAyGt6U+SJif+HLjADw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:33.298599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01475","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40a6fc78af8ab0c58adab7166301858b97d9fce734dd58e28915371ed2559b76","sha256:622e9c0c5eb447f924d003b07280344f213262da8e6594e4b8425591a9ab7581"],"state_sha256":"d3f581d37e8cb082e1ea8b7df219cd4e25b025e292c376475719ec4c5fef90ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIohZRAo87rNKJJrgdyVrcSAFXgXZtqHVZzPsTzCV2vzipdKg/i4Qwr634rQ4QzLNHCk8PbmYwwHv/T9CHUsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:07:27.000972Z","bundle_sha256":"183434003594137315e829c5fd94584927f182187aa48d0bafdbf957b81b4047"}}