{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P3MQM5AK5GQUTQMBPO3JJ3CF4F","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":"41fd21d013a201124698c56efd9cdc60bb1d122cde823d21e2347a573fb9ce94","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-17T18:28:46Z","title_canon_sha256":"37eb332d93929eb86c1f7f8faf35cf25ebfbe0f05b236db5d663a05b68e2d26a"},"schema_version":"1.0","source":{"id":"1708.05405","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05405","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05405v2","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05405","created_at":"2026-05-18T00:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"P3MQM5AK5GQU","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P3MQM5AK5GQUTQMB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P3MQM5AK","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:efdfa6e8af9f9238a589a322e1e28a53d4b1e4081d02d52b341cc4b0259c6efb","target":"graph","created_at":"2026-05-18T00:29:05Z","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":"A detection scheme for uplink massive MIMO, dubbed massive-BLAST or M-BLAST, is proposed. The derived algorithm is an enhancement of the well-known soft parallel interference cancellation. Using computer simulations in massive MIMO application scenarios, M-BLAST is shown to yield a substantially better error performance with reduced complexity, compared to the benchmark alternative of a one-shot linear detector, as well as the original sequential V-BLAST. Hence, M-BLAST may serve as a computationally efficient means to exploit the large number of antennas in massive MIMO.","authors_text":"Alexei Ashikhmin, Ori Shental, Reinaldo A. Valenzuela, Sivarama Venkatesan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-17T18:28:46Z","title":"Massive BLAST: An Architecture for Realizing Ultra-High Data Rates for Large-Scale MIMO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05405","kind":"arxiv","version":2},"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:d3e6600d7b7b9a1e38b2ab15f9a374378664e300ea12f1da40e1ff4a4fef2357","target":"record","created_at":"2026-05-18T00:29:05Z","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":"41fd21d013a201124698c56efd9cdc60bb1d122cde823d21e2347a573fb9ce94","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-17T18:28:46Z","title_canon_sha256":"37eb332d93929eb86c1f7f8faf35cf25ebfbe0f05b236db5d663a05b68e2d26a"},"schema_version":"1.0","source":{"id":"1708.05405","kind":"arxiv","version":2}},"canonical_sha256":"7ed906740ae9a149c1817bb694ec45e175d8836eeb16ef61088249671e291ae3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ed906740ae9a149c1817bb694ec45e175d8836eeb16ef61088249671e291ae3","first_computed_at":"2026-05-18T00:29:05.534530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:05.534530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4HQEVy9uk6XPEXA5OIZ1pvkyFQRQAge1oH53klc8QmCdL7jJ70+w1n+zsrRwFm8yr+aEQub32ZQoFM1VcmCjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:05.535101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05405","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3e6600d7b7b9a1e38b2ab15f9a374378664e300ea12f1da40e1ff4a4fef2357","sha256:efdfa6e8af9f9238a589a322e1e28a53d4b1e4081d02d52b341cc4b0259c6efb"],"state_sha256":"a762dd78371ea11ac00ffe272d31895f9485f45649fd371918087a7e5eb0c37e"}