{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CFQ6PFKFI6MNTQ67B5QQ6R373H","short_pith_number":"pith:CFQ6PFKF","canonical_record":{"source":{"id":"1309.3808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T00:14:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5a17f220bc2b51db30c29b474a278ff4cc3fde515c5189d0260db77aeb9f89a","abstract_canon_sha256":"7c5b5056d6a02080f99e968977772ef79f08335fdafcf397ae9fe48d58ac2bd7"},"schema_version":"1.0"},"canonical_sha256":"1161e795454798d9c3df0f610f477fd9d54d5e4418e7aacc1ddcd62503a8ab43","source":{"kind":"arxiv","id":"1309.3808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3808","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3808v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3808","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"CFQ6PFKFI6MN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CFQ6PFKFI6MNTQ67","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CFQ6PFKF","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CFQ6PFKFI6MNTQ67B5QQ6R373H","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T00:14:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e5a17f220bc2b51db30c29b474a278ff4cc3fde515c5189d0260db77aeb9f89a","abstract_canon_sha256":"7c5b5056d6a02080f99e968977772ef79f08335fdafcf397ae9fe48d58ac2bd7"},"schema_version":"1.0"},"canonical_sha256":"1161e795454798d9c3df0f610f477fd9d54d5e4418e7aacc1ddcd62503a8ab43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.999029Z","signature_b64":"aJ6tXXtVfiq1dptNl3jF/U2VKXQeCtvyPZdxo6SIZEpFcMTFf7nR80eHS5SXlYWd3lGXV6GSRL4Nti1v4gW2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1161e795454798d9c3df0f610f477fd9d54d5e4418e7aacc1ddcd62503a8ab43","last_reissued_at":"2026-05-18T00:58:41.998436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.998436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3808","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H516Q9bxz1eiV8DRJcEc3ruz8r8CsKs+5idZjW7a6iDxjREWNNiNLjS3D2/1tidBcagWbzG+RC3Ekr2r9EhgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:34:24.925903Z"},"content_sha256":"18d31a33335941ebaf9fa33f8930b4c03f50120e9a42ae137590565822eb2bbc","schema_version":"1.0","event_id":"sha256:18d31a33335941ebaf9fa33f8930b4c03f50120e9a42ae137590565822eb2bbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CFQ6PFKFI6MNTQ67B5QQ6R373H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Design of Generalized Block Diagonalization Precoding Algorithms for Multiuser MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. Zu, M. Haardt, R. C. de Lamare","submitted_at":"2013-09-16T00:14:28Z","abstract_excerpt":"Block diagonalization (BD) based precoding techniques are well-known linear transmit strategies for multiuser MIMO (MU-MIMO) systems. By employing BD-type precoding algorithms at the transmit side, the MU-MIMO broadcast channel is decomposed into multiple independent parallel single user MIMO (SU-MIMO) channels and achieves the maximum diversity order at high data rates. The main computational complexity of BD-type precoding algorithms comes from two singular value decomposition (SVD) operations, which depend on the number of users and the dimensions of each user's channel matrix. In this work"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3808","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:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KVqMjbxe6Ha83VnYP5Xii/11RwyO2IS8URGFZlP7QpK4bbhdxA/wFUvvQQmO+kDRD+c+Yt3eiB6a9Oo3+nFNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:34:24.926613Z"},"content_sha256":"dd37a3e7e21ea764bc46ee97424b5bd1b5a89cf0c6f4c370feb821ca29549538","schema_version":"1.0","event_id":"sha256:dd37a3e7e21ea764bc46ee97424b5bd1b5a89cf0c6f4c370feb821ca29549538"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFQ6PFKFI6MNTQ67B5QQ6R373H/bundle.json","state_url":"https://pith.science/pith/CFQ6PFKFI6MNTQ67B5QQ6R373H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFQ6PFKFI6MNTQ67B5QQ6R373H/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-09T10:34:24Z","links":{"resolver":"https://pith.science/pith/CFQ6PFKFI6MNTQ67B5QQ6R373H","bundle":"https://pith.science/pith/CFQ6PFKFI6MNTQ67B5QQ6R373H/bundle.json","state":"https://pith.science/pith/CFQ6PFKFI6MNTQ67B5QQ6R373H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFQ6PFKFI6MNTQ67B5QQ6R373H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CFQ6PFKFI6MNTQ67B5QQ6R373H","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":"7c5b5056d6a02080f99e968977772ef79f08335fdafcf397ae9fe48d58ac2bd7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T00:14:28Z","title_canon_sha256":"e5a17f220bc2b51db30c29b474a278ff4cc3fde515c5189d0260db77aeb9f89a"},"schema_version":"1.0","source":{"id":"1309.3808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3808","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3808v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3808","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"CFQ6PFKFI6MN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CFQ6PFKFI6MNTQ67","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CFQ6PFKF","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:dd37a3e7e21ea764bc46ee97424b5bd1b5a89cf0c6f4c370feb821ca29549538","target":"graph","created_at":"2026-05-18T00:58:41Z","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":"Block diagonalization (BD) based precoding techniques are well-known linear transmit strategies for multiuser MIMO (MU-MIMO) systems. By employing BD-type precoding algorithms at the transmit side, the MU-MIMO broadcast channel is decomposed into multiple independent parallel single user MIMO (SU-MIMO) channels and achieves the maximum diversity order at high data rates. The main computational complexity of BD-type precoding algorithms comes from two singular value decomposition (SVD) operations, which depend on the number of users and the dimensions of each user's channel matrix. In this work","authors_text":"K. Zu, M. Haardt, R. C. de Lamare","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T00:14:28Z","title":"Low-Complexity Design of Generalized Block Diagonalization Precoding Algorithms for Multiuser MIMO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3808","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:18d31a33335941ebaf9fa33f8930b4c03f50120e9a42ae137590565822eb2bbc","target":"record","created_at":"2026-05-18T00:58:41Z","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":"7c5b5056d6a02080f99e968977772ef79f08335fdafcf397ae9fe48d58ac2bd7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T00:14:28Z","title_canon_sha256":"e5a17f220bc2b51db30c29b474a278ff4cc3fde515c5189d0260db77aeb9f89a"},"schema_version":"1.0","source":{"id":"1309.3808","kind":"arxiv","version":1}},"canonical_sha256":"1161e795454798d9c3df0f610f477fd9d54d5e4418e7aacc1ddcd62503a8ab43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1161e795454798d9c3df0f610f477fd9d54d5e4418e7aacc1ddcd62503a8ab43","first_computed_at":"2026-05-18T00:58:41.998436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.998436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aJ6tXXtVfiq1dptNl3jF/U2VKXQeCtvyPZdxo6SIZEpFcMTFf7nR80eHS5SXlYWd3lGXV6GSRL4Nti1v4gW2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.999029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18d31a33335941ebaf9fa33f8930b4c03f50120e9a42ae137590565822eb2bbc","sha256:dd37a3e7e21ea764bc46ee97424b5bd1b5a89cf0c6f4c370feb821ca29549538"],"state_sha256":"cc979e4f33c247c9324870d7e662941b0e02885e4d127346df80a26d8d3417c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LM0NLYpT30aDK5PX3wmbfKgmzoiK5W9+Eyp2NRR16ysWuEXPC6N9z98Od69PLEPpr9QXGNTZBSSDvmQdVNb8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:34:24.930694Z","bundle_sha256":"43f9470c1fbf9a0264891be8d6e465f8e6dc67192b2e966d5884d412b886f9bc"}}