{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MTDBTCUZ2MYOOFBCVWINILVN66","short_pith_number":"pith:MTDBTCUZ","schema_version":"1.0","canonical_sha256":"64c6198a99d330e71422ad90d42eadf7b3adc09063f9b709ac52f788e1535656","source":{"kind":"arxiv","id":"1902.10235","version":1},"attestation_state":"computed","paper":{"title":"Compressive random access with multiple resource blocks and fast retrial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinho Choi","submitted_at":"2019-02-26T21:31:42Z","abstract_excerpt":"In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of devices increases, more RBs can be added to support them. Thanks to multiple RBs, we can employ fast retrial between RBs for re-transmissions of collided packets, which can result in short access delay. For stable CRA with fast retrial, we derive conditions (with a rate control scheme), and analyze the steady state performance to find the throughput and del"},"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":"1902.10235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T21:31:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1fbf2e8888d9b70b933b8f4df589cf8648e8ac886112927ecd1218fe259870d1","abstract_canon_sha256":"73f9cc6b5aaa6afd541c80fe773bb844ca3e1779e198ee496364dd48b32807a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.411309Z","signature_b64":"KJFbmaVdM74xY08ws4eBwzwVRzj7+U1hKYcFu4gWj9MYMA1iUQEzV0K+bFkTE75en+pjl3wzFC5DUVZsaqF/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64c6198a99d330e71422ad90d42eadf7b3adc09063f9b709ac52f788e1535656","last_reissued_at":"2026-05-17T23:52:31.410777Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.410777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressive random access with multiple resource blocks and fast retrial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinho Choi","submitted_at":"2019-02-26T21:31:42Z","abstract_excerpt":"In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of devices increases, more RBs can be added to support them. Thanks to multiple RBs, we can employ fast retrial between RBs for re-transmissions of collided packets, which can result in short access delay. For stable CRA with fast retrial, we derive conditions (with a rate control scheme), and analyze the steady state performance to find the throughput and del"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10235","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":"1902.10235","created_at":"2026-05-17T23:52:31.410869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10235v1","created_at":"2026-05-17T23:52:31.410869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10235","created_at":"2026-05-17T23:52:31.410869+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTDBTCUZ2MYO","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTDBTCUZ2MYOOFBC","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTDBTCUZ","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/MTDBTCUZ2MYOOFBCVWINILVN66","json":"https://pith.science/pith/MTDBTCUZ2MYOOFBCVWINILVN66.json","graph_json":"https://pith.science/api/pith-number/MTDBTCUZ2MYOOFBCVWINILVN66/graph.json","events_json":"https://pith.science/api/pith-number/MTDBTCUZ2MYOOFBCVWINILVN66/events.json","paper":"https://pith.science/paper/MTDBTCUZ"},"agent_actions":{"view_html":"https://pith.science/pith/MTDBTCUZ2MYOOFBCVWINILVN66","download_json":"https://pith.science/pith/MTDBTCUZ2MYOOFBCVWINILVN66.json","view_paper":"https://pith.science/paper/MTDBTCUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10235&json=true","fetch_graph":"https://pith.science/api/pith-number/MTDBTCUZ2MYOOFBCVWINILVN66/graph.json","fetch_events":"https://pith.science/api/pith-number/MTDBTCUZ2MYOOFBCVWINILVN66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTDBTCUZ2MYOOFBCVWINILVN66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTDBTCUZ2MYOOFBCVWINILVN66/action/storage_attestation","attest_author":"https://pith.science/pith/MTDBTCUZ2MYOOFBCVWINILVN66/action/author_attestation","sign_citation":"https://pith.science/pith/MTDBTCUZ2MYOOFBCVWINILVN66/action/citation_signature","submit_replication":"https://pith.science/pith/MTDBTCUZ2MYOOFBCVWINILVN66/action/replication_record"}},"created_at":"2026-05-17T23:52:31.410869+00:00","updated_at":"2026-05-17T23:52:31.410869+00:00"}