{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YDI2NVBIFXMAMTG3PVCCFR3VOI","short_pith_number":"pith:YDI2NVBI","schema_version":"1.0","canonical_sha256":"c0d1a6d4282dd8064cdb7d4422c77572372deab8e9c28353625db695bfff326b","source":{"kind":"arxiv","id":"1407.5155","version":4},"attestation_state":"computed","paper":{"title":"Sparse and spurious: dictionary learning with noise and outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (SIERRA, LIENS), R\\'emi Gribonval (PANAMA), Rodolphe Jenatton (CMAP)","submitted_at":"2014-07-19T06:50:19Z","abstract_excerpt":"A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary. While this paradigm has led to numerous empirical successes in various fields ranging from image to audio processing, there have only been a few theoretical arguments supporting these evidences. In particular, sparse coding, or sparse dictionary learning, relies on a non-convex procedure whose local minima have not been fully analyzed yet. In this paper, we consider a probabilistic model of sparse signals, and "},"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":"1407.5155","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-19T06:50:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d34c4870af4f0dd6da550f39c182ad131fd23c862ed026bfd3c62112b9762985","abstract_canon_sha256":"182eee33f02ba18d1423ee1ea91ba300d6ff59d78aa874db05e876c7eb6cbf86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:55.412037Z","signature_b64":"F/PjUWol0DIbN3Ob2sbeh1K4gyVw+XXAEXuJT4sDlLGK/OcXTgZHDCDf2sm5VGFKdX18ENLg+ysYbVacsIrADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d1a6d4282dd8064cdb7d4422c77572372deab8e9c28353625db695bfff326b","last_reissued_at":"2026-05-18T01:34:55.411564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:55.411564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse and spurious: dictionary learning with noise and outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (SIERRA, LIENS), R\\'emi Gribonval (PANAMA), Rodolphe Jenatton (CMAP)","submitted_at":"2014-07-19T06:50:19Z","abstract_excerpt":"A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary. While this paradigm has led to numerous empirical successes in various fields ranging from image to audio processing, there have only been a few theoretical arguments supporting these evidences. In particular, sparse coding, or sparse dictionary learning, relies on a non-convex procedure whose local minima have not been fully analyzed yet. In this paper, we consider a probabilistic model of sparse signals, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5155","kind":"arxiv","version":4},"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":"1407.5155","created_at":"2026-05-18T01:34:55.411632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5155v4","created_at":"2026-05-18T01:34:55.411632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5155","created_at":"2026-05-18T01:34:55.411632+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDI2NVBIFXMA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDI2NVBIFXMAMTG3","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDI2NVBI","created_at":"2026-05-18T12:28:57.508820+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/YDI2NVBIFXMAMTG3PVCCFR3VOI","json":"https://pith.science/pith/YDI2NVBIFXMAMTG3PVCCFR3VOI.json","graph_json":"https://pith.science/api/pith-number/YDI2NVBIFXMAMTG3PVCCFR3VOI/graph.json","events_json":"https://pith.science/api/pith-number/YDI2NVBIFXMAMTG3PVCCFR3VOI/events.json","paper":"https://pith.science/paper/YDI2NVBI"},"agent_actions":{"view_html":"https://pith.science/pith/YDI2NVBIFXMAMTG3PVCCFR3VOI","download_json":"https://pith.science/pith/YDI2NVBIFXMAMTG3PVCCFR3VOI.json","view_paper":"https://pith.science/paper/YDI2NVBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5155&json=true","fetch_graph":"https://pith.science/api/pith-number/YDI2NVBIFXMAMTG3PVCCFR3VOI/graph.json","fetch_events":"https://pith.science/api/pith-number/YDI2NVBIFXMAMTG3PVCCFR3VOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDI2NVBIFXMAMTG3PVCCFR3VOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDI2NVBIFXMAMTG3PVCCFR3VOI/action/storage_attestation","attest_author":"https://pith.science/pith/YDI2NVBIFXMAMTG3PVCCFR3VOI/action/author_attestation","sign_citation":"https://pith.science/pith/YDI2NVBIFXMAMTG3PVCCFR3VOI/action/citation_signature","submit_replication":"https://pith.science/pith/YDI2NVBIFXMAMTG3PVCCFR3VOI/action/replication_record"}},"created_at":"2026-05-18T01:34:55.411632+00:00","updated_at":"2026-05-18T01:34:55.411632+00:00"}