{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TVLZ5GG3STBQ2A3FIWB7MTXKIH","short_pith_number":"pith:TVLZ5GG3","canonical_record":{"source":{"id":"1102.3227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:24:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54325093a43dc724e25cb7522153698a523c219f1097dbe37b7e7f8e6365ce46","abstract_canon_sha256":"add1e6b040b1a31777210aed001515f714c4923be5b6c896b0a4c50a1f6f557b"},"schema_version":"1.0"},"canonical_sha256":"9d579e98db94c30d03654583f64eea41fdedccee487234e673637dd7365d36c3","source":{"kind":"arxiv","id":"1102.3227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3227","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3227v1","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3227","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"TVLZ5GG3STBQ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TVLZ5GG3STBQ2A3F","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TVLZ5GG3","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TVLZ5GG3STBQ2A3FIWB7MTXKIH","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:24:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54325093a43dc724e25cb7522153698a523c219f1097dbe37b7e7f8e6365ce46","abstract_canon_sha256":"add1e6b040b1a31777210aed001515f714c4923be5b6c896b0a4c50a1f6f557b"},"schema_version":"1.0"},"canonical_sha256":"9d579e98db94c30d03654583f64eea41fdedccee487234e673637dd7365d36c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:31.605564Z","signature_b64":"05NEAuSYBIv9LMS/dKEbxKA/Q/PixDiOzy4BdXVuQ9mdLNG4NNnXI1Cs+zKt379fNARWLUuPXAqsRxLXPVzfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d579e98db94c30d03654583f64eea41fdedccee487234e673637dd7365d36c3","last_reissued_at":"2026-05-18T02:22:31.605031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:31.605031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3227","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-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":"7UpsbGPfab5jeyn8qqQAyffkEaJFYuo7+OngND10hOaWSa4o/cHDQUp59D2j7U0b8NHrjeKxMksvh9nZXdesAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:17:59.274123Z"},"content_sha256":"1996d246325ed7016e16acca3612ea901a8bae1643b7c4889fa919c0caae8385","schema_version":"1.0","event_id":"sha256:1996d246325ed7016e16acca3612ea901a8bae1643b7c4889fa919c0caae8385"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TVLZ5GG3STBQ2A3FIWB7MTXKIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of the Interference Channel with a Cognitive Relay in Very Strong Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Goldsmith, Daniela Tuninetti, Natasha Devroye, Stefano Riniy","submitted_at":"2011-02-16T03:24:38Z","abstract_excerpt":"The interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources' messages and aids in the sources' transmission. We derive a new outer bound for this channel using an argument originally devised for the \"more capable\" broadcast channel, and show the achievability of the proposed outer bound in the \"very strong interference\" regime, a class of channels where there is no loss in optimality if both destinations decode both messages. This result is analogo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3227","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-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":"NwrvrTKFGkwFtt8a7mc/TNzl6uOvYvi5E9/6QDT0nYGScamfv+tugkp1X5ZXFPWrFjxtnZuITF1oUbOfmtLFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:17:59.274837Z"},"content_sha256":"32ddb9b3410e3ad9f92e3f6b133f68c2eaa35c33b9cab8e6d5bd26198d92af32","schema_version":"1.0","event_id":"sha256:32ddb9b3410e3ad9f92e3f6b133f68c2eaa35c33b9cab8e6d5bd26198d92af32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVLZ5GG3STBQ2A3FIWB7MTXKIH/bundle.json","state_url":"https://pith.science/pith/TVLZ5GG3STBQ2A3FIWB7MTXKIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVLZ5GG3STBQ2A3FIWB7MTXKIH/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-28T21:17:59Z","links":{"resolver":"https://pith.science/pith/TVLZ5GG3STBQ2A3FIWB7MTXKIH","bundle":"https://pith.science/pith/TVLZ5GG3STBQ2A3FIWB7MTXKIH/bundle.json","state":"https://pith.science/pith/TVLZ5GG3STBQ2A3FIWB7MTXKIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVLZ5GG3STBQ2A3FIWB7MTXKIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TVLZ5GG3STBQ2A3FIWB7MTXKIH","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":"add1e6b040b1a31777210aed001515f714c4923be5b6c896b0a4c50a1f6f557b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:24:38Z","title_canon_sha256":"54325093a43dc724e25cb7522153698a523c219f1097dbe37b7e7f8e6365ce46"},"schema_version":"1.0","source":{"id":"1102.3227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3227","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3227v1","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3227","created_at":"2026-05-18T02:22:31Z"},{"alias_kind":"pith_short_12","alias_value":"TVLZ5GG3STBQ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TVLZ5GG3STBQ2A3F","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TVLZ5GG3","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:32ddb9b3410e3ad9f92e3f6b133f68c2eaa35c33b9cab8e6d5bd26198d92af32","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 interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources' messages and aids in the sources' transmission. We derive a new outer bound for this channel using an argument originally devised for the \"more capable\" broadcast channel, and show the achievability of the proposed outer bound in the \"very strong interference\" regime, a class of channels where there is no loss in optimality if both destinations decode both messages. This result is analogo","authors_text":"Andrea Goldsmith, Daniela Tuninetti, Natasha Devroye, Stefano Riniy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:24:38Z","title":"The Capacity of the Interference Channel with a Cognitive Relay in Very Strong Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3227","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:1996d246325ed7016e16acca3612ea901a8bae1643b7c4889fa919c0caae8385","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":"add1e6b040b1a31777210aed001515f714c4923be5b6c896b0a4c50a1f6f557b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:24:38Z","title_canon_sha256":"54325093a43dc724e25cb7522153698a523c219f1097dbe37b7e7f8e6365ce46"},"schema_version":"1.0","source":{"id":"1102.3227","kind":"arxiv","version":1}},"canonical_sha256":"9d579e98db94c30d03654583f64eea41fdedccee487234e673637dd7365d36c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d579e98db94c30d03654583f64eea41fdedccee487234e673637dd7365d36c3","first_computed_at":"2026-05-18T02:22:31.605031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:31.605031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"05NEAuSYBIv9LMS/dKEbxKA/Q/PixDiOzy4BdXVuQ9mdLNG4NNnXI1Cs+zKt379fNARWLUuPXAqsRxLXPVzfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:31.605564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1996d246325ed7016e16acca3612ea901a8bae1643b7c4889fa919c0caae8385","sha256:32ddb9b3410e3ad9f92e3f6b133f68c2eaa35c33b9cab8e6d5bd26198d92af32"],"state_sha256":"7c89d11032b7b8f88b5bd335958df14de493e6bc01ff3c67d85c697e9903f024"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oN+lY98d6tC2oB/o7563dEAhN9jpDJpaw3Rk0q0Qkp5IbC2lF222htDUXvMux97tnYw9DwF+QO8m6/GXrceAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:17:59.278797Z","bundle_sha256":"42547350bbfdcf132822bbcfa4801f4e93cf730efb18c6e2e82d71f6e29b7141"}}