{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W72WX337OEEERRVFNPPBAKWYRX","short_pith_number":"pith:W72WX337","schema_version":"1.0","canonical_sha256":"b7f56bef7f710848c6a56bde102ad88dd9d4d0e8b376a9b50ba2bcdbe23ad273","source":{"kind":"arxiv","id":"1310.7991","version":2},"attestation_state":"computed","paper":{"title":"Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alekh Agarwal, Animashree Anandkumar, Praneeth Netrapalli, Prateek Jain","submitted_at":"2013-10-30T01:12:03Z","abstract_excerpt":"We consider the problem of sparse coding, where each sample consists of a sparse linear combination of a set of dictionary atoms, and the task is to learn both the dictionary elements and the mixing coefficients. Alternating minimization is a popular heuristic for sparse coding, where the dictionary and the coefficients are estimated in alternate steps, keeping the other fixed. Typically, the coefficients are estimated via $\\ell_1$ minimization, keeping the dictionary fixed, and the dictionary is estimated through least squares, keeping the coefficients fixed. In this paper, we establish local"},"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":"1310.7991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-30T01:12:03Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"779ee96b57b5a911fc85ea8773f63dcee1a8a2a3948d74012de2138004041c04","abstract_canon_sha256":"5719187c9d589dc5c1ab4b9393d7bb9074faa9780b99e7d60d60ae2426840e35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:22.716887Z","signature_b64":"ssVyQ5BxjXivsWaSSXwmiwP9pa9BRjp7tK9hUJr4Sf9jfaiM0rWxeh+gZG4lVSUVWjpE44qnUiQkmZevOpNaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7f56bef7f710848c6a56bde102ad88dd9d4d0e8b376a9b50ba2bcdbe23ad273","last_reissued_at":"2026-05-18T02:46:22.716465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:22.716465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alekh Agarwal, Animashree Anandkumar, Praneeth Netrapalli, Prateek Jain","submitted_at":"2013-10-30T01:12:03Z","abstract_excerpt":"We consider the problem of sparse coding, where each sample consists of a sparse linear combination of a set of dictionary atoms, and the task is to learn both the dictionary elements and the mixing coefficients. Alternating minimization is a popular heuristic for sparse coding, where the dictionary and the coefficients are estimated in alternate steps, keeping the other fixed. Typically, the coefficients are estimated via $\\ell_1$ minimization, keeping the dictionary fixed, and the dictionary is estimated through least squares, keeping the coefficients fixed. In this paper, we establish local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7991","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":"1310.7991","created_at":"2026-05-18T02:46:22.716527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7991v2","created_at":"2026-05-18T02:46:22.716527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7991","created_at":"2026-05-18T02:46:22.716527+00:00"},{"alias_kind":"pith_short_12","alias_value":"W72WX337OEEE","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W72WX337OEEERRVF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W72WX337","created_at":"2026-05-18T12:28:04.890932+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/W72WX337OEEERRVFNPPBAKWYRX","json":"https://pith.science/pith/W72WX337OEEERRVFNPPBAKWYRX.json","graph_json":"https://pith.science/api/pith-number/W72WX337OEEERRVFNPPBAKWYRX/graph.json","events_json":"https://pith.science/api/pith-number/W72WX337OEEERRVFNPPBAKWYRX/events.json","paper":"https://pith.science/paper/W72WX337"},"agent_actions":{"view_html":"https://pith.science/pith/W72WX337OEEERRVFNPPBAKWYRX","download_json":"https://pith.science/pith/W72WX337OEEERRVFNPPBAKWYRX.json","view_paper":"https://pith.science/paper/W72WX337","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7991&json=true","fetch_graph":"https://pith.science/api/pith-number/W72WX337OEEERRVFNPPBAKWYRX/graph.json","fetch_events":"https://pith.science/api/pith-number/W72WX337OEEERRVFNPPBAKWYRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W72WX337OEEERRVFNPPBAKWYRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W72WX337OEEERRVFNPPBAKWYRX/action/storage_attestation","attest_author":"https://pith.science/pith/W72WX337OEEERRVFNPPBAKWYRX/action/author_attestation","sign_citation":"https://pith.science/pith/W72WX337OEEERRVFNPPBAKWYRX/action/citation_signature","submit_replication":"https://pith.science/pith/W72WX337OEEERRVFNPPBAKWYRX/action/replication_record"}},"created_at":"2026-05-18T02:46:22.716527+00:00","updated_at":"2026-05-18T02:46:22.716527+00:00"}