{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QDBVZVUKCP4232RVNYA2S7576S","short_pith_number":"pith:QDBVZVUK","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"},"canonical_sha256":"80c35cd68a13f9adea356e01a97fbff492022ba432942233816ef00ef5b314c9","source":{"kind":"arxiv","id":"1301.3375","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3375","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3375v5","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3375","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"QDBVZVUKCP42","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QDBVZVUKCP4232RV","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QDBVZVUK","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QDBVZVUKCP4232RVNYA2S7576S","target":"record","payload":{"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"},"canonical_sha256":"80c35cd68a13f9adea356e01a97fbff492022ba432942233816ef00ef5b314c9","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"},"source_kind":"arxiv","source_id":"1301.3375","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kz45AB7JWV+z0/QXgRaTLLww/wz/GveZuOF+Xf+tVF3SgbsvTb0GHVIfnB9XDMeOTCSZxyFtQGAzd52cq6LcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:07:02.086155Z"},"content_sha256":"87d12655b174d9ce07c8b43149c49e479c539db7eb8f3ed8c487be3a89dfa319","schema_version":"1.0","event_id":"sha256:87d12655b174d9ce07c8b43149c49e479c539db7eb8f3ed8c487be3a89dfa319"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QDBVZVUKCP4232RVNYA2S7576S","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXq0uqvOsp6Zt+nSirPPd9ApZkIDkfMnhTrCS8ow6EJoE/P58ieTx6tN7yz/814vwQqfHgLYy1Yt50ht+sUADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:07:02.086515Z"},"content_sha256":"731f37a8d4eed7e58453b8ec7d1d8c494a14d0c4a228110f5a42363ce5d7d6bc","schema_version":"1.0","event_id":"sha256:731f37a8d4eed7e58453b8ec7d1d8c494a14d0c4a228110f5a42363ce5d7d6bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/bundle.json","state_url":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDBVZVUKCP4232RVNYA2S7576S/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T23:07:02Z","links":{"resolver":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S","bundle":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/bundle.json","state":"https://pith.science/pith/QDBVZVUKCP4232RVNYA2S7576S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDBVZVUKCP4232RVNYA2S7576S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QDBVZVUKCP4232RVNYA2S7576S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0d5c6cbb1abe8201c120a4125114c4f83f0e1fa1139c93e8f4cb355531b79b11","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-15T15:01:51Z","title_canon_sha256":"31741f3eb82bbbcf4672f2dc9024c0333804c286b7b6fdab3c697391a908da3d"},"schema_version":"1.0","source":{"id":"1301.3375","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3375","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3375v5","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3375","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"QDBVZVUKCP42","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QDBVZVUKCP4232RV","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QDBVZVUK","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:731f37a8d4eed7e58453b8ec7d1d8c494a14d0c4a228110f5a42363ce5d7d6bc","target":"graph","created_at":"2026-05-18T02:19:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Karin Schnass","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-15T15:01:51Z","title":"On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3375","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:87d12655b174d9ce07c8b43149c49e479c539db7eb8f3ed8c487be3a89dfa319","target":"record","created_at":"2026-05-18T02:19:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0d5c6cbb1abe8201c120a4125114c4f83f0e1fa1139c93e8f4cb355531b79b11","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-15T15:01:51Z","title_canon_sha256":"31741f3eb82bbbcf4672f2dc9024c0333804c286b7b6fdab3c697391a908da3d"},"schema_version":"1.0","source":{"id":"1301.3375","kind":"arxiv","version":5}},"canonical_sha256":"80c35cd68a13f9adea356e01a97fbff492022ba432942233816ef00ef5b314c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80c35cd68a13f9adea356e01a97fbff492022ba432942233816ef00ef5b314c9","first_computed_at":"2026-05-18T02:19:43.989584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:43.989584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H0eq6XEwVm82sp5vcPVAnQjuAz5RCBoqPmEyEnJGZU1q0vLWLi/ZasxBTolrJQVg6HZoW36UD/K9e3C++hJtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:43.989979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3375","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87d12655b174d9ce07c8b43149c49e479c539db7eb8f3ed8c487be3a89dfa319","sha256:731f37a8d4eed7e58453b8ec7d1d8c494a14d0c4a228110f5a42363ce5d7d6bc"],"state_sha256":"791450f1c023515e9db1cf124de3b937b120c755f3c03d41aaebc689af4a0a59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAS/S9R3LwcA1o12wKTYY+ZHRn5PeV7ElEQ4b1yyGQTQm5wAyX2zcmzBKNpKLQDSdc56x3coDu99sRZbgxbjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:07:02.088431Z","bundle_sha256":"56a184d595fb776aa799a42b18a97fd02996cd9b0f33d8e03279502c070e274f"}}