{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XVS64WDGPFPZV6DSFHWV7EU6SO","short_pith_number":"pith:XVS64WDG","canonical_record":{"source":{"id":"1701.05363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T10:35:01Z","cross_cats_sorted":["cs.LG","math.OC","q-bio.NC"],"title_canon_sha256":"155fcab255cb5f4e0be13fe44b185532640066fa9a5f0ad94b3274bb2fa62737","abstract_canon_sha256":"d98d668282fa043c62ead4df76c01ab53114292f73ee73ab2ad55502149df930"},"schema_version":"1.0"},"canonical_sha256":"bd65ee5866795f9af87229ed5f929e93994619dc9760f5745a69d3edf5ba0983","source":{"kind":"arxiv","id":"1701.05363","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05363","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05363v3","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05363","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"pith_short_12","alias_value":"XVS64WDGPFPZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XVS64WDGPFPZV6DS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XVS64WDG","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XVS64WDGPFPZV6DSFHWV7EU6SO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T10:35:01Z","cross_cats_sorted":["cs.LG","math.OC","q-bio.NC"],"title_canon_sha256":"155fcab255cb5f4e0be13fe44b185532640066fa9a5f0ad94b3274bb2fa62737","abstract_canon_sha256":"d98d668282fa043c62ead4df76c01ab53114292f73ee73ab2ad55502149df930"},"schema_version":"1.0"},"canonical_sha256":"bd65ee5866795f9af87229ed5f929e93994619dc9760f5745a69d3edf5ba0983","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:50.774275Z","signature_b64":"hol1KOeg4jNxJSaVfwqeGlbWW5merBn/9KqO9NuND8P1rTahF0fjelUlGso9WLPVFlTWwfe9aM8Zil0a++RtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd65ee5866795f9af87229ed5f929e93994619dc9760f5745a69d3edf5ba0983","last_reissued_at":"2026-05-18T00:30:50.773665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:50.773665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05363","source_version":3,"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:30:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXBtIKWs7Egh/sMBLjD2GBwwD0SNJkBZ71+bCqRgIGK8quDTA2hji6CLVUlACcdImhsdWkFqtRWNW+CMAE6FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:59.707527Z"},"content_sha256":"aa1e2ef4b763bb9bc0c3df2770475e06fb1f3e95e836b0653120cc5a4a6286a0","schema_version":"1.0","event_id":"sha256:aa1e2ef4b763bb9bc0c3df2770475e06fb1f3e95e836b0653120cc5a4a6286a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XVS64WDGPFPZV6DSFHWV7EU6SO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Subsampling for Factorizing Huge Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","q-bio.NC"],"primary_cat":"stat.ML","authors_text":"Arthur Mensch (PARIETAL, Bertrand Thirion (PARIETAL, Gael Varoquaux (NEUROSPIN, Julien Mairal (Thoth), NEUROSPIN), PARIETAL)","submitted_at":"2017-01-19T10:35:01Z","abstract_excerpt":"We present a matrix-factorization algorithm that scales to input matrices with both huge number of rows and columns. Learned factors may be sparse or dense and/or non-negative, which makes our algorithm suitable for dictionary learning, sparse component analysis, and non-negative matrix factorization. Our algorithm streams matrix columns while subsampling them to iteratively learn the matrix factors. At each iteration, the row dimension of a new sample is reduced by subsampling, resulting in lower time complexity compared to a simple streaming algorithm. Our method comes with convergence guara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05363","kind":"arxiv","version":3},"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:30:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edzK+dqY6/gtqV+dJBiTaVC/UHzD+WHpWLnviBL9HyXe79zEMYrq3tyZgby59Fssph4XjyiWUTA5DYBni8gCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:59.708251Z"},"content_sha256":"96f71668e8073c5c40904761137407e2be68b4ae0b0f0d84cd54d2b85d29fad6","schema_version":"1.0","event_id":"sha256:96f71668e8073c5c40904761137407e2be68b4ae0b0f0d84cd54d2b85d29fad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/bundle.json","state_url":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/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-05-30T05:52:59Z","links":{"resolver":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO","bundle":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/bundle.json","state":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XVS64WDGPFPZV6DSFHWV7EU6SO","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":"d98d668282fa043c62ead4df76c01ab53114292f73ee73ab2ad55502149df930","cross_cats_sorted":["cs.LG","math.OC","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T10:35:01Z","title_canon_sha256":"155fcab255cb5f4e0be13fe44b185532640066fa9a5f0ad94b3274bb2fa62737"},"schema_version":"1.0","source":{"id":"1701.05363","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05363","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05363v3","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05363","created_at":"2026-05-18T00:30:50Z"},{"alias_kind":"pith_short_12","alias_value":"XVS64WDGPFPZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XVS64WDGPFPZV6DS","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XVS64WDG","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:96f71668e8073c5c40904761137407e2be68b4ae0b0f0d84cd54d2b85d29fad6","target":"graph","created_at":"2026-05-18T00:30:50Z","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 with both huge number of rows and columns. Learned factors may be sparse or dense and/or non-negative, which makes our algorithm suitable for dictionary learning, sparse component analysis, and non-negative matrix factorization. Our algorithm streams matrix columns while subsampling them to iteratively learn the matrix factors. At each iteration, the row dimension of a new sample is reduced by subsampling, resulting in lower time complexity compared to a simple streaming algorithm. Our method comes with convergence guara","authors_text":"Arthur Mensch (PARIETAL, Bertrand Thirion (PARIETAL, Gael Varoquaux (NEUROSPIN, Julien Mairal (Thoth), NEUROSPIN), PARIETAL)","cross_cats":["cs.LG","math.OC","q-bio.NC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T10:35:01Z","title":"Stochastic Subsampling for Factorizing Huge Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05363","kind":"arxiv","version":3},"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:aa1e2ef4b763bb9bc0c3df2770475e06fb1f3e95e836b0653120cc5a4a6286a0","target":"record","created_at":"2026-05-18T00:30:50Z","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":"d98d668282fa043c62ead4df76c01ab53114292f73ee73ab2ad55502149df930","cross_cats_sorted":["cs.LG","math.OC","q-bio.NC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T10:35:01Z","title_canon_sha256":"155fcab255cb5f4e0be13fe44b185532640066fa9a5f0ad94b3274bb2fa62737"},"schema_version":"1.0","source":{"id":"1701.05363","kind":"arxiv","version":3}},"canonical_sha256":"bd65ee5866795f9af87229ed5f929e93994619dc9760f5745a69d3edf5ba0983","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd65ee5866795f9af87229ed5f929e93994619dc9760f5745a69d3edf5ba0983","first_computed_at":"2026-05-18T00:30:50.773665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:50.773665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hol1KOeg4jNxJSaVfwqeGlbWW5merBn/9KqO9NuND8P1rTahF0fjelUlGso9WLPVFlTWwfe9aM8Zil0a++RtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:50.774275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05363","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa1e2ef4b763bb9bc0c3df2770475e06fb1f3e95e836b0653120cc5a4a6286a0","sha256:96f71668e8073c5c40904761137407e2be68b4ae0b0f0d84cd54d2b85d29fad6"],"state_sha256":"9c37621f73e9821ad6fe17ce5ae667373504e55f5e9759dd3a0f8991c4710955"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/t3UXROE1RUy5L6Z9F2Fxp0ZIKHu4eyq0ipUIVsIHfUHEy0i8BEBzKNmK5OzD6uLYai47BEE/oClhW9old6SCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:52:59.712258Z","bundle_sha256":"b849b1b9ca0dc30d772bc519d9c862c7f7794b990eb057b7207d9451ab4a670a"}}