{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WTJ7U7QNWXB7UGLLHACQQ3XWHT","short_pith_number":"pith:WTJ7U7QN","schema_version":"1.0","canonical_sha256":"b4d3fa7e0db5c3fa196b3805086ef63cfde463a4ddff1d9485c7af7b162c618e","source":{"kind":"arxiv","id":"1612.07806","version":4},"attestation_state":"computed","paper":{"title":"Reliable recovery of hierarchically sparse signals for Gaussian and Kronecker product measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Axel Flinth, Gerhard Wunder, Ingo Roth, Jens Eisert, Martin Kliesch","submitted_at":"2016-12-22T21:00:02Z","abstract_excerpt":"We propose and analyze a solution to the problem of recovering a block sparse signal with sparse blocks from linear measurements. Such problems naturally emerge inter alia in the context of mobile communication, in order to meet the scalability and low complexity requirements of massive antenna systems and massive machine-type communication. We introduce a new variant of the Hard Thresholding Pursuit (HTP) algorithm referred to as HiHTP. We provide both a proof of convergence and a recovery guarantee for noisy Gaussian measurements that exhibit an improved asymptotic scaling in terms of the sa"},"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":"1612.07806","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-22T21:00:02Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"c001d52a1bba93651d8828de9649394c3fa1ee422224fc810879678abcee20ac","abstract_canon_sha256":"d69245e52455ff1a07f259f8280e8e398ba89cf1abca35f9151a4ee63b1a62cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:56.287751Z","signature_b64":"4Ru0obu+Z5t4Stn7LTxkXj7sL7ER3jkUofPez265b17jN5+GuoIGfvsnnulP70q4vq8027+ipdDKxXb70cJlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4d3fa7e0db5c3fa196b3805086ef63cfde463a4ddff1d9485c7af7b162c618e","last_reissued_at":"2026-07-05T01:36:56.287237Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:56.287237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reliable recovery of hierarchically sparse signals for Gaussian and Kronecker product measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Axel Flinth, Gerhard Wunder, Ingo Roth, Jens Eisert, Martin Kliesch","submitted_at":"2016-12-22T21:00:02Z","abstract_excerpt":"We propose and analyze a solution to the problem of recovering a block sparse signal with sparse blocks from linear measurements. Such problems naturally emerge inter alia in the context of mobile communication, in order to meet the scalability and low complexity requirements of massive antenna systems and massive machine-type communication. We introduce a new variant of the Hard Thresholding Pursuit (HTP) algorithm referred to as HiHTP. We provide both a proof of convergence and a recovery guarantee for noisy Gaussian measurements that exhibit an improved asymptotic scaling in terms of the sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07806","kind":"arxiv","version":4},"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/1612.07806/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.07806","created_at":"2026-07-05T01:36:56.287301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07806v4","created_at":"2026-07-05T01:36:56.287301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07806","created_at":"2026-07-05T01:36:56.287301+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTJ7U7QNWXB7","created_at":"2026-07-05T01:36:56.287301+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTJ7U7QNWXB7UGLL","created_at":"2026-07-05T01:36:56.287301+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTJ7U7QN","created_at":"2026-07-05T01:36:56.287301+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/WTJ7U7QNWXB7UGLLHACQQ3XWHT","json":"https://pith.science/pith/WTJ7U7QNWXB7UGLLHACQQ3XWHT.json","graph_json":"https://pith.science/api/pith-number/WTJ7U7QNWXB7UGLLHACQQ3XWHT/graph.json","events_json":"https://pith.science/api/pith-number/WTJ7U7QNWXB7UGLLHACQQ3XWHT/events.json","paper":"https://pith.science/paper/WTJ7U7QN"},"agent_actions":{"view_html":"https://pith.science/pith/WTJ7U7QNWXB7UGLLHACQQ3XWHT","download_json":"https://pith.science/pith/WTJ7U7QNWXB7UGLLHACQQ3XWHT.json","view_paper":"https://pith.science/paper/WTJ7U7QN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07806&json=true","fetch_graph":"https://pith.science/api/pith-number/WTJ7U7QNWXB7UGLLHACQQ3XWHT/graph.json","fetch_events":"https://pith.science/api/pith-number/WTJ7U7QNWXB7UGLLHACQQ3XWHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTJ7U7QNWXB7UGLLHACQQ3XWHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTJ7U7QNWXB7UGLLHACQQ3XWHT/action/storage_attestation","attest_author":"https://pith.science/pith/WTJ7U7QNWXB7UGLLHACQQ3XWHT/action/author_attestation","sign_citation":"https://pith.science/pith/WTJ7U7QNWXB7UGLLHACQQ3XWHT/action/citation_signature","submit_replication":"https://pith.science/pith/WTJ7U7QNWXB7UGLLHACQQ3XWHT/action/replication_record"}},"created_at":"2026-07-05T01:36:56.287301+00:00","updated_at":"2026-07-05T01:36:56.287301+00:00"}