{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OTB5WCWXXSVKAN4KR5KHLYOUDD","short_pith_number":"pith:OTB5WCWX","canonical_record":{"source":{"id":"1212.0763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-03T13:00:27Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"0a060603d20820253d84cf0f0bafd7a1f42b466e19243f4b1063578463804a17","abstract_canon_sha256":"e0a8a9e78874b909819f428ad65e034d20bf28fa79c0c4204278a87693ce0562"},"schema_version":"1.0"},"canonical_sha256":"74c3db0ad7bcaaa0378a8f5475e1d418df83f3eb333b6a4d3055f116df62dddd","source":{"kind":"arxiv","id":"1212.0763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0763","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0763v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0763","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"OTB5WCWXXSVK","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OTB5WCWXXSVKAN4K","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OTB5WCWX","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OTB5WCWXXSVKAN4KR5KHLYOUDD","target":"record","payload":{"canonical_record":{"source":{"id":"1212.0763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-03T13:00:27Z","cross_cats_sorted":["cs.DB","cs.IR"],"title_canon_sha256":"0a060603d20820253d84cf0f0bafd7a1f42b466e19243f4b1063578463804a17","abstract_canon_sha256":"e0a8a9e78874b909819f428ad65e034d20bf28fa79c0c4204278a87693ce0562"},"schema_version":"1.0"},"canonical_sha256":"74c3db0ad7bcaaa0378a8f5475e1d418df83f3eb333b6a4d3055f116df62dddd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:15.300878Z","signature_b64":"Zs1elL7iHZJLl6AZ0yqa0w2+zOXFFhJHC5gdFj12UEyr7/zGgAS4jgIQnUkLD+lVuPkCPPMWhzEsen+/yxWtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74c3db0ad7bcaaa0378a8f5475e1d418df83f3eb333b6a4d3055f116df62dddd","last_reissued_at":"2026-05-18T03:39:15.300060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:15.300060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.0763","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-18T03:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4VLiwn/f/uBk9reB8JagIa/hXOTRp+REKwv0Csv+6VD4ASDZ8DKJyQwdL252lIsU0KSsGQDK/oTRq8IMPGXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:30:41.889256Z"},"content_sha256":"efe891b3a607ce4516b6b3d9c24a46ea4d9d801c8014e6d7b0e15a0e40bc95e8","schema_version":"1.0","event_id":"sha256:efe891b3a607ce4516b6b3d9c24a46ea4d9d801c8014e6d7b0e15a0e40bc95e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OTB5WCWXXSVKAN4KR5KHLYOUDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic recommender system : using cluster-based biases to improve the accuracy of the predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IR"],"primary_cat":"cs.LG","authors_text":"Hubert Naacke, Modou Gueye, Talel Abdessalem","submitted_at":"2012-12-03T13:00:27Z","abstract_excerpt":"It is today accepted that matrix factorization models allow a high quality of rating prediction in recommender systems. However, a major drawback of matrix factorization is its static nature that results in a progressive declining of the accuracy of the predictions after each factorization. This is due to the fact that the new obtained ratings are not taken into account until a new factorization is computed, which can not be done very often because of the high cost of matrix factorization.\n  In this paper, aiming at improving the accuracy of recommender systems, we propose a cluster-based matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0763","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-18T03:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxP5Fq1M3vh57VeqpX6LV9fnQvd6LZR4R8Ju02ph5pc2bOs6A+8x62FHk0f2HHvikB1gJWOZJxAC3X7r7AJ7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:30:41.889617Z"},"content_sha256":"dfe66406eae9e3299b05bdd0158066f084a312f39ac9038c98549ad0dfbe6097","schema_version":"1.0","event_id":"sha256:dfe66406eae9e3299b05bdd0158066f084a312f39ac9038c98549ad0dfbe6097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTB5WCWXXSVKAN4KR5KHLYOUDD/bundle.json","state_url":"https://pith.science/pith/OTB5WCWXXSVKAN4KR5KHLYOUDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTB5WCWXXSVKAN4KR5KHLYOUDD/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-25T12:30:41Z","links":{"resolver":"https://pith.science/pith/OTB5WCWXXSVKAN4KR5KHLYOUDD","bundle":"https://pith.science/pith/OTB5WCWXXSVKAN4KR5KHLYOUDD/bundle.json","state":"https://pith.science/pith/OTB5WCWXXSVKAN4KR5KHLYOUDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTB5WCWXXSVKAN4KR5KHLYOUDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OTB5WCWXXSVKAN4KR5KHLYOUDD","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":"e0a8a9e78874b909819f428ad65e034d20bf28fa79c0c4204278a87693ce0562","cross_cats_sorted":["cs.DB","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-03T13:00:27Z","title_canon_sha256":"0a060603d20820253d84cf0f0bafd7a1f42b466e19243f4b1063578463804a17"},"schema_version":"1.0","source":{"id":"1212.0763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0763","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0763v1","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0763","created_at":"2026-05-18T03:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"OTB5WCWXXSVK","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OTB5WCWXXSVKAN4K","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OTB5WCWX","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:dfe66406eae9e3299b05bdd0158066f084a312f39ac9038c98549ad0dfbe6097","target":"graph","created_at":"2026-05-18T03:39:15Z","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":"It is today accepted that matrix factorization models allow a high quality of rating prediction in recommender systems. However, a major drawback of matrix factorization is its static nature that results in a progressive declining of the accuracy of the predictions after each factorization. This is due to the fact that the new obtained ratings are not taken into account until a new factorization is computed, which can not be done very often because of the high cost of matrix factorization.\n  In this paper, aiming at improving the accuracy of recommender systems, we propose a cluster-based matr","authors_text":"Hubert Naacke, Modou Gueye, Talel Abdessalem","cross_cats":["cs.DB","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-03T13:00:27Z","title":"Dynamic recommender system : using cluster-based biases to improve the accuracy of the predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0763","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:efe891b3a607ce4516b6b3d9c24a46ea4d9d801c8014e6d7b0e15a0e40bc95e8","target":"record","created_at":"2026-05-18T03:39:15Z","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":"e0a8a9e78874b909819f428ad65e034d20bf28fa79c0c4204278a87693ce0562","cross_cats_sorted":["cs.DB","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-03T13:00:27Z","title_canon_sha256":"0a060603d20820253d84cf0f0bafd7a1f42b466e19243f4b1063578463804a17"},"schema_version":"1.0","source":{"id":"1212.0763","kind":"arxiv","version":1}},"canonical_sha256":"74c3db0ad7bcaaa0378a8f5475e1d418df83f3eb333b6a4d3055f116df62dddd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74c3db0ad7bcaaa0378a8f5475e1d418df83f3eb333b6a4d3055f116df62dddd","first_computed_at":"2026-05-18T03:39:15.300060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:15.300060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zs1elL7iHZJLl6AZ0yqa0w2+zOXFFhJHC5gdFj12UEyr7/zGgAS4jgIQnUkLD+lVuPkCPPMWhzEsen+/yxWtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:15.300878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efe891b3a607ce4516b6b3d9c24a46ea4d9d801c8014e6d7b0e15a0e40bc95e8","sha256:dfe66406eae9e3299b05bdd0158066f084a312f39ac9038c98549ad0dfbe6097"],"state_sha256":"c04f9c85504db6a1c0246d2c0dc296ca11548bc00bb570258e08529c7c2c1249"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBR9AU/AkD3DRNV1a+mWYP5R0w6L+OtgE9PMs/xmmnZnoioFJSRX2MlEs7WoRU2ZxLPKkqeR8D6bKtOcwTiyAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:30:41.891575Z","bundle_sha256":"faca80b2f9b8a0d81ea91355d056f27007119618387fd1e0dd8e14531b799dcf"}}