{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KYT2NQAOPHSDM7W2TUWPOY33YH","short_pith_number":"pith:KYT2NQAO","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"},"canonical_sha256":"5627a6c00e79e4367eda9d2cf7637bc1ceb9e475433e6cb92ac25e63b60a15f4","source":{"kind":"arxiv","id":"1809.04745","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04745","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04745v2","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04745","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"KYT2NQAOPHSD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KYT2NQAOPHSDM7W2","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KYT2NQAO","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KYT2NQAOPHSDM7W2TUWPOY33YH","target":"record","payload":{"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"},"canonical_sha256":"5627a6c00e79e4367eda9d2cf7637bc1ceb9e475433e6cb92ac25e63b60a15f4","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"},"source_kind":"arxiv","source_id":"1809.04745","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gaf9E7i4svoSubG9DhUmN0fqKmwD1ocC1sy9OmVGq5nh4fPpe6xZGOJbpthsvkC3OxWLxwQnM4P/s41+/6E9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:39:40.472603Z"},"content_sha256":"a5792aaa3853a53b31ff1f513bd2e9e3618fab37f8b401d514ef3c9dfd6d4b81","schema_version":"1.0","event_id":"sha256:a5792aaa3853a53b31ff1f513bd2e9e3618fab37f8b401d514ef3c9dfd6d4b81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KYT2NQAOPHSDM7W2TUWPOY33YH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQFM4cqq4SW1D1o0zx6YkmC/Bj7Ggnu+EqS7V2/fBPXfAB07WQmVRR+zcIGVhso4WvKkxwgU2R0ZDO7RMBzuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:39:40.473107Z"},"content_sha256":"42334c8b500313e7cd88dc17b45b7c7efd4e636773f1e164aaa8d21bbfe9eeda","schema_version":"1.0","event_id":"sha256:42334c8b500313e7cd88dc17b45b7c7efd4e636773f1e164aaa8d21bbfe9eeda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/bundle.json","state_url":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T03:39:40Z","links":{"resolver":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH","bundle":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/bundle.json","state":"https://pith.science/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYT2NQAOPHSDM7W2TUWPOY33YH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KYT2NQAOPHSDM7W2TUWPOY33YH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ec3989b39931a246e029e42c2d635b62acce4e135952ffb70666aac381d06e5a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-13T02:23:00Z","title_canon_sha256":"1c74b732e2820f2f42eb16cd91204fdeabeb27d87f3f89168f6ebdb431068f87"},"schema_version":"1.0","source":{"id":"1809.04745","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04745","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04745v2","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04745","created_at":"2026-05-17T23:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"KYT2NQAOPHSD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KYT2NQAOPHSDM7W2","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KYT2NQAO","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:42334c8b500313e7cd88dc17b45b7c7efd4e636773f1e164aaa8d21bbfe9eeda","target":"graph","created_at":"2026-05-17T23:42:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jean-Francois Chamberland, Krishna R. Narayanan, Vamsi K. Amalladinne","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-13T02:23:00Z","title":"A Coded Compressed Sensing Scheme for Uncoordinated Multiple Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04745","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a5792aaa3853a53b31ff1f513bd2e9e3618fab37f8b401d514ef3c9dfd6d4b81","target":"record","created_at":"2026-05-17T23:42:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ec3989b39931a246e029e42c2d635b62acce4e135952ffb70666aac381d06e5a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-09-13T02:23:00Z","title_canon_sha256":"1c74b732e2820f2f42eb16cd91204fdeabeb27d87f3f89168f6ebdb431068f87"},"schema_version":"1.0","source":{"id":"1809.04745","kind":"arxiv","version":2}},"canonical_sha256":"5627a6c00e79e4367eda9d2cf7637bc1ceb9e475433e6cb92ac25e63b60a15f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5627a6c00e79e4367eda9d2cf7637bc1ceb9e475433e6cb92ac25e63b60a15f4","first_computed_at":"2026-05-17T23:42:29.609700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:29.609700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3P8Igal042Sqma8487ti4662XANdyKLfAN5lAX+w67JY854IZJlU+tpBX1hSRBv9LNdrA2KRid9KO0CaHg4OAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:29.610161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04745","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5792aaa3853a53b31ff1f513bd2e9e3618fab37f8b401d514ef3c9dfd6d4b81","sha256:42334c8b500313e7cd88dc17b45b7c7efd4e636773f1e164aaa8d21bbfe9eeda"],"state_sha256":"9533024df30d6f81e9a01f02ddc9dc3f1e439041d84d67390ae04e037803465f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+PGaZJq591vbxowE7SqPGiZVUGkmZpBjn0CWG9MCfcVD2p1QIMlmx72sxIqvFR7vZNdMk38ISHYhhy4F2J6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:39:40.476744Z","bundle_sha256":"3808ad10108dec78e0d93630b5273f00f17a736b243f8167988517498219c4b0"}}