{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VWECKQZALACF7ZFTGID6UJ56VQ","short_pith_number":"pith:VWECKQZA","schema_version":"1.0","canonical_sha256":"ad8825432058045fe4b33207ea27beac3b043f5fa235a12275cd06f7b2d92c02","source":{"kind":"arxiv","id":"1507.06452","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Matrix Factorization with Priors on Unknown Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Amin Mantrach, Nicolas Kourtellis, Robin Devooght","submitted_at":"2015-07-23T11:39:58Z","abstract_excerpt":"Advanced and effective collaborative filtering methods based on explicit feedback assume that unknown ratings do not follow the same model as the observed ones (\\emph{not missing at random}). In this work, we build on this assumption, and introduce a novel dynamic matrix factorization framework that allows to set an explicit prior on unknown values. When new ratings, users, or items enter the system, we can update the factorization in time independent of the size of data (number of users, items and ratings). Hence, we can quickly recommend items even to very recent users. We test our methods o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.06452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-23T11:39:58Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"3d3e1630a04c080446231c30259e24210f0141d672a7337d37a76721b53c0476","abstract_canon_sha256":"e9ec07bc18457b77bb26dd56ac874b9301d99e613d477823ca0fad211cee2036"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:24.929764Z","signature_b64":"0rg1M7RVa1wt/0KVv7DrfNS3tXWOOTQ9GnGRtbKi8VhNUcdvbmPvMP8J8AT8lPMszxB1khSmzSr+rgrIoF4oDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad8825432058045fe4b33207ea27beac3b043f5fa235a12275cd06f7b2d92c02","last_reissued_at":"2026-05-18T01:36:24.929308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:24.929308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Matrix Factorization with Priors on Unknown Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Amin Mantrach, Nicolas Kourtellis, Robin Devooght","submitted_at":"2015-07-23T11:39:58Z","abstract_excerpt":"Advanced and effective collaborative filtering methods based on explicit feedback assume that unknown ratings do not follow the same model as the observed ones (\\emph{not missing at random}). In this work, we build on this assumption, and introduce a novel dynamic matrix factorization framework that allows to set an explicit prior on unknown values. When new ratings, users, or items enter the system, we can update the factorization in time independent of the size of data (number of users, items and ratings). Hence, we can quickly recommend items even to very recent users. We test our methods o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06452","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.06452","created_at":"2026-05-18T01:36:24.929394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06452v1","created_at":"2026-05-18T01:36:24.929394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06452","created_at":"2026-05-18T01:36:24.929394+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWECKQZALACF","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWECKQZALACF7ZFT","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWECKQZA","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ","json":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ.json","graph_json":"https://pith.science/api/pith-number/VWECKQZALACF7ZFTGID6UJ56VQ/graph.json","events_json":"https://pith.science/api/pith-number/VWECKQZALACF7ZFTGID6UJ56VQ/events.json","paper":"https://pith.science/paper/VWECKQZA"},"agent_actions":{"view_html":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ","download_json":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ.json","view_paper":"https://pith.science/paper/VWECKQZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06452&json=true","fetch_graph":"https://pith.science/api/pith-number/VWECKQZALACF7ZFTGID6UJ56VQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VWECKQZALACF7ZFTGID6UJ56VQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ/action/storage_attestation","attest_author":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ/action/author_attestation","sign_citation":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ/action/citation_signature","submit_replication":"https://pith.science/pith/VWECKQZALACF7ZFTGID6UJ56VQ/action/replication_record"}},"created_at":"2026-05-18T01:36:24.929394+00:00","updated_at":"2026-05-18T01:36:24.929394+00:00"}