{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EQFNJQBFWJXKNDW23BVCFXCBEQ","short_pith_number":"pith:EQFNJQBF","canonical_record":{"source":{"id":"1508.01169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:02:58Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"a391199340e6f920e261d250eee59c142d57c418746b2d6d7e6576ed7647fcbd","abstract_canon_sha256":"211b1415eab76eb228f0afcf2985341cfde8f819064dba354412441ab09e9f88"},"schema_version":"1.0"},"canonical_sha256":"240ad4c025b26ea68edad86a22dc412423fed725ed1ab50d2639e3fddbdfaa49","source":{"kind":"arxiv","id":"1508.01169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01169","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01169v1","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01169","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"EQFNJQBFWJXK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EQFNJQBFWJXKNDW2","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EQFNJQBF","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EQFNJQBFWJXKNDW23BVCFXCBEQ","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:02:58Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"a391199340e6f920e261d250eee59c142d57c418746b2d6d7e6576ed7647fcbd","abstract_canon_sha256":"211b1415eab76eb228f0afcf2985341cfde8f819064dba354412441ab09e9f88"},"schema_version":"1.0"},"canonical_sha256":"240ad4c025b26ea68edad86a22dc412423fed725ed1ab50d2639e3fddbdfaa49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:43.926564Z","signature_b64":"j3mhjTcgObhQY5Fzr467Uw8dkosoYxvZ1AYvvwhH8RFK/XGbxbPVUfjfmK9CrH20gPKxDhcgzKHuxTDZe2cQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"240ad4c025b26ea68edad86a22dc412423fed725ed1ab50d2639e3fddbdfaa49","last_reissued_at":"2026-05-18T01:35:43.926053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:43.926053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01169","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:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSWvNd531d1XuIHwRwp5JWkhX9Ll0aGkRbSlo4cXyoZjD7NzUwoHLtAyUnVLIIlKvLJ4v/7F7A9geviQcQ67Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:34:20.723911Z"},"content_sha256":"5b5448ec48863b38dd39526d589e4d68cf31fb8216d836ac6b7484cba48710dc","schema_version":"1.0","event_id":"sha256:5b5448ec48863b38dd39526d589e4d68cf31fb8216d836ac6b7484cba48710dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EQFNJQBFWJXKNDW23BVCFXCBEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interference Alignment Designs for Secure Multiuser MIMO Systems: Rank Constrained Rank Minimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ha Hoang Kha, Trung Q. Duong, Tung T. Vu","submitted_at":"2015-08-04T02:02:58Z","abstract_excerpt":"In this paper, we formulate the interference alignment (IA) problem for a multiuser multiple-input multiple-output (MIMO) system in the presence of an eavesdropper as a rank constrained rank minimization (RCRM) problem. The aim of the proposed rank minimization IA schemes is to find the precoding and receiver subspace matrices to align interference and wiretapped signals into the lowest dimension subspaces while keeping the desired signal subspace spanning full available spatial dimensions. To deal with the nonconvexity of the rank function, we present two convex relaxations of the RCRM proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01169","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:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5MdFKaW3bq4/JWsnD6V81BZY+4Ea+DBh1SP61012DdFfeaPhNcrA2/gUFQoIQVrx8PSoF3fSQN+pynSFF8ZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:34:20.724468Z"},"content_sha256":"06d223d08628361c9fee512bac5cbd0abd802daba686ce2b310f68368270c12e","schema_version":"1.0","event_id":"sha256:06d223d08628361c9fee512bac5cbd0abd802daba686ce2b310f68368270c12e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQFNJQBFWJXKNDW23BVCFXCBEQ/bundle.json","state_url":"https://pith.science/pith/EQFNJQBFWJXKNDW23BVCFXCBEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQFNJQBFWJXKNDW23BVCFXCBEQ/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-27T05:34:20Z","links":{"resolver":"https://pith.science/pith/EQFNJQBFWJXKNDW23BVCFXCBEQ","bundle":"https://pith.science/pith/EQFNJQBFWJXKNDW23BVCFXCBEQ/bundle.json","state":"https://pith.science/pith/EQFNJQBFWJXKNDW23BVCFXCBEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQFNJQBFWJXKNDW23BVCFXCBEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EQFNJQBFWJXKNDW23BVCFXCBEQ","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":"211b1415eab76eb228f0afcf2985341cfde8f819064dba354412441ab09e9f88","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:02:58Z","title_canon_sha256":"a391199340e6f920e261d250eee59c142d57c418746b2d6d7e6576ed7647fcbd"},"schema_version":"1.0","source":{"id":"1508.01169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01169","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01169v1","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01169","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"EQFNJQBFWJXK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EQFNJQBFWJXKNDW2","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EQFNJQBF","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:06d223d08628361c9fee512bac5cbd0abd802daba686ce2b310f68368270c12e","target":"graph","created_at":"2026-05-18T01:35:43Z","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 this paper, we formulate the interference alignment (IA) problem for a multiuser multiple-input multiple-output (MIMO) system in the presence of an eavesdropper as a rank constrained rank minimization (RCRM) problem. The aim of the proposed rank minimization IA schemes is to find the precoding and receiver subspace matrices to align interference and wiretapped signals into the lowest dimension subspaces while keeping the desired signal subspace spanning full available spatial dimensions. To deal with the nonconvexity of the rank function, we present two convex relaxations of the RCRM proble","authors_text":"Ha Hoang Kha, Trung Q. Duong, Tung T. Vu","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:02:58Z","title":"Interference Alignment Designs for Secure Multiuser MIMO Systems: Rank Constrained Rank Minimization Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01169","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:5b5448ec48863b38dd39526d589e4d68cf31fb8216d836ac6b7484cba48710dc","target":"record","created_at":"2026-05-18T01:35:43Z","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":"211b1415eab76eb228f0afcf2985341cfde8f819064dba354412441ab09e9f88","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:02:58Z","title_canon_sha256":"a391199340e6f920e261d250eee59c142d57c418746b2d6d7e6576ed7647fcbd"},"schema_version":"1.0","source":{"id":"1508.01169","kind":"arxiv","version":1}},"canonical_sha256":"240ad4c025b26ea68edad86a22dc412423fed725ed1ab50d2639e3fddbdfaa49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"240ad4c025b26ea68edad86a22dc412423fed725ed1ab50d2639e3fddbdfaa49","first_computed_at":"2026-05-18T01:35:43.926053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:43.926053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3mhjTcgObhQY5Fzr467Uw8dkosoYxvZ1AYvvwhH8RFK/XGbxbPVUfjfmK9CrH20gPKxDhcgzKHuxTDZe2cQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:43.926564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b5448ec48863b38dd39526d589e4d68cf31fb8216d836ac6b7484cba48710dc","sha256:06d223d08628361c9fee512bac5cbd0abd802daba686ce2b310f68368270c12e"],"state_sha256":"0caa6167379312cd9822609254dd43ab8de3304fe7b9a981f3e08916af1bc68f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWi2PjDRP7s7Hk89RO/lwOtytLPNODYPC1nvdensaX+FnS1HBpjx7tE9K5GjUVcaDJjVfHXO80/NFgPhPK4WBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:34:20.726747Z","bundle_sha256":"0e5e5e45698edac56e7df0b1290b5ebde6587ecef0865e0bf6a986bfc70e8939"}}