{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:V7UZCEKQ5ISDRBG5DSERNQ6IYI","short_pith_number":"pith:V7UZCEKQ","schema_version":"1.0","canonical_sha256":"afe9911150ea243884dd1c8916c3c8c23da353ad7749e54a9d361e7ce5fe3ca6","source":{"kind":"arxiv","id":"1806.02754","version":2},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.02754","created_at":"2026-05-18T00:02:49.313567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02754v2","created_at":"2026-05-18T00:02:49.313567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02754","created_at":"2026-05-18T00:02:49.313567+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7UZCEKQ5ISD","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7UZCEKQ5ISDRBG5","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7UZCEKQ","created_at":"2026-05-18T12:32:59.047623+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/V7UZCEKQ5ISDRBG5DSERNQ6IYI","json":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI.json","graph_json":"https://pith.science/api/pith-number/V7UZCEKQ5ISDRBG5DSERNQ6IYI/graph.json","events_json":"https://pith.science/api/pith-number/V7UZCEKQ5ISDRBG5DSERNQ6IYI/events.json","paper":"https://pith.science/paper/V7UZCEKQ"},"agent_actions":{"view_html":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI","download_json":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI.json","view_paper":"https://pith.science/paper/V7UZCEKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02754&json=true","fetch_graph":"https://pith.science/api/pith-number/V7UZCEKQ5ISDRBG5DSERNQ6IYI/graph.json","fetch_events":"https://pith.science/api/pith-number/V7UZCEKQ5ISDRBG5DSERNQ6IYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/action/storage_attestation","attest_author":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/action/author_attestation","sign_citation":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/action/citation_signature","submit_replication":"https://pith.science/pith/V7UZCEKQ5ISDRBG5DSERNQ6IYI/action/replication_record"}},"created_at":"2026-05-18T00:02:49.313567+00:00","updated_at":"2026-05-18T00:02:49.313567+00:00"}