{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4CLQI7G6GXVSR4DEPAK34HFSWW","short_pith_number":"pith:4CLQI7G6","schema_version":"1.0","canonical_sha256":"e097047cde35eb28f0647815be1cb2b58f7dd19a57b8106171731b8f9386fde9","source":{"kind":"arxiv","id":"1508.07727","version":1},"attestation_state":"computed","paper":{"title":"Optimal Power Allocation for A Massive MIMO Relay Aided Secure Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jian Chen, Wolfgang Gerstacker, Xiaoming Chen","submitted_at":"2015-08-31T09:10:16Z","abstract_excerpt":"In this paper, we address the problem of optimal power allocation at the relay in two-hop secure communications under practical conditions. To guarantee secure communication during the long-distance transmission, the massive MIMO (M-MIMO) relaying techniques are explored to significantly enhance wireless security. The focus of this paper is on the analysis and design of optimal power assignment for a decode-and-forward (DF) M-MIMO relay, so as to maximize the secrecy outage capacity and minimize the interception probability, respectively. Our study reveals the condition for a nonnegative the s"},"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":"1508.07727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-31T09:10:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ee858be4471c044905d0de8d79ecd159d513707f0fc7338a574eeeb0f1e527cd","abstract_canon_sha256":"1368f901848763af6fc99225685f31b64a91df1e1c6d7375945fe663ef9a3d4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:31.554684Z","signature_b64":"QlL4OZ/Ex2wvpT2GOSzyrs8L8jhr3h4IAfwtnjL6wk570+MysPsOe9kk0FM/2HqWop3PCxIpmp2OGeW+iUAfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e097047cde35eb28f0647815be1cb2b58f7dd19a57b8106171731b8f9386fde9","last_reissued_at":"2026-05-18T01:34:31.554292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:31.554292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Power Allocation for A Massive MIMO Relay Aided Secure Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jian Chen, Wolfgang Gerstacker, Xiaoming Chen","submitted_at":"2015-08-31T09:10:16Z","abstract_excerpt":"In this paper, we address the problem of optimal power allocation at the relay in two-hop secure communications under practical conditions. To guarantee secure communication during the long-distance transmission, the massive MIMO (M-MIMO) relaying techniques are explored to significantly enhance wireless security. The focus of this paper is on the analysis and design of optimal power assignment for a decode-and-forward (DF) M-MIMO relay, so as to maximize the secrecy outage capacity and minimize the interception probability, respectively. Our study reveals the condition for a nonnegative the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07727","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":"1508.07727","created_at":"2026-05-18T01:34:31.554365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.07727v1","created_at":"2026-05-18T01:34:31.554365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07727","created_at":"2026-05-18T01:34:31.554365+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CLQI7G6GXVS","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CLQI7G6GXVSR4DE","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CLQI7G6","created_at":"2026-05-18T12:29:05.191682+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/4CLQI7G6GXVSR4DEPAK34HFSWW","json":"https://pith.science/pith/4CLQI7G6GXVSR4DEPAK34HFSWW.json","graph_json":"https://pith.science/api/pith-number/4CLQI7G6GXVSR4DEPAK34HFSWW/graph.json","events_json":"https://pith.science/api/pith-number/4CLQI7G6GXVSR4DEPAK34HFSWW/events.json","paper":"https://pith.science/paper/4CLQI7G6"},"agent_actions":{"view_html":"https://pith.science/pith/4CLQI7G6GXVSR4DEPAK34HFSWW","download_json":"https://pith.science/pith/4CLQI7G6GXVSR4DEPAK34HFSWW.json","view_paper":"https://pith.science/paper/4CLQI7G6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.07727&json=true","fetch_graph":"https://pith.science/api/pith-number/4CLQI7G6GXVSR4DEPAK34HFSWW/graph.json","fetch_events":"https://pith.science/api/pith-number/4CLQI7G6GXVSR4DEPAK34HFSWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CLQI7G6GXVSR4DEPAK34HFSWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CLQI7G6GXVSR4DEPAK34HFSWW/action/storage_attestation","attest_author":"https://pith.science/pith/4CLQI7G6GXVSR4DEPAK34HFSWW/action/author_attestation","sign_citation":"https://pith.science/pith/4CLQI7G6GXVSR4DEPAK34HFSWW/action/citation_signature","submit_replication":"https://pith.science/pith/4CLQI7G6GXVSR4DEPAK34HFSWW/action/replication_record"}},"created_at":"2026-05-18T01:34:31.554365+00:00","updated_at":"2026-05-18T01:34:31.554365+00:00"}