{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:N4WQO7MQ5XS7QWVRMGERHPDSTB","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":"7a80abdc931e2158bc68cf6f15aa4fbbc2a71f4c9ab40189b640dfe01f8a7867","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-07T23:32:02Z","title_canon_sha256":"696ff15520fe398fe0055b0383cd66687e95e8104ad6673cb975a74e147884f8"},"schema_version":"1.0","source":{"id":"2002.03044","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03044","created_at":"2026-07-05T01:35:28Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03044v4","created_at":"2026-07-05T01:35:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03044","created_at":"2026-07-05T01:35:28Z"},{"alias_kind":"pith_short_12","alias_value":"N4WQO7MQ5XS7","created_at":"2026-07-05T01:35:28Z"},{"alias_kind":"pith_short_16","alias_value":"N4WQO7MQ5XS7QWVR","created_at":"2026-07-05T01:35:28Z"},{"alias_kind":"pith_short_8","alias_value":"N4WQO7MQ","created_at":"2026-07-05T01:35:28Z"}],"graph_snapshots":[{"event_id":"sha256:2f6214dcb65103001c96bb33f1b120477353b5d81bb129b10452d3999dd46aeb","target":"graph","created_at":"2026-07-05T01:35:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.03044/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We put forward a new algorithmic solution to the massive unsourced random access (URA) problem, by leveraging the rich spatial dimensionality offered by large-scale antenna arrays. This paper makes an observation that spatial signature is key to URA in massive connectivity setups. The proposed scheme relies on a slotted transmission framework but eliminates the need for concatenated coding that was introduced in the context of the coupled compressive sensing (CCS) paradigm. Indeed, all existing works on CCS-based URA rely on an inner/outer tree-based encoder/decoder to stitch the slot-wise rec","authors_text":"Amine Mezghani, Ekram Hossain, Faouzi Bellili, Volodymyr Shyianov","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-07T23:32:02Z","title":"Massive Unsourced Random Access Based on Uncoupled Compressive Sensing: Another Blessing of Massive MIMO"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03044","kind":"arxiv","version":4},"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:4715876dc18fd71cd857267352aae7765b43cf4803cac9bd7241e2aae9a60782","target":"record","created_at":"2026-07-05T01:35:28Z","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":"7a80abdc931e2158bc68cf6f15aa4fbbc2a71f4c9ab40189b640dfe01f8a7867","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-07T23:32:02Z","title_canon_sha256":"696ff15520fe398fe0055b0383cd66687e95e8104ad6673cb975a74e147884f8"},"schema_version":"1.0","source":{"id":"2002.03044","kind":"arxiv","version":4}},"canonical_sha256":"6f2d077d90ede5f85ab1618913bc729861bc745e84ea1d5fb143dfc18fd821c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f2d077d90ede5f85ab1618913bc729861bc745e84ea1d5fb143dfc18fd821c0","first_computed_at":"2026-07-05T01:35:28.274284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:35:28.274284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v9TgGpG1AdvdysjVPbdNIOUKHCXzXMcH3/gduzhRAfFUfCECP24+O8L0f29zo2ap9+Kbv3paeX9fyMDQhv0iDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:35:28.274786Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.03044","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4715876dc18fd71cd857267352aae7765b43cf4803cac9bd7241e2aae9a60782","sha256:2f6214dcb65103001c96bb33f1b120477353b5d81bb129b10452d3999dd46aeb"],"state_sha256":"c767fba363928d4cbcb0416743d9a85bc7c1834b523c5738a693b20bf8b48f54"}