{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OGGV7CH7DOPMA6MDNBYCSOFYDN","short_pith_number":"pith:OGGV7CH7","schema_version":"1.0","canonical_sha256":"718d5f88ff1b9ec0798368702938b81b63d299e3a376c05cff24860284e0c7e0","source":{"kind":"arxiv","id":"1907.09448","version":1},"attestation_state":"computed","paper":{"title":"Energy efficient coded random access for the wireless uplink","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Kirill Andreev, Suhas S Kowshik, Yury Polyanskiy","submitted_at":"2019-07-22T17:47:50Z","abstract_excerpt":"We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN multiple-access channel (MAC) by Polyanskiy'2017, in the practically more relevant case of users subject to Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding achievability bound, which we analyze both non-asymptotically (at finite blocklength) and asymptotically. As a candidate practical solution, we propose an"},"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":"1907.09448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-22T17:47:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1e09049bc51b234ed25b70892d315be368d6e440df36110a50c5a3f3ca4767cd","abstract_canon_sha256":"f2c0ae1298f7ac1c588ba2525dfb4a2723e45fde55469ad3baaa7a7b58ee9f21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.195300Z","signature_b64":"1qef5A4tmn0r9qu05LgMq7LQwdQ45C6dL3p5VOSK7u7ducli/F2UXFVZgWPZNai1izXZqYglH3vCPSqvlCSzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"718d5f88ff1b9ec0798368702938b81b63d299e3a376c05cff24860284e0c7e0","last_reissued_at":"2026-05-17T23:39:59.194858Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.194858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy efficient coded random access for the wireless uplink","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexey Frolov, Kirill Andreev, Suhas S Kowshik, Yury Polyanskiy","submitted_at":"2019-07-22T17:47:50Z","abstract_excerpt":"We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN multiple-access channel (MAC) by Polyanskiy'2017, in the practically more relevant case of users subject to Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding achievability bound, which we analyze both non-asymptotically (at finite blocklength) and asymptotically. As a candidate practical solution, we propose an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09448","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":"1907.09448","created_at":"2026-05-17T23:39:59.194924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09448v1","created_at":"2026-05-17T23:39:59.194924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09448","created_at":"2026-05-17T23:39:59.194924+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGGV7CH7DOPM","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGGV7CH7DOPMA6MD","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGGV7CH7","created_at":"2026-05-18T12:33:24.271573+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/OGGV7CH7DOPMA6MDNBYCSOFYDN","json":"https://pith.science/pith/OGGV7CH7DOPMA6MDNBYCSOFYDN.json","graph_json":"https://pith.science/api/pith-number/OGGV7CH7DOPMA6MDNBYCSOFYDN/graph.json","events_json":"https://pith.science/api/pith-number/OGGV7CH7DOPMA6MDNBYCSOFYDN/events.json","paper":"https://pith.science/paper/OGGV7CH7"},"agent_actions":{"view_html":"https://pith.science/pith/OGGV7CH7DOPMA6MDNBYCSOFYDN","download_json":"https://pith.science/pith/OGGV7CH7DOPMA6MDNBYCSOFYDN.json","view_paper":"https://pith.science/paper/OGGV7CH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09448&json=true","fetch_graph":"https://pith.science/api/pith-number/OGGV7CH7DOPMA6MDNBYCSOFYDN/graph.json","fetch_events":"https://pith.science/api/pith-number/OGGV7CH7DOPMA6MDNBYCSOFYDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGGV7CH7DOPMA6MDNBYCSOFYDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGGV7CH7DOPMA6MDNBYCSOFYDN/action/storage_attestation","attest_author":"https://pith.science/pith/OGGV7CH7DOPMA6MDNBYCSOFYDN/action/author_attestation","sign_citation":"https://pith.science/pith/OGGV7CH7DOPMA6MDNBYCSOFYDN/action/citation_signature","submit_replication":"https://pith.science/pith/OGGV7CH7DOPMA6MDNBYCSOFYDN/action/replication_record"}},"created_at":"2026-05-17T23:39:59.194924+00:00","updated_at":"2026-05-17T23:39:59.194924+00:00"}