{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SMCXPAJUQ7WPL2FWPBM6SCSMHR","short_pith_number":"pith:SMCXPAJU","canonical_record":{"source":{"id":"1405.1117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T00:54:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5315f78dfe66075dde350cf48c688a104d1acf828083deb4a290be6aefcbcc56","abstract_canon_sha256":"15f4b180d4490a3b152b0ce53b2dfb3e05d52a01909072987fd7b54f200cea3c"},"schema_version":"1.0"},"canonical_sha256":"930577813487ecf5e8b67859e90a4c3c4bbc798169342297123c52d8482c5f76","source":{"kind":"arxiv","id":"1405.1117","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1117","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1117v2","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1117","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"SMCXPAJUQ7WP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SMCXPAJUQ7WPL2FW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SMCXPAJU","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SMCXPAJUQ7WPL2FWPBM6SCSMHR","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1117","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T00:54:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5315f78dfe66075dde350cf48c688a104d1acf828083deb4a290be6aefcbcc56","abstract_canon_sha256":"15f4b180d4490a3b152b0ce53b2dfb3e05d52a01909072987fd7b54f200cea3c"},"schema_version":"1.0"},"canonical_sha256":"930577813487ecf5e8b67859e90a4c3c4bbc798169342297123c52d8482c5f76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:16.897337Z","signature_b64":"5vqFlbu94/7j6Ooj0zSk4G+p/FvVV/b7FZdvo0khxwVvI9VsHYU15Im75qhN+uTjLMDZXEyNp18vRwuc0HzECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"930577813487ecf5e8b67859e90a4c3c4bbc798169342297123c52d8482c5f76","last_reissued_at":"2026-05-18T02:41:16.896823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:16.896823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1117","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-18T02:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4XcfBsfJ3Zz/KTgWrRmAxMmDYePQf3ZjC4+2lMgzgXdEHB+d3BIg+Vtz3DfnUXYVlrMxZxcW94rrdUsxer1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:39:42.871610Z"},"content_sha256":"f0e6bc55fbcd50a68c13c1d0bf5eed859afc05027d70a7470447e8f909518d87","schema_version":"1.0","event_id":"sha256:f0e6bc55fbcd50a68c13c1d0bf5eed859afc05027d70a7470447e8f909518d87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SMCXPAJUQ7WPL2FWPBM6SCSMHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Two-user Interference Channel with Lack of Knowledge of the Interference Codebook at one Receiver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Dytso, Daniela Tuninetti, Natasha Devroye","submitted_at":"2014-05-06T00:54:56Z","abstract_excerpt":"In multi-user information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad-hoc, cognitive or heterogeneous networks. This work considers the two-user Interference Channel with one Oblivious Receiver (IC-OR), i.e., one receiver lacks knowledge of the interfering cookbook while the other receiver knows both codebooks. The paper asks whether, and if so how much, the channel capacity of the IC-OR is reduced compared to that of the classical IC where both receivers know all codebooks. A novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1117","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-18T02:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4Y63h7T94VZueF9NhBTPGQkvGps3KDs43W1dlpNI+ir3+Kcsu5ubn9zdtjAPF6arnAEEEbGhMo+60/4XI0cDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:39:42.872230Z"},"content_sha256":"b26262976c0d216c85ebf3f461af50b498c3106ecf5d098942b78ab2ca074f95","schema_version":"1.0","event_id":"sha256:b26262976c0d216c85ebf3f461af50b498c3106ecf5d098942b78ab2ca074f95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMCXPAJUQ7WPL2FWPBM6SCSMHR/bundle.json","state_url":"https://pith.science/pith/SMCXPAJUQ7WPL2FWPBM6SCSMHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMCXPAJUQ7WPL2FWPBM6SCSMHR/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-28T23:39:42Z","links":{"resolver":"https://pith.science/pith/SMCXPAJUQ7WPL2FWPBM6SCSMHR","bundle":"https://pith.science/pith/SMCXPAJUQ7WPL2FWPBM6SCSMHR/bundle.json","state":"https://pith.science/pith/SMCXPAJUQ7WPL2FWPBM6SCSMHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMCXPAJUQ7WPL2FWPBM6SCSMHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SMCXPAJUQ7WPL2FWPBM6SCSMHR","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":"15f4b180d4490a3b152b0ce53b2dfb3e05d52a01909072987fd7b54f200cea3c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T00:54:56Z","title_canon_sha256":"5315f78dfe66075dde350cf48c688a104d1acf828083deb4a290be6aefcbcc56"},"schema_version":"1.0","source":{"id":"1405.1117","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1117","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1117v2","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1117","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"SMCXPAJUQ7WP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SMCXPAJUQ7WPL2FW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SMCXPAJU","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:b26262976c0d216c85ebf3f461af50b498c3106ecf5d098942b78ab2ca074f95","target":"graph","created_at":"2026-05-18T02:41:16Z","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":"In multi-user information theory it is often assumed that every node in the network possesses all codebooks used in the network. This assumption may be impractical in distributed ad-hoc, cognitive or heterogeneous networks. This work considers the two-user Interference Channel with one Oblivious Receiver (IC-OR), i.e., one receiver lacks knowledge of the interfering cookbook while the other receiver knows both codebooks. The paper asks whether, and if so how much, the channel capacity of the IC-OR is reduced compared to that of the classical IC where both receivers know all codebooks. A novel ","authors_text":"Alex Dytso, Daniela Tuninetti, Natasha Devroye","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T00:54:56Z","title":"On the Two-user Interference Channel with Lack of Knowledge of the Interference Codebook at one Receiver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1117","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:f0e6bc55fbcd50a68c13c1d0bf5eed859afc05027d70a7470447e8f909518d87","target":"record","created_at":"2026-05-18T02:41:16Z","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":"15f4b180d4490a3b152b0ce53b2dfb3e05d52a01909072987fd7b54f200cea3c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-06T00:54:56Z","title_canon_sha256":"5315f78dfe66075dde350cf48c688a104d1acf828083deb4a290be6aefcbcc56"},"schema_version":"1.0","source":{"id":"1405.1117","kind":"arxiv","version":2}},"canonical_sha256":"930577813487ecf5e8b67859e90a4c3c4bbc798169342297123c52d8482c5f76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"930577813487ecf5e8b67859e90a4c3c4bbc798169342297123c52d8482c5f76","first_computed_at":"2026-05-18T02:41:16.896823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:16.896823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vqFlbu94/7j6Ooj0zSk4G+p/FvVV/b7FZdvo0khxwVvI9VsHYU15Im75qhN+uTjLMDZXEyNp18vRwuc0HzECA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:16.897337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1117","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0e6bc55fbcd50a68c13c1d0bf5eed859afc05027d70a7470447e8f909518d87","sha256:b26262976c0d216c85ebf3f461af50b498c3106ecf5d098942b78ab2ca074f95"],"state_sha256":"56a2af5c0151367d1eb986b9c5bed1518f06fecf14290a25f643691ba85beb7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4efLQOwXl4qs18RdTkNNQATYazQlPi4ch7y61xHsS1uj5nleW+/DhT3GayltUWM929jXGClXn5k9LKQYcOj7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:39:42.875506Z","bundle_sha256":"408c5952986d04dccc6b457366bb53261964c22cc82c4def0f1d757194160910"}}