{"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/9","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":9,"pages_in_order":61,"rows_per_page":100,"rows":[801,900],"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/8","next":"/task/recommendation-systems/papers/10","papers":[{"url":"/paper/doubly-calibrated-estimator-for","slug":"doubly-calibrated-estimator-for","title":"Doubly Calibrated Estimator for Recommendation on Data Missing Not At Random","date":"2024-02-26","arxiv_id":"2403.00817","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-graph-variational-auto-encoder","slug":"disentangled-graph-variational-auto-encoder","title":"Disentangled Graph Variational Auto-Encoder for Multimodal Recommendation with Interpretability","date":"2024-02-25","arxiv_id":"2402.16110","repositories_listed":1,"syntology":null},{"url":"/paper/easyrl4rec-a-user-friendly-code-library-for","slug":"easyrl4rec-a-user-friendly-code-library-for","title":"EasyRL4Rec: An Easy-to-use Library for Reinforcement Learning Based Recommender Systems","date":"2024-02-23","arxiv_id":"2402.15164","repositories_listed":1,"syntology":null},{"url":"/paper/item-side-fairness-of-large-language-model","slug":"item-side-fairness-of-large-language-model","title":"Item-side Fairness of Large Language Model-based Recommendation System","date":"2024-02-23","arxiv_id":"2402.15215","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/item-side-fairness-of-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2402.15215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15215"}},"official":{"repos":["jiangm-c/ifairlrs"],"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/recwizard-a-toolkit-for-conversational","slug":"recwizard-a-toolkit-for-conversational","title":"RecWizard: A Toolkit for Conversational Recommendation with Modular, Portable Models and Interactive User Interface","date":"2024-02-23","arxiv_id":"2402.15591","repositories_listed":1,"syntology":{"n":13,"n_ran":7,"n_constructed":5,"n_ran_checked":5,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":13,"phrase":"7 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/recwizard-a-toolkit-for-conversational#ran","syntology_url":"https://syntology.ai/paper/2402.15591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15591"}},"official":{"repos":["mcauley-lab/recwizard"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/merrec-a-large-scale-multipurpose-mercari","slug":"merrec-a-large-scale-multipurpose-mercari","title":"MerRec: A Large-scale Multipurpose Mercari Dataset for Consumer-to-Consumer Recommendation Systems","date":"2024-02-22","arxiv_id":"2402.14230","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-and-provably-fair-exposure-control","slug":"scalable-and-provably-fair-exposure-control","title":"Scalable and Provably Fair Exposure Control for Large-Scale Recommender Systems","date":"2024-02-22","arxiv_id":"2402.14369","repositories_listed":1,"syntology":null},{"url":"/paper/flame-self-supervised-low-resource-taxonomy","slug":"flame-self-supervised-low-resource-taxonomy","title":"FLAME: Self-Supervised Low-Resource Taxonomy Expansion using Large Language Models","date":"2024-02-21","arxiv_id":"2402.13623","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 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/flame-self-supervised-low-resource-taxonomy#ran","syntology_url":"https://syntology.ai/paper/2402.13623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13623"}},"official":{"repos":["sahilmishra0012/flame"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/general-debiasing-for-graph-based","slug":"general-debiasing-for-graph-based","title":"General Debiasing for Graph-based Collaborative Filtering via Adversarial Graph Dropout","date":"2024-02-21","arxiv_id":"2402.13769","repositories_listed":1,"syntology":null},{"url":"/paper/linear-time-graph-neural-networks-for","slug":"linear-time-graph-neural-networks-for","title":"Linear-Time Graph Neural Networks for Scalable Recommendations","date":"2024-02-21","arxiv_id":"2402.13973","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":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/linear-time-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2402.13973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13973"}},"official":{"repos":["qwq2000/thewebconf24-ltgnn-pytorch"],"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/llm4sbr-a-lightweight-and-effective-framework","slug":"llm4sbr-a-lightweight-and-effective-framework","title":"Multi-view Intent Learning and Alignment with Large Language Models for Session-based Recommendation","date":"2024-02-21","arxiv_id":"2402.13840","repositories_listed":1,"syntology":null},{"url":"/paper/distributionally-robust-graph-based","slug":"distributionally-robust-graph-based","title":"Distributionally Robust Graph-based Recommendation System","date":"2024-02-20","arxiv_id":"2402.12994","repositories_listed":1,"syntology":null},{"url":"/paper/mini-hes-a-parallelizable-second-order-latent","slug":"mini-hes-a-parallelizable-second-order-latent","title":"Mini-Hes: A Parallelizable Second-order Latent Factor Analysis Model","date":"2024-02-19","arxiv_id":"2402.11948","repositories_listed":1,"syntology":null},{"url":"/paper/neighborhood-enhanced-supervised-contrastive","slug":"neighborhood-enhanced-supervised-contrastive","title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","date":"2024-02-18","arxiv_id":"2402.11523","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/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}},{"url":"/paper/stealthy-attack-on-large-language-model-based","slug":"stealthy-attack-on-large-language-model-based","title":"Stealthy Attack on Large Language Model based Recommendation","date":"2024-02-18","arxiv_id":"2402.14836","repositories_listed":1,"syntology":null},{"url":"/paper/mirror-gradient-towards-robust-multimodal","slug":"mirror-gradient-towards-robust-multimodal","title":"Mirror Gradient: Towards Robust Multimodal Recommender Systems via Exploring Flat Local Minima","date":"2024-02-17","arxiv_id":"2402.11262","repositories_listed":1,"syntology":null},{"url":"/paper/fairsync-ensuring-amortized-group-exposure-in","slug":"fairsync-ensuring-amortized-group-exposure-in","title":"FairSync: Ensuring Amortized Group Exposure in Distributed Recommendation Retrieval","date":"2024-02-16","arxiv_id":"2402.10628","repositories_listed":1,"syntology":null},{"url":"/paper/umair-fps-user-aware-multi-modal-animation","slug":"umair-fps-user-aware-multi-modal-animation","title":"UMAIR-FPS: User-aware Multi-modal Animation Illustration Recommendation Fusion with Painting Style","date":"2024-02-16","arxiv_id":"2402.10381","repositories_listed":1,"syntology":null},{"url":"/paper/from-variability-to-stability-advancing","slug":"from-variability-to-stability-advancing","title":"From Variability to Stability: Advancing RecSys Benchmarking Practices","date":"2024-02-15","arxiv_id":"2402.09766","repositories_listed":1,"syntology":null},{"url":"/paper/llm-based-federated-recommendation","slug":"llm-based-federated-recommendation","title":"A Federated Framework for LLM-based Recommendation","date":"2024-02-15","arxiv_id":"2402.09959","repositories_listed":1,"syntology":null},{"url":"/paper/node-duplication-improves-cold-start-link","slug":"node-duplication-improves-cold-start-link","title":"Node Duplication Improves Cold-start Link Prediction","date":"2024-02-15","arxiv_id":"2402.09711","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"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) · 2 unverified","sample_list":"/paper/node-duplication-improves-cold-start-link#ran","syntology_url":"https://syntology.ai/paper/2402.09711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09711"}},"official":{"repos":["snap-research/nodedup"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/personalized-large-language-models","slug":"personalized-large-language-models","title":"Personalized Large Language Models","date":"2024-02-14","arxiv_id":"2402.09269","repositories_listed":1,"syntology":null},{"url":"/paper/chain-of-layer-iteratively-prompting-large","slug":"chain-of-layer-iteratively-prompting-large","title":"Chain-of-Layer: Iteratively Prompting Large Language Models for Taxonomy Induction from Limited Examples","date":"2024-02-12","arxiv_id":"2402.07386","repositories_listed":1,"syntology":null},{"url":"/paper/multi-behavior-collaborative-filtering-with","slug":"multi-behavior-collaborative-filtering-with","title":"Multi-Behavior Collaborative Filtering with Partial Order Graph Convolutional Networks","date":"2024-02-12","arxiv_id":"2402.07659","repositories_listed":1,"syntology":null},{"url":"/paper/natural-language-user-profiles-for","slug":"natural-language-user-profiles-for","title":"Transparent and Scrutable Recommendations Using Natural Language User Profiles","date":"2024-02-08","arxiv_id":"2402.05810","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-tree-structured-knowledge-graph","slug":"hierarchical-tree-structured-knowledge-graph","title":"Hierarchical Tree-structured Knowledge Graph For Academic Insight Survey","date":"2024-02-07","arxiv_id":"2402.04854","repositories_listed":1,"syntology":null},{"url":"/paper/on-practical-diversified-recommendation-with","slug":"on-practical-diversified-recommendation-with","title":"On Practical Diversified Recommendation with Controllable Category Diversity Framework","date":"2024-02-06","arxiv_id":"2402.03801","repositories_listed":1,"syntology":null},{"url":"/paper/intersectional-two-sided-fairness-in","slug":"intersectional-two-sided-fairness-in","title":"Intersectional Two-sided Fairness in Recommendation","date":"2024-02-05","arxiv_id":"2402.02816","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-model-distilling-medication","slug":"large-language-model-distilling-medication","title":"Large Language Model Distilling Medication Recommendation Model","date":"2024-02-05","arxiv_id":"2402.02803","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-cross-domain-recommendation","slug":"diffusion-cross-domain-recommendation","title":"Diffusion Cross-domain Recommendation","date":"2024-02-03","arxiv_id":"2402.02182","repositories_listed":1,"syntology":null},{"url":"/paper/off-policy-evaluation-of-slate-bandit","slug":"off-policy-evaluation-of-slate-bandit","title":"Off-Policy Evaluation of Slate Bandit Policies via Optimizing Abstraction","date":"2024-02-03","arxiv_id":"2402.02171","repositories_listed":1,"syntology":null},{"url":"/paper/a-personalized-framework-for-consumer-and","slug":"a-personalized-framework-for-consumer-and","title":"A Personalized Framework for Consumer and Producer Group Fairness Optimization in Recommender Systems","date":"2024-02-01","arxiv_id":"2402.00485","repositories_listed":1,"syntology":null},{"url":"/paper/cf4j-collaborative-filtering-for-java","slug":"cf4j-collaborative-filtering-for-java","title":"CF4J: Collaborative Filtering for Java","date":"2024-02-01","arxiv_id":"2402.01008","repositories_listed":1,"syntology":null},{"url":"/paper/heterophily-aware-fair-recommendation-using","slug":"heterophily-aware-fair-recommendation-using","title":"Heterophily-Aware Fair Recommendation using Graph Convolutional Networks","date":"2024-01-31","arxiv_id":"2402.03365","repositories_listed":1,"syntology":null},{"url":"/paper/lorec-large-language-model-for-robust","slug":"lorec-large-language-model-for-robust","title":"LoRec: Large Language Model for Robust Sequential Recommendation against Poisoning Attacks","date":"2024-01-31","arxiv_id":"2401.17723","repositories_listed":1,"syntology":null},{"url":"/paper/taxonomy-of-mathematical-plagiarism","slug":"taxonomy-of-mathematical-plagiarism","title":"Taxonomy of Mathematical Plagiarism","date":"2024-01-30","arxiv_id":"2401.16969","repositories_listed":1,"syntology":null},{"url":"/paper/future-impact-decomposition-in-request-level","slug":"future-impact-decomposition-in-request-level","title":"Future Impact Decomposition in Request-level Recommendations","date":"2024-01-29","arxiv_id":"2401.16108","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/future-impact-decomposition-in-request-level#ran","syntology_url":"https://syntology.ai/paper/2401.16108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16108"}},"official":{"repos":["wangxiaobei565/itemdecomposition"],"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/privacy-preserving-cross-domain-sequential","slug":"privacy-preserving-cross-domain-sequential","title":"Privacy-Preserving Cross-Domain Sequential Recommendation","date":"2024-01-27","arxiv_id":"2401.15369","repositories_listed":1,"syntology":null},{"url":"/paper/macro-graph-neural-networks-for-online","slug":"macro-graph-neural-networks-for-online","title":"Macro Graph Neural Networks for Online Billion-Scale Recommender Systems","date":"2024-01-26","arxiv_id":"2401.14939","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/macro-graph-neural-networks-for-online#ran","syntology_url":"https://syntology.ai/paper/2401.14939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14939"}},"official":{"repos":["yuanchenbei/macgnn"],"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/parameter-efficient-conversational","slug":"parameter-efficient-conversational","title":"Parameter-Efficient Conversational Recommender System as a Language Processing Task","date":"2024-01-25","arxiv_id":"2401.14194","repositories_listed":1,"syntology":null},{"url":"/paper/robustness-in-fairness-against-edge-level","slug":"robustness-in-fairness-against-edge-level","title":"Robustness in Fairness against Edge-level Perturbations in GNN-based Recommendation","date":"2024-01-24","arxiv_id":"2401.13823","repositories_listed":1,"syntology":null},{"url":"/paper/securing-recommender-system-via-cooperative","slug":"securing-recommender-system-via-cooperative","title":"Securing Recommender System via Cooperative Training","date":"2024-01-23","arxiv_id":"2401.12700","repositories_listed":1,"syntology":null},{"url":"/paper/fedrkg-a-privacy-preserving-federated","slug":"fedrkg-a-privacy-preserving-federated","title":"FedRKG: A Privacy-preserving Federated Recommendation Framework via Knowledge Graph Enhancement","date":"2024-01-20","arxiv_id":"2401.11089","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-rmse-and-mae-introducing-eauc-to","slug":"beyond-rmse-and-mae-introducing-eauc-to","title":"Beyond RMSE and MAE: Introducing EAUC to unmask hidden bias and unfairness in dyadic regression models","date":"2024-01-19","arxiv_id":"2401.10690","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-biases-in-chatgpt-based","slug":"understanding-biases-in-chatgpt-based","title":"Understanding Biases in ChatGPT-based Recommender Systems: Provider Fairness, Temporal Stability, and Recency","date":"2024-01-19","arxiv_id":"2401.10545","repositories_listed":1,"syntology":null},{"url":"/paper/efficientrec-an-unlimited-user-item-scale","slug":"efficientrec-an-unlimited-user-item-scale","title":"EfficientRec an unlimited user-item scale recommendation system based on clustering and users interaction embedding profile","date":"2024-01-18","arxiv_id":"2401.09693","repositories_listed":1,"syntology":null},{"url":"/paper/uoep-user-oriented-exploration-policy-for","slug":"uoep-user-oriented-exploration-policy-for","title":"UOEP: User-Oriented Exploration Policy for Enhancing Long-Term User Experiences in Recommender Systems","date":"2024-01-17","arxiv_id":"2401.09034","repositories_listed":1,"syntology":null},{"url":"/paper/denoising-diffusion-recommender-model","slug":"denoising-diffusion-recommender-model","title":"Denoising Diffusion Recommender Model","date":"2024-01-13","arxiv_id":"2401.06982","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/denoising-diffusion-recommender-model#ran","syntology_url":"https://syntology.ai/paper/2401.06982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06982"}},"official":{"repos":["polaris-jz/ddrm"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ada-retrieval-an-adaptive-multi-round","slug":"ada-retrieval-an-adaptive-multi-round","title":"Ada-Retrieval: An Adaptive Multi-Round Retrieval Paradigm for Sequential Recommendations","date":"2024-01-12","arxiv_id":"2401.06633","repositories_listed":1,"syntology":{"n":14,"n_ran":8,"n_constructed":4,"n_ran_checked":7,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":14,"phrase":"8 ran (of which 4 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/ada-retrieval-an-adaptive-multi-round#ran","syntology_url":"https://syntology.ai/paper/2401.06633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06633"}},"official":{"repos":["ll0ruc/ada-retrieval"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":4,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/mapping-transformer-leveraged-embeddings-for","slug":"mapping-transformer-leveraged-embeddings-for","title":"Mapping Transformer Leveraged Embeddings for Cross-Lingual Document Representation","date":"2024-01-12","arxiv_id":"2401.06583","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-reinforcement-learning-with-a","slug":"personalized-reinforcement-learning-with-a","title":"Personalized Reinforcement Learning with a Budget of Policies","date":"2024-01-12","arxiv_id":"2401.06514","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-emotion-and-sentiment-modelling","slug":"probabilistic-emotion-and-sentiment-modelling","title":"Probabilistic emotion and sentiment modelling of patient-reported experiences","date":"2024-01-09","arxiv_id":"2401.04367","repositories_listed":1,"syntology":null},{"url":"/paper/the-impact-of-differential-privacy-on","slug":"the-impact-of-differential-privacy-on","title":"The Impact of Differential Privacy on Recommendation Accuracy and Popularity Bias","date":"2024-01-08","arxiv_id":"2401.03883","repositories_listed":1,"syntology":null},{"url":"/paper/poisoning-attacks-against-recommender-systems","slug":"poisoning-attacks-against-recommender-systems","title":"Poisoning Attacks against Recommender Systems: A Survey","date":"2024-01-03","arxiv_id":"2401.01527","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"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) · 0 unverified","sample_list":"/paper/poisoning-attacks-against-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/2401.01527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.01527"}},"official":{"repos":["coderwzw/arlib"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distillation-is-all-you-need-for-practically","slug":"distillation-is-all-you-need-for-practically","title":"Curriculum-scheduled Knowledge Distillation from Multiple Pre-trained Teachers for Multi-domain Sequential Recommendation","date":"2024-01-01","arxiv_id":"2401.00797","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":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/distillation-is-all-you-need-for-practically#ran","syntology_url":"https://syntology.ai/paper/2401.00797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00797"}},"official":{"repos":["rucaibox/ckd-mdsr"],"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/dual-space-hierarchical-learning-for-goal-1","slug":"dual-space-hierarchical-learning-for-goal-1","title":"Dual-space Hierarchical Learning for Goal-guided Conversational Recommendation","date":"2023-12-30","arxiv_id":"2401.00272","repositories_listed":1,"syntology":null},{"url":"/paper/diffkg-knowledge-graph-diffusion-model-for","slug":"diffkg-knowledge-graph-diffusion-model-for","title":"DiffKG: Knowledge Graph Diffusion Model for Recommendation","date":"2023-12-28","arxiv_id":"2312.16890","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/diffkg-knowledge-graph-diffusion-model-for#ran","syntology_url":"https://syntology.ai/paper/2312.16890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16890"}},"official":{"repos":["hkuds/diffkg"],"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/efficient-high-quality-clustering-for-large","slug":"efficient-high-quality-clustering-for-large","title":"Efficient High-Quality Clustering for Large Bipartite Graphs","date":"2023-12-28","arxiv_id":"2312.16926","repositories_listed":1,"syntology":null},{"url":"/paper/tspp-a-unified-benchmarking-tool-for-time","slug":"tspp-a-unified-benchmarking-tool-for-time","title":"TSPP: A Unified Benchmarking Tool for Time-series Forecasting","date":"2023-12-28","arxiv_id":"2312.17100","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-of-evaluation","slug":"a-comprehensive-survey-of-evaluation","title":"A Comprehensive Survey of Evaluation Techniques for Recommendation Systems","date":"2023-12-26","arxiv_id":"2312.16015","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/a-comprehensive-survey-of-evaluation#ran","syntology_url":"https://syntology.ai/paper/2312.16015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16015"}},"official":{"repos":["aryan-jadon/evaluation-metrics-for-recommendation-systems"],"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/recranker-instruction-tuning-large-language","slug":"recranker-instruction-tuning-large-language","title":"RecRanker: Instruction Tuning Large Language Model as Ranker for Top-k Recommendation","date":"2023-12-26","arxiv_id":"2312.16018","repositories_listed":1,"syntology":null},{"url":"/paper/preliminary-study-on-incremental-learning-for","slug":"preliminary-study-on-incremental-learning-for","title":"Preliminary Study on Incremental Learning for Large Language Model-based Recommender Systems","date":"2023-12-25","arxiv_id":"2312.15599","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-the-potential-of-large-language","slug":"unlocking-the-potential-of-large-language","title":"Unlocking the Potential of Large Language Models for Explainable Recommendations","date":"2023-12-25","arxiv_id":"2312.15661","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unlocking-the-potential-of-large-language#ran","syntology_url":"https://syntology.ai/paper/2312.15661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.15661"}},"official":{"repos":["godfire66666/llm_rec_explanation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/user-consented-federated-recommender-system","slug":"user-consented-federated-recommender-system","title":"User Consented Federated Recommender System Against Personalized Attribute Inference Attack","date":"2023-12-23","arxiv_id":"2312.16203","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/user-consented-federated-recommender-system#ran","syntology_url":"https://syntology.ai/paper/2312.16203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16203"}},"official":{"repos":["hkust-knowcomp/uc-fedrec"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/empowering-few-shot-recommender-systems-with","slug":"empowering-few-shot-recommender-systems-with","title":"Empowering Few-Shot Recommender Systems with Large Language Models -- Enhanced Representations","date":"2023-12-21","arxiv_id":"2312.13557","repositories_listed":1,"syntology":null},{"url":"/paper/social-recommendation-through-heterogeneous","slug":"social-recommendation-through-heterogeneous","title":"Social Recommendation through Heterogeneous Graph Modeling of the Long-term and Short-term Preference Defined by Dynamic Time Spans","date":"2023-12-21","arxiv_id":"2312.14306","repositories_listed":1,"syntology":null},{"url":"/paper/dgcluster-a-neural-framework-for-attributed","slug":"dgcluster-a-neural-framework-for-attributed","title":"DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization","date":"2023-12-20","arxiv_id":"2312.12697","repositories_listed":1,"syntology":null},{"url":"/paper/vita-carefully-chosen-and-weighted-less-is","slug":"vita-carefully-chosen-and-weighted-less-is","title":"VITA: 'Carefully Chosen and Weighted Less' Is Better in Medication Recommendation","date":"2023-12-19","arxiv_id":"2312.12100","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graphs-and-pre-trained-language","slug":"knowledge-graphs-and-pre-trained-language","title":"Knowledge Graphs and Pre-trained Language Models enhanced Representation Learning for Conversational Recommender Systems","date":"2023-12-18","arxiv_id":"2312.10967","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-framework-for-multi-domain-ctr","slug":"a-unified-framework-for-multi-domain-ctr","title":"A Unified Framework for Multi-Domain CTR Prediction via Large Language Models","date":"2023-12-17","arxiv_id":"2312.10743","repositories_listed":1,"syntology":null},{"url":"/paper/lightgcn-evaluated-and-enhanced","slug":"lightgcn-evaluated-and-enhanced","title":"LightGCN: Evaluated and Enhanced","date":"2023-12-17","arxiv_id":"2312.16183","repositories_listed":1,"syntology":null},{"url":"/paper/do-similar-entities-have-similar-embeddings","slug":"do-similar-entities-have-similar-embeddings","title":"Do Similar Entities have Similar Embeddings?","date":"2023-12-16","arxiv_id":"2312.10370","repositories_listed":1,"syntology":null},{"url":"/paper/recprompt-a-prompt-tuning-framework-for-news","slug":"recprompt-a-prompt-tuning-framework-for-news","title":"RecPrompt: A Self-tuning Prompting Framework for News Recommendation Using Large Language Models","date":"2023-12-16","arxiv_id":"2312.10463","repositories_listed":1,"syntology":null},{"url":"/paper/cetn-contrast-enhanced-through-network-for","slug":"cetn-contrast-enhanced-through-network-for","title":"CETN: Contrast-enhanced Through Network for CTR Prediction","date":"2023-12-15","arxiv_id":"2312.09715","repositories_listed":1,"syntology":null},{"url":"/paper/monet-modality-embracing-graph-convolutional","slug":"monet-modality-embracing-graph-convolutional","title":"MONET: Modality-Embracing Graph Convolutional Network and Target-Aware Attention for Multimedia Recommendation","date":"2023-12-15","arxiv_id":"2312.09511","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modality-is-all-you-need-for","slug":"multi-modality-is-all-you-need-for","title":"Multi-Modality is All You Need for Transferable Recommender Systems","date":"2023-12-15","arxiv_id":"2312.09602","repositories_listed":1,"syntology":null},{"url":"/paper/finding-paths-for-explainable-mooc","slug":"finding-paths-for-explainable-mooc","title":"Finding Paths for Explainable MOOC Recommendation: A Learner Perspective","date":"2023-12-11","arxiv_id":"2312.10082","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":12,"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) · 1 unverified","sample_list":"/paper/finding-paths-for-explainable-mooc#ran","syntology_url":"https://syntology.ai/paper/2312.10082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10082"}},"official":{"repos":["epfl-ml4ed/courserec"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/modyn-a-platform-for-model-training-on","slug":"modyn-a-platform-for-model-training-on","title":"Modyn: Data-Centric Machine Learning Pipeline Orchestration","date":"2023-12-11","arxiv_id":"2312.06254","repositories_listed":1,"syntology":null},{"url":"/paper/proxy-based-item-representation-for-attribute","slug":"proxy-based-item-representation-for-attribute","title":"Proxy-based Item Representation for Attribute and Context-aware Recommendation","date":"2023-12-11","arxiv_id":"2312.06145","repositories_listed":1,"syntology":null},{"url":"/paper/recjpq-training-large-catalogue-sequential","slug":"recjpq-training-large-catalogue-sequential","title":"RecJPQ: Training Large-Catalogue Sequential Recommenders","date":"2023-12-11","arxiv_id":"2312.06165","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-collaborative-filtering-for-matrix","slug":"dynamic-collaborative-filtering-for-matrix","title":"Dynamic Collaborative Filtering for Matrix- and Tensor-based Recommender Systems","date":"2023-12-04","arxiv_id":"2312.10064","repositories_listed":1,"syntology":null},{"url":"/paper/normed-spaces-for-graph-embedding","slug":"normed-spaces-for-graph-embedding","title":"Normed Spaces for Graph Embedding","date":"2023-12-03","arxiv_id":"2312.01502","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/normed-spaces-for-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2312.01502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01502"}},"official":{"repos":["andyweizhao/graphs-normed-spaces"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/poisoning-attacks-against-contrastive","slug":"poisoning-attacks-against-contrastive","title":"Unveiling Vulnerabilities of Contrastive Recommender Systems to Poisoning Attacks","date":"2023-11-30","arxiv_id":"2311.18244","repositories_listed":1,"syntology":null},{"url":"/paper/sardine-a-simulator-for-automated","slug":"sardine-a-simulator-for-automated","title":"SARDINE: A Simulator for Automated Recommendation in Dynamic and Interactive Environments","date":"2023-11-28","arxiv_id":"2311.16586","repositories_listed":1,"syntology":null},{"url":"/paper/robust-basket-recommendation-via-noise","slug":"robust-basket-recommendation-via-noise","title":"Robust Basket Recommendation via Noise-tolerated Graph Contrastive Learning","date":"2023-11-27","arxiv_id":"2311.16334","repositories_listed":1,"syntology":null},{"url":"/paper/hide-your-model-a-parameter-transmission-free","slug":"hide-your-model-a-parameter-transmission-free","title":"Hide Your Model: A Parameter Transmission-free Federated Recommender System","date":"2023-11-25","arxiv_id":"2311.14968","repositories_listed":1,"syntology":null},{"url":"/paper/recexplainer-aligning-large-language-models","slug":"recexplainer-aligning-large-language-models","title":"RecExplainer: Aligning Large Language Models for Explaining Recommendation Models","date":"2023-11-18","arxiv_id":"2311.10947","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/recexplainer-aligning-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2311.10947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.10947"}},"official":{"repos":["microsoft/recai"],"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/collaborative-word-based-pre-trained-item","slug":"collaborative-word-based-pre-trained-item","title":"Collaborative Word-based Pre-trained Item Representation for Transferable Recommendation","date":"2023-11-17","arxiv_id":"2311.10501","repositories_listed":1,"syntology":null},{"url":"/paper/group-aware-interest-disentangled-dual","slug":"group-aware-interest-disentangled-dual","title":"Group-Aware Interest Disentangled Dual-Training for Personalized Recommendation","date":"2023-11-16","arxiv_id":"2311.09577","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-plugins-enhancing-large-language","slug":"knowledge-plugins-enhancing-large-language","title":"Knowledge Plugins: Enhancing Large Language Models for Domain-Specific Recommendations","date":"2023-11-16","arxiv_id":"2311.10779","repositories_listed":1,"syntology":null},{"url":"/paper/adapting-large-language-models-by-integrating","slug":"adapting-large-language-models-by-integrating","title":"Adapting Large Language Models by Integrating Collaborative Semantics for Recommendation","date":"2023-11-15","arxiv_id":"2311.09049","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adapting-large-language-models-by-integrating#ran","syntology_url":"https://syntology.ai/paper/2311.09049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.09049"}},"official":{"repos":["rucaibox/lc-rec"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-adaptive-denoising-recommendation","slug":"an-adaptive-denoising-recommendation","title":"An adaptive denoising recommendation algorithm for causal separation bias","date":"2023-11-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ibgr-influence-based-group-recommendation","slug":"ibgr-influence-based-group-recommendation","title":"IBGR: Influence-Based Group Recommendation system","date":"2023-11-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mixed-attention-network-for-cross-domain","slug":"mixed-attention-network-for-cross-domain","title":"Mixed Attention Network for Cross-domain Sequential Recommendation","date":"2023-11-14","arxiv_id":"2311.08272","repositories_listed":1,"syntology":null},{"url":"/paper/do-llms-implicitly-exhibit-user","slug":"do-llms-implicitly-exhibit-user","title":"A Study of Implicit Ranking Unfairness in Large Language Models","date":"2023-11-13","arxiv_id":"2311.07054","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"7 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/do-llms-implicitly-exhibit-user#ran","syntology_url":"https://syntology.ai/paper/2311.07054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.07054"}},"official":{"repos":["xuchen0427/implicit_rank_unfairness"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dpr-an-algorithm-mitigate-bias-accumulation","slug":"dpr-an-algorithm-mitigate-bias-accumulation","title":"DPR: An Algorithm Mitigate Bias Accumulation in Recommendation feedback loops","date":"2023-11-10","arxiv_id":"2311.05864","repositories_listed":1,"syntology":null},{"url":"/paper/feir-quantifying-and-reducing-envy-and","slug":"feir-quantifying-and-reducing-envy-and","title":"FEIR: Quantifying and Reducing Envy and Inferiority for Fair Recommendation of Limited Resources","date":"2023-11-08","arxiv_id":"2311.04542","repositories_listed":1,"syntology":null},{"url":"/paper/from-input-to-output-a-multi-layer-knowledge","slug":"from-input-to-output-a-multi-layer-knowledge","title":"Preference-Consistent Knowledge Distillation for Recommender System","date":"2023-11-08","arxiv_id":"2311.04549","repositories_listed":1,"syntology":null},{"url":"/paper/towards-open-world-cross-domain-sequential","slug":"towards-open-world-cross-domain-sequential","title":"Towards Open-world Cross-Domain Sequential Recommendation: A Model-Agnostic Contrastive Denoising Approach","date":"2023-11-08","arxiv_id":"2311.04760","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/towards-open-world-cross-domain-sequential#ran","syntology_url":"https://syntology.ai/paper/2311.04760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04760"}},"official":{"repos":["wujiangxu/macd"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/apgl4sr-a-generic-framework-with-adaptive-and","slug":"apgl4sr-a-generic-framework-with-adaptive-and","title":"APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation","date":"2023-11-06","arxiv_id":"2311.02816","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"5 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/apgl4sr-a-generic-framework-with-adaptive-and#ran","syntology_url":"https://syntology.ai/paper/2311.02816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02816"}},"official":{"repos":["graph-team/apgl4sr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"254b88da73e8a5d2349cf59614feb7242b34ff26bfc325feb7dd6a7bb34fb4d4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}