{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IOHTT2CPUA3LLEKPSMYR6MJXI7","short_pith_number":"pith:IOHTT2CP","schema_version":"1.0","canonical_sha256":"438f39e84fa036b5914f93311f313747dbbb9747ee4f017ee3ae099be885d209","source":{"kind":"arxiv","id":"1607.02381","version":1},"attestation_state":"computed","paper":{"title":"On the Optimal Boolean Function for Prediction under Quadratic Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nir Weinberger, Ofer Shayevitz","submitted_at":"2016-07-08T14:31:58Z","abstract_excerpt":"Suppose $Y^{n}$ is obtained by observing a uniform Bernoulli random vector $X^{n}$ through a binary symmetric channel. Courtade and Kumar asked how large the mutual information between $Y^{n}$ and a Boolean function $\\mathsf{b}(X^{n})$ could be, and conjectured that the maximum is attained by a dictator function. An equivalent formulation of this conjecture is that dictator minimizes the prediction cost in a sequential prediction of $Y^{n}$ under logarithmic loss, given $\\mathsf{b}(X^{n})$. In this paper, we study the question of minimizing the sequential prediction cost under a different (pro"},"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":"1607.02381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-08T14:31:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04be4e8f63ed151dff9b57ed404cbe424d9fb2cc7b56f09d192be396cc7426f5","abstract_canon_sha256":"e99719ff8bc5253e4eecd6d87926893d0455835cad74041eb4574eaf7b5c32cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:20.535178Z","signature_b64":"dvUK3BzFiHsp+hp+MWS0si7ymzSRK8s67syNDKEzdHK2h+/M2JDUvCAxLOeUO6zM9pbePpo4CCdEIOgnulFYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"438f39e84fa036b5914f93311f313747dbbb9747ee4f017ee3ae099be885d209","last_reissued_at":"2026-05-18T01:11:20.534648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:20.534648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimal Boolean Function for Prediction under Quadratic Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nir Weinberger, Ofer Shayevitz","submitted_at":"2016-07-08T14:31:58Z","abstract_excerpt":"Suppose $Y^{n}$ is obtained by observing a uniform Bernoulli random vector $X^{n}$ through a binary symmetric channel. Courtade and Kumar asked how large the mutual information between $Y^{n}$ and a Boolean function $\\mathsf{b}(X^{n})$ could be, and conjectured that the maximum is attained by a dictator function. An equivalent formulation of this conjecture is that dictator minimizes the prediction cost in a sequential prediction of $Y^{n}$ under logarithmic loss, given $\\mathsf{b}(X^{n})$. In this paper, we study the question of minimizing the sequential prediction cost under a different (pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02381","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.02381","created_at":"2026-05-18T01:11:20.534719+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02381v1","created_at":"2026-05-18T01:11:20.534719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02381","created_at":"2026-05-18T01:11:20.534719+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOHTT2CPUA3L","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOHTT2CPUA3LLEKP","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOHTT2CP","created_at":"2026-05-18T12:30:22.444734+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/IOHTT2CPUA3LLEKPSMYR6MJXI7","json":"https://pith.science/pith/IOHTT2CPUA3LLEKPSMYR6MJXI7.json","graph_json":"https://pith.science/api/pith-number/IOHTT2CPUA3LLEKPSMYR6MJXI7/graph.json","events_json":"https://pith.science/api/pith-number/IOHTT2CPUA3LLEKPSMYR6MJXI7/events.json","paper":"https://pith.science/paper/IOHTT2CP"},"agent_actions":{"view_html":"https://pith.science/pith/IOHTT2CPUA3LLEKPSMYR6MJXI7","download_json":"https://pith.science/pith/IOHTT2CPUA3LLEKPSMYR6MJXI7.json","view_paper":"https://pith.science/paper/IOHTT2CP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02381&json=true","fetch_graph":"https://pith.science/api/pith-number/IOHTT2CPUA3LLEKPSMYR6MJXI7/graph.json","fetch_events":"https://pith.science/api/pith-number/IOHTT2CPUA3LLEKPSMYR6MJXI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOHTT2CPUA3LLEKPSMYR6MJXI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOHTT2CPUA3LLEKPSMYR6MJXI7/action/storage_attestation","attest_author":"https://pith.science/pith/IOHTT2CPUA3LLEKPSMYR6MJXI7/action/author_attestation","sign_citation":"https://pith.science/pith/IOHTT2CPUA3LLEKPSMYR6MJXI7/action/citation_signature","submit_replication":"https://pith.science/pith/IOHTT2CPUA3LLEKPSMYR6MJXI7/action/replication_record"}},"created_at":"2026-05-18T01:11:20.534719+00:00","updated_at":"2026-05-18T01:11:20.534719+00:00"}