{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OFOS7RBSMWUYUS3R4IYIJH5EQH","short_pith_number":"pith:OFOS7RBS","schema_version":"1.0","canonical_sha256":"715d2fc43265a98a4b71e230849fa481d668e9e47e082e4fc5b3773cfeee1189","source":{"kind":"arxiv","id":"1802.01061","version":2},"attestation_state":"computed","paper":{"title":"Power Allocation Strategy of Maximizing Secrecy Rate for Secure Directional Modulation Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Feng Shu, Guan Gui, Guiyang Xia, Jiangzhou Wang, Jinhui Lu, Jun Li, Jun Wang, Simin Wan, Yijin Zhang","submitted_at":"2018-02-04T02:28:54Z","abstract_excerpt":"In this paper, given the beamforming vector of confidential messages and artificial noise (AN) projection matrix and total power constraint, a power allocation (PA) strategy of maximizing secrecy rate (Max-SR) is proposed for secure directional modulation (DM) networks. By the method of Lagrange multiplier, the analytic expression of the proposed PA strategy is derived. To confirm the benefit from the Max-SR-based PA strategy, we take the null-space projection (NSP) beamforming scheme as an example and derive its closed-form expression of optimal PA strategy. From simulation results, we find t"},"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":"1802.01061","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-02-04T02:28:54Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"8a0181bbba3bf1a649db9100ef993002b6f9983df1757c28c26bf70af855ce2c","abstract_canon_sha256":"3fcd05dcb378754085efd8bfa9ffcc769870d77a69a4d3a5707966113b910cad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:21.969926Z","signature_b64":"VsV8ThJ8k6b29TmWYsWhVRFdgNUlYlEZXp3tqwYnbAFAqfHUvd3UGoaX2eM2o8Zwbnb9ZGyPgqer0jO3tC55CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"715d2fc43265a98a4b71e230849fa481d668e9e47e082e4fc5b3773cfeee1189","last_reissued_at":"2026-05-18T00:24:21.969489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:21.969489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power Allocation Strategy of Maximizing Secrecy Rate for Secure Directional Modulation Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Feng Shu, Guan Gui, Guiyang Xia, Jiangzhou Wang, Jinhui Lu, Jun Li, Jun Wang, Simin Wan, Yijin Zhang","submitted_at":"2018-02-04T02:28:54Z","abstract_excerpt":"In this paper, given the beamforming vector of confidential messages and artificial noise (AN) projection matrix and total power constraint, a power allocation (PA) strategy of maximizing secrecy rate (Max-SR) is proposed for secure directional modulation (DM) networks. By the method of Lagrange multiplier, the analytic expression of the proposed PA strategy is derived. To confirm the benefit from the Max-SR-based PA strategy, we take the null-space projection (NSP) beamforming scheme as an example and derive its closed-form expression of optimal PA strategy. From simulation results, we find t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01061","kind":"arxiv","version":2},"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":"1802.01061","created_at":"2026-05-18T00:24:21.969556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01061v2","created_at":"2026-05-18T00:24:21.969556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01061","created_at":"2026-05-18T00:24:21.969556+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFOS7RBSMWUY","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFOS7RBSMWUYUS3R","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFOS7RBS","created_at":"2026-05-18T12:32:43.782077+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/OFOS7RBSMWUYUS3R4IYIJH5EQH","json":"https://pith.science/pith/OFOS7RBSMWUYUS3R4IYIJH5EQH.json","graph_json":"https://pith.science/api/pith-number/OFOS7RBSMWUYUS3R4IYIJH5EQH/graph.json","events_json":"https://pith.science/api/pith-number/OFOS7RBSMWUYUS3R4IYIJH5EQH/events.json","paper":"https://pith.science/paper/OFOS7RBS"},"agent_actions":{"view_html":"https://pith.science/pith/OFOS7RBSMWUYUS3R4IYIJH5EQH","download_json":"https://pith.science/pith/OFOS7RBSMWUYUS3R4IYIJH5EQH.json","view_paper":"https://pith.science/paper/OFOS7RBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01061&json=true","fetch_graph":"https://pith.science/api/pith-number/OFOS7RBSMWUYUS3R4IYIJH5EQH/graph.json","fetch_events":"https://pith.science/api/pith-number/OFOS7RBSMWUYUS3R4IYIJH5EQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFOS7RBSMWUYUS3R4IYIJH5EQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFOS7RBSMWUYUS3R4IYIJH5EQH/action/storage_attestation","attest_author":"https://pith.science/pith/OFOS7RBSMWUYUS3R4IYIJH5EQH/action/author_attestation","sign_citation":"https://pith.science/pith/OFOS7RBSMWUYUS3R4IYIJH5EQH/action/citation_signature","submit_replication":"https://pith.science/pith/OFOS7RBSMWUYUS3R4IYIJH5EQH/action/replication_record"}},"created_at":"2026-05-18T00:24:21.969556+00:00","updated_at":"2026-05-18T00:24:21.969556+00:00"}