{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HDVQ3RMGNCUFXYYQAVBLDLCKXV","short_pith_number":"pith:HDVQ3RMG","schema_version":"1.0","canonical_sha256":"38eb0dc58668a85be3100542b1ac4abd4851d81d00cd12cf2749aef486884eed","source":{"kind":"arxiv","id":"1411.4141","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Linear Precoding with Low Complexity for Massive MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Lin I, Linglong Dai, Shuangfeng Han, Xinyu Gao, Zhaocheng Wang","submitted_at":"2014-11-15T12:59:02Z","abstract_excerpt":"Linear precoding techniques can achieve near- optimal capacity due to the special channel property in down- link massive MIMO systems, but involve high complexity since complicated matrix inversion of large size is required. In this paper, we propose a low-complexity linear precoding scheme based on the Gauss-Seidel (GS) method. The proposed scheme can achieve the capacity-approaching performance of the classical linear precoding schemes in an iterative way without complicated matrix inversion, which can reduce the overall complexity by one order of magnitude. The performance guarantee of the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1411.4141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-15T12:59:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fc6102be3dd178818eccc0fcd496b872aecaedcf0020d06dbb74975c2145af62","abstract_canon_sha256":"6fcd5bac82a911641002e7dcf1999471bea3e7503266f4631555301e275a51e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.408567Z","signature_b64":"HhH25cW8VTP/zckdLLfECVU+RmSwJaCSJNCuT/2CW0NobD/iFiAeAl8StJW9CoeIPFx1aaDhQY30lEAPIoeyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38eb0dc58668a85be3100542b1ac4abd4851d81d00cd12cf2749aef486884eed","last_reissued_at":"2026-05-18T02:35:46.408049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.408049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Linear Precoding with Low Complexity for Massive MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chih-Lin I, Linglong Dai, Shuangfeng Han, Xinyu Gao, Zhaocheng Wang","submitted_at":"2014-11-15T12:59:02Z","abstract_excerpt":"Linear precoding techniques can achieve near- optimal capacity due to the special channel property in down- link massive MIMO systems, but involve high complexity since complicated matrix inversion of large size is required. In this paper, we propose a low-complexity linear precoding scheme based on the Gauss-Seidel (GS) method. The proposed scheme can achieve the capacity-approaching performance of the classical linear precoding schemes in an iterative way without complicated matrix inversion, which can reduce the overall complexity by one order of magnitude. The performance guarantee of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4141","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.4141","created_at":"2026-05-18T02:35:46.408125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4141v1","created_at":"2026-05-18T02:35:46.408125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4141","created_at":"2026-05-18T02:35:46.408125+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDVQ3RMGNCUF","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDVQ3RMGNCUFXYYQ","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDVQ3RMG","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV","json":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV.json","graph_json":"https://pith.science/api/pith-number/HDVQ3RMGNCUFXYYQAVBLDLCKXV/graph.json","events_json":"https://pith.science/api/pith-number/HDVQ3RMGNCUFXYYQAVBLDLCKXV/events.json","paper":"https://pith.science/paper/HDVQ3RMG"},"agent_actions":{"view_html":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV","download_json":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV.json","view_paper":"https://pith.science/paper/HDVQ3RMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4141&json=true","fetch_graph":"https://pith.science/api/pith-number/HDVQ3RMGNCUFXYYQAVBLDLCKXV/graph.json","fetch_events":"https://pith.science/api/pith-number/HDVQ3RMGNCUFXYYQAVBLDLCKXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV/action/storage_attestation","attest_author":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV/action/author_attestation","sign_citation":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV/action/citation_signature","submit_replication":"https://pith.science/pith/HDVQ3RMGNCUFXYYQAVBLDLCKXV/action/replication_record"}},"created_at":"2026-05-18T02:35:46.408125+00:00","updated_at":"2026-05-18T02:35:46.408125+00:00"}