{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UPBUFKRNRY22D336E457R7GDM4","short_pith_number":"pith:UPBUFKRN","schema_version":"1.0","canonical_sha256":"a3c342aa2d8e35a1ef7e273bf8fcc3672e2b68047ab58f2910081f4bd067c20a","source":{"kind":"arxiv","id":"1802.05209","version":2},"attestation_state":"computed","paper":{"title":"Sum Secrecy Rate Maximization in a Multi-Carrier MIMO Wiretap Channel with Full-Duplex Jamming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Omid Taghizadeh, Rudolf Mathar, Tianyu Yang","submitted_at":"2018-02-14T16:57:20Z","abstract_excerpt":"In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a potential eavesdropper. In particular, we simultaneously take advantage of the spatial and frequency diversity in the system in order to obtain a higher level of security in the physical layer. Due to the non-convex nature of the resulting mathematical problem, we propose an iterative solution with a guaranteed convergence, based on block coordinate descent"},"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.05209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-14T16:57:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9f6bba482e44b637ada0d2c221e1fadd73b3bd61ceaf1d560f7d150e8122e62","abstract_canon_sha256":"eb35ad906906dc70d5af817480241c2b1533d1ae2d2576888685e2fbabf51882"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:11.317228Z","signature_b64":"aPiEaamewyCyneGKdRl/MVKbSQaa8WPFJC+zzNvQzOnzjf6fx0uVrlYwJYfmf0zqnii+ClkAOOiU+eeGKSP2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3c342aa2d8e35a1ef7e273bf8fcc3672e2b68047ab58f2910081f4bd067c20a","last_reissued_at":"2026-05-18T00:23:11.316546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:11.316546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sum Secrecy Rate Maximization in a Multi-Carrier MIMO Wiretap Channel with Full-Duplex Jamming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Omid Taghizadeh, Rudolf Mathar, Tianyu Yang","submitted_at":"2018-02-14T16:57:20Z","abstract_excerpt":"In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a potential eavesdropper. In particular, we simultaneously take advantage of the spatial and frequency diversity in the system in order to obtain a higher level of security in the physical layer. Due to the non-convex nature of the resulting mathematical problem, we propose an iterative solution with a guaranteed convergence, based on block coordinate descent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05209","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.05209","created_at":"2026-05-18T00:23:11.316668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05209v2","created_at":"2026-05-18T00:23:11.316668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05209","created_at":"2026-05-18T00:23:11.316668+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPBUFKRNRY22","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPBUFKRNRY22D336","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPBUFKRN","created_at":"2026-05-18T12:32:56.356000+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/UPBUFKRNRY22D336E457R7GDM4","json":"https://pith.science/pith/UPBUFKRNRY22D336E457R7GDM4.json","graph_json":"https://pith.science/api/pith-number/UPBUFKRNRY22D336E457R7GDM4/graph.json","events_json":"https://pith.science/api/pith-number/UPBUFKRNRY22D336E457R7GDM4/events.json","paper":"https://pith.science/paper/UPBUFKRN"},"agent_actions":{"view_html":"https://pith.science/pith/UPBUFKRNRY22D336E457R7GDM4","download_json":"https://pith.science/pith/UPBUFKRNRY22D336E457R7GDM4.json","view_paper":"https://pith.science/paper/UPBUFKRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05209&json=true","fetch_graph":"https://pith.science/api/pith-number/UPBUFKRNRY22D336E457R7GDM4/graph.json","fetch_events":"https://pith.science/api/pith-number/UPBUFKRNRY22D336E457R7GDM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPBUFKRNRY22D336E457R7GDM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPBUFKRNRY22D336E457R7GDM4/action/storage_attestation","attest_author":"https://pith.science/pith/UPBUFKRNRY22D336E457R7GDM4/action/author_attestation","sign_citation":"https://pith.science/pith/UPBUFKRNRY22D336E457R7GDM4/action/citation_signature","submit_replication":"https://pith.science/pith/UPBUFKRNRY22D336E457R7GDM4/action/replication_record"}},"created_at":"2026-05-18T00:23:11.316668+00:00","updated_at":"2026-05-18T00:23:11.316668+00:00"}