{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LSWKS5GSRY5GFD2QR2L3XOZ7RU","short_pith_number":"pith:LSWKS5GS","schema_version":"1.0","canonical_sha256":"5caca974d28e3a628f508e97bbbb3f8d34e7f41010135b93d0072c3bcf2164c8","source":{"kind":"arxiv","id":"1808.03843","version":1},"attestation_state":"computed","paper":{"title":"Matrix Factorization on GPUs with Memory Optimization and Approximate Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.DC","authors_text":"Cheng Li, Liana Fong, Liangliang Cao, Shiyu Chang, Wei Tan, Zijun Wang","submitted_at":"2018-08-11T17:36:10Z","abstract_excerpt":"Matrix factorization (MF) discovers latent features from observations, which has shown great promises in the fields of collaborative filtering, data compression, feature extraction, word embedding, etc. While many problem-specific optimization techniques have been proposed, alternating least square (ALS) remains popular due to its general applicability e.g. easy to handle positive-unlabeled inputs, fast convergence and parallelization capability. Current MF implementations are either optimized for a single machine or with a need of a large computer cluster but still are insufficient. This is b"},"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":"1808.03843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-11T17:36:10Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"2be0ea885bf8b7044720de27759981b944718ecff3a109799e7d5c7a4ab166e1","abstract_canon_sha256":"cc41cf5940cc4cd85a4b2d229487906c0e09b81cfa65e92a9e0dcef41260c679"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.565451Z","signature_b64":"iGRyiVDnSsM4hP0hqF2IFn/FT/nzBXUdHRvvsa603Jas0m18N2/OF+Rv8A/56Wfn14N5/dEvnoTNYicDy3tPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5caca974d28e3a628f508e97bbbb3f8d34e7f41010135b93d0072c3bcf2164c8","last_reissued_at":"2026-05-18T00:08:19.564759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.564759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Factorization on GPUs with Memory Optimization and Approximate Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.DC","authors_text":"Cheng Li, Liana Fong, Liangliang Cao, Shiyu Chang, Wei Tan, Zijun Wang","submitted_at":"2018-08-11T17:36:10Z","abstract_excerpt":"Matrix factorization (MF) discovers latent features from observations, which has shown great promises in the fields of collaborative filtering, data compression, feature extraction, word embedding, etc. While many problem-specific optimization techniques have been proposed, alternating least square (ALS) remains popular due to its general applicability e.g. easy to handle positive-unlabeled inputs, fast convergence and parallelization capability. Current MF implementations are either optimized for a single machine or with a need of a large computer cluster but still are insufficient. This is b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03843","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.03843","created_at":"2026-05-18T00:08:19.564858+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03843v1","created_at":"2026-05-18T00:08:19.564858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03843","created_at":"2026-05-18T00:08:19.564858+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSWKS5GSRY5G","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSWKS5GSRY5GFD2Q","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSWKS5GS","created_at":"2026-05-18T12:32:37.024351+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/LSWKS5GSRY5GFD2QR2L3XOZ7RU","json":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU.json","graph_json":"https://pith.science/api/pith-number/LSWKS5GSRY5GFD2QR2L3XOZ7RU/graph.json","events_json":"https://pith.science/api/pith-number/LSWKS5GSRY5GFD2QR2L3XOZ7RU/events.json","paper":"https://pith.science/paper/LSWKS5GS"},"agent_actions":{"view_html":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU","download_json":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU.json","view_paper":"https://pith.science/paper/LSWKS5GS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03843&json=true","fetch_graph":"https://pith.science/api/pith-number/LSWKS5GSRY5GFD2QR2L3XOZ7RU/graph.json","fetch_events":"https://pith.science/api/pith-number/LSWKS5GSRY5GFD2QR2L3XOZ7RU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/action/storage_attestation","attest_author":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/action/author_attestation","sign_citation":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/action/citation_signature","submit_replication":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/action/replication_record"}},"created_at":"2026-05-18T00:08:19.564858+00:00","updated_at":"2026-05-18T00:08:19.564858+00:00"}