{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:T64PEHDDHOIRZ4BHKF5ESOK5UL","short_pith_number":"pith:T64PEHDD","canonical_record":{"source":{"id":"1211.5735","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T07:30:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1901441458c8d3cf8462af775a9d2247ffa81597706653b5f5a40da042c6452","abstract_canon_sha256":"f8cc31824b2a94003bee80c78f1d5b62f776c8364872abc06b148633b437749e"},"schema_version":"1.0"},"canonical_sha256":"9fb8f21c633b911cf027517a49395da2c713153bb6d9c9d3eeefbb712fea8e4b","source":{"kind":"arxiv","id":"1211.5735","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5735","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5735v3","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5735","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"pith_short_12","alias_value":"T64PEHDDHOIR","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T64PEHDDHOIRZ4BH","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T64PEHDD","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:T64PEHDDHOIRZ4BHKF5ESOK5UL","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5735","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T07:30:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1901441458c8d3cf8462af775a9d2247ffa81597706653b5f5a40da042c6452","abstract_canon_sha256":"f8cc31824b2a94003bee80c78f1d5b62f776c8364872abc06b148633b437749e"},"schema_version":"1.0"},"canonical_sha256":"9fb8f21c633b911cf027517a49395da2c713153bb6d9c9d3eeefbb712fea8e4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:25.195611Z","signature_b64":"jcRG8K1I3VWDMJFJvFAIQ1sV1nKDtlzRZ+9Wpcze4X2tJv6n1KCxmuRgVBkPUjHbMrp9bO5LNo9HwSWsyyhBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb8f21c633b911cf027517a49395da2c713153bb6d9c9d3eeefbb712fea8e4b","last_reissued_at":"2026-05-18T03:35:25.194752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:25.194752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5735","source_version":3,"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:35:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8G7QAWkF1ES0yd3RoR3+cLzsLaqezkgwpfxLLBBtb9QIVBav0AFwL0BmzLB09+O4Gr2cdH+Cxk28XobwPJVJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:31:43.261683Z"},"content_sha256":"2ede2ca890523b1d8cba6d327f582481f361ad911b82373cdaea0d9b1719247f","schema_version":"1.0","event_id":"sha256:2ede2ca890523b1d8cba6d327f582481f361ad911b82373cdaea0d9b1719247f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:T64PEHDDHOIRZ4BHKF5ESOK5UL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Degrees of Freedom for Network-Coded Cognitive Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Song-Nam Hong","submitted_at":"2012-11-25T07:30:16Z","abstract_excerpt":"We study a two-user cognitive interference channel (CIC) where one of the transmitters (primary) has knowledge of a linear combination (over an appropriate finite field) of the two information messages. We refer to this channel model as Network-Coded CIC, since the linear combination may be the result of some linear network coding scheme implemented in the backbone wired network.In this paper, we characterize the generalized degrees of freedom (GDoF) for the Gaussian Network-Coded CIC. For achievability, we use the novel Precoded Compute-and-Forward (PCoF) and Dirty Paper Coding (DPC), based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5735","kind":"arxiv","version":3},"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:35:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWa0J2WJOCSdrWFcsHeBALEQM916V1gGSCFTMaEZ0cDPmqhHxusiz46xZjX4nXZ2s3tFf9nvqOtc3lk3PFQPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:31:43.262290Z"},"content_sha256":"05f9f3e26376a5c7652cb49501cf93326661ab478f05a69f8a0a81d75ebbac3e","schema_version":"1.0","event_id":"sha256:05f9f3e26376a5c7652cb49501cf93326661ab478f05a69f8a0a81d75ebbac3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T64PEHDDHOIRZ4BHKF5ESOK5UL/bundle.json","state_url":"https://pith.science/pith/T64PEHDDHOIRZ4BHKF5ESOK5UL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T64PEHDDHOIRZ4BHKF5ESOK5UL/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-22T05:31:43Z","links":{"resolver":"https://pith.science/pith/T64PEHDDHOIRZ4BHKF5ESOK5UL","bundle":"https://pith.science/pith/T64PEHDDHOIRZ4BHKF5ESOK5UL/bundle.json","state":"https://pith.science/pith/T64PEHDDHOIRZ4BHKF5ESOK5UL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T64PEHDDHOIRZ4BHKF5ESOK5UL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:T64PEHDDHOIRZ4BHKF5ESOK5UL","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":"f8cc31824b2a94003bee80c78f1d5b62f776c8364872abc06b148633b437749e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T07:30:16Z","title_canon_sha256":"a1901441458c8d3cf8462af775a9d2247ffa81597706653b5f5a40da042c6452"},"schema_version":"1.0","source":{"id":"1211.5735","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5735","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5735v3","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5735","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"pith_short_12","alias_value":"T64PEHDDHOIR","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T64PEHDDHOIRZ4BH","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T64PEHDD","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:05f9f3e26376a5c7652cb49501cf93326661ab478f05a69f8a0a81d75ebbac3e","target":"graph","created_at":"2026-05-18T03:35:25Z","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":"We study a two-user cognitive interference channel (CIC) where one of the transmitters (primary) has knowledge of a linear combination (over an appropriate finite field) of the two information messages. We refer to this channel model as Network-Coded CIC, since the linear combination may be the result of some linear network coding scheme implemented in the backbone wired network.In this paper, we characterize the generalized degrees of freedom (GDoF) for the Gaussian Network-Coded CIC. For achievability, we use the novel Precoded Compute-and-Forward (PCoF) and Dirty Paper Coding (DPC), based o","authors_text":"Giuseppe Caire, Song-Nam Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T07:30:16Z","title":"Generalized Degrees of Freedom for Network-Coded Cognitive Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5735","kind":"arxiv","version":3},"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:2ede2ca890523b1d8cba6d327f582481f361ad911b82373cdaea0d9b1719247f","target":"record","created_at":"2026-05-18T03:35:25Z","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":"f8cc31824b2a94003bee80c78f1d5b62f776c8364872abc06b148633b437749e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-25T07:30:16Z","title_canon_sha256":"a1901441458c8d3cf8462af775a9d2247ffa81597706653b5f5a40da042c6452"},"schema_version":"1.0","source":{"id":"1211.5735","kind":"arxiv","version":3}},"canonical_sha256":"9fb8f21c633b911cf027517a49395da2c713153bb6d9c9d3eeefbb712fea8e4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fb8f21c633b911cf027517a49395da2c713153bb6d9c9d3eeefbb712fea8e4b","first_computed_at":"2026-05-18T03:35:25.194752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:25.194752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jcRG8K1I3VWDMJFJvFAIQ1sV1nKDtlzRZ+9Wpcze4X2tJv6n1KCxmuRgVBkPUjHbMrp9bO5LNo9HwSWsyyhBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:25.195611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5735","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ede2ca890523b1d8cba6d327f582481f361ad911b82373cdaea0d9b1719247f","sha256:05f9f3e26376a5c7652cb49501cf93326661ab478f05a69f8a0a81d75ebbac3e"],"state_sha256":"499849d0ad048886e294da1f0bec1f693b0ff0c5f4ae7530fa6c8148057615db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6W5bt3IJXHdm3RZo/HktGKkWjP2XC9P7IbAPywNPc6hDB2De/AP/culn9FVn7mh5XkNBOB4DqdZd/bmm4WLiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T05:31:43.265612Z","bundle_sha256":"75bb56363051fdf5655fe6fabeb5d9d394debc38d60ffec2116630ea2c4374c8"}}