{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AWOC3AJ6GETECM5Q2FILIXFBGX","short_pith_number":"pith:AWOC3AJ6","canonical_record":{"source":{"id":"1102.3225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:10:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"388529c36ab59bc1a476999116512269c74deaa318cb86e88f4485c0e8a15fd2","abstract_canon_sha256":"58daab07b2634c2c19fd6a0a8d0d83209f8162716824db702c958833f7658ee2"},"schema_version":"1.0"},"canonical_sha256":"059c2d813e31264133b0d150b45ca135f690d3251a06535701498a984de13466","source":{"kind":"arxiv","id":"1102.3225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3225","created_at":"2026-05-18T04:28:36Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3225v1","created_at":"2026-05-18T04:28:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3225","created_at":"2026-05-18T04:28:36Z"},{"alias_kind":"pith_short_12","alias_value":"AWOC3AJ6GETE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AWOC3AJ6GETECM5Q","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AWOC3AJ6","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AWOC3AJ6GETECM5Q2FILIXFBGX","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:10:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"388529c36ab59bc1a476999116512269c74deaa318cb86e88f4485c0e8a15fd2","abstract_canon_sha256":"58daab07b2634c2c19fd6a0a8d0d83209f8162716824db702c958833f7658ee2"},"schema_version":"1.0"},"canonical_sha256":"059c2d813e31264133b0d150b45ca135f690d3251a06535701498a984de13466","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:36.804695Z","signature_b64":"djYVRCU7AWD5ARQKttyP9TSgOPHCqAocxHoXXoYksX70hYp7Ue6/QNFoezuGoLmiUh+iK/bCeUCjkKdmHsCKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"059c2d813e31264133b0d150b45ca135f690d3251a06535701498a984de13466","last_reissued_at":"2026-05-18T04:28:36.804286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:36.804286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3225","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-18T04:28:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aq9EX8OCFj+Nah9RpEiO+9rcew/ddWUfEIHSMTlyS8xtAArsdVtmhg05VdDejHntlf2v0pXVxGQKVA9USFz3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:17:57.072439Z"},"content_sha256":"22f5fa4d40c34284f83e13810d8ee0385004a91a44a7ef40c39b85d11c025835","schema_version":"1.0","event_id":"sha256:22f5fa4d40c34284f83e13810d8ee0385004a91a44a7ef40c39b85d11c025835"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AWOC3AJ6GETECM5Q2FILIXFBGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity to within 3 bits for a class of Gaussian Interference Channels with a Cognitive Relay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Natasha Devroye, Stefano Rini","submitted_at":"2011-02-16T03:10:27Z","abstract_excerpt":"The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of a classical two-user interference channel in which the two independent messages are also non-causally known at a cognitive relay node. In this work a special class of IFC-CRs in which the sources do not create interference at the non-intended destinations is analyzed. This special model results in a channel with two non-interfering point-to-point channels whose transmission is aided by an in-band cognitive relay, which is thus referred to as the Parallel Channel with a Cognitive Relay (PC-CR). We determine the capacity of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3225","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-18T04:28:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5ZTESlrnwvAEqPe6CUp2eOJxCLAPn3xPdostvy5f4UzLvVG5ETP4fwoNPGPiYL2RVo+ldlcNDocKeeXiYDIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:17:57.073124Z"},"content_sha256":"32fc8e0ca497606fe86ff396e1512481502c4ba68469f41a2b97737c75455bf3","schema_version":"1.0","event_id":"sha256:32fc8e0ca497606fe86ff396e1512481502c4ba68469f41a2b97737c75455bf3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWOC3AJ6GETECM5Q2FILIXFBGX/bundle.json","state_url":"https://pith.science/pith/AWOC3AJ6GETECM5Q2FILIXFBGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWOC3AJ6GETECM5Q2FILIXFBGX/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-28T18:17:57Z","links":{"resolver":"https://pith.science/pith/AWOC3AJ6GETECM5Q2FILIXFBGX","bundle":"https://pith.science/pith/AWOC3AJ6GETECM5Q2FILIXFBGX/bundle.json","state":"https://pith.science/pith/AWOC3AJ6GETECM5Q2FILIXFBGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWOC3AJ6GETECM5Q2FILIXFBGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AWOC3AJ6GETECM5Q2FILIXFBGX","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":"58daab07b2634c2c19fd6a0a8d0d83209f8162716824db702c958833f7658ee2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:10:27Z","title_canon_sha256":"388529c36ab59bc1a476999116512269c74deaa318cb86e88f4485c0e8a15fd2"},"schema_version":"1.0","source":{"id":"1102.3225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3225","created_at":"2026-05-18T04:28:36Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3225v1","created_at":"2026-05-18T04:28:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3225","created_at":"2026-05-18T04:28:36Z"},{"alias_kind":"pith_short_12","alias_value":"AWOC3AJ6GETE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AWOC3AJ6GETECM5Q","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AWOC3AJ6","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:32fc8e0ca497606fe86ff396e1512481502c4ba68469f41a2b97737c75455bf3","target":"graph","created_at":"2026-05-18T04:28:36Z","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 (IFC-CR) consists of a classical two-user interference channel in which the two independent messages are also non-causally known at a cognitive relay node. In this work a special class of IFC-CRs in which the sources do not create interference at the non-intended destinations is analyzed. This special model results in a channel with two non-interfering point-to-point channels whose transmission is aided by an in-band cognitive relay, which is thus referred to as the Parallel Channel with a Cognitive Relay (PC-CR). We determine the capacity of the","authors_text":"Daniela Tuninetti, Natasha Devroye, Stefano Rini","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:10:27Z","title":"Capacity to within 3 bits for a class of Gaussian Interference Channels with a Cognitive Relay"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3225","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:22f5fa4d40c34284f83e13810d8ee0385004a91a44a7ef40c39b85d11c025835","target":"record","created_at":"2026-05-18T04:28:36Z","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":"58daab07b2634c2c19fd6a0a8d0d83209f8162716824db702c958833f7658ee2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-16T03:10:27Z","title_canon_sha256":"388529c36ab59bc1a476999116512269c74deaa318cb86e88f4485c0e8a15fd2"},"schema_version":"1.0","source":{"id":"1102.3225","kind":"arxiv","version":1}},"canonical_sha256":"059c2d813e31264133b0d150b45ca135f690d3251a06535701498a984de13466","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"059c2d813e31264133b0d150b45ca135f690d3251a06535701498a984de13466","first_computed_at":"2026-05-18T04:28:36.804286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:36.804286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"djYVRCU7AWD5ARQKttyP9TSgOPHCqAocxHoXXoYksX70hYp7Ue6/QNFoezuGoLmiUh+iK/bCeUCjkKdmHsCKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:36.804695Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22f5fa4d40c34284f83e13810d8ee0385004a91a44a7ef40c39b85d11c025835","sha256:32fc8e0ca497606fe86ff396e1512481502c4ba68469f41a2b97737c75455bf3"],"state_sha256":"e38ae7d71727fbe07236578d66ee5238d724e91b61649f377d3280d446410259"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dm28ihdod6PJLFKP2Tb0jP20oIrWt9e1ESooQzO1VJRfOC/fUiS2kyXXFZTAVPDS9jpP07ehlcfgoLBDvTsgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:17:57.076990Z","bundle_sha256":"b4107a923fb9b8bbf6f36a91c1dda29989b836487d8be14c1337475342b564a6"}}