{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OMZ3PMFJ4SG2TZ4EVDIJLHXQCF","short_pith_number":"pith:OMZ3PMFJ","canonical_record":{"source":{"id":"1301.4441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T17:27:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6fd33bbf2f184da4fac8f8f58c3023f853c25877fb67bd2b06a856393bb5dff7","abstract_canon_sha256":"486f1604ab4670b2e71f61335757339f6175e10bb1af2b0ec0e5dc4c16bfbbd3"},"schema_version":"1.0"},"canonical_sha256":"7333b7b0a9e48da9e784a8d0959ef011692f5ceb418f985005d30d8ee91658e2","source":{"kind":"arxiv","id":"1301.4441","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4441","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4441v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4441","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"OMZ3PMFJ4SG2","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OMZ3PMFJ4SG2TZ4E","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OMZ3PMFJ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OMZ3PMFJ4SG2TZ4EVDIJLHXQCF","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T17:27:14Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6fd33bbf2f184da4fac8f8f58c3023f853c25877fb67bd2b06a856393bb5dff7","abstract_canon_sha256":"486f1604ab4670b2e71f61335757339f6175e10bb1af2b0ec0e5dc4c16bfbbd3"},"schema_version":"1.0"},"canonical_sha256":"7333b7b0a9e48da9e784a8d0959ef011692f5ceb418f985005d30d8ee91658e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:06.666331Z","signature_b64":"5HW1udDPWer+sfi5sbi3/ffBoFRCVCsbskkWgX2FBMCj9qbZYLUddBQcELcr391dje1wdMRenWrSUS4SXOUlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7333b7b0a9e48da9e784a8d0959ef011692f5ceb418f985005d30d8ee91658e2","last_reissued_at":"2026-05-18T03:04:06.665844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:06.665844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4441","source_version":2,"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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B46s1pRmopo8gzgeEzjnG7YQykHfFQWL7vLZSbHuayI7qSl1Sciy2NsbSFJi7SruXsfngDEAcFFkjlNVYLk9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:59:47.507978Z"},"content_sha256":"a3cb338197b62f3c81d320e099b47168b75763155af20583078e130c812f5658","schema_version":"1.0","event_id":"sha256:a3cb338197b62f3c81d320e099b47168b75763155af20583078e130c812f5658"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OMZ3PMFJ4SG2TZ4EVDIJLHXQCF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Complexity of Channels in General Probabilistic Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"A. Montina, M. Pfaffhauser, S. Wolf","submitted_at":"2013-01-18T17:27:14Z","abstract_excerpt":"The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum state. At present, only little is known about this quantity. In this paper, we present a procedure for systematically evaluating the communication complexity of channels in any general probabilistic theory, in particular quantum theory. The procedure is constructive and provides the most efficient classical protocols. We illustrate this procedure by evaluating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4441","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"},"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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMvTDffbLARPA2wdOva/UBjo8js37LHzmTF/QJbIgIz1Hq+rU4MdStnyMsuYx9kq0PDmq97ssRxHAHocENnSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:59:47.508438Z"},"content_sha256":"aa33d748c440f231dd7d2503479b583bc20a7704cc3ef5da112d76aae19238e2","schema_version":"1.0","event_id":"sha256:aa33d748c440f231dd7d2503479b583bc20a7704cc3ef5da112d76aae19238e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMZ3PMFJ4SG2TZ4EVDIJLHXQCF/bundle.json","state_url":"https://pith.science/pith/OMZ3PMFJ4SG2TZ4EVDIJLHXQCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMZ3PMFJ4SG2TZ4EVDIJLHXQCF/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-27T11:59:47Z","links":{"resolver":"https://pith.science/pith/OMZ3PMFJ4SG2TZ4EVDIJLHXQCF","bundle":"https://pith.science/pith/OMZ3PMFJ4SG2TZ4EVDIJLHXQCF/bundle.json","state":"https://pith.science/pith/OMZ3PMFJ4SG2TZ4EVDIJLHXQCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMZ3PMFJ4SG2TZ4EVDIJLHXQCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OMZ3PMFJ4SG2TZ4EVDIJLHXQCF","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":"486f1604ab4670b2e71f61335757339f6175e10bb1af2b0ec0e5dc4c16bfbbd3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T17:27:14Z","title_canon_sha256":"6fd33bbf2f184da4fac8f8f58c3023f853c25877fb67bd2b06a856393bb5dff7"},"schema_version":"1.0","source":{"id":"1301.4441","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4441","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4441v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4441","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"OMZ3PMFJ4SG2","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OMZ3PMFJ4SG2TZ4E","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OMZ3PMFJ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:aa33d748c440f231dd7d2503479b583bc20a7704cc3ef5da112d76aae19238e2","target":"graph","created_at":"2026-05-18T03:04:06Z","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":"The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum state. At present, only little is known about this quantity. In this paper, we present a procedure for systematically evaluating the communication complexity of channels in any general probabilistic theory, in particular quantum theory. The procedure is constructive and provides the most efficient classical protocols. We illustrate this procedure by evaluating ","authors_text":"A. Montina, M. Pfaffhauser, S. Wolf","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T17:27:14Z","title":"Communication Complexity of Channels in General Probabilistic Theories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4441","kind":"arxiv","version":2},"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:a3cb338197b62f3c81d320e099b47168b75763155af20583078e130c812f5658","target":"record","created_at":"2026-05-18T03:04:06Z","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":"486f1604ab4670b2e71f61335757339f6175e10bb1af2b0ec0e5dc4c16bfbbd3","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-18T17:27:14Z","title_canon_sha256":"6fd33bbf2f184da4fac8f8f58c3023f853c25877fb67bd2b06a856393bb5dff7"},"schema_version":"1.0","source":{"id":"1301.4441","kind":"arxiv","version":2}},"canonical_sha256":"7333b7b0a9e48da9e784a8d0959ef011692f5ceb418f985005d30d8ee91658e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7333b7b0a9e48da9e784a8d0959ef011692f5ceb418f985005d30d8ee91658e2","first_computed_at":"2026-05-18T03:04:06.665844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:06.665844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5HW1udDPWer+sfi5sbi3/ffBoFRCVCsbskkWgX2FBMCj9qbZYLUddBQcELcr391dje1wdMRenWrSUS4SXOUlDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:06.666331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4441","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3cb338197b62f3c81d320e099b47168b75763155af20583078e130c812f5658","sha256:aa33d748c440f231dd7d2503479b583bc20a7704cc3ef5da112d76aae19238e2"],"state_sha256":"ce10ff8c2dc719d4fb1fd6e239050ab3beb53df62ec50fdc4ecc20ad3cd3bb4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N7MOym6px6v8d9i4Kd5N/vkWAClvPzhHvAxrXoXfw8yTELSH9JqgMPNyjruPC26QUFXZgybsIjeSEsrJGkx9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:59:47.510885Z","bundle_sha256":"624567d3f150209c7a829fe333482737e35d06efc35d37306aee2e5974db2151"}}