{"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/11","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":11,"pages_in_order":61,"rows_per_page":100,"rows":[1001,1100],"of":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":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","prev":"/task/recommendation-systems/papers/10","next":"/task/recommendation-systems/papers/12","papers":[{"url":"/paper/weighted-multi-level-feature-factorization","slug":"weighted-multi-level-feature-factorization","title":"Weighted Multi-Level Feature Factorization for App ads CTR and installation prediction","date":"2023-08-03","arxiv_id":"2308.02568","repositories_listed":1,"syntology":null},{"url":"/paper/user-controllable-recommendation-via","slug":"user-controllable-recommendation-via","title":"User-Controllable Recommendation via Counterfactual Retrospective and Prospective Explanations","date":"2023-08-02","arxiv_id":"2308.00894","repositories_listed":1,"syntology":null},{"url":"/paper/challenging-the-myth-of-graph-collaborative","slug":"challenging-the-myth-of-graph-collaborative","title":"Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis","date":"2023-08-01","arxiv_id":"2308.00404","repositories_listed":1,"syntology":null},{"url":"/paper/online-matching-a-real-time-bandit-system-for","slug":"online-matching-a-real-time-bandit-system-for","title":"Online Matching: A Real-time Bandit System for Large-scale Recommendations","date":"2023-07-29","arxiv_id":"2307.15893","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-session-based-transformer","slug":"scaling-session-based-transformer","title":"Scaling Session-Based Transformer Recommendations using Optimized Negative Sampling and Loss Functions","date":"2023-07-27","arxiv_id":"2307.14906","repositories_listed":1,"syntology":null},{"url":"/paper/sustainable-transparency-in-recommender","slug":"sustainable-transparency-in-recommender","title":"Sustainable transparency in Recommender Systems: Bayesian Ranking of Images for Explainability","date":"2023-07-27","arxiv_id":"2308.01196","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-hypergraph-contrastive-policy","slug":"multi-view-hypergraph-contrastive-policy","title":"Multi-view Hypergraph Contrastive Policy Learning for Conversational Recommendation","date":"2023-07-26","arxiv_id":"2307.14024","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-mainstream-bias-in-recommendation","slug":"mitigating-mainstream-bias-in-recommendation","title":"Mitigating Mainstream Bias in Recommendation via Cost-sensitive Learning","date":"2023-07-25","arxiv_id":"2307.13632","repositories_listed":1,"syntology":null},{"url":"/paper/interface-design-to-mitigate-inflation-in","slug":"interface-design-to-mitigate-inflation-in","title":"Interface Design to Mitigate Inflation in Recommender Systems","date":"2023-07-23","arxiv_id":"2307.12424","repositories_listed":1,"syntology":null},{"url":"/paper/htp-exploiting-holistic-temporal-patterns-for","slug":"htp-exploiting-holistic-temporal-patterns-for","title":"HTP: Exploiting Holistic Temporal Patterns for Sequential Recommendation","date":"2023-07-22","arxiv_id":"2307.11994","repositories_listed":1,"syntology":null},{"url":"/paper/alleviating-the-long-tail-problem-in","slug":"alleviating-the-long-tail-problem-in","title":"Alleviating the Long-Tail Problem in Conversational Recommender Systems","date":"2023-07-21","arxiv_id":"2307.11650","repositories_listed":1,"syntology":null},{"url":"/paper/trea-tree-structure-reasoning-schema-for","slug":"trea-tree-structure-reasoning-schema-for","title":"TREA: Tree-Structure Reasoning Schema for Conversational Recommendation","date":"2023-07-20","arxiv_id":"2307.10543","repositories_listed":1,"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":20,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/trea-tree-structure-reasoning-schema-for#ran","syntology_url":"https://syntology.ai/paper/2307.10543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.10543"}},"official":{"repos":["windylee0822/trea"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/impatient-bandits-optimizing-for-the-long","slug":"impatient-bandits-optimizing-for-the-long","title":"Impatient Bandits: Optimizing Recommendations for the Long-Term Without Delay","date":"2023-07-19","arxiv_id":"2307.09943","repositories_listed":1,"syntology":null},{"url":"/paper/our-model-achieves-excellent-performance-on","slug":"our-model-achieves-excellent-performance-on","title":"Our Model Achieves Excellent Performance on MovieLens: What Does it Mean?","date":"2023-07-19","arxiv_id":"2307.09985","repositories_listed":1,"syntology":null},{"url":"/paper/deep-neural-aggregation-for-recommending","slug":"deep-neural-aggregation-for-recommending","title":"Deep Neural Aggregation for Recommending Items to Group of Users","date":"2023-07-18","arxiv_id":"2307.09447","repositories_listed":1,"syntology":null},{"url":"/paper/lightgt-a-light-graph-transformer-for","slug":"lightgt-a-light-graph-transformer-for","title":"LightGT: A Light Graph Transformer for Multimedia Recommendation","date":"2023-07-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/measuring-item-global-residual-value-for-fair","slug":"measuring-item-global-residual-value-for-fair","title":"Measuring Item Global Residual Value for Fair Recommendation","date":"2023-07-17","arxiv_id":"2307.08259","repositories_listed":1,"syntology":null},{"url":"/paper/going-beyond-local-global-graph-enhanced","slug":"going-beyond-local-global-graph-enhanced","title":"Going Beyond Local: Global Graph-Enhanced Personalized News Recommendations","date":"2023-07-13","arxiv_id":"2307.06576","repositories_listed":1,"syntology":null},{"url":"/paper/empowering-recommender-systems-using","slug":"empowering-recommender-systems-using","title":"Empowering recommender systems using automatically generated Knowledge Graphs and Reinforcement Learning","date":"2023-07-11","arxiv_id":"2307.04996","repositories_listed":1,"syntology":null},{"url":"/paper/intrinsically-motivated-graph-exploration","slug":"intrinsically-motivated-graph-exploration","title":"Intrinsically motivated graph exploration using network theories of human curiosity","date":"2023-07-11","arxiv_id":"2307.04962","repositories_listed":1,"syntology":null},{"url":"/paper/neural-symbolic-recommendation-with-graph","slug":"neural-symbolic-recommendation-with-graph","title":"Neural-Symbolic Recommendation with Graph-Enhanced Information","date":"2023-07-11","arxiv_id":"2307.05036","repositories_listed":1,"syntology":null},{"url":"/paper/causal-neural-graph-collaborative-filtering","slug":"causal-neural-graph-collaborative-filtering","title":"Neural Causal Graph Collaborative Filtering","date":"2023-07-10","arxiv_id":"2307.04384","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-large-language-model-for-graph-data","slug":"exploring-large-language-model-for-graph-data","title":"Exploring Large Language Model for Graph Data Understanding in Online Job Recommendations","date":"2023-07-10","arxiv_id":"2307.05722","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/exploring-large-language-model-for-graph-data#ran","syntology_url":"https://syntology.ai/paper/2307.05722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.05722"}},"official":{"repos":["wlik/glrec"],"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/knowledge-graph-self-supervised","slug":"knowledge-graph-self-supervised","title":"Knowledge Graph Self-Supervised Rationalization for Recommendation","date":"2023-07-06","arxiv_id":"2307.02759","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/knowledge-graph-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2307.02759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.02759"}},"official":{"repos":["hkuds/kgrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/transformerg2g-adaptive-time-stepping-for","slug":"transformerg2g-adaptive-time-stepping-for","title":"TransformerG2G: Adaptive time-stepping for learning temporal graph embeddings using transformers","date":"2023-07-05","arxiv_id":"2307.02588","repositories_listed":1,"syntology":null},{"url":"/paper/text-based-large-language-model-for","slug":"text-based-large-language-model-for","title":"GenRec: Large Language Model for Generative Recommendation","date":"2023-07-02","arxiv_id":"2307.00457","repositories_listed":1,"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":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) · 2 unverified","sample_list":"/paper/text-based-large-language-model-for#ran","syntology_url":"https://syntology.ai/paper/2307.00457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00457"}},"official":{"repos":["rutgerswiselab/genrec"],"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/obeying-the-order-introducing-ordered","slug":"obeying-the-order-introducing-ordered","title":"Obeying the Order: Introducing Ordered Transfer Hyperparameter Optimisation","date":"2023-06-29","arxiv_id":"2306.16916","repositories_listed":1,"syntology":null},{"url":"/paper/towards-personalized-cold-start","slug":"towards-personalized-cold-start","title":"Could Small Language Models Serve as Recommenders? Towards Data-centric Cold-start Recommendations","date":"2023-06-29","arxiv_id":"2306.17256","repositories_listed":1,"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":0,"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/towards-personalized-cold-start#ran","syntology_url":"https://syntology.ai/paper/2306.17256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17256"}},"official":{"repos":["jacksonwuxs/promptrec"],"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"]}}},{"url":"/paper/mydigitalfootprint-an-extensive-context","slug":"mydigitalfootprint-an-extensive-context","title":"MyDigitalFootprint: an extensive context dataset for pervasive computing applications at the edge","date":"2023-06-28","arxiv_id":"2306.15990","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-item-attribute-graph-pre-training","slug":"multi-task-item-attribute-graph-pre-training","title":"Multi-task Item-attribute Graph Pre-training for Strict Cold-start Item Recommendation","date":"2023-06-26","arxiv_id":"2306.14462","repositories_listed":1,"syntology":null},{"url":"/paper/reciprocal-sequential-recommendation","slug":"reciprocal-sequential-recommendation","title":"Reciprocal Sequential Recommendation","date":"2023-06-26","arxiv_id":"2306.14712","repositories_listed":1,"syntology":null},{"url":"/paper/dekgci-a-double-sided-recommendation-model","slug":"dekgci-a-double-sided-recommendation-model","title":"DEKGCI: A double-sided recommendation model for integrating knowledge graph and user-item interaction graph","date":"2023-06-24","arxiv_id":"2306.13837","repositories_listed":1,"syntology":null},{"url":"/paper/full-automation-of-goal-driven-llm-dialog","slug":"full-automation-of-goal-driven-llm-dialog","title":"Full Automation of Goal-driven LLM Dialog Threads with And-Or Recursors and Refiner Oracles","date":"2023-06-24","arxiv_id":"2306.14077","repositories_listed":1,"syntology":null},{"url":"/paper/hypers-building-a-hypergraph-driven-ensemble","slug":"hypers-building-a-hypergraph-driven-ensemble","title":"HypeRS: Building a Hypergraph-driven ensemble Recommender System","date":"2023-06-22","arxiv_id":"2306.12800","repositories_listed":1,"syntology":null},{"url":"/paper/capri-context-aware-interpretable-point-of","slug":"capri-context-aware-interpretable-point-of","title":"CAPRI: Context-Aware Interpretable Point-of-Interest Recommendation Framework","date":"2023-06-20","arxiv_id":"2306.11395","repositories_listed":1,"syntology":null},{"url":"/paper/towards-open-world-recommendation-with","slug":"towards-open-world-recommendation-with","title":"Towards Open-World Recommendation with Knowledge Augmentation from Large Language Models","date":"2023-06-19","arxiv_id":"2306.10933","repositories_listed":1,"syntology":null},{"url":"/paper/recfusion-a-binomial-diffusion-process-for-1d","slug":"recfusion-a-binomial-diffusion-process-for-1d","title":"RecFusion: A Binomial Diffusion Process for 1D Data for Recommendation","date":"2023-06-15","arxiv_id":"2306.08947","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-and-approximate-inference-of-large","slug":"analysis-and-approximate-inference-of-large","title":"Analysis and Approximate Inference of Large Random Kronecker Graphs","date":"2023-06-14","arxiv_id":"2306.08489","repositories_listed":1,"syntology":null},{"url":"/paper/katakomba-tools-and-benchmarks-for-data","slug":"katakomba-tools-and-benchmarks-for-data","title":"Katakomba: Tools and Benchmarks for Data-Driven NetHack","date":"2023-06-14","arxiv_id":"2306.08772","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/katakomba-tools-and-benchmarks-for-data#ran","syntology_url":"https://syntology.ai/paper/2306.08772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08772"}},"official":{"repos":["corl-team/katakomba"],"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":["official"]}}},{"url":"/paper/towards-building-voice-based-conversational","slug":"towards-building-voice-based-conversational","title":"Towards Building Voice-based Conversational Recommender Systems: Datasets, Potential Solutions, and Prospects","date":"2023-06-14","arxiv_id":"2306.08219","repositories_listed":1,"syntology":null},{"url":"/paper/topic-centric-explanations-for-news","slug":"topic-centric-explanations-for-news","title":"Topic-Centric Explanations for News Recommendation","date":"2023-06-13","arxiv_id":"2306.07506","repositories_listed":1,"syntology":null},{"url":"/paper/mean-variance-efficient-collaborative","slug":"mean-variance-efficient-collaborative","title":"Mean-Variance Efficient Collaborative Filtering for Stock Recommendation","date":"2023-06-11","arxiv_id":"2306.06590","repositories_listed":1,"syntology":null},{"url":"/paper/how-can-recommender-systems-benefit-from","slug":"how-can-recommender-systems-benefit-from","title":"How Can Recommender Systems Benefit from Large Language Models: A Survey","date":"2023-06-09","arxiv_id":"2306.05817","repositories_listed":1,"syntology":null},{"url":"/paper/controllable-multi-objective-re-ranking-with","slug":"controllable-multi-objective-re-ranking-with","title":"Controllable Multi-Objective Re-ranking with Policy Hypernetworks","date":"2023-06-08","arxiv_id":"2306.05118","repositories_listed":1,"syntology":null},{"url":"/paper/courier-contrastive-user-intention","slug":"courier-contrastive-user-intention","title":"COURIER: Contrastive User Intention Reconstruction for Large-Scale Visual Recommendation","date":"2023-06-08","arxiv_id":"2306.05001","repositories_listed":1,"syntology":null},{"url":"/paper/safe-collaborative-filtering","slug":"safe-collaborative-filtering","title":"Safe Collaborative Filtering","date":"2023-06-08","arxiv_id":"2306.05292","repositories_listed":1,"syntology":null},{"url":"/paper/when-to-show-a-suggestion-integrating-human","slug":"when-to-show-a-suggestion-integrating-human","title":"When to Show a Suggestion? Integrating Human Feedback in AI-Assisted Programming","date":"2023-06-08","arxiv_id":"2306.04930","repositories_listed":1,"syntology":{"n":19,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 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; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/when-to-show-a-suggestion-integrating-human#ran","syntology_url":"https://syntology.ai/paper/2306.04930","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04930"}},"official":{"repos":["microsoft/coderec_programming_states"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-dual-period-varying-preferences-for","slug":"modeling-dual-period-varying-preferences-for","title":"Modeling Dual Period-Varying Preferences for Takeaway Recommendation","date":"2023-06-07","arxiv_id":"2306.04370","repositories_listed":1,"syntology":null},{"url":"/paper/coldnas-search-to-modulate-for-user-cold","slug":"coldnas-search-to-modulate-for-user-cold","title":"ColdNAS: Search to Modulate for User Cold-Start Recommendation","date":"2023-06-06","arxiv_id":"2306.03387","repositories_listed":1,"syntology":null},{"url":"/paper/on-manipulating-signals-of-user-item-graph-a","slug":"on-manipulating-signals-of-user-item-graph-a","title":"On Manipulating Signals of User-Item Graph: A Jacobi Polynomial-based Graph Collaborative Filtering","date":"2023-06-06","arxiv_id":"2306.03624","repositories_listed":1,"syntology":null},{"url":"/paper/transferable-adversarial-robustness-for","slug":"transferable-adversarial-robustness-for","title":"Transferable Adversarial Robustness for Categorical Data via Universal Robust Embeddings","date":"2023-06-06","arxiv_id":"2306.04064","repositories_listed":1,"syntology":null},{"url":"/paper/improving-conversational-recommendation-4","slug":"improving-conversational-recommendation-4","title":"Improving Conversational Recommendation Systems via Counterfactual Data Simulation","date":"2023-06-05","arxiv_id":"2306.02842","repositories_listed":1,"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":0,"phrase":"0 ran · 5 unverified","sample_list":"/paper/improving-conversational-recommendation-4#ran","syntology_url":"https://syntology.ai/paper/2306.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02842"}},"official":{"repos":["rucaibox/cfcrs"],"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/path-specific-counterfactual-fairness-for","slug":"path-specific-counterfactual-fairness-for","title":"Path-Specific Counterfactual Fairness for Recommender Systems","date":"2023-06-05","arxiv_id":"2306.02615","repositories_listed":1,"syntology":null},{"url":"/paper/recagent-a-novel-simulation-paradigm-for","slug":"recagent-a-novel-simulation-paradigm-for","title":"User Behavior Simulation with Large Language Model based Agents","date":"2023-06-05","arxiv_id":"2306.02552","repositories_listed":1,"syntology":null},{"url":"/paper/generative-flow-network-for-listwise","slug":"generative-flow-network-for-listwise","title":"Generative Flow Network for Listwise Recommendation","date":"2023-06-04","arxiv_id":"2306.02239","repositories_listed":1,"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/generative-flow-network-for-listwise#ran","syntology_url":"https://syntology.ai/paper/2306.02239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02239"}},"official":{"repos":["charliemat/gfn4rec"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-transformer-for-recommendation","slug":"graph-transformer-for-recommendation","title":"Graph Transformer for Recommendation","date":"2023-06-04","arxiv_id":"2306.02330","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":3,"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/graph-transformer-for-recommendation#ran","syntology_url":"https://syntology.ai/paper/2306.02330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02330"}},"official":{"repos":["hkuds/gformer"],"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"]}}},{"url":"/paper/large-language-model-augmented-narrative","slug":"large-language-model-augmented-narrative","title":"Large Language Model Augmented Narrative Driven Recommendations","date":"2023-06-04","arxiv_id":"2306.02250","repositories_listed":1,"syntology":null},{"url":"/paper/reducing-popularity-bias-in-recommender","slug":"reducing-popularity-bias-in-recommender","title":"Reducing Popularity Bias in Recommender Systems through AUC-Optimal Negative Sampling","date":"2023-06-02","arxiv_id":"2306.01348","repositories_listed":1,"syntology":null},{"url":"/paper/self-contrastive-learning-for-session-based","slug":"self-contrastive-learning-for-session-based","title":"Self Contrastive Learning for Session-based Recommendation","date":"2023-06-02","arxiv_id":"2306.01266","repositories_listed":1,"syntology":null},{"url":"/paper/cook-gen-robust-generative-modeling-of","slug":"cook-gen-robust-generative-modeling-of","title":"Cook-Gen: Robust Generative Modeling of Cooking Actions from Recipes","date":"2023-06-01","arxiv_id":"2306.01805","repositories_listed":1,"syntology":null},{"url":"/paper/handling-large-discrete-action-spaces-via","slug":"handling-large-discrete-action-spaces-via","title":"Dynamic Neighborhood Construction for Structured Large Discrete Action Spaces","date":"2023-05-31","arxiv_id":"2305.19891","repositories_listed":1,"syntology":null},{"url":"/paper/criteria-tell-you-more-than-ratings-criteria","slug":"criteria-tell-you-more-than-ratings-criteria","title":"Criteria Tell You More than Ratings: Criteria Preference-Aware Light Graph Convolution for Effective Multi-Criteria Recommendation","date":"2023-05-30","arxiv_id":"2305.18885","repositories_listed":1,"syntology":null},{"url":"/paper/robust-reinforcement-learning-objectives-for","slug":"robust-reinforcement-learning-objectives-for","title":"Robust Reinforcement Learning Objectives for Sequential Recommender Systems","date":"2023-05-30","arxiv_id":"2305.18820","repositories_listed":1,"syntology":null},{"url":"/paper/pure-spectral-graph-embeddings-reinterpreting","slug":"pure-spectral-graph-embeddings-reinterpreting","title":"Pure Spectral Graph Embeddings: Reinterpreting Graph Convolution for Top-N Recommendation","date":"2023-05-28","arxiv_id":"2305.18374","repositories_listed":1,"syntology":null},{"url":"/paper/dothash-estimating-set-similarity-metrics-for","slug":"dothash-estimating-set-similarity-metrics-for","title":"DotHash: Estimating Set Similarity Metrics for Link Prediction and Document Deduplication","date":"2023-05-27","arxiv_id":"2305.17310","repositories_listed":1,"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/dothash-estimating-set-similarity-metrics-for#ran","syntology_url":"https://syntology.ai/paper/2305.17310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17310"}},"official":{"repos":["mikeheddes/dothash"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-explainable-conversational","slug":"towards-explainable-conversational","title":"Towards Explainable Conversational Recommender Systems","date":"2023-05-27","arxiv_id":"2305.18363","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-adapter-based-transfer-learning-for","slug":"exploring-adapter-based-transfer-learning-for","title":"Exploring Adapter-based Transfer Learning for Recommender Systems: Empirical Studies and Practical Insights","date":"2023-05-24","arxiv_id":"2305.15036","repositories_listed":1,"syntology":null},{"url":"/paper/gpt4graph-can-large-language-models","slug":"gpt4graph-can-large-language-models","title":"GPT4Graph: Can Large Language Models Understand Graph Structured Data ? An Empirical Evaluation and Benchmarking","date":"2023-05-24","arxiv_id":"2305.15066","repositories_listed":1,"syntology":null},{"url":"/paper/how-graph-convolutions-amplify-popularity","slug":"how-graph-convolutions-amplify-popularity","title":"How Graph Convolutions Amplify Popularity Bias for Recommendation?","date":"2023-05-24","arxiv_id":"2305.14886","repositories_listed":1,"syntology":null},{"url":"/paper/2305-14528","slug":"2305-14528","title":"Function Basis Encoding of Numerical Features in Factorization Machines","date":"2023-05-23","arxiv_id":"2305.14528","repositories_listed":1,"syntology":null},{"url":"/paper/vip5-towards-multimodal-foundation-models-for","slug":"vip5-towards-multimodal-foundation-models-for","title":"VIP5: Towards Multimodal Foundation Models for Recommendation","date":"2023-05-23","arxiv_id":"2305.14302","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vip5-towards-multimodal-foundation-models-for#ran","syntology_url":"https://syntology.ai/paper/2305.14302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14302"}},"official":{"repos":["jeykigung/vip5"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/capturing-conversion-rate-fluctuation-during","slug":"capturing-conversion-rate-fluctuation-during","title":"Capturing Conversion Rate Fluctuation during Sales Promotions: A Novel Historical Data Reuse Approach","date":"2023-05-22","arxiv_id":"2305.12837","repositories_listed":1,"syntology":null},{"url":"/paper/ifedrec-item-guided-federated-aggregation-for","slug":"ifedrec-item-guided-federated-aggregation-for","title":"When Federated Recommendation Meets Cold-Start Problem: Separating Item Attributes and User Interactions","date":"2023-05-22","arxiv_id":"2305.12650","repositories_listed":1,"syntology":null},{"url":"/paper/instant-representation-learning-for","slug":"instant-representation-learning-for","title":"Instant Representation Learning for Recommendation over Large Dynamic Graphs","date":"2023-05-22","arxiv_id":"2305.18622","repositories_listed":1,"syntology":null},{"url":"/paper/multi-behavior-self-supervised-learning-for","slug":"multi-behavior-self-supervised-learning-for","title":"Multi-behavior Self-supervised Learning for Recommendation","date":"2023-05-22","arxiv_id":"2305.18238","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-the-evaluation-for-conversational","slug":"rethinking-the-evaluation-for-conversational","title":"Rethinking the Evaluation for Conversational Recommendation in the Era of Large Language Models","date":"2023-05-22","arxiv_id":"2305.13112","repositories_listed":1,"syntology":{"n":17,"n_ran":5,"n_constructed":1,"n_ran_checked":4,"n_instrument":1,"n_unverified":12,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/rethinking-the-evaluation-for-conversational#ran","syntology_url":"https://syntology.ai/paper/2305.13112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13112"}},"official":{"repos":["rucaibox/ievalm-crs"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/pina-leveraging-side-information-in-extreme","slug":"pina-leveraging-side-information-in-extreme","title":"PINA: Leveraging Side Information in eXtreme Multi-label Classification via Predicted Instance Neighborhood Aggregation","date":"2023-05-21","arxiv_id":"2305.12349","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":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/pina-leveraging-side-information-in-extreme#ran","syntology_url":"https://syntology.ai/paper/2305.12349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12349"}},"official":{"repos":["amzn/pecos"],"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/up5-unbiased-foundation-model-for-fairness","slug":"up5-unbiased-foundation-model-for-fairness","title":"UP5: Unbiased Foundation Model for Fairness-aware Recommendation","date":"2023-05-20","arxiv_id":"2305.12090","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-state-augmentations-for","slug":"contrastive-state-augmentations-for","title":"Contrastive State Augmentations for Reinforcement Learning-Based Recommender Systems","date":"2023-05-18","arxiv_id":"2305.11081","repositories_listed":1,"syntology":null},{"url":"/paper/sustain-ai-a-recommender-system-to-analyze","slug":"sustain-ai-a-recommender-system-to-analyze","title":"sustain.AI: a Recommender System to analyze Sustainability Reports","date":"2023-05-15","arxiv_id":"2305.08711","repositories_listed":1,"syntology":null},{"url":"/paper/decoupled-graph-neural-networks-for-large","slug":"decoupled-graph-neural-networks-for-large","title":"Decoupled Graph Neural Networks for Large Dynamic Graphs","date":"2023-05-14","arxiv_id":"2305.08273","repositories_listed":1,"syntology":null},{"url":"/paper/momo-momentum-models-for-adaptive-learning","slug":"momo-momentum-models-for-adaptive-learning","title":"MoMo: Momentum Models for Adaptive Learning Rates","date":"2023-05-12","arxiv_id":"2305.07583","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":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/momo-momentum-models-for-adaptive-learning#ran","syntology_url":"https://syntology.ai/paper/2305.07583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07583"}},"official":{"repos":["fabian-sp/MoMo"],"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/a-classification-of-feedback-loops-and-their","slug":"a-classification-of-feedback-loops-and-their","title":"A Classification of Feedback Loops and Their Relation to Biases in Automated Decision-Making Systems","date":"2023-05-10","arxiv_id":"2305.06055","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/a-classification-of-feedback-loops-and-their#ran","syntology_url":"https://syntology.ai/paper/2305.06055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06055"}},"official":{"repos":["paganick/feedback-loops-and-biases"],"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/auditing-cross-cultural-consistency-of-human","slug":"auditing-cross-cultural-consistency-of-human","title":"Auditing Cross-Cultural Consistency of Human-Annotated Labels for Recommendation Systems","date":"2023-05-10","arxiv_id":"2305.05917","repositories_listed":1,"syntology":null},{"url":"/paper/dual-intent-enhanced-graph-neural-network-for","slug":"dual-intent-enhanced-graph-neural-network-for","title":"Dual Intent Enhanced Graph Neural Network for Session-based New Item Recommendation","date":"2023-05-10","arxiv_id":"2305.05848","repositories_listed":1,"syntology":null},{"url":"/paper/towards-scalable-adaptive-learning-with-graph","slug":"towards-scalable-adaptive-learning-with-graph","title":"Towards Scalable Adaptive Learning with Graph Neural Networks and Reinforcement Learning","date":"2023-05-10","arxiv_id":"2305.06398","repositories_listed":1,"syntology":null},{"url":"/paper/improving-implicit-feedback-based","slug":"improving-implicit-feedback-based","title":"Improving Implicit Feedback-Based Recommendation through Multi-Behavior Alignment","date":"2023-05-09","arxiv_id":"2305.05585","repositories_listed":1,"syntology":null},{"url":"/paper/popularity-debiasing-from-exposure-to","slug":"popularity-debiasing-from-exposure-to","title":"Popularity Debiasing from Exposure to Interaction in Collaborative Filtering","date":"2023-05-09","arxiv_id":"2305.05204","repositories_listed":1,"syntology":null},{"url":"/paper/recommender-systems-with-generative-retrieval","slug":"recommender-systems-with-generative-retrieval","title":"Recommender Systems with Generative Retrieval","date":"2023-05-08","arxiv_id":"2305.05065","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/recommender-systems-with-generative-retrieval#ran","syntology_url":"https://syntology.ai/paper/2305.05065","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05065"}},"official":null}},{"url":"/paper/miread-simple-method-for-learning-high","slug":"miread-simple-method-for-learning-high","title":"MIReAD: Simple Method for Learning High-quality Representations from Scientific Documents","date":"2023-05-07","arxiv_id":"2305.04177","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/miread-simple-method-for-learning-high#ran","syntology_url":"https://syntology.ai/paper/2305.04177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04177"}},"official":{"repos":["arazd/miread"],"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":["official"]}}},{"url":"/paper/attacking-pre-trained-recommendation","slug":"attacking-pre-trained-recommendation","title":"Attacking Pre-trained Recommendation","date":"2023-05-06","arxiv_id":"2305.03995","repositories_listed":1,"syntology":null},{"url":"/paper/multi-grained-hypergraph-interest-modeling","slug":"multi-grained-hypergraph-interest-modeling","title":"Multi-grained Hypergraph Interest Modeling for Conversational Recommendation","date":"2023-05-04","arxiv_id":"2305.04798","repositories_listed":1,"syntology":null},{"url":"/paper/towards-hierarchical-policy-learning-for","slug":"towards-hierarchical-policy-learning-for","title":"Towards Hierarchical Policy Learning for Conversational Recommendation with Hypergraph-based Reinforcement Learning","date":"2023-05-04","arxiv_id":"2305.02575","repositories_listed":1,"syntology":null},{"url":"/paper/maximizing-submodular-functions-for","slug":"maximizing-submodular-functions-for","title":"Maximizing Submodular Functions for Recommendation in the Presence of Biases","date":"2023-05-03","arxiv_id":"2305.02806","repositories_listed":1,"syntology":null},{"url":"/paper/sim2rec-a-simulator-based-decision-making","slug":"sim2rec-a-simulator-based-decision-making","title":"Sim2Rec: A Simulator-based Decision-making Approach to Optimize Real-World Long-term User Engagement in Sequential Recommender Systems","date":"2023-05-03","arxiv_id":"2305.04832","repositories_listed":1,"syntology":null},{"url":"/paper/uncovering-chatgpt-s-capabilities-in","slug":"uncovering-chatgpt-s-capabilities-in","title":"Uncovering ChatGPT's Capabilities in Recommender Systems","date":"2023-05-03","arxiv_id":"2305.02182","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/uncovering-chatgpt-s-capabilities-in#ran","syntology_url":"https://syntology.ai/paper/2305.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02182"}},"official":{"repos":["rainym00d/llm4rs"],"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/improving-rating-prediction-in-multi-criteria","slug":"improving-rating-prediction-in-multi-criteria","title":"Improving Rating Prediction in Multi-Criteria Recommender Systems via a Collective Factor Model","date":"2023-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/performative-prediction-with-bandit-feedback","slug":"performative-prediction-with-bandit-feedback","title":"Performative Prediction with Bandit Feedback: Learning through Reparameterization","date":"2023-05-01","arxiv_id":"2305.01094","repositories_listed":1,"syntology":null},{"url":"/paper/tallrec-an-effective-and-efficient-tuning","slug":"tallrec-an-effective-and-efficient-tuning","title":"TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendation","date":"2023-04-30","arxiv_id":"2305.00447","repositories_listed":1,"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/tallrec-an-effective-and-efficient-tuning#ran","syntology_url":"https://syntology.ai/paper/2305.00447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00447"}},"official":{"repos":["sai990323/tallrec"],"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/towards-explainable-collaborative-filtering","slug":"towards-explainable-collaborative-filtering","title":"Towards Explainable Collaborative Filtering with Taste Clusters Learning","date":"2023-04-27","arxiv_id":"2304.13937","repositories_listed":1,"syntology":null}],"record_sha256":"ad61232b321ce7ec757035a7febd07d53413357f5c6468cbb881d50d58011f79","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}