{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OPWLABMQQVBYOISBDVXODX2VR2","short_pith_number":"pith:OPWLABMQ","schema_version":"1.0","canonical_sha256":"73ecb0059085438722411d6ee1df558e8164dfbe66362aa2f66fe154f4947410","source":{"kind":"arxiv","id":"1803.10994","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Sparse Channel Estimation for Massive MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Axel Flinth, Gerhard Wunder, Gitta Kutyniok, Giuseppe Caire, Ingo Roth, Mahdi Barzegar, Saeid Haghighatshoar","submitted_at":"2018-03-29T10:02:02Z","abstract_excerpt":"The problem of wideband massive MIMO channel estimation is considered. Targeting for low complexity algorithms as well as small training overhead, a compressive sensing (CS) approach is pursued. Unfortunately, due to the Kronecker-type sensing (measurement) matrix corresponding to this setup, application of standard CS algorithms and analysis methodology does not apply. By recognizing that the channel possesses a special structure, termed hierarchical sparsity, we propose an efficient algorithm that explicitly takes into account this property. In addition, by extending the standard CS analysis"},"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":"1803.10994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-29T10:02:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a9f3e7125049254d4ebf651f28fde38f91ec1b0964fc94cd9f19ddd5b5e5379b","abstract_canon_sha256":"007809dd7f0c5b3ad87371fe33522383b6074ff2af91ac357fc729e1138f5691"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:49.595291Z","signature_b64":"steimROKmqnUi3MlLWrDjnYfZQkk2Bkxk2eNXiliAhylyIYzfLa251BCKHcWNQ6UY6qhWed+q8//h30N4rbFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73ecb0059085438722411d6ee1df558e8164dfbe66362aa2f66fe154f4947410","last_reissued_at":"2026-05-18T00:19:49.594645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:49.594645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Sparse Channel Estimation for Massive MIMO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Axel Flinth, Gerhard Wunder, Gitta Kutyniok, Giuseppe Caire, Ingo Roth, Mahdi Barzegar, Saeid Haghighatshoar","submitted_at":"2018-03-29T10:02:02Z","abstract_excerpt":"The problem of wideband massive MIMO channel estimation is considered. Targeting for low complexity algorithms as well as small training overhead, a compressive sensing (CS) approach is pursued. Unfortunately, due to the Kronecker-type sensing (measurement) matrix corresponding to this setup, application of standard CS algorithms and analysis methodology does not apply. By recognizing that the channel possesses a special structure, termed hierarchical sparsity, we propose an efficient algorithm that explicitly takes into account this property. In addition, by extending the standard CS analysis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10994","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":""},"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":"1803.10994","created_at":"2026-05-18T00:19:49.594749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10994v1","created_at":"2026-05-18T00:19:49.594749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10994","created_at":"2026-05-18T00:19:49.594749+00:00"},{"alias_kind":"pith_short_12","alias_value":"OPWLABMQQVBY","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OPWLABMQQVBYOISB","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OPWLABMQ","created_at":"2026-05-18T12:32:43.782077+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/OPWLABMQQVBYOISBDVXODX2VR2","json":"https://pith.science/pith/OPWLABMQQVBYOISBDVXODX2VR2.json","graph_json":"https://pith.science/api/pith-number/OPWLABMQQVBYOISBDVXODX2VR2/graph.json","events_json":"https://pith.science/api/pith-number/OPWLABMQQVBYOISBDVXODX2VR2/events.json","paper":"https://pith.science/paper/OPWLABMQ"},"agent_actions":{"view_html":"https://pith.science/pith/OPWLABMQQVBYOISBDVXODX2VR2","download_json":"https://pith.science/pith/OPWLABMQQVBYOISBDVXODX2VR2.json","view_paper":"https://pith.science/paper/OPWLABMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10994&json=true","fetch_graph":"https://pith.science/api/pith-number/OPWLABMQQVBYOISBDVXODX2VR2/graph.json","fetch_events":"https://pith.science/api/pith-number/OPWLABMQQVBYOISBDVXODX2VR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OPWLABMQQVBYOISBDVXODX2VR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OPWLABMQQVBYOISBDVXODX2VR2/action/storage_attestation","attest_author":"https://pith.science/pith/OPWLABMQQVBYOISBDVXODX2VR2/action/author_attestation","sign_citation":"https://pith.science/pith/OPWLABMQQVBYOISBDVXODX2VR2/action/citation_signature","submit_replication":"https://pith.science/pith/OPWLABMQQVBYOISBDVXODX2VR2/action/replication_record"}},"created_at":"2026-05-18T00:19:49.594749+00:00","updated_at":"2026-05-18T00:19:49.594749+00:00"}