{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UAMUGWX7RJTIL3ZEFCPC7I7URD","short_pith_number":"pith:UAMUGWX7","schema_version":"1.0","canonical_sha256":"a019435aff8a6685ef24289e2fa3f488c5551dad921e8a540f536f3c60d250ab","source":{"kind":"arxiv","id":"1701.03383","version":1},"attestation_state":"computed","paper":{"title":"Secure communications with cooperative jamming: Optimal power allocation and secrecy outage analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"George C. Alexandropoulos, George K. Karagiannidis, Kanapathippillai Cumanan, Zhgiuo Ding","submitted_at":"2017-01-12T15:48:05Z","abstract_excerpt":"This paper studies the secrecy rate maximization problem of a secure wireless communication system, in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming, with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this non-convexity, the achievable secrecy rate is approximated for a given power allocation at the jam"},"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.03383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-12T15:48:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b52aef677ce944b734eb423ce4aec2024fca7cb6ba72dea02634875f174be7a","abstract_canon_sha256":"eb48d9ba4fc2bf76c6d6549bdbd03fb023acdbdadc693bd8114fa3d59339f426"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.993092Z","signature_b64":"qhxRztcMKzSDbZnKV92aPP+UqxZDjc5FS2Oa+YYzxGEDkDC1mBtH5Cqods9yRo2QayIMfqcf5y5XSdh/ULrZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a019435aff8a6685ef24289e2fa3f488c5551dad921e8a540f536f3c60d250ab","last_reissued_at":"2026-05-18T00:52:55.992500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.992500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure communications with cooperative jamming: Optimal power allocation and secrecy outage analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"George C. Alexandropoulos, George K. Karagiannidis, Kanapathippillai Cumanan, Zhgiuo Ding","submitted_at":"2017-01-12T15:48:05Z","abstract_excerpt":"This paper studies the secrecy rate maximization problem of a secure wireless communication system, in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming, with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this non-convexity, the achievable secrecy rate is approximated for a given power allocation at the jam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03383","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.03383","created_at":"2026-05-18T00:52:55.992597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03383v1","created_at":"2026-05-18T00:52:55.992597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03383","created_at":"2026-05-18T00:52:55.992597+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAMUGWX7RJTI","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAMUGWX7RJTIL3ZE","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAMUGWX7","created_at":"2026-05-18T12:31:46.661854+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/UAMUGWX7RJTIL3ZEFCPC7I7URD","json":"https://pith.science/pith/UAMUGWX7RJTIL3ZEFCPC7I7URD.json","graph_json":"https://pith.science/api/pith-number/UAMUGWX7RJTIL3ZEFCPC7I7URD/graph.json","events_json":"https://pith.science/api/pith-number/UAMUGWX7RJTIL3ZEFCPC7I7URD/events.json","paper":"https://pith.science/paper/UAMUGWX7"},"agent_actions":{"view_html":"https://pith.science/pith/UAMUGWX7RJTIL3ZEFCPC7I7URD","download_json":"https://pith.science/pith/UAMUGWX7RJTIL3ZEFCPC7I7URD.json","view_paper":"https://pith.science/paper/UAMUGWX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03383&json=true","fetch_graph":"https://pith.science/api/pith-number/UAMUGWX7RJTIL3ZEFCPC7I7URD/graph.json","fetch_events":"https://pith.science/api/pith-number/UAMUGWX7RJTIL3ZEFCPC7I7URD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAMUGWX7RJTIL3ZEFCPC7I7URD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAMUGWX7RJTIL3ZEFCPC7I7URD/action/storage_attestation","attest_author":"https://pith.science/pith/UAMUGWX7RJTIL3ZEFCPC7I7URD/action/author_attestation","sign_citation":"https://pith.science/pith/UAMUGWX7RJTIL3ZEFCPC7I7URD/action/citation_signature","submit_replication":"https://pith.science/pith/UAMUGWX7RJTIL3ZEFCPC7I7URD/action/replication_record"}},"created_at":"2026-05-18T00:52:55.992597+00:00","updated_at":"2026-05-18T00:52:55.992597+00:00"}