{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CWIMGU7SP4JNJVPIHDKS2F2LLU","short_pith_number":"pith:CWIMGU7S","canonical_record":{"source":{"id":"1705.04159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-11T13:20:01Z","cross_cats_sorted":[],"title_canon_sha256":"a6bd97ce4243cd51f43da7cf5417262e7e9fb71f4c10f3702e54b1449eb788ea","abstract_canon_sha256":"09afee8c29a5283c03237f4982e7280697cfb220a806f7a5d31949a9d6ceaa2d"},"schema_version":"1.0"},"canonical_sha256":"1590c353f27f12d4d5e838d52d174b5d24d6c411b6f9db2c97d4adea448728e3","source":{"kind":"arxiv","id":"1705.04159","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04159","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04159v1","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04159","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"CWIMGU7SP4JN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CWIMGU7SP4JNJVPI","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CWIMGU7S","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CWIMGU7SP4JNJVPIHDKS2F2LLU","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-11T13:20:01Z","cross_cats_sorted":[],"title_canon_sha256":"a6bd97ce4243cd51f43da7cf5417262e7e9fb71f4c10f3702e54b1449eb788ea","abstract_canon_sha256":"09afee8c29a5283c03237f4982e7280697cfb220a806f7a5d31949a9d6ceaa2d"},"schema_version":"1.0"},"canonical_sha256":"1590c353f27f12d4d5e838d52d174b5d24d6c411b6f9db2c97d4adea448728e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:39.588508Z","signature_b64":"nDJu/8icgvk/vbzRPIDcqz3woB9fNT7hF7KmYOPrDLI/OPwWYrmDM2HsE5KjhuhMHM+2S8dC6UD8L1YkC0eEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1590c353f27f12d4d5e838d52d174b5d24d6c411b6f9db2c97d4adea448728e3","last_reissued_at":"2026-05-18T00:44:39.587841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:39.587841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04159","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:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RgfbvZChy96OCvWynqEkGPABtjkK486nKMB8kCnuRaDpXwo8UJ7hk4h8YdFnmqQb2wp8N20jnVPAHSy1DlkzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:20:12.096147Z"},"content_sha256":"0735042300bdfca75b7951c07f654789c370309cf1a46e1ab87de341e3ab3e5b","schema_version":"1.0","event_id":"sha256:0735042300bdfca75b7951c07f654789c370309cf1a46e1ab87de341e3ab3e5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CWIMGU7SP4JNJVPIHDKS2F2LLU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Bayesian Probabilistic Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Imen Chakroun, Tom Haber, Tom Vander Aa","submitted_at":"2017-05-11T13:20:01Z","abstract_excerpt":"Matrix factorization is a common machine learning technique for recommender systems. Despite its high prediction accuracy, the Bayesian Probabilistic Matrix Factorization algorithm (BPMF) has not been widely used on large scale data because of its high computational cost. In this paper we propose a distributed high-performance parallel implementation of BPMF on shared memory and distributed architectures. We show by using efficient load balancing using work stealing on a single node, and by using asynchronous communication in the distributed version we beat state of the art implementations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04159","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:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIZG2XOwo4UHTZu8Z31bxResHC1tt5M4Q+j/7OZEE5g+OjKMB0HaipJWD4YDkS6r5IrVMTI2iMwNos7IXDV5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:20:12.096837Z"},"content_sha256":"6ebbfc226ce6d155a831e6fa765414f512329b8790d3d774fff5cb0f6ea5d828","schema_version":"1.0","event_id":"sha256:6ebbfc226ce6d155a831e6fa765414f512329b8790d3d774fff5cb0f6ea5d828"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWIMGU7SP4JNJVPIHDKS2F2LLU/bundle.json","state_url":"https://pith.science/pith/CWIMGU7SP4JNJVPIHDKS2F2LLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWIMGU7SP4JNJVPIHDKS2F2LLU/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-26T15:20:12Z","links":{"resolver":"https://pith.science/pith/CWIMGU7SP4JNJVPIHDKS2F2LLU","bundle":"https://pith.science/pith/CWIMGU7SP4JNJVPIHDKS2F2LLU/bundle.json","state":"https://pith.science/pith/CWIMGU7SP4JNJVPIHDKS2F2LLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWIMGU7SP4JNJVPIHDKS2F2LLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CWIMGU7SP4JNJVPIHDKS2F2LLU","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":"09afee8c29a5283c03237f4982e7280697cfb220a806f7a5d31949a9d6ceaa2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-11T13:20:01Z","title_canon_sha256":"a6bd97ce4243cd51f43da7cf5417262e7e9fb71f4c10f3702e54b1449eb788ea"},"schema_version":"1.0","source":{"id":"1705.04159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04159","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04159v1","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04159","created_at":"2026-05-18T00:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"CWIMGU7SP4JN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CWIMGU7SP4JNJVPI","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CWIMGU7S","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:6ebbfc226ce6d155a831e6fa765414f512329b8790d3d774fff5cb0f6ea5d828","target":"graph","created_at":"2026-05-18T00:44:39Z","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 is a common machine learning technique for recommender systems. Despite its high prediction accuracy, the Bayesian Probabilistic Matrix Factorization algorithm (BPMF) has not been widely used on large scale data because of its high computational cost. In this paper we propose a distributed high-performance parallel implementation of BPMF on shared memory and distributed architectures. We show by using efficient load balancing using work stealing on a single node, and by using asynchronous communication in the distributed version we beat state of the art implementations.","authors_text":"Imen Chakroun, Tom Haber, Tom Vander Aa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-11T13:20:01Z","title":"Distributed Bayesian Probabilistic Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04159","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:0735042300bdfca75b7951c07f654789c370309cf1a46e1ab87de341e3ab3e5b","target":"record","created_at":"2026-05-18T00:44:39Z","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":"09afee8c29a5283c03237f4982e7280697cfb220a806f7a5d31949a9d6ceaa2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-11T13:20:01Z","title_canon_sha256":"a6bd97ce4243cd51f43da7cf5417262e7e9fb71f4c10f3702e54b1449eb788ea"},"schema_version":"1.0","source":{"id":"1705.04159","kind":"arxiv","version":1}},"canonical_sha256":"1590c353f27f12d4d5e838d52d174b5d24d6c411b6f9db2c97d4adea448728e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1590c353f27f12d4d5e838d52d174b5d24d6c411b6f9db2c97d4adea448728e3","first_computed_at":"2026-05-18T00:44:39.587841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:39.587841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nDJu/8icgvk/vbzRPIDcqz3woB9fNT7hF7KmYOPrDLI/OPwWYrmDM2HsE5KjhuhMHM+2S8dC6UD8L1YkC0eEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:39.588508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0735042300bdfca75b7951c07f654789c370309cf1a46e1ab87de341e3ab3e5b","sha256:6ebbfc226ce6d155a831e6fa765414f512329b8790d3d774fff5cb0f6ea5d828"],"state_sha256":"9251b72037f151f3db7e0cc9efa663b63ece27ee7aa488e6a0f202b62dc1dc13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kFVGmCz6wCc8CDrK0UbeGh0/EjFKJQqQZ6Ob/P/mTxLjMAvR3HRrkEQaqbPT66uoNrZ2yfGrSNng8V96BzomCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:20:12.100309Z","bundle_sha256":"fd709a0764ca0555e66693367184df54e78b53c3790985a723246c104ae5567a"}}