{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5GX2EKBEMC3DSHLWRQBATUZI2X","short_pith_number":"pith:5GX2EKBE","canonical_record":{"source":{"id":"1102.2955","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-15T03:40:45Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"89a7c28f670ba917b4844bf095276579515856e88211b450aa7de8888d1084a7","abstract_canon_sha256":"d685d89f5ba1c2acf4f24550e3d23099ed3e77308be7493195362b1c942a54fd"},"schema_version":"1.0"},"canonical_sha256":"e9afa2282460b6391d768c0209d328d5c8993709f97fd3fe140e3b3ad96551a2","source":{"kind":"arxiv","id":"1102.2955","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2955","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2955v3","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2955","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"5GX2EKBEMC3D","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5GX2EKBEMC3DSHLW","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5GX2EKBE","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5GX2EKBEMC3DSHLWRQBATUZI2X","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2955","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-15T03:40:45Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"89a7c28f670ba917b4844bf095276579515856e88211b450aa7de8888d1084a7","abstract_canon_sha256":"d685d89f5ba1c2acf4f24550e3d23099ed3e77308be7493195362b1c942a54fd"},"schema_version":"1.0"},"canonical_sha256":"e9afa2282460b6391d768c0209d328d5c8993709f97fd3fe140e3b3ad96551a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:31.746267Z","signature_b64":"sXZrrbSO7Cvsdu8uSffiS91kh0GZgZgJ8+J9JEp22nIwKFV1UTcyH0ZvGPl3AmLEdo6S1pvlzxHqRIC0nuDwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9afa2282460b6391d768c0209d328d5c8993709f97fd3fe140e3b3ad96551a2","last_reissued_at":"2026-05-18T02:22:31.745691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:31.745691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2955","source_version":3,"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-18T02:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZyrjNcIuuM4mT+UQF7voWwNykJitPuD+AgpWJcFWjE4Ddj+XMX7o5VuNJ1O2Z2dE/KtLCAtdiSmmiRKmEjhBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:25:41.280948Z"},"content_sha256":"3a293272e74db7728a7988d78e5ddcff7b437d05639ffa3750ac171312969833","schema_version":"1.0","event_id":"sha256:3a293272e74db7728a7988d78e5ddcff7b437d05639ffa3750ac171312969833"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5GX2EKBEMC3DSHLWRQBATUZI2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum interference channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ivan Savov, Mark M. Wilde, Omar Fawzi, Patrick Hayden, Pranab Sen","submitted_at":"2011-02-15T03:40:45Z","abstract_excerpt":"The discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in practical communication scenarios. In this paper, we introduce and study the quantum interference channel, a generalization of a two-input, two-output memoryless channel to the setting of quantum Shannon theory. We discuss three different coding strategies and obtain corresponding achievable rate regions for quantum interference channels. We calculate the capacity regions in the special cases of \"very strong\" and \"strong\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2955","kind":"arxiv","version":3},"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-18T02:22:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRzwqE4q1xyvWlBGoiULzC9y+tFYblJM03/eKRAwaIfrQrE4Xzxg4k1gFynPDtgs80wKzXfs8TDkz36VzjqjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:25:41.281568Z"},"content_sha256":"7d58fb192c693212943ec7796c64b0a715f0709225434c12993d64394937ddc6","schema_version":"1.0","event_id":"sha256:7d58fb192c693212943ec7796c64b0a715f0709225434c12993d64394937ddc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GX2EKBEMC3DSHLWRQBATUZI2X/bundle.json","state_url":"https://pith.science/pith/5GX2EKBEMC3DSHLWRQBATUZI2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GX2EKBEMC3DSHLWRQBATUZI2X/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-23T20:25:41Z","links":{"resolver":"https://pith.science/pith/5GX2EKBEMC3DSHLWRQBATUZI2X","bundle":"https://pith.science/pith/5GX2EKBEMC3DSHLWRQBATUZI2X/bundle.json","state":"https://pith.science/pith/5GX2EKBEMC3DSHLWRQBATUZI2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GX2EKBEMC3DSHLWRQBATUZI2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5GX2EKBEMC3DSHLWRQBATUZI2X","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":"d685d89f5ba1c2acf4f24550e3d23099ed3e77308be7493195362b1c942a54fd","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-15T03:40:45Z","title_canon_sha256":"89a7c28f670ba917b4844bf095276579515856e88211b450aa7de8888d1084a7"},"schema_version":"1.0","source":{"id":"1102.2955","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2955","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2955v3","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2955","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"5GX2EKBEMC3D","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5GX2EKBEMC3DSHLW","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5GX2EKBE","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:7d58fb192c693212943ec7796c64b0a715f0709225434c12993d64394937ddc6","target":"graph","created_at":"2026-05-18T02:22:31Z","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 discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in practical communication scenarios. In this paper, we introduce and study the quantum interference channel, a generalization of a two-input, two-output memoryless channel to the setting of quantum Shannon theory. We discuss three different coding strategies and obtain corresponding achievable rate regions for quantum interference channels. We calculate the capacity regions in the special cases of \"very strong\" and \"strong\"","authors_text":"Ivan Savov, Mark M. Wilde, Omar Fawzi, Patrick Hayden, Pranab Sen","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-15T03:40:45Z","title":"Quantum interference channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2955","kind":"arxiv","version":3},"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:3a293272e74db7728a7988d78e5ddcff7b437d05639ffa3750ac171312969833","target":"record","created_at":"2026-05-18T02:22:31Z","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":"d685d89f5ba1c2acf4f24550e3d23099ed3e77308be7493195362b1c942a54fd","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-15T03:40:45Z","title_canon_sha256":"89a7c28f670ba917b4844bf095276579515856e88211b450aa7de8888d1084a7"},"schema_version":"1.0","source":{"id":"1102.2955","kind":"arxiv","version":3}},"canonical_sha256":"e9afa2282460b6391d768c0209d328d5c8993709f97fd3fe140e3b3ad96551a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9afa2282460b6391d768c0209d328d5c8993709f97fd3fe140e3b3ad96551a2","first_computed_at":"2026-05-18T02:22:31.745691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:31.745691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sXZrrbSO7Cvsdu8uSffiS91kh0GZgZgJ8+J9JEp22nIwKFV1UTcyH0ZvGPl3AmLEdo6S1pvlzxHqRIC0nuDwBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:31.746267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2955","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a293272e74db7728a7988d78e5ddcff7b437d05639ffa3750ac171312969833","sha256:7d58fb192c693212943ec7796c64b0a715f0709225434c12993d64394937ddc6"],"state_sha256":"cc79c534a3032bff1e95c596df86c0ab1bd5e844abc54c565f95b87ba7e1030b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EPs58OsLwbOeD3NCUPWyAZV/QRFmzk1MbUfCWh2VbykjTW5tirf17fKTCA5OvZvLZ5ECWP8Xc1kjtmwXIoCFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:25:41.284821Z","bundle_sha256":"c2e8aee7bd9575d0a5ceb21c290a80fae169ecaa55cc94fcafada3780ddc3549"}}