{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2H7BYOAXU2KCOGW5QMSO4OM7W3","short_pith_number":"pith:2H7BYOAX","schema_version":"1.0","canonical_sha256":"d1fe1c3817a694271add8324ee399fb6c9a42efe482789424e22da7a2d08ab7d","source":{"kind":"arxiv","id":"1401.6354","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.6354","created_at":"2026-05-18T02:19:43.866615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6354v2","created_at":"2026-05-18T02:19:43.866615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6354","created_at":"2026-05-18T02:19:43.866615+00:00"},{"alias_kind":"pith_short_12","alias_value":"2H7BYOAXU2KC","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2H7BYOAXU2KCOGW5","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2H7BYOAX","created_at":"2026-05-18T12:28:11.866339+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/2H7BYOAXU2KCOGW5QMSO4OM7W3","json":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3.json","graph_json":"https://pith.science/api/pith-number/2H7BYOAXU2KCOGW5QMSO4OM7W3/graph.json","events_json":"https://pith.science/api/pith-number/2H7BYOAXU2KCOGW5QMSO4OM7W3/events.json","paper":"https://pith.science/paper/2H7BYOAX"},"agent_actions":{"view_html":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3","download_json":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3.json","view_paper":"https://pith.science/paper/2H7BYOAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6354&json=true","fetch_graph":"https://pith.science/api/pith-number/2H7BYOAXU2KCOGW5QMSO4OM7W3/graph.json","fetch_events":"https://pith.science/api/pith-number/2H7BYOAXU2KCOGW5QMSO4OM7W3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/action/storage_attestation","attest_author":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/action/author_attestation","sign_citation":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/action/citation_signature","submit_replication":"https://pith.science/pith/2H7BYOAXU2KCOGW5QMSO4OM7W3/action/replication_record"}},"created_at":"2026-05-18T02:19:43.866615+00:00","updated_at":"2026-05-18T02:19:43.866615+00:00"}