{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T6BPSX6XOAKH3EGMX3OT3CX7TQ","short_pith_number":"pith:T6BPSX6X","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"},"canonical_sha256":"9f82f95fd770147d90ccbedd3d8aff9c1fae0fb6610e3f341c5e49c0ca3bf8fa","source":{"kind":"arxiv","id":"1510.06095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06095","created_at":"2026-05-18T01:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06095v1","created_at":"2026-05-18T01:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06095","created_at":"2026-05-18T01:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"T6BPSX6XOAKH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T6BPSX6XOAKH3EGM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T6BPSX6X","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T6BPSX6XOAKH3EGMX3OT3CX7TQ","target":"record","payload":{"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"},"canonical_sha256":"9f82f95fd770147d90ccbedd3d8aff9c1fae0fb6610e3f341c5e49c0ca3bf8fa","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"},"source_kind":"arxiv","source_id":"1510.06095","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHm5EbeemifyiwzCHyzKdNCerDMt/h/G58wviL9pcb65aygkguULB/XLoMAHANzeYkkXttpyyQ8QTPzeLqr0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:02:00.335131Z"},"content_sha256":"47750665d5a2ee3c6fd9cdcf2326494d3bb1a26a656f56f5c398531815c155d2","schema_version":"1.0","event_id":"sha256:47750665d5a2ee3c6fd9cdcf2326494d3bb1a26a656f56f5c398531815c155d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T6BPSX6XOAKH3EGMX3OT3CX7TQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d273zMo4ph8CI94xkPE4E+dZeEYyb/G8PoilQArdmGepVlUZ2NjwbWTG8fHoQnE2Lnotk0bxTECFM+9xVJnEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:02:00.335505Z"},"content_sha256":"9be1bde0f26334a324b8e7dd8f4f07bac00dedd8352751bb2d0d10ef75230041","schema_version":"1.0","event_id":"sha256:9be1bde0f26334a324b8e7dd8f4f07bac00dedd8352751bb2d0d10ef75230041"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/bundle.json","state_url":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T15:02:00Z","links":{"resolver":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ","bundle":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/bundle.json","state":"https://pith.science/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6BPSX6XOAKH3EGMX3OT3CX7TQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T6BPSX6XOAKH3EGMX3OT3CX7TQ","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":"8cc2a7d71bd58b31c58d3db3087cc238a486f7ce3d9089524970a115cbcd8ddd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-21T00:56:16Z","title_canon_sha256":"03b49ffc7bac5739504f5e6476d6bf1d961aa194ef3709862d1af819227273df"},"schema_version":"1.0","source":{"id":"1510.06095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06095","created_at":"2026-05-18T01:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06095v1","created_at":"2026-05-18T01:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06095","created_at":"2026-05-18T01:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"T6BPSX6XOAKH","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T6BPSX6XOAKH3EGM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T6BPSX6X","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:9be1bde0f26334a324b8e7dd8f4f07bac00dedd8352751bb2d0d10ef75230041","target":"graph","created_at":"2026-05-18T01:29:37Z","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":"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","authors_text":"Arian Maleki, Charles Jeon, Christoph Studer, Ramina Ghods","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-21T00:56:16Z","title":"Optimality of Large MIMO Detection via Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06095","kind":"arxiv","version":1},"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:47750665d5a2ee3c6fd9cdcf2326494d3bb1a26a656f56f5c398531815c155d2","target":"record","created_at":"2026-05-18T01:29:37Z","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":"8cc2a7d71bd58b31c58d3db3087cc238a486f7ce3d9089524970a115cbcd8ddd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-21T00:56:16Z","title_canon_sha256":"03b49ffc7bac5739504f5e6476d6bf1d961aa194ef3709862d1af819227273df"},"schema_version":"1.0","source":{"id":"1510.06095","kind":"arxiv","version":1}},"canonical_sha256":"9f82f95fd770147d90ccbedd3d8aff9c1fae0fb6610e3f341c5e49c0ca3bf8fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f82f95fd770147d90ccbedd3d8aff9c1fae0fb6610e3f341c5e49c0ca3bf8fa","first_computed_at":"2026-05-18T01:29:37.771755Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:37.771755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dkKkU+ET0VA6J+9F995zJax1SfeYRWaEbYhv6HRgIzODOBLuJm6JVQL4Jh77cpzD5JobRPpDT9cH/h276Ql8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:37.772267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47750665d5a2ee3c6fd9cdcf2326494d3bb1a26a656f56f5c398531815c155d2","sha256:9be1bde0f26334a324b8e7dd8f4f07bac00dedd8352751bb2d0d10ef75230041"],"state_sha256":"5294270c7e790a07ab366266b9616f41f6079e7af78fd03bf0bcdb530df218d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjXJ3BWIfLHpICeNMX7pW6jcqqkXqhoiEh+3HehbSpGUu8AagX3uXseC9hHbrsKLlaN2icimWdkzyh7NrV0fDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:02:00.338120Z","bundle_sha256":"31ddba0dd493f3d1ed03045d56d9b223b9c949237bf9c002d3232a01e8cbbce8"}}