{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ASWY2TIQTWFO6PSRUL2UOZFR5J","short_pith_number":"pith:ASWY2TIQ","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"},"canonical_sha256":"04ad8d4d109d8aef3e51a2f54764b1ea4b8d0940b7eef3fa9b6c8a3fada5455c","source":{"kind":"arxiv","id":"1207.5063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5063","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5063v1","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5063","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"ASWY2TIQTWFO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ASWY2TIQTWFO6PSR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ASWY2TIQ","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ASWY2TIQTWFO6PSRUL2UOZFR5J","target":"record","payload":{"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"},"canonical_sha256":"04ad8d4d109d8aef3e51a2f54764b1ea4b8d0940b7eef3fa9b6c8a3fada5455c","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"},"source_kind":"arxiv","source_id":"1207.5063","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsISuLIXaGYccEzhaUEh0JU52o23Qbhk/9UJGTVNvX/trKV6TcOdqqIMe0Cagn3Jydq6h5hwf87JY4n8XVTnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:08:23.346297Z"},"content_sha256":"24e818d5dee3aed58f801352eb9afd5142d90893abefa00bb42c403f75243c67","schema_version":"1.0","event_id":"sha256:24e818d5dee3aed58f801352eb9afd5142d90893abefa00bb42c403f75243c67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ASWY2TIQTWFO6PSRUL2UOZFR5J","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uz+D+xBXUdUn7hLoCJevXd1xhqfTSDb/ObWFKww8E1/PpqDL7/56hSEv+eJrR0tCYkGi2pnOovYT9LI+by2pCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:08:23.346723Z"},"content_sha256":"f45a24851c3747ecabffa502162f268ad994fc390adcc83f9a23e201219eb4ee","schema_version":"1.0","event_id":"sha256:f45a24851c3747ecabffa502162f268ad994fc390adcc83f9a23e201219eb4ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/bundle.json","state_url":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T21:08:23Z","links":{"resolver":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J","bundle":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/bundle.json","state":"https://pith.science/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASWY2TIQTWFO6PSRUL2UOZFR5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ASWY2TIQTWFO6PSRUL2UOZFR5J","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3d41ee80e8db335a6be1155ccc88d8fe5955304d6c8e99a1ff3de2252cadf50e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-20T21:28:47Z","title_canon_sha256":"781cc1a53eed1238ff60d835dfd2abad46a2af4be1c43defd679ee5c3bd1fe94"},"schema_version":"1.0","source":{"id":"1207.5063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5063","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5063v1","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5063","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"ASWY2TIQTWFO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ASWY2TIQTWFO6PSR","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ASWY2TIQ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:f45a24851c3747ecabffa502162f268ad994fc390adcc83f9a23e201219eb4ee","target":"graph","created_at":"2026-05-18T03:27:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Adeel Razi, Giovanni Geraci, Iain B. Collings, Jinhong Yuan, Malcolm Egan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-20T21:28:47Z","title":"Secrecy Sum-Rates for Multi-User MIMO Regularized Channel Inversion Precoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5063","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:24e818d5dee3aed58f801352eb9afd5142d90893abefa00bb42c403f75243c67","target":"record","created_at":"2026-05-18T03:27:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3d41ee80e8db335a6be1155ccc88d8fe5955304d6c8e99a1ff3de2252cadf50e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-20T21:28:47Z","title_canon_sha256":"781cc1a53eed1238ff60d835dfd2abad46a2af4be1c43defd679ee5c3bd1fe94"},"schema_version":"1.0","source":{"id":"1207.5063","kind":"arxiv","version":1}},"canonical_sha256":"04ad8d4d109d8aef3e51a2f54764b1ea4b8d0940b7eef3fa9b6c8a3fada5455c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04ad8d4d109d8aef3e51a2f54764b1ea4b8d0940b7eef3fa9b6c8a3fada5455c","first_computed_at":"2026-05-18T03:27:32.761578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:32.761578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ROurLIXx9krxDYyIA31G8cs3YQUrh8YCSZ1AbcFp3gTXxhCjmR0xALdRtdeO60dsapFm5GJa0rXey1hMbGhAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:32.762013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24e818d5dee3aed58f801352eb9afd5142d90893abefa00bb42c403f75243c67","sha256:f45a24851c3747ecabffa502162f268ad994fc390adcc83f9a23e201219eb4ee"],"state_sha256":"abaf9e41d7d7dc230c67dd4c7fa98014362a53584747e197eca010e9fbf5b34e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrhlrX6o6liPHms5bl6why18/ZgXmQ7JnhzzvATExLDTVEvLVvwN/yc6lnASANWLOEZnsxnZP4cPX0+lWn13Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:08:23.351820Z","bundle_sha256":"1a4531253f5551a0e66da05b6001d6154d31376667a5b75bb0e4596465409668"}}