{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5JHSHXK43Q5MOLNJTH5V4VHSPY","short_pith_number":"pith:5JHSHXK4","schema_version":"1.0","canonical_sha256":"ea4f23dd5cdc3ac72da999fb5e54f27e0702d814248a6432e59e8a727a1e529d","source":{"kind":"arxiv","id":"1504.04184","version":1},"attestation_state":"computed","paper":{"title":"Multichannel sparse recovery of complex-valued signals using Huber's criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.CO","stat.ML"],"primary_cat":"cs.IT","authors_text":"Esa Ollila","submitted_at":"2015-04-16T11:25:40Z","abstract_excerpt":"In this paper, we generalize Huber's criterion to multichannel sparse recovery problem of complex-valued measurements where the objective is to find good recovery of jointly sparse unknown signal vectors from the given multiple measurement vectors which are different linear combinations of the same known elementary vectors. This requires careful characterization of robust complex-valued loss functions as well as Huber's criterion function for the multivariate sparse regression problem. We devise a greedy algorithm based on simultaneous normalized iterative hard thresholding (SNIHT) algorithm. "},"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":"1504.04184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-16T11:25:40Z","cross_cats_sorted":["math.IT","stat.CO","stat.ML"],"title_canon_sha256":"fb3e704185236ef838be2663bbc53730441a618df97434378b32679ef22f0b90","abstract_canon_sha256":"6aaf3b7cda6b7edf469ba9aa58ee8edee5fab63bfef8624effb172812bb0e9fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:39.550106Z","signature_b64":"2iW3KPjF4UADDYYz0P2n7LzgxqmCirJMqshq82P6/CIGiQXX+OIaDVjN8NsjRkhvLkx5zsLLR6y4efge/7yODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea4f23dd5cdc3ac72da999fb5e54f27e0702d814248a6432e59e8a727a1e529d","last_reissued_at":"2026-05-18T02:18:39.549402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:39.549402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multichannel sparse recovery of complex-valued signals using Huber's criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.CO","stat.ML"],"primary_cat":"cs.IT","authors_text":"Esa Ollila","submitted_at":"2015-04-16T11:25:40Z","abstract_excerpt":"In this paper, we generalize Huber's criterion to multichannel sparse recovery problem of complex-valued measurements where the objective is to find good recovery of jointly sparse unknown signal vectors from the given multiple measurement vectors which are different linear combinations of the same known elementary vectors. This requires careful characterization of robust complex-valued loss functions as well as Huber's criterion function for the multivariate sparse regression problem. We devise a greedy algorithm based on simultaneous normalized iterative hard thresholding (SNIHT) algorithm. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04184","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":"1504.04184","created_at":"2026-05-18T02:18:39.549529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04184v1","created_at":"2026-05-18T02:18:39.549529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04184","created_at":"2026-05-18T02:18:39.549529+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JHSHXK43Q5M","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JHSHXK43Q5MOLNJ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JHSHXK4","created_at":"2026-05-18T12:29:05.191682+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/5JHSHXK43Q5MOLNJTH5V4VHSPY","json":"https://pith.science/pith/5JHSHXK43Q5MOLNJTH5V4VHSPY.json","graph_json":"https://pith.science/api/pith-number/5JHSHXK43Q5MOLNJTH5V4VHSPY/graph.json","events_json":"https://pith.science/api/pith-number/5JHSHXK43Q5MOLNJTH5V4VHSPY/events.json","paper":"https://pith.science/paper/5JHSHXK4"},"agent_actions":{"view_html":"https://pith.science/pith/5JHSHXK43Q5MOLNJTH5V4VHSPY","download_json":"https://pith.science/pith/5JHSHXK43Q5MOLNJTH5V4VHSPY.json","view_paper":"https://pith.science/paper/5JHSHXK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04184&json=true","fetch_graph":"https://pith.science/api/pith-number/5JHSHXK43Q5MOLNJTH5V4VHSPY/graph.json","fetch_events":"https://pith.science/api/pith-number/5JHSHXK43Q5MOLNJTH5V4VHSPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JHSHXK43Q5MOLNJTH5V4VHSPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JHSHXK43Q5MOLNJTH5V4VHSPY/action/storage_attestation","attest_author":"https://pith.science/pith/5JHSHXK43Q5MOLNJTH5V4VHSPY/action/author_attestation","sign_citation":"https://pith.science/pith/5JHSHXK43Q5MOLNJTH5V4VHSPY/action/citation_signature","submit_replication":"https://pith.science/pith/5JHSHXK43Q5MOLNJTH5V4VHSPY/action/replication_record"}},"created_at":"2026-05-18T02:18:39.549529+00:00","updated_at":"2026-05-18T02:18:39.549529+00:00"}