{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XZKAZ6N74J4RC4AL7XJDN3NIPK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b66ab85d1dd2753661a442da923034c0aeb4a462f866f3ccd9e41b62d9ee5c43","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T14:32:19Z","title_canon_sha256":"d9e955056f0de7cf4621480183234fcd9414611f2a296d810eb932fd42c29c19"},"schema_version":"1.0","source":{"id":"1904.02580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02580","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02580v2","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02580","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"XZKAZ6N74J4R","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XZKAZ6N74J4RC4AL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XZKAZ6N7","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:ee46d692038d91aba115665d9ff537e8a5067ad8adc02179309e674621c26cd6","target":"graph","created_at":"2026-05-17T23:44:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Matrix factorization (MF) is a versatile learning method that has found wide applications in various data-driven disciplines. Still, many MF algorithms do not adequately scale with the size of available datasets and/or lack interpretability. To improve the computational efficiency of the method, an online (streaming) MF algorithm was proposed in Mairal et al. [2010]. To enable data interpretability, a constrained version of MF, termed convex MF, was introduced in Ding et al. [2010]. In the latter work, the basis vectors are required to lie in the convex hull of the data samples, thereby ensuri","authors_text":"Abhishek Agarwal, Jianhao Peng, Olgica Milenkovic","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T14:32:19Z","title":"Online Convex Matrix Factorization with Representative Regions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02580","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3bc6cfddda2a70a29a8c7ff1dba7c285aa81749193b362c47da409a34780043c","target":"record","created_at":"2026-05-17T23:44:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b66ab85d1dd2753661a442da923034c0aeb4a462f866f3ccd9e41b62d9ee5c43","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T14:32:19Z","title_canon_sha256":"d9e955056f0de7cf4621480183234fcd9414611f2a296d810eb932fd42c29c19"},"schema_version":"1.0","source":{"id":"1904.02580","kind":"arxiv","version":2}},"canonical_sha256":"be540cf9bfe27911700bfdd236eda87a8d9073bfa1e5ebda3761b67a0c7fa3a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be540cf9bfe27911700bfdd236eda87a8d9073bfa1e5ebda3761b67a0c7fa3a5","first_computed_at":"2026-05-17T23:44:47.320926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:47.320926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i49/em4oh01yO6Gxh71NX7HuvP9lsfE1nUaDv+s5O1xkMGJx/y0u5tvwjj6sFx0CvyojHxXEIdx3ktyx5NYOCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:47.321621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bc6cfddda2a70a29a8c7ff1dba7c285aa81749193b362c47da409a34780043c","sha256:ee46d692038d91aba115665d9ff537e8a5067ad8adc02179309e674621c26cd6"],"state_sha256":"fce3597d612bd76e17102f93a49e613c638f48c920041c96819d72303bbd7583"}