{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QEVNSANIALVSF3MB4GEAF6NGOO","short_pith_number":"pith:QEVNSANI","canonical_record":{"source":{"id":"1603.06616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T21:13:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0fd774743fd6fa62c25814cefc77ed0663d67345ffaaade4b8b6313c3eb7cee7","abstract_canon_sha256":"48a413ea39c08e85ecf93fb7169d1a9f7e254a48201d3f4cb0d70596a9924374"},"schema_version":"1.0"},"canonical_sha256":"812ad901a802eb22ed81e18802f9a673a6b09f3a37133a651260cd4c354be309","source":{"kind":"arxiv","id":"1603.06616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06616","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06616v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06616","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"QEVNSANIALVS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QEVNSANIALVSF3MB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QEVNSANI","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QEVNSANIALVSF3MB4GEAF6NGOO","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T21:13:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0fd774743fd6fa62c25814cefc77ed0663d67345ffaaade4b8b6313c3eb7cee7","abstract_canon_sha256":"48a413ea39c08e85ecf93fb7169d1a9f7e254a48201d3f4cb0d70596a9924374"},"schema_version":"1.0"},"canonical_sha256":"812ad901a802eb22ed81e18802f9a673a6b09f3a37133a651260cd4c354be309","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:09.539498Z","signature_b64":"tHxTuv6MCNE4h7C0ucchxNEhpCeDH3uQF/205VJNDhNhUtuJ8RVGGBSRVD+6qzVJh/dAkYrePq5G+8D+ta5LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"812ad901a802eb22ed81e18802f9a673a6b09f3a37133a651260cd4c354be309","last_reissued_at":"2026-05-18T00:58:09.538760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:09.538760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06616","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:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDseuVRmfuRQqSxgaqT4r/W0UXUzWqYn2+dhoMZDevUi5WsrgQFJXtD1xSlkUVlxlAi6joJrvXFmarowyJnZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:52:40.932547Z"},"content_sha256":"8ba3badac15da21e1e75e8a0dfbc59a15be0965fa212586164efd6a3b773fece","schema_version":"1.0","event_id":"sha256:8ba3badac15da21e1e75e8a0dfbc59a15be0965fa212586164efd6a3b773fece"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QEVNSANIALVSF3MB4GEAF6NGOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Channel Reconstruction for SVD-ZF Precoding in Massive 3D-MIMO Systems Low-Complexity Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Can Qi, Xin Su, Yingmin Wang, Yuwei Ren","submitted_at":"2016-03-21T21:13:55Z","abstract_excerpt":"In this paper, we study the low-complexity channel reconstruction methods for downlink precoding in massive MIMO systems. When the user is allocated less streams than the number of its antennas, the BS or user usually utilizes the singular value decomposition (SVD) factorizations to get the effective channels, whose dimension is equal to the num of streams. This process is called channel reconstruction in BS for TDD mode. However, with the increasing of antennas in BS, the computation burden of SVD is becoming incredibly high. As a countermeasure, we propose a series of novel low-complexity ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06616","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:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfxnDWUjvKdvrGqf1tD/Csp7fc3sl+ErjVELsAlklJ+NkGY82OjGrcvlqIg8NokUHidt8Io6Cuzma/1btHpCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:52:40.932896Z"},"content_sha256":"25a8fc83fc47f18ac1c6c703acac90aeb596af665c11d1b9ebefb103f1bd5a86","schema_version":"1.0","event_id":"sha256:25a8fc83fc47f18ac1c6c703acac90aeb596af665c11d1b9ebefb103f1bd5a86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEVNSANIALVSF3MB4GEAF6NGOO/bundle.json","state_url":"https://pith.science/pith/QEVNSANIALVSF3MB4GEAF6NGOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEVNSANIALVSF3MB4GEAF6NGOO/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-20T15:52:40Z","links":{"resolver":"https://pith.science/pith/QEVNSANIALVSF3MB4GEAF6NGOO","bundle":"https://pith.science/pith/QEVNSANIALVSF3MB4GEAF6NGOO/bundle.json","state":"https://pith.science/pith/QEVNSANIALVSF3MB4GEAF6NGOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEVNSANIALVSF3MB4GEAF6NGOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QEVNSANIALVSF3MB4GEAF6NGOO","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":"48a413ea39c08e85ecf93fb7169d1a9f7e254a48201d3f4cb0d70596a9924374","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T21:13:55Z","title_canon_sha256":"0fd774743fd6fa62c25814cefc77ed0663d67345ffaaade4b8b6313c3eb7cee7"},"schema_version":"1.0","source":{"id":"1603.06616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06616","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06616v1","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06616","created_at":"2026-05-18T00:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"QEVNSANIALVS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QEVNSANIALVSF3MB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QEVNSANI","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:25a8fc83fc47f18ac1c6c703acac90aeb596af665c11d1b9ebefb103f1bd5a86","target":"graph","created_at":"2026-05-18T00:58:09Z","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 study the low-complexity channel reconstruction methods for downlink precoding in massive MIMO systems. When the user is allocated less streams than the number of its antennas, the BS or user usually utilizes the singular value decomposition (SVD) factorizations to get the effective channels, whose dimension is equal to the num of streams. This process is called channel reconstruction in BS for TDD mode. However, with the increasing of antennas in BS, the computation burden of SVD is becoming incredibly high. As a countermeasure, we propose a series of novel low-complexity ch","authors_text":"Can Qi, Xin Su, Yingmin Wang, Yuwei Ren","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T21:13:55Z","title":"Channel Reconstruction for SVD-ZF Precoding in Massive 3D-MIMO Systems Low-Complexity Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06616","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:8ba3badac15da21e1e75e8a0dfbc59a15be0965fa212586164efd6a3b773fece","target":"record","created_at":"2026-05-18T00:58:09Z","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":"48a413ea39c08e85ecf93fb7169d1a9f7e254a48201d3f4cb0d70596a9924374","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T21:13:55Z","title_canon_sha256":"0fd774743fd6fa62c25814cefc77ed0663d67345ffaaade4b8b6313c3eb7cee7"},"schema_version":"1.0","source":{"id":"1603.06616","kind":"arxiv","version":1}},"canonical_sha256":"812ad901a802eb22ed81e18802f9a673a6b09f3a37133a651260cd4c354be309","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"812ad901a802eb22ed81e18802f9a673a6b09f3a37133a651260cd4c354be309","first_computed_at":"2026-05-18T00:58:09.538760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:09.538760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tHxTuv6MCNE4h7C0ucchxNEhpCeDH3uQF/205VJNDhNhUtuJ8RVGGBSRVD+6qzVJh/dAkYrePq5G+8D+ta5LAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:09.539498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ba3badac15da21e1e75e8a0dfbc59a15be0965fa212586164efd6a3b773fece","sha256:25a8fc83fc47f18ac1c6c703acac90aeb596af665c11d1b9ebefb103f1bd5a86"],"state_sha256":"432fa76116f64fc28ca7293c628f0ce375dca19ac4ba3329c63ce644c3352fff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"waT4AOGGQ+mstDMjg7opWKsl3Y3/1HPphPIi0VvVt/mNo2sHx50Gt5VaFNu2lGd9PajKns3N4AirzeHqv0KICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:52:40.934846Z","bundle_sha256":"baf5875a31de013b1fcec51b69d5b7ca38680784240545e01dcb916493478de4"}}