{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:C6FZHWLQTM3N5NTQTUNACN277L","short_pith_number":"pith:C6FZHWLQ","schema_version":"1.0","canonical_sha256":"178b93d9709b36deb6709d1a01375ffac4c65c4f6c129c98e98558d8b0ab2c84","source":{"kind":"arxiv","id":"1901.00828","version":1},"attestation_state":"computed","paper":{"title":"Massive MIMO Unsourced Random Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Fengler, Giuseppe Caire, Peter Jung, Saeid Haghighatshoar","submitted_at":"2019-01-03T17:31:54Z","abstract_excerpt":"We consider an extension of the massive unsourced random access originally proposed by Polyanskiy to the case where the receiver has a very large number of antennas (a massive MIMO base station) and no channel state information is given to the receiver (fully non-coherent detection). Our coding approach borrows the concatenated coding idea from Amalladinne et. al., combined with a novel non-Bayesian `activity detection' algorithm for massive MIMO random access channels, that outperforms currently proposed Bayesian vector AMP (VAMP) schemes currently proposed for activity detection, and does no"},"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":"1901.00828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-03T17:31:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8079b90080ccd311555f668e6021900c0a102f17246a7706ee17970c3f4a96cf","abstract_canon_sha256":"043602d0367c12a7e4cebb78537e01fe6f21c9f3f428639d235f1fe69fd453af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:01.139374Z","signature_b64":"Jb6kckHSn71mCoioTXfDLFnjl+Ypt2FBG8y8ynSLRA8n5vcPPdHn5PG4eOww4Q7nqiKpNR/ZiRms8n84R+JZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"178b93d9709b36deb6709d1a01375ffac4c65c4f6c129c98e98558d8b0ab2c84","last_reissued_at":"2026-05-17T23:57:01.138795Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:01.138795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Massive MIMO Unsourced Random Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Fengler, Giuseppe Caire, Peter Jung, Saeid Haghighatshoar","submitted_at":"2019-01-03T17:31:54Z","abstract_excerpt":"We consider an extension of the massive unsourced random access originally proposed by Polyanskiy to the case where the receiver has a very large number of antennas (a massive MIMO base station) and no channel state information is given to the receiver (fully non-coherent detection). Our coding approach borrows the concatenated coding idea from Amalladinne et. al., combined with a novel non-Bayesian `activity detection' algorithm for massive MIMO random access channels, that outperforms currently proposed Bayesian vector AMP (VAMP) schemes currently proposed for activity detection, and does no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00828","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":"1901.00828","created_at":"2026-05-17T23:57:01.138876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00828v1","created_at":"2026-05-17T23:57:01.138876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00828","created_at":"2026-05-17T23:57:01.138876+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6FZHWLQTM3N","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6FZHWLQTM3N5NTQ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6FZHWLQ","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.09448","citing_title":"Energy efficient coded random access for the wireless uplink","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2601.15928","citing_title":"A Remark on Downlink Massive Random Access","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L","json":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L.json","graph_json":"https://pith.science/api/pith-number/C6FZHWLQTM3N5NTQTUNACN277L/graph.json","events_json":"https://pith.science/api/pith-number/C6FZHWLQTM3N5NTQTUNACN277L/events.json","paper":"https://pith.science/paper/C6FZHWLQ"},"agent_actions":{"view_html":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L","download_json":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L.json","view_paper":"https://pith.science/paper/C6FZHWLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00828&json=true","fetch_graph":"https://pith.science/api/pith-number/C6FZHWLQTM3N5NTQTUNACN277L/graph.json","fetch_events":"https://pith.science/api/pith-number/C6FZHWLQTM3N5NTQTUNACN277L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L/action/storage_attestation","attest_author":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L/action/author_attestation","sign_citation":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L/action/citation_signature","submit_replication":"https://pith.science/pith/C6FZHWLQTM3N5NTQTUNACN277L/action/replication_record"}},"created_at":"2026-05-17T23:57:01.138876+00:00","updated_at":"2026-05-17T23:57:01.138876+00:00"}