{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QDBVZVUKCP4232RVNYA2S7576S","short_pith_number":"pith:QDBVZVUK","schema_version":"1.0","canonical_sha256":"80c35cd68a13f9adea356e01a97fbff492022ba432942233816ef00ef5b314c9","source":{"kind":"arxiv","id":"1301.3375","version":5},"attestation_state":"computed","paper":{"title":"On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Karin Schnass","submitted_at":"2013-01-15T15:01:51Z","abstract_excerpt":"This article gives theoretical insights into the performance of K-SVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary $\\Phi\\in \\mathbb{R}^{d \\times K}$ can be recovered as local minimum of the minimisation criterion underlying K-SVD from a set of $N$ training signals $y_n =\\Phi x_n$. A theoretical analysis of the problem leads to two types of identifiability results assuming the training signals are generated from a tight frame with coefficients drawn from a random symmetric distributio"},"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":"1301.3375","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-15T15:01:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"31741f3eb82bbbcf4672f2dc9024c0333804c286b7b6fdab3c697391a908da3d","abstract_canon_sha256":"0d5c6cbb1abe8201c120a4125114c4f83f0e1fa1139c93e8f4cb355531b79b11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.989979Z","signature_b64":"H0eq6XEwVm82sp5vcPVAnQjuAz5RCBoqPmEyEnJGZU1q0vLWLi/ZasxBTolrJQVg6HZoW36UD/K9e3C++hJtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80c35cd68a13f9adea356e01a97fbff492022ba432942233816ef00ef5b314c9","last_reissued_at":"2026-05-18T02:19:43.989584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.989584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Karin Schnass","submitted_at":"2013-01-15T15:01:51Z","abstract_excerpt":"This article gives theoretical insights into the performance of K-SVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary $\\Phi\\in \\mathbb{R}^{d \\times K}$ can be recovered as local minimum of the minimisation criterion underlying K-SVD from a set of $N$ training signals $y_n =\\Phi x_n$. A theoretical analysis of the problem leads to two types of identifiability results assuming the training signals are generated from a tight frame with coefficients drawn from a random symmetric distributio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3375","kind":"arxiv","version":5},"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":"1301.3375","created_at":"2026-05-18T02:19:43.989644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3375v5","created_at":"2026-05-18T02:19:43.989644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3375","created_at":"2026-05-18T02:19:43.989644+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDBVZVUKCP42","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDBVZVUKCP4232RV","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDBVZVUK","created_at":"2026-05-18T12:27:57.521954+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/QDBVZVUKCP4232RVNYA2S7576S","json":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S.json","graph_json":"https://pith.science/api/pith-number/QDBVZVUKCP4232RVNYA2S7576S/graph.json","events_json":"https://pith.science/api/pith-number/QDBVZVUKCP4232RVNYA2S7576S/events.json","paper":"https://pith.science/paper/QDBVZVUK"},"agent_actions":{"view_html":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S","download_json":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S.json","view_paper":"https://pith.science/paper/QDBVZVUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3375&json=true","fetch_graph":"https://pith.science/api/pith-number/QDBVZVUKCP4232RVNYA2S7576S/graph.json","fetch_events":"https://pith.science/api/pith-number/QDBVZVUKCP4232RVNYA2S7576S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/action/storage_attestation","attest_author":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/action/author_attestation","sign_citation":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/action/citation_signature","submit_replication":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/action/replication_record"}},"created_at":"2026-05-18T02:19:43.989644+00:00","updated_at":"2026-05-18T02:19:43.989644+00:00"}