{"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/yelp2018","name":"Yelp2018","full_name":"Yelp2018","description_markdown":"The Yelp2018 dataset is adopted from the 2018 edition of the yelp challenge. Wherein local businesses like restaurants and bars are viewed as items. We use the same 10-core setting in order to ensure data quality.","description_withheld":null,"homepage":"","introduced_date":"2019-05-20","introduced_date_note":null,"introduced_by":{"paper":"/paper/neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","first_author":"Xiang Wang","url":null},"license":null,"modalities":[],"tasks":[{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Recommendation Systems","url":"/task/recommendation-systems","datasets_with_task":"/datasets/task/recommendation-systems"},{"name":"Collaborative Filtering","url":"/task/collaborative-filtering","datasets_with_task":"/datasets/task/collaborative-filtering"},{"name":"Unsupervised Text Style Transfer","url":"/task/unsupervised-text-style-transfer","datasets_with_task":"/datasets/task/unsupervised-text-style-transfer"}],"languages":[],"variants":["Yelp2018"],"data_loaders":[{"repo":"https://github.com/MRahimii/graph-recommender-system","url":"https://github.com/MRahimii/graph-recommender-system","frameworks":["pytorch"]}],"num_papers_in_archive":125,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/recommendation-systems-on-yelp2018","task":"Recommendation Systems","dataset_variant":"Yelp2018","rows":11,"metrics":["NDCG@20","Recall@20","HR@10","HR@100","PSP@10","nDCG@10","nDCG@100"],"first_row_in_archive_order":{"model":"NESCL","paper":"/paper/neighborhood-enhanced-supervised-contrastive","metrics":{"NDCG@20":"0.0611","Recall@20":"0.0743"},"code_links":[{"title":"PeiJieSun/NESCL","url":"https://github.com/PeiJieSun/NESCL"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/collaborative-filtering-on-yelp2018","task":"Collaborative Filtering","dataset_variant":"Yelp2018","rows":9,"metrics":["NDCG@20","Recall@20"],"first_row_in_archive_order":{"model":"NESCL","paper":"/paper/neighborhood-enhanced-supervised-contrastive","metrics":{"NDCG@20":"0.0611","Recall@20":"0.0743"},"code_links":[{"title":"PeiJieSun/NESCL","url":"https://github.com/PeiJieSun/NESCL"}]},"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":12,"of":12,"counts":{"papers_with_a_benchmark_row":12,"with_a_code_link":12,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":12,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":6,"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/why-is-normalization-necessary-for-linear","slug":"why-is-normalization-necessary-for-linear","title":"Why is Normalization Necessary for Linear Recommenders?","date":"2025-04-08","arxiv_id":"2504.05805","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/svd-ae-simple-autoencoders-for-collaborative","slug":"svd-ae-simple-autoencoders-for-collaborative","title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","date":"2024-05-08","arxiv_id":"2405.04746","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["jeongwhanchoi/svd-ae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["named_in_paper","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/svd-ae-simple-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/2405.04746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04746"}}}},{"paper":"/paper/turbo-cf-matrix-decomposition-free-graph","slug":"turbo-cf-matrix-decomposition-free-graph","title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","date":"2024-04-22","arxiv_id":"2404.14243","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jindeok/turbo-cf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/turbo-cf-matrix-decomposition-free-graph#ran","syntology_url":"https://syntology.ai/paper/2404.14243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14243"}}}},{"paper":"/paper/neighborhood-enhanced-supervised-contrastive","slug":"neighborhood-enhanced-supervised-contrastive","title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","date":"2024-02-18","arxiv_id":"2402.11523","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neighborhood-enhanced-supervised-contrastive#ran","syntology_url":"https://syntology.ai/paper/2402.11523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11523"}}}},{"paper":"/paper/perturbation-recovery-method-for","slug":"perturbation-recovery-method-for","title":"Blurring-Sharpening Process Models for Collaborative Filtering","date":"2022-11-17","arxiv_id":"2211.09324","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["jeongwhanchoi/bspm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/perturbation-recovery-method-for#ran","syntology_url":"https://syntology.ai/paper/2211.09324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09324"}}}},{"paper":"/paper/sapling-similarity-outperforms-other-local","slug":"sapling-similarity-outperforms-other-local","title":"Sapling Similarity: a performing and interpretable memory-based tool for recommendation","date":"2022-10-13","arxiv_id":"2210.07039","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mgdcf-distance-learning-via-markov-graph","slug":"mgdcf-distance-learning-via-markov-graph","title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","date":"2022-04-05","arxiv_id":"2204.02338","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/ultragcn-ultra-simplification-of-graph","slug":"ultragcn-ultra-simplification-of-graph","title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","date":"2021-10-28","arxiv_id":"2110.15114","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/simplex-a-simple-and-strong-baseline-for","slug":"simplex-a-simple-and-strong-baseline-for","title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","date":"2021-09-26","arxiv_id":"2109.12613","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jeongwhanchoi/lt-ocf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lt-ocf-learnable-time-ode-based-collaborative#ran","syntology_url":"https://syntology.ai/paper/2108.06208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06208"}}}},{"paper":"/paper/self-supervised-graph-learning-for","slug":"self-supervised-graph-learning-for","title":"Self-supervised Graph Learning for Recommendation","date":"2020-10-21","arxiv_id":"2010.10783","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","rows_on_this_dataset":2,"code_links":18,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lightgcn-simplifying-and-powering-graph#ran","syntology_url":"https://syntology.ai/paper/2002.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02126"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/why-is-normalization-necessary-for-linear","slug":"why-is-normalization-necessary-for-linear","title":"Why is Normalization Necessary for Linear Recommenders?","date":"2025-04-08","arxiv_id":"2504.05805","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/svd-ae-simple-autoencoders-for-collaborative","slug":"svd-ae-simple-autoencoders-for-collaborative","title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","date":"2024-05-08","arxiv_id":"2405.04746","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["jeongwhanchoi/svd-ae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["named_in_paper","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/svd-ae-simple-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/2405.04746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04746"}}}},{"paper":"/paper/turbo-cf-matrix-decomposition-free-graph","slug":"turbo-cf-matrix-decomposition-free-graph","title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","date":"2024-04-22","arxiv_id":"2404.14243","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["jindeok/turbo-cf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/turbo-cf-matrix-decomposition-free-graph#ran","syntology_url":"https://syntology.ai/paper/2404.14243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14243"}}}},{"paper":"/paper/neighborhood-enhanced-supervised-contrastive","slug":"neighborhood-enhanced-supervised-contrastive","title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","date":"2024-02-18","arxiv_id":"2402.11523","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neighborhood-enhanced-supervised-contrastive#ran","syntology_url":"https://syntology.ai/paper/2402.11523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11523"}}}},{"paper":"/paper/perturbation-recovery-method-for","slug":"perturbation-recovery-method-for","title":"Blurring-Sharpening Process Models for Collaborative Filtering","date":"2022-11-17","arxiv_id":"2211.09324","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["jeongwhanchoi/bspm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/perturbation-recovery-method-for#ran","syntology_url":"https://syntology.ai/paper/2211.09324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09324"}}}},{"paper":"/paper/sapling-similarity-outperforms-other-local","slug":"sapling-similarity-outperforms-other-local","title":"Sapling Similarity: a performing and interpretable memory-based tool for recommendation","date":"2022-10-13","arxiv_id":"2210.07039","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mgdcf-distance-learning-via-markov-graph","slug":"mgdcf-distance-learning-via-markov-graph","title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","date":"2022-04-05","arxiv_id":"2204.02338","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/ultragcn-ultra-simplification-of-graph","slug":"ultragcn-ultra-simplification-of-graph","title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","date":"2021-10-28","arxiv_id":"2110.15114","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/simplex-a-simple-and-strong-baseline-for","slug":"simplex-a-simple-and-strong-baseline-for","title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","date":"2021-09-26","arxiv_id":"2109.12613","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jeongwhanchoi/lt-ocf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lt-ocf-learnable-time-ode-based-collaborative#ran","syntology_url":"https://syntology.ai/paper/2108.06208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06208"}}}},{"paper":"/paper/self-supervised-graph-learning-for","slug":"self-supervised-graph-learning-for","title":"Self-supervised Graph Learning for Recommendation","date":"2020-10-21","arxiv_id":"2010.10783","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","rows_on_this_dataset":2,"code_links":18,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lightgcn-simplifying-and-powering-graph#ran","syntology_url":"https://syntology.ai/paper/2002.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02126"}}}}],"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/dataset/yelp2018/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/yelp2018/papers/ran/1","json":"/dataset/yelp2018/papers/ran/1.json","rows":6}],"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":6,"samples_harvested":21,"samples_ran":17,"samples_constructed":1,"samples_ran_checked":13,"samples_ran_instrument_failed":4,"samples_unverified":4,"pointer_only_for_licence":3,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":6,"papers_with_a_run_with_no_instrument_failure":6,"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":3,"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/recommendation-systems-on-yelp2018","since_archive":"/sota/recommendation-systems-on-yelp2018#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/collaborative-filtering-on-yelp2018","since_archive":"/sota/collaborative-filtering-on-yelp2018#since-judged","papers_judged":2,"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":"2c31839f5a2d805aab9b6964806033a0f2093a28fddddb0447f13d8d761967b1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}