{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LWDPYSW4O3H7ZF4R7CDBDUIWZK","short_pith_number":"pith:LWDPYSW4","schema_version":"1.0","canonical_sha256":"5d86fc4adc76cffc9791f88611d116ca8971b0f15a3a28ca18376d23947a954a","source":{"kind":"arxiv","id":"1605.05862","version":1},"attestation_state":"computed","paper":{"title":"Coded Pilot Access: A Random Access Solution for Massive MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elisabeth de Carvalho, Jesper H. S{\\o}rensen, Petar Popovski, \\v{C}edomir Stefanovi\\'c","submitted_at":"2016-05-19T09:17:38Z","abstract_excerpt":"We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling is infeasible. In such scenarios, random access is a natural choice. The proposed access protocol relies on two essential properties of a massive MIMO system, namely asymptotic orthogonality between user channels and asymptotic invariance of channel powers. Signal processing techniques that take advantage of these properties allow us to view a set of contamin"},"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":"1605.05862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-19T09:17:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6b369a51277b5e6d619ec16bc2ec90f6c637d3ff20e9450e8da858a57251c3ed","abstract_canon_sha256":"e63ca712465323349aa76365b715b7e8277ed05dc53123d3b1edd3ffec8163b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:28.193021Z","signature_b64":"hymNSQIsf0irSamo7vBjgGIKtTaTiJRHXKmGBsTmN3nJKPEUFg3fcvmBVgfbvQPvfX3u1WWcIa0Bv5+tnibaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d86fc4adc76cffc9791f88611d116ca8971b0f15a3a28ca18376d23947a954a","last_reissued_at":"2026-05-18T01:14:28.192415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:28.192415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Pilot Access: A Random Access Solution for Massive MIMO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Elisabeth de Carvalho, Jesper H. S{\\o}rensen, Petar Popovski, \\v{C}edomir Stefanovi\\'c","submitted_at":"2016-05-19T09:17:38Z","abstract_excerpt":"We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling is infeasible. In such scenarios, random access is a natural choice. The proposed access protocol relies on two essential properties of a massive MIMO system, namely asymptotic orthogonality between user channels and asymptotic invariance of channel powers. Signal processing techniques that take advantage of these properties allow us to view a set of contamin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05862","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":"1605.05862","created_at":"2026-05-18T01:14:28.192530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05862v1","created_at":"2026-05-18T01:14:28.192530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05862","created_at":"2026-05-18T01:14:28.192530+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWDPYSW4O3H7","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWDPYSW4O3H7ZF4R","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWDPYSW4","created_at":"2026-05-18T12:30:29.479603+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/LWDPYSW4O3H7ZF4R7CDBDUIWZK","json":"https://pith.science/pith/LWDPYSW4O3H7ZF4R7CDBDUIWZK.json","graph_json":"https://pith.science/api/pith-number/LWDPYSW4O3H7ZF4R7CDBDUIWZK/graph.json","events_json":"https://pith.science/api/pith-number/LWDPYSW4O3H7ZF4R7CDBDUIWZK/events.json","paper":"https://pith.science/paper/LWDPYSW4"},"agent_actions":{"view_html":"https://pith.science/pith/LWDPYSW4O3H7ZF4R7CDBDUIWZK","download_json":"https://pith.science/pith/LWDPYSW4O3H7ZF4R7CDBDUIWZK.json","view_paper":"https://pith.science/paper/LWDPYSW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05862&json=true","fetch_graph":"https://pith.science/api/pith-number/LWDPYSW4O3H7ZF4R7CDBDUIWZK/graph.json","fetch_events":"https://pith.science/api/pith-number/LWDPYSW4O3H7ZF4R7CDBDUIWZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWDPYSW4O3H7ZF4R7CDBDUIWZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWDPYSW4O3H7ZF4R7CDBDUIWZK/action/storage_attestation","attest_author":"https://pith.science/pith/LWDPYSW4O3H7ZF4R7CDBDUIWZK/action/author_attestation","sign_citation":"https://pith.science/pith/LWDPYSW4O3H7ZF4R7CDBDUIWZK/action/citation_signature","submit_replication":"https://pith.science/pith/LWDPYSW4O3H7ZF4R7CDBDUIWZK/action/replication_record"}},"created_at":"2026-05-18T01:14:28.192530+00:00","updated_at":"2026-05-18T01:14:28.192530+00:00"}