{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5SJHNMVG5DCHPDEUCZW2M7S46U","short_pith_number":"pith:5SJHNMVG","canonical_record":{"source":{"id":"1304.5850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-22T06:24:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41d41d2bef905ffc697e3f7ee6d1a60fde7520e94c262124e46fe339d694d8d2","abstract_canon_sha256":"e517ef4253e4f57b3ba7661bff4445a2ed9d4af7399a50f559d09da61aaaefe2"},"schema_version":"1.0"},"canonical_sha256":"ec9276b2a6e8c4778c94166da67e5cf50ae8bdf568cbe76f257c41c79a41d83f","source":{"kind":"arxiv","id":"1304.5850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5850","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5850v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5850","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"5SJHNMVG5DCH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5SJHNMVG5DCHPDEU","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5SJHNMVG","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5SJHNMVG5DCHPDEUCZW2M7S46U","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-22T06:24:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41d41d2bef905ffc697e3f7ee6d1a60fde7520e94c262124e46fe339d694d8d2","abstract_canon_sha256":"e517ef4253e4f57b3ba7661bff4445a2ed9d4af7399a50f559d09da61aaaefe2"},"schema_version":"1.0"},"canonical_sha256":"ec9276b2a6e8c4778c94166da67e5cf50ae8bdf568cbe76f257c41c79a41d83f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.442715Z","signature_b64":"aLwFe15bH5ZJjOR6OlckdX2zPdiGLYgZ8muzAgwYZeoLEXOo9cfggGVSh9vi5PsUJgyO+dffKtz5KpGVSusQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec9276b2a6e8c4778c94166da67e5cf50ae8bdf568cbe76f257c41c79a41d83f","last_reissued_at":"2026-05-18T00:58:42.442170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.442170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5850","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WLS4suaWQasFjpcoECNEVvwYJO5V3t7zKgOqn80UU8OTrbrWYo9m8nBnHmmv+xkDA6PVM8Pbd5aRLunpkl9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:33:04.574160Z"},"content_sha256":"de9dfcbdeb8fc0387cb0941079077476ed598113b610bf472a4f945a7a48edda","schema_version":"1.0","event_id":"sha256:de9dfcbdeb8fc0387cb0941079077476ed598113b610bf472a4f945a7a48edda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5SJHNMVG5DCHPDEUCZW2M7S46U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large System Analysis of Linear Precoding in MISO Broadcast Channels with Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giovanni Geraci, Iain B. Collings, Jinhong Yuan, Merouane Debbah, Romain Couillet","submitted_at":"2013-04-22T06:24:40Z","abstract_excerpt":"In this paper, we study the performance of regularized channel inversion (RCI) precoding in large MISO broadcast channels with confidential messages (BCC). We obtain a deterministic approximation for the achievable secrecy sum-rate which is almost surely exact as the number of transmit antennas $M$ and the number of users $K$ grow to infinity in a fixed ratio $\\beta=K/M$. We derive the optimal regularization parameter $\\xi$ and the optimal network load $\\beta$ that maximize the per-antenna secrecy sum-rate. We then propose a linear precoder based on RCI and power reduction (RCI-PR) that signif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5850","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2D6jkqRjePCfaHrssz/4EmIgtVtZKDBaHx6l8i8oTsaAAq6tSVMhKts995sad/Cyu90H37ND0FPLLy/tP97wAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:33:04.574530Z"},"content_sha256":"15be6aa202025531e8918941654eba0c949eb757ae954903bca682055cf701c2","schema_version":"1.0","event_id":"sha256:15be6aa202025531e8918941654eba0c949eb757ae954903bca682055cf701c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SJHNMVG5DCHPDEUCZW2M7S46U/bundle.json","state_url":"https://pith.science/pith/5SJHNMVG5DCHPDEUCZW2M7S46U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SJHNMVG5DCHPDEUCZW2M7S46U/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-06-08T14:33:04Z","links":{"resolver":"https://pith.science/pith/5SJHNMVG5DCHPDEUCZW2M7S46U","bundle":"https://pith.science/pith/5SJHNMVG5DCHPDEUCZW2M7S46U/bundle.json","state":"https://pith.science/pith/5SJHNMVG5DCHPDEUCZW2M7S46U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SJHNMVG5DCHPDEUCZW2M7S46U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5SJHNMVG5DCHPDEUCZW2M7S46U","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":"e517ef4253e4f57b3ba7661bff4445a2ed9d4af7399a50f559d09da61aaaefe2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-22T06:24:40Z","title_canon_sha256":"41d41d2bef905ffc697e3f7ee6d1a60fde7520e94c262124e46fe339d694d8d2"},"schema_version":"1.0","source":{"id":"1304.5850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5850","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5850v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5850","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"5SJHNMVG5DCH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5SJHNMVG5DCHPDEU","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5SJHNMVG","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:15be6aa202025531e8918941654eba0c949eb757ae954903bca682055cf701c2","target":"graph","created_at":"2026-05-18T00:58:42Z","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 study the performance of regularized channel inversion (RCI) precoding in large MISO broadcast channels with confidential messages (BCC). We obtain a deterministic approximation for the achievable secrecy sum-rate which is almost surely exact as the number of transmit antennas $M$ and the number of users $K$ grow to infinity in a fixed ratio $\\beta=K/M$. We derive the optimal regularization parameter $\\xi$ and the optimal network load $\\beta$ that maximize the per-antenna secrecy sum-rate. We then propose a linear precoder based on RCI and power reduction (RCI-PR) that signif","authors_text":"Giovanni Geraci, Iain B. Collings, Jinhong Yuan, Merouane Debbah, Romain Couillet","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-22T06:24:40Z","title":"Large System Analysis of Linear Precoding in MISO Broadcast Channels with Confidential Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5850","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:de9dfcbdeb8fc0387cb0941079077476ed598113b610bf472a4f945a7a48edda","target":"record","created_at":"2026-05-18T00:58:42Z","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":"e517ef4253e4f57b3ba7661bff4445a2ed9d4af7399a50f559d09da61aaaefe2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-22T06:24:40Z","title_canon_sha256":"41d41d2bef905ffc697e3f7ee6d1a60fde7520e94c262124e46fe339d694d8d2"},"schema_version":"1.0","source":{"id":"1304.5850","kind":"arxiv","version":1}},"canonical_sha256":"ec9276b2a6e8c4778c94166da67e5cf50ae8bdf568cbe76f257c41c79a41d83f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec9276b2a6e8c4778c94166da67e5cf50ae8bdf568cbe76f257c41c79a41d83f","first_computed_at":"2026-05-18T00:58:42.442170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.442170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aLwFe15bH5ZJjOR6OlckdX2zPdiGLYgZ8muzAgwYZeoLEXOo9cfggGVSh9vi5PsUJgyO+dffKtz5KpGVSusQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.442715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de9dfcbdeb8fc0387cb0941079077476ed598113b610bf472a4f945a7a48edda","sha256:15be6aa202025531e8918941654eba0c949eb757ae954903bca682055cf701c2"],"state_sha256":"4a8e05f4b72f3e50894fae1f7c106dd6474b852db2ae7b707de3cd9464af8369"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N79OSI2TpHyIYzhC05vR5RJpdhG4ZghtxEhsNM8CkTi/Lxy6JaPXnZzD2NAfqM9CpzpifYxLXuDcS9zc6w4eDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:33:04.576664Z","bundle_sha256":"9e359d0f75978736f94d9bfc372251ae4b252f4f76a4dbeee462c7ddf2bf9a2c"}}