{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T6BPSX6XOAKH3EGMX3OT3CX7TQ","short_pith_number":"pith:T6BPSX6X","schema_version":"1.0","canonical_sha256":"9f82f95fd770147d90ccbedd3d8aff9c1fae0fb6610e3f341c5e49c0ca3bf8fa","source":{"kind":"arxiv","id":"1510.06095","version":1},"attestation_state":"computed","paper":{"title":"Optimality of Large MIMO Detection via Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arian Maleki, Charles Jeon, Christoph Studer, Ramina Ghods","submitted_at":"2015-10-21T00:56:16Z","abstract_excerpt":"Optimal data detection in multiple-input multiple-output (MIMO) communication systems with a large number of antennas at both ends of the wireless link entails prohibitive computational complexity. In order to reduce the computational complexity, a variety of sub-optimal detection algorithms have been proposed in the literature. In this paper, we analyze the optimality of a novel data-detection method for large MIMO systems that relies on approximate message passing (AMP). We show that our algorithm, referred to as individually-optimal (IO) large-MIMO AMP (short IO-LAMA), is able to perform IO"},"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":"1510.06095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-21T00:56:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03b49ffc7bac5739504f5e6476d6bf1d961aa194ef3709862d1af819227273df","abstract_canon_sha256":"8cc2a7d71bd58b31c58d3db3087cc238a486f7ce3d9089524970a115cbcd8ddd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:37.772267Z","signature_b64":"dkKkU+ET0VA6J+9F995zJax1SfeYRWaEbYhv6HRgIzODOBLuJm6JVQL4Jh77cpzD5JobRPpDT9cH/h276Ql8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f82f95fd770147d90ccbedd3d8aff9c1fae0fb6610e3f341c5e49c0ca3bf8fa","last_reissued_at":"2026-05-18T01:29:37.771755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:37.771755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality of Large MIMO Detection via Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arian Maleki, Charles Jeon, Christoph Studer, Ramina Ghods","submitted_at":"2015-10-21T00:56:16Z","abstract_excerpt":"Optimal data detection in multiple-input multiple-output (MIMO) communication systems with a large number of antennas at both ends of the wireless link entails prohibitive computational complexity. In order to reduce the computational complexity, a variety of sub-optimal detection algorithms have been proposed in the literature. In this paper, we analyze the optimality of a novel data-detection method for large MIMO systems that relies on approximate message passing (AMP). We show that our algorithm, referred to as individually-optimal (IO) large-MIMO AMP (short IO-LAMA), is able to perform IO"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06095","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":"1510.06095","created_at":"2026-05-18T01:29:37.771851+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06095v1","created_at":"2026-05-18T01:29:37.771851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06095","created_at":"2026-05-18T01:29:37.771851+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6BPSX6XOAKH","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6BPSX6XOAKH3EGM","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6BPSX6X","created_at":"2026-05-18T12:29:42.218222+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/T6BPSX6XOAKH3EGMX3OT3CX7TQ","json":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ.json","graph_json":"https://pith.science/api/pith-number/T6BPSX6XOAKH3EGMX3OT3CX7TQ/graph.json","events_json":"https://pith.science/api/pith-number/T6BPSX6XOAKH3EGMX3OT3CX7TQ/events.json","paper":"https://pith.science/paper/T6BPSX6X"},"agent_actions":{"view_html":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ","download_json":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ.json","view_paper":"https://pith.science/paper/T6BPSX6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06095&json=true","fetch_graph":"https://pith.science/api/pith-number/T6BPSX6XOAKH3EGMX3OT3CX7TQ/graph.json","fetch_events":"https://pith.science/api/pith-number/T6BPSX6XOAKH3EGMX3OT3CX7TQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/action/storage_attestation","attest_author":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/action/author_attestation","sign_citation":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/action/citation_signature","submit_replication":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/action/replication_record"}},"created_at":"2026-05-18T01:29:37.771851+00:00","updated_at":"2026-05-18T01:29:37.771851+00:00"}