{"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/criteo","name":"Criteo","full_name":"Display Advertising Challenge","description_markdown":"**Criteo** contains 7 days of click-through data, which is widely used for CTR prediction benchmarking. There are 26 anonymous categorical fields and 13 continuous fields in Criteo dataset.\n\nSource: [AMER: Automatic Behavior Modeling and Interaction Exploration in Recommender System](https://arxiv.org/abs/2006.05933)\nImage Source: [https://www.kaggle.com/c/criteo-display-ad-challenge](https://www.kaggle.com/c/criteo-display-ad-challenge)","description_withheld":null,"homepage":"https://labs.criteo.com/2013/12/download-terabyte-click-logs/","introduced_date":null,"introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[],"tasks":[{"name":"Click-Through Rate Prediction","url":"/task/click-through-rate-prediction","datasets_with_task":"/datasets/task/click-through-rate-prediction"}],"languages":[],"variants":["Criteo"],"data_loaders":[{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/criteo","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/alibaba/easyrec","url":"https://github.com/alibaba/easyrec","frameworks":[]}],"num_papers_in_archive":46,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset_variant":"Criteo","rows":39,"metrics":["AUC","Log Loss"],"first_row_in_archive_order":{"model":"QNN-α","paper":"/paper/revisiting-feature-interactions-from-the","metrics":{"AUC":"0.8163","Log Loss":"0.4358"},"code_links":[{"title":"salmon1802/QNN","url":"https://github.com/salmon1802/QNN"}]},"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":36,"of":36,"counts":{"papers_with_a_benchmark_row":36,"with_a_code_link":32,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":36,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":11,"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/revisiting-feature-interactions-from-the","slug":"revisiting-feature-interactions-from-the","title":"Revisiting Feature Interactions from the Perspective of Quadratic Neural Networks for Click-through Rate Prediction","date":"2025-05-23","arxiv_id":"2505.17999","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dcnv3-towards-next-generation-deep-cross","slug":"dcnv3-towards-next-generation-deep-cross","title":"FCN: Fusing Exponential and Linear Cross Network for Click-Through Rate Prediction","date":"2024-07-18","arxiv_id":"2407.13349","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/tf4ctr-twin-focus-framework-for-ctr","slug":"tf4ctr-twin-focus-framework-for-ctr","title":"TF4CTR: Twin Focus Framework for CTR Prediction via Adaptive Sample Differentiation","date":"2024-05-06","arxiv_id":"2405.03167","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cetn-contrast-enhanced-through-network-for","slug":"cetn-contrast-enhanced-through-network-for","title":"CETN: Contrast-enhanced Through Network for CTR Prediction","date":"2023-12-15","arxiv_id":"2312.09715","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-deeper-lighter-and-interpretable-1","slug":"towards-deeper-lighter-and-interpretable-1","title":"Towards Deeper, Lighter and Interpretable Cross Network for CTR Prediction","date":"2023-11-08","arxiv_id":"2311.04635","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":5,"official":{"repos":["anonctr/GDCN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-deeper-lighter-and-interpretable-1#ran","syntology_url":"https://syntology.ai/paper/2311.04635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04635"}}}},{"paper":"/paper/stec-see-through-transformer-based-encoder","slug":"stec-see-through-transformer-based-encoder","title":"STEC: See-Through Transformer-based Encoder for CTR Prediction","date":"2023-08-29","arxiv_id":"2308.15033","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/mmbattn-max-mean-and-bit-wise-attention-for","slug":"mmbattn-max-mean-and-bit-wise-attention-for","title":"MMBAttn: Max-Mean and Bit-wise Attention for CTR Prediction","date":"2023-08-25","arxiv_id":"2308.13187","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/weighted-multi-level-feature-factorization","slug":"weighted-multi-level-feature-factorization","title":"Weighted Multi-Level Feature Factorization for App ads CTR and installation prediction","date":"2023-08-03","arxiv_id":"2308.02568","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cognitive-evolutionary-search-to-select","slug":"cognitive-evolutionary-search-to-select","title":"Cognitive Evolutionary Search to Select Feature Interactions for Click-Through Rate Prediction","date":"2023-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/finalmlp-an-enhanced-two-stream-mlp-model-for-1","slug":"finalmlp-an-enhanced-two-stream-mlp-model-for-1","title":"FinalMLP: An Enhanced Two-Stream MLP Model for CTR Prediction","date":"2023-04-03","arxiv_id":"2304.00902","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":13,"samples_constructed":4,"samples_ran_checked":8,"samples_ran_instrument_failed":5,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["reczoo/RecZoo"],"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/finalmlp-an-enhanced-two-stream-mlp-model-for-1#ran","syntology_url":"https://syntology.ai/paper/2304.00902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00902"}}}},{"paper":"/paper/optimizing-feature-set-for-click-through-rate","slug":"optimizing-feature-set-for-click-through-rate","title":"Optimizing Feature Set for Click-Through Rate Prediction","date":"2023-01-26","arxiv_id":"2301.10909","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":1,"official":{"repos":["fuyuanlyu/optfs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimizing-feature-set-for-click-through-rate#ran","syntology_url":"https://syntology.ai/paper/2301.10909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10909"}}}},{"paper":"/paper/memonet-memorizing-representations-of-all","slug":"memonet-memorizing-representations-of-all","title":"MemoNet: Memorizing All Cross Features' Representations Efficiently via Multi-Hash Codebook Network for CTR Prediction","date":"2022-10-25","arxiv_id":"2211.01334","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/clustering-embedding-tables-without-first","slug":"clustering-embedding-tables-without-first","title":"Clustering the Sketch: A Novel Approach to Embedding Table Compression","date":"2022-10-12","arxiv_id":"2210.05974","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fibinet-improving-fibinet-by-greatly-reducing","slug":"fibinet-improving-fibinet-by-greatly-reducing","title":"FiBiNet++: Reducing Model Size by Low Rank Feature Interaction Layer for CTR Prediction","date":"2022-09-12","arxiv_id":"2209.05016","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/optembed-learning-optimal-embedding-table-for","slug":"optembed-learning-optimal-embedding-table-for","title":"OptEmbed: Learning Optimal Embedding Table for Click-through Rate Prediction","date":"2022-08-09","arxiv_id":"2208.04482","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["fuyuanlyu/optembed"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optembed-learning-optimal-embedding-table-for#ran","syntology_url":"https://syntology.ai/paper/2208.04482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04482"}}}},{"paper":"/paper/memorize-factorize-or-be-naive-learning","slug":"memorize-factorize-or-be-naive-learning","title":"Memorize, Factorize, or be Naïve: Learning Optimal Feature Interaction Methods for CTR Prediction","date":"2021-08-03","arxiv_id":"2108.01265","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["fuyuanlyu/OptInter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/memorize-factorize-or-be-naive-learning#ran","syntology_url":"https://syntology.ai/paper/2108.01265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01265"}}}},{"paper":"/paper/contextnet-a-click-through-rate-prediction","slug":"contextnet-a-click-through-rate-prediction","title":"ContextNet: A Click-Through Rate Prediction Framework Using Contextual information to Refine Feature Embedding","date":"2021-07-26","arxiv_id":"2107.12025","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/xcrossnet-feature-structure-oriented-learning","slug":"xcrossnet-feature-structure-oriented-learning","title":"XCrossNet: Feature Structure-Oriented Learning for Click-Through Rate Prediction","date":"2021-04-22","arxiv_id":"2104.10907","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/masknet-introducing-feature-wise","slug":"masknet-introducing-feature-wise","title":"MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Mask","date":"2021-02-09","arxiv_id":"2102.07619","rows_on_this_dataset":1,"code_links":21,"syntology":null},{"paper":"/paper/dcn-m-improved-deep-cross-network-for-feature","slug":"dcn-m-improved-deep-cross-network-for-feature","title":"DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems","date":"2020-08-19","arxiv_id":"2008.13535","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["tensorflow/recommenders"],"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/dcn-m-improved-deep-cross-network-for-feature#ran","syntology_url":"https://syntology.ai/paper/2008.13535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13535"}}}},{"paper":"/paper/gatenet-gating-enhanced-deep-network-for","slug":"gatenet-gating-enhanced-deep-network-for","title":"GateNet: Gating-Enhanced Deep Network for Click-Through Rate Prediction","date":"2020-07-06","arxiv_id":"2007.03519","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/tfnet-multi-semantic-feature-interaction-for","slug":"tfnet-multi-semantic-feature-interaction-for","title":"TFNet: Multi-Semantic Feature Interaction for CTR Prediction","date":"2020-06-29","arxiv_id":"2006.15939","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/correct-normalization-matters-understanding","slug":"correct-normalization-matters-understanding","title":"Correct Normalization Matters: Understanding the Effect of Normalization On Deep Neural Network Models For Click-Through Rate Prediction","date":"2020-06-23","arxiv_id":"2006.12753","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/feature-interaction-based-neural-network-for","slug":"feature-interaction-based-neural-network-for","title":"Feature Interaction based Neural Network for Click-Through Rate Prediction","date":"2020-06-07","arxiv_id":"2006.05312","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/autofis-automatic-feature-interaction","slug":"autofis-automatic-feature-interaction","title":"AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction","date":"2020-03-25","arxiv_id":"2003.11235","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":24,"samples_ran":22,"samples_constructed":0,"samples_ran_checked":21,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["zhuchenxv/AutoFIS"],"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/autofis-automatic-feature-interaction#ran","syntology_url":"https://syntology.ai/paper/2003.11235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11235"}}}},{"paper":"/paper/a-sparse-deep-factorization-machine-for","slug":"a-sparse-deep-factorization-machine-for","title":"DeepLight: Deep Lightweight Feature Interactions for Accelerating CTR Predictions in Ad Serving","date":"2020-02-17","arxiv_id":"2002.06987","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/fi-gnn-modeling-feature-interactions-via","slug":"fi-gnn-modeling-feature-interactions-via","title":"Fi-GNN: Modeling Feature Interactions via Graph Neural Networks for CTR Prediction","date":"2019-10-12","arxiv_id":"1910.05552","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/adaptive-factorization-network-learning","slug":"adaptive-factorization-network-learning","title":"Adaptive Factorization Network: Learning Adaptive-Order Feature Interactions","date":"2019-09-07","arxiv_id":"1909.03276","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["shenweichen/DeepCTR-Torch"],"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":["named_in_paper"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adaptive-factorization-network-learning#ran","syntology_url":"https://syntology.ai/paper/1909.03276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03276"}}}},{"paper":"/paper/fibinet-combining-feature-importance-and","slug":"fibinet-combining-feature-importance-and","title":"FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Prediction","date":"2019-05-23","arxiv_id":"1905.09433","rows_on_this_dataset":1,"code_links":31,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":0,"samples_unverified":14,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fibinet-combining-feature-importance-and#ran","syntology_url":"https://syntology.ai/paper/1905.09433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09433"}}}},{"paper":"/paper/fat-deepffm-field-attentive-deep-field-aware","slug":"fat-deepffm-field-attentive-deep-field-aware","title":"FAT-DeepFFM: Field Attentive Deep Field-aware Factorization Machine","date":"2019-05-15","arxiv_id":"1905.06336","rows_on_this_dataset":1,"code_links":12,"syntology":null},{"paper":"/paper/autoint-automatic-feature-interaction","slug":"autoint-automatic-feature-interaction","title":"AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networks","date":"2018-10-29","arxiv_id":"1810.11921","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["DeepGraphLearning/RecommenderSystems"],"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/autoint-automatic-feature-interaction#ran","syntology_url":"https://syntology.ai/paper/1810.11921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11921"}}}},{"paper":"/paper/xdeepfm-combining-explicit-and-implicit","slug":"xdeepfm-combining-explicit-and-implicit","title":"xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems","date":"2018-03-14","arxiv_id":"1803.05170","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["Leavingseason/xDeepFM"],"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/xdeepfm-combining-explicit-and-implicit#ran","syntology_url":"https://syntology.ai/paper/1803.05170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05170"}}}},{"paper":"/paper/deepfm-a-factorization-machine-based-neural","slug":"deepfm-a-factorization-machine-based-neural","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","date":"2017-03-13","arxiv_id":"1703.04247","rows_on_this_dataset":1,"code_links":23,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":2,"official":{"repos":["xue-pai/FuxiCTR"],"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/deepfm-a-factorization-machine-based-neural#ran","syntology_url":"https://syntology.ai/paper/1703.04247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04247"}}}},{"paper":"/paper/product-based-neural-networks-for-user","slug":"product-based-neural-networks-for-user","title":"Product-based Neural Networks for User Response Prediction","date":"2016-11-01","arxiv_id":"1611.00144","rows_on_this_dataset":3,"code_links":11,"syntology":null},{"paper":"/paper/wide-deep-learning-for-recommender-systems","slug":"wide-deep-learning-for-recommender-systems","title":"Wide & Deep Learning for Recommender Systems","date":"2016-06-24","arxiv_id":"1606.07792","rows_on_this_dataset":1,"code_links":39,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/wide-deep-learning-for-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/1606.07792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07792"}}}},{"paper":"/paper/deep-learning-over-multi-field-categorical","slug":"deep-learning-over-multi-field-categorical","title":"Deep Learning over Multi-field Categorical Data: A Case Study on User Response Prediction","date":"2016-01-11","arxiv_id":"1601.02376","rows_on_this_dataset":1,"code_links":5,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/revisiting-feature-interactions-from-the","slug":"revisiting-feature-interactions-from-the","title":"Revisiting Feature Interactions from the Perspective of Quadratic Neural Networks for Click-through Rate Prediction","date":"2025-05-23","arxiv_id":"2505.17999","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/dcnv3-towards-next-generation-deep-cross","slug":"dcnv3-towards-next-generation-deep-cross","title":"FCN: Fusing Exponential and Linear Cross Network for Click-Through Rate Prediction","date":"2024-07-18","arxiv_id":"2407.13349","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/tf4ctr-twin-focus-framework-for-ctr","slug":"tf4ctr-twin-focus-framework-for-ctr","title":"TF4CTR: Twin Focus Framework for CTR Prediction via Adaptive Sample Differentiation","date":"2024-05-06","arxiv_id":"2405.03167","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cetn-contrast-enhanced-through-network-for","slug":"cetn-contrast-enhanced-through-network-for","title":"CETN: Contrast-enhanced Through Network for CTR Prediction","date":"2023-12-15","arxiv_id":"2312.09715","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-deeper-lighter-and-interpretable-1","slug":"towards-deeper-lighter-and-interpretable-1","title":"Towards Deeper, Lighter and Interpretable Cross Network for CTR Prediction","date":"2023-11-08","arxiv_id":"2311.04635","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":5,"official":{"repos":["anonctr/GDCN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-deeper-lighter-and-interpretable-1#ran","syntology_url":"https://syntology.ai/paper/2311.04635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04635"}}}},{"paper":"/paper/stec-see-through-transformer-based-encoder","slug":"stec-see-through-transformer-based-encoder","title":"STEC: See-Through Transformer-based Encoder for CTR Prediction","date":"2023-08-29","arxiv_id":"2308.15033","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/mmbattn-max-mean-and-bit-wise-attention-for","slug":"mmbattn-max-mean-and-bit-wise-attention-for","title":"MMBAttn: Max-Mean and Bit-wise Attention for CTR Prediction","date":"2023-08-25","arxiv_id":"2308.13187","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/weighted-multi-level-feature-factorization","slug":"weighted-multi-level-feature-factorization","title":"Weighted Multi-Level Feature Factorization for App ads CTR and installation prediction","date":"2023-08-03","arxiv_id":"2308.02568","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cognitive-evolutionary-search-to-select","slug":"cognitive-evolutionary-search-to-select","title":"Cognitive Evolutionary Search to Select Feature Interactions for Click-Through Rate Prediction","date":"2023-08-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/finalmlp-an-enhanced-two-stream-mlp-model-for-1","slug":"finalmlp-an-enhanced-two-stream-mlp-model-for-1","title":"FinalMLP: An Enhanced Two-Stream MLP Model for CTR Prediction","date":"2023-04-03","arxiv_id":"2304.00902","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":13,"samples_constructed":4,"samples_ran_checked":8,"samples_ran_instrument_failed":5,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["reczoo/RecZoo"],"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/finalmlp-an-enhanced-two-stream-mlp-model-for-1#ran","syntology_url":"https://syntology.ai/paper/2304.00902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00902"}}}},{"paper":"/paper/optimizing-feature-set-for-click-through-rate","slug":"optimizing-feature-set-for-click-through-rate","title":"Optimizing Feature Set for Click-Through Rate Prediction","date":"2023-01-26","arxiv_id":"2301.10909","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":1,"official":{"repos":["fuyuanlyu/optfs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimizing-feature-set-for-click-through-rate#ran","syntology_url":"https://syntology.ai/paper/2301.10909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10909"}}}},{"paper":"/paper/memonet-memorizing-representations-of-all","slug":"memonet-memorizing-representations-of-all","title":"MemoNet: Memorizing All Cross Features' Representations Efficiently via Multi-Hash Codebook Network for CTR Prediction","date":"2022-10-25","arxiv_id":"2211.01334","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/clustering-embedding-tables-without-first","slug":"clustering-embedding-tables-without-first","title":"Clustering the Sketch: A Novel Approach to Embedding Table Compression","date":"2022-10-12","arxiv_id":"2210.05974","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/fibinet-improving-fibinet-by-greatly-reducing","slug":"fibinet-improving-fibinet-by-greatly-reducing","title":"FiBiNet++: Reducing Model Size by Low Rank Feature Interaction Layer for CTR Prediction","date":"2022-09-12","arxiv_id":"2209.05016","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/optembed-learning-optimal-embedding-table-for","slug":"optembed-learning-optimal-embedding-table-for","title":"OptEmbed: Learning Optimal Embedding Table for Click-through Rate Prediction","date":"2022-08-09","arxiv_id":"2208.04482","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["fuyuanlyu/optembed"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optembed-learning-optimal-embedding-table-for#ran","syntology_url":"https://syntology.ai/paper/2208.04482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04482"}}}},{"paper":"/paper/memorize-factorize-or-be-naive-learning","slug":"memorize-factorize-or-be-naive-learning","title":"Memorize, Factorize, or be Naïve: Learning Optimal Feature Interaction Methods for CTR Prediction","date":"2021-08-03","arxiv_id":"2108.01265","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["fuyuanlyu/OptInter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/memorize-factorize-or-be-naive-learning#ran","syntology_url":"https://syntology.ai/paper/2108.01265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01265"}}}},{"paper":"/paper/contextnet-a-click-through-rate-prediction","slug":"contextnet-a-click-through-rate-prediction","title":"ContextNet: A Click-Through Rate Prediction Framework Using Contextual information to Refine Feature Embedding","date":"2021-07-26","arxiv_id":"2107.12025","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/xcrossnet-feature-structure-oriented-learning","slug":"xcrossnet-feature-structure-oriented-learning","title":"XCrossNet: Feature Structure-Oriented Learning for Click-Through Rate Prediction","date":"2021-04-22","arxiv_id":"2104.10907","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/masknet-introducing-feature-wise","slug":"masknet-introducing-feature-wise","title":"MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Mask","date":"2021-02-09","arxiv_id":"2102.07619","rows_on_this_dataset":1,"code_links":21,"syntology":null},{"paper":"/paper/dcn-m-improved-deep-cross-network-for-feature","slug":"dcn-m-improved-deep-cross-network-for-feature","title":"DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systems","date":"2020-08-19","arxiv_id":"2008.13535","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":14,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["tensorflow/recommenders"],"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/dcn-m-improved-deep-cross-network-for-feature#ran","syntology_url":"https://syntology.ai/paper/2008.13535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.13535"}}}},{"paper":"/paper/gatenet-gating-enhanced-deep-network-for","slug":"gatenet-gating-enhanced-deep-network-for","title":"GateNet: Gating-Enhanced Deep Network for Click-Through Rate Prediction","date":"2020-07-06","arxiv_id":"2007.03519","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/tfnet-multi-semantic-feature-interaction-for","slug":"tfnet-multi-semantic-feature-interaction-for","title":"TFNet: Multi-Semantic Feature Interaction for CTR Prediction","date":"2020-06-29","arxiv_id":"2006.15939","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/correct-normalization-matters-understanding","slug":"correct-normalization-matters-understanding","title":"Correct Normalization Matters: Understanding the Effect of Normalization On Deep Neural Network Models For Click-Through Rate Prediction","date":"2020-06-23","arxiv_id":"2006.12753","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/feature-interaction-based-neural-network-for","slug":"feature-interaction-based-neural-network-for","title":"Feature Interaction based Neural Network for Click-Through Rate Prediction","date":"2020-06-07","arxiv_id":"2006.05312","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/autofis-automatic-feature-interaction","slug":"autofis-automatic-feature-interaction","title":"AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction","date":"2020-03-25","arxiv_id":"2003.11235","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":24,"samples_ran":22,"samples_constructed":0,"samples_ran_checked":21,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["zhuchenxv/AutoFIS"],"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/autofis-automatic-feature-interaction#ran","syntology_url":"https://syntology.ai/paper/2003.11235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11235"}}}},{"paper":"/paper/a-sparse-deep-factorization-machine-for","slug":"a-sparse-deep-factorization-machine-for","title":"DeepLight: Deep Lightweight Feature Interactions for Accelerating CTR Predictions in Ad Serving","date":"2020-02-17","arxiv_id":"2002.06987","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/fi-gnn-modeling-feature-interactions-via","slug":"fi-gnn-modeling-feature-interactions-via","title":"Fi-GNN: Modeling Feature Interactions via Graph Neural Networks for CTR Prediction","date":"2019-10-12","arxiv_id":"1910.05552","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/adaptive-factorization-network-learning","slug":"adaptive-factorization-network-learning","title":"Adaptive Factorization Network: Learning Adaptive-Order Feature Interactions","date":"2019-09-07","arxiv_id":"1909.03276","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["shenweichen/DeepCTR-Torch"],"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":["named_in_paper"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/adaptive-factorization-network-learning#ran","syntology_url":"https://syntology.ai/paper/1909.03276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.03276"}}}},{"paper":"/paper/fibinet-combining-feature-importance-and","slug":"fibinet-combining-feature-importance-and","title":"FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Prediction","date":"2019-05-23","arxiv_id":"1905.09433","rows_on_this_dataset":1,"code_links":31,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":0,"samples_unverified":14,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fibinet-combining-feature-importance-and#ran","syntology_url":"https://syntology.ai/paper/1905.09433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09433"}}}},{"paper":"/paper/fat-deepffm-field-attentive-deep-field-aware","slug":"fat-deepffm-field-attentive-deep-field-aware","title":"FAT-DeepFFM: Field Attentive Deep Field-aware Factorization Machine","date":"2019-05-15","arxiv_id":"1905.06336","rows_on_this_dataset":1,"code_links":12,"syntology":null},{"paper":"/paper/autoint-automatic-feature-interaction","slug":"autoint-automatic-feature-interaction","title":"AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networks","date":"2018-10-29","arxiv_id":"1810.11921","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["DeepGraphLearning/RecommenderSystems"],"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/autoint-automatic-feature-interaction#ran","syntology_url":"https://syntology.ai/paper/1810.11921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11921"}}}},{"paper":"/paper/xdeepfm-combining-explicit-and-implicit","slug":"xdeepfm-combining-explicit-and-implicit","title":"xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems","date":"2018-03-14","arxiv_id":"1803.05170","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":3,"official":{"repos":["Leavingseason/xDeepFM"],"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/xdeepfm-combining-explicit-and-implicit#ran","syntology_url":"https://syntology.ai/paper/1803.05170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05170"}}}},{"paper":"/paper/deepfm-a-factorization-machine-based-neural","slug":"deepfm-a-factorization-machine-based-neural","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","date":"2017-03-13","arxiv_id":"1703.04247","rows_on_this_dataset":1,"code_links":23,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":2,"official":{"repos":["xue-pai/FuxiCTR"],"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/deepfm-a-factorization-machine-based-neural#ran","syntology_url":"https://syntology.ai/paper/1703.04247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04247"}}}},{"paper":"/paper/product-based-neural-networks-for-user","slug":"product-based-neural-networks-for-user","title":"Product-based Neural Networks for User Response Prediction","date":"2016-11-01","arxiv_id":"1611.00144","rows_on_this_dataset":3,"code_links":11,"syntology":null},{"paper":"/paper/wide-deep-learning-for-recommender-systems","slug":"wide-deep-learning-for-recommender-systems","title":"Wide & Deep Learning for Recommender Systems","date":"2016-06-24","arxiv_id":"1606.07792","rows_on_this_dataset":1,"code_links":39,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/wide-deep-learning-for-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/1606.07792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07792"}}}},{"paper":"/paper/deep-learning-over-multi-field-categorical","slug":"deep-learning-over-multi-field-categorical","title":"Deep Learning over Multi-field Categorical Data: A Case Study on User Response Prediction","date":"2016-01-11","arxiv_id":"1601.02376","rows_on_this_dataset":1,"code_links":5,"syntology":null}],"papers_where_code_ran":11,"papers_where_code_ran_first_page":"/dataset/criteo/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/criteo/papers/ran/1","json":"/dataset/criteo/papers/ran/1.json","rows":11}],"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":13,"samples_harvested":133,"samples_ran":84,"samples_constructed":4,"samples_ran_checked":76,"samples_ran_instrument_failed":8,"samples_unverified":49,"pointer_only_for_licence":20,"papers_with_no_sample_that_ran":2,"papers_with_a_sample_that_ran":11,"papers_with_a_run_with_no_instrument_failure":11,"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/click-through-rate-prediction-on-criteo","since_archive":"/sota/click-through-rate-prediction-on-criteo#since-judged","papers_judged":3,"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":"d25cd75e5b8c35d146ce0cbca5fa7e0fcb2eb206d531f998787d66e2bdadd98d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}