{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:JSMYEKA62B6PVHUAFO2SH4GCDV","short_pith_number":"pith:JSMYEKA6","canonical_record":{"source":{"id":"2101.00651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-03T16:08:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0642c40124018b678eae064f93df05c4e8fa813f8cf7fd8abe6357bf4aa57a18","abstract_canon_sha256":"4e5cc31f49ae6e2839909df4e27367edd929492bf8045e07af318c81ef17232a"},"schema_version":"1.0"},"canonical_sha256":"4c9982281ed07cfa9e802bb523f0c21d7258a71a8cb7c2dad96a0e33f609ba38","source":{"kind":"arxiv","id":"2101.00651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.00651","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"arxiv_version","alias_value":"2101.00651v1","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00651","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"pith_short_12","alias_value":"JSMYEKA62B6P","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"pith_short_16","alias_value":"JSMYEKA62B6PVHUA","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"pith_short_8","alias_value":"JSMYEKA6","created_at":"2026-07-05T02:04:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:JSMYEKA62B6PVHUAFO2SH4GCDV","target":"record","payload":{"canonical_record":{"source":{"id":"2101.00651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-03T16:08:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0642c40124018b678eae064f93df05c4e8fa813f8cf7fd8abe6357bf4aa57a18","abstract_canon_sha256":"4e5cc31f49ae6e2839909df4e27367edd929492bf8045e07af318c81ef17232a"},"schema_version":"1.0"},"canonical_sha256":"4c9982281ed07cfa9e802bb523f0c21d7258a71a8cb7c2dad96a0e33f609ba38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:20.462212Z","signature_b64":"iIXZVkaE3OShNSCT3IZeHLkgV0cdoGpFRbHtWVzOOKacR1GsxvblZC2xY2MmwmjuIdUzddNtJgoVVkOgRKpHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c9982281ed07cfa9e802bb523f0c21d7258a71a8cb7c2dad96a0e33f609ba38","last_reissued_at":"2026-07-05T02:04:20.461879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:20.461879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.00651","source_version":1,"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-07-05T02:04:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpMbwPt7ff/YJH0XY8Zxso02bFIfYxmAA7Ni9TIhuuSzPevMfbS7HEtWZUYv8Ee2LR+8HywdMlPrgQxJnq2mAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:35:30.253310Z"},"content_sha256":"6cecc0ff119721bbb24636c98a5537f184ca518f0d8e3f3d6b03b64f97b4d83c","schema_version":"1.0","event_id":"sha256:6cecc0ff119721bbb24636c98a5537f184ca518f0d8e3f3d6b03b64f97b4d83c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:JSMYEKA62B6PVHUAFO2SH4GCDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep-Learned Approximate Message Passing for Asynchronous Massive Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Meixia Tao, Weifeng Zhu, Xiaojun Yuan, Yunfeng Guan","submitted_at":"2021-01-03T16:08:46Z","abstract_excerpt":"This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design algorithms for joint user activity detection, delay detection, and channel estimation. By exploiting the sparsity on both user activity and delays, we formulate a hierarchical sparse signal recovery problem in both the single-antenna and the multiple-antenna scenarios. While traditional compressed sensing algorithms can be applied to these problems, they su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00651","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.00651/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:04:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+tJeDkCGx1tK2poyZXp0rXgCZKMmY55LVL4ud2tt3Zwe98mDt7eM+LANEXE6SKDhcGsBP4xT5CxSc2YYtq1dBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T10:35:30.253933Z"},"content_sha256":"f2db75f4f863028aefd182e2955e465b60681ff05d0de0192daa4e5379608fff","schema_version":"1.0","event_id":"sha256:f2db75f4f863028aefd182e2955e465b60681ff05d0de0192daa4e5379608fff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSMYEKA62B6PVHUAFO2SH4GCDV/bundle.json","state_url":"https://pith.science/pith/JSMYEKA62B6PVHUAFO2SH4GCDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSMYEKA62B6PVHUAFO2SH4GCDV/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-07-05T10:35:30Z","links":{"resolver":"https://pith.science/pith/JSMYEKA62B6PVHUAFO2SH4GCDV","bundle":"https://pith.science/pith/JSMYEKA62B6PVHUAFO2SH4GCDV/bundle.json","state":"https://pith.science/pith/JSMYEKA62B6PVHUAFO2SH4GCDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSMYEKA62B6PVHUAFO2SH4GCDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JSMYEKA62B6PVHUAFO2SH4GCDV","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":"4e5cc31f49ae6e2839909df4e27367edd929492bf8045e07af318c81ef17232a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-03T16:08:46Z","title_canon_sha256":"0642c40124018b678eae064f93df05c4e8fa813f8cf7fd8abe6357bf4aa57a18"},"schema_version":"1.0","source":{"id":"2101.00651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.00651","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"arxiv_version","alias_value":"2101.00651v1","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00651","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"pith_short_12","alias_value":"JSMYEKA62B6P","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"pith_short_16","alias_value":"JSMYEKA62B6PVHUA","created_at":"2026-07-05T02:04:20Z"},{"alias_kind":"pith_short_8","alias_value":"JSMYEKA6","created_at":"2026-07-05T02:04:20Z"}],"graph_snapshots":[{"event_id":"sha256:f2db75f4f863028aefd182e2955e465b60681ff05d0de0192daa4e5379608fff","target":"graph","created_at":"2026-07-05T02:04:20Z","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/2101.00651/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design algorithms for joint user activity detection, delay detection, and channel estimation. By exploiting the sparsity on both user activity and delays, we formulate a hierarchical sparse signal recovery problem in both the single-antenna and the multiple-antenna scenarios. While traditional compressed sensing algorithms can be applied to these problems, they su","authors_text":"Meixia Tao, Weifeng Zhu, Xiaojun Yuan, Yunfeng Guan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-03T16:08:46Z","title":"Deep-Learned Approximate Message Passing for Asynchronous Massive Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00651","kind":"arxiv","version":1},"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:6cecc0ff119721bbb24636c98a5537f184ca518f0d8e3f3d6b03b64f97b4d83c","target":"record","created_at":"2026-07-05T02:04:20Z","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":"4e5cc31f49ae6e2839909df4e27367edd929492bf8045e07af318c81ef17232a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-03T16:08:46Z","title_canon_sha256":"0642c40124018b678eae064f93df05c4e8fa813f8cf7fd8abe6357bf4aa57a18"},"schema_version":"1.0","source":{"id":"2101.00651","kind":"arxiv","version":1}},"canonical_sha256":"4c9982281ed07cfa9e802bb523f0c21d7258a71a8cb7c2dad96a0e33f609ba38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c9982281ed07cfa9e802bb523f0c21d7258a71a8cb7c2dad96a0e33f609ba38","first_computed_at":"2026-07-05T02:04:20.461879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:04:20.461879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iIXZVkaE3OShNSCT3IZeHLkgV0cdoGpFRbHtWVzOOKacR1GsxvblZC2xY2MmwmjuIdUzddNtJgoVVkOgRKpHCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:04:20.462212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.00651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cecc0ff119721bbb24636c98a5537f184ca518f0d8e3f3d6b03b64f97b4d83c","sha256:f2db75f4f863028aefd182e2955e465b60681ff05d0de0192daa4e5379608fff"],"state_sha256":"97fca6fd02d8b1c15d9eaba11df7d2e4d3070546be6013e18ccc0908bbc0d6c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sph9jMeByT+jYqjfPEzPyzlLPIdzpK4LPlYCjBp0E6tgbkOBmniX7PWZpcvPSABzYFa+5DWUVrGY+omSvlFWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T10:35:30.256389Z","bundle_sha256":"fcacfaf2f7a29e5238fefb480fcbad118cd96394a5a2ea81e39d98219ab4e249"}}