{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YQPPFQA2TYYBJ3JQRHHCGZZEVY","short_pith_number":"pith:YQPPFQA2","schema_version":"1.0","canonical_sha256":"c41ef2c01a9e3014ed3089ce236724ae00df6c33546f0026bb052376c7c24f14","source":{"kind":"arxiv","id":"1504.06785","version":3},"attestation_state":"computed","paper":{"title":"Complete Dictionary Recovery over the Sphere","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"John Wright, Ju Sun, Qing Qu","submitted_at":"2015-04-26T04:57:19Z","abstract_excerpt":"We consider the problem of recovering a complete (i.e., square and invertible) matrix $\\mathbf A_0$, from $\\mathbf Y \\in \\mathbb R^{n \\times p}$ with $\\mathbf Y = \\mathbf A_0 \\mathbf X_0$, provided $\\mathbf X_0$ is sufficiently sparse. This recovery problem is central to the theoretical understanding of dictionary learning, which seeks a sparse representation for a collection of input signals, and finds numerous applications in modern signal processing and machine learning. We give the first efficient algorithm that provably recovers $\\mathbf A_0$ when $\\mathbf X_0$ has $O(n)$ nonzeros per col"},"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":"1504.06785","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-26T04:57:19Z","cross_cats_sorted":["cs.CV","cs.LG","math.IT","math.OC","stat.ML"],"title_canon_sha256":"58b4cb312e920fb0755c69f6fa3c4d84d7612f5e129778ad8b4fbcee998eb0f4","abstract_canon_sha256":"a9d613c4efe73054f417cf19051f36b0f0b6fb241733b8de76852c5abe986a3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:34.169227Z","signature_b64":"WyWleayYjz4xpt+LQrtyG00geAKUZvd4dPy26lHbL5eHdacZkY1QO/UwGe+IzcHGfmkBNqqpocsxCYsA9tMwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c41ef2c01a9e3014ed3089ce236724ae00df6c33546f0026bb052376c7c24f14","last_reissued_at":"2026-05-18T01:26:34.168352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:34.168352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete Dictionary Recovery over the Sphere","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"John Wright, Ju Sun, Qing Qu","submitted_at":"2015-04-26T04:57:19Z","abstract_excerpt":"We consider the problem of recovering a complete (i.e., square and invertible) matrix $\\mathbf A_0$, from $\\mathbf Y \\in \\mathbb R^{n \\times p}$ with $\\mathbf Y = \\mathbf A_0 \\mathbf X_0$, provided $\\mathbf X_0$ is sufficiently sparse. This recovery problem is central to the theoretical understanding of dictionary learning, which seeks a sparse representation for a collection of input signals, and finds numerous applications in modern signal processing and machine learning. We give the first efficient algorithm that provably recovers $\\mathbf A_0$ when $\\mathbf X_0$ has $O(n)$ nonzeros per col"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06785","kind":"arxiv","version":3},"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":"1504.06785","created_at":"2026-05-18T01:26:34.168504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06785v3","created_at":"2026-05-18T01:26:34.168504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06785","created_at":"2026-05-18T01:26:34.168504+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQPPFQA2TYYB","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQPPFQA2TYYBJ3JQ","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQPPFQA2","created_at":"2026-05-18T12:29:50.041715+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/YQPPFQA2TYYBJ3JQRHHCGZZEVY","json":"https://pith.science/pith/YQPPFQA2TYYBJ3JQRHHCGZZEVY.json","graph_json":"https://pith.science/api/pith-number/YQPPFQA2TYYBJ3JQRHHCGZZEVY/graph.json","events_json":"https://pith.science/api/pith-number/YQPPFQA2TYYBJ3JQRHHCGZZEVY/events.json","paper":"https://pith.science/paper/YQPPFQA2"},"agent_actions":{"view_html":"https://pith.science/pith/YQPPFQA2TYYBJ3JQRHHCGZZEVY","download_json":"https://pith.science/pith/YQPPFQA2TYYBJ3JQRHHCGZZEVY.json","view_paper":"https://pith.science/paper/YQPPFQA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06785&json=true","fetch_graph":"https://pith.science/api/pith-number/YQPPFQA2TYYBJ3JQRHHCGZZEVY/graph.json","fetch_events":"https://pith.science/api/pith-number/YQPPFQA2TYYBJ3JQRHHCGZZEVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQPPFQA2TYYBJ3JQRHHCGZZEVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQPPFQA2TYYBJ3JQRHHCGZZEVY/action/storage_attestation","attest_author":"https://pith.science/pith/YQPPFQA2TYYBJ3JQRHHCGZZEVY/action/author_attestation","sign_citation":"https://pith.science/pith/YQPPFQA2TYYBJ3JQRHHCGZZEVY/action/citation_signature","submit_replication":"https://pith.science/pith/YQPPFQA2TYYBJ3JQRHHCGZZEVY/action/replication_record"}},"created_at":"2026-05-18T01:26:34.168504+00:00","updated_at":"2026-05-18T01:26:34.168504+00:00"}