{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GF4AQAORAYJHJ5KUTM2V5O6YW6","short_pith_number":"pith:GF4AQAOR","schema_version":"1.0","canonical_sha256":"31780801d1061274f5549b355ebbd8b793ccdae9243a701a5df8df82b356441c","source":{"kind":"arxiv","id":"1504.03725","version":1},"attestation_state":"computed","paper":{"title":"An Algorithm for Global Maximization of Secrecy Rates in Gaussian MIMO Wiretap Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Sergey Loyka","submitted_at":"2015-04-14T21:05:52Z","abstract_excerpt":"Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the proof of the optimality of Gaussian signalling, an optimal transmit covariance matrix is known for some special cases only and the general case remains an open problem. An iterative custom-made algorithm to find a globally-optimal transmit covariance matrix in the general case is developed in this paper, with guaranteed convergence to a \\textit{global} optimum. While the origi"},"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":"1504.03725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-14T21:05:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9509e9600ebe525a8085a2d4835931b1a597e890888d3db1ff0b797b22b988d4","abstract_canon_sha256":"d9bcd0c180d20731c11fbfbbedb323522addd12b910290daccb35b19e3e766d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:04.474628Z","signature_b64":"lYQkLbtuoKmDXBmQpp7iS2GEXqE8TLeuvJb7u0kz1dbiB8E66AE/XnsE2lFa+IYi3Dku7UVwXFVg0D/cCpUeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31780801d1061274f5549b355ebbd8b793ccdae9243a701a5df8df82b356441c","last_reissued_at":"2026-05-18T00:58:04.474195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:04.474195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Global Maximization of Secrecy Rates in Gaussian MIMO Wiretap Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Sergey Loyka","submitted_at":"2015-04-14T21:05:52Z","abstract_excerpt":"Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the proof of the optimality of Gaussian signalling, an optimal transmit covariance matrix is known for some special cases only and the general case remains an open problem. An iterative custom-made algorithm to find a globally-optimal transmit covariance matrix in the general case is developed in this paper, with guaranteed convergence to a \\textit{global} optimum. While the origi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03725","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":"1504.03725","created_at":"2026-05-18T00:58:04.474258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03725v1","created_at":"2026-05-18T00:58:04.474258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03725","created_at":"2026-05-18T00:58:04.474258+00:00"},{"alias_kind":"pith_short_12","alias_value":"GF4AQAORAYJH","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GF4AQAORAYJHJ5KU","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GF4AQAOR","created_at":"2026-05-18T12:29:22.688609+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/GF4AQAORAYJHJ5KUTM2V5O6YW6","json":"https://pith.science/pith/GF4AQAORAYJHJ5KUTM2V5O6YW6.json","graph_json":"https://pith.science/api/pith-number/GF4AQAORAYJHJ5KUTM2V5O6YW6/graph.json","events_json":"https://pith.science/api/pith-number/GF4AQAORAYJHJ5KUTM2V5O6YW6/events.json","paper":"https://pith.science/paper/GF4AQAOR"},"agent_actions":{"view_html":"https://pith.science/pith/GF4AQAORAYJHJ5KUTM2V5O6YW6","download_json":"https://pith.science/pith/GF4AQAORAYJHJ5KUTM2V5O6YW6.json","view_paper":"https://pith.science/paper/GF4AQAOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03725&json=true","fetch_graph":"https://pith.science/api/pith-number/GF4AQAORAYJHJ5KUTM2V5O6YW6/graph.json","fetch_events":"https://pith.science/api/pith-number/GF4AQAORAYJHJ5KUTM2V5O6YW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GF4AQAORAYJHJ5KUTM2V5O6YW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GF4AQAORAYJHJ5KUTM2V5O6YW6/action/storage_attestation","attest_author":"https://pith.science/pith/GF4AQAORAYJHJ5KUTM2V5O6YW6/action/author_attestation","sign_citation":"https://pith.science/pith/GF4AQAORAYJHJ5KUTM2V5O6YW6/action/citation_signature","submit_replication":"https://pith.science/pith/GF4AQAORAYJHJ5KUTM2V5O6YW6/action/replication_record"}},"created_at":"2026-05-18T00:58:04.474258+00:00","updated_at":"2026-05-18T00:58:04.474258+00:00"}