{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Z3UJ7WB2SNPUCW6HCFXBF7GPRP","short_pith_number":"pith:Z3UJ7WB2","canonical_record":{"source":{"id":"1904.02514","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T12:36:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d63d714fca9613ad0ccf5b77eb42fd50fc49491430d68f10bf665227c1bec941","abstract_canon_sha256":"6fd1150f4f7862b14f2fd23ca65224bc3d8bd25a97812687081ebca0b90a18fe"},"schema_version":"1.0"},"canonical_sha256":"cee89fd83a935f415bc7116e12fccf8be048f6792c319f585548d95ae37c15a0","source":{"kind":"arxiv","id":"1904.02514","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02514","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02514v3","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02514","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"Z3UJ7WB2SNPU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z3UJ7WB2SNPUCW6H","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z3UJ7WB2","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Z3UJ7WB2SNPUCW6HCFXBF7GPRP","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02514","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T12:36:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d63d714fca9613ad0ccf5b77eb42fd50fc49491430d68f10bf665227c1bec941","abstract_canon_sha256":"6fd1150f4f7862b14f2fd23ca65224bc3d8bd25a97812687081ebca0b90a18fe"},"schema_version":"1.0"},"canonical_sha256":"cee89fd83a935f415bc7116e12fccf8be048f6792c319f585548d95ae37c15a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:24.453757Z","signature_b64":"OZdiJ3llB9r/s/jcluP7+wYL4BvnFkDbNLyCKOacop4ALneTUBl5KqPb/y5xAo1ZXGMw6O2clJkwbb5h8OD8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cee89fd83a935f415bc7116e12fccf8be048f6792c319f585548d95ae37c15a0","last_reissued_at":"2026-05-17T23:39:24.453052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:24.453052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02514","source_version":3,"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HonEBB++yGnm8sfEu4LGqA4//xaND1pdv4/Ev05XxL5E4zV5tg55Q72eZl1NfiVP2RrEn5T0ITG5KZ+ZatfICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:28:44.471799Z"},"content_sha256":"73304f140dc56734a59ca6288059ac7095ea74268ae94baac06275f0ca2abf2c","schema_version":"1.0","event_id":"sha256:73304f140dc56734a59ca6288059ac7095ea74268ae94baac06275f0ca2abf2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Z3UJ7WB2SNPUCW6HCFXBF7GPRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SMURFF: a High-Performance Framework for Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Arany, Hugo Ceulemans, Imen Chakroun, Jaak Simm, J\\\"org Wegner, Jos\\'e Felipe Golib Dzib, Roel Wuyts, Thanh Le Van, Thomas J. Ashby, Tom Vander Aa, Vladimir Chupakhin, Wilfried Verachtert, Yves Moreau","submitted_at":"2019-04-04T12:36:36Z","abstract_excerpt":"Bayesian Matrix Factorization (BMF) is a powerful technique for recommender systems because it produces good results and is relatively robust against overfitting. Yet BMF is more computationally intensive and thus more challenging to implement for large datasets. In this work we present SMURFF a high-performance feature-rich framework to compose and construct different Bayesian matrix-factorization methods. The framework has been successfully used in to do large scale runs of compound-activity prediction. SMURFF is available as open-source and can be used both on a supercomputer and on a deskt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02514","kind":"arxiv","version":3},"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ne3yISuOk8CqWQck61EleTWcf6RcQlK+oYklhMFg8RENsr3tK71rmowwjW2lejGizqIEMSbtDc0xsyh0RS89Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:28:44.472354Z"},"content_sha256":"d87477d732ff24c070b1381f2833629d32ee54e755f8f7609b56afe1a2f598ec","schema_version":"1.0","event_id":"sha256:d87477d732ff24c070b1381f2833629d32ee54e755f8f7609b56afe1a2f598ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3UJ7WB2SNPUCW6HCFXBF7GPRP/bundle.json","state_url":"https://pith.science/pith/Z3UJ7WB2SNPUCW6HCFXBF7GPRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3UJ7WB2SNPUCW6HCFXBF7GPRP/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-22T04:28:44Z","links":{"resolver":"https://pith.science/pith/Z3UJ7WB2SNPUCW6HCFXBF7GPRP","bundle":"https://pith.science/pith/Z3UJ7WB2SNPUCW6HCFXBF7GPRP/bundle.json","state":"https://pith.science/pith/Z3UJ7WB2SNPUCW6HCFXBF7GPRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3UJ7WB2SNPUCW6HCFXBF7GPRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Z3UJ7WB2SNPUCW6HCFXBF7GPRP","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":"6fd1150f4f7862b14f2fd23ca65224bc3d8bd25a97812687081ebca0b90a18fe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T12:36:36Z","title_canon_sha256":"d63d714fca9613ad0ccf5b77eb42fd50fc49491430d68f10bf665227c1bec941"},"schema_version":"1.0","source":{"id":"1904.02514","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02514","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02514v3","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02514","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"Z3UJ7WB2SNPU","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z3UJ7WB2SNPUCW6H","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z3UJ7WB2","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:d87477d732ff24c070b1381f2833629d32ee54e755f8f7609b56afe1a2f598ec","target":"graph","created_at":"2026-05-17T23:39:24Z","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 technique for recommender systems because it produces good results and is relatively robust against overfitting. Yet BMF is more computationally intensive and thus more challenging to implement for large datasets. In this work we present SMURFF a high-performance feature-rich framework to compose and construct different Bayesian matrix-factorization methods. The framework has been successfully used in to do large scale runs of compound-activity prediction. SMURFF is available as open-source and can be used both on a supercomputer and on a deskt","authors_text":"Adam Arany, Hugo Ceulemans, Imen Chakroun, Jaak Simm, J\\\"org Wegner, Jos\\'e Felipe Golib Dzib, Roel Wuyts, Thanh Le Van, Thomas J. Ashby, Tom Vander Aa, Vladimir Chupakhin, Wilfried Verachtert, Yves Moreau","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T12:36:36Z","title":"SMURFF: a High-Performance Framework for Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02514","kind":"arxiv","version":3},"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:73304f140dc56734a59ca6288059ac7095ea74268ae94baac06275f0ca2abf2c","target":"record","created_at":"2026-05-17T23:39:24Z","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":"6fd1150f4f7862b14f2fd23ca65224bc3d8bd25a97812687081ebca0b90a18fe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T12:36:36Z","title_canon_sha256":"d63d714fca9613ad0ccf5b77eb42fd50fc49491430d68f10bf665227c1bec941"},"schema_version":"1.0","source":{"id":"1904.02514","kind":"arxiv","version":3}},"canonical_sha256":"cee89fd83a935f415bc7116e12fccf8be048f6792c319f585548d95ae37c15a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cee89fd83a935f415bc7116e12fccf8be048f6792c319f585548d95ae37c15a0","first_computed_at":"2026-05-17T23:39:24.453052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:24.453052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OZdiJ3llB9r/s/jcluP7+wYL4BvnFkDbNLyCKOacop4ALneTUBl5KqPb/y5xAo1ZXGMw6O2clJkwbb5h8OD8DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:24.453757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02514","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73304f140dc56734a59ca6288059ac7095ea74268ae94baac06275f0ca2abf2c","sha256:d87477d732ff24c070b1381f2833629d32ee54e755f8f7609b56afe1a2f598ec"],"state_sha256":"1c8b1dad64c0b5127c2cc6293292e33d06a1028053104e1f306a248051176c0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJIvhsTuZkOlMQ4mYkD5XPpRlbpfIzSEhRDp5KUhFj4JszwrwJixj1Q1/F5LCC/3bJOWvuLK2cM5vfHceeOaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:28:44.475709Z","bundle_sha256":"c7ae25d3bae2680969993aa5ad2ab7d59edd4dcba9c12d02154a6ed755c9df87"}}