{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TLQCEQKXHPEJ6VRQAF5MTLUUS4","short_pith_number":"pith:TLQCEQKX","schema_version":"1.0","canonical_sha256":"9ae02241573bc89f5630017ac9ae94970907db0d9893d8143caa7b8a0b93273b","source":{"kind":"arxiv","id":"2003.11760","version":1},"attestation_state":"computed","paper":{"title":"Symbol Detection for Massive MIMO AF Relays Using Approximate Bayesian Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haochuan Zhang, Qiuyun Zou","submitted_at":"2020-03-26T06:49:43Z","abstract_excerpt":"For massive MIMO AF relays, symbol detection becomes a practical issue when the number of antennas is not large enough, since linear methods are non-optimal and optimal methods are exponentially complex. This paper proposes a new detection algorithm that offers Bayesian-optimal MSE at the cost of $O(n^3)$ complexity per iteration. The algorithm is in essence a hybrid of two methods recently developed for deep learning, with particular optimization for relay. As a hybrid, it inherits from the two a state evolution formulism, where the asymptotic MSE can be precisely predicted through a scalar e"},"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":"2003.11760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-03-26T06:49:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4a5c20448abc5dd2b83fd7f64667479d6921258fceb670b3edc43e19f736df87","abstract_canon_sha256":"245b76357921cd9f721290a03a378d00e18e3e1a96f8ea5ffc3517a75086a29e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:47.195372Z","signature_b64":"/QeAVV6j2BMCP9Y0vMKQoUIKybvc4kIwwXFe+LvXJP5df6cUnj15paxIct99nkxHN1BRI2YEY8vdkMjM1vX8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ae02241573bc89f5630017ac9ae94970907db0d9893d8143caa7b8a0b93273b","last_reissued_at":"2026-07-05T00:50:47.194912Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:47.194912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbol Detection for Massive MIMO AF Relays Using Approximate Bayesian Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haochuan Zhang, Qiuyun Zou","submitted_at":"2020-03-26T06:49:43Z","abstract_excerpt":"For massive MIMO AF relays, symbol detection becomes a practical issue when the number of antennas is not large enough, since linear methods are non-optimal and optimal methods are exponentially complex. This paper proposes a new detection algorithm that offers Bayesian-optimal MSE at the cost of $O(n^3)$ complexity per iteration. The algorithm is in essence a hybrid of two methods recently developed for deep learning, with particular optimization for relay. As a hybrid, it inherits from the two a state evolution formulism, where the asymptotic MSE can be precisely predicted through a scalar e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11760","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.11760/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2003.11760","created_at":"2026-07-05T00:50:47.194968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.11760v1","created_at":"2026-07-05T00:50:47.194968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11760","created_at":"2026-07-05T00:50:47.194968+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLQCEQKXHPEJ","created_at":"2026-07-05T00:50:47.194968+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLQCEQKXHPEJ6VRQ","created_at":"2026-07-05T00:50:47.194968+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLQCEQKX","created_at":"2026-07-05T00:50:47.194968+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/TLQCEQKXHPEJ6VRQAF5MTLUUS4","json":"https://pith.science/pith/TLQCEQKXHPEJ6VRQAF5MTLUUS4.json","graph_json":"https://pith.science/api/pith-number/TLQCEQKXHPEJ6VRQAF5MTLUUS4/graph.json","events_json":"https://pith.science/api/pith-number/TLQCEQKXHPEJ6VRQAF5MTLUUS4/events.json","paper":"https://pith.science/paper/TLQCEQKX"},"agent_actions":{"view_html":"https://pith.science/pith/TLQCEQKXHPEJ6VRQAF5MTLUUS4","download_json":"https://pith.science/pith/TLQCEQKXHPEJ6VRQAF5MTLUUS4.json","view_paper":"https://pith.science/paper/TLQCEQKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.11760&json=true","fetch_graph":"https://pith.science/api/pith-number/TLQCEQKXHPEJ6VRQAF5MTLUUS4/graph.json","fetch_events":"https://pith.science/api/pith-number/TLQCEQKXHPEJ6VRQAF5MTLUUS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLQCEQKXHPEJ6VRQAF5MTLUUS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLQCEQKXHPEJ6VRQAF5MTLUUS4/action/storage_attestation","attest_author":"https://pith.science/pith/TLQCEQKXHPEJ6VRQAF5MTLUUS4/action/author_attestation","sign_citation":"https://pith.science/pith/TLQCEQKXHPEJ6VRQAF5MTLUUS4/action/citation_signature","submit_replication":"https://pith.science/pith/TLQCEQKXHPEJ6VRQAF5MTLUUS4/action/replication_record"}},"created_at":"2026-07-05T00:50:47.194968+00:00","updated_at":"2026-07-05T00:50:47.194968+00:00"}