{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EAWIZFOGVB7AFUMPJGASDRP5M2","short_pith_number":"pith:EAWIZFOG","schema_version":"1.0","canonical_sha256":"202c8c95c6a87e02d18f498121c5fd668433d392bc01eb8f964cd48297bc6468","source":{"kind":"arxiv","id":"1701.04960","version":1},"attestation_state":"computed","paper":{"title":"MIMO Beamforming for Secure and Energy-Efficient Wireless Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hoang D. Tuan, H. Vincent Poor, Nguyen T. Nghia, Trung Q. Duong","submitted_at":"2017-01-18T06:14:32Z","abstract_excerpt":"Considering a multiple-user multiple-input multiple-output (MIMO) channel with an eavesdropper, this letter develops a beamformer design to optimize the energy efficiency in terms of secrecy bits per Joule under secrecy quality-of-service constraints. This is a very difficult design problem with no available exact solution techniques. A path-following procedure, which iteratively improves its feasible points by using a simple quadratic program of moderate dimension, is proposed. Under any fixed computational tolerance the procedure terminates after finitely many iterations, yielding at least a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.04960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-18T06:14:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"628ab74c425644ba6ddd9756e5c588f60e38a76f616005a399900f618a6c89cd","abstract_canon_sha256":"7512528621ea796d6b7c0ce3326aaabe0fd19caaedb3eea421e5e24980b47a85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:33.445625Z","signature_b64":"g8cmNk+NPbJRIdp4RBfvREj1CRCyctxKJ1LYPa/qn0KCfmYqRLuMTig51lGhubFxu7bq9VIZOGwQ7ZmLlnLZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"202c8c95c6a87e02d18f498121c5fd668433d392bc01eb8f964cd48297bc6468","last_reissued_at":"2026-05-18T00:52:33.445115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:33.445115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MIMO Beamforming for Secure and Energy-Efficient Wireless Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hoang D. Tuan, H. Vincent Poor, Nguyen T. Nghia, Trung Q. Duong","submitted_at":"2017-01-18T06:14:32Z","abstract_excerpt":"Considering a multiple-user multiple-input multiple-output (MIMO) channel with an eavesdropper, this letter develops a beamformer design to optimize the energy efficiency in terms of secrecy bits per Joule under secrecy quality-of-service constraints. This is a very difficult design problem with no available exact solution techniques. A path-following procedure, which iteratively improves its feasible points by using a simple quadratic program of moderate dimension, is proposed. Under any fixed computational tolerance the procedure terminates after finitely many iterations, yielding at least a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04960","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.04960","created_at":"2026-05-18T00:52:33.445182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04960v1","created_at":"2026-05-18T00:52:33.445182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04960","created_at":"2026-05-18T00:52:33.445182+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAWIZFOGVB7A","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAWIZFOGVB7AFUMP","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAWIZFOG","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2","json":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2.json","graph_json":"https://pith.science/api/pith-number/EAWIZFOGVB7AFUMPJGASDRP5M2/graph.json","events_json":"https://pith.science/api/pith-number/EAWIZFOGVB7AFUMPJGASDRP5M2/events.json","paper":"https://pith.science/paper/EAWIZFOG"},"agent_actions":{"view_html":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2","download_json":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2.json","view_paper":"https://pith.science/paper/EAWIZFOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04960&json=true","fetch_graph":"https://pith.science/api/pith-number/EAWIZFOGVB7AFUMPJGASDRP5M2/graph.json","fetch_events":"https://pith.science/api/pith-number/EAWIZFOGVB7AFUMPJGASDRP5M2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2/action/storage_attestation","attest_author":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2/action/author_attestation","sign_citation":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2/action/citation_signature","submit_replication":"https://pith.science/pith/EAWIZFOGVB7AFUMPJGASDRP5M2/action/replication_record"}},"created_at":"2026-05-18T00:52:33.445182+00:00","updated_at":"2026-05-18T00:52:33.445182+00:00"}