{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MVJDT7DRPQ7JJQFBIQUMSW4LZO","short_pith_number":"pith:MVJDT7DR","schema_version":"1.0","canonical_sha256":"655239fc717c3e94c0a14428c95b8bcbbfe709e39cb3f49e4288c37fa69c8772","source":{"kind":"arxiv","id":"1412.4510","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Interpretation for the Arimoto Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ram Zamir, Sergey Tridenski","submitted_at":"2014-12-15T09:44:28Z","abstract_excerpt":"The Arimoto algorithm computes the Gallager function $\\max_Q {E}_{0}^{}(\\rho,Q)$ for a given channel ${P}_{}^{}(y \\,|\\, x)$ and parameter $\\rho$, by means of alternating maximization. Along the way, it generates a sequence of input distributions ${Q}_{1}^{}(x)$, ${Q}_{2}^{}(x)$, ... , that converges to the maximizing input ${Q}_{}^{*}(x)$. We propose a stochastic interpretation for the Arimoto algorithm. We show that for a random (i.i.d.) codebook with a distribution ${Q}_{k}^{}(x)$, the next distribution ${Q}_{k+1}^{}(x)$ in the Arimoto algorithm is equal to the type (${Q}'$) of the feasible "},"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":"1412.4510","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-15T09:44:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f0877119d8ba94c335a86dba4bed23c89de190d3131c2ea89073ed5be90ba12","abstract_canon_sha256":"ed0fa7e9f52b40822a0e0ab78be3c1bb4b39be8e9ede86c5bf1cbc04097d0d3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:04.511732Z","signature_b64":"edLDHs7DKP0PKvz7Kd+uZwKU05/gbFlTGM/UL8YO9xdMcKMS3/JzGalR0BPis08YQWeXps2TARTwAODX2ZNCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"655239fc717c3e94c0a14428c95b8bcbbfe709e39cb3f49e4288c37fa69c8772","last_reissued_at":"2026-05-18T02:25:04.511322Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:04.511322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Interpretation for the Arimoto Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ram Zamir, Sergey Tridenski","submitted_at":"2014-12-15T09:44:28Z","abstract_excerpt":"The Arimoto algorithm computes the Gallager function $\\max_Q {E}_{0}^{}(\\rho,Q)$ for a given channel ${P}_{}^{}(y \\,|\\, x)$ and parameter $\\rho$, by means of alternating maximization. Along the way, it generates a sequence of input distributions ${Q}_{1}^{}(x)$, ${Q}_{2}^{}(x)$, ... , that converges to the maximizing input ${Q}_{}^{*}(x)$. We propose a stochastic interpretation for the Arimoto algorithm. We show that for a random (i.i.d.) codebook with a distribution ${Q}_{k}^{}(x)$, the next distribution ${Q}_{k+1}^{}(x)$ in the Arimoto algorithm is equal to the type (${Q}'$) of the feasible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4510","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":"1412.4510","created_at":"2026-05-18T02:25:04.511388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4510v2","created_at":"2026-05-18T02:25:04.511388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4510","created_at":"2026-05-18T02:25:04.511388+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVJDT7DRPQ7J","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVJDT7DRPQ7JJQFB","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVJDT7DR","created_at":"2026-05-18T12:28:38.356838+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/MVJDT7DRPQ7JJQFBIQUMSW4LZO","json":"https://pith.science/pith/MVJDT7DRPQ7JJQFBIQUMSW4LZO.json","graph_json":"https://pith.science/api/pith-number/MVJDT7DRPQ7JJQFBIQUMSW4LZO/graph.json","events_json":"https://pith.science/api/pith-number/MVJDT7DRPQ7JJQFBIQUMSW4LZO/events.json","paper":"https://pith.science/paper/MVJDT7DR"},"agent_actions":{"view_html":"https://pith.science/pith/MVJDT7DRPQ7JJQFBIQUMSW4LZO","download_json":"https://pith.science/pith/MVJDT7DRPQ7JJQFBIQUMSW4LZO.json","view_paper":"https://pith.science/paper/MVJDT7DR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4510&json=true","fetch_graph":"https://pith.science/api/pith-number/MVJDT7DRPQ7JJQFBIQUMSW4LZO/graph.json","fetch_events":"https://pith.science/api/pith-number/MVJDT7DRPQ7JJQFBIQUMSW4LZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVJDT7DRPQ7JJQFBIQUMSW4LZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVJDT7DRPQ7JJQFBIQUMSW4LZO/action/storage_attestation","attest_author":"https://pith.science/pith/MVJDT7DRPQ7JJQFBIQUMSW4LZO/action/author_attestation","sign_citation":"https://pith.science/pith/MVJDT7DRPQ7JJQFBIQUMSW4LZO/action/citation_signature","submit_replication":"https://pith.science/pith/MVJDT7DRPQ7JJQFBIQUMSW4LZO/action/replication_record"}},"created_at":"2026-05-18T02:25:04.511388+00:00","updated_at":"2026-05-18T02:25:04.511388+00:00"}