{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IVZMXTDVNULXFXRKJDPCJ7BMLR","short_pith_number":"pith:IVZMXTDV","schema_version":"1.0","canonical_sha256":"4572cbcc756d1772de2a48de24fc2c5c7703f3564d2260c1329f8bcc70bd548e","source":{"kind":"arxiv","id":"1001.5073","version":1},"attestation_state":"computed","paper":{"title":"Sparse Recovery using Smoothed $\\ell^0$ (SL0): Convergence Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Jutten, Hosein Mohimani, Irina Gorodnitsky, Massoud Babaie-Zadeh","submitted_at":"2010-01-28T00:25:56Z","abstract_excerpt":"Finding the sparse solution of an underdetermined system of linear equations has many applications, especially, it is used in Compressed Sensing (CS), Sparse Component Analysis (SCA), and sparse decomposition of signals on overcomplete dictionaries. We have recently proposed a fast algorithm, called Smoothed $\\ell^0$ (SL0), for this task. Contrary to many other sparse recovery algorithms, SL0 is not based on minimizing the $\\ell^1$ norm, but it tries to directly minimize the $\\ell^0$ norm of the solution. The basic idea of SL0 is optimizing a sequence of certain (continuous) cost functions app"},"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":"1001.5073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-28T00:25:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5819e48a6018f5cf23a14b35ed141b7f1ec9a45ebda4e06b823c20ec3d3a1c8c","abstract_canon_sha256":"6bc15ef4e6ece76c2504517bcfee285eea79075d286e1dbb4d41d383315d1b3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:20:33.634054Z","signature_b64":"QhCVp67LMLKbCrYHfkN+MR/VfBiBHs/Dewtw/zM94P5fJEh5kUl7j9Ik5rEZlppQ3fgA3coAFrMA0zyjZiwWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4572cbcc756d1772de2a48de24fc2c5c7703f3564d2260c1329f8bcc70bd548e","last_reissued_at":"2026-07-04T17:20:33.633560Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:20:33.633560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Recovery using Smoothed $\\ell^0$ (SL0): Convergence Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Jutten, Hosein Mohimani, Irina Gorodnitsky, Massoud Babaie-Zadeh","submitted_at":"2010-01-28T00:25:56Z","abstract_excerpt":"Finding the sparse solution of an underdetermined system of linear equations has many applications, especially, it is used in Compressed Sensing (CS), Sparse Component Analysis (SCA), and sparse decomposition of signals on overcomplete dictionaries. We have recently proposed a fast algorithm, called Smoothed $\\ell^0$ (SL0), for this task. Contrary to many other sparse recovery algorithms, SL0 is not based on minimizing the $\\ell^1$ norm, but it tries to directly minimize the $\\ell^0$ norm of the solution. The basic idea of SL0 is optimizing a sequence of certain (continuous) cost functions app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.5073","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1001.5073/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":"1001.5073","created_at":"2026-07-04T17:20:33.633623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.5073v1","created_at":"2026-07-04T17:20:33.633623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.5073","created_at":"2026-07-04T17:20:33.633623+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVZMXTDVNULX","created_at":"2026-07-04T17:20:33.633623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVZMXTDVNULXFXRK","created_at":"2026-07-04T17:20:33.633623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVZMXTDV","created_at":"2026-07-04T17:20:33.633623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.08324","citing_title":"An incremental algorithm for non-convex AI-enhanced medical image processing","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR","json":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR.json","graph_json":"https://pith.science/api/pith-number/IVZMXTDVNULXFXRKJDPCJ7BMLR/graph.json","events_json":"https://pith.science/api/pith-number/IVZMXTDVNULXFXRKJDPCJ7BMLR/events.json","paper":"https://pith.science/paper/IVZMXTDV"},"agent_actions":{"view_html":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR","download_json":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR.json","view_paper":"https://pith.science/paper/IVZMXTDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.5073&json=true","fetch_graph":"https://pith.science/api/pith-number/IVZMXTDVNULXFXRKJDPCJ7BMLR/graph.json","fetch_events":"https://pith.science/api/pith-number/IVZMXTDVNULXFXRKJDPCJ7BMLR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR/action/storage_attestation","attest_author":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR/action/author_attestation","sign_citation":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR/action/citation_signature","submit_replication":"https://pith.science/pith/IVZMXTDVNULXFXRKJDPCJ7BMLR/action/replication_record"}},"created_at":"2026-07-04T17:20:33.633623+00:00","updated_at":"2026-07-04T17:20:33.633623+00:00"}