{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LAIJCX4QBKJKSZETRZ7IUHPYTH","short_pith_number":"pith:LAIJCX4Q","schema_version":"1.0","canonical_sha256":"5810915f900a92a964938e7e8a1df899daeb211fc76ad70707290e83ffa80a16","source":{"kind":"arxiv","id":"1601.01394","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.01394","created_at":"2026-05-18T01:23:11.604790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01394v2","created_at":"2026-05-18T01:23:11.604790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01394","created_at":"2026-05-18T01:23:11.604790+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAIJCX4QBKJK","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAIJCX4QBKJKSZET","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAIJCX4Q","created_at":"2026-05-18T12:30:29.479603+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/LAIJCX4QBKJKSZETRZ7IUHPYTH","json":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH.json","graph_json":"https://pith.science/api/pith-number/LAIJCX4QBKJKSZETRZ7IUHPYTH/graph.json","events_json":"https://pith.science/api/pith-number/LAIJCX4QBKJKSZETRZ7IUHPYTH/events.json","paper":"https://pith.science/paper/LAIJCX4Q"},"agent_actions":{"view_html":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH","download_json":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH.json","view_paper":"https://pith.science/paper/LAIJCX4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01394&json=true","fetch_graph":"https://pith.science/api/pith-number/LAIJCX4QBKJKSZETRZ7IUHPYTH/graph.json","fetch_events":"https://pith.science/api/pith-number/LAIJCX4QBKJKSZETRZ7IUHPYTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/action/storage_attestation","attest_author":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/action/author_attestation","sign_citation":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/action/citation_signature","submit_replication":"https://pith.science/pith/LAIJCX4QBKJKSZETRZ7IUHPYTH/action/replication_record"}},"created_at":"2026-05-18T01:23:11.604790+00:00","updated_at":"2026-05-18T01:23:11.604790+00:00"}