{"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":"/task/recommendation-systems","name":"Recommendation Systems","slug":"recommendation-systems","description_markdown":"### **Recommendation System in AI Research**  \r\n\r\nA **Recommendation System** is a specialized AI-driven model that analyzes user preferences and behaviors to suggest relevant content, products, or services. It is widely used in domains like e-commerce, streaming platforms, social media, and personalized learning.  \r\n\r\nAI research in recommendation systems focuses on:  \r\n- **Collaborative Filtering**: Predicting user preferences based on similar users' choices.  \r\n- **Content-Based Filtering**: Recommending items based on user history and item characteristics.  \r\n- **Hybrid Models**: Combining multiple techniques for better accuracy.  \r\n- **Deep Learning & Transformers**: Using neural networks and self-attention mechanisms for personalized recommendations.  \r\n- **Graph-Based Approaches**: Leveraging knowledge graphs for relationship-aware recommendations.  \r\n\r\nKey challenges include data sparsity, scalability, and bias mitigation. Cutting-edge research explores reinforcement learning, explainability, and privacy-preserving methods to enhance recommendation systems.","categories":[{"name":"Graphs","url":"/area/graphs"},{"name":"Knowledge Base","url":"/area/knowledge-base"},{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":6047,"papers_with_code":1997,"benchmarks":55,"benchmark_tables_in_archive":55,"benchmark_tables_shown":55,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":56,"subtasks":11,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m","slug":"collaborative-filtering-on-movielens-1m","dataset":"MovieLens 1M","dataset_url":"/dataset/movielens","rows_in_archive":31,"metrics":["RMSE","nDCG@10","HR@10","NDCG","Precision","nDCG@100","HR@100","PSP@10","HR@10 (full corpus)","NDCG@10 (full corpus)"],"first_row_in_archive_order":{"model":"GLocal-K","paper_title":"GLocal-K: Global and Local Kernels for Recommender Systems","paper_url":"/paper/glocal-k-global-and-local-kernels-for","paper_date":"2021-08-27","arxiv_id":"2108.12184","code_links":[{"title":"usydnlp/Glocal_K","url":"https://github.com/usydnlp/Glocal_K"},{"title":"fleanend/TorchGlocalK","url":"https://github.com/fleanend/TorchGlocalK"},{"title":"fleanend/NeuralRecommender","url":"https://github.com/fleanend/NeuralRecommender"}],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-movielens-100k","slug":"collaborative-filtering-on-movielens-100k","dataset":"MovieLens 100K","dataset_url":"/dataset/movielens","rows_in_archive":18,"metrics":["RMSE (u1 Splits)","RMSE (Random 90/10 Splits)","RMSE"],"first_row_in_archive_order":{"model":"CDLD-GR (doi: 10.5281/zenodo.15851754)","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-movielens-20m","slug":"collaborative-filtering-on-movielens-20m","dataset":"MovieLens 20M","dataset_url":"/dataset/movielens","rows_in_archive":18,"metrics":["nDCG@10","Recall@10","Recall@20","Recall@50","nDCG@100","Recall@100","HR@10","HR@10 (full corpus)","nDCG@10 (full corpus)","Recall@2"],"first_row_in_archive_order":{"model":"HyperML","paper_title":"HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems","paper_url":"/paper/hyperbolic-recommender-systems","paper_date":"2018-09-05","arxiv_id":"1809.01703","code_links":[],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-movielens-10m","slug":"collaborative-filtering-on-movielens-10m","dataset":"MovieLens 10M","dataset_url":"/dataset/movielens","rows_in_archive":17,"metrics":["RMSE","MAP@15","MAP@30","MAP@5","NDCG@15","NDCG@30","NDCG@5","HR@10","HR@100","PSP@10","nDCG@10","nDCG@100"],"first_row_in_archive_order":{"model":"Bayesian timeSVD++ flipped","paper_title":"On the Difficulty of Evaluating Baselines: A Study on Recommender Systems","paper_url":"/paper/on-the-difficulty-of-evaluating-baselines-a","paper_date":"2019-05-04","arxiv_id":"1905.01395","code_links":[{"title":"srendle/libfm","url":"https://github.com/srendle/libfm"},{"title":"tohtsky/myFM","url":"https://github.com/tohtsky/myFM"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-difficulty-of-evaluating-baselines-a#ran","syntology_url":"https://syntology.ai/paper/1905.01395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01395"}},"official":null}}},{"leaderboard":"/sota/recommendation-systems-on-amazon-book","slug":"recommendation-systems-on-amazon-book","dataset":"Amazon-Book","dataset_url":"/dataset/amazon-book","rows_in_archive":16,"metrics":["nDCG@20","Recall@20","HR@10","NDCG@10","HR@50","NDCG@50"],"first_row_in_archive_order":{"model":"SSCF","paper_title":"Sapling Similarity: a performing and interpretable memory-based tool for recommendation","paper_url":"/paper/sapling-similarity-outperforms-other-local","paper_date":"2022-10-13","arxiv_id":"2210.07039","code_links":[{"title":"giamba95/saplingsimilarity","url":"https://github.com/giamba95/saplingsimilarity"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-gowalla","slug":"recommendation-systems-on-gowalla","dataset":"Gowalla","dataset_url":"/dataset/gowalla","rows_in_archive":13,"metrics":["nDCG@20","Recall@20","HR@10","HR@100","PSP@10","nDCG@10","nDCG@100"],"first_row_in_archive_order":{"model":"ConvNCF","paper_title":"Outer Product-based Neural Collaborative Filtering","paper_url":"/paper/outer-product-based-neural-collaborative","paper_date":"2018-08-12","arxiv_id":"1808.03912","code_links":[{"title":"duxy-me/ConvNCF","url":"https://github.com/duxy-me/ConvNCF"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-yelp2018","slug":"recommendation-systems-on-yelp2018","dataset":"Yelp2018","dataset_url":"/dataset/yelp2018","rows_in_archive":11,"metrics":["NDCG@20","Recall@20","HR@10","HR@100","PSP@10","nDCG@10","nDCG@100"],"first_row_in_archive_order":{"model":"NESCL","paper_title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","paper_url":"/paper/neighborhood-enhanced-supervised-contrastive","paper_date":"2024-02-18","arxiv_id":"2402.11523","code_links":[{"title":"PeiJieSun/NESCL","url":"https://github.com/PeiJieSun/NESCL"}],"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}}},{"leaderboard":"/sota/collaborative-filtering-on-netflix","slug":"collaborative-filtering-on-netflix","dataset":"Netflix","dataset_url":"/dataset/netflix-prize","rows_in_archive":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_title":"Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms","paper_url":"/paper/enhancing-vaes-for-collaborative-filtering","paper_date":"2019-11-03","arxiv_id":"1911.00936","code_links":[{"title":"psywaves/EVCF","url":"https://github.com/psywaves/EVCF"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-douban-monti","slug":"recommendation-systems-on-douban-monti","dataset":"Douban Monti","dataset_url":"/dataset/douban","rows_in_archive":8,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"GLocal-K","paper_title":"GLocal-K: Global and Local Kernels for Recommender Systems","paper_url":"/paper/glocal-k-global-and-local-kernels-for","paper_date":"2021-08-27","arxiv_id":"2108.12184","code_links":[{"title":"usydnlp/Glocal_K","url":"https://github.com/usydnlp/Glocal_K"},{"title":"fleanend/TorchGlocalK","url":"https://github.com/fleanend/TorchGlocalK"},{"title":"fleanend/NeuralRecommender","url":"https://github.com/fleanend/NeuralRecommender"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-redial","slug":"recommendation-systems-on-redial","dataset":"ReDial","dataset_url":"/dataset/redial","rows_in_archive":8,"metrics":["Recall@1","Recall@10","Recall@50"],"first_row_in_archive_order":{"model":"KERL","paper_title":"Knowledge Graphs and Pre-trained Language Models enhanced Representation Learning for Conversational Recommender Systems","paper_url":"/paper/knowledge-graphs-and-pre-trained-language","paper_date":"2023-12-18","arxiv_id":"2312.10967","code_links":[{"title":"icedpanda/KERL","url":"https://github.com/icedpanda/KERL"}],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-douban","slug":"collaborative-filtering-on-douban","dataset":"Douban","dataset_url":"/dataset/douban","rows_in_archive":7,"metrics":["RMSE","NDCG","Recall@20","AUC","HR@10","HR@100","PSP@10","nDCG@10","nDCG@100"],"first_row_in_archive_order":{"model":"I-CFN","paper_title":"Hybrid Recommender System based on Autoencoders","paper_url":"/paper/hybrid-recommender-system-based-on","paper_date":"2016-06-24","arxiv_id":"1606.07659","code_links":[{"title":"fstrub95/Autoencoders_cf","url":"https://github.com/fstrub95/Autoencoders_cf"},{"title":"SJD1882/Big-Data-Recommender-Systems","url":"https://github.com/SJD1882/Big-Data-Recommender-Systems"},{"title":"jowoojun/collaborative_filtering_keras","url":"https://github.com/jowoojun/collaborative_filtering_keras"},{"title":"Recvani/benchmark","url":"https://github.com/Recvani/benchmark"}],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-million-song","slug":"collaborative-filtering-on-million-song","dataset":"Million Song Dataset","dataset_url":"/dataset/msd","rows_in_archive":7,"metrics":["nDCG@100","Recall@50","Recall@20","Recall@100"],"first_row_in_archive_order":{"model":"EASE","paper_title":"Embarrassingly Shallow Autoencoders for Sparse Data","paper_url":"/paper/190503375","paper_date":"2019-05-08","arxiv_id":"1905.03375","code_links":[{"title":"PreferredAI/cornac","url":"https://github.com/PreferredAI/cornac"},{"title":"AmazingDD/daisyRec","url":"https://github.com/AmazingDD/daisyRec"},{"title":"Darel13712/ease_rec","url":"https://github.com/Darel13712/ease_rec"},{"title":"recsys-benchmark/daisyrec-v2.0","url":"https://github.com/recsys-benchmark/daisyrec-v2.0"},{"title":"glami/sansa","url":"https://github.com/glami/sansa"},{"title":"franckjay/TorchEASE","url":"https://github.com/franckjay/TorchEASE"},{"title":"jvbalen/autoencoders_cf","url":"https://github.com/jvbalen/autoencoders_cf"},{"title":"AhmadRK94/NeuEASE","url":"https://github.com/AhmadRK94/NeuEASE"},{"title":"MindSpore-scientific/code-10","url":"https://github.com/MindSpore-scientific/code-10/tree/main/shallow-rnns"}],"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}},"official":null}}},{"leaderboard":"/sota/recommendation-systems-on-flixster-monti","slug":"recommendation-systems-on-flixster-monti","dataset":"Flixster Monti","dataset_url":null,"rows_in_archive":7,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"IGMC","paper_title":"Inductive Matrix Completion Based on Graph Neural Networks","paper_url":"/paper/inductive-graph-pattern-learning-for","paper_date":"2019-04-26","arxiv_id":"1904.12058","code_links":[{"title":"muhanzhang/IGMC","url":"https://github.com/muhanzhang/IGMC"},{"title":"zhoujf620/Motif-based-inductive-GNN-training","url":"https://github.com/zhoujf620/Motif-based-inductive-GNN-training"},{"title":"cheonsol-lee/IGMC_CX","url":"https://github.com/cheonsol-lee/IGMC_CX"}],"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}},"official":{"repos":["muhanzhang/IGMC"],"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"]}}}},{"leaderboard":"/sota/recommendation-systems-on-amazon-beauty","slug":"recommendation-systems-on-amazon-beauty","dataset":"Amazon Beauty","dataset_url":"/dataset/amazon-beauty","rows_in_archive":6,"metrics":["Hit@10","nDCG@10","NDCG"],"first_row_in_archive_order":{"model":"CARCA Abs + Con","paper_title":"Positional encoding is not the same as context: A study on positional encoding for sequential recommendation","paper_url":"/paper/positional-encoding-is-not-the-same-as","paper_date":"2024-05-16","arxiv_id":"2405.10436","code_links":[{"title":"researcher1741/position_encoding_srs","url":"https://github.com/researcher1741/position_encoding_srs"}],"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/positional-encoding-is-not-the-same-as#ran","syntology_url":"https://syntology.ai/paper/2405.10436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.10436"}},"official":{"repos":["researcher1741/position_encoding_srs"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/recommendation-systems-on-amazon-games","slug":"recommendation-systems-on-amazon-games","dataset":"Amazon Games","dataset_url":"/dataset/amazon-review","rows_in_archive":6,"metrics":["Hit@10","nDCG@10","AUC","NDCG"],"first_row_in_archive_order":{"model":"ProxyRCA","paper_title":"Proxy-based Item Representation for Attribute and Context-aware Recommendation","paper_url":"/paper/proxy-based-item-representation-for-attribute","paper_date":"2023-12-11","arxiv_id":"2312.06145","code_links":[{"title":"theeluwin/ProxyRCA","url":"https://github.com/theeluwin/ProxyRCA"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-yahoomusic-monti","slug":"recommendation-systems-on-yahoomusic-monti","dataset":"YahooMusic Monti","dataset_url":null,"rows_in_archive":6,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"MG-GAT","paper_title":"Interpretable Recommender System With Heterogeneous Information: A Geometric Deep Learning Perspective","paper_url":"/paper/interpretable-recommender-system-with","paper_date":"2020-09-20","arxiv_id":null,"code_links":[{"title":"zuirod/mg-gat","url":"https://github.com/zuirod/mg-gat"}],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-flixster","slug":"collaborative-filtering-on-flixster","dataset":"Flixster","dataset_url":null,"rows_in_archive":4,"metrics":["RMSE","Hits@10","Hits@20","nDCG@10","nDCG@20"],"first_row_in_archive_order":{"model":"GRALS","paper_title":"Collaborative Filtering with Graph Information: Consistency and Scalable Methods","paper_url":"/paper/collaborative-filtering-with-graph","paper_date":"2015-12-01","arxiv_id":null,"code_links":[{"title":"rofuyu/exp-grmf-nips15","url":"https://github.com/rofuyu/exp-grmf-nips15"},{"title":"nikrao/GRALS","url":"https://github.com/nikrao/GRALS"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-fashion","slug":"recommendation-systems-on-amazon-fashion","dataset":"Amazon Fashion","dataset_url":"/dataset/amazon-fashion","rows_in_archive":4,"metrics":["HitRatio@ 10 (100 Neg. Samples)","nDCG@10 (100 Neg. Samples)","AUC","nDCG@10 (500 Neg. Samples)","Hit@10","NDCG"],"first_row_in_archive_order":{"model":"ProxyRCA","paper_title":"Proxy-based Item Representation for Attribute and Context-aware Recommendation","paper_url":"/paper/proxy-based-item-representation-for-attribute","paper_date":"2023-12-11","arxiv_id":"2312.06145","code_links":[{"title":"theeluwin/ProxyRCA","url":"https://github.com/theeluwin/ProxyRCA"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-epinions","slug":"recommendation-systems-on-epinions","dataset":"Epinions","dataset_url":"/dataset/epinions","rows_in_archive":4,"metrics":["MAE","RMSE","MAP@20","MRR@20","NDCG@20"],"first_row_in_archive_order":{"model":"DANSER","paper_title":"Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systems","paper_url":"/paper/dual-graph-attention-networks-for-deep-latent","paper_date":"2019-03-25","arxiv_id":"1903.10433","code_links":[{"title":"echo740/DANSER-WWW-19","url":"https://github.com/echo740/DANSER-WWW-19"}],"syntology":null}},{"leaderboard":"/sota/collaborative-filtering-on-yahoomusic","slug":"collaborative-filtering-on-yahoomusic","dataset":"YahooMusic","dataset_url":null,"rows_in_archive":3,"metrics":["RMSE"],"first_row_in_archive_order":{"model":"GRALS","paper_title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","paper_url":"/paper/scalable-probabilistic-matrix-factorization","paper_date":"2019-08-25","arxiv_id":"1908.09393","code_links":[{"title":"strahl2e/GPMF-GBP-AAAI-20","url":"https://github.com/strahl2e/GPMF-GBP-AAAI-20"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-men","slug":"recommendation-systems-on-amazon-men","dataset":"Amazon Men","dataset_url":"/dataset/amazon-men","rows_in_archive":3,"metrics":["Hit@10","nDCG@10","NDCG"],"first_row_in_archive_order":{"model":"CARCA Learnt + Con","paper_title":"Positional encoding is not the same as context: A study on positional encoding for sequential recommendation","paper_url":"/paper/positional-encoding-is-not-the-same-as","paper_date":"2024-05-16","arxiv_id":"2405.10436","code_links":[{"title":"researcher1741/position_encoding_srs","url":"https://github.com/researcher1741/position_encoding_srs"}],"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/positional-encoding-is-not-the-same-as#ran","syntology_url":"https://syntology.ai/paper/2405.10436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.10436"}},"official":{"repos":["researcher1741/position_encoding_srs"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/recommendation-systems-on-lastfm","slug":"recommendation-systems-on-lastfm","dataset":"Last.FM","dataset_url":null,"rows_in_archive":3,"metrics":["HR@10","NDCG@20","Recall@10","Recall@100","Recall@2","Recall@20","Recall@50","nDCG@10"],"first_row_in_archive_order":{"model":"Ekar*","paper_title":"Ekar: An Explainable Method for Knowledge Aware Recommendation","paper_url":"/paper/explainable-knowledge-graph-based","paper_date":"2019-06-22","arxiv_id":"1906.09506","code_links":[{"title":"DeepGraphLearning/RecommenderSystems","url":"https://github.com/DeepGraphLearning/RecommenderSystems"},{"title":"sparsh-ai/RecommenderSystems","url":"https://github.com/sparsh-ai/RecommenderSystems"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-polyvore","slug":"recommendation-systems-on-polyvore","dataset":"Polyvore","dataset_url":"/dataset/polyvore","rows_in_archive":3,"metrics":["AUC","Accuracy"],"first_row_in_archive_order":{"model":"Fashion GAE","paper_title":"Context-Aware Visual Compatibility Prediction","paper_url":"/paper/context-aware-visual-compatibility-prediction","paper_date":"2019-02-10","arxiv_id":"1902.03646","code_links":[{"title":"gcucurull/visual-compatibility","url":"https://github.com/gcucurull/visual-compatibility"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-cds","slug":"recommendation-systems-on-amazon-cds","dataset":"Amazon-CDs","dataset_url":null,"rows_in_archive":2,"metrics":["MAP@20","MRR@20","NDCG@20","Recall@10","nDCG@10"],"first_row_in_archive_order":{"model":"HetroFair","paper_title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","paper_url":"/paper/heterophily-aware-fair-recommendation-using","paper_date":"2024-01-31","arxiv_id":"2402.03365","code_links":[{"title":"nematgh/hetrofair","url":"https://github.com/nematgh/hetrofair"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-product-data","slug":"recommendation-systems-on-amazon-product-data","dataset":"Amazon Product Data","dataset_url":"/dataset/amazon-product-data","rows_in_archive":2,"metrics":["AUC","F1"],"first_row_in_archive_order":{"model":"TLSAN","paper_title":"TLSAN: Time-aware Long- and Short-term Attention Network for Next-item Recommendation","paper_url":"/paper/tlsan-time-aware-long-and-short-term-1","paper_date":"2021-03-16","arxiv_id":"2103.08971","code_links":[{"title":"TsingZ0/TLSAN","url":"https://github.com/TsingZ0/TLSAN"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-book-crossing-1","slug":"recommendation-systems-on-book-crossing-1","dataset":"Book-Crossing","dataset_url":null,"rows_in_archive":2,"metrics":["Hits@10","Hits@20","Recall@10","Recall@100","Recall@2","Recall@50","nDCG@10","nDCG@20"],"first_row_in_archive_order":{"model":"TransCF","paper_title":"Collaborative Translational Metric Learning","paper_url":"/paper/collaborative-translational-metric-learning","paper_date":"2019-06-04","arxiv_id":"1906.01637","code_links":[{"title":"hkuds/recdiff","url":"https://github.com/hkuds/recdiff"},{"title":"pcy1302/TransCF","url":"https://github.com/pcy1302/TransCF"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-dbbook2014","slug":"recommendation-systems-on-dbbook2014","dataset":"DBbook2014","dataset_url":null,"rows_in_archive":2,"metrics":["HR@10","NDCG","nDCG@10"],"first_row_in_archive_order":{"model":"KTUP (soft)","paper_title":"Unifying Knowledge Graph Learning and Recommendation: Towards a Better Understanding of User Preferences","paper_url":"/paper/unifying-knowledge-graph-learning-and","paper_date":"2019-02-17","arxiv_id":"1902.06236","code_links":[{"title":"TaoMiner/joint-kg-recommender","url":"https://github.com/TaoMiner/joint-kg-recommender"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-frappe","slug":"recommendation-systems-on-frappe","dataset":"Frappe","dataset_url":null,"rows_in_archive":2,"metrics":["RMSE","Recall@10","mAP@10"],"first_row_in_archive_order":{"model":"INN","paper_title":"Interaction-aware Factorization Machines for Recommender Systems","paper_url":"/paper/interaction-aware-factorization-machines-for","paper_date":"2019-02-26","arxiv_id":"1902.09757","code_links":[{"title":"cstur4/interaction-aware-factorization-machines","url":"https://github.com/cstur4/interaction-aware-factorization-machines"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-wechat","slug":"recommendation-systems-on-wechat","dataset":"WeChat","dataset_url":"/dataset/wechat","rows_in_archive":2,"metrics":["AUC","P@10"],"first_row_in_archive_order":{"model":"DANSER","paper_title":"Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systems","paper_url":"/paper/dual-graph-attention-networks-for-deep-latent","paper_date":"2019-03-25","arxiv_id":"1903.10433","code_links":[{"title":"echo740/DANSER-WWW-19","url":"https://github.com/echo740/DANSER-WWW-19"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-yelp","slug":"recommendation-systems-on-yelp","dataset":"Yelp","dataset_url":"/dataset/yelp","rows_in_archive":2,"metrics":["NDCG","NDCG@20","Recall@20"],"first_row_in_archive_order":{"model":"DGRec","paper_title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","paper_url":"/paper/session-based-social-recommendation-via","paper_date":"2019-02-25","arxiv_id":"1902.09362","code_links":[{"title":"DeepGraphLearning/RecommenderSystems","url":"https://github.com/DeepGraphLearning/RecommenderSystems"},{"title":"sparsh-ai/RecommenderSystems","url":"https://github.com/sparsh-ai/RecommenderSystems"}],"syntology":{"n":13,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/session-based-social-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/1902.09362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09362"}},"official":{"repos":["DeepGraphLearning/RecommenderSystems"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":12,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/recommendation-systems-on-alibaba-ifashion","slug":"recommendation-systems-on-alibaba-ifashion","dataset":"Alibaba-iFashion","dataset_url":null,"rows_in_archive":1,"metrics":["NDCG@20","Recall@20"],"first_row_in_archive_order":{"model":"HAKG","paper_title":"HAKG: Hierarchy-Aware Knowledge Gated Network for Recommendation","paper_url":"/paper/hakg-hierarchy-aware-knowledge-gated-network","paper_date":"2022-04-11","arxiv_id":"2204.04959","code_links":[{"title":"zealscott/hakg","url":"https://github.com/zealscott/hakg"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-beauty-1","slug":"recommendation-systems-on-amazon-beauty-1","dataset":"Amazon-Beauty","dataset_url":null,"rows_in_archive":1,"metrics":["MAP@20","MRR@20","NDCG@20"],"first_row_in_archive_order":{"model":"HetroFair","paper_title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","paper_url":"/paper/heterophily-aware-fair-recommendation-using","paper_date":"2024-01-31","arxiv_id":"2402.03365","code_links":[{"title":"nematgh/hetrofair","url":"https://github.com/nematgh/hetrofair"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-book-1","slug":"recommendation-systems-on-amazon-book-1","dataset":"Amazon-book","dataset_url":"/dataset/amazon-book","rows_in_archive":1,"metrics":["Recall@20"],"first_row_in_archive_order":{"model":"LT-OCF","paper_title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","paper_url":"/paper/lt-ocf-learnable-time-ode-based-collaborative","paper_date":"2021-08-08","arxiv_id":"2108.06208","code_links":[{"title":"jeongwhanchoi/lt-ocf","url":"https://github.com/jeongwhanchoi/lt-ocf"},{"title":"jeongwhanchoi/LT-OCF-Tutorial","url":"https://github.com/jeongwhanchoi/LT-OCF-Tutorial"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}}},{"leaderboard":"/sota/recommendation-systems-on-amazon-books","slug":"recommendation-systems-on-amazon-books","dataset":"Amazon Books","dataset_url":null,"rows_in_archive":1,"metrics":["Recall@20"],"first_row_in_archive_order":{"model":"Multi-Gradient Descent","paper_title":"Multi-Gradient Descent for Multi-Objective Recommender Systems","paper_url":"/paper/multi-gradient-descent-for-multi-objective","paper_date":"2019-12-09","arxiv_id":"2001.00846","code_links":[{"title":"swisscom/ai-research-mamo-framework","url":"https://github.com/swisscom/ai-research-mamo-framework"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-ca","slug":"recommendation-systems-on-amazon-ca","dataset":"Amazon C&A","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@10","Hits@20","nDCG@10","nDCG@20"],"first_row_in_archive_order":{"model":"TransCF","paper_title":"Collaborative Translational Metric Learning","paper_url":"/paper/collaborative-translational-metric-learning","paper_date":"2019-06-04","arxiv_id":"1906.01637","code_links":[{"title":"hkuds/recdiff","url":"https://github.com/hkuds/recdiff"},{"title":"pcy1302/TransCF","url":"https://github.com/pcy1302/TransCF"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-electronics","slug":"recommendation-systems-on-amazon-electronics","dataset":"Amazon-Electronics","dataset_url":null,"rows_in_archive":1,"metrics":["MAP@20","MRR@20","NDCG@20"],"first_row_in_archive_order":{"model":"HetroFair","paper_title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","paper_url":"/paper/heterophily-aware-fair-recommendation-using","paper_date":"2024-01-31","arxiv_id":"2402.03365","code_links":[{"title":"nematgh/hetrofair","url":"https://github.com/nematgh/hetrofair"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-health","slug":"recommendation-systems-on-amazon-health","dataset":"Amazon-Health","dataset_url":null,"rows_in_archive":1,"metrics":["MAP@20","MRR@20","NDCG@20"],"first_row_in_archive_order":{"model":"HetroFair","paper_title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","paper_url":"/paper/heterophily-aware-fair-recommendation-using","paper_date":"2024-01-31","arxiv_id":"2402.03365","code_links":[{"title":"nematgh/hetrofair","url":"https://github.com/nematgh/hetrofair"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-amazon-movies","slug":"recommendation-systems-on-amazon-movies","dataset":"Amazon-Movies","dataset_url":null,"rows_in_archive":1,"metrics":["MAP@20","MRR@20","NDCG@20"],"first_row_in_archive_order":{"model":"HetroFair","paper_title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","paper_url":"/paper/heterophily-aware-fair-recommendation-using","paper_date":"2024-01-31","arxiv_id":"2402.03365","code_links":[{"title":"nematgh/hetrofair","url":"https://github.com/nematgh/hetrofair"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-beeradvocate","slug":"recommendation-systems-on-beeradvocate","dataset":"BeerAdvocate","dataset_url":"/dataset/beeradvocate","rows_in_archive":1,"metrics":["MAE","RMSE"],"first_row_in_archive_order":{"model":"CFM","paper_title":"Predicting ratings in multi-criteria recommender systems via a collective factor model","paper_url":"/paper/predicting-ratings-in-multi-criteria","paper_date":"2021-05-21","arxiv_id":null,"code_links":[{"title":"LucaM1985/CFM","url":"https://github.com/LucaM1985/CFM"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-ciao","slug":"recommendation-systems-on-ciao","dataset":"Ciao","dataset_url":"/dataset/ciao","rows_in_archive":1,"metrics":["Hits@10","Hits@20","nDCG@10","nDCG@20"],"first_row_in_archive_order":{"model":"TransCF","paper_title":"Collaborative Translational Metric Learning","paper_url":"/paper/collaborative-translational-metric-learning","paper_date":"2019-06-04","arxiv_id":"1906.01637","code_links":[{"title":"hkuds/recdiff","url":"https://github.com/hkuds/recdiff"},{"title":"pcy1302/TransCF","url":"https://github.com/pcy1302/TransCF"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-citeulike","slug":"recommendation-systems-on-citeulike","dataset":"CiteULike","dataset_url":"/dataset/cite","rows_in_archive":1,"metrics":["Recall@10","mAP@10"],"first_row_in_archive_order":{"model":"RATE-CSE","paper_title":"Collaborative Similarity Embedding for Recommender Systems","paper_url":"/paper/collaborative-similarity-embedding-for","paper_date":"2019-02-17","arxiv_id":"1902.06188","code_links":[{"title":"cnclabs/smore","url":"https://github.com/cnclabs/smore"},{"title":"bdnf/SBX-Recommendation-Engine","url":"https://github.com/bdnf/SBX-Recommendation-Engine"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-declicious","slug":"recommendation-systems-on-declicious","dataset":"Declicious","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@10","Hits@20","nDCG@10","nDCG@20"],"first_row_in_archive_order":{"model":"TransCF","paper_title":"Collaborative Translational Metric Learning","paper_url":"/paper/collaborative-translational-metric-learning","paper_date":"2019-06-04","arxiv_id":"1906.01637","code_links":[{"title":"hkuds/recdiff","url":"https://github.com/hkuds/recdiff"},{"title":"pcy1302/TransCF","url":"https://github.com/pcy1302/TransCF"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-delicious","slug":"recommendation-systems-on-delicious","dataset":"Delicious","dataset_url":"/dataset/delicious","rows_in_archive":1,"metrics":["NDCG","Recall@20"],"first_row_in_archive_order":{"model":"DGRec","paper_title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","paper_url":"/paper/session-based-social-recommendation-via","paper_date":"2019-02-25","arxiv_id":"1902.09362","code_links":[{"title":"DeepGraphLearning/RecommenderSystems","url":"https://github.com/DeepGraphLearning/RecommenderSystems"},{"title":"sparsh-ai/RecommenderSystems","url":"https://github.com/sparsh-ai/RecommenderSystems"}],"syntology":{"n":13,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/session-based-social-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/1902.09362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09362"}},"official":{"repos":["DeepGraphLearning/RecommenderSystems"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":12,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/recommendation-systems-on-dianping-food","slug":"recommendation-systems-on-dianping-food","dataset":"Dianping-Food","dataset_url":null,"rows_in_archive":1,"metrics":["Recall@10","Recall@100","Recall@2","Recall@50"],"first_row_in_archive_order":{"model":"KGNN-LS","paper_title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","paper_url":"/paper/knowledge-graph-convolutional-networks-for","paper_date":"2019-05-11","arxiv_id":"1905.04413","code_links":[{"title":"hwwang55/KGNN-LS","url":"https://github.com/hwwang55/KGNN-LS"},{"title":"songzeceng/KGNNLS_DEMO","url":"https://github.com/songzeceng/KGNNLS_DEMO"},{"title":"z-qiyu/KGNN-LS","url":"https://github.com/z-qiyu/KGNN-LS"},{"title":"MindSpore-scientific-2/code-10","url":"https://github.com/MindSpore-scientific-2/code-10/tree/main/RGNN"},{"title":"YuTesla/KGNN-LS-learn","url":"https://github.com/YuTesla/KGNN-LS-learn"},{"title":"matlabmtl/Reco-KGNN-LS","url":"https://github.com/matlabmtl/Reco-KGNN-LS"}],"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}},"official":null}}},{"leaderboard":"/sota/recommendation-systems-on-echonest","slug":"recommendation-systems-on-echonest","dataset":"Echonest","dataset_url":null,"rows_in_archive":1,"metrics":["Recall@10","mAP@10"],"first_row_in_archive_order":{"model":"RANK-CSE","paper_title":"Collaborative Similarity Embedding for Recommender Systems","paper_url":"/paper/collaborative-similarity-embedding-for","paper_date":"2019-02-17","arxiv_id":"1902.06188","code_links":[{"title":"cnclabs/smore","url":"https://github.com/cnclabs/smore"},{"title":"bdnf/SBX-Recommendation-Engine","url":"https://github.com/bdnf/SBX-Recommendation-Engine"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-epinions-extend","slug":"recommendation-systems-on-epinions-extend","dataset":"Epinions-Extend","dataset_url":"/dataset/epinion","rows_in_archive":1,"metrics":["Recall@10","mAP@10"],"first_row_in_archive_order":{"model":"RANK-CSE","paper_title":"Collaborative Similarity Embedding for Recommender Systems","paper_url":"/paper/collaborative-similarity-embedding-for","paper_date":"2019-02-17","arxiv_id":"1902.06188","code_links":[{"title":"cnclabs/smore","url":"https://github.com/cnclabs/smore"},{"title":"bdnf/SBX-Recommendation-Engine","url":"https://github.com/bdnf/SBX-Recommendation-Engine"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-fashion-similar","slug":"recommendation-systems-on-fashion-similar","dataset":"Fashion-Similar","dataset_url":null,"rows_in_archive":1,"metrics":["MRR@20"],"first_row_in_archive_order":{"model":"SR-PredAO(SGNN-HN)","paper_title":"SR-PredictAO: Session-based Recommendation with High-Capability Predictor Add-On","paper_url":"/paper/sr-predictao-session-based-recommendation","paper_date":"2023-09-20","arxiv_id":"2309.12218","code_links":[{"title":"rickyskywalker/sr-predictao-official","url":"https://github.com/rickyskywalker/sr-predictao-official"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-goodreads-children","slug":"recommendation-systems-on-goodreads-children","dataset":"GoodReads-Children","dataset_url":null,"rows_in_archive":1,"metrics":["Recall@10","nDCG@10"],"first_row_in_archive_order":{"model":"HGN","paper_title":"Hierarchical Gating Networks for Sequential Recommendation","paper_url":"/paper/hierarchical-gating-networks-for-sequential","paper_date":"2019-06-21","arxiv_id":"1906.09217","code_links":[{"title":"allenjack/HGN","url":"https://github.com/allenjack/HGN"},{"title":"wuliwei9278/HGN_baseline","url":"https://github.com/wuliwei9278/HGN_baseline"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-gating-networks-for-sequential#ran","syntology_url":"https://syntology.ai/paper/1906.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09217"}},"official":{"repos":["allenjack/HGN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/recommendation-systems-on-goodreads-comics","slug":"recommendation-systems-on-goodreads-comics","dataset":"GoodReads-Comics","dataset_url":null,"rows_in_archive":1,"metrics":["Recall@10","nDCG@10"],"first_row_in_archive_order":{"model":"HGN","paper_title":"Hierarchical Gating Networks for Sequential Recommendation","paper_url":"/paper/hierarchical-gating-networks-for-sequential","paper_date":"2019-06-21","arxiv_id":"1906.09217","code_links":[{"title":"allenjack/HGN","url":"https://github.com/allenjack/HGN"},{"title":"wuliwei9278/HGN_baseline","url":"https://github.com/wuliwei9278/HGN_baseline"}],"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-gating-networks-for-sequential#ran","syntology_url":"https://syntology.ai/paper/1906.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09217"}},"official":{"repos":["allenjack/HGN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/recommendation-systems-on-lastfm-360k","slug":"recommendation-systems-on-lastfm-360k","dataset":"Last.FM-360k","dataset_url":null,"rows_in_archive":1,"metrics":["Recall@10","mAP@10"],"first_row_in_archive_order":{"model":"RANK-CSE","paper_title":"Collaborative Similarity Embedding for Recommender Systems","paper_url":"/paper/collaborative-similarity-embedding-for","paper_date":"2019-02-17","arxiv_id":"1902.06188","code_links":[{"title":"cnclabs/smore","url":"https://github.com/cnclabs/smore"},{"title":"bdnf/SBX-Recommendation-Engine","url":"https://github.com/bdnf/SBX-Recommendation-Engine"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-movielens-latest","slug":"recommendation-systems-on-movielens-latest","dataset":"MovieLens-Latest","dataset_url":"/dataset/movielens","rows_in_archive":1,"metrics":["Recall@10","mAP@10"],"first_row_in_archive_order":{"model":"RATE-CSE","paper_title":"Collaborative Similarity Embedding for Recommender Systems","paper_url":"/paper/collaborative-similarity-embedding-for","paper_date":"2019-02-17","arxiv_id":"1902.06188","code_links":[{"title":"cnclabs/smore","url":"https://github.com/cnclabs/smore"},{"title":"bdnf/SBX-Recommendation-Engine","url":"https://github.com/bdnf/SBX-Recommendation-Engine"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-pinterest","slug":"recommendation-systems-on-pinterest","dataset":"Pinterest","dataset_url":"/dataset/pinterest","rows_in_archive":1,"metrics":["nDCG@10","Hits@10","Hits@20","nDCG@20"],"first_row_in_archive_order":{"model":"TransCF","paper_title":"Collaborative Translational Metric Learning","paper_url":"/paper/collaborative-translational-metric-learning","paper_date":"2019-06-04","arxiv_id":"1906.01637","code_links":[{"title":"hkuds/recdiff","url":"https://github.com/hkuds/recdiff"},{"title":"pcy1302/TransCF","url":"https://github.com/pcy1302/TransCF"}],"syntology":null}},{"leaderboard":"/sota/recommendation-systems-on-pixelrec","slug":"recommendation-systems-on-pixelrec","dataset":"PixelRec","dataset_url":"/dataset/pixelrec","rows_in_archive":1,"metrics":["Hit@10"],"first_row_in_archive_order":{"model":"SASRec","paper_title":"An Image Dataset for Benchmarking Recommender Systems with Raw Pixels","paper_url":"/paper/an-image-dataset-for-benchmarking-recommender","paper_date":"2023-09-13","arxiv_id":"2309.06789","code_links":[{"title":"westlake-repl/pixelrec","url":"https://github.com/westlake-repl/pixelrec"}],"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-image-dataset-for-benchmarking-recommender#ran","syntology_url":"https://syntology.ai/paper/2309.06789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.06789"}},"official":{"repos":["westlake-repl/pixelrec"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/recommendation-systems-on-steam","slug":"recommendation-systems-on-steam","dataset":"Steam","dataset_url":null,"rows_in_archive":1,"metrics":["Hit@10","nDCG@10"],"first_row_in_archive_order":{"model":"SASRec","paper_title":"Self-Attentive Sequential Recommendation","paper_url":"/paper/180809781","paper_date":"2018-08-20","arxiv_id":"1808.09781","code_links":[{"title":"microsoft/recommenders","url":"https://github.com/microsoft/recommenders"},{"title":"facebookresearch/generative-recommenders","url":"https://github.com/facebookresearch/generative-recommenders"},{"title":"kang205/SASRec","url":"https://github.com/kang205/SASRec"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"pmixer/SASRec.pytorch","url":"https://github.com/pmixer/SASRec.pytorch"},{"title":"otto-de/recsys-dataset","url":"https://github.com/otto-de/recsys-dataset"},{"title":"paddorch/SASRec.paddle","url":"https://github.com/paddorch/SASRec.paddle"},{"title":"mangushev/mfgan","url":"https://github.com/mangushev/mfgan"}],"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/180809781#ran","syntology_url":"https://syntology.ai/paper/1808.09781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09781"}},"official":null}}},{"leaderboard":"/sota/recommendation-systems-on-tradesy","slug":"recommendation-systems-on-tradesy","dataset":"Tradesy","dataset_url":null,"rows_in_archive":1,"metrics":["Hits@10","Hits@20","nDCG@10","nDCG@20"],"first_row_in_archive_order":{"model":"TransCF","paper_title":"Collaborative Translational Metric Learning","paper_url":"/paper/collaborative-translational-metric-learning","paper_date":"2019-06-04","arxiv_id":"1906.01637","code_links":[{"title":"hkuds/recdiff","url":"https://github.com/hkuds/recdiff"},{"title":"pcy1302/TransCF","url":"https://github.com/pcy1302/TransCF"}],"syntology":null}}],"datasets":[{"url":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","num_papers_in_archive":1246},{"url":"/dataset/netflix-prize","name":"Netflix Prize","full_name":"Netflix Prize","num_papers_in_archive":370},{"url":"/dataset/gowalla","name":"Gowalla","full_name":"Gowalla","num_papers_in_archive":203},{"url":"/dataset/yelp2018","name":"Yelp2018","full_name":"Yelp2018","num_papers_in_archive":125},{"url":"/dataset/redial","name":"ReDial","full_name":"","num_papers_in_archive":105},{"url":"/dataset/yelp","name":"Yelp","full_name":"","num_papers_in_archive":86},{"url":"/dataset/douban","name":"Douban","full_name":"Douban Conversation Corpus","num_papers_in_archive":81},{"url":"/dataset/polyvore","name":"Polyvore","full_name":"Polyvore Outfits","num_papers_in_archive":62},{"url":"/dataset/epinions","name":"Epinions","full_name":null,"num_papers_in_archive":54},{"url":"/dataset/kuairec","name":"KuaiRec","full_name":"","num_papers_in_archive":51},{"url":"/dataset/foursquare","name":"Foursquare","full_name":null,"num_papers_in_archive":49},{"url":"/dataset/kuairand","name":"KuaiRand","full_name":"","num_papers_in_archive":42},{"url":"/dataset/amazon-product-data","name":"Amazon Product Data","full_name":"rithik","num_papers_in_archive":41},{"url":"/dataset/memetracker","name":"MemeTracker","full_name":"MemeTracker","num_papers_in_archive":39},{"url":"/dataset/gvgai","name":"GVGAI","full_name":"General Video Game AI","num_papers_in_archive":36},{"url":"/dataset/amazon-review","name":"Amazon Review","full_name":"","num_papers_in_archive":35},{"url":"/dataset/ciao","name":"Ciao","full_name":"","num_papers_in_archive":34},{"url":"/dataset/pinterest","name":"Pinterest","full_name":null,"num_papers_in_archive":33},{"url":"/dataset/durecdial","name":"DuRecDial","full_name":"","num_papers_in_archive":28},{"url":"/dataset/tg-redial","name":"TG-ReDial","full_name":null,"num_papers_in_archive":27},{"url":"/dataset/learning-to-rank-challenge","name":"Learning to Rank Challenge","full_name":"Yahoo! Learning to Rank Challenge","num_papers_in_archive":25},{"url":"/dataset/amazon-beauty","name":"Amazon Beauty","full_name":"Amazon Beauty 5-core","num_papers_in_archive":18},{"url":"/dataset/amazon-book","name":"Amazon-Book","full_name":"","num_papers_in_archive":18},{"url":"/dataset/mmd","name":"MMD","full_name":"Multimodal Dialogs","num_papers_in_archive":18},{"url":"/dataset/beeradvocate","name":"BeerAdvocate","full_name":"","num_papers_in_archive":15},{"url":"/dataset/exact-street2shop","name":"Exact Street2Shop","full_name":"","num_papers_in_archive":15},{"url":"/dataset/amazon-men","name":"Amazon Men","full_name":"Amazon Men","num_papers_in_archive":14},{"url":"/dataset/amazon-sports","name":"Amazon-Sports","full_name":"Amazon-Sports","num_papers_in_archive":14},{"url":"/dataset/msd","name":"MSD","full_name":"Million Song Dataset","num_papers_in_archive":11},{"url":"/dataset/amazon-fashion","name":"Amazon Fashion","full_name":"Amazon Fashion","num_papers_in_archive":8},{"url":"/dataset/wechat","name":"WeChat","full_name":null,"num_papers_in_archive":7},{"url":"/dataset/cite","name":"CITE","full_name":"","num_papers_in_archive":6},{"url":"/dataset/spotify-podcast","name":"Spotify Podcast","full_name":"","num_papers_in_archive":6},{"url":"/dataset/coached-conversational-preference-elicitation","name":"Coached Conversational Preference Elicitation","full_name":"","num_papers_in_archive":5},{"url":"/dataset/epinion","name":"Epinion","full_name":null,"num_papers_in_archive":5},{"url":"/dataset/kg20c","name":"KG20C","full_name":"A scholarly knowledge graph benchmark dataset","num_papers_in_archive":5},{"url":"/dataset/amazon-fine-foods","name":"Amazon Fine Foods","full_name":"","num_papers_in_archive":4},{"url":"/dataset/hotelrec","name":"HotelRec","full_name":"","num_papers_in_archive":3},{"url":"/dataset/top-n-recommendation-runs","name":"Top-N Recommendation Runs","full_name":"","num_papers_in_archive":3},{"url":"/dataset/tripadvisor-restaurant-reviews-texts-and","name":"Tripadvisor Restaurant Reviews","full_name":"","num_papers_in_archive":3},{"url":"/dataset/xmind","name":"xMIND","full_name":"A Multilingual Dataset for Cross-lingual News Recommendation","num_papers_in_archive":3},{"url":"/dataset/delicious","name":"Delicious","full_name":"Delicious","num_papers_in_archive":2},{"url":"/dataset/e-redial","name":"E-ReDial","full_name":"Explainable Recommendation Dialogues","num_papers_in_archive":2},{"url":"/dataset/ranking-social-media-news-feed","name":"Ranking social media news feed","full_name":"","num_papers_in_archive":2},{"url":"/dataset/sweetrs","name":"SweetRS","full_name":"","num_papers_in_archive":2},{"url":"/dataset/wikidata-14m","name":"Wikidata-14M","full_name":"","num_papers_in_archive":2},{"url":"/dataset/wyzerule","name":"WyzeRule","full_name":"","num_papers_in_archive":2},{"url":"/dataset/cal10k","name":"CAL10K","full_name":"Computer Audition Lab 10000","num_papers_in_archive":1},{"url":"/dataset/google-local-review","name":"Google Local review","full_name":"Google Local Data","num_papers_in_archive":1},{"url":"/dataset/industrial-benchmark-dataset-for-customer","name":"Industrial Benchmark Dataset for Customer Escalation Prediction","full_name":"","num_papers_in_archive":1},{"url":"/dataset/merrec","name":"MerRec","full_name":"MerRec Recommendation Dataset","num_papers_in_archive":1},{"url":"/dataset/musechat-dataset","name":"MuseChat Dataset","full_name":"MuseChat: A Conversational Music Recommendation System for Videos (CVPR 2024 Highlight Paper)","num_papers_in_archive":1},{"url":"/dataset/otto-recommender-systems-dataset","name":"OTTO Recommender Systems Dataset","full_name":"","num_papers_in_archive":1},{"url":"/dataset/pixelrec","name":"PixelRec","full_name":"","num_papers_in_archive":1},{"url":"/dataset/antm2c","name":"AntM2C","full_name":"Ant-Group Multi-Scenario Multi-Modal CTR dataset","num_papers_in_archive":0},{"url":"/dataset/x-wines","name":"X-Wines","full_name":"A Wine Dataset for Recommender Systems and Machine Learning","num_papers_in_archive":0}],"subtasks":[{"url":"/task/graph-neural-network","name":"Graph Neural Network"},{"url":"/task/interactive-recommendation","name":"Interactive Recommendation"},{"url":"/task/knowledge-aware-recommendation","name":"Knowledge-Aware Recommendation"},{"url":"/task/microvideo-recommendation","name":"Microvideo Recommendation"},{"url":"/task/multi-media-recommendation","name":"Multi-Media Recommendation"},{"url":"/task/multi-modal-recommendation","name":"Multi-modal Recommendation"},{"url":"/task/multibehavior-recommendation","name":"Multibehavior Recommendation"},{"url":"/task/multimedia-recommendation","name":"Multimedia recommendation"},{"url":"/task/multimodal-recommendation","name":"Multimodal Recommendation"},{"url":"/task/sequential-recommendation","name":"Sequential Recommendation"},{"url":"/task/session-based-recommendations","name":"Session-Based Recommendations"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":61,"rows_per_page":100,"shown":100,"of":6047,"of_with_code":1997,"tagged_in_all":6047,"counts":{"archive_papers_tagged":6047,"with_a_code_link":1997,"where_syntology_ran_a_sample":330,"not_listed_spam_title":0,"listed":6047,"listed_where_code_ran":330,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":270,"every_run_a_failure_of_syntologys_instrument":60,"listed_with_a_run_with_no_instrument_failure":270,"listed_every_run_a_failure_of_syntologys_instrument":60,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","repositories_listed":55,"syntology":{"n":58,"n_ran":39,"n_constructed":13,"n_ran_checked":34,"n_instrument":5,"n_unverified":19,"n_honours":0,"n_violates":1,"n_no_contract":33,"n_pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","sample_list":"/paper/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}},"official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/neural-collaborative-filtering","slug":"neural-collaborative-filtering","title":"Neural Collaborative Filtering","date":"2017-08-16","arxiv_id":"1708.05031","repositories_listed":43,"syntology":null},{"url":"/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","repositories_listed":39,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","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"}},"official":null}},{"url":"/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","repositories_listed":31,"syntology":{"n":26,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":14,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified","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"}},"official":null}},{"url":"/paper/session-based-recommendations-with-recurrent","slug":"session-based-recommendations-with-recurrent","title":"Session-based Recommendations with Recurrent Neural Networks","date":"2015-11-21","arxiv_id":"1511.06939","repositories_listed":25,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/session-based-recommendations-with-recurrent#ran","syntology_url":"https://syntology.ai/paper/1511.06939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06939"}},"official":null}},{"url":"/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","repositories_listed":23,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":21,"syntology":null},{"url":"/paper/neural-graph-collaborative-filtering","slug":"neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","arxiv_id":"1905.08108","repositories_listed":21,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/1905.08108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08108"}},"official":{"repos":["xiangwang1223/neural_graph_collaborative_filtering"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/190600091","slug":"190600091","title":"Deep Learning Recommendation Model for Personalization and Recommendation Systems","date":"2019-05-31","arxiv_id":"1906.00091","repositories_listed":19,"syntology":{"n":28,"n_ran":19,"n_constructed":0,"n_ran_checked":16,"n_instrument":3,"n_unverified":9,"n_honours":1,"n_violates":0,"n_no_contract":15,"n_pointer_only":6,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 0 violated, 15 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/190600091#ran","syntology_url":"https://syntology.ai/paper/1906.00091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00091"}},"official":{"repos":["facebookresearch/dlrm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":19,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":19,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}},{"url":"/paper/metaformer-is-actually-what-you-need-for","slug":"metaformer-is-actually-what-you-need-for","title":"MetaFormer Is Actually What You Need for Vision","date":"2021-11-22","arxiv_id":"2111.11418","repositories_listed":18,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/metaformer-is-actually-what-you-need-for#ran","syntology_url":"https://syntology.ai/paper/2111.11418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.11418"}},"official":{"repos":["rwightman/pytorch-image-models","sail-sg/poolformer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":18,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","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"}},"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"]}}},{"url":"/paper/variational-autoencoders-for-collaborative","slug":"variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":"1802.05814","repositories_listed":18,"syntology":{"n":21,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","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"}},"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"]}}},{"url":"/paper/graph-convolutional-matrix-completion","slug":"graph-convolutional-matrix-completion","title":"Graph Convolutional Matrix Completion","date":"2017-06-07","arxiv_id":"1706.02263","repositories_listed":17,"syntology":null},{"url":"/paper/actions-speak-louder-than-words-trillion","slug":"actions-speak-louder-than-words-trillion","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","date":"2024-02-27","arxiv_id":"2402.17152","repositories_listed":12,"syntology":{"n":42,"n_ran":15,"n_constructed":13,"n_ran_checked":14,"n_instrument":1,"n_unverified":27,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":3,"phrase":"15 ran (of which 13 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 27 unverified","sample_list":"/paper/actions-speak-louder-than-words-trillion#ran","syntology_url":"https://syntology.ai/paper/2402.17152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17152"}},"official":{"repos":["facebookresearch/generative-recommenders"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"url":"/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","repositories_listed":12,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","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"}},"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"]}}},{"url":"/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","repositories_listed":12,"syntology":null},{"url":"/paper/modeling-task-relationships-in-multi-task","slug":"modeling-task-relationships-in-multi-task","title":"Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts","date":"2018-07-19","arxiv_id":null,"repositories_listed":11,"syntology":null},{"url":"/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","repositories_listed":11,"syntology":null},{"url":"/paper/temporal-graph-networks-for-deep-learning-on","slug":"temporal-graph-networks-for-deep-learning-on","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","date":"2020-06-18","arxiv_id":"2006.10637","repositories_listed":10,"syntology":{"n":19,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/temporal-graph-networks-for-deep-learning-on#ran","syntology_url":"https://syntology.ai/paper/2006.10637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10637"}},"official":null}},{"url":"/paper/product-based-neural-networks-for-user-1","slug":"product-based-neural-networks-for-user-1","title":"Product-based Neural Networks for User Response Prediction over Multi-field Categorical Data","date":"2018-07-01","arxiv_id":"1807.00311","repositories_listed":10,"syntology":null},{"url":"/paper/training-deep-autoencoders-for-collaborative","slug":"training-deep-autoencoders-for-collaborative","title":"Training Deep AutoEncoders for Collaborative Filtering","date":"2017-08-05","arxiv_id":"1708.01715","repositories_listed":10,"syntology":null},{"url":"/paper/behavior-sequence-transformer-for-e-commerce","slug":"behavior-sequence-transformer-for-e-commerce","title":"Behavior Sequence Transformer for E-commerce Recommendation in Alibaba","date":"2019-05-15","arxiv_id":"1905.06874","repositories_listed":9,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/behavior-sequence-transformer-for-e-commerce#ran","syntology_url":"https://syntology.ai/paper/1905.06874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06874"}},"official":null}},{"url":"/paper/190503375","slug":"190503375","title":"Embarrassingly Shallow Autoencoders for Sparse Data","date":"2019-05-08","arxiv_id":"1905.03375","repositories_listed":9,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}},"official":null}},{"url":"/paper/graph-neural-networks-for-social","slug":"graph-neural-networks-for-social","title":"Graph Neural Networks for Social Recommendation","date":"2019-02-19","arxiv_id":"1902.07243","repositories_listed":9,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-neural-networks-for-social#ran","syntology_url":"https://syntology.ai/paper/1902.07243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07243"}},"official":{"repos":["wenqifan03/GraphRec-WWW19"],"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":["listed","official"]}}},{"url":"/paper/ripplenet-propagating-user-preferences-on-the","slug":"ripplenet-propagating-user-preferences-on-the","title":"RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems","date":"2018-03-09","arxiv_id":"1803.03467","repositories_listed":9,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ripplenet-propagating-user-preferences-on-the#ran","syntology_url":"https://syntology.ai/paper/1803.03467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03467"}},"official":{"repos":["hwwang55/RippleNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/real-world-large-scale-recommendation-systems","slug":"real-world-large-scale-recommendation-systems","title":"Real World Large Scale Recommendation Systems Reproducibility and Smooth Activations","date":"2022-02-14","arxiv_id":"2202.06499","repositories_listed":8,"syntology":null},{"url":"/paper/bert4rec-sequential-recommendation-with","slug":"bert4rec-sequential-recommendation-with","title":"BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer","date":"2019-04-14","arxiv_id":"1904.06690","repositories_listed":8,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bert4rec-sequential-recommendation-with#ran","syntology_url":"https://syntology.ai/paper/1904.06690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06690"}},"official":{"repos":["FeiSun/BERT4Rec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/190412575","slug":"190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","arxiv_id":"1904.12575","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}},"official":{"repos":["hwwang55/KGCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/session-based-recommendation-with-graph","slug":"session-based-recommendation-with-graph","title":"Session-based Recommendation with Graph Neural Networks","date":"2018-11-01","arxiv_id":"1811.00855","repositories_listed":8,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/session-based-recommendation-with-graph#ran","syntology_url":"https://syntology.ai/paper/1811.00855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00855"}},"official":{"repos":["CRIPAC-DIG/SR-GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/180809781","slug":"180809781","title":"Self-Attentive Sequential Recommendation","date":"2018-08-20","arxiv_id":"1808.09781","repositories_listed":8,"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/180809781#ran","syntology_url":"https://syntology.ai/paper/1808.09781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09781"}},"official":null}},{"url":"/paper/deepfm-an-end-to-end-wide-deep-learning","slug":"deepfm-an-end-to-end-wide-deep-learning","title":"DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Prediction","date":"2018-04-12","arxiv_id":"1804.04950","repositories_listed":8,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deepfm-an-end-to-end-wide-deep-learning#ran","syntology_url":"https://syntology.ai/paper/1804.04950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.04950"}},"official":null}},{"url":"/paper/deep-learning-based-recommender-system-a","slug":"deep-learning-based-recommender-system-a","title":"Deep Learning based Recommender System: A Survey and New Perspectives","date":"2017-07-24","arxiv_id":"1707.07435","repositories_listed":8,"syntology":null},{"url":"/paper/progressive-layered-extraction-ple-a-novel","slug":"progressive-layered-extraction-ple-a-novel","title":"Progressive Layered Extraction (PLE): A Novel Multi-Task Learning (MTL) Model for Personalized Recommendations","date":"2020-02-22","arxiv_id":null,"repositories_listed":7,"syntology":null},{"url":"/paper/flen-leveraging-field-for-scalable-ctr","slug":"flen-leveraging-field-for-scalable-ctr","title":"FLEN: Leveraging Field for Scalable CTR Prediction","date":"2019-11-12","arxiv_id":"1911.04690","repositories_listed":7,"syntology":null},{"url":"/paper/neural-news-recommendation-with-attentive","slug":"neural-news-recommendation-with-attentive","title":"Neural News Recommendation with Attentive Multi-View Learning","date":"2019-07-12","arxiv_id":"1907.05576","repositories_listed":7,"syntology":null},{"url":"/paper/kgat-knowledge-graph-attention-network-for","slug":"kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","arxiv_id":"1905.07854","repositories_listed":7,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/kgat-knowledge-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1905.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07854"}},"official":{"repos":["xiangwang1223/knowledge_graph_attention_network"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-session-interest-network-for-click","slug":"deep-session-interest-network-for-click","title":"Deep Session Interest Network for Click-Through Rate Prediction","date":"2019-05-16","arxiv_id":"1905.06482","repositories_listed":7,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deep-session-interest-network-for-click#ran","syntology_url":"https://syntology.ai/paper/1905.06482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06482"}},"official":{"repos":["shenweichen/DSIN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deep-reinforcement-learning-for-list-wise","slug":"deep-reinforcement-learning-for-list-wise","title":"Deep Reinforcement Learning for List-wise Recommendations","date":"2017-12-30","arxiv_id":"1801.00209","repositories_listed":7,"syntology":null},{"url":"/paper/deep-neural-networks-for-youtube","slug":"deep-neural-networks-for-youtube","title":"Deep Neural Networks for YouTube Recommendations","date":"2016-09-07","arxiv_id":null,"repositories_listed":7,"syntology":null},{"url":"/paper/vbpr-visual-bayesian-personalized-ranking","slug":"vbpr-visual-bayesian-personalized-ranking","title":"VBPR: Visual Bayesian Personalized Ranking from Implicit Feedback","date":"2015-10-06","arxiv_id":"1510.01784","repositories_listed":7,"syntology":{"n":28,"n_ran":24,"n_constructed":0,"n_ran_checked":22,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":21,"n_pointer_only":3,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 1 honoured, 0 violated, 21 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/vbpr-visual-bayesian-personalized-ranking#ran","syntology_url":"https://syntology.ai/paper/1510.01784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.01784"}},"official":null}},{"url":"/paper/fuxictr-an-open-benchmark-for-click-through","slug":"fuxictr-an-open-benchmark-for-click-through","title":"BARS-CTR: Open Benchmarking for Click-Through Rate Prediction","date":"2020-09-12","arxiv_id":"2009.05794","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fuxictr-an-open-benchmark-for-click-through#ran","syntology_url":"https://syntology.ai/paper/2009.05794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.05794"}},"official":{"repos":["reczoo/BARS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/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","repositories_listed":6,"syntology":{"n":24,"n_ran":22,"n_constructed":0,"n_ran_checked":21,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":1,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","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"}},"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"]}}},{"url":"/paper/mixed-dimension-embeddings-with-application","slug":"mixed-dimension-embeddings-with-application","title":"Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems","date":"2019-09-25","arxiv_id":"1909.11810","repositories_listed":6,"syntology":{"n":26,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":26,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mixed-dimension-embeddings-with-application#ran","syntology_url":"https://syntology.ai/paper/1909.11810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11810"}},"official":{"repos":["facebookresearch/dlrm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/compositional-embeddings-using-complementary","slug":"compositional-embeddings-using-complementary","title":"Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systems","date":"2019-09-04","arxiv_id":"1909.02107","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/compositional-embeddings-using-complementary#ran","syntology_url":"https://syntology.ai/paper/1909.02107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02107"}},"official":{"repos":["facebookresearch/dlrm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}},"official":null}},{"url":"/paper/multi-interest-network-with-dynamic-routing","slug":"multi-interest-network-with-dynamic-routing","title":"Multi-Interest Network with Dynamic Routing for Recommendation at Tmall","date":"2019-04-17","arxiv_id":"1904.08030","repositories_listed":6,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-interest-network-with-dynamic-routing#ran","syntology_url":"https://syntology.ai/paper/1904.08030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08030"}},"official":null}},{"url":"/paper/feature-generation-by-convolutional-neural","slug":"feature-generation-by-convolutional-neural","title":"Feature Generation by Convolutional Neural Network for Click-Through Rate Prediction","date":"2019-04-09","arxiv_id":"1904.04447","repositories_listed":6,"syntology":null},{"url":"/paper/entire-space-multi-task-model-an-effective","slug":"entire-space-multi-task-model-an-effective","title":"Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Rate","date":"2018-04-21","arxiv_id":"1804.07931","repositories_listed":6,"syntology":null},{"url":"/paper/learning-tree-based-deep-model-for","slug":"learning-tree-based-deep-model-for","title":"Learning Tree-based Deep Model for Recommender Systems","date":"2018-01-08","arxiv_id":"1801.02294","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-tree-based-deep-model-for#ran","syntology_url":"https://syntology.ai/paper/1801.02294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.02294"}},"official":{"repos":["alibaba/x-deeplearning"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/the-effect-of-third-party-implementations-on","slug":"the-effect-of-third-party-implementations-on","title":"The Effect of Third Party Implementations on Reproducibility","date":"2023-07-27","arxiv_id":"2307.14956","repositories_listed":5,"syntology":null},{"url":"/paper/unified-embedding-battle-tested-feature","slug":"unified-embedding-battle-tested-feature","title":"Unified Embedding: Battle-Tested Feature Representations for Web-Scale ML Systems","date":"2023-05-20","arxiv_id":"2305.12102","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unified-embedding-battle-tested-feature#ran","syntology_url":"https://syntology.ai/paper/2305.12102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12102"}},"official":null}},{"url":"/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","repositories_listed":5,"syntology":null},{"url":"/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","repositories_listed":5,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","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"}},"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"]}}},{"url":"/paper/bars-towards-open-benchmarking-for","slug":"bars-towards-open-benchmarking-for","title":"BARS: Towards Open Benchmarking for Recommender Systems","date":"2022-05-19","arxiv_id":"2205.09626","repositories_listed":5,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bars-towards-open-benchmarking-for#ran","syntology_url":"https://syntology.ai/paper/2205.09626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09626"}},"official":{"repos":["openbenchmark/BARS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":5,"syntology":null},{"url":"/paper/tisasrec-time-interval-aware-self-attention","slug":"tisasrec-time-interval-aware-self-attention","title":"TiSASRec: Time Interval Aware Self-Attention for Sequential Recommendation","date":"2020-01-01","arxiv_id":null,"repositories_listed":5,"syntology":null},{"url":"/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","repositories_listed":5,"syntology":null},{"url":"/paper/nrpa-neural-recommendation-with-personalized","slug":"nrpa-neural-recommendation-with-personalized","title":"NRPA: Neural Recommendation with Personalized Attention","date":"2019-05-29","arxiv_id":"1905.12480","repositories_listed":5,"syntology":null},{"url":"/paper/deep-reinforcement-learning-based","slug":"deep-reinforcement-learning-based","title":"Deep Reinforcement Learning based Recommendation with Explicit User-Item Interactions Modeling","date":"2018-10-29","arxiv_id":"1810.12027","repositories_listed":5,"syntology":null},{"url":"/paper/personalized-top-n-sequential-recommendation","slug":"personalized-top-n-sequential-recommendation","title":"Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding","date":"2018-09-19","arxiv_id":"1809.07426","repositories_listed":5,"syntology":null},{"url":"/paper/graph-convolutional-neural-networks-for-web","slug":"graph-convolutional-neural-networks-for-web","title":"Graph Convolutional Neural Networks for Web-Scale Recommender Systems","date":"2018-06-06","arxiv_id":"1806.01973","repositories_listed":5,"syntology":{"n":11,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/graph-convolutional-neural-networks-for-web#ran","syntology_url":"https://syntology.ai/paper/1806.01973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01973"}},"official":null}},{"url":"/paper/180503352","slug":"180503352","title":"Learning Heterogeneous Knowledge Base Embeddings for Explainable Recommendation","date":"2018-05-09","arxiv_id":"1805.03352","repositories_listed":5,"syntology":null},{"url":"/paper/collaborative-memory-network-for","slug":"collaborative-memory-network-for","title":"Collaborative Memory Network for Recommendation Systems","date":"2018-04-29","arxiv_id":"1804.10862","repositories_listed":5,"syntology":null},{"url":"/paper/joint-deep-modeling-of-users-and-items-using","slug":"joint-deep-modeling-of-users-and-items-using","title":"Joint Deep Modeling of Users and Items Using Reviews for Recommendation","date":"2017-01-17","arxiv_id":"1701.04783","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/joint-deep-modeling-of-users-and-items-using#ran","syntology_url":"https://syntology.ai/paper/1701.04783","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.04783"}},"official":null}},{"url":"/paper/unbiased-offline-evaluation-of-contextual","slug":"unbiased-offline-evaluation-of-contextual","title":"Unbiased Offline Evaluation of Contextual-bandit-based News Article Recommendation Algorithms","date":"2010-03-31","arxiv_id":"1003.5956","repositories_listed":5,"syntology":null},{"url":"/paper/widespread-flaws-in-offline-evaluation-of","slug":"widespread-flaws-in-offline-evaluation-of","title":"Widespread Flaws in Offline Evaluation of Recommender Systems","date":"2023-07-27","arxiv_id":"2307.14951","repositories_listed":4,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/widespread-flaws-in-offline-evaluation-of#ran","syntology_url":"https://syntology.ai/paper/2307.14951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.14951"}},"official":{"repos":["hidasib/GRU4Rec","hidasib/recsys_eval_flaws"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/openp5-benchmarking-foundation-models-for","slug":"openp5-benchmarking-foundation-models-for","title":"OpenP5: An Open-Source Platform for Developing, Training, and Evaluating LLM-based Recommender Systems","date":"2023-06-19","arxiv_id":"2306.11134","repositories_listed":4,"syntology":{"n":25,"n_ran":23,"n_constructed":0,"n_ran_checked":16,"n_instrument":7,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":14,"n_pointer_only":9,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 1 violated, 14 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/openp5-benchmarking-foundation-models-for#ran","syntology_url":"https://syntology.ai/paper/2306.11134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11134"}},"official":{"repos":["agiresearch/openp5"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/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","repositories_listed":4,"syntology":null},{"url":"/paper/self-supervised-multi-channel-hypergraph","slug":"self-supervised-multi-channel-hypergraph","title":"Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation","date":"2021-01-16","arxiv_id":"2101.06448","repositories_listed":4,"syntology":null},{"url":"/paper/multi-relational-embedding-for-knowledge","slug":"multi-relational-embedding-for-knowledge","title":"Multi-Relational Embedding for Knowledge Graph Representation and Analysis","date":"2020-09-28","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/field-embedded-factorization-machines-for","slug":"field-embedded-factorization-machines-for","title":"Field-Embedded Factorization Machines for Click-through rate prediction","date":"2020-09-13","arxiv_id":"2009.09931","repositories_listed":4,"syntology":null},{"url":"/paper/detecting-relevant-feature-interactions-for","slug":"detecting-relevant-feature-interactions-for","title":"Detecting Beneficial Feature Interactions for Recommender Systems","date":"2020-08-02","arxiv_id":"2008.00404","repositories_listed":4,"syntology":null},{"url":"/paper/pairwise-multi-class-document-classification","slug":"pairwise-multi-class-document-classification","title":"Pairwise Multi-Class Document Classification for Semantic Relations between Wikipedia Articles","date":"2020-03-22","arxiv_id":"2003.09881","repositories_listed":4,"syntology":null},{"url":"/paper/neural-news-recommendation-with-multi-head","slug":"neural-news-recommendation-with-multi-head","title":"Neural News Recommendation with Multi-Head Self-Attention","date":"2019-11-01","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/the-unfairness-of-popularity-bias-in","slug":"the-unfairness-of-popularity-bias-in","title":"The Unfairness of Popularity Bias in Recommendation","date":"2019-07-31","arxiv_id":"1907.13286","repositories_listed":4,"syntology":null},{"url":"/paper/deeprec-an-open-source-toolkit-for-deep","slug":"deeprec-an-open-source-toolkit-for-deep","title":"DeepRec: An Open-source Toolkit for Deep Learning based Recommendation","date":"2019-05-25","arxiv_id":"1905.10536","repositories_listed":4,"syntology":null},{"url":"/paper/off-line-vs-on-line-evaluation-of-recommender","slug":"off-line-vs-on-line-evaluation-of-recommender","title":"Off-line vs. On-line Evaluation of Recommender Systems in Small E-commerce","date":"2018-09-10","arxiv_id":"1809.03186","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/off-line-vs-on-line-evaluation-of-recommender#ran","syntology_url":"https://syntology.ai/paper/1809.03186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03186"}},"official":{"repos":["lpeska/HT2020","lpeska/REVEAL2018"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dkn-deep-knowledge-aware-network-for-news","slug":"dkn-deep-knowledge-aware-network-for-news","title":"DKN: Deep Knowledge-Aware Network for News Recommendation","date":"2018-01-25","arxiv_id":"1801.08284","repositories_listed":4,"syntology":null},{"url":"/paper/hybrid-recommender-system-based-on","slug":"hybrid-recommender-system-based-on","title":"Hybrid Recommender System based on Autoencoders","date":"2016-06-24","arxiv_id":"1606.07659","repositories_listed":4,"syntology":null},{"url":"/paper/deepsurv-personalized-treatment-recommender","slug":"deepsurv-personalized-treatment-recommender","title":"DeepSurv: Personalized Treatment Recommender System Using A Cox Proportional Hazards Deep Neural Network","date":"2016-06-02","arxiv_id":"1606.00931","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepsurv-personalized-treatment-recommender#ran","syntology_url":"https://syntology.ai/paper/1606.00931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.00931"}},"official":{"repos":["jaredleekatzman/DeepSurv"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/gradient-based-multi-objective-deep-learning","slug":"gradient-based-multi-objective-deep-learning","title":"Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond","date":"2025-01-19","arxiv_id":"2501.10945","repositories_listed":3,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradient-based-multi-objective-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2501.10945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.10945"}},"official":{"repos":["baijiong-lin/awesome-multi-objective-deep-learning","median-research-group/libmtl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pmg-personalized-multimodal-generation-with","slug":"pmg-personalized-multimodal-generation-with","title":"PMG : Personalized Multimodal Generation with Large Language Models","date":"2024-04-07","arxiv_id":"2404.08677","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pmg-personalized-multimodal-generation-with#ran","syntology_url":"https://syntology.ai/paper/2404.08677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08677"}},"official":{"repos":["Suikasxt/PMG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":3,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"0 ran · 5 unverified","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"}},"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":[]}}},{"url":"/paper/talk-like-a-graph-encoding-graphs-for-large","slug":"talk-like-a-graph-encoding-graphs-for-large","title":"Talk like a Graph: Encoding Graphs for Large Language Models","date":"2023-10-06","arxiv_id":"2310.04560","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/talk-like-a-graph-encoding-graphs-for-large#ran","syntology_url":"https://syntology.ai/paper/2310.04560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04560"}},"official":{"repos":["ChristianaKang11/google-graphqa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-bi-step-grounding-paradigm-for-large","slug":"a-bi-step-grounding-paradigm-for-large","title":"A Bi-Step Grounding Paradigm for Large Language Models in Recommendation Systems","date":"2023-08-16","arxiv_id":"2308.08434","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-bi-step-grounding-paradigm-for-large#ran","syntology_url":"https://syntology.ai/paper/2308.08434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08434"}},"official":{"repos":["sai990323/grounding4rec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/popularity-bias-in-collaborative-filtering","slug":"popularity-bias-in-collaborative-filtering","title":"Popularity Bias in Collaborative Filtering-Based Multimedia Recommender Systems","date":"2022-03-01","arxiv_id":"2203.00376","repositories_listed":3,"syntology":null},{"url":"/paper/kuairec-a-fully-observed-dataset-for","slug":"kuairec-a-fully-observed-dataset-for","title":"KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systems","date":"2022-02-22","arxiv_id":"2202.10842","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kuairec-a-fully-observed-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2202.10842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.10842"}},"official":{"repos":["chongminggao/KuaiRec"],"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"]}}},{"url":"/paper/off-policy-evaluation-for-large-action-spaces","slug":"off-policy-evaluation-for-large-action-spaces","title":"Off-Policy Evaluation for Large Action Spaces via Embeddings","date":"2022-02-13","arxiv_id":"2202.06317","repositories_listed":3,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/off-policy-evaluation-for-large-action-spaces#ran","syntology_url":"https://syntology.ai/paper/2202.06317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06317"}},"official":{"repos":["st-tech/zr-obp","usaito/icml2022-mips"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/beyond-ndcg-behavioral-testing-of-recommender","slug":"beyond-ndcg-behavioral-testing-of-recommender","title":"Beyond NDCG: behavioral testing of recommender systems with RecList","date":"2021-11-18","arxiv_id":"2111.09963","repositories_listed":3,"syntology":null},{"url":"/paper/glocal-k-global-and-local-kernels-for","slug":"glocal-k-global-and-local-kernels-for","title":"GLocal-K: Global and Local Kernels for Recommender Systems","date":"2021-08-27","arxiv_id":"2108.12184","repositories_listed":3,"syntology":null},{"url":"/paper/package-recommendation-with-intra-and-inter","slug":"package-recommendation-with-intra-and-inter","title":"Package Recommendation with Intra- and Inter-Package Attention Networks","date":"2021-07-11","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/dselect-k-differentiable-selection-in-the","slug":"dselect-k-differentiable-selection-in-the","title":"DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning","date":"2021-06-07","arxiv_id":"2106.03760","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dselect-k-differentiable-selection-in-the#ran","syntology_url":"https://syntology.ai/paper/2106.03760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03760"}},"official":{"repos":["google-research/google-research"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-to-expand-audience-via-meta-hybrid","slug":"learning-to-expand-audience-via-meta-hybrid","title":"Learning to Expand Audience via Meta Hybrid Experts and Critics for Recommendation and Advertising","date":"2021-05-31","arxiv_id":"2105.14688","repositories_listed":3,"syntology":null},{"url":"/paper/tcl-transformer-based-dynamic-graph-modelling","slug":"tcl-transformer-based-dynamic-graph-modelling","title":"TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning","date":"2021-05-17","arxiv_id":"2105.07944","repositories_listed":3,"syntology":null},{"url":"/paper/benchmarks-for-deep-off-policy-evaluation-1","slug":"benchmarks-for-deep-off-policy-evaluation-1","title":"Benchmarks for Deep Off-Policy Evaluation","date":"2021-03-30","arxiv_id":"2103.16596","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarks-for-deep-off-policy-evaluation-1#ran","syntology_url":"https://syntology.ai/paper/2103.16596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16596"}},"official":{"repos":["google-research/deep_ope"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-user-representations-with","slug":"learning-user-representations-with","title":"Learning User Representations with Hypercuboids for Recommender Systems","date":"2020-11-11","arxiv_id":"2011.05742","repositories_listed":3,"syntology":null},{"url":"/paper/propagation-model-search-for-graph-neural","slug":"propagation-model-search-for-graph-neural","title":"DiffMG: Differentiable Meta Graph Search for Heterogeneous Graph Neural Networks","date":"2020-10-07","arxiv_id":"2010.03250","repositories_listed":3,"syntology":null},{"url":"/paper/learning-set-functions-that-are-sparse-in-non","slug":"learning-set-functions-that-are-sparse-in-non","title":"Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases","date":"2020-10-01","arxiv_id":"2010.00439","repositories_listed":3,"syntology":null}],"syntology_records":52,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_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'","n_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":11,"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-movielens-1m","since_archive":"/sota/collaborative-filtering-on-movielens-1m#since-judged","papers_judged":4,"placed":0},{"leaderboard":"/sota/collaborative-filtering-on-movielens-20m","since_archive":"/sota/collaborative-filtering-on-movielens-20m#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/recommendation-systems-on-amazon-book","since_archive":"/sota/recommendation-systems-on-amazon-book#since-judged","papers_judged":2,"placed":0},{"leaderboard":"/sota/recommendation-systems-on-gowalla","since_archive":"/sota/recommendation-systems-on-gowalla#since-judged","papers_judged":4,"placed":0},{"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-netflix","since_archive":"/sota/collaborative-filtering-on-netflix#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/recommendation-systems-on-amazon-beauty","since_archive":"/sota/recommendation-systems-on-amazon-beauty#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/recommendation-systems-on-amazon-games","since_archive":"/sota/recommendation-systems-on-amazon-games#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/recommendation-systems-on-yelp","since_archive":"/sota/recommendation-systems-on-yelp#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/recommendation-systems-on-amazon-books","since_archive":"/sota/recommendation-systems-on-amazon-books#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/recommendation-systems-on-ciao","since_archive":"/sota/recommendation-systems-on-ciao#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":330,"papers_where_code_ran_first_page":"/task/recommendation-systems/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":61,"url":"/task/recommendation-systems/papers/2","json":"/task/recommendation-systems/papers/2.json","rows":100},{"order":"archive","page":3,"of":61,"url":"/task/recommendation-systems/papers/3","json":"/task/recommendation-systems/papers/3.json","rows":100},{"order":"archive","page":4,"of":61,"url":"/task/recommendation-systems/papers/4","json":"/task/recommendation-systems/papers/4.json","rows":100},{"order":"archive","page":5,"of":61,"url":"/task/recommendation-systems/papers/5","json":"/task/recommendation-systems/papers/5.json","rows":100},{"order":"archive","page":6,"of":61,"url":"/task/recommendation-systems/papers/6","json":"/task/recommendation-systems/papers/6.json","rows":100},{"order":"archive","page":7,"of":61,"url":"/task/recommendation-systems/papers/7","json":"/task/recommendation-systems/papers/7.json","rows":100},{"order":"archive","page":8,"of":61,"url":"/task/recommendation-systems/papers/8","json":"/task/recommendation-systems/papers/8.json","rows":100},{"order":"archive","page":9,"of":61,"url":"/task/recommendation-systems/papers/9","json":"/task/recommendation-systems/papers/9.json","rows":100},{"order":"archive","page":10,"of":61,"url":"/task/recommendation-systems/papers/10","json":"/task/recommendation-systems/papers/10.json","rows":100},{"order":"archive","page":11,"of":61,"url":"/task/recommendation-systems/papers/11","json":"/task/recommendation-systems/papers/11.json","rows":100},{"order":"archive","page":12,"of":61,"url":"/task/recommendation-systems/papers/12","json":"/task/recommendation-systems/papers/12.json","rows":100},{"order":"archive","page":13,"of":61,"url":"/task/recommendation-systems/papers/13","json":"/task/recommendation-systems/papers/13.json","rows":100},{"order":"archive","page":14,"of":61,"url":"/task/recommendation-systems/papers/14","json":"/task/recommendation-systems/papers/14.json","rows":100},{"order":"archive","page":15,"of":61,"url":"/task/recommendation-systems/papers/15","json":"/task/recommendation-systems/papers/15.json","rows":100},{"order":"archive","page":16,"of":61,"url":"/task/recommendation-systems/papers/16","json":"/task/recommendation-systems/papers/16.json","rows":100},{"order":"archive","page":17,"of":61,"url":"/task/recommendation-systems/papers/17","json":"/task/recommendation-systems/papers/17.json","rows":100},{"order":"archive","page":18,"of":61,"url":"/task/recommendation-systems/papers/18","json":"/task/recommendation-systems/papers/18.json","rows":100},{"order":"archive","page":19,"of":61,"url":"/task/recommendation-systems/papers/19","json":"/task/recommendation-systems/papers/19.json","rows":100},{"order":"archive","page":20,"of":61,"url":"/task/recommendation-systems/papers/20","json":"/task/recommendation-systems/papers/20.json","rows":100},{"order":"archive","page":21,"of":61,"url":"/task/recommendation-systems/papers/21","json":"/task/recommendation-systems/papers/21.json","rows":100},{"order":"archive","page":22,"of":61,"url":"/task/recommendation-systems/papers/22","json":"/task/recommendation-systems/papers/22.json","rows":100},{"order":"archive","page":23,"of":61,"url":"/task/recommendation-systems/papers/23","json":"/task/recommendation-systems/papers/23.json","rows":100},{"order":"archive","page":24,"of":61,"url":"/task/recommendation-systems/papers/24","json":"/task/recommendation-systems/papers/24.json","rows":100},{"order":"archive","page":25,"of":61,"url":"/task/recommendation-systems/papers/25","json":"/task/recommendation-systems/papers/25.json","rows":100},{"order":"archive","page":26,"of":61,"url":"/task/recommendation-systems/papers/26","json":"/task/recommendation-systems/papers/26.json","rows":100},{"order":"archive","page":27,"of":61,"url":"/task/recommendation-systems/papers/27","json":"/task/recommendation-systems/papers/27.json","rows":100},{"order":"archive","page":28,"of":61,"url":"/task/recommendation-systems/papers/28","json":"/task/recommendation-systems/papers/28.json","rows":100},{"order":"archive","page":29,"of":61,"url":"/task/recommendation-systems/papers/29","json":"/task/recommendation-systems/papers/29.json","rows":100},{"order":"archive","page":30,"of":61,"url":"/task/recommendation-systems/papers/30","json":"/task/recommendation-systems/papers/30.json","rows":100},{"order":"archive","page":31,"of":61,"url":"/task/recommendation-systems/papers/31","json":"/task/recommendation-systems/papers/31.json","rows":100},{"order":"archive","page":32,"of":61,"url":"/task/recommendation-systems/papers/32","json":"/task/recommendation-systems/papers/32.json","rows":100},{"order":"archive","page":33,"of":61,"url":"/task/recommendation-systems/papers/33","json":"/task/recommendation-systems/papers/33.json","rows":100},{"order":"archive","page":34,"of":61,"url":"/task/recommendation-systems/papers/34","json":"/task/recommendation-systems/papers/34.json","rows":100},{"order":"archive","page":35,"of":61,"url":"/task/recommendation-systems/papers/35","json":"/task/recommendation-systems/papers/35.json","rows":100},{"order":"archive","page":36,"of":61,"url":"/task/recommendation-systems/papers/36","json":"/task/recommendation-systems/papers/36.json","rows":100},{"order":"archive","page":37,"of":61,"url":"/task/recommendation-systems/papers/37","json":"/task/recommendation-systems/papers/37.json","rows":100},{"order":"archive","page":38,"of":61,"url":"/task/recommendation-systems/papers/38","json":"/task/recommendation-systems/papers/38.json","rows":100},{"order":"archive","page":39,"of":61,"url":"/task/recommendation-systems/papers/39","json":"/task/recommendation-systems/papers/39.json","rows":100},{"order":"archive","page":40,"of":61,"url":"/task/recommendation-systems/papers/40","json":"/task/recommendation-systems/papers/40.json","rows":100},{"order":"archive","page":41,"of":61,"url":"/task/recommendation-systems/papers/41","json":"/task/recommendation-systems/papers/41.json","rows":100},{"order":"archive","page":42,"of":61,"url":"/task/recommendation-systems/papers/42","json":"/task/recommendation-systems/papers/42.json","rows":100},{"order":"archive","page":43,"of":61,"url":"/task/recommendation-systems/papers/43","json":"/task/recommendation-systems/papers/43.json","rows":100},{"order":"archive","page":44,"of":61,"url":"/task/recommendation-systems/papers/44","json":"/task/recommendation-systems/papers/44.json","rows":100},{"order":"archive","page":45,"of":61,"url":"/task/recommendation-systems/papers/45","json":"/task/recommendation-systems/papers/45.json","rows":100},{"order":"archive","page":46,"of":61,"url":"/task/recommendation-systems/papers/46","json":"/task/recommendation-systems/papers/46.json","rows":100},{"order":"archive","page":47,"of":61,"url":"/task/recommendation-systems/papers/47","json":"/task/recommendation-systems/papers/47.json","rows":100},{"order":"archive","page":48,"of":61,"url":"/task/recommendation-systems/papers/48","json":"/task/recommendation-systems/papers/48.json","rows":100},{"order":"archive","page":49,"of":61,"url":"/task/recommendation-systems/papers/49","json":"/task/recommendation-systems/papers/49.json","rows":100},{"order":"archive","page":50,"of":61,"url":"/task/recommendation-systems/papers/50","json":"/task/recommendation-systems/papers/50.json","rows":100},{"order":"archive","page":51,"of":61,"url":"/task/recommendation-systems/papers/51","json":"/task/recommendation-systems/papers/51.json","rows":100},{"order":"archive","page":52,"of":61,"url":"/task/recommendation-systems/papers/52","json":"/task/recommendation-systems/papers/52.json","rows":100},{"order":"archive","page":53,"of":61,"url":"/task/recommendation-systems/papers/53","json":"/task/recommendation-systems/papers/53.json","rows":100},{"order":"archive","page":54,"of":61,"url":"/task/recommendation-systems/papers/54","json":"/task/recommendation-systems/papers/54.json","rows":100},{"order":"archive","page":55,"of":61,"url":"/task/recommendation-systems/papers/55","json":"/task/recommendation-systems/papers/55.json","rows":100},{"order":"archive","page":56,"of":61,"url":"/task/recommendation-systems/papers/56","json":"/task/recommendation-systems/papers/56.json","rows":100},{"order":"archive","page":57,"of":61,"url":"/task/recommendation-systems/papers/57","json":"/task/recommendation-systems/papers/57.json","rows":100},{"order":"archive","page":58,"of":61,"url":"/task/recommendation-systems/papers/58","json":"/task/recommendation-systems/papers/58.json","rows":100},{"order":"archive","page":59,"of":61,"url":"/task/recommendation-systems/papers/59","json":"/task/recommendation-systems/papers/59.json","rows":100},{"order":"archive","page":60,"of":61,"url":"/task/recommendation-systems/papers/60","json":"/task/recommendation-systems/papers/60.json","rows":100},{"order":"archive","page":61,"of":61,"url":"/task/recommendation-systems/papers/61","json":"/task/recommendation-systems/papers/61.json","rows":47},{"order":"ran","page":1,"of":4,"url":"/task/recommendation-systems/papers/ran/1","json":"/task/recommendation-systems/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":4,"url":"/task/recommendation-systems/papers/ran/2","json":"/task/recommendation-systems/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":4,"url":"/task/recommendation-systems/papers/ran/3","json":"/task/recommendation-systems/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":4,"url":"/task/recommendation-systems/papers/ran/4","json":"/task/recommendation-systems/papers/ran/4.json","rows":30}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"3e35d1e01291bbb2633125f9af8373150a45f58c44ce6101b77445350b111385","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}