{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XX26ZF63HX3IEMO4STQY2UEQ6B","short_pith_number":"pith:XX26ZF63","canonical_record":{"source":{"id":"2407.06013","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-08T15:05:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e41c69cc9c06157e821dc711624f8565678489457d8921b79dca437d48707a93","abstract_canon_sha256":"64fc0365c9ed3b96a6426fd056baa7fc30a3c94eaa42c1c3c0fe1ca3bd656c97"},"schema_version":"1.0"},"canonical_sha256":"bdf5ec97db3df68231dc94e18d5090f064457857db39bc0dbc261ce837b0c915","source":{"kind":"arxiv","id":"2407.06013","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.06013","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"2407.06013v6","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06013","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"XX26ZF63HX3I","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"pith_short_16","alias_value":"XX26ZF63HX3IEMO4","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"pith_short_8","alias_value":"XX26ZF63","created_at":"2026-07-05T11:39:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XX26ZF63HX3IEMO4STQY2UEQ6B","target":"record","payload":{"canonical_record":{"source":{"id":"2407.06013","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-08T15:05:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e41c69cc9c06157e821dc711624f8565678489457d8921b79dca437d48707a93","abstract_canon_sha256":"64fc0365c9ed3b96a6426fd056baa7fc30a3c94eaa42c1c3c0fe1ca3bd656c97"},"schema_version":"1.0"},"canonical_sha256":"bdf5ec97db3df68231dc94e18d5090f064457857db39bc0dbc261ce837b0c915","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:41.594805Z","signature_b64":"U623ALV1PatgCweGAdU3kCwg88PWsZDTnOYEZjAXfQuSwtvBwCqpdrBA6DFlgnSnmvin80ahi2aunYgPg6cdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf5ec97db3df68231dc94e18d5090f064457857db39bc0dbc261ce837b0c915","last_reissued_at":"2026-07-05T11:39:41.594240Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:41.594240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.06013","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1x9fIoMft5jDpN2fqyIEZfLX+/7nVj9+QwsnASPTCcCCKjhocW0OFd7MQquigWZmu40V8vcWtTdluVELjxyeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:14:25.254240Z"},"content_sha256":"7e3c9a0a58043a25be5b1fd8da7d3048daf984bca2323622496e9c9677c8f930","schema_version":"1.0","event_id":"sha256:7e3c9a0a58043a25be5b1fd8da7d3048daf984bca2323622496e9c9677c8f930"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XX26ZF63HX3IEMO4STQY2UEQ6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisit the Arimoto-Blahut algorithm: New Analysis with Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Apostolos Traganitis, Konstantinos Varsos, Michail Fasoulakis","submitted_at":"2024-07-08T15:05:53Z","abstract_excerpt":"By the seminal paper of Claude Shannon \\cite{Shannon48}, the computation of the capacity of a discrete memoryless channel has been considered as one of the most important and fundamental problems in Information Theory. Nearly 50 years ago, Arimoto and Blahut independently proposed identical algorithms to solve this problem in their seminal papers \\cite{Arimoto1972AnAF, Blahut1972ComputationOC}. The Arimoto-Blahut algorithm was proven to converge to the capacity of the channel as $t \\to \\infty$, with a convergence rate upper bounded by $O\\left(\\log(m)/t\\right)$, where $m$ is the size of the inp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06013","kind":"arxiv","version":6},"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/2407.06013/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUEDA76N2c3tQt41bfssf0AnyEAmrXaIrpa7qwSlW9zVb/zJWA3tED+6ZVfHvZhlSOQqKtpvxhFIOEp0h7FUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:14:25.255252Z"},"content_sha256":"86617ed1bc46806b86d6effdda9d088e05175caf7e2bce88385f39807e93aefc","schema_version":"1.0","event_id":"sha256:86617ed1bc46806b86d6effdda9d088e05175caf7e2bce88385f39807e93aefc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX26ZF63HX3IEMO4STQY2UEQ6B/bundle.json","state_url":"https://pith.science/pith/XX26ZF63HX3IEMO4STQY2UEQ6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX26ZF63HX3IEMO4STQY2UEQ6B/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T20:14:25Z","links":{"resolver":"https://pith.science/pith/XX26ZF63HX3IEMO4STQY2UEQ6B","bundle":"https://pith.science/pith/XX26ZF63HX3IEMO4STQY2UEQ6B/bundle.json","state":"https://pith.science/pith/XX26ZF63HX3IEMO4STQY2UEQ6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX26ZF63HX3IEMO4STQY2UEQ6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XX26ZF63HX3IEMO4STQY2UEQ6B","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":"64fc0365c9ed3b96a6426fd056baa7fc30a3c94eaa42c1c3c0fe1ca3bd656c97","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-08T15:05:53Z","title_canon_sha256":"e41c69cc9c06157e821dc711624f8565678489457d8921b79dca437d48707a93"},"schema_version":"1.0","source":{"id":"2407.06013","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.06013","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"2407.06013v6","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06013","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"XX26ZF63HX3I","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"pith_short_16","alias_value":"XX26ZF63HX3IEMO4","created_at":"2026-07-05T11:39:41Z"},{"alias_kind":"pith_short_8","alias_value":"XX26ZF63","created_at":"2026-07-05T11:39:41Z"}],"graph_snapshots":[{"event_id":"sha256:86617ed1bc46806b86d6effdda9d088e05175caf7e2bce88385f39807e93aefc","target":"graph","created_at":"2026-07-05T11:39:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.06013/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"By the seminal paper of Claude Shannon \\cite{Shannon48}, the computation of the capacity of a discrete memoryless channel has been considered as one of the most important and fundamental problems in Information Theory. Nearly 50 years ago, Arimoto and Blahut independently proposed identical algorithms to solve this problem in their seminal papers \\cite{Arimoto1972AnAF, Blahut1972ComputationOC}. The Arimoto-Blahut algorithm was proven to converge to the capacity of the channel as $t \\to \\infty$, with a convergence rate upper bounded by $O\\left(\\log(m)/t\\right)$, where $m$ is the size of the inp","authors_text":"Apostolos Traganitis, Konstantinos Varsos, Michail Fasoulakis","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-08T15:05:53Z","title":"Revisit the Arimoto-Blahut algorithm: New Analysis with Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06013","kind":"arxiv","version":6},"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:7e3c9a0a58043a25be5b1fd8da7d3048daf984bca2323622496e9c9677c8f930","target":"record","created_at":"2026-07-05T11:39:41Z","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":"64fc0365c9ed3b96a6426fd056baa7fc30a3c94eaa42c1c3c0fe1ca3bd656c97","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-08T15:05:53Z","title_canon_sha256":"e41c69cc9c06157e821dc711624f8565678489457d8921b79dca437d48707a93"},"schema_version":"1.0","source":{"id":"2407.06013","kind":"arxiv","version":6}},"canonical_sha256":"bdf5ec97db3df68231dc94e18d5090f064457857db39bc0dbc261ce837b0c915","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdf5ec97db3df68231dc94e18d5090f064457857db39bc0dbc261ce837b0c915","first_computed_at":"2026-07-05T11:39:41.594240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:39:41.594240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U623ALV1PatgCweGAdU3kCwg88PWsZDTnOYEZjAXfQuSwtvBwCqpdrBA6DFlgnSnmvin80ahi2aunYgPg6cdBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:39:41.594805Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.06013","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e3c9a0a58043a25be5b1fd8da7d3048daf984bca2323622496e9c9677c8f930","sha256:86617ed1bc46806b86d6effdda9d088e05175caf7e2bce88385f39807e93aefc"],"state_sha256":"1d78a092f86873b549c0843e2d3da75bca431f641717cf4850674897ccb78069"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GluTmuyZ1HGHTcBBeF8YymtjvB2FXDapJjbkew8GcBiEvfKoR5sVdt5Ltth1r36uFTpVorFcEwvGoy+1+fI1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T20:14:25.262232Z","bundle_sha256":"a96303347e5bb890f31b654ec70209ac1ca689671ad5507a2717057e871b6c7e"}}