{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DU7NXVTZTX5F7OLQMCWY6UJGSX","short_pith_number":"pith:DU7NXVTZ","schema_version":"1.0","canonical_sha256":"1d3edbd6799dfa5fb97060ad8f512695e2f87507d020e5474adb97a85a2af615","source":{"kind":"arxiv","id":"1201.6425","version":1},"attestation_state":"computed","paper":{"title":"No input symbol should occur more frequently than 1-1/e","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros Manolakos, Gowtham Kumar","submitted_at":"2012-01-31T03:16:20Z","abstract_excerpt":"Consider any discrete memoryless channel (DMC) with arbitrarily but finite input and output alphabets X, Y respectively. Then, for any capacity achieving input distribution all symbols occur less frequently than 1-1/e$. That is, \\[ \\max\\limits_{x \\in \\mathcal{X}} P^*(x) < 1-\\frac{1}{e} \\] \\noindent where $P^*(x)$ is a capacity achieving input distribution. Also, we provide sufficient conditions for which a discrete distribution can be a capacity achieving input distribution for some DMC channel. Lastly, we show that there is no similar restriction on the capacity achieving output distribution."},"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":"1201.6425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-31T03:16:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c5992847f9de4fb0531a3b1692209d0d6668d0aa1f32452edaf7e0f8b7824d3","abstract_canon_sha256":"9794410fc2a8848a3ec9ebe095bfdafa154f2680e3898909b7a1b08bfba308ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:31.539123Z","signature_b64":"chBXcsAX56ENOfQX+IKnVKkbNOs6QCEar+lGVr2SHzkSpfetiqWnmO4BrzrbveqPRCoWMeGtJufWsWKuwVdLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d3edbd6799dfa5fb97060ad8f512695e2f87507d020e5474adb97a85a2af615","last_reissued_at":"2026-05-18T04:03:31.538503Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:31.538503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"No input symbol should occur more frequently than 1-1/e","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros Manolakos, Gowtham Kumar","submitted_at":"2012-01-31T03:16:20Z","abstract_excerpt":"Consider any discrete memoryless channel (DMC) with arbitrarily but finite input and output alphabets X, Y respectively. Then, for any capacity achieving input distribution all symbols occur less frequently than 1-1/e$. That is, \\[ \\max\\limits_{x \\in \\mathcal{X}} P^*(x) < 1-\\frac{1}{e} \\] \\noindent where $P^*(x)$ is a capacity achieving input distribution. Also, we provide sufficient conditions for which a discrete distribution can be a capacity achieving input distribution for some DMC channel. Lastly, we show that there is no similar restriction on the capacity achieving output distribution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6425","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":"1201.6425","created_at":"2026-05-18T04:03:31.538600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6425v1","created_at":"2026-05-18T04:03:31.538600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6425","created_at":"2026-05-18T04:03:31.538600+00:00"},{"alias_kind":"pith_short_12","alias_value":"DU7NXVTZTX5F","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DU7NXVTZTX5F7OLQ","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DU7NXVTZ","created_at":"2026-05-18T12:27:04.183437+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/DU7NXVTZTX5F7OLQMCWY6UJGSX","json":"https://pith.science/pith/DU7NXVTZTX5F7OLQMCWY6UJGSX.json","graph_json":"https://pith.science/api/pith-number/DU7NXVTZTX5F7OLQMCWY6UJGSX/graph.json","events_json":"https://pith.science/api/pith-number/DU7NXVTZTX5F7OLQMCWY6UJGSX/events.json","paper":"https://pith.science/paper/DU7NXVTZ"},"agent_actions":{"view_html":"https://pith.science/pith/DU7NXVTZTX5F7OLQMCWY6UJGSX","download_json":"https://pith.science/pith/DU7NXVTZTX5F7OLQMCWY6UJGSX.json","view_paper":"https://pith.science/paper/DU7NXVTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6425&json=true","fetch_graph":"https://pith.science/api/pith-number/DU7NXVTZTX5F7OLQMCWY6UJGSX/graph.json","fetch_events":"https://pith.science/api/pith-number/DU7NXVTZTX5F7OLQMCWY6UJGSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DU7NXVTZTX5F7OLQMCWY6UJGSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DU7NXVTZTX5F7OLQMCWY6UJGSX/action/storage_attestation","attest_author":"https://pith.science/pith/DU7NXVTZTX5F7OLQMCWY6UJGSX/action/author_attestation","sign_citation":"https://pith.science/pith/DU7NXVTZTX5F7OLQMCWY6UJGSX/action/citation_signature","submit_replication":"https://pith.science/pith/DU7NXVTZTX5F7OLQMCWY6UJGSX/action/replication_record"}},"created_at":"2026-05-18T04:03:31.538600+00:00","updated_at":"2026-05-18T04:03:31.538600+00:00"}