{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BYGNTGX4ADZPXSJFZGE36XFHPL","short_pith_number":"pith:BYGNTGX4","canonical_record":{"source":{"id":"1604.07386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-25T19:52:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"590417ac6c3f37f3fc62f8d2c91af9c884066c4ca8acf674c1e73fbf4a386a55","abstract_canon_sha256":"fe58d9d6c902553772b0a11385cb54bbd10b7826e877a10540c29fd4e6431e31"},"schema_version":"1.0"},"canonical_sha256":"0e0cd99afc00f2fbc925c989bf5ca77af09e2675f513116fb0ae7f65ab831550","source":{"kind":"arxiv","id":"1604.07386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07386","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07386v1","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07386","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"pith_short_12","alias_value":"BYGNTGX4ADZP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BYGNTGX4ADZPXSJF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BYGNTGX4","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BYGNTGX4ADZPXSJFZGE36XFHPL","target":"record","payload":{"canonical_record":{"source":{"id":"1604.07386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-25T19:52:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"590417ac6c3f37f3fc62f8d2c91af9c884066c4ca8acf674c1e73fbf4a386a55","abstract_canon_sha256":"fe58d9d6c902553772b0a11385cb54bbd10b7826e877a10540c29fd4e6431e31"},"schema_version":"1.0"},"canonical_sha256":"0e0cd99afc00f2fbc925c989bf5ca77af09e2675f513116fb0ae7f65ab831550","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:22.245871Z","signature_b64":"+F6MqJ4PDnzEWPwxKs0qt5gQn6z3lD0HgZGAOtchKSWklSCv8KLivc4zcHxNvmTLRZfzcvJ43eus1iJ4E09rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e0cd99afc00f2fbc925c989bf5ca77af09e2675f513116fb0ae7f65ab831550","last_reissued_at":"2026-05-18T01:16:22.245282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:22.245282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.07386","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-18T01:16:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jxC+mN8jIoGket1hmMLZRosPT6oc3M+kffkFP/QPO1AWXPaeZJ8s2dlDSB2RS2blTi3lCjDQ4rAK/LZCenbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:40:56.067470Z"},"content_sha256":"3f130af125a411c5253481603558a72d93d892a4d2707fdeb3dce00aa4f0c4d3","schema_version":"1.0","event_id":"sha256:3f130af125a411c5253481603558a72d93d892a4d2707fdeb3dce00aa4f0c4d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BYGNTGX4ADZPXSJFZGE36XFHPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Security in The Gaussian Interference Channel: Weak and Moderately Weak Interference Regimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Panos Papadimitratos, Parisa Babaheidarian, Somayeh Salimi","submitted_at":"2016-04-25T19:52:55Z","abstract_excerpt":"We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver. Prior work investigated the performance of two different approaches for this scenario; i.i.d. Gaussian random codes and real alignment of structured codes. While the latter achieves the optimal sum secure degrees of freedom (s.d.o.f.), its extension to finite SNR regimes is challenging. In this paper, we propose a new achievability scheme for the weak and the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07386","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-18T01:16:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sa4i4WdDy027xWYxyeSIcJPrzyopGZZzJ00l0dx5b5GodQkZFHcyfGKuWVet9bW75VQl7HfsPfybxj+R//y2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T16:40:56.067816Z"},"content_sha256":"0dfc20ef105397f6a8b9555314493d9a9253d18a586ef55b810da99525c667de","schema_version":"1.0","event_id":"sha256:0dfc20ef105397f6a8b9555314493d9a9253d18a586ef55b810da99525c667de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYGNTGX4ADZPXSJFZGE36XFHPL/bundle.json","state_url":"https://pith.science/pith/BYGNTGX4ADZPXSJFZGE36XFHPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYGNTGX4ADZPXSJFZGE36XFHPL/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-20T16:40:56Z","links":{"resolver":"https://pith.science/pith/BYGNTGX4ADZPXSJFZGE36XFHPL","bundle":"https://pith.science/pith/BYGNTGX4ADZPXSJFZGE36XFHPL/bundle.json","state":"https://pith.science/pith/BYGNTGX4ADZPXSJFZGE36XFHPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYGNTGX4ADZPXSJFZGE36XFHPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BYGNTGX4ADZPXSJFZGE36XFHPL","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":"fe58d9d6c902553772b0a11385cb54bbd10b7826e877a10540c29fd4e6431e31","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-25T19:52:55Z","title_canon_sha256":"590417ac6c3f37f3fc62f8d2c91af9c884066c4ca8acf674c1e73fbf4a386a55"},"schema_version":"1.0","source":{"id":"1604.07386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07386","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07386v1","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07386","created_at":"2026-05-18T01:16:22Z"},{"alias_kind":"pith_short_12","alias_value":"BYGNTGX4ADZP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BYGNTGX4ADZPXSJF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BYGNTGX4","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:0dfc20ef105397f6a8b9555314493d9a9253d18a586ef55b810da99525c667de","target":"graph","created_at":"2026-05-18T01:16:22Z","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 consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver. Prior work investigated the performance of two different approaches for this scenario; i.i.d. Gaussian random codes and real alignment of structured codes. While the latter achieves the optimal sum secure degrees of freedom (s.d.o.f.), its extension to finite SNR regimes is challenging. In this paper, we propose a new achievability scheme for the weak and the ","authors_text":"Panos Papadimitratos, Parisa Babaheidarian, Somayeh Salimi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-25T19:52:55Z","title":"Security in The Gaussian Interference Channel: Weak and Moderately Weak Interference Regimes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07386","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:3f130af125a411c5253481603558a72d93d892a4d2707fdeb3dce00aa4f0c4d3","target":"record","created_at":"2026-05-18T01:16:22Z","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":"fe58d9d6c902553772b0a11385cb54bbd10b7826e877a10540c29fd4e6431e31","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-25T19:52:55Z","title_canon_sha256":"590417ac6c3f37f3fc62f8d2c91af9c884066c4ca8acf674c1e73fbf4a386a55"},"schema_version":"1.0","source":{"id":"1604.07386","kind":"arxiv","version":1}},"canonical_sha256":"0e0cd99afc00f2fbc925c989bf5ca77af09e2675f513116fb0ae7f65ab831550","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e0cd99afc00f2fbc925c989bf5ca77af09e2675f513116fb0ae7f65ab831550","first_computed_at":"2026-05-18T01:16:22.245282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:22.245282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+F6MqJ4PDnzEWPwxKs0qt5gQn6z3lD0HgZGAOtchKSWklSCv8KLivc4zcHxNvmTLRZfzcvJ43eus1iJ4E09rBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:22.245871Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f130af125a411c5253481603558a72d93d892a4d2707fdeb3dce00aa4f0c4d3","sha256:0dfc20ef105397f6a8b9555314493d9a9253d18a586ef55b810da99525c667de"],"state_sha256":"acd0e456b34366613f92b289fac750368fa254753bc6cd0f821fcaa1fd1583d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ISI3kKvcI34WLPjwsWB6a0dZ9IbgQ83LqWrLfLy4kXYFp5Yy07wk6AEReqt1iS3G/1HzhgYHRfRq6AXXcusyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T16:40:56.069963Z","bundle_sha256":"e7c7fe8039c0d34a9a76429143f8668a884be622ea3aa05f47e7597e0e2ea60b"}}