{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OVXWSQ3KGO7GOXZSSB63K5CEMV","short_pith_number":"pith:OVXWSQ3K","schema_version":"1.0","canonical_sha256":"756f69436a33be675f32907db57444657c076ea23d70688d305c4fa889386ac1","source":{"kind":"arxiv","id":"1505.04363","version":2},"attestation_state":"computed","paper":{"title":"Local identifiability of $l_1$-minimization dictionary learning: a sufficient and almost necessary condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bin Yu, Siqi Wu","submitted_at":"2015-05-17T07:05:50Z","abstract_excerpt":"We study the theoretical properties of learning a dictionary from $N$ signals $\\mathbf x_i\\in \\mathbb R^K$ for $i=1,...,N$ via $l_1$-minimization. We assume that $\\mathbf x_i$'s are $i.i.d.$ random linear combinations of the $K$ columns from a complete (i.e., square and invertible) reference dictionary $\\mathbf D_0 \\in \\mathbb R^{K\\times K}$. Here, the random linear coefficients are generated from either the $s$-sparse Gaussian model or the Bernoulli-Gaussian model. First, for the population case, we establish a sufficient and almost necessary condition for the reference dictionary $\\mathbf D_"},"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":"1505.04363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-17T07:05:50Z","cross_cats_sorted":[],"title_canon_sha256":"17931da2d723b4b8c409c69cff07380c0a04d43a8983274d8fa021afb0a7b921","abstract_canon_sha256":"bc5f1fed9c4a8341ccb76244ca8aece4d1a65fe1c6fc1c4ec8fc5f8051335428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:13.514219Z","signature_b64":"phAsJdtplqP75OkzBjGH7fC1igTcZR8S+2VfkYfuOqg1STsiy2eQCBl4nbPEF1MfR7a1x1JLQfmwxfFPoopfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"756f69436a33be675f32907db57444657c076ea23d70688d305c4fa889386ac1","last_reissued_at":"2026-05-18T01:11:13.513670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:13.513670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local identifiability of $l_1$-minimization dictionary learning: a sufficient and almost necessary condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bin Yu, Siqi Wu","submitted_at":"2015-05-17T07:05:50Z","abstract_excerpt":"We study the theoretical properties of learning a dictionary from $N$ signals $\\mathbf x_i\\in \\mathbb R^K$ for $i=1,...,N$ via $l_1$-minimization. We assume that $\\mathbf x_i$'s are $i.i.d.$ random linear combinations of the $K$ columns from a complete (i.e., square and invertible) reference dictionary $\\mathbf D_0 \\in \\mathbb R^{K\\times K}$. Here, the random linear coefficients are generated from either the $s$-sparse Gaussian model or the Bernoulli-Gaussian model. First, for the population case, we establish a sufficient and almost necessary condition for the reference dictionary $\\mathbf D_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04363","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":"1505.04363","created_at":"2026-05-18T01:11:13.513752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04363v2","created_at":"2026-05-18T01:11:13.513752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04363","created_at":"2026-05-18T01:11:13.513752+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVXWSQ3KGO7G","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVXWSQ3KGO7GOXZS","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVXWSQ3K","created_at":"2026-05-18T12:29:34.919912+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/OVXWSQ3KGO7GOXZSSB63K5CEMV","json":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV.json","graph_json":"https://pith.science/api/pith-number/OVXWSQ3KGO7GOXZSSB63K5CEMV/graph.json","events_json":"https://pith.science/api/pith-number/OVXWSQ3KGO7GOXZSSB63K5CEMV/events.json","paper":"https://pith.science/paper/OVXWSQ3K"},"agent_actions":{"view_html":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV","download_json":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV.json","view_paper":"https://pith.science/paper/OVXWSQ3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04363&json=true","fetch_graph":"https://pith.science/api/pith-number/OVXWSQ3KGO7GOXZSSB63K5CEMV/graph.json","fetch_events":"https://pith.science/api/pith-number/OVXWSQ3KGO7GOXZSSB63K5CEMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/action/storage_attestation","attest_author":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/action/author_attestation","sign_citation":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/action/citation_signature","submit_replication":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/action/replication_record"}},"created_at":"2026-05-18T01:11:13.513752+00:00","updated_at":"2026-05-18T01:11:13.513752+00:00"}