{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NMELDAKKL5XR2LCPBXRJDANTFB","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":"c549d7219716ae9e11afa397e2be690f2918e9c37a2975536e131495dec9b28a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-28T09:38:56Z","title_canon_sha256":"9b202faa419fc9e94dc6612f090f136a4d87555a330d0fa6bfb15e3b97ac65a9"},"schema_version":"1.0","source":{"id":"1601.07701","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07701","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07701v3","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07701","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"NMELDAKKL5XR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NMELDAKKL5XR2LCP","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NMELDAKK","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:29d959eebc42e1e520c159593b972014e4740e451d8d45b31891985fa46e00d6","target":"graph","created_at":"2026-05-18T00:58: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Massive spatial modulation (SM)-MIMO, which employs massive low-cost antennas but few power-hungry transmit radio frequency (RF) chains at the transmitter, is recently proposed to provide both high spectrum efficiency and energy efficiency for future green communications. However, in massive SM-MIMO, the optimal maximum likelihood (ML) detector has the prohibitively high complexity, while state-of-the-art low-complexity detectors for conventional small-scale SM-MIMO suffer from an obvious performance loss. In this paper, by exploiting the structured sparsity of multiple SM signals, we propose ","authors_text":"Chau Yuen, Chenhao Qi, Linglong Dai, Zhaocheng Wang, Zhen Gao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-28T09:38:56Z","title":"Near-Optimal Signal Detector Based on Structured Compressive Sensing for Massive SM-MIMO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07701","kind":"arxiv","version":3},"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:6fc2c7f1a0aaf4e72fc0f6996963cc2ba9675662e2f8c0b39a6ef912060c69c9","target":"record","created_at":"2026-05-18T00:58: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":"c549d7219716ae9e11afa397e2be690f2918e9c37a2975536e131495dec9b28a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-28T09:38:56Z","title_canon_sha256":"9b202faa419fc9e94dc6612f090f136a4d87555a330d0fa6bfb15e3b97ac65a9"},"schema_version":"1.0","source":{"id":"1601.07701","kind":"arxiv","version":3}},"canonical_sha256":"6b08b1814a5f6f1d2c4f0de29181b32852a42183ed25eca35c58fd2daaa3c6d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b08b1814a5f6f1d2c4f0de29181b32852a42183ed25eca35c58fd2daaa3c6d1","first_computed_at":"2026-05-18T00:58:57.279953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.279953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Dgu4Pg0i55nSAUW76GplFMuATR69Jo7ZYdKi62oHHcRx8b32jBRpRFkZFkt1Ou9wLsXxpPCSovoIFEWZH+uDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.280573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07701","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fc2c7f1a0aaf4e72fc0f6996963cc2ba9675662e2f8c0b39a6ef912060c69c9","sha256:29d959eebc42e1e520c159593b972014e4740e451d8d45b31891985fa46e00d6"],"state_sha256":"6c9b2fea47214ec7fab5a070f82052a71890b604c466d9e09f5d643dfdcb20a6"}