{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XNKYXVGVK5IZBH47RR3UYIXGLV","short_pith_number":"pith:XNKYXVGV","canonical_record":{"source":{"id":"1505.05794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T17:16:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14ac52913d29034fe2a0cc7c5de7fc40d7a26f34172515e49302a40301fe41a2","abstract_canon_sha256":"6e1c00f8217916f12aaa80220f14c125a96e90f9eefe33a8597e6f9db26f4aae"},"schema_version":"1.0"},"canonical_sha256":"bb558bd4d55751909f9f8c774c22e65d559fb6393207f7cca9d538b41816f1ea","source":{"kind":"arxiv","id":"1505.05794","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05794","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05794v2","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05794","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"XNKYXVGVK5IZ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XNKYXVGVK5IZBH47","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XNKYXVGV","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XNKYXVGVK5IZBH47RR3UYIXGLV","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T17:16:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"14ac52913d29034fe2a0cc7c5de7fc40d7a26f34172515e49302a40301fe41a2","abstract_canon_sha256":"6e1c00f8217916f12aaa80220f14c125a96e90f9eefe33a8597e6f9db26f4aae"},"schema_version":"1.0"},"canonical_sha256":"bb558bd4d55751909f9f8c774c22e65d559fb6393207f7cca9d538b41816f1ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:57.207377Z","signature_b64":"9jrlC+M31Ts3SMV8QQQIeFUE/n9H5F6U/kTFfN/H8aw4hH7JdA6SAH1vdfN31cSaOhEJhD0OxQQz9y+u/8JxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb558bd4d55751909f9f8c774c22e65d559fb6393207f7cca9d538b41816f1ea","last_reissued_at":"2026-05-18T01:59:57.206834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:57.206834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05794","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-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InVycbgZ3nNdeOaUkU2zFCEPXQCW6u/7OFULkBOwaVr8V51cvf1BGs6/d1nHWpX/Riy9yp/iE9JNXiRKleeqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:03:19.447865Z"},"content_sha256":"e45c41d48c8469cb98d45cef7ddd3c0c52b05f666504ceee9126b04bd62e3f10","schema_version":"1.0","event_id":"sha256:e45c41d48c8469cb98d45cef7ddd3c0c52b05f666504ceee9126b04bd62e3f10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XNKYXVGVK5IZBH47RR3UYIXGLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Upper Bound for the Most Informative Boolean Function Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ofer Shayevitz, Omri Weinstein, Or Ordentlich","submitted_at":"2015-05-21T17:16:00Z","abstract_excerpt":"Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\\alpha$. A recent conjecture by Courtade and Kumar postulates that $I(f(X);Y)\\leq 1-h(\\alpha)$ for any Boolean function $f$. So far, the best known upper bound was $I(f(X);Y)\\leq (1-2\\alpha)^2$. In this paper, we derive a new upper bound that holds for all balanced functions, and improves upon the best known bound for all $\\tfrac{1}{3}<\\alpha<\\tfrac{1}{2}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05794","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-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGRUmGdwsJs1GNygkIDgVQJIKC9mUi22xGYA9R9ZGuJgNCw0ju7eoWRCa+tz2ZOvn71DW2AYC5e/uktZbWVfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:03:19.448551Z"},"content_sha256":"84ffa02f1ee50b8c27f7f3b39a15ca81cb2718557855d8b92947d683c40cbf49","schema_version":"1.0","event_id":"sha256:84ffa02f1ee50b8c27f7f3b39a15ca81cb2718557855d8b92947d683c40cbf49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/bundle.json","state_url":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/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-06T18:03:19Z","links":{"resolver":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV","bundle":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/bundle.json","state":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XNKYXVGVK5IZBH47RR3UYIXGLV","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":"6e1c00f8217916f12aaa80220f14c125a96e90f9eefe33a8597e6f9db26f4aae","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T17:16:00Z","title_canon_sha256":"14ac52913d29034fe2a0cc7c5de7fc40d7a26f34172515e49302a40301fe41a2"},"schema_version":"1.0","source":{"id":"1505.05794","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05794","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05794v2","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05794","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"XNKYXVGVK5IZ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XNKYXVGVK5IZBH47","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XNKYXVGV","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:84ffa02f1ee50b8c27f7f3b39a15ca81cb2718557855d8b92947d683c40cbf49","target":"graph","created_at":"2026-05-18T01:59:57Z","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":"Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\\alpha$. A recent conjecture by Courtade and Kumar postulates that $I(f(X);Y)\\leq 1-h(\\alpha)$ for any Boolean function $f$. So far, the best known upper bound was $I(f(X);Y)\\leq (1-2\\alpha)^2$. In this paper, we derive a new upper bound that holds for all balanced functions, and improves upon the best known bound for all $\\tfrac{1}{3}<\\alpha<\\tfrac{1}{2}$.","authors_text":"Ofer Shayevitz, Omri Weinstein, Or Ordentlich","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T17:16:00Z","title":"An Improved Upper Bound for the Most Informative Boolean Function Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05794","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:e45c41d48c8469cb98d45cef7ddd3c0c52b05f666504ceee9126b04bd62e3f10","target":"record","created_at":"2026-05-18T01:59:57Z","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":"6e1c00f8217916f12aaa80220f14c125a96e90f9eefe33a8597e6f9db26f4aae","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T17:16:00Z","title_canon_sha256":"14ac52913d29034fe2a0cc7c5de7fc40d7a26f34172515e49302a40301fe41a2"},"schema_version":"1.0","source":{"id":"1505.05794","kind":"arxiv","version":2}},"canonical_sha256":"bb558bd4d55751909f9f8c774c22e65d559fb6393207f7cca9d538b41816f1ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb558bd4d55751909f9f8c774c22e65d559fb6393207f7cca9d538b41816f1ea","first_computed_at":"2026-05-18T01:59:57.206834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:57.206834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9jrlC+M31Ts3SMV8QQQIeFUE/n9H5F6U/kTFfN/H8aw4hH7JdA6SAH1vdfN31cSaOhEJhD0OxQQz9y+u/8JxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:57.207377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05794","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e45c41d48c8469cb98d45cef7ddd3c0c52b05f666504ceee9126b04bd62e3f10","sha256:84ffa02f1ee50b8c27f7f3b39a15ca81cb2718557855d8b92947d683c40cbf49"],"state_sha256":"5dd76f8fa812e6dd7d74182070abfce2cb84630cc824f799b043c62d98c1fb20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTKK57Lu7blM3pAR9Zj40eqwGbspBryDSIldMTMuM5itNMcWMyFevYK33cqhAT+malRyt/YmpCnUgC3zHRfbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:03:19.452225Z","bundle_sha256":"d5f8dc9d08c07aef41bf1799e122f469f344290b606e0987dcbf9cd551b2d695"}}