{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IKY2NSSRBFTNQT44KUSAOWSIA2","short_pith_number":"pith:IKY2NSSR","canonical_record":{"source":{"id":"1701.03119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T19:03:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46ecc3eca28edb502dca914ecd0368d1097bc38f62fa84a6cebfefaf849008ed","abstract_canon_sha256":"0774d8c262acb46c5df1877406db59f86a1c9d0557137216a03e67b6b7f2ce2b"},"schema_version":"1.0"},"canonical_sha256":"42b1a6ca510966d84f9c5524075a48069a3dc01b23b834dab7c67321ece186ef","source":{"kind":"arxiv","id":"1701.03119","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03119","created_at":"2026-05-18T00:45:14Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03119v2","created_at":"2026-05-18T00:45:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03119","created_at":"2026-05-18T00:45:14Z"},{"alias_kind":"pith_short_12","alias_value":"IKY2NSSRBFTN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IKY2NSSRBFTNQT44","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IKY2NSSR","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IKY2NSSRBFTNQT44KUSAOWSIA2","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T19:03:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46ecc3eca28edb502dca914ecd0368d1097bc38f62fa84a6cebfefaf849008ed","abstract_canon_sha256":"0774d8c262acb46c5df1877406db59f86a1c9d0557137216a03e67b6b7f2ce2b"},"schema_version":"1.0"},"canonical_sha256":"42b1a6ca510966d84f9c5524075a48069a3dc01b23b834dab7c67321ece186ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:14.325909Z","signature_b64":"9yUHWbGnkdhHASnQsYJDjNRqyKO5IuKM3l40EgweLFdbdnlajVeZ6cIGSbYIQ4qrye8BQYfQ/7axg8TCqNxVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42b1a6ca510966d84f9c5524075a48069a3dc01b23b834dab7c67321ece186ef","last_reissued_at":"2026-05-18T00:45:14.325284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:14.325284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03119","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-18T00:45:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mg/Bw+ULqw4FLV8Giz8dyiGjx3sAgFSEcE7j1wcxw0xlLm/MqcCYlOG7AZpwMlnbKy88U0Cxu6ilDEF/pxGPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:57:17.345938Z"},"content_sha256":"9c0c5554e4423cd3feed497e790da79058f5fb70946fc905555fde415ee3836f","schema_version":"1.0","event_id":"sha256:9c0c5554e4423cd3feed497e790da79058f5fb70946fc905555fde415ee3836f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IKY2NSSRBFTNQT44KUSAOWSIA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Quantize $n$ Outputs of a Binary Symmetric Channel to $n-1$ Bits?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Or Ordentlich, Wasim Huleihel","submitted_at":"2017-01-11T19:03:42Z","abstract_excerpt":"Suppose that $Y^n$ is obtained by observing a uniform Bernoulli random vector $X^n$ through a binary symmetric channel with crossover probability $\\alpha$. The \"most informative Boolean function\" conjecture postulates that the maximal mutual information between $Y^n$ and any Boolean function $\\mathrm{b}(X^n)$ is attained by a dictator function. In this paper, we consider the \"complementary\" case in which the Boolean function is replaced by $f:\\left\\{0,1\\right\\}^n\\to\\left\\{0,1\\right\\}^{n-1}$, namely, an $n-1$ bit quantizer, and show that $I(f(X^n);Y^n)\\leq (n-1)\\cdot\\left(1-h(\\alpha)\\right)$ fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03119","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-18T00:45:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qt1DqMnqaIE/xyOOjZRNmGStP34kywh3K7vnG5oOM5ms4/+uJNtSC793LNJi4P8cgutMbv9ZHhznVgvsFnM9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:57:17.346304Z"},"content_sha256":"9227502168b2427df46e7c2eb03c1242515c9ba89b448c69eede8eec3110bedd","schema_version":"1.0","event_id":"sha256:9227502168b2427df46e7c2eb03c1242515c9ba89b448c69eede8eec3110bedd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKY2NSSRBFTNQT44KUSAOWSIA2/bundle.json","state_url":"https://pith.science/pith/IKY2NSSRBFTNQT44KUSAOWSIA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKY2NSSRBFTNQT44KUSAOWSIA2/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-04T15:57:17Z","links":{"resolver":"https://pith.science/pith/IKY2NSSRBFTNQT44KUSAOWSIA2","bundle":"https://pith.science/pith/IKY2NSSRBFTNQT44KUSAOWSIA2/bundle.json","state":"https://pith.science/pith/IKY2NSSRBFTNQT44KUSAOWSIA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKY2NSSRBFTNQT44KUSAOWSIA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IKY2NSSRBFTNQT44KUSAOWSIA2","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":"0774d8c262acb46c5df1877406db59f86a1c9d0557137216a03e67b6b7f2ce2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T19:03:42Z","title_canon_sha256":"46ecc3eca28edb502dca914ecd0368d1097bc38f62fa84a6cebfefaf849008ed"},"schema_version":"1.0","source":{"id":"1701.03119","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03119","created_at":"2026-05-18T00:45:14Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03119v2","created_at":"2026-05-18T00:45:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03119","created_at":"2026-05-18T00:45:14Z"},{"alias_kind":"pith_short_12","alias_value":"IKY2NSSRBFTN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IKY2NSSRBFTNQT44","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IKY2NSSR","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:9227502168b2427df46e7c2eb03c1242515c9ba89b448c69eede8eec3110bedd","target":"graph","created_at":"2026-05-18T00:45:14Z","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 that $Y^n$ is obtained by observing a uniform Bernoulli random vector $X^n$ through a binary symmetric channel with crossover probability $\\alpha$. The \"most informative Boolean function\" conjecture postulates that the maximal mutual information between $Y^n$ and any Boolean function $\\mathrm{b}(X^n)$ is attained by a dictator function. In this paper, we consider the \"complementary\" case in which the Boolean function is replaced by $f:\\left\\{0,1\\right\\}^n\\to\\left\\{0,1\\right\\}^{n-1}$, namely, an $n-1$ bit quantizer, and show that $I(f(X^n);Y^n)\\leq (n-1)\\cdot\\left(1-h(\\alpha)\\right)$ fo","authors_text":"Or Ordentlich, Wasim Huleihel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T19:03:42Z","title":"How to Quantize $n$ Outputs of a Binary Symmetric Channel to $n-1$ Bits?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03119","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:9c0c5554e4423cd3feed497e790da79058f5fb70946fc905555fde415ee3836f","target":"record","created_at":"2026-05-18T00:45:14Z","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":"0774d8c262acb46c5df1877406db59f86a1c9d0557137216a03e67b6b7f2ce2b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T19:03:42Z","title_canon_sha256":"46ecc3eca28edb502dca914ecd0368d1097bc38f62fa84a6cebfefaf849008ed"},"schema_version":"1.0","source":{"id":"1701.03119","kind":"arxiv","version":2}},"canonical_sha256":"42b1a6ca510966d84f9c5524075a48069a3dc01b23b834dab7c67321ece186ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42b1a6ca510966d84f9c5524075a48069a3dc01b23b834dab7c67321ece186ef","first_computed_at":"2026-05-18T00:45:14.325284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:14.325284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9yUHWbGnkdhHASnQsYJDjNRqyKO5IuKM3l40EgweLFdbdnlajVeZ6cIGSbYIQ4qrye8BQYfQ/7axg8TCqNxVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:14.325909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03119","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c0c5554e4423cd3feed497e790da79058f5fb70946fc905555fde415ee3836f","sha256:9227502168b2427df46e7c2eb03c1242515c9ba89b448c69eede8eec3110bedd"],"state_sha256":"bd1de9373cf37bec586311e4e9cd7f12b809300a51ffcfcf4c2ad17948ca71df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4k1wD1cUN27k6LlOzVD/N+aCCVNIb6regV0kA8zw1o1FpmljjreD8NlsCRkXjvObMwnMgEaSO/fgIRZOr7tDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:57:17.348311Z","bundle_sha256":"cb417edcc04bdd3a294fb726c78dd68dcc70148500df6e58472837af0f842212"}}