{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:65LQSDWRSVFAOM7XCVYLVOFVDS","short_pith_number":"pith:65LQSDWR","canonical_record":{"source":{"id":"1401.5536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-22T01:41:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c67e2250b39dc1e8ff5bc3e404ae140e9b8486805b86aa0b000ef273515de213","abstract_canon_sha256":"b65074662503900afb5908377946143e4a727347283b3ef8b82bedda0a709c64"},"schema_version":"1.0"},"canonical_sha256":"f757090ed1954a0733f71570bab8b51cb92a0b5a63d6590209af1970b2c9501c","source":{"kind":"arxiv","id":"1401.5536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5536","created_at":"2026-05-18T03:01:26Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5536v1","created_at":"2026-05-18T03:01:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5536","created_at":"2026-05-18T03:01:26Z"},{"alias_kind":"pith_short_12","alias_value":"65LQSDWRSVFA","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"65LQSDWRSVFAOM7X","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"65LQSDWR","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:65LQSDWRSVFAOM7XCVYLVOFVDS","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-22T01:41:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c67e2250b39dc1e8ff5bc3e404ae140e9b8486805b86aa0b000ef273515de213","abstract_canon_sha256":"b65074662503900afb5908377946143e4a727347283b3ef8b82bedda0a709c64"},"schema_version":"1.0"},"canonical_sha256":"f757090ed1954a0733f71570bab8b51cb92a0b5a63d6590209af1970b2c9501c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:26.042745Z","signature_b64":"uLCwquKbD9MPcT9vvhIifqnQx+Ww9ctvR9pT6npIqEgmqPA8QDJIMRJt0mNTNGUtPhfYWG4Jsl2i//ya/s14DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f757090ed1954a0733f71570bab8b51cb92a0b5a63d6590209af1970b2c9501c","last_reissued_at":"2026-05-18T03:01:26.042152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:26.042152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5536","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-18T03:01:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hU+9awZXUW8a5J/cLqKK2Ytn0LFpsTonHzKtjj2kkhdf3iP/pjN09HWyPUqI65G6Anvlwf3Kk7g6Oiq9qqsaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:51:24.485584Z"},"content_sha256":"9fe0c9d3f6f07b2efb58507b37399e300648239fd819fad794906f1bde719e91","schema_version":"1.0","event_id":"sha256:9fe0c9d3f6f07b2efb58507b37399e300648239fd819fad794906f1bde719e91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:65LQSDWRSVFAOM7XCVYLVOFVDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Discrete Alphabets for the Two-user Gaussian Interference Channel with One Receiver Lacking Knowledge of the Interfering Codebook","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-01-22T01:41:32Z","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 is however impractical in distributed ad-hoc and cognitive networks. This work considers the two- user Gaussian Interference Channel with one Oblivious Receiver (G-IC-OR), i.e., one receiver lacks knowledge of the interfering cookbook while the other receiver knows both codebooks. We ask whether, and if so how much, the channel capacity of the G-IC- OR is reduced compared to that of the classical G-IC where both receivers know all codebooks. Intuitive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5536","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-18T03:01:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2G1HjzV1/Wpma+eC0EU4USmcd45qzsEIMuCKOspJ97sKwh6LO9wR5t6uF7ieHkrksSpaycfFiIUrA7v42RMjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:51:24.485970Z"},"content_sha256":"d6d885a3c77264ac18b72b0b6c7f266306aa599cb64a02240a0a1f91bb8b2505","schema_version":"1.0","event_id":"sha256:d6d885a3c77264ac18b72b0b6c7f266306aa599cb64a02240a0a1f91bb8b2505"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65LQSDWRSVFAOM7XCVYLVOFVDS/bundle.json","state_url":"https://pith.science/pith/65LQSDWRSVFAOM7XCVYLVOFVDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65LQSDWRSVFAOM7XCVYLVOFVDS/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-29T14:51:24Z","links":{"resolver":"https://pith.science/pith/65LQSDWRSVFAOM7XCVYLVOFVDS","bundle":"https://pith.science/pith/65LQSDWRSVFAOM7XCVYLVOFVDS/bundle.json","state":"https://pith.science/pith/65LQSDWRSVFAOM7XCVYLVOFVDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65LQSDWRSVFAOM7XCVYLVOFVDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:65LQSDWRSVFAOM7XCVYLVOFVDS","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":"b65074662503900afb5908377946143e4a727347283b3ef8b82bedda0a709c64","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-22T01:41:32Z","title_canon_sha256":"c67e2250b39dc1e8ff5bc3e404ae140e9b8486805b86aa0b000ef273515de213"},"schema_version":"1.0","source":{"id":"1401.5536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5536","created_at":"2026-05-18T03:01:26Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5536v1","created_at":"2026-05-18T03:01:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5536","created_at":"2026-05-18T03:01:26Z"},{"alias_kind":"pith_short_12","alias_value":"65LQSDWRSVFA","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"65LQSDWRSVFAOM7X","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"65LQSDWR","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d6d885a3c77264ac18b72b0b6c7f266306aa599cb64a02240a0a1f91bb8b2505","target":"graph","created_at":"2026-05-18T03:01:26Z","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 is however impractical in distributed ad-hoc and cognitive networks. This work considers the two- user Gaussian Interference Channel with one Oblivious Receiver (G-IC-OR), i.e., one receiver lacks knowledge of the interfering cookbook while the other receiver knows both codebooks. We ask whether, and if so how much, the channel capacity of the G-IC- OR is reduced compared to that of the classical G-IC where both receivers know all codebooks. Intuitive","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-01-22T01:41:32Z","title":"On Discrete Alphabets for the Two-user Gaussian Interference Channel with One Receiver Lacking Knowledge of the Interfering Codebook"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5536","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:9fe0c9d3f6f07b2efb58507b37399e300648239fd819fad794906f1bde719e91","target":"record","created_at":"2026-05-18T03:01:26Z","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":"b65074662503900afb5908377946143e4a727347283b3ef8b82bedda0a709c64","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-22T01:41:32Z","title_canon_sha256":"c67e2250b39dc1e8ff5bc3e404ae140e9b8486805b86aa0b000ef273515de213"},"schema_version":"1.0","source":{"id":"1401.5536","kind":"arxiv","version":1}},"canonical_sha256":"f757090ed1954a0733f71570bab8b51cb92a0b5a63d6590209af1970b2c9501c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f757090ed1954a0733f71570bab8b51cb92a0b5a63d6590209af1970b2c9501c","first_computed_at":"2026-05-18T03:01:26.042152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:26.042152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uLCwquKbD9MPcT9vvhIifqnQx+Ww9ctvR9pT6npIqEgmqPA8QDJIMRJt0mNTNGUtPhfYWG4Jsl2i//ya/s14DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:26.042745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fe0c9d3f6f07b2efb58507b37399e300648239fd819fad794906f1bde719e91","sha256:d6d885a3c77264ac18b72b0b6c7f266306aa599cb64a02240a0a1f91bb8b2505"],"state_sha256":"99b106adef801afafe19bdceffa64e61ee06f5de83e5bc1cf1a781a773c52a71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgudi6Da1AfusXWvdaN+zIbuUQBtoA8oE9YTkO1dgl28URfKNd7r4mfNCGqt0RiSC/a5iUqKew+f7Jf4k+kyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:51:24.488255Z","bundle_sha256":"d3784aca4a4b07ea70f7ac1c1a29e9ca073afae4440994f097af49a86ed6cd30"}}