{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Y2QMWEOGLI6AL2NHVWHI5L2TFB","short_pith_number":"pith:Y2QMWEOG","canonical_record":{"source":{"id":"1904.11188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-25T07:42:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7f2d9c414ac8631234aa46c3702027ebe18bb0fc938d0b7769a4a23471dac037","abstract_canon_sha256":"0ef554938811c1317e31994dfe6e96493e891c5bafd49f0f863edf4edbb4a8c4"},"schema_version":"1.0"},"canonical_sha256":"c6a0cb11c65a3c05e9a7ad8e8eaf53284cd8be24e2b28a332188f5b4ec859f44","source":{"kind":"arxiv","id":"1904.11188","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11188","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11188v1","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11188","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"Y2QMWEOGLI6A","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y2QMWEOGLI6AL2NH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y2QMWEOG","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Y2QMWEOGLI6AL2NHVWHI5L2TFB","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-25T07:42:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7f2d9c414ac8631234aa46c3702027ebe18bb0fc938d0b7769a4a23471dac037","abstract_canon_sha256":"0ef554938811c1317e31994dfe6e96493e891c5bafd49f0f863edf4edbb4a8c4"},"schema_version":"1.0"},"canonical_sha256":"c6a0cb11c65a3c05e9a7ad8e8eaf53284cd8be24e2b28a332188f5b4ec859f44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:45.552560Z","signature_b64":"MF0UcWFhK7atSEHXJ61RHsVbOApJ61ttSCs0/ldPOb3DaaaGuIzS297qHPtYmCDeIF8hDK6GCh1BiGPjKd8PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a0cb11c65a3c05e9a7ad8e8eaf53284cd8be24e2b28a332188f5b4ec859f44","last_reissued_at":"2026-05-17T23:47:45.551906Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:45.551906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11188","source_version":1,"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-05-17T23:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WuXX9LvqSskozBEZfYmCPu6LLOARo2x3CRNlJt0KbciDCgv7GyEAz5M2RjlH0XZiVJeM/OWugPoEYAt9IJUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:38.997412Z"},"content_sha256":"e8691ec3e50642b660ecb29c4ef0f3c40b792fd71d39c24d54019e751b3c47f1","schema_version":"1.0","event_id":"sha256:e8691ec3e50642b660ecb29c4ef0f3c40b792fd71d39c24d54019e751b3c47f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Y2QMWEOGLI6AL2NHVWHI5L2TFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Haobo Li, Ning Cai","submitted_at":"2019-04-25T07:42:25Z","abstract_excerpt":"Based on Arimoto's work in 1978, we propose an iterative algorithm for computing the capacity of a discrete memoryless classical-quantum channel with a finite input alphabet and a finite dimensional output, which we call the Blahut-Arimoto algorithm for classical-quantum channel, and an input cost constraint is considered. We show that to reach $\\varepsilon$ accuracy, the iteration complexity of the algorithm is up bounded by $\\frac{\\log n\\log\\varepsilon}{\\varepsilon}$ where $n$ is the size of the input alphabet. In particular, when the output state $\\{\\rho_x\\}_{x\\in \\mathcal{X}}$ is linearly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11188","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"},"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-05-17T23:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iO75w/RVndjThOWoU/PP7WdnxBxJnYxvzwbEs0VrfKUMADJUdI7fmUMI69dc3D721HcG2enawUFlpF68mP92BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:38.997788Z"},"content_sha256":"7a740d402714cdcfd96c5ba8490901f88347a7adffeec52b5d0187df299951b5","schema_version":"1.0","event_id":"sha256:7a740d402714cdcfd96c5ba8490901f88347a7adffeec52b5d0187df299951b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2QMWEOGLI6AL2NHVWHI5L2TFB/bundle.json","state_url":"https://pith.science/pith/Y2QMWEOGLI6AL2NHVWHI5L2TFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2QMWEOGLI6AL2NHVWHI5L2TFB/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-05-26T19:06:38Z","links":{"resolver":"https://pith.science/pith/Y2QMWEOGLI6AL2NHVWHI5L2TFB","bundle":"https://pith.science/pith/Y2QMWEOGLI6AL2NHVWHI5L2TFB/bundle.json","state":"https://pith.science/pith/Y2QMWEOGLI6AL2NHVWHI5L2TFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2QMWEOGLI6AL2NHVWHI5L2TFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Y2QMWEOGLI6AL2NHVWHI5L2TFB","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":"0ef554938811c1317e31994dfe6e96493e891c5bafd49f0f863edf4edbb4a8c4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-25T07:42:25Z","title_canon_sha256":"7f2d9c414ac8631234aa46c3702027ebe18bb0fc938d0b7769a4a23471dac037"},"schema_version":"1.0","source":{"id":"1904.11188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11188","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11188v1","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11188","created_at":"2026-05-17T23:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"Y2QMWEOGLI6A","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Y2QMWEOGLI6AL2NH","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Y2QMWEOG","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:7a740d402714cdcfd96c5ba8490901f88347a7adffeec52b5d0187df299951b5","target":"graph","created_at":"2026-05-17T23:47:45Z","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":"Based on Arimoto's work in 1978, we propose an iterative algorithm for computing the capacity of a discrete memoryless classical-quantum channel with a finite input alphabet and a finite dimensional output, which we call the Blahut-Arimoto algorithm for classical-quantum channel, and an input cost constraint is considered. We show that to reach $\\varepsilon$ accuracy, the iteration complexity of the algorithm is up bounded by $\\frac{\\log n\\log\\varepsilon}{\\varepsilon}$ where $n$ is the size of the input alphabet. In particular, when the output state $\\{\\rho_x\\}_{x\\in \\mathcal{X}}$ is linearly ","authors_text":"Haobo Li, Ning Cai","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-25T07:42:25Z","title":"A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11188","kind":"arxiv","version":1},"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:e8691ec3e50642b660ecb29c4ef0f3c40b792fd71d39c24d54019e751b3c47f1","target":"record","created_at":"2026-05-17T23:47:45Z","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":"0ef554938811c1317e31994dfe6e96493e891c5bafd49f0f863edf4edbb4a8c4","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-25T07:42:25Z","title_canon_sha256":"7f2d9c414ac8631234aa46c3702027ebe18bb0fc938d0b7769a4a23471dac037"},"schema_version":"1.0","source":{"id":"1904.11188","kind":"arxiv","version":1}},"canonical_sha256":"c6a0cb11c65a3c05e9a7ad8e8eaf53284cd8be24e2b28a332188f5b4ec859f44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6a0cb11c65a3c05e9a7ad8e8eaf53284cd8be24e2b28a332188f5b4ec859f44","first_computed_at":"2026-05-17T23:47:45.551906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:45.551906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MF0UcWFhK7atSEHXJ61RHsVbOApJ61ttSCs0/ldPOb3DaaaGuIzS297qHPtYmCDeIF8hDK6GCh1BiGPjKd8PAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:45.552560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8691ec3e50642b660ecb29c4ef0f3c40b792fd71d39c24d54019e751b3c47f1","sha256:7a740d402714cdcfd96c5ba8490901f88347a7adffeec52b5d0187df299951b5"],"state_sha256":"df421295e323d17a7fe70d7fd0634a0102507a449fa7b4ac22d46116feaa830c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+h5CPVLHH7NH4vw/YAoKX47fLHdLRfF+4IzS8viBPCO1YMV7PybWuzCEVqoPEhl2Vx4BQudWZoYC/zOuBZwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:06:39.000221Z","bundle_sha256":"ef66f7a3b09629a0aefee29be2c702432df45d0576d5db764f25956ba6e687ea"}}