{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AIMHPRQLO6AC3STSCIM34IWCSO","short_pith_number":"pith:AIMHPRQL","schema_version":"1.0","canonical_sha256":"021877c60b77802dca721219be22c29389623011bba55e3de8693a7b7eec3bda","source":{"kind":"arxiv","id":"1905.01210","version":1},"attestation_state":"computed","paper":{"title":"Non-Orthogonal Contention-Based Access for URLLC Devices with Frequency Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher Boyd, Olav Tirkkonen, Petar Popovski, Rados{\\l}aw Kotaba","submitted_at":"2019-05-03T14:46:48Z","abstract_excerpt":"We study coded multichannel random access schemes for ultra-reliable low-latency uplink transmissions. We concentrate on non-orthogonal access in the frequency domain, where users transmit over multiple orthogonal subchannels and inter-user collisions limit the available diversity. Two different models for contention-based random access over Rayleigh fading resources are investigated. First, a collision model is considered, in which the packet is replicated onto $K$ available resources, $K' \\leq K$ of which are received without collision, and treated as diversity branches by a maximum-ratio co"},"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":"1905.01210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-03T14:46:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43560e7fb17bb02a85b9b294eaae0bc99ee6093e9211681b67e0500b3e5a588b","abstract_canon_sha256":"f52f88cc9d323c90942739aacf39d5f340f4bbe1782bccb9b448dcba3a3ca022"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.499682Z","signature_b64":"rfOXmGZT21WI/migGOfpTB/tmAa9acPz2FWA8gQkTe8SvrEMSMtm4T7BuHAe6Fxn3xxsdyGQQk1JPEhSL257CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"021877c60b77802dca721219be22c29389623011bba55e3de8693a7b7eec3bda","last_reissued_at":"2026-05-17T23:47:06.499190Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.499190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Orthogonal Contention-Based Access for URLLC Devices with Frequency Diversity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher Boyd, Olav Tirkkonen, Petar Popovski, Rados{\\l}aw Kotaba","submitted_at":"2019-05-03T14:46:48Z","abstract_excerpt":"We study coded multichannel random access schemes for ultra-reliable low-latency uplink transmissions. We concentrate on non-orthogonal access in the frequency domain, where users transmit over multiple orthogonal subchannels and inter-user collisions limit the available diversity. Two different models for contention-based random access over Rayleigh fading resources are investigated. First, a collision model is considered, in which the packet is replicated onto $K$ available resources, $K' \\leq K$ of which are received without collision, and treated as diversity branches by a maximum-ratio co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01210","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":"1905.01210","created_at":"2026-05-17T23:47:06.499263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01210v1","created_at":"2026-05-17T23:47:06.499263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01210","created_at":"2026-05-17T23:47:06.499263+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIMHPRQLO6AC","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIMHPRQLO6AC3STS","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIMHPRQL","created_at":"2026-05-18T12:33:12.712433+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/AIMHPRQLO6AC3STSCIM34IWCSO","json":"https://pith.science/pith/AIMHPRQLO6AC3STSCIM34IWCSO.json","graph_json":"https://pith.science/api/pith-number/AIMHPRQLO6AC3STSCIM34IWCSO/graph.json","events_json":"https://pith.science/api/pith-number/AIMHPRQLO6AC3STSCIM34IWCSO/events.json","paper":"https://pith.science/paper/AIMHPRQL"},"agent_actions":{"view_html":"https://pith.science/pith/AIMHPRQLO6AC3STSCIM34IWCSO","download_json":"https://pith.science/pith/AIMHPRQLO6AC3STSCIM34IWCSO.json","view_paper":"https://pith.science/paper/AIMHPRQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01210&json=true","fetch_graph":"https://pith.science/api/pith-number/AIMHPRQLO6AC3STSCIM34IWCSO/graph.json","fetch_events":"https://pith.science/api/pith-number/AIMHPRQLO6AC3STSCIM34IWCSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIMHPRQLO6AC3STSCIM34IWCSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIMHPRQLO6AC3STSCIM34IWCSO/action/storage_attestation","attest_author":"https://pith.science/pith/AIMHPRQLO6AC3STSCIM34IWCSO/action/author_attestation","sign_citation":"https://pith.science/pith/AIMHPRQLO6AC3STSCIM34IWCSO/action/citation_signature","submit_replication":"https://pith.science/pith/AIMHPRQLO6AC3STSCIM34IWCSO/action/replication_record"}},"created_at":"2026-05-17T23:47:06.499263+00:00","updated_at":"2026-05-17T23:47:06.499263+00:00"}