{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XNKYXVGVK5IZBH47RR3UYIXGLV","short_pith_number":"pith:XNKYXVGV","schema_version":"1.0","canonical_sha256":"bb558bd4d55751909f9f8c774c22e65d559fb6393207f7cca9d538b41816f1ea","source":{"kind":"arxiv","id":"1505.05794","version":2},"attestation_state":"computed","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}$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.05794","created_at":"2026-05-18T01:59:57.206927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05794v2","created_at":"2026-05-18T01:59:57.206927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05794","created_at":"2026-05-18T01:59:57.206927+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNKYXVGVK5IZ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNKYXVGVK5IZBH47","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNKYXVGV","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV","json":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV.json","graph_json":"https://pith.science/api/pith-number/XNKYXVGVK5IZBH47RR3UYIXGLV/graph.json","events_json":"https://pith.science/api/pith-number/XNKYXVGVK5IZBH47RR3UYIXGLV/events.json","paper":"https://pith.science/paper/XNKYXVGV"},"agent_actions":{"view_html":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV","download_json":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV.json","view_paper":"https://pith.science/paper/XNKYXVGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05794&json=true","fetch_graph":"https://pith.science/api/pith-number/XNKYXVGVK5IZBH47RR3UYIXGLV/graph.json","fetch_events":"https://pith.science/api/pith-number/XNKYXVGVK5IZBH47RR3UYIXGLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/action/storage_attestation","attest_author":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/action/author_attestation","sign_citation":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/action/citation_signature","submit_replication":"https://pith.science/pith/XNKYXVGVK5IZBH47RR3UYIXGLV/action/replication_record"}},"created_at":"2026-05-18T01:59:57.206927+00:00","updated_at":"2026-05-18T01:59:57.206927+00:00"}