{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4VGAZFTZE3XOBMSHOEYFSXHH72","short_pith_number":"pith:4VGAZFTZ","schema_version":"1.0","canonical_sha256":"e54c0c967926eee0b2477130595ce7fe860e4ab5ccbcf7977acbfefb8205ae3b","source":{"kind":"arxiv","id":"1902.11261","version":5},"attestation_state":"computed","paper":{"title":"NOODL: Provable Online Dictionary Learning and Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jarvis Haupt, Sirisha Rambhatla, Xingguo Li","submitted_at":"2019-02-28T18:08:01Z","abstract_excerpt":"We consider the dictionary learning problem, where the aim is to model the given data as a linear combination of a few columns of a matrix known as a dictionary, where the sparse weights forming the linear combination are known as coefficients. Since the dictionary and coefficients, parameterizing the linear model are unknown, the corresponding optimization is inherently non-convex. This was a major challenge until recently, when provable algorithms for dictionary learning were proposed. Yet, these provide guarantees only on the recovery of the dictionary, without explicit recovery guarantees "},"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":"1902.11261","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-28T18:08:01Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"69caf6870bc3bc0cfc314ce45c53fcb01f75d7bf28c15faaea9f8486c6f5a65a","abstract_canon_sha256":"ffd5c5a99ae487fd01fefe3e3e51958c4d929c1d4f8f9fd05033a26eadcd9807"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:14.028610Z","signature_b64":"70m26OL0QsAzOe9J9ju2K+qX2i3E8fnu3XOg13IE8x8oN4xo23sQKmO/zeZv8h5AZxKSrZq2suP+5j8wvNKHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e54c0c967926eee0b2477130595ce7fe860e4ab5ccbcf7977acbfefb8205ae3b","last_reissued_at":"2026-07-05T00:00:14.028137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:14.028137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NOODL: Provable Online Dictionary Learning and Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jarvis Haupt, Sirisha Rambhatla, Xingguo Li","submitted_at":"2019-02-28T18:08:01Z","abstract_excerpt":"We consider the dictionary learning problem, where the aim is to model the given data as a linear combination of a few columns of a matrix known as a dictionary, where the sparse weights forming the linear combination are known as coefficients. Since the dictionary and coefficients, parameterizing the linear model are unknown, the corresponding optimization is inherently non-convex. This was a major challenge until recently, when provable algorithms for dictionary learning were proposed. Yet, these provide guarantees only on the recovery of the dictionary, without explicit recovery guarantees "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.11261","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.11261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1902.11261","created_at":"2026-07-05T00:00:14.028200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.11261v5","created_at":"2026-07-05T00:00:14.028200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.11261","created_at":"2026-07-05T00:00:14.028200+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VGAZFTZE3XO","created_at":"2026-07-05T00:00:14.028200+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VGAZFTZE3XOBMSH","created_at":"2026-07-05T00:00:14.028200+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VGAZFTZ","created_at":"2026-07-05T00:00:14.028200+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/4VGAZFTZE3XOBMSHOEYFSXHH72","json":"https://pith.science/pith/4VGAZFTZE3XOBMSHOEYFSXHH72.json","graph_json":"https://pith.science/api/pith-number/4VGAZFTZE3XOBMSHOEYFSXHH72/graph.json","events_json":"https://pith.science/api/pith-number/4VGAZFTZE3XOBMSHOEYFSXHH72/events.json","paper":"https://pith.science/paper/4VGAZFTZ"},"agent_actions":{"view_html":"https://pith.science/pith/4VGAZFTZE3XOBMSHOEYFSXHH72","download_json":"https://pith.science/pith/4VGAZFTZE3XOBMSHOEYFSXHH72.json","view_paper":"https://pith.science/paper/4VGAZFTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.11261&json=true","fetch_graph":"https://pith.science/api/pith-number/4VGAZFTZE3XOBMSHOEYFSXHH72/graph.json","fetch_events":"https://pith.science/api/pith-number/4VGAZFTZE3XOBMSHOEYFSXHH72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VGAZFTZE3XOBMSHOEYFSXHH72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VGAZFTZE3XOBMSHOEYFSXHH72/action/storage_attestation","attest_author":"https://pith.science/pith/4VGAZFTZE3XOBMSHOEYFSXHH72/action/author_attestation","sign_citation":"https://pith.science/pith/4VGAZFTZE3XOBMSHOEYFSXHH72/action/citation_signature","submit_replication":"https://pith.science/pith/4VGAZFTZE3XOBMSHOEYFSXHH72/action/replication_record"}},"created_at":"2026-07-05T00:00:14.028200+00:00","updated_at":"2026-07-05T00:00:14.028200+00:00"}