{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2PTOLPVBGEOAE5DXRBM2OEP43H","short_pith_number":"pith:2PTOLPVB","schema_version":"1.0","canonical_sha256":"d3e6e5bea1311c0274778859a711fcd9fda2ee2cc04b5548678a7bf125914daa","source":{"kind":"arxiv","id":"2605.18368","version":1},"attestation_state":"computed","paper":{"title":"Baseband-Efficient WMMSE Precoding: From a Signal Weighting Cost Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Sparse row-sparse precoding architectures within the WMMSE framework reduce signal weighting operations in MU-MIMO while preserving near-optimal sum rate via a proven low-dimensional subspace property.","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Fan Xu, Lei Qiu, Mian Li, Qingjiang Shi, Shuai Gao, Xinzhi Ning, Ye Yang","submitted_at":"2026-05-18T13:18:30Z","abstract_excerpt":"For downlink transmission in massive multi-user multiple-input multiple-output (MU-MIMO) systems, conventional precoding research heavily focuses on reducing the computational complexity of precoding matrix design, while largely overlooking another critical bottleneck: the substantial signal weighting cost incurred by repeatedly applying the precoder to high-speed data streams. To address both challenges simultaneously, this paper proposes a novel sparse precoding framework tailored for fully-digital architectures. Within this framework, from the sum-rate maximization perspective, we design tw"},"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":"2605.18368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T13:18:30Z","cross_cats_sorted":[],"title_canon_sha256":"316be2f933222a1b6b9ad85af99c3e7f3fb26ebecadec9e06c0f3b43589f9cf5","abstract_canon_sha256":"c1aa0a2b12a8721cf6f116ffd73119685ac5212610bae763ede2c53d3c5238a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:57.592882Z","signature_b64":"7OVL6pCjUb5OkMAjR6VTM/BqzeoQzfScTnT6ofxMxuDGeOy0o1bcZGC2x4pD4kh2fc1UOAlauKS657F8zKCwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3e6e5bea1311c0274778859a711fcd9fda2ee2cc04b5548678a7bf125914daa","last_reissued_at":"2026-05-20T00:05:57.591939Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:57.591939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Baseband-Efficient WMMSE Precoding: From a Signal Weighting Cost Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Sparse row-sparse precoding architectures within the WMMSE framework reduce signal weighting operations in MU-MIMO while preserving near-optimal sum rate via a proven low-dimensional subspace property.","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Fan Xu, Lei Qiu, Mian Li, Qingjiang Shi, Shuai Gao, Xinzhi Ning, Ye Yang","submitted_at":"2026-05-18T13:18:30Z","abstract_excerpt":"For downlink transmission in massive multi-user multiple-input multiple-output (MU-MIMO) systems, conventional precoding research heavily focuses on reducing the computational complexity of precoding matrix design, while largely overlooking another critical bottleneck: the substantial signal weighting cost incurred by repeatedly applying the precoder to high-speed data streams. To address both challenges simultaneously, this paper proposes a novel sparse precoding framework tailored for fully-digital architectures. Within this framework, from the sum-rate maximization perspective, we design tw"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"We rigorously prove, for the first time, that the optimal precoder under both sparse architectures strictly resides in a specific low-dimensional subspace determined by the channel matrices, thereby reducing the dimensionality of the optimization variables.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that the mixed-integer non-linear program remains tractable and that the alternating optimization with penalty-based MM converges to a solution whose sum-rate loss is negligible when the subspace reduction is applied; this is invoked in the transition from the MINLP formulation to the WMMSE alternating algorithm.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Sparse row-sparse precoding architectures within the WMMSE framework reduce signal weighting operations in MU-MIMO while preserving near-optimal sum rate via a proven low-dimensional subspace property.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"fb7a01f8c253bbf3800e2828de88f480d966eac9f2fdb249c7540eecbe3a21ff"},"source":{"id":"2605.18368","kind":"arxiv","version":1},"verdict":{"id":"5a7dcdfd-e52e-4869-b4d2-dd0578346f73","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-20T00:03:35.875413Z","strongest_claim":"We rigorously prove, for the first time, that the optimal precoder under both sparse architectures strictly resides in a specific low-dimensional subspace determined by the channel matrices, thereby reducing the dimensionality of the optimization variables.","one_line_summary":"Sparse row-sparse precoding architectures within the WMMSE framework reduce signal weighting operations in MU-MIMO while preserving near-optimal sum rate via a proven low-dimensional subspace property.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that the mixed-integer non-linear program remains tractable and that the alternating optimization with penalty-based MM converges to a solution whose sum-rate loss is negligible when the subspace reduction is applied; this is invoked in the transition from the MINLP formulation to the WMMSE alternating algorithm.","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18368/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"citation_quote_validity","ran_at":"2026-05-19T23:50:06.522975Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:30.010993Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T23:31:49.568875Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.780537Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"74461bcf57aff95832c23a82ce9b4824062494fd5c4ca0644d69c7d29401294c"},"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":"2605.18368","created_at":"2026-05-20T00:05:57.592118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18368v1","created_at":"2026-05-20T00:05:57.592118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18368","created_at":"2026-05-20T00:05:57.592118+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PTOLPVBGEOA","created_at":"2026-05-20T00:05:57.592118+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PTOLPVBGEOAE5DX","created_at":"2026-05-20T00:05:57.592118+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PTOLPVB","created_at":"2026-05-20T00:05:57.592118+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/2PTOLPVBGEOAE5DXRBM2OEP43H","json":"https://pith.science/pith/2PTOLPVBGEOAE5DXRBM2OEP43H.json","graph_json":"https://pith.science/api/pith-number/2PTOLPVBGEOAE5DXRBM2OEP43H/graph.json","events_json":"https://pith.science/api/pith-number/2PTOLPVBGEOAE5DXRBM2OEP43H/events.json","paper":"https://pith.science/paper/2PTOLPVB"},"agent_actions":{"view_html":"https://pith.science/pith/2PTOLPVBGEOAE5DXRBM2OEP43H","download_json":"https://pith.science/pith/2PTOLPVBGEOAE5DXRBM2OEP43H.json","view_paper":"https://pith.science/paper/2PTOLPVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18368&json=true","fetch_graph":"https://pith.science/api/pith-number/2PTOLPVBGEOAE5DXRBM2OEP43H/graph.json","fetch_events":"https://pith.science/api/pith-number/2PTOLPVBGEOAE5DXRBM2OEP43H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PTOLPVBGEOAE5DXRBM2OEP43H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PTOLPVBGEOAE5DXRBM2OEP43H/action/storage_attestation","attest_author":"https://pith.science/pith/2PTOLPVBGEOAE5DXRBM2OEP43H/action/author_attestation","sign_citation":"https://pith.science/pith/2PTOLPVBGEOAE5DXRBM2OEP43H/action/citation_signature","submit_replication":"https://pith.science/pith/2PTOLPVBGEOAE5DXRBM2OEP43H/action/replication_record"}},"created_at":"2026-05-20T00:05:57.592118+00:00","updated_at":"2026-05-20T00:05:57.592118+00:00"}