{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IBUGTAXVFCMPFTHY2GOUIY5KQI","short_pith_number":"pith:IBUGTAXV","schema_version":"1.0","canonical_sha256":"40686982f52898f2ccf8d19d4463aa822900f93bf23472390bac0bc3eac7fef5","source":{"kind":"arxiv","id":"1009.3890","version":1},"attestation_state":"computed","paper":{"title":"Fast Sparse Decomposition by Iterative Detection-Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Arash Ali Amini, Christian Jutten, Massoud Babaie-Zadeh","submitted_at":"2010-09-20T17:12:37Z","abstract_excerpt":"Finding sparse solutions of underdetermined systems of linear equations is a fundamental problem in signal processing and statistics which has become a subject of interest in recent years. In general, these systems have infinitely many solutions. However, it may be shown that sufficiently sparse solutions may be identified uniquely. In other words, the corresponding linear transformation will be invertible if we restrict its domain to sufficiently sparse vectors. This property may be used, for example, to solve the underdetermined Blind Source Separation (BSS) problem, or to find sparse repres"},"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":"1009.3890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-09-20T17:12:37Z","cross_cats_sorted":[],"title_canon_sha256":"fbbb64eb41c911571dd28978f75f96f04c4274107ce877f0d0ca07eacf4d20c0","abstract_canon_sha256":"101e0d48131f850c47911afbba53719219ff09596f2a6995fee690e0219e43a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:43.564744Z","signature_b64":"Ja5TlsA8vAm2UaToa9D+lZD+TCISnt0X8jONyBu6pCoLEDQEaMvb2H5vvfAURMmpLkCaFkrS9UgCYIbOmE43CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40686982f52898f2ccf8d19d4463aa822900f93bf23472390bac0bc3eac7fef5","last_reissued_at":"2026-05-18T04:40:43.564141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:43.564141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Sparse Decomposition by Iterative Detection-Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Arash Ali Amini, Christian Jutten, Massoud Babaie-Zadeh","submitted_at":"2010-09-20T17:12:37Z","abstract_excerpt":"Finding sparse solutions of underdetermined systems of linear equations is a fundamental problem in signal processing and statistics which has become a subject of interest in recent years. In general, these systems have infinitely many solutions. However, it may be shown that sufficiently sparse solutions may be identified uniquely. In other words, the corresponding linear transformation will be invertible if we restrict its domain to sufficiently sparse vectors. This property may be used, for example, to solve the underdetermined Blind Source Separation (BSS) problem, or to find sparse repres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3890","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":"1009.3890","created_at":"2026-05-18T04:40:43.564242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3890v1","created_at":"2026-05-18T04:40:43.564242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3890","created_at":"2026-05-18T04:40:43.564242+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBUGTAXVFCMP","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBUGTAXVFCMPFTHY","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBUGTAXV","created_at":"2026-05-18T12:26:09.077623+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/IBUGTAXVFCMPFTHY2GOUIY5KQI","json":"https://pith.science/pith/IBUGTAXVFCMPFTHY2GOUIY5KQI.json","graph_json":"https://pith.science/api/pith-number/IBUGTAXVFCMPFTHY2GOUIY5KQI/graph.json","events_json":"https://pith.science/api/pith-number/IBUGTAXVFCMPFTHY2GOUIY5KQI/events.json","paper":"https://pith.science/paper/IBUGTAXV"},"agent_actions":{"view_html":"https://pith.science/pith/IBUGTAXVFCMPFTHY2GOUIY5KQI","download_json":"https://pith.science/pith/IBUGTAXVFCMPFTHY2GOUIY5KQI.json","view_paper":"https://pith.science/paper/IBUGTAXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3890&json=true","fetch_graph":"https://pith.science/api/pith-number/IBUGTAXVFCMPFTHY2GOUIY5KQI/graph.json","fetch_events":"https://pith.science/api/pith-number/IBUGTAXVFCMPFTHY2GOUIY5KQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBUGTAXVFCMPFTHY2GOUIY5KQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBUGTAXVFCMPFTHY2GOUIY5KQI/action/storage_attestation","attest_author":"https://pith.science/pith/IBUGTAXVFCMPFTHY2GOUIY5KQI/action/author_attestation","sign_citation":"https://pith.science/pith/IBUGTAXVFCMPFTHY2GOUIY5KQI/action/citation_signature","submit_replication":"https://pith.science/pith/IBUGTAXVFCMPFTHY2GOUIY5KQI/action/replication_record"}},"created_at":"2026-05-18T04:40:43.564242+00:00","updated_at":"2026-05-18T04:40:43.564242+00:00"}