{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ASWY2TIQTWFO6PSRUL2UOZFR5J","short_pith_number":"pith:ASWY2TIQ","schema_version":"1.0","canonical_sha256":"04ad8d4d109d8aef3e51a2f54764b1ea4b8d0940b7eef3fa9b6c8a3fada5455c","source":{"kind":"arxiv","id":"1207.5063","version":1},"attestation_state":"computed","paper":{"title":"Secrecy Sum-Rates for Multi-User MIMO Regularized Channel Inversion Precoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adeel Razi, Giovanni Geraci, Iain B. Collings, Jinhong Yuan, Malcolm Egan","submitted_at":"2012-07-20T21:28:47Z","abstract_excerpt":"In this paper, we propose a linear precoder for the downlink of a multi-user MIMO system with multiple users that potentially act as eavesdroppers. The proposed precoder is based on regularized channel inversion (RCI) with a regularization parameter $\\alpha$ and power allocation vector chosen in such a way that the achievable secrecy sum-rate is maximized. We consider the worst-case scenario for the multi-user MIMO system, where the transmitter assumes users cooperate to eavesdrop on other users. We derive the achievable secrecy sum-rate and obtain the closed-form expression for the optimal re"},"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":"1207.5063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-20T21:28:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"781cc1a53eed1238ff60d835dfd2abad46a2af4be1c43defd679ee5c3bd1fe94","abstract_canon_sha256":"3d41ee80e8db335a6be1155ccc88d8fe5955304d6c8e99a1ff3de2252cadf50e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.762013Z","signature_b64":"1ROurLIXx9krxDYyIA31G8cs3YQUrh8YCSZ1AbcFp3gTXxhCjmR0xALdRtdeO60dsapFm5GJa0rXey1hMbGhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04ad8d4d109d8aef3e51a2f54764b1ea4b8d0940b7eef3fa9b6c8a3fada5455c","last_reissued_at":"2026-05-18T03:27:32.761578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.761578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secrecy Sum-Rates for Multi-User MIMO Regularized Channel Inversion Precoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adeel Razi, Giovanni Geraci, Iain B. Collings, Jinhong Yuan, Malcolm Egan","submitted_at":"2012-07-20T21:28:47Z","abstract_excerpt":"In this paper, we propose a linear precoder for the downlink of a multi-user MIMO system with multiple users that potentially act as eavesdroppers. The proposed precoder is based on regularized channel inversion (RCI) with a regularization parameter $\\alpha$ and power allocation vector chosen in such a way that the achievable secrecy sum-rate is maximized. We consider the worst-case scenario for the multi-user MIMO system, where the transmitter assumes users cooperate to eavesdrop on other users. We derive the achievable secrecy sum-rate and obtain the closed-form expression for the optimal re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5063","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":"1207.5063","created_at":"2026-05-18T03:27:32.761641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5063v1","created_at":"2026-05-18T03:27:32.761641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5063","created_at":"2026-05-18T03:27:32.761641+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASWY2TIQTWFO","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASWY2TIQTWFO6PSR","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASWY2TIQ","created_at":"2026-05-18T12:26:58.693483+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/ASWY2TIQTWFO6PSRUL2UOZFR5J","json":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J.json","graph_json":"https://pith.science/api/pith-number/ASWY2TIQTWFO6PSRUL2UOZFR5J/graph.json","events_json":"https://pith.science/api/pith-number/ASWY2TIQTWFO6PSRUL2UOZFR5J/events.json","paper":"https://pith.science/paper/ASWY2TIQ"},"agent_actions":{"view_html":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J","download_json":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J.json","view_paper":"https://pith.science/paper/ASWY2TIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5063&json=true","fetch_graph":"https://pith.science/api/pith-number/ASWY2TIQTWFO6PSRUL2UOZFR5J/graph.json","fetch_events":"https://pith.science/api/pith-number/ASWY2TIQTWFO6PSRUL2UOZFR5J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/action/storage_attestation","attest_author":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/action/author_attestation","sign_citation":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/action/citation_signature","submit_replication":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/action/replication_record"}},"created_at":"2026-05-18T03:27:32.761641+00:00","updated_at":"2026-05-18T03:27:32.761641+00:00"}