{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FAZMOOSTWI3FFUBS4DGVNXWSUX","short_pith_number":"pith:FAZMOOST","canonical_record":{"source":{"id":"1406.7623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T07:38:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"699b50f499720613e605e84290b80c54ea24b465f7935ad535d16c37d3b317ba","abstract_canon_sha256":"d4984ac84399de9929cc1d196b2463b7160bce86df3c95c53d686e6390d6916e"},"schema_version":"1.0"},"canonical_sha256":"2832c73a53b23652d032e0cd56ded2a5febe85320b1b7cb75205764530419155","source":{"kind":"arxiv","id":"1406.7623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7623","created_at":"2026-05-18T01:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7623v1","created_at":"2026-05-18T01:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7623","created_at":"2026-05-18T01:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"FAZMOOSTWI3F","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FAZMOOSTWI3FFUBS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FAZMOOST","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FAZMOOSTWI3FFUBS4DGVNXWSUX","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T07:38:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"699b50f499720613e605e84290b80c54ea24b465f7935ad535d16c37d3b317ba","abstract_canon_sha256":"d4984ac84399de9929cc1d196b2463b7160bce86df3c95c53d686e6390d6916e"},"schema_version":"1.0"},"canonical_sha256":"2832c73a53b23652d032e0cd56ded2a5febe85320b1b7cb75205764530419155","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:45.285648Z","signature_b64":"zMzEWSu0ifk+DIJlNLQ/TxBkQMgW+wN0Nmp0qSIJdXX30LsB/5FWyxZtj76dzE3Sgs3QPpDqHoJGfHQm3wVoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2832c73a53b23652d032e0cd56ded2a5febe85320b1b7cb75205764530419155","last_reissued_at":"2026-05-18T01:42:45.284926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:45.284926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7623","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-18T01:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0st7Gg4mbjwEo4s5dwjpms/OaujTjVZ4HLLyl102zNExIysWeK9fZrci5EHHMfGnWLQxnxGht6SNNJVbspIADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:07:05.748233Z"},"content_sha256":"ebf5abebe87a70be85c903f7a52ad50b84c99514ee82e5ba768c4ef0d796cf0d","schema_version":"1.0","event_id":"sha256:ebf5abebe87a70be85c903f7a52ad50b84c99514ee82e5ba768c4ef0d796cf0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FAZMOOSTWI3FFUBS4DGVNXWSUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transmit Designs for the MIMO Broadcast Channel with Statistical CSI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengshan Xiao, Matthew R. McKay, Shi Jin, Xiqi Gao, Yongpeng Wu","submitted_at":"2014-06-30T07:38:24Z","abstract_excerpt":"We investigate the multiple-input multiple-output broadcast channel with statistical channel state information available at the transmitter. The so-called linear assignment operation is employed, and necessary conditions are derived for the optimal transmit design under general fading conditions. Based on this, we introduce an iterative algorithm to maximize the linear assignment weighted sum-rate by applying a gradient descent method. To reduce complexity, we derive an upper bound of the linear assignment achievable rate of each receiver, from which a simplified closed-form expression for a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7623","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-18T01:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+iXF37MmmQVMgh28oAd7wQxleZv4c1i4XZW7TCHcc1Dtz7sQS5gqtWIkSDyICOr/Z/hc7GKcSSzCRyL0ay+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:07:05.748951Z"},"content_sha256":"b091abcfea91c4764bfd978263fc38e6843154aec2101cbc08e4a8086b1ce087","schema_version":"1.0","event_id":"sha256:b091abcfea91c4764bfd978263fc38e6843154aec2101cbc08e4a8086b1ce087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAZMOOSTWI3FFUBS4DGVNXWSUX/bundle.json","state_url":"https://pith.science/pith/FAZMOOSTWI3FFUBS4DGVNXWSUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAZMOOSTWI3FFUBS4DGVNXWSUX/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-08T19:07:05Z","links":{"resolver":"https://pith.science/pith/FAZMOOSTWI3FFUBS4DGVNXWSUX","bundle":"https://pith.science/pith/FAZMOOSTWI3FFUBS4DGVNXWSUX/bundle.json","state":"https://pith.science/pith/FAZMOOSTWI3FFUBS4DGVNXWSUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAZMOOSTWI3FFUBS4DGVNXWSUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FAZMOOSTWI3FFUBS4DGVNXWSUX","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":"d4984ac84399de9929cc1d196b2463b7160bce86df3c95c53d686e6390d6916e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T07:38:24Z","title_canon_sha256":"699b50f499720613e605e84290b80c54ea24b465f7935ad535d16c37d3b317ba"},"schema_version":"1.0","source":{"id":"1406.7623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7623","created_at":"2026-05-18T01:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7623v1","created_at":"2026-05-18T01:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7623","created_at":"2026-05-18T01:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"FAZMOOSTWI3F","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FAZMOOSTWI3FFUBS","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FAZMOOST","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:b091abcfea91c4764bfd978263fc38e6843154aec2101cbc08e4a8086b1ce087","target":"graph","created_at":"2026-05-18T01:42:45Z","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":"We investigate the multiple-input multiple-output broadcast channel with statistical channel state information available at the transmitter. The so-called linear assignment operation is employed, and necessary conditions are derived for the optimal transmit design under general fading conditions. Based on this, we introduce an iterative algorithm to maximize the linear assignment weighted sum-rate by applying a gradient descent method. To reduce complexity, we derive an upper bound of the linear assignment achievable rate of each receiver, from which a simplified closed-form expression for a n","authors_text":"Chengshan Xiao, Matthew R. McKay, Shi Jin, Xiqi Gao, Yongpeng Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T07:38:24Z","title":"Transmit Designs for the MIMO Broadcast Channel with Statistical CSI"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7623","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:ebf5abebe87a70be85c903f7a52ad50b84c99514ee82e5ba768c4ef0d796cf0d","target":"record","created_at":"2026-05-18T01:42:45Z","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":"d4984ac84399de9929cc1d196b2463b7160bce86df3c95c53d686e6390d6916e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T07:38:24Z","title_canon_sha256":"699b50f499720613e605e84290b80c54ea24b465f7935ad535d16c37d3b317ba"},"schema_version":"1.0","source":{"id":"1406.7623","kind":"arxiv","version":1}},"canonical_sha256":"2832c73a53b23652d032e0cd56ded2a5febe85320b1b7cb75205764530419155","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2832c73a53b23652d032e0cd56ded2a5febe85320b1b7cb75205764530419155","first_computed_at":"2026-05-18T01:42:45.284926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:45.284926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zMzEWSu0ifk+DIJlNLQ/TxBkQMgW+wN0Nmp0qSIJdXX30LsB/5FWyxZtj76dzE3Sgs3QPpDqHoJGfHQm3wVoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:45.285648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebf5abebe87a70be85c903f7a52ad50b84c99514ee82e5ba768c4ef0d796cf0d","sha256:b091abcfea91c4764bfd978263fc38e6843154aec2101cbc08e4a8086b1ce087"],"state_sha256":"80763971e4df3c0c3df99d987693e574df1086f708626030763b1ac9de08e72a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJAw/qMKAmK91bbMOoTaIYwdeTo7eTWhdSb4tXw3WOYyrh2XKDJF1bBkminNsAkUvEyUGTSfsApPt17TY6/8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:07:05.752828Z","bundle_sha256":"7ed3b68398dbea9d8f251138305ca1652b1d71d74556c5026937728d3c05a92f"}}