{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z26JRIUWJBKSLVBRZA2RFFGZTZ","short_pith_number":"pith:Z26JRIUW","schema_version":"1.0","canonical_sha256":"cebc98a296485525d431c8351294d99e56a1f1537f28d198f86783235e08dc5b","source":{"kind":"arxiv","id":"1808.09287","version":1},"attestation_state":"computed","paper":{"title":"Fully Decentralized Massive MIMO Detection Based on Recursive Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Fredrik Rusek, Jesus Rodriguez Sanchez, Liang Liu, Muris Sarajlic, Ove Edfors","submitted_at":"2018-08-28T13:36:21Z","abstract_excerpt":"Algorithms for Massive MIMO uplink detection typically rely on a centralized approach, by which baseband data from all antennas modules are routed to a central node in order to be processed. In case of Massive MIMO, where hundreds or thousands of antennas are expected in the base-station, this architecture leads to a bottleneck, with critical limitations in terms of interconnection bandwidth requirements. This paper presents a fully decentralized architecture and algorithms for Massive MIMO uplink based on recursive methods, which do not require a central node for the detection process. Throug"},"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":"1808.09287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-08-28T13:36:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6b931865756b58574a0d62bc955777b864bb95ab4ac779d2100cb21a2ea47d29","abstract_canon_sha256":"e3a24ea85bbfee4937b23a2e25d9248240c4985755e5efd52adc30ca7c45244b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:01.800461Z","signature_b64":"16p6z+zWzc39vQXOBUyrcSKO6vxVoBEOvS1iOdq/mELLU+qArNbZDG2B+UT555N1YcOwFlZPyiYC2nxkYr7GDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cebc98a296485525d431c8351294d99e56a1f1537f28d198f86783235e08dc5b","last_reissued_at":"2026-05-18T00:07:01.799782Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:01.799782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Decentralized Massive MIMO Detection Based on Recursive Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Fredrik Rusek, Jesus Rodriguez Sanchez, Liang Liu, Muris Sarajlic, Ove Edfors","submitted_at":"2018-08-28T13:36:21Z","abstract_excerpt":"Algorithms for Massive MIMO uplink detection typically rely on a centralized approach, by which baseband data from all antennas modules are routed to a central node in order to be processed. In case of Massive MIMO, where hundreds or thousands of antennas are expected in the base-station, this architecture leads to a bottleneck, with critical limitations in terms of interconnection bandwidth requirements. This paper presents a fully decentralized architecture and algorithms for Massive MIMO uplink based on recursive methods, which do not require a central node for the detection process. Throug"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09287","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":"1808.09287","created_at":"2026-05-18T00:07:01.799897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09287v1","created_at":"2026-05-18T00:07:01.799897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09287","created_at":"2026-05-18T00:07:01.799897+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z26JRIUWJBKS","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z26JRIUWJBKSLVBR","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z26JRIUW","created_at":"2026-05-18T12:33:04.347982+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/Z26JRIUWJBKSLVBRZA2RFFGZTZ","json":"https://pith.science/pith/Z26JRIUWJBKSLVBRZA2RFFGZTZ.json","graph_json":"https://pith.science/api/pith-number/Z26JRIUWJBKSLVBRZA2RFFGZTZ/graph.json","events_json":"https://pith.science/api/pith-number/Z26JRIUWJBKSLVBRZA2RFFGZTZ/events.json","paper":"https://pith.science/paper/Z26JRIUW"},"agent_actions":{"view_html":"https://pith.science/pith/Z26JRIUWJBKSLVBRZA2RFFGZTZ","download_json":"https://pith.science/pith/Z26JRIUWJBKSLVBRZA2RFFGZTZ.json","view_paper":"https://pith.science/paper/Z26JRIUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09287&json=true","fetch_graph":"https://pith.science/api/pith-number/Z26JRIUWJBKSLVBRZA2RFFGZTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z26JRIUWJBKSLVBRZA2RFFGZTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z26JRIUWJBKSLVBRZA2RFFGZTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z26JRIUWJBKSLVBRZA2RFFGZTZ/action/storage_attestation","attest_author":"https://pith.science/pith/Z26JRIUWJBKSLVBRZA2RFFGZTZ/action/author_attestation","sign_citation":"https://pith.science/pith/Z26JRIUWJBKSLVBRZA2RFFGZTZ/action/citation_signature","submit_replication":"https://pith.science/pith/Z26JRIUWJBKSLVBRZA2RFFGZTZ/action/replication_record"}},"created_at":"2026-05-18T00:07:01.799897+00:00","updated_at":"2026-05-18T00:07:01.799897+00:00"}