{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:B63QFSI6RE2KAPX4HBCXTYUTWT","short_pith_number":"pith:B63QFSI6","schema_version":"1.0","canonical_sha256":"0fb702c91e8934a03efc384579e293b4ec90f178dd06fed62c4778896e8d1bf3","source":{"kind":"arxiv","id":"1911.01931","version":6},"attestation_state":"computed","paper":{"title":"Online matrix factorization for Markovian data and applications to Network Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Deanna Needell, Hanbaek Lyu, Laura Balzano","submitted_at":"2019-11-05T16:47:28Z","abstract_excerpt":"Online Matrix Factorization (OMF) is a fundamental tool for dictionary learning problems, giving an approximate representation of complex data sets in terms of a reduced number of extracted features. Convergence guarantees for most of the OMF algorithms in the literature assume independence between data matrices, and the case of dependent data streams remains largely unexplored. In this paper, we show that a non-convex generalization of the well-known OMF algorithm for i.i.d. stream of data in \\citep{mairal2010online} converges almost surely to the set of critical points of the expected loss f"},"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":"1911.01931","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-05T16:47:28Z","cross_cats_sorted":["cs.DS","math.OC","math.PR","stat.ML"],"title_canon_sha256":"bfa5b5358583e3f1de10abc2c5ed40dd3681632f718e2626efc081d1fbc00491","abstract_canon_sha256":"a8ac63aad3d18579607813515f31341dd228572689637de02b0baebfae4c328d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:48.267245Z","signature_b64":"w0nqia+trcEIQtYqiKAgyybdeHpNZRqwqV+toYIWH9u6oneLer5acNztSGtdsQYRkDztGdstcpz5UuE5jer/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fb702c91e8934a03efc384579e293b4ec90f178dd06fed62c4778896e8d1bf3","last_reissued_at":"2026-07-05T01:49:48.266721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:48.266721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online matrix factorization for Markovian data and applications to Network Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Deanna Needell, Hanbaek Lyu, Laura Balzano","submitted_at":"2019-11-05T16:47:28Z","abstract_excerpt":"Online Matrix Factorization (OMF) is a fundamental tool for dictionary learning problems, giving an approximate representation of complex data sets in terms of a reduced number of extracted features. Convergence guarantees for most of the OMF algorithms in the literature assume independence between data matrices, and the case of dependent data streams remains largely unexplored. In this paper, we show that a non-convex generalization of the well-known OMF algorithm for i.i.d. stream of data in \\citep{mairal2010online} converges almost surely to the set of critical points of the expected loss f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01931","kind":"arxiv","version":6},"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/1911.01931/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":"1911.01931","created_at":"2026-07-05T01:49:48.266773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01931v6","created_at":"2026-07-05T01:49:48.266773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01931","created_at":"2026-07-05T01:49:48.266773+00:00"},{"alias_kind":"pith_short_12","alias_value":"B63QFSI6RE2K","created_at":"2026-07-05T01:49:48.266773+00:00"},{"alias_kind":"pith_short_16","alias_value":"B63QFSI6RE2KAPX4","created_at":"2026-07-05T01:49:48.266773+00:00"},{"alias_kind":"pith_short_8","alias_value":"B63QFSI6","created_at":"2026-07-05T01:49:48.266773+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/B63QFSI6RE2KAPX4HBCXTYUTWT","json":"https://pith.science/pith/B63QFSI6RE2KAPX4HBCXTYUTWT.json","graph_json":"https://pith.science/api/pith-number/B63QFSI6RE2KAPX4HBCXTYUTWT/graph.json","events_json":"https://pith.science/api/pith-number/B63QFSI6RE2KAPX4HBCXTYUTWT/events.json","paper":"https://pith.science/paper/B63QFSI6"},"agent_actions":{"view_html":"https://pith.science/pith/B63QFSI6RE2KAPX4HBCXTYUTWT","download_json":"https://pith.science/pith/B63QFSI6RE2KAPX4HBCXTYUTWT.json","view_paper":"https://pith.science/paper/B63QFSI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01931&json=true","fetch_graph":"https://pith.science/api/pith-number/B63QFSI6RE2KAPX4HBCXTYUTWT/graph.json","fetch_events":"https://pith.science/api/pith-number/B63QFSI6RE2KAPX4HBCXTYUTWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B63QFSI6RE2KAPX4HBCXTYUTWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B63QFSI6RE2KAPX4HBCXTYUTWT/action/storage_attestation","attest_author":"https://pith.science/pith/B63QFSI6RE2KAPX4HBCXTYUTWT/action/author_attestation","sign_citation":"https://pith.science/pith/B63QFSI6RE2KAPX4HBCXTYUTWT/action/citation_signature","submit_replication":"https://pith.science/pith/B63QFSI6RE2KAPX4HBCXTYUTWT/action/replication_record"}},"created_at":"2026-07-05T01:49:48.266773+00:00","updated_at":"2026-07-05T01:49:48.266773+00:00"}