{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YZ4NIZUCTZYFC2SVSKZMZJXHUX","short_pith_number":"pith:YZ4NIZUC","canonical_record":{"source":{"id":"1401.3617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T14:52:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2caabb99d22b28d7dd035e001303143bd5e5daf31f72f9fd5aa16b2ec2231b4f","abstract_canon_sha256":"c50586d2783de6f766209de942d7d11731b4d0c16c9425ab4c90c3d4924b1091"},"schema_version":"1.0"},"canonical_sha256":"c678d466829e70516a5592b2cca6e7a5e88a2ab531ad771a092f718b6732884e","source":{"kind":"arxiv","id":"1401.3617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3617","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3617v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3617","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"YZ4NIZUCTZYF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YZ4NIZUCTZYFC2SV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YZ4NIZUC","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YZ4NIZUCTZYFC2SVSKZMZJXHUX","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T14:52:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2caabb99d22b28d7dd035e001303143bd5e5daf31f72f9fd5aa16b2ec2231b4f","abstract_canon_sha256":"c50586d2783de6f766209de942d7d11731b4d0c16c9425ab4c90c3d4924b1091"},"schema_version":"1.0"},"canonical_sha256":"c678d466829e70516a5592b2cca6e7a5e88a2ab531ad771a092f718b6732884e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.209210Z","signature_b64":"vs0aSoGftla3xZwPFlrDRV3utBI40sISyM3m9NBHwu5x8wDiZ+kH8ScJqSDA35Tm0WdkWdEgPVcEOX/VOQqBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c678d466829e70516a5592b2cca6e7a5e88a2ab531ad771a092f718b6732884e","last_reissued_at":"2026-05-18T03:02:08.208345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.208345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3617","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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJgQuXKv0U6y4O6TKWbT1/U6PbPAV+xDePDBWLcHou6udzg7IrBUq+3rKRitz9Q3F8scRlLsecsR5ur6yOsVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:34:16.767590Z"},"content_sha256":"1f248e29e930b86796cba6987eacddecb50280220dad39a5f6d94139ff306393","schema_version":"1.0","event_id":"sha256:1f248e29e930b86796cba6987eacddecb50280220dad39a5f6d94139ff306393"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YZ4NIZUCTZYFC2SVSKZMZJXHUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Power Allocation in MIMO Wiretap Channel with Statistical CSI and Finite-Alphabet Input","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Chockalingam, Sanjay Vishwakarma","submitted_at":"2014-01-15T14:52:32Z","abstract_excerpt":"In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3617","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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03TBK8BxA7kkl8GpJRNMMRJ66Xe0d9T698p8KJB05KS4SypgO024RQbWtXHzuj2zgWphAhj93L2HJyCpp2tyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:34:16.768418Z"},"content_sha256":"e078ce3bd6701d656df49e3ec5032a4b005a92356ca13360396d6abb5edccbe6","schema_version":"1.0","event_id":"sha256:e078ce3bd6701d656df49e3ec5032a4b005a92356ca13360396d6abb5edccbe6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZ4NIZUCTZYFC2SVSKZMZJXHUX/bundle.json","state_url":"https://pith.science/pith/YZ4NIZUCTZYFC2SVSKZMZJXHUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZ4NIZUCTZYFC2SVSKZMZJXHUX/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-31T12:34:16Z","links":{"resolver":"https://pith.science/pith/YZ4NIZUCTZYFC2SVSKZMZJXHUX","bundle":"https://pith.science/pith/YZ4NIZUCTZYFC2SVSKZMZJXHUX/bundle.json","state":"https://pith.science/pith/YZ4NIZUCTZYFC2SVSKZMZJXHUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZ4NIZUCTZYFC2SVSKZMZJXHUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YZ4NIZUCTZYFC2SVSKZMZJXHUX","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":"c50586d2783de6f766209de942d7d11731b4d0c16c9425ab4c90c3d4924b1091","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T14:52:32Z","title_canon_sha256":"2caabb99d22b28d7dd035e001303143bd5e5daf31f72f9fd5aa16b2ec2231b4f"},"schema_version":"1.0","source":{"id":"1401.3617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3617","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3617v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3617","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"YZ4NIZUCTZYF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YZ4NIZUCTZYFC2SV","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YZ4NIZUC","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:e078ce3bd6701d656df49e3ec5032a4b005a92356ca13360396d6abb5edccbe6","target":"graph","created_at":"2026-05-18T03:02:08Z","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 consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secr","authors_text":"A. Chockalingam, Sanjay Vishwakarma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T14:52:32Z","title":"Power Allocation in MIMO Wiretap Channel with Statistical CSI and Finite-Alphabet Input"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3617","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:1f248e29e930b86796cba6987eacddecb50280220dad39a5f6d94139ff306393","target":"record","created_at":"2026-05-18T03:02:08Z","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":"c50586d2783de6f766209de942d7d11731b4d0c16c9425ab4c90c3d4924b1091","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-15T14:52:32Z","title_canon_sha256":"2caabb99d22b28d7dd035e001303143bd5e5daf31f72f9fd5aa16b2ec2231b4f"},"schema_version":"1.0","source":{"id":"1401.3617","kind":"arxiv","version":1}},"canonical_sha256":"c678d466829e70516a5592b2cca6e7a5e88a2ab531ad771a092f718b6732884e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c678d466829e70516a5592b2cca6e7a5e88a2ab531ad771a092f718b6732884e","first_computed_at":"2026-05-18T03:02:08.208345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:08.208345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vs0aSoGftla3xZwPFlrDRV3utBI40sISyM3m9NBHwu5x8wDiZ+kH8ScJqSDA35Tm0WdkWdEgPVcEOX/VOQqBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:08.209210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f248e29e930b86796cba6987eacddecb50280220dad39a5f6d94139ff306393","sha256:e078ce3bd6701d656df49e3ec5032a4b005a92356ca13360396d6abb5edccbe6"],"state_sha256":"f9b714d0cdda8a37fdb40e855bc31c2163c207279dd436e8ffed4d6ebff494de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEQw2oD5qGNiVZm1psJcFgh7gTdXzoZrKXcW1OLGF2QqLdgmq6mt3z9ha8ClWWKZiuu22yqXZLsSXcEUJquXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:34:16.773790Z","bundle_sha256":"0270acc4aa7c757990f281deb2b9d78bfb852eb1f934fe7182743b3a998710bf"}}