{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PGB64FCB5PV3YX5XZ4ZLGTG6PB","short_pith_number":"pith:PGB64FCB","schema_version":"1.0","canonical_sha256":"7983ee1441ebebbc5fb7cf32b34cde784116b895bf143b69551334df7f4c5641","source":{"kind":"arxiv","id":"1806.00138","version":1},"attestation_state":"computed","paper":{"title":"A Coupled Compressive Sensing Scheme for Unsourced Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Avinash Vem, Dileep Kumar Soma, Jean-Francois Chamberland, Krishna R. Narayanan, Vamsi K. Amalladinne","submitted_at":"2018-05-31T23:38:54Z","abstract_excerpt":"This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally efficient algorithm. Within the proposed framework, every active device first partitions its data into several sub-blocks, and subsequently adds redundancy using a systematic linear block code. Compressive sensing techniques are then employed to recover sub-blocks, and the original messages are obtained by connecting pieces together using a low-complexity tree"},"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":"1806.00138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-31T23:38:54Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"cfb41db1c3b1974e6a744aa54b16756484af00045a4122837cbb95ca841669e6","abstract_canon_sha256":"5d7c353051e1ca092c2d03670a78292484821810925a88cf6b3f72f5da5e54cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:27.794769Z","signature_b64":"CYDQmBNGJDMZ/VAUidb8kBrWAzl55+mOJDHfORuuL0JM0GxuFi2cSyIH8cUot+FLKcfcq+Su570lvf6vSsqvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7983ee1441ebebbc5fb7cf32b34cde784116b895bf143b69551334df7f4c5641","last_reissued_at":"2026-05-18T00:14:27.793897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:27.793897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Coupled Compressive Sensing Scheme for Unsourced Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Avinash Vem, Dileep Kumar Soma, Jean-Francois Chamberland, Krishna R. Narayanan, Vamsi K. Amalladinne","submitted_at":"2018-05-31T23:38:54Z","abstract_excerpt":"This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally efficient algorithm. Within the proposed framework, every active device first partitions its data into several sub-blocks, and subsequently adds redundancy using a systematic linear block code. Compressive sensing techniques are then employed to recover sub-blocks, and the original messages are obtained by connecting pieces together using a low-complexity tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00138","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":"1806.00138","created_at":"2026-05-18T00:14:27.794029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00138v1","created_at":"2026-05-18T00:14:27.794029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00138","created_at":"2026-05-18T00:14:27.794029+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGB64FCB5PV3","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGB64FCB5PV3YX5X","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGB64FCB","created_at":"2026-05-18T12:32:43.782077+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/PGB64FCB5PV3YX5XZ4ZLGTG6PB","json":"https://pith.science/pith/PGB64FCB5PV3YX5XZ4ZLGTG6PB.json","graph_json":"https://pith.science/api/pith-number/PGB64FCB5PV3YX5XZ4ZLGTG6PB/graph.json","events_json":"https://pith.science/api/pith-number/PGB64FCB5PV3YX5XZ4ZLGTG6PB/events.json","paper":"https://pith.science/paper/PGB64FCB"},"agent_actions":{"view_html":"https://pith.science/pith/PGB64FCB5PV3YX5XZ4ZLGTG6PB","download_json":"https://pith.science/pith/PGB64FCB5PV3YX5XZ4ZLGTG6PB.json","view_paper":"https://pith.science/paper/PGB64FCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00138&json=true","fetch_graph":"https://pith.science/api/pith-number/PGB64FCB5PV3YX5XZ4ZLGTG6PB/graph.json","fetch_events":"https://pith.science/api/pith-number/PGB64FCB5PV3YX5XZ4ZLGTG6PB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGB64FCB5PV3YX5XZ4ZLGTG6PB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGB64FCB5PV3YX5XZ4ZLGTG6PB/action/storage_attestation","attest_author":"https://pith.science/pith/PGB64FCB5PV3YX5XZ4ZLGTG6PB/action/author_attestation","sign_citation":"https://pith.science/pith/PGB64FCB5PV3YX5XZ4ZLGTG6PB/action/citation_signature","submit_replication":"https://pith.science/pith/PGB64FCB5PV3YX5XZ4ZLGTG6PB/action/replication_record"}},"created_at":"2026-05-18T00:14:27.794029+00:00","updated_at":"2026-05-18T00:14:27.794029+00:00"}