{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XVGPM5M6ZSHU77QJVGDH22VWJT","short_pith_number":"pith:XVGPM5M6","canonical_record":{"source":{"id":"1102.2624","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-13T19:15:20Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ffbd153889dc104b0f2abc6b6bf8708125c8397cb215dff4807d5636805029d9","abstract_canon_sha256":"1028b029ee74dd84453f698130ea408fa93824b0c0a84deceb90b2bba6f7a844"},"schema_version":"1.0"},"canonical_sha256":"bd4cf6759ecc8f4ffe09a9867d6ab64ce8b87b11f8fe8cc7777dff87f6b017e4","source":{"kind":"arxiv","id":"1102.2624","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2624","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2624v5","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2624","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"pith_short_12","alias_value":"XVGPM5M6ZSHU","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XVGPM5M6ZSHU77QJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XVGPM5M6","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XVGPM5M6ZSHU77QJVGDH22VWJT","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2624","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-13T19:15:20Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ffbd153889dc104b0f2abc6b6bf8708125c8397cb215dff4807d5636805029d9","abstract_canon_sha256":"1028b029ee74dd84453f698130ea408fa93824b0c0a84deceb90b2bba6f7a844"},"schema_version":"1.0"},"canonical_sha256":"bd4cf6759ecc8f4ffe09a9867d6ab64ce8b87b11f8fe8cc7777dff87f6b017e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:00.528879Z","signature_b64":"a+N8WK+QvGrR8udAB1fvEY22fQTySnZ6w4bmfx+EgvPIVs2H0VH3xcK2H+RlbLsAhyJR1Cu74yLR8G/CoYxrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd4cf6759ecc8f4ffe09a9867d6ab64ce8b87b11f8fe8cc7777dff87f6b017e4","last_reissued_at":"2026-05-18T03:55:00.528139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:00.528139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2624","source_version":5,"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:55:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4At9+1Z7cWVy1xSqUAUgU98zgnqUQBy5iYVRTm3kII6fUKGsRzmViTBy6ql86xzGa+EK7s5lOH1VlIk3IQICAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:17:47.403593Z"},"content_sha256":"fcc20d0b72a215ec4c92e840fd73c154e161ae0402e127eb75283d6fe9d559e6","schema_version":"1.0","event_id":"sha256:fcc20d0b72a215ec4c92e840fd73c154e161ae0402e127eb75283d6fe9d559e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XVGPM5M6ZSHU77QJVGDH22VWJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classical communication over a quantum interference channel","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-13T19:15:20Z","abstract_excerpt":"Calculating the capacity of interference channels is a notorious open problem in classical information theory. Such channels have two senders and two receivers, and each sender would like to communicate with a partner receiver. The capacity of such channels is known exactly in the settings of \"very strong\" and \"strong\" interference, while the Han-Kobayashi coding strategy gives the best known achievable rate region in the general case. Here, we introduce and study the quantum interference channel, a natural generalization of the interference channel to the setting of quantum information theory"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2624","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":""},"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:55:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20HE3LS/mv/SqL3NGkuFdqToNMqzIFRVQzVzjS+W8P0deYi/LA2VV9O5GcfWIFFAZ4stq8czg6zbyFrsoToWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T17:17:47.404006Z"},"content_sha256":"bad49f6d2086b2c6b1838260d67a5347604a90e5971f110c02bd518171f9c57b","schema_version":"1.0","event_id":"sha256:bad49f6d2086b2c6b1838260d67a5347604a90e5971f110c02bd518171f9c57b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVGPM5M6ZSHU77QJVGDH22VWJT/bundle.json","state_url":"https://pith.science/pith/XVGPM5M6ZSHU77QJVGDH22VWJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVGPM5M6ZSHU77QJVGDH22VWJT/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-23T17:17:47Z","links":{"resolver":"https://pith.science/pith/XVGPM5M6ZSHU77QJVGDH22VWJT","bundle":"https://pith.science/pith/XVGPM5M6ZSHU77QJVGDH22VWJT/bundle.json","state":"https://pith.science/pith/XVGPM5M6ZSHU77QJVGDH22VWJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVGPM5M6ZSHU77QJVGDH22VWJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XVGPM5M6ZSHU77QJVGDH22VWJT","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":"1028b029ee74dd84453f698130ea408fa93824b0c0a84deceb90b2bba6f7a844","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-13T19:15:20Z","title_canon_sha256":"ffbd153889dc104b0f2abc6b6bf8708125c8397cb215dff4807d5636805029d9"},"schema_version":"1.0","source":{"id":"1102.2624","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2624","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2624v5","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2624","created_at":"2026-05-18T03:55:00Z"},{"alias_kind":"pith_short_12","alias_value":"XVGPM5M6ZSHU","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XVGPM5M6ZSHU77QJ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XVGPM5M6","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:bad49f6d2086b2c6b1838260d67a5347604a90e5971f110c02bd518171f9c57b","target":"graph","created_at":"2026-05-18T03:55:00Z","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":"Calculating the capacity of interference channels is a notorious open problem in classical information theory. Such channels have two senders and two receivers, and each sender would like to communicate with a partner receiver. The capacity of such channels is known exactly in the settings of \"very strong\" and \"strong\" interference, while the Han-Kobayashi coding strategy gives the best known achievable rate region in the general case. Here, we introduce and study the quantum interference channel, a natural generalization of the interference channel to the setting of quantum information theory","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-13T19:15:20Z","title":"Classical communication over a quantum interference channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2624","kind":"arxiv","version":5},"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:fcc20d0b72a215ec4c92e840fd73c154e161ae0402e127eb75283d6fe9d559e6","target":"record","created_at":"2026-05-18T03:55:00Z","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":"1028b029ee74dd84453f698130ea408fa93824b0c0a84deceb90b2bba6f7a844","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-02-13T19:15:20Z","title_canon_sha256":"ffbd153889dc104b0f2abc6b6bf8708125c8397cb215dff4807d5636805029d9"},"schema_version":"1.0","source":{"id":"1102.2624","kind":"arxiv","version":5}},"canonical_sha256":"bd4cf6759ecc8f4ffe09a9867d6ab64ce8b87b11f8fe8cc7777dff87f6b017e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd4cf6759ecc8f4ffe09a9867d6ab64ce8b87b11f8fe8cc7777dff87f6b017e4","first_computed_at":"2026-05-18T03:55:00.528139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:00.528139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a+N8WK+QvGrR8udAB1fvEY22fQTySnZ6w4bmfx+EgvPIVs2H0VH3xcK2H+RlbLsAhyJR1Cu74yLR8G/CoYxrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:00.528879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2624","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcc20d0b72a215ec4c92e840fd73c154e161ae0402e127eb75283d6fe9d559e6","sha256:bad49f6d2086b2c6b1838260d67a5347604a90e5971f110c02bd518171f9c57b"],"state_sha256":"7378bd4a020331bc5793b7f9ff26a2d03627fb7fc9ecc1908d1331cb89928c7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3oIYkU+7NjwJAXj+rWAQiuDyoPwVztDkKYMuzDPcX5UHIfTm+Dm7W+uUs/ZCBKmzhrFyeOacrVhik9D0A/5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T17:17:47.406665Z","bundle_sha256":"93c19739036c463278198704f05bcae9a5296a024c95993488e6bc0db683286b"}}