{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TJ6NPZQA2J6FN2NCDY7MPGOZJ5","short_pith_number":"pith:TJ6NPZQA","canonical_record":{"source":{"id":"1606.03380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-10T16:03:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3227309c720e1d43e97ea12ff6ea6545c5f791e6bf1ccc8f02e82198a10500a2","abstract_canon_sha256":"1168f4c35d76033b8c0b636ab069b6454f2e947a07344e21db21f72247afe0e8"},"schema_version":"1.0"},"canonical_sha256":"9a7cd7e600d27c56e9a21e3ec799d94f4a7174a1256e1a18810e835865d61458","source":{"kind":"arxiv","id":"1606.03380","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03380","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03380v2","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03380","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"pith_short_12","alias_value":"TJ6NPZQA2J6F","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TJ6NPZQA2J6FN2NC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TJ6NPZQA","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TJ6NPZQA2J6FN2NCDY7MPGOZJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-10T16:03:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3227309c720e1d43e97ea12ff6ea6545c5f791e6bf1ccc8f02e82198a10500a2","abstract_canon_sha256":"1168f4c35d76033b8c0b636ab069b6454f2e947a07344e21db21f72247afe0e8"},"schema_version":"1.0"},"canonical_sha256":"9a7cd7e600d27c56e9a21e3ec799d94f4a7174a1256e1a18810e835865d61458","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:20.978446Z","signature_b64":"k4sxzQz0Gx54X5/cErul5c1dCDSktzq7yiCJvxIALDoqrSpROst95jLNeYdsybuKNR+pfDlK675D5PdT8TYmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a7cd7e600d27c56e9a21e3ec799d94f4a7174a1256e1a18810e835865d61458","last_reissued_at":"2026-05-18T00:46:20.977866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:20.977866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03380","source_version":2,"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:46:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v77gNMtOmONlx2EDjidd4G0h0zAqjG3FZb6yL52iVKL0ykfLdx5gCaRlG+8aG4nqPmGNMSehI6UuUNI19IWjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:29:50.090608Z"},"content_sha256":"d613eaf0512a22718e184afe05145611fa94399c220b6da6e38e0bb3324fa3a8","schema_version":"1.0","event_id":"sha256:d613eaf0512a22718e184afe05145611fa94399c220b6da6e38e0bb3324fa3a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TJ6NPZQA2J6FN2NCDY7MPGOZJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity MIMO Precoding for Finite-Alphabet Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Angel Lozano, Chao-Kai Wen, Derrick Wing Kwan Ng, Robert Schober, Yongpeng Wu","submitted_at":"2016-06-10T16:03:56Z","abstract_excerpt":"This paper investigates the design of precoders for single-user multiple-input multiple-output (MIMO) channels, and in particular for finite-alphabet signals. Based on an asymptotic expression for the mutual information of channels exhibiting line-of-sight components and rather general antenna correlations, precoding structures that decompose the general channel into a set of parallel subchannel pairs are proposed. Then, a low-complexity iterative algorithm is devised to maximize the sum mutual information of all pairs. The proposed algorithm significantly reduces the computational load of exi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03380","kind":"arxiv","version":2},"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:46:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qG3C+4gTymVsmKsb/qXrhx7NRwNq3zignOLN+w4+CQ3Y1lPgYX63ZLxDxtnkzKKp7D4yKuoh5F7DN3uk3dbwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:29:50.091227Z"},"content_sha256":"a336a9c6800853d824bcc03d154f8573d085fa58717c5a0bcaf08d128c50f500","schema_version":"1.0","event_id":"sha256:a336a9c6800853d824bcc03d154f8573d085fa58717c5a0bcaf08d128c50f500"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJ6NPZQA2J6FN2NCDY7MPGOZJ5/bundle.json","state_url":"https://pith.science/pith/TJ6NPZQA2J6FN2NCDY7MPGOZJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJ6NPZQA2J6FN2NCDY7MPGOZJ5/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-30T19:29:50Z","links":{"resolver":"https://pith.science/pith/TJ6NPZQA2J6FN2NCDY7MPGOZJ5","bundle":"https://pith.science/pith/TJ6NPZQA2J6FN2NCDY7MPGOZJ5/bundle.json","state":"https://pith.science/pith/TJ6NPZQA2J6FN2NCDY7MPGOZJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJ6NPZQA2J6FN2NCDY7MPGOZJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TJ6NPZQA2J6FN2NCDY7MPGOZJ5","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":"1168f4c35d76033b8c0b636ab069b6454f2e947a07344e21db21f72247afe0e8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-10T16:03:56Z","title_canon_sha256":"3227309c720e1d43e97ea12ff6ea6545c5f791e6bf1ccc8f02e82198a10500a2"},"schema_version":"1.0","source":{"id":"1606.03380","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03380","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03380v2","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03380","created_at":"2026-05-18T00:46:20Z"},{"alias_kind":"pith_short_12","alias_value":"TJ6NPZQA2J6F","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TJ6NPZQA2J6FN2NC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TJ6NPZQA","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:a336a9c6800853d824bcc03d154f8573d085fa58717c5a0bcaf08d128c50f500","target":"graph","created_at":"2026-05-18T00:46:20Z","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":"This paper investigates the design of precoders for single-user multiple-input multiple-output (MIMO) channels, and in particular for finite-alphabet signals. Based on an asymptotic expression for the mutual information of channels exhibiting line-of-sight components and rather general antenna correlations, precoding structures that decompose the general channel into a set of parallel subchannel pairs are proposed. Then, a low-complexity iterative algorithm is devised to maximize the sum mutual information of all pairs. The proposed algorithm significantly reduces the computational load of exi","authors_text":"Angel Lozano, Chao-Kai Wen, Derrick Wing Kwan Ng, Robert Schober, Yongpeng Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-10T16:03:56Z","title":"Low-Complexity MIMO Precoding for Finite-Alphabet Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03380","kind":"arxiv","version":2},"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:d613eaf0512a22718e184afe05145611fa94399c220b6da6e38e0bb3324fa3a8","target":"record","created_at":"2026-05-18T00:46:20Z","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":"1168f4c35d76033b8c0b636ab069b6454f2e947a07344e21db21f72247afe0e8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-10T16:03:56Z","title_canon_sha256":"3227309c720e1d43e97ea12ff6ea6545c5f791e6bf1ccc8f02e82198a10500a2"},"schema_version":"1.0","source":{"id":"1606.03380","kind":"arxiv","version":2}},"canonical_sha256":"9a7cd7e600d27c56e9a21e3ec799d94f4a7174a1256e1a18810e835865d61458","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a7cd7e600d27c56e9a21e3ec799d94f4a7174a1256e1a18810e835865d61458","first_computed_at":"2026-05-18T00:46:20.977866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:20.977866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k4sxzQz0Gx54X5/cErul5c1dCDSktzq7yiCJvxIALDoqrSpROst95jLNeYdsybuKNR+pfDlK675D5PdT8TYmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:20.978446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03380","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d613eaf0512a22718e184afe05145611fa94399c220b6da6e38e0bb3324fa3a8","sha256:a336a9c6800853d824bcc03d154f8573d085fa58717c5a0bcaf08d128c50f500"],"state_sha256":"41079780e0eeaaa16442d180a6a7c3127b32e6b58f417c0dc9935c60ddad8d5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rn9Rf2A7OaWXgi9T/qF81XlDiG23mpVeL9XaYUrdm/MjBQrZlfFur/ea/oA/obUy2CinLQyHmsVeSb1TCqK6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:29:50.094112Z","bundle_sha256":"859b5e2fe4b1ecbe0052020578d49c6e277511b6d6d2ba9a68ff99bab1dacc7b"}}