{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FIAZZNJ4AOYIYHD6HGERSJ3KKQ","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":"b228673708c3e3b39d1c1abdcf4c9d63f1405389d849a234e0b813f5aa276816","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T15:32:42Z","title_canon_sha256":"09c200c98f44816b21a2ad2380babc7e1da87b520fd981fb80ed05d723f9485f"},"schema_version":"1.0","source":{"id":"1503.04108","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04108","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04108v3","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04108","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"FIAZZNJ4AOYI","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FIAZZNJ4AOYIYHD6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FIAZZNJ4","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:c02ebedd9850a5b0a57fbfa5297f21a42a24308be46e3c23cae138f2c337bf90","target":"graph","created_at":"2026-05-18T00:29:39Z","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 discrete memoryless channels with input alphabet size $n$ and output alphabet size $m$, where $m=$ceil$(\\gamma n)$ for some constant $\\gamma>0$. The channel transition matrix consists of entries that, before being normalised, are independent and identically distributed nonnegative random variables $V$ and such that $E[(V \\log V)^2]<\\infty$. We prove that in the limit as $n\\to \\infty$ the capacity of such a channel converges to $Ent(V) / E[V]$ almost surely and in $L^2$, where $Ent(V):= E[V\\log V]-E[V] \\log E[V]$ denotes the entropy of $V$. We further show that, under slightly diffe","authors_text":"David Sutter, John Lygeros, Tobias Sutter","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T15:32:42Z","title":"Capacity of Random Channels with Large Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04108","kind":"arxiv","version":3},"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:b9c8c6f51b21c02042f399718a6c3960895730012b4c213346ca7462c6b2824c","target":"record","created_at":"2026-05-18T00:29:39Z","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":"b228673708c3e3b39d1c1abdcf4c9d63f1405389d849a234e0b813f5aa276816","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T15:32:42Z","title_canon_sha256":"09c200c98f44816b21a2ad2380babc7e1da87b520fd981fb80ed05d723f9485f"},"schema_version":"1.0","source":{"id":"1503.04108","kind":"arxiv","version":3}},"canonical_sha256":"2a019cb53c03b08c1c7e398919276a54149cfd8e6e0987bd2b91a27c93667455","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a019cb53c03b08c1c7e398919276a54149cfd8e6e0987bd2b91a27c93667455","first_computed_at":"2026-05-18T00:29:39.818244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:39.818244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UhS4xTdqba4WXris6JxafALwfbfSjiSJRYhQG1bi6JEAEU6vnwqVwqBACWMLYoDDlXKy3nhG4d925701qCQkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:39.818746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04108","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9c8c6f51b21c02042f399718a6c3960895730012b4c213346ca7462c6b2824c","sha256:c02ebedd9850a5b0a57fbfa5297f21a42a24308be46e3c23cae138f2c337bf90"],"state_sha256":"16e259143c546f03df7d0a2e87660df457cbc9d71750832cd56d12be58695da2"}