{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JWKUXYINV5IPR5UIDG24I7XNLG","short_pith_number":"pith:JWKUXYIN","schema_version":"1.0","canonical_sha256":"4d954be10daf50f8f68819b5c47eed59b645731d2df81631d4909496f9819232","source":{"kind":"arxiv","id":"1709.05937","version":1},"attestation_state":"computed","paper":{"title":"Une v\\'eritable approche $\\ell_0$ pour l'apprentissage de dictionnaire","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Paul Honeine, St\\'ephane Canu, Su Ruan, Yuan Liu","submitted_at":"2017-09-12T13:21:47Z","abstract_excerpt":"Sparse representation learning has recently gained a great success in signal and image processing, thanks to recent advances in dictionary learning. To this end, the $\\ell_0$-norm is often used to control the sparsity level. Nevertheless, optimization problems based on the $\\ell_0$-norm are non-convex and NP-hard. For these reasons, relaxation techniques have been attracting much attention of researchers, by priorly targeting approximation solutions (e.g. $\\ell_1$-norm, pursuit strategies). On the contrary, this paper considers the exact $\\ell_0$-norm optimization problem and proves that it ca"},"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":"1709.05937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-09-12T13:21:47Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"44cc2043f970c9aeafba08fa68119f52fdda2728598e0594e4b3829aea5041c7","abstract_canon_sha256":"a3caff56c89129d8261bb8a19278c50386ee4740802d42e4ede33139cf0f5359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.771102Z","signature_b64":"dWgcHyrudSExuso0fziZC9/RLc1loLDkWjuu/ynAniBI0wGC94U6M/FEwYKXA8X9LRSaphJKBXkDYegNr9CHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d954be10daf50f8f68819b5c47eed59b645731d2df81631d4909496f9819232","last_reissued_at":"2026-05-18T00:34:58.770129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.770129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Une v\\'eritable approche $\\ell_0$ pour l'apprentissage de dictionnaire","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Paul Honeine, St\\'ephane Canu, Su Ruan, Yuan Liu","submitted_at":"2017-09-12T13:21:47Z","abstract_excerpt":"Sparse representation learning has recently gained a great success in signal and image processing, thanks to recent advances in dictionary learning. To this end, the $\\ell_0$-norm is often used to control the sparsity level. Nevertheless, optimization problems based on the $\\ell_0$-norm are non-convex and NP-hard. For these reasons, relaxation techniques have been attracting much attention of researchers, by priorly targeting approximation solutions (e.g. $\\ell_1$-norm, pursuit strategies). On the contrary, this paper considers the exact $\\ell_0$-norm optimization problem and proves that it ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05937","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":"1709.05937","created_at":"2026-05-18T00:34:58.770298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05937v1","created_at":"2026-05-18T00:34:58.770298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05937","created_at":"2026-05-18T00:34:58.770298+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWKUXYINV5IP","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWKUXYINV5IPR5UI","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWKUXYIN","created_at":"2026-05-18T12:31:24.725408+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/JWKUXYINV5IPR5UIDG24I7XNLG","json":"https://pith.science/pith/JWKUXYINV5IPR5UIDG24I7XNLG.json","graph_json":"https://pith.science/api/pith-number/JWKUXYINV5IPR5UIDG24I7XNLG/graph.json","events_json":"https://pith.science/api/pith-number/JWKUXYINV5IPR5UIDG24I7XNLG/events.json","paper":"https://pith.science/paper/JWKUXYIN"},"agent_actions":{"view_html":"https://pith.science/pith/JWKUXYINV5IPR5UIDG24I7XNLG","download_json":"https://pith.science/pith/JWKUXYINV5IPR5UIDG24I7XNLG.json","view_paper":"https://pith.science/paper/JWKUXYIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05937&json=true","fetch_graph":"https://pith.science/api/pith-number/JWKUXYINV5IPR5UIDG24I7XNLG/graph.json","fetch_events":"https://pith.science/api/pith-number/JWKUXYINV5IPR5UIDG24I7XNLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWKUXYINV5IPR5UIDG24I7XNLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWKUXYINV5IPR5UIDG24I7XNLG/action/storage_attestation","attest_author":"https://pith.science/pith/JWKUXYINV5IPR5UIDG24I7XNLG/action/author_attestation","sign_citation":"https://pith.science/pith/JWKUXYINV5IPR5UIDG24I7XNLG/action/citation_signature","submit_replication":"https://pith.science/pith/JWKUXYINV5IPR5UIDG24I7XNLG/action/replication_record"}},"created_at":"2026-05-18T00:34:58.770298+00:00","updated_at":"2026-05-18T00:34:58.770298+00:00"}