{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:HIA6DLYBK6LQS6ZOOUVNRKDKZF","short_pith_number":"pith:HIA6DLYB","canonical_record":{"source":{"id":"0805.1340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-09T13:10:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2880377523dccc088ec547139cd532533ddd059d2644b2454ea42a3ed60cc90d","abstract_canon_sha256":"8bc140d227a1d3ad889f937ea3c882e0a9747bb33620f8c53a400d38e50be31d"},"schema_version":"1.0"},"canonical_sha256":"3a01e1af015797097b2e752ad8a86ac960f80e2a26bff67eae202ff6cdaafcff","source":{"kind":"arxiv","id":"0805.1340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.1340","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0805.1340v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1340","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"HIA6DLYBK6LQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"HIA6DLYBK6LQS6ZO","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"HIA6DLYB","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:HIA6DLYBK6LQS6ZOOUVNRKDKZF","target":"record","payload":{"canonical_record":{"source":{"id":"0805.1340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-09T13:10:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2880377523dccc088ec547139cd532533ddd059d2644b2454ea42a3ed60cc90d","abstract_canon_sha256":"8bc140d227a1d3ad889f937ea3c882e0a9747bb33620f8c53a400d38e50be31d"},"schema_version":"1.0"},"canonical_sha256":"3a01e1af015797097b2e752ad8a86ac960f80e2a26bff67eae202ff6cdaafcff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.784200Z","signature_b64":"U0kui9gDjfWU8k8QQ7+Idiu+JC7CZFehd2C2SsIRrOejZ8Y72upsUn3sNLRg+JIUmP+D7L6eBtjjYGulOiE5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a01e1af015797097b2e752ad8a86ac960f80e2a26bff67eae202ff6cdaafcff","last_reissued_at":"2026-05-18T00:59:11.783626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.783626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0805.1340","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-18T00:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4pYZHXkAT/VOHdXedS4KNDCtb09pJcWGQ89sOT+Uainu2l5j/Ea1XmYNzM9kIj7AHTAtqVpf7MGTR9ldrm6iBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:15:23.568163Z"},"content_sha256":"957bbeddd0833c451004c401dfbe9ec687891e8dbb935f082f338e34070b9260","schema_version":"1.0","event_id":"sha256:957bbeddd0833c451004c401dfbe9ec687891e8dbb935f082f338e34070b9260"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:HIA6DLYBK6LQS6ZOOUVNRKDKZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Secure Degrees of Freedom in the K-User Gaussian Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hesham El Gamal, H. Vincent Poor, Lifeng Lai, Onur Ozan Koyluoglu","submitted_at":"2008-05-09T13:10:33Z","abstract_excerpt":"This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using interference alignment along with secrecy pre-coding at each transmitter, it is shown that each user in the network can achieve non-zero secure Degrees of Freedoms (DoFs) in both scenarios. In particular, the proposed coding scheme achieves (K-2)/(2K-2) secure DoFs for each user in the interference channel with confidential messages model, and (K-2)/2K secure D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1340","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-18T00:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IR1z4WD6C/6MG7r8Y7TYgcryzDKte1/2bAjx3ujS7NAK/SoCUDsEPvaMwxNZJtngQ33tiQg986EfB86tGlNyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:15:23.568528Z"},"content_sha256":"1a1b6d9bfc7a98d6e337d06cdc371c7f0893d5dd7045d8a21bba27ea0ecce134","schema_version":"1.0","event_id":"sha256:1a1b6d9bfc7a98d6e337d06cdc371c7f0893d5dd7045d8a21bba27ea0ecce134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIA6DLYBK6LQS6ZOOUVNRKDKZF/bundle.json","state_url":"https://pith.science/pith/HIA6DLYBK6LQS6ZOOUVNRKDKZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIA6DLYBK6LQS6ZOOUVNRKDKZF/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-06-04T10:15:23Z","links":{"resolver":"https://pith.science/pith/HIA6DLYBK6LQS6ZOOUVNRKDKZF","bundle":"https://pith.science/pith/HIA6DLYBK6LQS6ZOOUVNRKDKZF/bundle.json","state":"https://pith.science/pith/HIA6DLYBK6LQS6ZOOUVNRKDKZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIA6DLYBK6LQS6ZOOUVNRKDKZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:HIA6DLYBK6LQS6ZOOUVNRKDKZF","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":"8bc140d227a1d3ad889f937ea3c882e0a9747bb33620f8c53a400d38e50be31d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-09T13:10:33Z","title_canon_sha256":"2880377523dccc088ec547139cd532533ddd059d2644b2454ea42a3ed60cc90d"},"schema_version":"1.0","source":{"id":"0805.1340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.1340","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0805.1340v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1340","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"HIA6DLYBK6LQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"HIA6DLYBK6LQS6ZO","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"HIA6DLYB","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:1a1b6d9bfc7a98d6e337d06cdc371c7f0893d5dd7045d8a21bba27ea0ecce134","target":"graph","created_at":"2026-05-18T00:59:11Z","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":"This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using interference alignment along with secrecy pre-coding at each transmitter, it is shown that each user in the network can achieve non-zero secure Degrees of Freedoms (DoFs) in both scenarios. In particular, the proposed coding scheme achieves (K-2)/(2K-2) secure DoFs for each user in the interference channel with confidential messages model, and (K-2)/2K secure D","authors_text":"Hesham El Gamal, H. Vincent Poor, Lifeng Lai, Onur Ozan Koyluoglu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-09T13:10:33Z","title":"On the Secure Degrees of Freedom in the K-User Gaussian Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1340","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:957bbeddd0833c451004c401dfbe9ec687891e8dbb935f082f338e34070b9260","target":"record","created_at":"2026-05-18T00:59:11Z","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":"8bc140d227a1d3ad889f937ea3c882e0a9747bb33620f8c53a400d38e50be31d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-05-09T13:10:33Z","title_canon_sha256":"2880377523dccc088ec547139cd532533ddd059d2644b2454ea42a3ed60cc90d"},"schema_version":"1.0","source":{"id":"0805.1340","kind":"arxiv","version":1}},"canonical_sha256":"3a01e1af015797097b2e752ad8a86ac960f80e2a26bff67eae202ff6cdaafcff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a01e1af015797097b2e752ad8a86ac960f80e2a26bff67eae202ff6cdaafcff","first_computed_at":"2026-05-18T00:59:11.783626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.783626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U0kui9gDjfWU8k8QQ7+Idiu+JC7CZFehd2C2SsIRrOejZ8Y72upsUn3sNLRg+JIUmP+D7L6eBtjjYGulOiE5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.784200Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.1340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:957bbeddd0833c451004c401dfbe9ec687891e8dbb935f082f338e34070b9260","sha256:1a1b6d9bfc7a98d6e337d06cdc371c7f0893d5dd7045d8a21bba27ea0ecce134"],"state_sha256":"28970e3610141ddf4570f36d360da374abd062ec2164f20b11bfcefa8a042395"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQ5wnXcT7RmkxEwVecxruZEMOnrMcBxp9QgPcemiy5bUoKhkrQW4SHD7QTfU8qkX+92Dcwe0oOY2pSdWtiHOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:15:23.570513Z","bundle_sha256":"a44472936824e59cd9591463da9f9ea30d34f8e33446ad1ac9047f14d6997668"}}