{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XVS64WDGPFPZV6DSFHWV7EU6SO","short_pith_number":"pith:XVS64WDG","schema_version":"1.0","canonical_sha256":"bd65ee5866795f9af87229ed5f929e93994619dc9760f5745a69d3edf5ba0983","source":{"kind":"arxiv","id":"1701.05363","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.05363","created_at":"2026-05-18T00:30:50.773773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05363v3","created_at":"2026-05-18T00:30:50.773773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05363","created_at":"2026-05-18T00:30:50.773773+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVS64WDGPFPZ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVS64WDGPFPZV6DS","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVS64WDG","created_at":"2026-05-18T12:31:56.362134+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/XVS64WDGPFPZV6DSFHWV7EU6SO","json":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO.json","graph_json":"https://pith.science/api/pith-number/XVS64WDGPFPZV6DSFHWV7EU6SO/graph.json","events_json":"https://pith.science/api/pith-number/XVS64WDGPFPZV6DSFHWV7EU6SO/events.json","paper":"https://pith.science/paper/XVS64WDG"},"agent_actions":{"view_html":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO","download_json":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO.json","view_paper":"https://pith.science/paper/XVS64WDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05363&json=true","fetch_graph":"https://pith.science/api/pith-number/XVS64WDGPFPZV6DSFHWV7EU6SO/graph.json","fetch_events":"https://pith.science/api/pith-number/XVS64WDGPFPZV6DSFHWV7EU6SO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/action/storage_attestation","attest_author":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/action/author_attestation","sign_citation":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/action/citation_signature","submit_replication":"https://pith.science/pith/XVS64WDGPFPZV6DSFHWV7EU6SO/action/replication_record"}},"created_at":"2026-05-18T00:30:50.773773+00:00","updated_at":"2026-05-18T00:30:50.773773+00:00"}