{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:V7UZCEKQ5ISDRBG5DSERNQ6IYI","short_pith_number":"pith:V7UZCEKQ","canonical_record":{"source":{"id":"1806.02754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T16:16:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15727b4250f2230a0896bb3ae17e514c2789ee153175b4d6a1ed7fdd61eed387","abstract_canon_sha256":"05764bc33d40dc6eb21329a19f8d79416b7ec50167952d05e591159d7e033796"},"schema_version":"1.0"},"canonical_sha256":"afe9911150ea243884dd1c8916c3c8c23da353ad7749e54a9d361e7ce5fe3ca6","source":{"kind":"arxiv","id":"1806.02754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02754","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02754v2","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02754","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"V7UZCEKQ5ISD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"V7UZCEKQ5ISDRBG5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"V7UZCEKQ","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:V7UZCEKQ5ISDRBG5DSERNQ6IYI","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T16:16:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15727b4250f2230a0896bb3ae17e514c2789ee153175b4d6a1ed7fdd61eed387","abstract_canon_sha256":"05764bc33d40dc6eb21329a19f8d79416b7ec50167952d05e591159d7e033796"},"schema_version":"1.0"},"canonical_sha256":"afe9911150ea243884dd1c8916c3c8c23da353ad7749e54a9d361e7ce5fe3ca6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:49.313875Z","signature_b64":"B/9ZPkKy9fcyxgHeaqJzyhVqGkYdITR5GkeF4DlDJPUcgmuYaJ/xSkuo7ei1zZ7MWxC42Ai83Dh+OveItUpVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afe9911150ea243884dd1c8916c3c8c23da353ad7749e54a9d361e7ce5fe3ca6","last_reissued_at":"2026-05-18T00:02:49.313506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:49.313506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02754","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-18T00:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8i+Te/EI8yiBXsMAWXtVgwuwHzkL9NpwguvdaPZvlb5qtbmug6UbcGfbBbfHzmFjzYj8Yrw/epmSsZCngo0GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:59:19.099287Z"},"content_sha256":"0c40c171363577c3e36b5a2a471eebed473607b1ed0ea659ab54e7710c7c3ab8","schema_version":"1.0","event_id":"sha256:0c40c171363577c3e36b5a2a471eebed473607b1ed0ea659ab54e7710c7c3ab8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:V7UZCEKQ5ISDRBG5DSERNQ6IYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance of Hierarchical Sparse Detectors for Massive MTC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Wunder, Ingo Roth, Jens Eisert, Rick Fritschek","submitted_at":"2018-06-07T16:16:26Z","abstract_excerpt":"Recently, a new class of so-called \\emph{hierarchical thresholding algorithms} was introduced to optimally exploit the sparsity structure in joint user activity and channel detection problems. In this paper, we take a closer look at the user detection performance of such algorithms under noise and relate its performance to the classical block correlation detector with orthogonal signatures. More specifically, we derive a lower bound for the diversity order which, under suitable choice of the signatures, equals that of the block correlation detector. Surprisingly, in specific parameter settings"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02754","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-18T00:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEeQvUUtLgLJEiUyYSQ6S9RU3W22bKRCNzVijH5XHSE07roAwHkYAbEf4J7j+2ifVYPEKsAo+M6tB1orGoA4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:59:19.099663Z"},"content_sha256":"3d5701995a8cb7c80351cd8ef6a7a61949a529d20c38b2c76ea220bb777d423e","schema_version":"1.0","event_id":"sha256:3d5701995a8cb7c80351cd8ef6a7a61949a529d20c38b2c76ea220bb777d423e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/bundle.json","state_url":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/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-28T16:59:19Z","links":{"resolver":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI","bundle":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/bundle.json","state":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:V7UZCEKQ5ISDRBG5DSERNQ6IYI","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":"05764bc33d40dc6eb21329a19f8d79416b7ec50167952d05e591159d7e033796","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T16:16:26Z","title_canon_sha256":"15727b4250f2230a0896bb3ae17e514c2789ee153175b4d6a1ed7fdd61eed387"},"schema_version":"1.0","source":{"id":"1806.02754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02754","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02754v2","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02754","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"V7UZCEKQ5ISD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"V7UZCEKQ5ISDRBG5","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"V7UZCEKQ","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:3d5701995a8cb7c80351cd8ef6a7a61949a529d20c38b2c76ea220bb777d423e","target":"graph","created_at":"2026-05-18T00:02:49Z","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":"Recently, a new class of so-called \\emph{hierarchical thresholding algorithms} was introduced to optimally exploit the sparsity structure in joint user activity and channel detection problems. In this paper, we take a closer look at the user detection performance of such algorithms under noise and relate its performance to the classical block correlation detector with orthogonal signatures. More specifically, we derive a lower bound for the diversity order which, under suitable choice of the signatures, equals that of the block correlation detector. Surprisingly, in specific parameter settings","authors_text":"Gerhard Wunder, Ingo Roth, Jens Eisert, Rick Fritschek","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T16:16:26Z","title":"Performance of Hierarchical Sparse Detectors for Massive MTC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02754","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:0c40c171363577c3e36b5a2a471eebed473607b1ed0ea659ab54e7710c7c3ab8","target":"record","created_at":"2026-05-18T00:02:49Z","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":"05764bc33d40dc6eb21329a19f8d79416b7ec50167952d05e591159d7e033796","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-07T16:16:26Z","title_canon_sha256":"15727b4250f2230a0896bb3ae17e514c2789ee153175b4d6a1ed7fdd61eed387"},"schema_version":"1.0","source":{"id":"1806.02754","kind":"arxiv","version":2}},"canonical_sha256":"afe9911150ea243884dd1c8916c3c8c23da353ad7749e54a9d361e7ce5fe3ca6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afe9911150ea243884dd1c8916c3c8c23da353ad7749e54a9d361e7ce5fe3ca6","first_computed_at":"2026-05-18T00:02:49.313506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:49.313506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B/9ZPkKy9fcyxgHeaqJzyhVqGkYdITR5GkeF4DlDJPUcgmuYaJ/xSkuo7ei1zZ7MWxC42Ai83Dh+OveItUpVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:49.313875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c40c171363577c3e36b5a2a471eebed473607b1ed0ea659ab54e7710c7c3ab8","sha256:3d5701995a8cb7c80351cd8ef6a7a61949a529d20c38b2c76ea220bb777d423e"],"state_sha256":"b074a3e189a4700e2c762f08e133b3ed15e781515d48b823257909e211d93e8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRPd9iHxt2HyLZfJd5ptu6382G+mVPD6PmRStPH6RVSb8bKrszNw7OC6gHZQDIupTd/Ho0Qj9a5+WnRaQ/I+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:59:19.101907Z","bundle_sha256":"1f379a1805a9879387308af9b0e51e6aefeec8aea040e41517a0a8a9130a0e65"}}