{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KYT2NQAOPHSDM7W2TUWPOY33YH","short_pith_number":"pith:KYT2NQAO","schema_version":"1.0","canonical_sha256":"5627a6c00e79e4367eda9d2cf7637bc1ceb9e475433e6cb92ac25e63b60a15f4","source":{"kind":"arxiv","id":"1809.04745","version":2},"attestation_state":"computed","paper":{"title":"A Coded Compressed Sensing Scheme for Uncoordinated Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Jean-Francois Chamberland, Krishna R. Narayanan, Vamsi K. Amalladinne","submitted_at":"2018-09-13T02:23:00Z","abstract_excerpt":"This article introduces a novel communication scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error correction to produce a novel uncoordinated access paradigm, along with a computationally efficient decoding algorithm. Within this framework, every active device partitions its data into several sub-blocks and, subsequently, adds redundancy using a systematic linear block code. Compressed sensing techniques are then employed to recover sub-blocks up to a per"},"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":"1809.04745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-13T02:23:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1c74b732e2820f2f42eb16cd91204fdeabeb27d87f3f89168f6ebdb431068f87","abstract_canon_sha256":"ec3989b39931a246e029e42c2d635b62acce4e135952ffb70666aac381d06e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:29.610161Z","signature_b64":"3P8Igal042Sqma8487ti4662XANdyKLfAN5lAX+w67JY854IZJlU+tpBX1hSRBv9LNdrA2KRid9KO0CaHg4OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5627a6c00e79e4367eda9d2cf7637bc1ceb9e475433e6cb92ac25e63b60a15f4","last_reissued_at":"2026-05-17T23:42:29.609700Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:29.609700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Coded Compressed Sensing Scheme for Uncoordinated Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Jean-Francois Chamberland, Krishna R. Narayanan, Vamsi K. Amalladinne","submitted_at":"2018-09-13T02:23:00Z","abstract_excerpt":"This article introduces a novel communication scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error correction to produce a novel uncoordinated access paradigm, along with a computationally efficient decoding algorithm. Within this framework, every active device partitions its data into several sub-blocks and, subsequently, adds redundancy using a systematic linear block code. Compressed sensing techniques are then employed to recover sub-blocks up to a per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04745","kind":"arxiv","version":2},"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":"1809.04745","created_at":"2026-05-17T23:42:29.609772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04745v2","created_at":"2026-05-17T23:42:29.609772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04745","created_at":"2026-05-17T23:42:29.609772+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYT2NQAOPHSD","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYT2NQAOPHSDM7W2","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYT2NQAO","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09448","citing_title":"Energy efficient coded random access for the wireless uplink","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH","json":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH.json","graph_json":"https://pith.science/api/pith-number/KYT2NQAOPHSDM7W2TUWPOY33YH/graph.json","events_json":"https://pith.science/api/pith-number/KYT2NQAOPHSDM7W2TUWPOY33YH/events.json","paper":"https://pith.science/paper/KYT2NQAO"},"agent_actions":{"view_html":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH","download_json":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH.json","view_paper":"https://pith.science/paper/KYT2NQAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04745&json=true","fetch_graph":"https://pith.science/api/pith-number/KYT2NQAOPHSDM7W2TUWPOY33YH/graph.json","fetch_events":"https://pith.science/api/pith-number/KYT2NQAOPHSDM7W2TUWPOY33YH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/action/storage_attestation","attest_author":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/action/author_attestation","sign_citation":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/action/citation_signature","submit_replication":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/action/replication_record"}},"created_at":"2026-05-17T23:42:29.609772+00:00","updated_at":"2026-05-17T23:42:29.609772+00:00"}