{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2PTOLPVBGEOAE5DXRBM2OEP43H","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":"c1aa0a2b12a8721cf6f116ffd73119685ac5212610bae763ede2c53d3c5238a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T13:18:30Z","title_canon_sha256":"316be2f933222a1b6b9ad85af99c3e7f3fb26ebecadec9e06c0f3b43589f9cf5"},"schema_version":"1.0","source":{"id":"2605.18368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18368","created_at":"2026-05-20T00:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18368v1","created_at":"2026-05-20T00:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18368","created_at":"2026-05-20T00:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"2PTOLPVBGEOA","created_at":"2026-05-20T00:05:57Z"},{"alias_kind":"pith_short_16","alias_value":"2PTOLPVBGEOAE5DX","created_at":"2026-05-20T00:05:57Z"},{"alias_kind":"pith_short_8","alias_value":"2PTOLPVB","created_at":"2026-05-20T00:05:57Z"}],"graph_snapshots":[{"event_id":"sha256:fb81d43a0652ab6886e9ce1ad1e281fcf1beddc55502a2d63622a98d95cae81f","target":"graph","created_at":"2026-05-20T00:05:57Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."}],"snapshot_sha256":"fb7a01f8c253bbf3800e2828de88f480d966eac9f2fdb249c7540eecbe3a21ff"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.18368/integrity.json","findings":[],"snapshot_sha256":"74461bcf57aff95832c23a82ce9b4824062494fd5c4ca0644d69c7d29401294c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fan Xu, Lei Qiu, Mian Li, Qingjiang Shi, Shuai Gao, Xinzhi Ning, Ye Yang","cross_cats":[],"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.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T13:18:30Z","title":"Baseband-Efficient WMMSE Precoding: From a Signal Weighting Cost Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18368","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-20T00:03:35.875413Z","id":"5a7dcdfd-e52e-4869-b4d2-dd0578346f73","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"","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.","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."}},"verdict_id":"5a7dcdfd-e52e-4869-b4d2-dd0578346f73"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6df7314d706de193d70a01346c851e509bb1244066170c24795df0c4e432f397","target":"record","created_at":"2026-05-20T00:05:57Z","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":"c1aa0a2b12a8721cf6f116ffd73119685ac5212610bae763ede2c53d3c5238a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-18T13:18:30Z","title_canon_sha256":"316be2f933222a1b6b9ad85af99c3e7f3fb26ebecadec9e06c0f3b43589f9cf5"},"schema_version":"1.0","source":{"id":"2605.18368","kind":"arxiv","version":1}},"canonical_sha256":"d3e6e5bea1311c0274778859a711fcd9fda2ee2cc04b5548678a7bf125914daa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3e6e5bea1311c0274778859a711fcd9fda2ee2cc04b5548678a7bf125914daa","first_computed_at":"2026-05-20T00:05:57.591939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:57.591939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OVL6pCjUb5OkMAjR6VTM/BqzeoQzfScTnT6ofxMxuDGeOy0o1bcZGC2x4pD4kh2fc1UOAlauKS657F8zKCwCA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:57.592882Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6df7314d706de193d70a01346c851e509bb1244066170c24795df0c4e432f397","sha256:fb81d43a0652ab6886e9ce1ad1e281fcf1beddc55502a2d63622a98d95cae81f"],"state_sha256":"3002fb9b7de7bc835b9ef9b7fa03195a8ad0c63f07ed62bd2afc64967bf1d1a9"}