{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:A3ILUT6IRYVEJVEC62UVAWNYTI","short_pith_number":"pith:A3ILUT6I","canonical_record":{"source":{"id":"1410.5009","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T21:38:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a08998015851a749f9de40a8ebb2a7d5dc2d6df8da3a823c13d8ad68615a63d","abstract_canon_sha256":"ceaad828712595c3b00f6386adfca819ab1b0f443ea78566e3d437b82b1c682d"},"schema_version":"1.0"},"canonical_sha256":"06d0ba4fc88e2a44d482f6a95059b89a355425eb98bb583432b2ce839fa38b25","source":{"kind":"arxiv","id":"1410.5009","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5009","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5009v3","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5009","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"A3ILUT6IRYVE","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A3ILUT6IRYVEJVEC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A3ILUT6I","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:A3ILUT6IRYVEJVEC62UVAWNYTI","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5009","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T21:38:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a08998015851a749f9de40a8ebb2a7d5dc2d6df8da3a823c13d8ad68615a63d","abstract_canon_sha256":"ceaad828712595c3b00f6386adfca819ab1b0f443ea78566e3d437b82b1c682d"},"schema_version":"1.0"},"canonical_sha256":"06d0ba4fc88e2a44d482f6a95059b89a355425eb98bb583432b2ce839fa38b25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:02.430561Z","signature_b64":"RGNe7JYtM0n3zlFvxqC9SnR7QD+jKoyQqUmGA5SPyuy6kMoLhAlHnD5e+jbgztZAfagBTeTC67V3j4sdO1jRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06d0ba4fc88e2a44d482f6a95059b89a355425eb98bb583432b2ce839fa38b25","last_reissued_at":"2026-05-18T00:59:02.429898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:02.429898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5009","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCEWguQk+D5Xg1NEfp77V87QjZxr3xIGe1aL5p9SVErBbg/pTm6OWLrSVaM6TcqGZKOMOdShR+SAbFs0HLgkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:01:25.859623Z"},"content_sha256":"b2432cef598b6d4e9566b536e0a15e6e709da10b8340e8ebe970c7e4468444ba","schema_version":"1.0","event_id":"sha256:b2432cef598b6d4e9566b536e0a15e6e709da10b8340e8ebe970c7e4468444ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:A3ILUT6IRYVEJVEC62UVAWNYTI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Degrees of Freedom of Wireless X Networks Using Artificial Noise Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Mikael Skoglund, Ming Xiao, Zhao Wang","submitted_at":"2014-10-18T21:38:31Z","abstract_excerpt":"The problem of transmitting confidential messages in $M \\times K$ wireless X networks is considered, in which each transmitter intends to send one confidential message to every receiver. In particular, the secure degrees of freedom (SDOF) of the considered network are studied based on an artificial noise alignment (ANA) approach, which integrates interference alignment and artificial noise transmission. At first, an SDOF upper bound is derived for the $M \\times K$ X network with confidential messages (XNCM) to be $\\frac{K(M-1)}{K+M-2}$. By proposing an ANA approach, it is shown that the SDOF u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5009","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-18T00:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mW5BPCfmjCC7PvR8rm3voTHAE2ud6HQ2caibzouUEOeO35BFmtDaWcUw4VpaiWlInml0eHwPk0Po/utfiILCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:01:25.860065Z"},"content_sha256":"eceb81f5c14886add40463c918eb46c66de480b2758690f787ee8f792b3402d8","schema_version":"1.0","event_id":"sha256:eceb81f5c14886add40463c918eb46c66de480b2758690f787ee8f792b3402d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3ILUT6IRYVEJVEC62UVAWNYTI/bundle.json","state_url":"https://pith.science/pith/A3ILUT6IRYVEJVEC62UVAWNYTI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3ILUT6IRYVEJVEC62UVAWNYTI/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-31T18:01:25Z","links":{"resolver":"https://pith.science/pith/A3ILUT6IRYVEJVEC62UVAWNYTI","bundle":"https://pith.science/pith/A3ILUT6IRYVEJVEC62UVAWNYTI/bundle.json","state":"https://pith.science/pith/A3ILUT6IRYVEJVEC62UVAWNYTI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3ILUT6IRYVEJVEC62UVAWNYTI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A3ILUT6IRYVEJVEC62UVAWNYTI","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":"ceaad828712595c3b00f6386adfca819ab1b0f443ea78566e3d437b82b1c682d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T21:38:31Z","title_canon_sha256":"9a08998015851a749f9de40a8ebb2a7d5dc2d6df8da3a823c13d8ad68615a63d"},"schema_version":"1.0","source":{"id":"1410.5009","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5009","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5009v3","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5009","created_at":"2026-05-18T00:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"A3ILUT6IRYVE","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A3ILUT6IRYVEJVEC","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A3ILUT6I","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:eceb81f5c14886add40463c918eb46c66de480b2758690f787ee8f792b3402d8","target":"graph","created_at":"2026-05-18T00:59:02Z","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":"The problem of transmitting confidential messages in $M \\times K$ wireless X networks is considered, in which each transmitter intends to send one confidential message to every receiver. In particular, the secure degrees of freedom (SDOF) of the considered network are studied based on an artificial noise alignment (ANA) approach, which integrates interference alignment and artificial noise transmission. At first, an SDOF upper bound is derived for the $M \\times K$ X network with confidential messages (XNCM) to be $\\frac{K(M-1)}{K+M-2}$. By proposing an ANA approach, it is shown that the SDOF u","authors_text":"H. Vincent Poor, Mikael Skoglund, Ming Xiao, Zhao Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T21:38:31Z","title":"Secure Degrees of Freedom of Wireless X Networks Using Artificial Noise Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5009","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:b2432cef598b6d4e9566b536e0a15e6e709da10b8340e8ebe970c7e4468444ba","target":"record","created_at":"2026-05-18T00:59:02Z","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":"ceaad828712595c3b00f6386adfca819ab1b0f443ea78566e3d437b82b1c682d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T21:38:31Z","title_canon_sha256":"9a08998015851a749f9de40a8ebb2a7d5dc2d6df8da3a823c13d8ad68615a63d"},"schema_version":"1.0","source":{"id":"1410.5009","kind":"arxiv","version":3}},"canonical_sha256":"06d0ba4fc88e2a44d482f6a95059b89a355425eb98bb583432b2ce839fa38b25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06d0ba4fc88e2a44d482f6a95059b89a355425eb98bb583432b2ce839fa38b25","first_computed_at":"2026-05-18T00:59:02.429898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:02.429898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RGNe7JYtM0n3zlFvxqC9SnR7QD+jKoyQqUmGA5SPyuy6kMoLhAlHnD5e+jbgztZAfagBTeTC67V3j4sdO1jRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:02.430561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5009","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2432cef598b6d4e9566b536e0a15e6e709da10b8340e8ebe970c7e4468444ba","sha256:eceb81f5c14886add40463c918eb46c66de480b2758690f787ee8f792b3402d8"],"state_sha256":"7ae84d8109896846ed926baaa1186f2c0e5e1b8eb81a07202e085d3ff6ae2b88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6r6OQa1PAsP5rz8bnuQwfPpbV6zX4gUn5AC+ik1TtVMvaGNHb5CqTMwbxTDt2KM9Bm/ewzt3+JVdY9Z9VdKyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:01:25.863031Z","bundle_sha256":"c23e9732c1f586f686bc34f1aec3f33bbd78ad3585a3f344ae6143dc87c0541e"}}