{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AEF3G3IKNFKDI4H735MBHIQNC7","short_pith_number":"pith:AEF3G3IK","schema_version":"1.0","canonical_sha256":"010bb36d0a69543470ffdf5813a20d17d534e8c050cfad38be3762446cc55f28","source":{"kind":"arxiv","id":"2404.10950","version":5},"attestation_state":"computed","paper":{"title":"Alternating Optimization Approach for Computing $\\alpha$-Mutual Information and $\\alpha$-Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akira Kamatsuka, Koki Kazama, Takahiro Yoshida","submitted_at":"2024-04-16T23:18:07Z","abstract_excerpt":"This study presents alternating optimization (AO) algorithms for computing $\\alpha$-mutual information ($\\alpha$-MI) and $\\alpha$-capacity based on variational characterizations of $\\alpha$-MI using a reverse channel. Specifically, we derive several variational characterizations of Sibson, Arimoto, Augustin--Csisz{\\' a}r, and Lapidoth--Pfister MI and introduce novel AO algorithms for computing $\\alpha$-MI and $\\alpha$-capacity; their performances for computing $\\alpha$-capacity are also compared. The comparison results show that the AO algorithm based on the Sibson MI's characterization has th"},"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":"2404.10950","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-04-16T23:18:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"42d026b0f62fa2ffc1f52bb646bd2e48ecf535105f58ea5f37ba09232f30a741","abstract_canon_sha256":"c1dc23f78003947da0af07f4a6f2b7094320af58beed015d4672939a6a3e7556"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:56:05.676779Z","signature_b64":"zXnpeShA/VmDeSZBgf7VPauVs3aL5TYq076S6GIfmbmfLkSpsl8yvg17dUvN0UEXSSak/zWQWZOHZiK4A6oECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"010bb36d0a69543470ffdf5813a20d17d534e8c050cfad38be3762446cc55f28","last_reissued_at":"2026-07-05T10:56:05.676277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:56:05.676277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating Optimization Approach for Computing $\\alpha$-Mutual Information and $\\alpha$-Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akira Kamatsuka, Koki Kazama, Takahiro Yoshida","submitted_at":"2024-04-16T23:18:07Z","abstract_excerpt":"This study presents alternating optimization (AO) algorithms for computing $\\alpha$-mutual information ($\\alpha$-MI) and $\\alpha$-capacity based on variational characterizations of $\\alpha$-MI using a reverse channel. Specifically, we derive several variational characterizations of Sibson, Arimoto, Augustin--Csisz{\\' a}r, and Lapidoth--Pfister MI and introduce novel AO algorithms for computing $\\alpha$-MI and $\\alpha$-capacity; their performances for computing $\\alpha$-capacity are also compared. The comparison results show that the AO algorithm based on the Sibson MI's characterization has th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.10950","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.10950/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.10950","created_at":"2026-07-05T10:56:05.676340+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.10950v5","created_at":"2026-07-05T10:56:05.676340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10950","created_at":"2026-07-05T10:56:05.676340+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEF3G3IKNFKD","created_at":"2026-07-05T10:56:05.676340+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEF3G3IKNFKDI4H7","created_at":"2026-07-05T10:56:05.676340+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEF3G3IK","created_at":"2026-07-05T10:56:05.676340+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05205","citing_title":"Alternating minimization for computing doubly minimized Petz Renyi mutual information","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7","json":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7.json","graph_json":"https://pith.science/api/pith-number/AEF3G3IKNFKDI4H735MBHIQNC7/graph.json","events_json":"https://pith.science/api/pith-number/AEF3G3IKNFKDI4H735MBHIQNC7/events.json","paper":"https://pith.science/paper/AEF3G3IK"},"agent_actions":{"view_html":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7","download_json":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7.json","view_paper":"https://pith.science/paper/AEF3G3IK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.10950&json=true","fetch_graph":"https://pith.science/api/pith-number/AEF3G3IKNFKDI4H735MBHIQNC7/graph.json","fetch_events":"https://pith.science/api/pith-number/AEF3G3IKNFKDI4H735MBHIQNC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7/action/storage_attestation","attest_author":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7/action/author_attestation","sign_citation":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7/action/citation_signature","submit_replication":"https://pith.science/pith/AEF3G3IKNFKDI4H735MBHIQNC7/action/replication_record"}},"created_at":"2026-07-05T10:56:05.676340+00:00","updated_at":"2026-07-05T10:56:05.676340+00:00"}