{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XZKAZ6N74J4RC4AL7XJDN3NIPK","short_pith_number":"pith:XZKAZ6N7","schema_version":"1.0","canonical_sha256":"be540cf9bfe27911700bfdd236eda87a8d9073bfa1e5ebda3761b67a0c7fa3a5","source":{"kind":"arxiv","id":"1904.02580","version":2},"attestation_state":"computed","paper":{"title":"Online Convex Matrix Factorization with Representative Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhishek Agarwal, Jianhao Peng, Olgica Milenkovic","submitted_at":"2019-04-04T14:32:19Z","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"},"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":"1904.02580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T14:32:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d9e955056f0de7cf4621480183234fcd9414611f2a296d810eb932fd42c29c19","abstract_canon_sha256":"b66ab85d1dd2753661a442da923034c0aeb4a462f866f3ccd9e41b62d9ee5c43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:47.321621Z","signature_b64":"i49/em4oh01yO6Gxh71NX7HuvP9lsfE1nUaDv+s5O1xkMGJx/y0u5tvwjj6sFx0CvyojHxXEIdx3ktyx5NYOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be540cf9bfe27911700bfdd236eda87a8d9073bfa1e5ebda3761b67a0c7fa3a5","last_reissued_at":"2026-05-17T23:44:47.320926Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:47.320926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Convex Matrix Factorization with Representative Regions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhishek Agarwal, Jianhao Peng, Olgica Milenkovic","submitted_at":"2019-04-04T14:32:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02580","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":"1904.02580","created_at":"2026-05-17T23:44:47.321040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02580v2","created_at":"2026-05-17T23:44:47.321040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02580","created_at":"2026-05-17T23:44:47.321040+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZKAZ6N74J4R","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZKAZ6N74J4RC4AL","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZKAZ6N7","created_at":"2026-05-18T12:33:33.725879+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/XZKAZ6N74J4RC4AL7XJDN3NIPK","json":"https://pith.science/pith/XZKAZ6N74J4RC4AL7XJDN3NIPK.json","graph_json":"https://pith.science/api/pith-number/XZKAZ6N74J4RC4AL7XJDN3NIPK/graph.json","events_json":"https://pith.science/api/pith-number/XZKAZ6N74J4RC4AL7XJDN3NIPK/events.json","paper":"https://pith.science/paper/XZKAZ6N7"},"agent_actions":{"view_html":"https://pith.science/pith/XZKAZ6N74J4RC4AL7XJDN3NIPK","download_json":"https://pith.science/pith/XZKAZ6N74J4RC4AL7XJDN3NIPK.json","view_paper":"https://pith.science/paper/XZKAZ6N7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02580&json=true","fetch_graph":"https://pith.science/api/pith-number/XZKAZ6N74J4RC4AL7XJDN3NIPK/graph.json","fetch_events":"https://pith.science/api/pith-number/XZKAZ6N74J4RC4AL7XJDN3NIPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZKAZ6N74J4RC4AL7XJDN3NIPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZKAZ6N74J4RC4AL7XJDN3NIPK/action/storage_attestation","attest_author":"https://pith.science/pith/XZKAZ6N74J4RC4AL7XJDN3NIPK/action/author_attestation","sign_citation":"https://pith.science/pith/XZKAZ6N74J4RC4AL7XJDN3NIPK/action/citation_signature","submit_replication":"https://pith.science/pith/XZKAZ6N74J4RC4AL7XJDN3NIPK/action/replication_record"}},"created_at":"2026-05-17T23:44:47.321040+00:00","updated_at":"2026-05-17T23:44:47.321040+00:00"}