{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2JCCEY3B2MN4EKLNA33CAVWFEX","short_pith_number":"pith:2JCCEY3B","canonical_record":{"source":{"id":"1603.03820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T23:27:37Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"5e10e8bd8408d4587a77b6e1acfb35bccd92c87633855e2f1386c87c3536b735","abstract_canon_sha256":"bfc36eaa8f82f4e0ab93b7a8f60426b43e35f1778020a1c68b9bf9dcfe8391d6"},"schema_version":"1.0"},"canonical_sha256":"d244226361d31bc2296d06f62056c525d36f6734dfd60a95b72764b9c4b699f5","source":{"kind":"arxiv","id":"1603.03820","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03820","created_at":"2026-05-18T01:01:31Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03820v1","created_at":"2026-05-18T01:01:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03820","created_at":"2026-05-18T01:01:31Z"},{"alias_kind":"pith_short_12","alias_value":"2JCCEY3B2MN4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2JCCEY3B2MN4EKLN","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2JCCEY3B","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2JCCEY3B2MN4EKLNA33CAVWFEX","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T23:27:37Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"5e10e8bd8408d4587a77b6e1acfb35bccd92c87633855e2f1386c87c3536b735","abstract_canon_sha256":"bfc36eaa8f82f4e0ab93b7a8f60426b43e35f1778020a1c68b9bf9dcfe8391d6"},"schema_version":"1.0"},"canonical_sha256":"d244226361d31bc2296d06f62056c525d36f6734dfd60a95b72764b9c4b699f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:31.169813Z","signature_b64":"DQS5UoFRsHx6SnFS0Tg28PCNi7avoHbdaW8FqKJH5VLvEHcXXIgce7w1NajqC85DDjvv6VbSlbllpPWmvJSUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d244226361d31bc2296d06f62056c525d36f6734dfd60a95b72764b9c4b699f5","last_reissued_at":"2026-05-18T01:01:31.169334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:31.169334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03820","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-18T01:01:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OSONIN/I1grhIeqOqcvCcJ/SNZlkOyXCXau4bXZk153VEoCnPfNsMHFVV4PjgKj3nzF+TwtyzvU4gCinAcWeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:49:44.688303Z"},"content_sha256":"69d4d9ddb2f40fb8d9597084eae8ca50a79f16507d9462ec9967aa21a634aae8","schema_version":"1.0","event_id":"sha256:69d4d9ddb2f40fb8d9597084eae8ca50a79f16507d9462ec9967aa21a634aae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2JCCEY3B2MN4EKLNA33CAVWFEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster and Cheaper: Parallelizing Large-Scale Matrix Factorization on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Liana Fong, Liangliang Cao, Wei Tan","submitted_at":"2016-03-11T23:27:37Z","abstract_excerpt":"Matrix factorization (MF) is employed by many popular algorithms, e.g., collaborative filtering. The emerging GPU technology, with massively multicore and high intra-chip memory bandwidth but limited memory capacity, presents an opportunity for accelerating MF much further when appropriately exploiting the GPU architectural characteristics.\n  This paper presents cuMF, a CUDA-based matrix factorization library that implements memory-optimized alternate least square (ALS) method to solve very large-scale MF. CuMF uses a variety set of techniques to maximize the performance on either single or mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03820","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-18T01:01:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5Gw7XPtYl8NA9loKQWvCursorhX8cOiLn1FUxBVQRD5+b95Ara5d9ZJfrZTGgyGc3fSQVEdv7y7KOan5plmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:49:44.689050Z"},"content_sha256":"99c133d830bf6ba596b7af2f49fed0fd486ffcc08b1956f3f76344d6c994e731","schema_version":"1.0","event_id":"sha256:99c133d830bf6ba596b7af2f49fed0fd486ffcc08b1956f3f76344d6c994e731"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JCCEY3B2MN4EKLNA33CAVWFEX/bundle.json","state_url":"https://pith.science/pith/2JCCEY3B2MN4EKLNA33CAVWFEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JCCEY3B2MN4EKLNA33CAVWFEX/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-06T12:49:44Z","links":{"resolver":"https://pith.science/pith/2JCCEY3B2MN4EKLNA33CAVWFEX","bundle":"https://pith.science/pith/2JCCEY3B2MN4EKLNA33CAVWFEX/bundle.json","state":"https://pith.science/pith/2JCCEY3B2MN4EKLNA33CAVWFEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JCCEY3B2MN4EKLNA33CAVWFEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2JCCEY3B2MN4EKLNA33CAVWFEX","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":"bfc36eaa8f82f4e0ab93b7a8f60426b43e35f1778020a1c68b9bf9dcfe8391d6","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T23:27:37Z","title_canon_sha256":"5e10e8bd8408d4587a77b6e1acfb35bccd92c87633855e2f1386c87c3536b735"},"schema_version":"1.0","source":{"id":"1603.03820","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03820","created_at":"2026-05-18T01:01:31Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03820v1","created_at":"2026-05-18T01:01:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03820","created_at":"2026-05-18T01:01:31Z"},{"alias_kind":"pith_short_12","alias_value":"2JCCEY3B2MN4","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2JCCEY3B2MN4EKLN","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2JCCEY3B","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:99c133d830bf6ba596b7af2f49fed0fd486ffcc08b1956f3f76344d6c994e731","target":"graph","created_at":"2026-05-18T01:01:31Z","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) is employed by many popular algorithms, e.g., collaborative filtering. The emerging GPU technology, with massively multicore and high intra-chip memory bandwidth but limited memory capacity, presents an opportunity for accelerating MF much further when appropriately exploiting the GPU architectural characteristics.\n  This paper presents cuMF, a CUDA-based matrix factorization library that implements memory-optimized alternate least square (ALS) method to solve very large-scale MF. CuMF uses a variety set of techniques to maximize the performance on either single or mu","authors_text":"Liana Fong, Liangliang Cao, Wei Tan","cross_cats":["cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T23:27:37Z","title":"Faster and Cheaper: Parallelizing Large-Scale Matrix Factorization on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03820","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:69d4d9ddb2f40fb8d9597084eae8ca50a79f16507d9462ec9967aa21a634aae8","target":"record","created_at":"2026-05-18T01:01:31Z","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":"bfc36eaa8f82f4e0ab93b7a8f60426b43e35f1778020a1c68b9bf9dcfe8391d6","cross_cats_sorted":["cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-11T23:27:37Z","title_canon_sha256":"5e10e8bd8408d4587a77b6e1acfb35bccd92c87633855e2f1386c87c3536b735"},"schema_version":"1.0","source":{"id":"1603.03820","kind":"arxiv","version":1}},"canonical_sha256":"d244226361d31bc2296d06f62056c525d36f6734dfd60a95b72764b9c4b699f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d244226361d31bc2296d06f62056c525d36f6734dfd60a95b72764b9c4b699f5","first_computed_at":"2026-05-18T01:01:31.169334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:31.169334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DQS5UoFRsHx6SnFS0Tg28PCNi7avoHbdaW8FqKJH5VLvEHcXXIgce7w1NajqC85DDjvv6VbSlbllpPWmvJSUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:31.169813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03820","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69d4d9ddb2f40fb8d9597084eae8ca50a79f16507d9462ec9967aa21a634aae8","sha256:99c133d830bf6ba596b7af2f49fed0fd486ffcc08b1956f3f76344d6c994e731"],"state_sha256":"1a1cdc863523ac1565d0e7cbb46e5eb427c3c680a34ceb27dc1432b86aa5154d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ev1pE05FvvD6jrudR40LBhqhGGSGxcezcG1y/JfEKglDB/H3qRu6Ue8N3Jh/zESFBdGcsiZJ8SQNrgWXsvvLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:49:44.694851Z","bundle_sha256":"af7a2be8e3c0f9ea66cda73f9da22193ddf24b11560c25bc4ff6dc26e4393183"}}