{"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/papers/ran/4","list_of":"/task/recommendation-systems","task":"Recommendation Systems","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":4,"pages_in_order":4,"rows_per_page":100,"rows":[301,330],"of":330,"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":280,"every_run_a_failure_of_syntologys_instrument":50,"listed_with_a_run_with_no_instrument_failure":280,"listed_every_run_a_failure_of_syntologys_instrument":50,"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"},"first_page":"/task/recommendation-systems/papers/ran/1","prev":"/task/recommendation-systems/papers/ran/3","next":null,"papers":[{"url":"/paper/190410367","slug":"190410367","title":"Contextual Hybrid Session-based News Recommendation with Recurrent Neural Networks","date":"2019-04-15","arxiv_id":"1904.10367","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/190410367#ran","syntology_url":"https://syntology.ai/paper/1904.10367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10367"}},"official":{"repos":["gabrielspmoreira/chameleon_recsys"],"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/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/jointly-learning-explainable-rules-for","slug":"jointly-learning-explainable-rules-for","title":"Jointly Learning Explainable Rules for Recommendation with Knowledge Graph","date":"2019-03-09","arxiv_id":"1903.03714","repositories_listed":1,"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/jointly-learning-explainable-rules-for#ran","syntology_url":"https://syntology.ai/paper/1903.03714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03714"}},"official":{"repos":["THUIR/RuleRec"],"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/session-based-social-recommendation-via","slug":"session-based-social-recommendation-via","title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","date":"2019-02-25","arxiv_id":"1902.09362","repositories_listed":2,"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"]}}},{"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/multi-task-feature-learning-for-knowledge","slug":"multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","arxiv_id":"1901.08907","repositories_listed":3,"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/multi-task-feature-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1901.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08907"}},"official":{"repos":["hwwang55/MKR"],"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":["official"]}}},{"url":"/paper/towards-deep-conversational-recommendations","slug":"towards-deep-conversational-recommendations","title":"Towards Deep Conversational Recommendations","date":"2018-12-18","arxiv_id":"1812.07617","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-deep-conversational-recommendations#ran","syntology_url":"https://syntology.ai/paper/1812.07617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.07617"}},"official":null}},{"url":"/paper/fighting-fire-with-fire-using-antidote-data","slug":"fighting-fire-with-fire-using-antidote-data","title":"Fighting Fire with Fire: Using Antidote Data to Improve Polarization and Fairness of Recommender Systems","date":"2018-12-02","arxiv_id":"1812.01504","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fighting-fire-with-fire-using-antidote-data#ran","syntology_url":"https://syntology.ai/paper/1812.01504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01504"}},"official":null}},{"url":"/paper/tf-ranking-scalable-tensorflow-library-for","slug":"tf-ranking-scalable-tensorflow-library-for","title":"TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank","date":"2018-11-30","arxiv_id":"1812.00073","repositories_listed":2,"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/tf-ranking-scalable-tensorflow-library-for#ran","syntology_url":"https://syntology.ai/paper/1812.00073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.00073"}},"official":{"repos":["tensorflow/ranking"],"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":["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/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/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/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/recogym-a-reinforcement-learning-environment","slug":"recogym-a-reinforcement-learning-environment","title":"RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertising","date":"2018-08-02","arxiv_id":"1808.00720","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/recogym-a-reinforcement-learning-environment#ran","syntology_url":"https://syntology.ai/paper/1808.00720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.00720"}},"official":{"repos":["criteo-research/reco-gym"],"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":["official"]}}},{"url":"/paper/a-quantum-inspired-classical-algorithm-for","slug":"a-quantum-inspired-classical-algorithm-for","title":"A quantum-inspired classical algorithm for recommendation systems","date":"2018-07-10","arxiv_id":"1807.04271","repositories_listed":1,"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/a-quantum-inspired-classical-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/1807.04271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.04271"}},"official":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/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/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/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/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/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/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/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/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/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/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/exponential-machines","slug":"exponential-machines","title":"Exponential Machines","date":"2016-05-12","arxiv_id":"1605.03795","repositories_listed":3,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/exponential-machines#ran","syntology_url":"https://syntology.ai/paper/1605.03795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.03795"}},"official":{"repos":["Bihaqo/exp-machines"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/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}}],"record_sha256":"0648cc02b79e30d9b3b6d76974520fe17525594e89aa6cb4ba45e787cb065269","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}