{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QGP5MMBREN7CVZZEWPLWR5TOUX","short_pith_number":"pith:QGP5MMBR","canonical_record":{"source":{"id":"1611.10041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-30T08:10:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"365655cd72c470cac7c798949d6fee912c7055fcce2bdc01404811bb055c20fa","abstract_canon_sha256":"3987b315d7dc3e99f25655ade73da780320a6eb2cc100fd85c6aef78941a1899"},"schema_version":"1.0"},"canonical_sha256":"819fd63031237e2ae724b3d768f66ea5f01e4f7a13d30fc1b29339f43143863b","source":{"kind":"arxiv","id":"1611.10041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10041","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10041v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10041","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"QGP5MMBREN7C","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QGP5MMBREN7CVZZE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QGP5MMBR","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QGP5MMBREN7CVZZEWPLWR5TOUX","target":"record","payload":{"canonical_record":{"source":{"id":"1611.10041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-30T08:10:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"365655cd72c470cac7c798949d6fee912c7055fcce2bdc01404811bb055c20fa","abstract_canon_sha256":"3987b315d7dc3e99f25655ade73da780320a6eb2cc100fd85c6aef78941a1899"},"schema_version":"1.0"},"canonical_sha256":"819fd63031237e2ae724b3d768f66ea5f01e4f7a13d30fc1b29339f43143863b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:05.069205Z","signature_b64":"qz0vWrMC5FqHlfyGmFh4HR8cgAmt1tYnCcRrPoCVX2MMwnFSsdb2LtgNBoPF927weP2mTH+gr5GiOcTsMEXiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"819fd63031237e2ae724b3d768f66ea5f01e4f7a13d30fc1b29339f43143863b","last_reissued_at":"2026-05-18T00:56:05.068790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:05.068790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.10041","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wd/n6dFXl3tUoD09Mu92RZUZxOKf7RxpLZje+8U5xoh8cHSBXEAmI+dMMs2O94/TgeSZepShaRzPPu1i/19Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:07:49.933599Z"},"content_sha256":"ab69df27e590cd78848a7ccf3a9ec1b307b65b39458da572216901df027fa128","schema_version":"1.0","event_id":"sha256:ab69df27e590cd78848a7ccf3a9ec1b307b65b39458da572216901df027fa128"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QGP5MMBREN7CVZZEWPLWR5TOUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subsampled online matrix factorization with convergence guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Arthur Mensch (PARIETAL), Bertrand Thirion (PARIETAL), Ga\\\"el Varoquaux (Parietal), Julien Mairal (LEAR)","submitted_at":"2016-11-30T08:10:58Z","abstract_excerpt":"We present a matrix factorization algorithm that scales to input matrices that are large in both dimensions (i.e., that contains morethan 1TB of data). The algorithm streams the matrix columns while subsampling them, resulting in low complexity per iteration andreasonable memory footprint. In contrast to previous online matrix factorization methods, our approach relies on low-dimensional statistics from past iterates to control the extra variance introduced by subsampling. We present a convergence analysis that guarantees us to reach a stationary point of the problem. Large speed-ups can be ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10041","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXsmoY313TOB2MQHRN2BFXMpvI0pNU+nE/5/m4H7ZU+6Jcc53fGy51/SN9bthV5Lv0PWK+dQtzXeBGnek4e9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:07:49.934294Z"},"content_sha256":"78d0b455c0c7f38b129b2321637706fe4e422c3e5ac47e9a303989f1510dd624","schema_version":"1.0","event_id":"sha256:78d0b455c0c7f38b129b2321637706fe4e422c3e5ac47e9a303989f1510dd624"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGP5MMBREN7CVZZEWPLWR5TOUX/bundle.json","state_url":"https://pith.science/pith/QGP5MMBREN7CVZZEWPLWR5TOUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGP5MMBREN7CVZZEWPLWR5TOUX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T20:07:49Z","links":{"resolver":"https://pith.science/pith/QGP5MMBREN7CVZZEWPLWR5TOUX","bundle":"https://pith.science/pith/QGP5MMBREN7CVZZEWPLWR5TOUX/bundle.json","state":"https://pith.science/pith/QGP5MMBREN7CVZZEWPLWR5TOUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGP5MMBREN7CVZZEWPLWR5TOUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QGP5MMBREN7CVZZEWPLWR5TOUX","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":"3987b315d7dc3e99f25655ade73da780320a6eb2cc100fd85c6aef78941a1899","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-30T08:10:58Z","title_canon_sha256":"365655cd72c470cac7c798949d6fee912c7055fcce2bdc01404811bb055c20fa"},"schema_version":"1.0","source":{"id":"1611.10041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10041","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10041v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10041","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"QGP5MMBREN7C","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QGP5MMBREN7CVZZE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QGP5MMBR","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:78d0b455c0c7f38b129b2321637706fe4e422c3e5ac47e9a303989f1510dd624","target":"graph","created_at":"2026-05-18T00:56:05Z","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":"We present a matrix factorization algorithm that scales to input matrices that are large in both dimensions (i.e., that contains morethan 1TB of data). The algorithm streams the matrix columns while subsampling them, resulting in low complexity per iteration andreasonable memory footprint. In contrast to previous online matrix factorization methods, our approach relies on low-dimensional statistics from past iterates to control the extra variance introduced by subsampling. We present a convergence analysis that guarantees us to reach a stationary point of the problem. Large speed-ups can be ob","authors_text":"Arthur Mensch (PARIETAL), Bertrand Thirion (PARIETAL), Ga\\\"el Varoquaux (Parietal), Julien Mairal (LEAR)","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-30T08:10:58Z","title":"Subsampled online matrix factorization with convergence guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10041","kind":"arxiv","version":1},"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:ab69df27e590cd78848a7ccf3a9ec1b307b65b39458da572216901df027fa128","target":"record","created_at":"2026-05-18T00:56:05Z","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":"3987b315d7dc3e99f25655ade73da780320a6eb2cc100fd85c6aef78941a1899","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-30T08:10:58Z","title_canon_sha256":"365655cd72c470cac7c798949d6fee912c7055fcce2bdc01404811bb055c20fa"},"schema_version":"1.0","source":{"id":"1611.10041","kind":"arxiv","version":1}},"canonical_sha256":"819fd63031237e2ae724b3d768f66ea5f01e4f7a13d30fc1b29339f43143863b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"819fd63031237e2ae724b3d768f66ea5f01e4f7a13d30fc1b29339f43143863b","first_computed_at":"2026-05-18T00:56:05.068790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:05.068790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qz0vWrMC5FqHlfyGmFh4HR8cgAmt1tYnCcRrPoCVX2MMwnFSsdb2LtgNBoPF927weP2mTH+gr5GiOcTsMEXiAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:05.069205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab69df27e590cd78848a7ccf3a9ec1b307b65b39458da572216901df027fa128","sha256:78d0b455c0c7f38b129b2321637706fe4e422c3e5ac47e9a303989f1510dd624"],"state_sha256":"cbf068be159abd8486306727c273a4d766292fe7f3be36dd13755fc9b20f41f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19LOPQPRNwMVETNC0ZBjBF/GaxM9ZKOChMNoZgiMD1yxRiQDuU3Pl7AHPkf6fKBYMP/wteMMF7jQoS3joPDPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:07:49.937546Z","bundle_sha256":"2be6fca20607df911cd420d5a1d0d819aa1cb31e8ad0f4835e40b3417fc25783"}}