{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CXCLNZT3KMXUPYLBZ5Y7HZL6TL","short_pith_number":"pith:CXCLNZT3","schema_version":"1.0","canonical_sha256":"15c4b6e67b532f47e161cf71f3e57e9af55133aa3235f110d774e120fed6a427","source":{"kind":"arxiv","id":"1604.04248","version":2},"attestation_state":"computed","paper":{"title":"A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Elisabeth de Carvalho, Emil Bj\\\"ornson, Erik G. Larsson, Jesper H. S{\\o}rensen, Petar Popovski","submitted_at":"2016-04-14T18:18:55Z","abstract_excerpt":"The Massive MIMO (multiple-input multiple-output) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing of many tens of user equipments (UEs). These gains are only achieved in practice if many more UEs can connect efficiently to the network than today. As the number of UEs increases, while each UE intermittently accesses the network, the random access functionality becomes essential to share the limited number of pilots among the UEs. In this paper, we revisit the random access problem in"},"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":"1604.04248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-14T18:18:55Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"369411e0f7699c4ff96541377cabcff55a9d63c0236ec1e59fdc1b2a8276687b","abstract_canon_sha256":"b7b23b84cfc8e8c64d92a5a7dc69f1c740cda60c9bc04e1784e0fd9a8a4fb6ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:57.249123Z","signature_b64":"4X3QIOVZ4r+qLN1WTQvsGs10tNBvpadI7qugTpN+B5kABSA2qnN5PeYJFyajgb+wydDRCWpkQKW778ltVEOVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15c4b6e67b532f47e161cf71f3e57e9af55133aa3235f110d774e120fed6a427","last_reissued_at":"2026-05-18T00:50:57.248397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:57.248397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Elisabeth de Carvalho, Emil Bj\\\"ornson, Erik G. Larsson, Jesper H. S{\\o}rensen, Petar Popovski","submitted_at":"2016-04-14T18:18:55Z","abstract_excerpt":"The Massive MIMO (multiple-input multiple-output) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing of many tens of user equipments (UEs). These gains are only achieved in practice if many more UEs can connect efficiently to the network than today. As the number of UEs increases, while each UE intermittently accesses the network, the random access functionality becomes essential to share the limited number of pilots among the UEs. In this paper, we revisit the random access problem in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04248","kind":"arxiv","version":2},"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":"1604.04248","created_at":"2026-05-18T00:50:57.248529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04248v2","created_at":"2026-05-18T00:50:57.248529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04248","created_at":"2026-05-18T00:50:57.248529+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXCLNZT3KMXU","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXCLNZT3KMXUPYLB","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXCLNZT3","created_at":"2026-05-18T12:30:09.641336+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/CXCLNZT3KMXUPYLBZ5Y7HZL6TL","json":"https://pith.science/pith/CXCLNZT3KMXUPYLBZ5Y7HZL6TL.json","graph_json":"https://pith.science/api/pith-number/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/graph.json","events_json":"https://pith.science/api/pith-number/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/events.json","paper":"https://pith.science/paper/CXCLNZT3"},"agent_actions":{"view_html":"https://pith.science/pith/CXCLNZT3KMXUPYLBZ5Y7HZL6TL","download_json":"https://pith.science/pith/CXCLNZT3KMXUPYLBZ5Y7HZL6TL.json","view_paper":"https://pith.science/paper/CXCLNZT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04248&json=true","fetch_graph":"https://pith.science/api/pith-number/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/graph.json","fetch_events":"https://pith.science/api/pith-number/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/action/storage_attestation","attest_author":"https://pith.science/pith/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/action/author_attestation","sign_citation":"https://pith.science/pith/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/action/citation_signature","submit_replication":"https://pith.science/pith/CXCLNZT3KMXUPYLBZ5Y7HZL6TL/action/replication_record"}},"created_at":"2026-05-18T00:50:57.248529+00:00","updated_at":"2026-05-18T00:50:57.248529+00:00"}