{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MKIMGKQLAGJOM7QATBKARIWIMV","short_pith_number":"pith:MKIMGKQL","schema_version":"1.0","canonical_sha256":"6290c32a0b0192e67e00985408a2c86541dfca2217b1c4ec539dc622a6729125","source":{"kind":"arxiv","id":"1705.04509","version":1},"attestation_state":"computed","paper":{"title":"Multi-Channel Random Access with Replications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrey Turlikov, Olga Galinina, Sergey Andreev, Yevgeni Koucheryavy","submitted_at":"2017-05-12T10:57:06Z","abstract_excerpt":"This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a lower estimate for the access delay performance within this class. Further, we propose a feasible access control algorithm achieving low access delay by sending multiple message replicas, which approaches the performance of the hypothetical algorithm. The resulting performance is readily approximated by a simple lower bound, which is derived for a large number"},"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":"1705.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T10:57:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e5fc2d532882ee2fc4ce93fa46ce66b6678a9d85c58d8ae2ec41212e262c506","abstract_canon_sha256":"0e53259ad2c98b3d56553ef8d1d5ad880197db96b7ef5d92f7d0113aff502ab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.911619Z","signature_b64":"Kzwj4LZCKiswuI9Mfo/cthek82ItM4IqVjNkG1ckSKPG7cqE1cIizBv6DQ2HAyz5Lhtbz+U96BjHa8eB2p/MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6290c32a0b0192e67e00985408a2c86541dfca2217b1c4ec539dc622a6729125","last_reissued_at":"2026-05-18T00:44:37.911210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.911210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Channel Random Access with Replications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrey Turlikov, Olga Galinina, Sergey Andreev, Yevgeni Koucheryavy","submitted_at":"2017-05-12T10:57:06Z","abstract_excerpt":"This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a lower estimate for the access delay performance within this class. Further, we propose a feasible access control algorithm achieving low access delay by sending multiple message replicas, which approaches the performance of the hypothetical algorithm. The resulting performance is readily approximated by a simple lower bound, which is derived for a large number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04509","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":"1705.04509","created_at":"2026-05-18T00:44:37.911277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04509v1","created_at":"2026-05-18T00:44:37.911277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04509","created_at":"2026-05-18T00:44:37.911277+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKIMGKQLAGJO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKIMGKQLAGJOM7QA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKIMGKQL","created_at":"2026-05-18T12:31:31.346846+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/MKIMGKQLAGJOM7QATBKARIWIMV","json":"https://pith.science/pith/MKIMGKQLAGJOM7QATBKARIWIMV.json","graph_json":"https://pith.science/api/pith-number/MKIMGKQLAGJOM7QATBKARIWIMV/graph.json","events_json":"https://pith.science/api/pith-number/MKIMGKQLAGJOM7QATBKARIWIMV/events.json","paper":"https://pith.science/paper/MKIMGKQL"},"agent_actions":{"view_html":"https://pith.science/pith/MKIMGKQLAGJOM7QATBKARIWIMV","download_json":"https://pith.science/pith/MKIMGKQLAGJOM7QATBKARIWIMV.json","view_paper":"https://pith.science/paper/MKIMGKQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04509&json=true","fetch_graph":"https://pith.science/api/pith-number/MKIMGKQLAGJOM7QATBKARIWIMV/graph.json","fetch_events":"https://pith.science/api/pith-number/MKIMGKQLAGJOM7QATBKARIWIMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKIMGKQLAGJOM7QATBKARIWIMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKIMGKQLAGJOM7QATBKARIWIMV/action/storage_attestation","attest_author":"https://pith.science/pith/MKIMGKQLAGJOM7QATBKARIWIMV/action/author_attestation","sign_citation":"https://pith.science/pith/MKIMGKQLAGJOM7QATBKARIWIMV/action/citation_signature","submit_replication":"https://pith.science/pith/MKIMGKQLAGJOM7QATBKARIWIMV/action/replication_record"}},"created_at":"2026-05-18T00:44:37.911277+00:00","updated_at":"2026-05-18T00:44:37.911277+00:00"}