{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B2C5XOB6ERWV7M2XQIRYZSC4L7","short_pith_number":"pith:B2C5XOB6","canonical_record":{"source":{"id":"1705.10633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T08:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"069ccfd3c1caad62d3e923f3dac4cd1c03ba3dc4ae2389e3270c1b82766267f2","abstract_canon_sha256":"54dca8c9b3228d9c2b5b0106e286074f35011382d572a145a28de6842bfdbc92"},"schema_version":"1.0"},"canonical_sha256":"0e85dbb83e246d5fb35782238cc85c5fc0c6dca9a31ff43fd9ec1bebdc96406c","source":{"kind":"arxiv","id":"1705.10633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10633","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10633v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10633","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"B2C5XOB6ERWV","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B2C5XOB6ERWV7M2X","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B2C5XOB6","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B2C5XOB6ERWV7M2XQIRYZSC4L7","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T08:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"069ccfd3c1caad62d3e923f3dac4cd1c03ba3dc4ae2389e3270c1b82766267f2","abstract_canon_sha256":"54dca8c9b3228d9c2b5b0106e286074f35011382d572a145a28de6842bfdbc92"},"schema_version":"1.0"},"canonical_sha256":"0e85dbb83e246d5fb35782238cc85c5fc0c6dca9a31ff43fd9ec1bebdc96406c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:23.987478Z","signature_b64":"6ufYM4bXCm0mN+iJ64Zg5KuDMBAfkdiUi45yg0+3lnk2+13h7nBkydeDzYfr1xn4mM8QXVm3fpEn/VbZSsBBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e85dbb83e246d5fb35782238cc85c5fc0c6dca9a31ff43fd9ec1bebdc96406c","last_reissued_at":"2026-05-18T00:43:23.986827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:23.986827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10633","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:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wi7FI8cOK1/UjiK5mIiMgjlpWcSB99DBi9D6KH3zzFWTj/f25I7exdNyR2kJoxRxOfu46f+Urck3y1YxywxMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:13:48.949738Z"},"content_sha256":"c56ca8d18a41fccea2c6cf6d626c0971a0db986b7b1097acc78e2b4b322d860a","schema_version":"1.0","event_id":"sha256:c56ca8d18a41fccea2c6cf6d626c0971a0db986b7b1097acc78e2b4b322d860a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B2C5XOB6ERWV7M2XQIRYZSC4L7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Matrix Factorization using Asynchrounous Communication","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-29T08:24:10Z","abstract_excerpt":"Using the matrix factorization technique in machine learning is very common mainly in areas like recommender systems. Despite its high prediction accuracy and its ability to avoid over-fitting of the data, the Bayesian Probabilistic Matrix Factorization algorithm (BPMF) has not been widely used on large scale data because of the prohibitive cost. In this paper, we propose a distributed high-performance parallel implementation of the BPMF using Gibbs sampling on shared and distributed architectures. We show by using efficient load balancing using work stealing on a single node, and by using asy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10633","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:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SueyfbdJJxhABh0wVB2eaaEOBRzmqdiFFjUQSycHIyJOmIHPsI84EvtipFSpPEM8fifvprMjfQOkwm9csgz7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:13:48.950093Z"},"content_sha256":"f212ef694f8d56d6e41fa6c59f7038b92333f45bd28756b46046e14df4fe047c","schema_version":"1.0","event_id":"sha256:f212ef694f8d56d6e41fa6c59f7038b92333f45bd28756b46046e14df4fe047c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2C5XOB6ERWV7M2XQIRYZSC4L7/bundle.json","state_url":"https://pith.science/pith/B2C5XOB6ERWV7M2XQIRYZSC4L7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2C5XOB6ERWV7M2XQIRYZSC4L7/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-26T13:13:48Z","links":{"resolver":"https://pith.science/pith/B2C5XOB6ERWV7M2XQIRYZSC4L7","bundle":"https://pith.science/pith/B2C5XOB6ERWV7M2XQIRYZSC4L7/bundle.json","state":"https://pith.science/pith/B2C5XOB6ERWV7M2XQIRYZSC4L7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2C5XOB6ERWV7M2XQIRYZSC4L7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B2C5XOB6ERWV7M2XQIRYZSC4L7","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":"54dca8c9b3228d9c2b5b0106e286074f35011382d572a145a28de6842bfdbc92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T08:24:10Z","title_canon_sha256":"069ccfd3c1caad62d3e923f3dac4cd1c03ba3dc4ae2389e3270c1b82766267f2"},"schema_version":"1.0","source":{"id":"1705.10633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10633","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10633v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10633","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"B2C5XOB6ERWV","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B2C5XOB6ERWV7M2X","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B2C5XOB6","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:f212ef694f8d56d6e41fa6c59f7038b92333f45bd28756b46046e14df4fe047c","target":"graph","created_at":"2026-05-18T00:43:23Z","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":"Using the matrix factorization technique in machine learning is very common mainly in areas like recommender systems. Despite its high prediction accuracy and its ability to avoid over-fitting of the data, the Bayesian Probabilistic Matrix Factorization algorithm (BPMF) has not been widely used on large scale data because of the prohibitive cost. In this paper, we propose a distributed high-performance parallel implementation of the BPMF using Gibbs sampling on shared and distributed architectures. We show by using efficient load balancing using work stealing on a single node, and by using asy","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-29T08:24:10Z","title":"Distributed Matrix Factorization using Asynchrounous Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10633","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:c56ca8d18a41fccea2c6cf6d626c0971a0db986b7b1097acc78e2b4b322d860a","target":"record","created_at":"2026-05-18T00:43:23Z","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":"54dca8c9b3228d9c2b5b0106e286074f35011382d572a145a28de6842bfdbc92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-29T08:24:10Z","title_canon_sha256":"069ccfd3c1caad62d3e923f3dac4cd1c03ba3dc4ae2389e3270c1b82766267f2"},"schema_version":"1.0","source":{"id":"1705.10633","kind":"arxiv","version":1}},"canonical_sha256":"0e85dbb83e246d5fb35782238cc85c5fc0c6dca9a31ff43fd9ec1bebdc96406c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e85dbb83e246d5fb35782238cc85c5fc0c6dca9a31ff43fd9ec1bebdc96406c","first_computed_at":"2026-05-18T00:43:23.986827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:23.986827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ufYM4bXCm0mN+iJ64Zg5KuDMBAfkdiUi45yg0+3lnk2+13h7nBkydeDzYfr1xn4mM8QXVm3fpEn/VbZSsBBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:23.987478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c56ca8d18a41fccea2c6cf6d626c0971a0db986b7b1097acc78e2b4b322d860a","sha256:f212ef694f8d56d6e41fa6c59f7038b92333f45bd28756b46046e14df4fe047c"],"state_sha256":"0c5b7a589cd1e134a74b723c3728f13ca08ea2dea37529b74a11625478c9b393"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDykvJJp2GWciqLuD2BA0C2tDJChjfyWbSMThXtqKN8in0PisinsKicgDnMD2mYGqj7Rx8a6mbqELVtQ2grYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:13:48.952423Z","bundle_sha256":"ad381fc97df4ba251fb267f1ff5fba1cae1525ed8a10d4d1806d08b135ebdc23"}}