{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LSWKS5GSRY5GFD2QR2L3XOZ7RU","short_pith_number":"pith:LSWKS5GS","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"},"canonical_sha256":"5caca974d28e3a628f508e97bbbb3f8d34e7f41010135b93d0072c3bcf2164c8","source":{"kind":"arxiv","id":"1808.03843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03843","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03843v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03843","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"LSWKS5GSRY5G","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LSWKS5GSRY5GFD2Q","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LSWKS5GS","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LSWKS5GSRY5GFD2QR2L3XOZ7RU","target":"record","payload":{"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"},"canonical_sha256":"5caca974d28e3a628f508e97bbbb3f8d34e7f41010135b93d0072c3bcf2164c8","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"},"source_kind":"arxiv","source_id":"1808.03843","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:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1P/X98G5L41hYBgB13TBzFloYPGa7BNUH0mguLiJ4i8Gb5zeUOfmyKfLeR9eB94kcpJmHrwPh+9/kHc9NwLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:03:39.163593Z"},"content_sha256":"7e8f071947a5ce2c18030ccc10e1314dfd66f3827e2eca84eb36659e72e0e83c","schema_version":"1.0","event_id":"sha256:7e8f071947a5ce2c18030ccc10e1314dfd66f3827e2eca84eb36659e72e0e83c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LSWKS5GSRY5GFD2QR2L3XOZ7RU","target":"graph","payload":{"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"},"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:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZIWpgOZ39dhww8kz5W93p96Ahja1hDQIGDquFVL9b28tBMHocJyQfDtOeU8j15Fjor6HjcSk9dL/AekXqHKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:03:39.164274Z"},"content_sha256":"c4346d8ad7dab7bb723d9ca276e5263754737932dbd1c57f4745db8e4b8c83aa","schema_version":"1.0","event_id":"sha256:c4346d8ad7dab7bb723d9ca276e5263754737932dbd1c57f4745db8e4b8c83aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/bundle.json","state_url":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/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-06T18:03:39Z","links":{"resolver":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU","bundle":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/bundle.json","state":"https://pith.science/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSWKS5GSRY5GFD2QR2L3XOZ7RU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LSWKS5GSRY5GFD2QR2L3XOZ7RU","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":"cc41cf5940cc4cd85a4b2d229487906c0e09b81cfa65e92a9e0dcef41260c679","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-11T17:36:10Z","title_canon_sha256":"2be0ea885bf8b7044720de27759981b944718ecff3a109799e7d5c7a4ab166e1"},"schema_version":"1.0","source":{"id":"1808.03843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03843","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03843v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03843","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"LSWKS5GSRY5G","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LSWKS5GSRY5GFD2Q","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LSWKS5GS","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:c4346d8ad7dab7bb723d9ca276e5263754737932dbd1c57f4745db8e4b8c83aa","target":"graph","created_at":"2026-05-18T00:08:19Z","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":"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","authors_text":"Cheng Li, Liana Fong, Liangliang Cao, Shiyu Chang, Wei Tan, Zijun Wang","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-11T17:36:10Z","title":"Matrix Factorization on GPUs with Memory Optimization and Approximate Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03843","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:7e8f071947a5ce2c18030ccc10e1314dfd66f3827e2eca84eb36659e72e0e83c","target":"record","created_at":"2026-05-18T00:08:19Z","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":"cc41cf5940cc4cd85a4b2d229487906c0e09b81cfa65e92a9e0dcef41260c679","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-11T17:36:10Z","title_canon_sha256":"2be0ea885bf8b7044720de27759981b944718ecff3a109799e7d5c7a4ab166e1"},"schema_version":"1.0","source":{"id":"1808.03843","kind":"arxiv","version":1}},"canonical_sha256":"5caca974d28e3a628f508e97bbbb3f8d34e7f41010135b93d0072c3bcf2164c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5caca974d28e3a628f508e97bbbb3f8d34e7f41010135b93d0072c3bcf2164c8","first_computed_at":"2026-05-18T00:08:19.564759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:19.564759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iGRyiVDnSsM4hP0hqF2IFn/FT/nzBXUdHRvvsa603Jas0m18N2/OF+Rv8A/56Wfn14N5/dEvnoTNYicDy3tPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:19.565451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e8f071947a5ce2c18030ccc10e1314dfd66f3827e2eca84eb36659e72e0e83c","sha256:c4346d8ad7dab7bb723d9ca276e5263754737932dbd1c57f4745db8e4b8c83aa"],"state_sha256":"5525f1c0a1c3e17c9832c30944ebea0b68f079ad0a98bf4c64d85099af18dbcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22y3L0cEZeNxqbI7gpm+lEgi6qxBfR1un3z6L1b903/nJLxx64XfmRi80IBpeqdPC1o0+3Zz0vm0CDszn3QUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:03:39.167967Z","bundle_sha256":"d5d422ca3ee78b4d3f0aac3b59135c6ded0aa287e91a6f4e2847f0a6ddf0c54f"}}