{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6WGOU45335IDAYIO5UJ65XUCJB","short_pith_number":"pith:6WGOU453","canonical_record":{"source":{"id":"1703.00734","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-02T11:48:24Z","cross_cats_sorted":["cs.DC","cs.LG","cs.NA","stat.ME"],"title_canon_sha256":"0f9db7cd109ce1a010dba9d7c8f4d90cb6c66bf3e724f257ba4ff45c7d426a20","abstract_canon_sha256":"8244168877d0a76769b0c47e9b3e79a6a0ef7c58c63b1893a92bdf2a9c72e234"},"schema_version":"1.0"},"canonical_sha256":"f58cea73bbdf5030610eed13eede82485b799b0b1cba2b171e02b862f7a13462","source":{"kind":"arxiv","id":"1703.00734","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00734","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00734v4","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00734","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"6WGOU45335ID","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6WGOU45335IDAYIO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6WGOU453","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6WGOU45335IDAYIO5UJ65XUCJB","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00734","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-02T11:48:24Z","cross_cats_sorted":["cs.DC","cs.LG","cs.NA","stat.ME"],"title_canon_sha256":"0f9db7cd109ce1a010dba9d7c8f4d90cb6c66bf3e724f257ba4ff45c7d426a20","abstract_canon_sha256":"8244168877d0a76769b0c47e9b3e79a6a0ef7c58c63b1893a92bdf2a9c72e234"},"schema_version":"1.0"},"canonical_sha256":"f58cea73bbdf5030610eed13eede82485b799b0b1cba2b171e02b862f7a13462","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:34.420557Z","signature_b64":"fZJaHX9OunwLBhGtzE39QLuw0apVV0htoV+Ybbu7JK4GLn3kTFbFK9JpcvUlGGLtzKvCQU+MjHBlSpVQL8PpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f58cea73bbdf5030610eed13eede82485b799b0b1cba2b171e02b862f7a13462","last_reissued_at":"2026-05-17T23:52:34.420114Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:34.420114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00734","source_version":4,"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-17T23:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v3uvguEyYAlghFR1RMT4OIJmpJheEDXqdZ4X5UeUE6MPFFZJkSpB85usQ6f3IjhmBUtuTvWp3zaBaEsD1EXPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:14:40.538065Z"},"content_sha256":"5a867bfa869036592777cf7937a1b44eddcb69fbec0e4448ca0fc14d8db8ddb7","schema_version":"1.0","event_id":"sha256:5a867bfa869036592777cf7937a1b44eddcb69fbec0e4448ca0fc14d8db8ddb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6WGOU45335IDAYIO5UJ65XUCJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Bayesian Matrix Factorization with Limited Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.NA","stat.ME"],"primary_cat":"stat.ML","authors_text":"Eemeli Lepp\\\"aaho, Paul Blomstedt, Pekka Parviainen, Samuel Kaski, Xiangju Qin","submitted_at":"2017-03-02T11:48:24Z","abstract_excerpt":"Bayesian matrix factorization (BMF) is a powerful tool for producing low-rank representations of matrices and for predicting missing values and providing confidence intervals. Scaling up the posterior inference for massive-scale matrices is challenging and requires distributing both data and computation over many workers, making communication the main computational bottleneck. Embarrassingly parallel inference would remove the communication needed, by using completely independent computations on different data subsets, but it suffers from the inherent unidentifiability of BMF solutions. We int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00734","kind":"arxiv","version":4},"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-17T23:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeO5F/QU06npgiZCk5PLnQ3UO+l+500TdiiGhhnI4Mo3HQkt2YXbWkMxQW5FSLFkaNziLEyBEe08Wji/SLAwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:14:40.538726Z"},"content_sha256":"adba20942b161f6d0a0fc6db73cb6933d522dca548ba9973750d2d93d9c0ef23","schema_version":"1.0","event_id":"sha256:adba20942b161f6d0a0fc6db73cb6933d522dca548ba9973750d2d93d9c0ef23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WGOU45335IDAYIO5UJ65XUCJB/bundle.json","state_url":"https://pith.science/pith/6WGOU45335IDAYIO5UJ65XUCJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WGOU45335IDAYIO5UJ65XUCJB/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-31T07:14:40Z","links":{"resolver":"https://pith.science/pith/6WGOU45335IDAYIO5UJ65XUCJB","bundle":"https://pith.science/pith/6WGOU45335IDAYIO5UJ65XUCJB/bundle.json","state":"https://pith.science/pith/6WGOU45335IDAYIO5UJ65XUCJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WGOU45335IDAYIO5UJ65XUCJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6WGOU45335IDAYIO5UJ65XUCJB","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":"8244168877d0a76769b0c47e9b3e79a6a0ef7c58c63b1893a92bdf2a9c72e234","cross_cats_sorted":["cs.DC","cs.LG","cs.NA","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-02T11:48:24Z","title_canon_sha256":"0f9db7cd109ce1a010dba9d7c8f4d90cb6c66bf3e724f257ba4ff45c7d426a20"},"schema_version":"1.0","source":{"id":"1703.00734","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00734","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00734v4","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00734","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"6WGOU45335ID","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6WGOU45335IDAYIO","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6WGOU453","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:adba20942b161f6d0a0fc6db73cb6933d522dca548ba9973750d2d93d9c0ef23","target":"graph","created_at":"2026-05-17T23:52:34Z","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":"Bayesian matrix factorization (BMF) is a powerful tool for producing low-rank representations of matrices and for predicting missing values and providing confidence intervals. Scaling up the posterior inference for massive-scale matrices is challenging and requires distributing both data and computation over many workers, making communication the main computational bottleneck. Embarrassingly parallel inference would remove the communication needed, by using completely independent computations on different data subsets, but it suffers from the inherent unidentifiability of BMF solutions. We int","authors_text":"Eemeli Lepp\\\"aaho, Paul Blomstedt, Pekka Parviainen, Samuel Kaski, Xiangju Qin","cross_cats":["cs.DC","cs.LG","cs.NA","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-02T11:48:24Z","title":"Distributed Bayesian Matrix Factorization with Limited Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00734","kind":"arxiv","version":4},"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:5a867bfa869036592777cf7937a1b44eddcb69fbec0e4448ca0fc14d8db8ddb7","target":"record","created_at":"2026-05-17T23:52:34Z","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":"8244168877d0a76769b0c47e9b3e79a6a0ef7c58c63b1893a92bdf2a9c72e234","cross_cats_sorted":["cs.DC","cs.LG","cs.NA","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-02T11:48:24Z","title_canon_sha256":"0f9db7cd109ce1a010dba9d7c8f4d90cb6c66bf3e724f257ba4ff45c7d426a20"},"schema_version":"1.0","source":{"id":"1703.00734","kind":"arxiv","version":4}},"canonical_sha256":"f58cea73bbdf5030610eed13eede82485b799b0b1cba2b171e02b862f7a13462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f58cea73bbdf5030610eed13eede82485b799b0b1cba2b171e02b862f7a13462","first_computed_at":"2026-05-17T23:52:34.420114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:34.420114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fZJaHX9OunwLBhGtzE39QLuw0apVV0htoV+Ybbu7JK4GLn3kTFbFK9JpcvUlGGLtzKvCQU+MjHBlSpVQL8PpAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:34.420557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00734","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a867bfa869036592777cf7937a1b44eddcb69fbec0e4448ca0fc14d8db8ddb7","sha256:adba20942b161f6d0a0fc6db73cb6933d522dca548ba9973750d2d93d9c0ef23"],"state_sha256":"170c1435731577606311bad897f212cb111ff2163d779a744886edc8f0961438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQt5AHThbJEYh4D/gIAzm7UtdzCj8oBzLX6XoTj0taJ/8t/bcQaozX5cVq7NvyDdYqePzGiiDMwTgwMXUP21AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:14:40.541304Z","bundle_sha256":"2714978cca0287e2c448cff084339fc131fa96b8d00e50b2d63d63bf332d99ac"}}