{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2H7BYOAXU2KCOGW5QMSO4OM7W3","short_pith_number":"pith:2H7BYOAX","canonical_record":{"source":{"id":"1401.6354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T14:41:31Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"459a035ca9a20b2782e5982facd73b83b3a952ba4dbc98708dd526ff84c90ff3","abstract_canon_sha256":"2aa901b3705e7ed67f563d2420bf6ee7874bed4ea38e28f0689e0ba750536357"},"schema_version":"1.0"},"canonical_sha256":"d1fe1c3817a694271add8324ee399fb6c9a42efe482789424e22da7a2d08ab7d","source":{"kind":"arxiv","id":"1401.6354","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6354","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6354v2","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6354","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"2H7BYOAXU2KC","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2H7BYOAXU2KCOGW5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2H7BYOAX","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2H7BYOAXU2KCOGW5QMSO4OM7W3","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T14:41:31Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"459a035ca9a20b2782e5982facd73b83b3a952ba4dbc98708dd526ff84c90ff3","abstract_canon_sha256":"2aa901b3705e7ed67f563d2420bf6ee7874bed4ea38e28f0689e0ba750536357"},"schema_version":"1.0"},"canonical_sha256":"d1fe1c3817a694271add8324ee399fb6c9a42efe482789424e22da7a2d08ab7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.867016Z","signature_b64":"gl6Y7fRrvBFg9T+8T6eqoH1/VPBZGBXSd3yk4b6ZKoGhNn9JKp7rFJtEb2WRBIKmk79hmNTVXvnG9iIqgf3kAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1fe1c3817a694271add8324ee399fb6c9a42efe482789424e22da7a2d08ab7d","last_reissued_at":"2026-05-18T02:19:43.866552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.866552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6354","source_version":2,"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":"HeFiye9FTErP7PiAT3TemL2BIXOoLWsS6t0ZExr7ZvA/cLNv3THb1nrGSuR4KYE6Vq5KTm3zcb/n3pKCM1MQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:05.415031Z"},"content_sha256":"870873466fa4c824470db4ac2ae23692f85e78887f991ca60bd5e13544bb339f","schema_version":"1.0","event_id":"sha256:870873466fa4c824470db4ac2ae23692f85e78887f991ca60bd5e13544bb339f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2H7BYOAXU2KCOGW5QMSO4OM7W3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Identification of Overcomplete Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Karin Schnass","submitted_at":"2014-01-24T14:41:31Z","abstract_excerpt":"This paper presents the first theoretical results showing that stable identification of overcomplete $\\mu$-coherent dictionaries $\\Phi \\in \\mathbb{R}^{d\\times K}$ is locally possible from training signals with sparsity levels $S$ up to the order $O(\\mu^{-2})$ and signal to noise ratios up to $O(\\sqrt{d})$. In particular the dictionary is recoverable as the local maximum of a new maximisation criterion that generalises the K-means criterion. For this maximisation criterion results for asymptotic exact recovery for sparsity levels up to $O(\\mu^{-1})$ and stable recovery for sparsity levels up to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6354","kind":"arxiv","version":2},"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":"VfNWi4uJ7ESQh3/lEfwE1X4QgEvLPvDYed4cl6U01hptkyuHaJNY5V8xeiCf9iuICjMuFjS4CPlaWrYvck9xCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:23:05.415390Z"},"content_sha256":"8f277c294c27fe8fd21beab1d7250b2156657471b4ee38121bd28fd71f68fdcf","schema_version":"1.0","event_id":"sha256:8f277c294c27fe8fd21beab1d7250b2156657471b4ee38121bd28fd71f68fdcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/bundle.json","state_url":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/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:23:05Z","links":{"resolver":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3","bundle":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/bundle.json","state":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2H7BYOAXU2KCOGW5QMSO4OM7W3","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":"2aa901b3705e7ed67f563d2420bf6ee7874bed4ea38e28f0689e0ba750536357","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T14:41:31Z","title_canon_sha256":"459a035ca9a20b2782e5982facd73b83b3a952ba4dbc98708dd526ff84c90ff3"},"schema_version":"1.0","source":{"id":"1401.6354","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6354","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6354v2","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6354","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"2H7BYOAXU2KC","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2H7BYOAXU2KCOGW5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2H7BYOAX","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:8f277c294c27fe8fd21beab1d7250b2156657471b4ee38121bd28fd71f68fdcf","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 paper presents the first theoretical results showing that stable identification of overcomplete $\\mu$-coherent dictionaries $\\Phi \\in \\mathbb{R}^{d\\times K}$ is locally possible from training signals with sparsity levels $S$ up to the order $O(\\mu^{-2})$ and signal to noise ratios up to $O(\\sqrt{d})$. In particular the dictionary is recoverable as the local maximum of a new maximisation criterion that generalises the K-means criterion. For this maximisation criterion results for asymptotic exact recovery for sparsity levels up to $O(\\mu^{-1})$ and stable recovery for sparsity levels up to","authors_text":"Karin Schnass","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T14:41:31Z","title":"Local Identification of Overcomplete Dictionaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6354","kind":"arxiv","version":2},"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:870873466fa4c824470db4ac2ae23692f85e78887f991ca60bd5e13544bb339f","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":"2aa901b3705e7ed67f563d2420bf6ee7874bed4ea38e28f0689e0ba750536357","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-24T14:41:31Z","title_canon_sha256":"459a035ca9a20b2782e5982facd73b83b3a952ba4dbc98708dd526ff84c90ff3"},"schema_version":"1.0","source":{"id":"1401.6354","kind":"arxiv","version":2}},"canonical_sha256":"d1fe1c3817a694271add8324ee399fb6c9a42efe482789424e22da7a2d08ab7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1fe1c3817a694271add8324ee399fb6c9a42efe482789424e22da7a2d08ab7d","first_computed_at":"2026-05-18T02:19:43.866552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:43.866552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gl6Y7fRrvBFg9T+8T6eqoH1/VPBZGBXSd3yk4b6ZKoGhNn9JKp7rFJtEb2WRBIKmk79hmNTVXvnG9iIqgf3kAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:43.867016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6354","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:870873466fa4c824470db4ac2ae23692f85e78887f991ca60bd5e13544bb339f","sha256:8f277c294c27fe8fd21beab1d7250b2156657471b4ee38121bd28fd71f68fdcf"],"state_sha256":"22aad0a444583dd04b10396a3ea824ab475171bf6c4573503de3a4fa7e67ef85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1FjaBtt7d8LVt9M4dF5xZdKzGFz31h3zqNCIypmw6UZodjxPa9SI4Be2/eUTZFDbukIGeOlKbTDU0X2l6GuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:23:05.417458Z","bundle_sha256":"7fd4a3afaa94994b3a340af6a11628fdf9ad85ce643ffbaab7f0f8c0b4ee4ad4"}}