{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VPPQ3CQHO4EDAOLL2BNPOHGO6H","short_pith_number":"pith:VPPQ3CQH","canonical_record":{"source":{"id":"1304.6470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T03:00:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5df91d819768b1f8d7d7517a37ba2523ca216b08927b0b655a8030845cbcb53d","abstract_canon_sha256":"c69a3e24a685d4429b24a13b5b997f15a75a821d53169b9614f28e4bef96a7b1"},"schema_version":"1.0"},"canonical_sha256":"abdf0d8a07770830396bd05af71ccef1c0f85aba0079c895be8a8ec25ef7d979","source":{"kind":"arxiv","id":"1304.6470","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6470","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6470v1","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6470","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"VPPQ3CQHO4ED","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VPPQ3CQHO4EDAOLL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VPPQ3CQH","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VPPQ3CQHO4EDAOLL2BNPOHGO6H","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T03:00:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5df91d819768b1f8d7d7517a37ba2523ca216b08927b0b655a8030845cbcb53d","abstract_canon_sha256":"c69a3e24a685d4429b24a13b5b997f15a75a821d53169b9614f28e4bef96a7b1"},"schema_version":"1.0"},"canonical_sha256":"abdf0d8a07770830396bd05af71ccef1c0f85aba0079c895be8a8ec25ef7d979","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.010012Z","signature_b64":"HaRqx78N7ETbOBoNI3OcKHNNoftk64Bp8A5isI/sq1HKPmfjgijfy3WQGIcjsFn/QGlh/EhfjCzkHvGdiMHNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abdf0d8a07770830396bd05af71ccef1c0f85aba0079c895be8a8ec25ef7d979","last_reissued_at":"2026-05-18T03:27:13.009399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.009399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6470","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:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DolplQANJ1TZXDJSekhp6dwoSs8DKK0jQTWVxkj7KBGVR+D2ygeXfCyEwIVuHhODJukOpLgE+v1bammUZE/3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:40:07.421067Z"},"content_sha256":"5d5b49796a064be8ba040db7821f562f047aede0ba6a4157eaada22d7ff8846f","schema_version":"1.0","event_id":"sha256:5d5b49796a064be8ba040db7821f562f047aede0ba6a4157eaada22d7ff8846f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VPPQ3CQHO4EDAOLL2BNPOHGO6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Lattice Reduction-Aided Channel Inversion Methods for Large-Dimensional Multi-User MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Keke Zu, Martin Haardt, Rodrigo C. de Lamare","submitted_at":"2013-04-24T03:00:56Z","abstract_excerpt":"Low-complexity precoding {algorithms} are proposed in this work to reduce the computational complexity and improve the performance of regularized block diagonalization (RBD) {based} precoding {schemes} for large multi-user {MIMO} (MU-MIMO) systems. The proposed algorithms are based on a channel inversion technique, QR decompositions{,} and lattice reductions to decouple the MU-MIMO channel into equivalent SU-MIMO channels. Simulation results show that the proposed precoding algorithms can achieve almost the same sum-rate performance as RBD precoding, substantial bit error rate (BER) performanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6470","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:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+Puok2FZoBOucdLziBFhrF5Y6V2Rz4dI9xnOnFB4F5zQmw0Ix9imuuP2S6lm8eCqFSPx3kanvKzHrG6lsr5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:40:07.421459Z"},"content_sha256":"952f8b3ba159b8e7a24009002db61e11e1adcafd03f592320f343a6c1f3cc452","schema_version":"1.0","event_id":"sha256:952f8b3ba159b8e7a24009002db61e11e1adcafd03f592320f343a6c1f3cc452"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPPQ3CQHO4EDAOLL2BNPOHGO6H/bundle.json","state_url":"https://pith.science/pith/VPPQ3CQHO4EDAOLL2BNPOHGO6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPPQ3CQHO4EDAOLL2BNPOHGO6H/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-09T16:40:07Z","links":{"resolver":"https://pith.science/pith/VPPQ3CQHO4EDAOLL2BNPOHGO6H","bundle":"https://pith.science/pith/VPPQ3CQHO4EDAOLL2BNPOHGO6H/bundle.json","state":"https://pith.science/pith/VPPQ3CQHO4EDAOLL2BNPOHGO6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPPQ3CQHO4EDAOLL2BNPOHGO6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VPPQ3CQHO4EDAOLL2BNPOHGO6H","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":"c69a3e24a685d4429b24a13b5b997f15a75a821d53169b9614f28e4bef96a7b1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T03:00:56Z","title_canon_sha256":"5df91d819768b1f8d7d7517a37ba2523ca216b08927b0b655a8030845cbcb53d"},"schema_version":"1.0","source":{"id":"1304.6470","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6470","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6470v1","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6470","created_at":"2026-05-18T03:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"VPPQ3CQHO4ED","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VPPQ3CQHO4EDAOLL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VPPQ3CQH","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:952f8b3ba159b8e7a24009002db61e11e1adcafd03f592320f343a6c1f3cc452","target":"graph","created_at":"2026-05-18T03:27:13Z","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":"Low-complexity precoding {algorithms} are proposed in this work to reduce the computational complexity and improve the performance of regularized block diagonalization (RBD) {based} precoding {schemes} for large multi-user {MIMO} (MU-MIMO) systems. The proposed algorithms are based on a channel inversion technique, QR decompositions{,} and lattice reductions to decouple the MU-MIMO channel into equivalent SU-MIMO channels. Simulation results show that the proposed precoding algorithms can achieve almost the same sum-rate performance as RBD precoding, substantial bit error rate (BER) performanc","authors_text":"Keke Zu, Martin Haardt, Rodrigo C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T03:00:56Z","title":"Low-Complexity Lattice Reduction-Aided Channel Inversion Methods for Large-Dimensional Multi-User MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6470","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:5d5b49796a064be8ba040db7821f562f047aede0ba6a4157eaada22d7ff8846f","target":"record","created_at":"2026-05-18T03:27:13Z","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":"c69a3e24a685d4429b24a13b5b997f15a75a821d53169b9614f28e4bef96a7b1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-24T03:00:56Z","title_canon_sha256":"5df91d819768b1f8d7d7517a37ba2523ca216b08927b0b655a8030845cbcb53d"},"schema_version":"1.0","source":{"id":"1304.6470","kind":"arxiv","version":1}},"canonical_sha256":"abdf0d8a07770830396bd05af71ccef1c0f85aba0079c895be8a8ec25ef7d979","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abdf0d8a07770830396bd05af71ccef1c0f85aba0079c895be8a8ec25ef7d979","first_computed_at":"2026-05-18T03:27:13.009399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:13.009399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HaRqx78N7ETbOBoNI3OcKHNNoftk64Bp8A5isI/sq1HKPmfjgijfy3WQGIcjsFn/QGlh/EhfjCzkHvGdiMHNAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:13.010012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6470","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d5b49796a064be8ba040db7821f562f047aede0ba6a4157eaada22d7ff8846f","sha256:952f8b3ba159b8e7a24009002db61e11e1adcafd03f592320f343a6c1f3cc452"],"state_sha256":"37162c36fbafdc92d59c084c9d63f018eac0084e120ff997027ee1e5290e82b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5sESrsDDTYYd0cYfJDhd7L9RWgesytg1hzNjF+b5y2i64POFabsHDAmVbRvoyV0LM8WBX2e9Cix7Q+Ir384Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:40:07.424031Z","bundle_sha256":"094716654d8c2c73ec8f45da38c0a9ede806f65de871ce1296d8044aff893a58"}}