{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FVWRFBJDYMEPYEDMQELGLYNZCF","short_pith_number":"pith:FVWRFBJD","canonical_record":{"source":{"id":"1107.5637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T07:15:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6517b054ab91bf9d5bb21ac1112ab57ca5e53fd4d24ba73f2507a3f03649993","abstract_canon_sha256":"a07fb1e3b1dfcfa90b3593e9abbbe82f9cf87f8612d7ca1f90af2c2cd1b32e0a"},"schema_version":"1.0"},"canonical_sha256":"2d6d128523c308fc106c811665e1b91174d9bac8c7d32c0da0a6619997d0edd9","source":{"kind":"arxiv","id":"1107.5637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5637","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5637v2","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5637","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"FVWRFBJDYMEP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FVWRFBJDYMEPYEDM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FVWRFBJD","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FVWRFBJDYMEPYEDMQELGLYNZCF","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T07:15:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6517b054ab91bf9d5bb21ac1112ab57ca5e53fd4d24ba73f2507a3f03649993","abstract_canon_sha256":"a07fb1e3b1dfcfa90b3593e9abbbe82f9cf87f8612d7ca1f90af2c2cd1b32e0a"},"schema_version":"1.0"},"canonical_sha256":"2d6d128523c308fc106c811665e1b91174d9bac8c7d32c0da0a6619997d0edd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:50.360772Z","signature_b64":"EZGs9NebjRxJCAD9cHzNLYNV60ldtQm7J30KOZ710Rl0tRVF0JHgIn/WzVGBEf3It9lgb/iKPT9zfcUqlk50BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d6d128523c308fc106c811665e1b91174d9bac8c7d32c0da0a6619997d0edd9","last_reissued_at":"2026-05-18T02:51:50.360198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:50.360198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5637","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-18T02:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+XbNWmh2qV1zC8jsNx34JZQHM34h8AnBuIDyvFGz2FBd2ISWJvWfiuNDfdbTTPT6/Vsu4TMghqda43FEolcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:23:45.018408Z"},"content_sha256":"f9b5e524e963202250b0ca487fb8e524af154ea7bb65f90787a523b3e39f113a","schema_version":"1.0","event_id":"sha256:f9b5e524e963202250b0ca487fb8e524af154ea7bb65f90787a523b3e39f113a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FVWRFBJDYMEPYEDMQELGLYNZCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantization of Binary-Input Discrete Memoryless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brian M. Kurkoski, Hideki Yagi","submitted_at":"2011-07-28T07:15:40Z","abstract_excerpt":"The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. An algorithm which finds an optimal quantizer, in the sense of maximizing mutual information between the channel input and the quantizer output is given. This result holds for arbitrary channels, in contrast to previous results for restricted channels or a restricted number of quantizer outputs. In the worst case, the algorithm complexity is cubic $M^3$ in the number of channel outputs $M$. Optimality is proved using the theorem of Burshtein, Della Pietra, Kanevsky, and N\\'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5637","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-18T02:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4f1PTMQG4xGT+bPruLGzZeWGtcpbKAx6fsKeTVMGr5nfamD/oLoZ+DNylF6jiUYaZi0bICWBRUW8Qj0ghiQaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:23:45.018765Z"},"content_sha256":"4cdba6fefe1038c9e4defb6ad1c35921a190e0ef7d690e35d092219d7b9c8c03","schema_version":"1.0","event_id":"sha256:4cdba6fefe1038c9e4defb6ad1c35921a190e0ef7d690e35d092219d7b9c8c03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVWRFBJDYMEPYEDMQELGLYNZCF/bundle.json","state_url":"https://pith.science/pith/FVWRFBJDYMEPYEDMQELGLYNZCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVWRFBJDYMEPYEDMQELGLYNZCF/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-01T03:23:45Z","links":{"resolver":"https://pith.science/pith/FVWRFBJDYMEPYEDMQELGLYNZCF","bundle":"https://pith.science/pith/FVWRFBJDYMEPYEDMQELGLYNZCF/bundle.json","state":"https://pith.science/pith/FVWRFBJDYMEPYEDMQELGLYNZCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVWRFBJDYMEPYEDMQELGLYNZCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FVWRFBJDYMEPYEDMQELGLYNZCF","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":"a07fb1e3b1dfcfa90b3593e9abbbe82f9cf87f8612d7ca1f90af2c2cd1b32e0a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T07:15:40Z","title_canon_sha256":"e6517b054ab91bf9d5bb21ac1112ab57ca5e53fd4d24ba73f2507a3f03649993"},"schema_version":"1.0","source":{"id":"1107.5637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5637","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5637v2","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5637","created_at":"2026-05-18T02:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"FVWRFBJDYMEP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FVWRFBJDYMEPYEDM","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FVWRFBJD","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:4cdba6fefe1038c9e4defb6ad1c35921a190e0ef7d690e35d092219d7b9c8c03","target":"graph","created_at":"2026-05-18T02:51:50Z","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":"The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. An algorithm which finds an optimal quantizer, in the sense of maximizing mutual information between the channel input and the quantizer output is given. This result holds for arbitrary channels, in contrast to previous results for restricted channels or a restricted number of quantizer outputs. In the worst case, the algorithm complexity is cubic $M^3$ in the number of channel outputs $M$. Optimality is proved using the theorem of Burshtein, Della Pietra, Kanevsky, and N\\'","authors_text":"Brian M. Kurkoski, Hideki Yagi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T07:15:40Z","title":"Quantization of Binary-Input Discrete Memoryless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5637","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:f9b5e524e963202250b0ca487fb8e524af154ea7bb65f90787a523b3e39f113a","target":"record","created_at":"2026-05-18T02:51:50Z","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":"a07fb1e3b1dfcfa90b3593e9abbbe82f9cf87f8612d7ca1f90af2c2cd1b32e0a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-28T07:15:40Z","title_canon_sha256":"e6517b054ab91bf9d5bb21ac1112ab57ca5e53fd4d24ba73f2507a3f03649993"},"schema_version":"1.0","source":{"id":"1107.5637","kind":"arxiv","version":2}},"canonical_sha256":"2d6d128523c308fc106c811665e1b91174d9bac8c7d32c0da0a6619997d0edd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d6d128523c308fc106c811665e1b91174d9bac8c7d32c0da0a6619997d0edd9","first_computed_at":"2026-05-18T02:51:50.360198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:50.360198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EZGs9NebjRxJCAD9cHzNLYNV60ldtQm7J30KOZ710Rl0tRVF0JHgIn/WzVGBEf3It9lgb/iKPT9zfcUqlk50BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:50.360772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9b5e524e963202250b0ca487fb8e524af154ea7bb65f90787a523b3e39f113a","sha256:4cdba6fefe1038c9e4defb6ad1c35921a190e0ef7d690e35d092219d7b9c8c03"],"state_sha256":"0c764ea51a3c0f7deb6daddc1b694cddd6409ec6257a7b0dcc59365bb387111e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"roUryFnM9pIbcehZIgYHNlyoh6jBl5H+ZfYRjyoFxcK1mH2nn/yUXzkvAmXwISB2zntmOFLRB5pL/dNPCHAYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:23:45.021285Z","bundle_sha256":"453788bf29f8826eeb2e83f54f6fde2265d917d0649d02cdeef2f0e85ee517e2"}}