{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/netflix-prize","name":"Netflix Prize","full_name":"Netflix Prize","description_markdown":"**Netflix Prize** consists of about 100,000,000 ratings for 17,770 movies given by 480,189 users. Each rating in the training dataset consists of four entries: user, movie, date of grade, grade. Users and movies are represented with integer IDs, while ratings range from 1 to 5.\r\n\r\nSource: [The Netflix Prize](https://www.cs.uic.edu/~liub/KDD-cup-2007/proceedings/The-Netflix-Prize-Bennett.pdf)\r\nImage Source: [https://www.netflixprize.com/](https://www.netflixprize.com/)","description_withheld":null,"homepage":"https://www.netflixprize.com/","introduced_date":null,"introduced_date_note":null,"introduced_by":{"paper":null,"title":"The netflix prize","first_author":null,"url":"http://brettb.net/project/papers/2007%20The%20Netflix%20Prize.pdf"},"license":{"name":"Custom","url":"https://www.netflixprize.com/faq.html"},"modalities":[{"name":"Tabular","url":"/datasets/modality/tabular"}],"tasks":[{"name":"Recommendation Systems","url":"/task/recommendation-systems","datasets_with_task":"/datasets/task/recommendation-systems"},{"name":"Fairness","url":"/task/fairness","datasets_with_task":"/datasets/task/fairness"},{"name":"Matrix Completion","url":"/task/matrix-completion","datasets_with_task":"/datasets/task/matrix-completion"}],"languages":[{"name":"Chinese","url":"/datasets/language/chinese"}],"variants":["Netflix","Netflix Prize"],"data_loaders":[],"num_papers_in_archive":370,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/collaborative-filtering-on-netflix","task":"Recommendation Systems","dataset_variant":"Netflix","rows":10,"metrics":["nDCG@100","nDCG@10","Recall@20","Recall@50","AUC","PSP@10","Recall@10","mAP@10","Recall@100"],"first_row_in_archive_order":{"model":"H+Vamp Gated","paper":"/paper/enhancing-vaes-for-collaborative-filtering","metrics":{"Recall@20":"0.37678","Recall@50":"0.46252","nDCG@100":"0.40861"},"code_links":[{"title":"psywaves/EVCF","url":"https://github.com/psywaves/EVCF"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":9,"of":9,"counts":{"papers_with_a_benchmark_row":9,"with_a_code_link":9,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/infinite-recommendation-networks-a-data","slug":"infinite-recommendation-networks-a-data","title":"Infinite Recommendation Networks: A Data-Centric Approach","date":"2022-06-03","arxiv_id":"2206.02626","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["noveens/distill_cf","noveens/infinite_ae_cf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/infinite-recommendation-networks-a-data#ran","syntology_url":"https://syntology.ai/paper/2206.02626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02626"}}}},{"paper":"/paper/recvae-a-new-variational-autoencoder-for-top","slug":"recvae-a-new-variational-autoencoder-for-top","title":"RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback","date":"2019-12-24","arxiv_id":"1912.11160","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ilya-shenbin/RecVAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recvae-a-new-variational-autoencoder-for-top#ran","syntology_url":"https://syntology.ai/paper/1912.11160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11160"}}}},{"paper":"/paper/enhancing-vaes-for-collaborative-filtering","slug":"enhancing-vaes-for-collaborative-filtering","title":"Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms","date":"2019-11-03","arxiv_id":"1911.00936","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-amortized-ranking-critical-training","slug":"towards-amortized-ranking-critical-training","title":"Towards Amortized Ranking-Critical Training for Collaborative Filtering","date":"2019-06-10","arxiv_id":"1906.04281","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/190503375","slug":"190503375","title":"Embarrassingly Shallow Autoencoders for Sparse Data","date":"2019-05-08","arxiv_id":"1905.03375","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}}}},{"paper":"/paper/collaborative-similarity-embedding-for","slug":"collaborative-similarity-embedding-for","title":"Collaborative Similarity Embedding for Recommender Systems","date":"2019-02-17","arxiv_id":"1902.06188","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/variational-autoencoders-for-collaborative","slug":"variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":"1802.05814","rows_on_this_dataset":2,"code_links":18,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":21,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":2,"samples_unverified":7,"pointer_only_for_licence":1,"official":{"repos":["dawenl/vae_cf"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/variational-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/1802.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05814"}}}},{"paper":"/paper/latent-relational-metric-learning-via-memory","slug":"latent-relational-metric-learning-via-memory","title":"Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking","date":"2017-07-17","arxiv_id":"1707.05176","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/collaborative-metric-learning","slug":"collaborative-metric-learning","title":"Collaborative Metric Learning","date":"2017-04-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/infinite-recommendation-networks-a-data","slug":"infinite-recommendation-networks-a-data","title":"Infinite Recommendation Networks: A Data-Centric Approach","date":"2022-06-03","arxiv_id":"2206.02626","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["noveens/distill_cf","noveens/infinite_ae_cf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/infinite-recommendation-networks-a-data#ran","syntology_url":"https://syntology.ai/paper/2206.02626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02626"}}}},{"paper":"/paper/recvae-a-new-variational-autoencoder-for-top","slug":"recvae-a-new-variational-autoencoder-for-top","title":"RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback","date":"2019-12-24","arxiv_id":"1912.11160","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ilya-shenbin/RecVAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recvae-a-new-variational-autoencoder-for-top#ran","syntology_url":"https://syntology.ai/paper/1912.11160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11160"}}}},{"paper":"/paper/enhancing-vaes-for-collaborative-filtering","slug":"enhancing-vaes-for-collaborative-filtering","title":"Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms","date":"2019-11-03","arxiv_id":"1911.00936","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-amortized-ranking-critical-training","slug":"towards-amortized-ranking-critical-training","title":"Towards Amortized Ranking-Critical Training for Collaborative Filtering","date":"2019-06-10","arxiv_id":"1906.04281","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/190503375","slug":"190503375","title":"Embarrassingly Shallow Autoencoders for Sparse Data","date":"2019-05-08","arxiv_id":"1905.03375","rows_on_this_dataset":1,"code_links":9,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}}}},{"paper":"/paper/collaborative-similarity-embedding-for","slug":"collaborative-similarity-embedding-for","title":"Collaborative Similarity Embedding for Recommender Systems","date":"2019-02-17","arxiv_id":"1902.06188","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/variational-autoencoders-for-collaborative","slug":"variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":"1802.05814","rows_on_this_dataset":2,"code_links":18,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":21,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":2,"samples_unverified":7,"pointer_only_for_licence":1,"official":{"repos":["dawenl/vae_cf"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/variational-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/1802.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05814"}}}},{"paper":"/paper/latent-relational-metric-learning-via-memory","slug":"latent-relational-metric-learning-via-memory","title":"Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking","date":"2017-07-17","arxiv_id":"1707.05176","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/collaborative-metric-learning","slug":"collaborative-metric-learning","title":"Collaborative Metric Learning","date":"2017-04-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null}],"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/dataset/netflix-prize/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/netflix-prize/papers/ran/1","json":"/dataset/netflix-prize/papers/ran/1.json","rows":4}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":4,"samples_harvested":44,"samples_ran":31,"samples_constructed":0,"samples_ran_checked":25,"samples_ran_instrument_failed":6,"samples_unverified":13,"pointer_only_for_licence":1,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":4,"papers_with_a_run_with_no_instrument_failure":4,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/collaborative-filtering-on-netflix","since_archive":"/sota/collaborative-filtering-on-netflix#since-judged","papers_judged":1,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"506c9255fbfbed9ef2ac8336e9a9e77319634afb25e7b4f42c7199b051cfadf3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}