{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LAIJCX4QBKJKSZETRZ7IUHPYTH","short_pith_number":"pith:LAIJCX4Q","canonical_record":{"source":{"id":"1601.01394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T04:11:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7dc546d70a4d6d282b94e0744d53b73a35dfa731c317907f727aed152aee4e5f","abstract_canon_sha256":"1172d380eb2747c5769ac7515453fc51bdba726191cf08143bac3adb81f5ac4c"},"schema_version":"1.0"},"canonical_sha256":"5810915f900a92a964938e7e8a1df899daeb211fc76ad70707290e83ffa80a16","source":{"kind":"arxiv","id":"1601.01394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01394","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01394v2","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01394","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"LAIJCX4QBKJK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAIJCX4QBKJKSZET","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAIJCX4Q","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LAIJCX4QBKJKSZETRZ7IUHPYTH","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T04:11:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7dc546d70a4d6d282b94e0744d53b73a35dfa731c317907f727aed152aee4e5f","abstract_canon_sha256":"1172d380eb2747c5769ac7515453fc51bdba726191cf08143bac3adb81f5ac4c"},"schema_version":"1.0"},"canonical_sha256":"5810915f900a92a964938e7e8a1df899daeb211fc76ad70707290e83ffa80a16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:11.605140Z","signature_b64":"8S5/hVkaBFzmC1QDPwUwd5TAKlWcoCxxb5lMwdym4xEXuPz5xy78fvVwfsIHO5dj8HM814UzCGfBKDnIQMwYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5810915f900a92a964938e7e8a1df899daeb211fc76ad70707290e83ffa80a16","last_reissued_at":"2026-05-18T01:23:11.604728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:11.604728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01394","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:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcvNy8gSHh+h2v8oT02PqnM7Y8MA3/tq9tUlfezNkpYHwYJfZq1JBwRlt3MtBHCwcM6cbSuTQiMMDzjErEvlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:36:46.677877Z"},"content_sha256":"f0d39bb87a4bc74ca4ef294b8d4161d9c8b37a156991b9cbc70aa10c0e2fb763","schema_version":"1.0","event_id":"sha256:f0d39bb87a4bc74ca4ef294b8d4161d9c8b37a156991b9cbc70aa10c0e2fb763"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LAIJCX4QBKJKSZETRZ7IUHPYTH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Search Algorithm for the Output Distribution that Achieves the Channel Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenji Nakagawa, Kohei Watabe, Takuto Sabu","submitted_at":"2016-01-07T04:11:54Z","abstract_excerpt":"We consider a search algorithm for the output distribution that achieves the channel capacity of a discrete memoryless channel. We will propose an algorithm by iterated projections of an output distribution onto affine subspaces in the set of output distributions. The problem of channel capacity has a similar geometric structure as that of smallest enclosing circle for a finite number of points in the Euclidean space. The metric in the Euclidean space is the Euclidean distance and the metric in the space of output distributions is the Kullback-Leibler divergence. We consider these two problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01394","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:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKH3Dsv7ublqcI60fODUivV3txWibJJriNDKyQNtituwzQjXZPBFyZOnBP2cRNICDY5QmQLlEAAcxQ4MTUCbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:36:46.678226Z"},"content_sha256":"73a2413c05657749c24ac56e1436ad73441e2f14c2dc412c0407fe8d8b6dae34","schema_version":"1.0","event_id":"sha256:73a2413c05657749c24ac56e1436ad73441e2f14c2dc412c0407fe8d8b6dae34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/bundle.json","state_url":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/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-02T04:36:46Z","links":{"resolver":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH","bundle":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/bundle.json","state":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LAIJCX4QBKJKSZETRZ7IUHPYTH","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":"1172d380eb2747c5769ac7515453fc51bdba726191cf08143bac3adb81f5ac4c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T04:11:54Z","title_canon_sha256":"7dc546d70a4d6d282b94e0744d53b73a35dfa731c317907f727aed152aee4e5f"},"schema_version":"1.0","source":{"id":"1601.01394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01394","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01394v2","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01394","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"LAIJCX4QBKJK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LAIJCX4QBKJKSZET","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LAIJCX4Q","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:73a2413c05657749c24ac56e1436ad73441e2f14c2dc412c0407fe8d8b6dae34","target":"graph","created_at":"2026-05-18T01:23:11Z","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":"We consider a search algorithm for the output distribution that achieves the channel capacity of a discrete memoryless channel. We will propose an algorithm by iterated projections of an output distribution onto affine subspaces in the set of output distributions. The problem of channel capacity has a similar geometric structure as that of smallest enclosing circle for a finite number of points in the Euclidean space. The metric in the Euclidean space is the Euclidean distance and the metric in the space of output distributions is the Kullback-Leibler divergence. We consider these two problems","authors_text":"Kenji Nakagawa, Kohei Watabe, Takuto Sabu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T04:11:54Z","title":"On the Search Algorithm for the Output Distribution that Achieves the Channel Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01394","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:f0d39bb87a4bc74ca4ef294b8d4161d9c8b37a156991b9cbc70aa10c0e2fb763","target":"record","created_at":"2026-05-18T01:23:11Z","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":"1172d380eb2747c5769ac7515453fc51bdba726191cf08143bac3adb81f5ac4c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T04:11:54Z","title_canon_sha256":"7dc546d70a4d6d282b94e0744d53b73a35dfa731c317907f727aed152aee4e5f"},"schema_version":"1.0","source":{"id":"1601.01394","kind":"arxiv","version":2}},"canonical_sha256":"5810915f900a92a964938e7e8a1df899daeb211fc76ad70707290e83ffa80a16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5810915f900a92a964938e7e8a1df899daeb211fc76ad70707290e83ffa80a16","first_computed_at":"2026-05-18T01:23:11.604728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:11.604728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8S5/hVkaBFzmC1QDPwUwd5TAKlWcoCxxb5lMwdym4xEXuPz5xy78fvVwfsIHO5dj8HM814UzCGfBKDnIQMwYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:11.605140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0d39bb87a4bc74ca4ef294b8d4161d9c8b37a156991b9cbc70aa10c0e2fb763","sha256:73a2413c05657749c24ac56e1436ad73441e2f14c2dc412c0407fe8d8b6dae34"],"state_sha256":"3691872f7c1809d5aebc7833c8fd0fdfdb304bd3981efc94964d0b294c28dc3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I31zdDyuACgMk8Yx6w3uijI9ZWwUhunrAwmwlB7azeu9YzKt8RXAukghNBKBrIdXAOaTBbQDpO8aUfwFPLBJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:36:46.680456Z","bundle_sha256":"2cc2beafb5903a263bf561340e5ed491cbaff21eb0d274e098af0ae8e5bc18b2"}}