{"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/5","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":5,"pages_in_order":61,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/recommendation-systems/papers/6","papers":[{"url":"/paper/federated-semantic-learning-for-privacy","slug":"federated-semantic-learning-for-privacy","title":"Federated Semantic Learning for Privacy-preserving Cross-domain Recommendation","date":"2025-03-29","arxiv_id":"2503.23026","repositories_listed":1,"syntology":null},{"url":"/paper/reproducibility-companion-paper-in-processing","slug":"reproducibility-companion-paper-in-processing","title":"Reproducibility Companion Paper:In-processing User Constrained Dominant Sets for User-Oriented Fairness in Recommender Systems","date":"2025-03-29","arxiv_id":"2503.23040","repositories_listed":1,"syntology":null},{"url":"/paper/reproducibility-companion-paper-making-users","slug":"reproducibility-companion-paper-making-users","title":"Reproducibility Companion Paper: Making Users Indistinguishable: Attribute-wise Unlearning in Recommender Systems","date":"2025-03-29","arxiv_id":"2503.23032","repositories_listed":1,"syntology":null},{"url":"/paper/empowering-retrieval-based-conversational","slug":"empowering-retrieval-based-conversational","title":"Empowering Retrieval-based Conversational Recommendation with Contrasting User Preferences","date":"2025-03-27","arxiv_id":"2503.22005","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/empowering-retrieval-based-conversational#ran","syntology_url":"https://syntology.ai/paper/2503.22005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.22005"}},"official":{"repos":["kookeej/coral"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improvement-graph-convolution-collaborative","slug":"improvement-graph-convolution-collaborative","title":"Improvement Graph Convolution Collaborative Filtering with Weighted addition input","date":"2025-03-27","arxiv_id":"2503.21468","repositories_listed":1,"syntology":null},{"url":"/paper/rallrec-retrieval-augmented-large-language","slug":"rallrec-retrieval-augmented-large-language","title":"RALLRec+: Retrieval Augmented Large Language Model Recommendation with Reasoning","date":"2025-03-26","arxiv_id":"2503.20430","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-review-on-hashtag","slug":"a-comprehensive-review-on-hashtag","title":"A Comprehensive Review on Hashtag Recommendation: From Traditional to Deep Learning and Beyond","date":"2025-03-24","arxiv_id":"2503.18669","repositories_listed":1,"syntology":null},{"url":"/paper/rankformer-a-graph-transformer-for","slug":"rankformer-a-graph-transformer-for","title":"Rankformer: A Graph Transformer for Recommendation based on Ranking Objective","date":"2025-03-21","arxiv_id":"2503.16927","repositories_listed":1,"syntology":null},{"url":"/paper/towards-carbon-footprint-aware-recommender","slug":"towards-carbon-footprint-aware-recommender","title":"Towards Carbon Footprint-Aware Recommender Systems for Greener Item Recommendation","date":"2025-03-21","arxiv_id":"2503.17201","repositories_listed":1,"syntology":null},{"url":"/paper/contextgnn-goes-to-elliot-towards","slug":"contextgnn-goes-to-elliot-towards","title":"ContextGNN goes to Elliot: Towards Benchmarking Relational Deep Learning for Static Link Prediction (aka Personalized Item Recommendation)","date":"2025-03-20","arxiv_id":"2503.16661","repositories_listed":1,"syntology":null},{"url":"/paper/scaled-supervision-is-an-implicit-lipschitz","slug":"scaled-supervision-is-an-implicit-lipschitz","title":"Scaled Supervision is an Implicit Lipschitz Regularizer","date":"2025-03-19","arxiv_id":"2503.14813","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-on-cross-domain","slug":"a-comprehensive-survey-on-cross-domain","title":"A Comprehensive Survey on Cross-Domain Recommendation: Taxonomy, Progress, and Prospects","date":"2025-03-18","arxiv_id":"2503.14110","repositories_listed":1,"syntology":null},{"url":"/paper/variational-bayesian-personalized-ranking","slug":"variational-bayesian-personalized-ranking","title":"Variational Bayesian Personalized Ranking","date":"2025-03-14","arxiv_id":"2503.11067","repositories_listed":1,"syntology":null},{"url":"/paper/shufflegate-an-efficient-and-self-polarizing","slug":"shufflegate-an-efficient-and-self-polarizing","title":"ShuffleGate: An Efficient and Self-Polarizing Feature Selection Method for Large-Scale Deep Models in Industry","date":"2025-03-12","arxiv_id":"2503.09315","repositories_listed":1,"syntology":null},{"url":"/paper/towards-next-generation-recommender-systems-a","slug":"towards-next-generation-recommender-systems-a","title":"Towards Next-Generation Recommender Systems: A Benchmark for Personalized Recommendation Assistant with LLMs","date":"2025-03-12","arxiv_id":"2503.09382","repositories_listed":1,"syntology":null},{"url":"/paper/decision-dependent-stochastic-optimization","slug":"decision-dependent-stochastic-optimization","title":"Decision-Dependent Stochastic Optimization: The Role of Distribution Dynamics","date":"2025-03-10","arxiv_id":"2503.07324","repositories_listed":1,"syntology":null},{"url":"/paper/process-supervised-llm-recommenders-via-flow","slug":"process-supervised-llm-recommenders-via-flow","title":"Process-Supervised LLM Recommenders via Flow-guided Tuning","date":"2025-03-10","arxiv_id":"2503.07377","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-large-language-model-empowered","slug":"a-survey-of-large-language-model-empowered","title":"A Survey of Large Language Model Empowered Agents for Recommendation and Search: Towards Next-Generation Information Retrieval","date":"2025-03-07","arxiv_id":"2503.05659","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-overprescribing-challenges-fine","slug":"addressing-overprescribing-challenges-fine","title":"Addressing Overprescribing Challenges: Fine-Tuning Large Language Models for Medication Recommendation Tasks","date":"2025-03-05","arxiv_id":"2503.03687","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/addressing-overprescribing-challenges-fine#ran","syntology_url":"https://syntology.ai/paper/2503.03687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.03687"}},"official":{"repos":["zzhustc2016/lamo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/intrinsic-and-extrinsic-factor","slug":"intrinsic-and-extrinsic-factor","title":"Intrinsic and Extrinsic Factor Disentanglement for Recommendation in Various Context Scenarios","date":"2025-03-05","arxiv_id":"2503.03524","repositories_listed":1,"syntology":null},{"url":"/paper/nutrigen-personalized-meal-plan-generator","slug":"nutrigen-personalized-meal-plan-generator","title":"NutriGen: Personalized Meal Plan Generator Leveraging Large Language Models to Enhance Dietary and Nutritional Adherence","date":"2025-02-28","arxiv_id":"2502.20601","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-legal-knowledge-and-ai-retrieval","slug":"bridging-legal-knowledge-and-ai-retrieval","title":"Bridging Legal Knowledge and AI: Retrieval-Augmented Generation with Vector Stores, Knowledge Graphs, and Hierarchical Non-negative Matrix Factorization","date":"2025-02-27","arxiv_id":"2502.20364","repositories_listed":1,"syntology":null},{"url":"/paper/towards-responsible-ai-in-education-hybrid","slug":"towards-responsible-ai-in-education-hybrid","title":"Towards Responsible AI in Education: Hybrid Recommendation System for K-12 Students Case Study","date":"2025-02-27","arxiv_id":"2502.20354","repositories_listed":1,"syntology":null},{"url":"/paper/agentsociety-challenge-designing-llm-agents","slug":"agentsociety-challenge-designing-llm-agents","title":"AgentSociety Challenge: Designing LLM Agents for User Modeling and Recommendation on Web Platforms","date":"2025-02-26","arxiv_id":"2502.18754","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/agentsociety-challenge-designing-llm-agents#ran","syntology_url":"https://syntology.ai/paper/2502.18754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.18754"}},"official":{"repos":["tsinghua-fib-lab/agentsocietychallenge"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multiview-graph-dual-attention-deep-learning","slug":"multiview-graph-dual-attention-deep-learning","title":"Multiview graph dual-attention deep learning and contrastive learning for multi-criteria recommender systems","date":"2025-02-26","arxiv_id":"2502.19271","repositories_listed":1,"syntology":null},{"url":"/paper/a-universal-framework-for-compressing","slug":"a-universal-framework-for-compressing","title":"A Universal Framework for Compressing Embeddings in CTR Prediction","date":"2025-02-21","arxiv_id":"2502.15355","repositories_listed":1,"syntology":null},{"url":"/paper/lightweight-yet-efficient-an-external","slug":"lightweight-yet-efficient-an-external","title":"Lightweight yet Efficient: An External Attentive Graph Convolutional Network with Positional Prompts for Sequential Recommendation","date":"2025-02-21","arxiv_id":"2502.15331","repositories_listed":1,"syntology":null},{"url":"/paper/eager-llm-enhancing-large-language-models-as","slug":"eager-llm-enhancing-large-language-models-as","title":"EAGER-LLM: Enhancing Large Language Models as Recommenders through Exogenous Behavior-Semantic Integration","date":"2025-02-20","arxiv_id":"2502.14735","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/eager-llm-enhancing-large-language-models-as#ran","syntology_url":"https://syntology.ai/paper/2502.14735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14735"}},"official":{"repos":["Indolent-Kawhi/EAGER-LLM"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/instructagent-building-user-controllable","slug":"instructagent-building-user-controllable","title":"iAgent: LLM Agent as a Shield between User and Recommender Systems","date":"2025-02-20","arxiv_id":"2502.14662","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/instructagent-building-user-controllable#ran","syntology_url":"https://syntology.ai/paper/2502.14662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14662"}},"official":{"repos":["wujiangxu/iagent"],"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/collaborative-retrieval-for-large-language","slug":"collaborative-retrieval-for-large-language","title":"Collaborative Retrieval for Large Language Model-based Conversational Recommender Systems","date":"2025-02-19","arxiv_id":"2502.14137","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-cross-domain-recommendations-with","slug":"enhancing-cross-domain-recommendations-with","title":"AgentCF++: Memory-enhanced LLM-based Agents for Popularity-aware Cross-domain Recommendations","date":"2025-02-19","arxiv_id":"2502.13843","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-llm-based-recommendations-through","slug":"enhancing-llm-based-recommendations-through","title":"Improving LLM-powered Recommendations with Personalized Information","date":"2025-02-19","arxiv_id":"2502.13845","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-popularity-bias-in-collaborative","slug":"mitigating-popularity-bias-in-collaborative","title":"Unbiased Collaborative Filtering with Fair Sampling","date":"2025-02-19","arxiv_id":"2502.13840","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-embeddings-for-session","slug":"unsupervised-graph-embeddings-for-session","title":"Unsupervised Graph Embeddings for Session-based Recommendation with Item Features","date":"2025-02-19","arxiv_id":"2502.13763","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-personalized-large-language","slug":"a-survey-of-personalized-large-language","title":"A Survey of Personalized Large Language Models: Progress and Future Directions","date":"2025-02-17","arxiv_id":"2502.11528","repositories_listed":1,"syntology":null},{"url":"/paper/joint-evaluation-of-fairness-and-relevance-in","slug":"joint-evaluation-of-fairness-and-relevance-in","title":"Joint Evaluation of Fairness and Relevance in Recommender Systems with Pareto Frontier","date":"2025-02-17","arxiv_id":"2502.11921","repositories_listed":1,"syntology":null},{"url":"/paper/leave-no-one-behind-enhancing-diversity-while","slug":"leave-no-one-behind-enhancing-diversity-while","title":"Leave No One Behind: Enhancing Diversity While Maintaining Accuracy in Social Recommendation","date":"2025-02-17","arxiv_id":"2502.11374","repositories_listed":1,"syntology":null},{"url":"/paper/deeper-insight-into-your-user-directed","slug":"deeper-insight-into-your-user-directed","title":"DEEPER Insight into Your User: Directed Persona Refinement for Dynamic Persona Modeling","date":"2025-02-16","arxiv_id":"2502.11078","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/deeper-insight-into-your-user-directed#ran","syntology_url":"https://syntology.ai/paper/2502.11078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.11078"}},"official":{"repos":["sheep333c/deeper"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-contextual-aware-position-encoding-for","slug":"a-contextual-aware-position-encoding-for","title":"A Contextual-Aware Position Encoding for Sequential Recommendation","date":"2025-02-13","arxiv_id":"2502.09027","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-jensen-gap-for-max-min-group","slug":"bridging-jensen-gap-for-max-min-group","title":"Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation","date":"2025-02-13","arxiv_id":"2502.09319","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bridging-jensen-gap-for-max-min-group#ran","syntology_url":"https://syntology.ai/paper/2502.09319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09319"}},"official":{"repos":["xuchen0427/fairdual"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/criteria-aware-graph-filtering-extremely-fast","slug":"criteria-aware-graph-filtering-extremely-fast","title":"Criteria-Aware Graph Filtering: Extremely Fast Yet Accurate Multi-Criteria Recommendation","date":"2025-02-13","arxiv_id":"2502.09046","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-models-explainable-data-valuation-and","slug":"beyond-models-explainable-data-valuation-and","title":"Beyond Models! Explainable Data Valuation and Metric Adaption for Recommendation","date":"2025-02-12","arxiv_id":"2502.08685","repositories_listed":1,"syntology":null},{"url":"/paper/ss4rec-continuous-time-sequential","slug":"ss4rec-continuous-time-sequential","title":"SS4Rec: Continuous-Time Sequential Recommendation with State Space Models","date":"2025-02-12","arxiv_id":"2502.08132","repositories_listed":1,"syntology":null},{"url":"/paper/creagent-towards-long-term-evaluation-of","slug":"creagent-towards-long-term-evaluation-of","title":"CreAgent: Towards Long-Term Evaluation of Recommender System under Platform-Creator Information Asymmetry","date":"2025-02-11","arxiv_id":"2502.07307","repositories_listed":1,"syntology":null},{"url":"/paper/flow-matching-for-collaborative-filtering","slug":"flow-matching-for-collaborative-filtering","title":"Flow Matching for Collaborative Filtering","date":"2025-02-11","arxiv_id":"2502.07303","repositories_listed":1,"syntology":null},{"url":"/paper/grannite-enabling-high-performance-execution","slug":"grannite-enabling-high-performance-execution","title":"GraNNite: Enabling High-Performance Execution of Graph Neural Networks on Resource-Constrained Neural Processing Units","date":"2025-02-10","arxiv_id":"2502.06921","repositories_listed":1,"syntology":null},{"url":"/paper/rallrec-improving-retrieval-augmented-large","slug":"rallrec-improving-retrieval-augmented-large","title":"RALLRec: Improving Retrieval Augmented Large Language Model Recommendation with Representation Learning","date":"2025-02-10","arxiv_id":"2502.06101","repositories_listed":1,"syntology":null},{"url":"/paper/intent-representation-learning-with-large","slug":"intent-representation-learning-with-large","title":"Intent Representation Learning with Large Language Model for Recommendation","date":"2025-02-05","arxiv_id":"2502.03307","repositories_listed":1,"syntology":null},{"url":"/paper/td3-tucker-decomposition-based-dataset","slug":"td3-tucker-decomposition-based-dataset","title":"TD3: Tucker Decomposition Based Dataset Distillation Method for Sequential Recommendation","date":"2025-02-05","arxiv_id":"2502.02854","repositories_listed":1,"syntology":null},{"url":"/paper/tgb-seq-benchmark-challenging-temporal-gnns","slug":"tgb-seq-benchmark-challenging-temporal-gnns","title":"TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics","date":"2025-02-05","arxiv_id":"2502.02975","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/tgb-seq-benchmark-challenging-temporal-gnns#ran","syntology_url":"https://syntology.ai/paper/2502.02975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.02975"}},"official":{"repos":["TGB-Seq/TGB-Seq"],"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/safety-at-scale-a-comprehensive-survey-of","slug":"safety-at-scale-a-comprehensive-survey-of","title":"Safety at Scale: A Comprehensive Survey of Large Model Safety","date":"2025-02-02","arxiv_id":"2502.05206","repositories_listed":1,"syntology":null},{"url":"/paper/personalized-denoising-implicit-feedback-for","slug":"personalized-denoising-implicit-feedback-for","title":"Personalized Denoising Implicit Feedback for Robust Recommender System","date":"2025-02-01","arxiv_id":"2502.00348","repositories_listed":1,"syntology":null},{"url":"/paper/are-representation-disentanglement-and","slug":"are-representation-disentanglement-and","title":"Are Representation Disentanglement and Interpretability Linked in Recommendation Models? A Critical Review and Reproducibility Study","date":"2025-01-30","arxiv_id":"2501.18805","repositories_listed":1,"syntology":null},{"url":"/paper/distributionally-robust-graph-out-of","slug":"distributionally-robust-graph-out-of","title":"Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Model","date":"2025-01-26","arxiv_id":"2501.15555","repositories_listed":1,"syntology":null},{"url":"/paper/patchrec-multi-grained-patching-for-efficient","slug":"patchrec-multi-grained-patching-for-efficient","title":"Multi-Grained Patch Training for Efficient LLM-based Recommendation","date":"2025-01-25","arxiv_id":"2501.15087","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/patchrec-multi-grained-patching-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2501.15087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15087"}},"official":{"repos":["ljy0ustc/patchrec"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-feedback-bandits-on-similar-arms-with","slug":"graph-feedback-bandits-on-similar-arms-with","title":"Graph Feedback Bandits on Similar Arms: With and Without Graph Structures","date":"2025-01-24","arxiv_id":"2501.14314","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-feedback-bandits-on-similar-arms-with#ran","syntology_url":"https://syntology.ai/paper/2501.14314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.14314"}},"official":{"repos":["qh1874/GraphBandits_SimilarArms"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-controlled-differential-1","slug":"graph-neural-controlled-differential-1","title":"Graph Neural Controlled Differential Equations For Collaborative Filtering","date":"2025-01-23","arxiv_id":"2501.13908","repositories_listed":1,"syntology":null},{"url":"/paper/mixrec-individual-and-collective-mixing","slug":"mixrec-individual-and-collective-mixing","title":"MixRec: Individual and Collective Mixing Empowers Data Augmentation for Recommender Systems","date":"2025-01-23","arxiv_id":"2501.13579","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-multimodal-recommender-systems","slug":"a-survey-on-multimodal-recommender-systems","title":"A Survey on Multimodal Recommender Systems: Recent Advances and Future Directions","date":"2025-01-22","arxiv_id":"2502.15711","repositories_listed":1,"syntology":null},{"url":"/paper/coarse-to-fine-lightweight-meta-embedding-for","slug":"coarse-to-fine-lightweight-meta-embedding-for","title":"Coarse-to-Fine Lightweight Meta-Embedding for ID-Based Recommendation","date":"2025-01-21","arxiv_id":"2501.11870","repositories_listed":1,"syntology":null},{"url":"/paper/poison-rag-adversarial-data-poisoning-attacks","slug":"poison-rag-adversarial-data-poisoning-attacks","title":"Poison-RAG: Adversarial Data Poisoning Attacks on Retrieval-Augmented Generation in Recommender Systems","date":"2025-01-20","arxiv_id":"2501.11759","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-language-models-in-neural-news","slug":"revisiting-language-models-in-neural-news","title":"Revisiting Language Models in Neural News Recommender Systems","date":"2025-01-20","arxiv_id":"2501.11391","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-models-in-recommendation-systems-a","slug":"diffusion-models-in-recommendation-systems-a","title":"Diffusion Models in Recommendation Systems: A Survey","date":"2025-01-17","arxiv_id":"2501.10548","repositories_listed":1,"syntology":null},{"url":"/paper/ufgraphfr-an-attempt-at-a-federated","slug":"ufgraphfr-an-attempt-at-a-federated","title":"UFGraphFR: An attempt at a federated recommendation system based on user text characteristics","date":"2025-01-14","arxiv_id":"2501.08044","repositories_listed":1,"syntology":null},{"url":"/paper/adkgd-anomaly-detection-in-knowledge-graphs","slug":"adkgd-anomaly-detection-in-knowledge-graphs","title":"ADKGD: Anomaly Detection in Knowledge Graphs with Dual-Channel Training","date":"2025-01-13","arxiv_id":"2501.07078","repositories_listed":1,"syntology":null},{"url":"/paper/kannolo-sweet-and-smooth-approximate-k","slug":"kannolo-sweet-and-smooth-approximate-k","title":"kANNolo: Sweet and Smooth Approximate k-Nearest Neighbors Search","date":"2025-01-10","arxiv_id":"2501.06121","repositories_listed":1,"syntology":null},{"url":"/paper/text2playlist-generating-personalized","slug":"text2playlist-generating-personalized","title":"Text2Playlist: Generating Personalized Playlists from Text on Deezer","date":"2025-01-10","arxiv_id":"2501.05894","repositories_listed":1,"syntology":null},{"url":"/paper/a-closer-look-on-gender-stereotypes-in-movie","slug":"a-closer-look-on-gender-stereotypes-in-movie","title":"A Closer Look on Gender Stereotypes in Movie Recommender Systems and Their Implications with Privacy","date":"2025-01-08","arxiv_id":"2501.04420","repositories_listed":1,"syntology":null},{"url":"/paper/reckg-knowledge-graph-for-recommender-systems","slug":"reckg-knowledge-graph-for-recommender-systems","title":"RecKG: Knowledge Graph for Recommender Systems","date":"2025-01-07","arxiv_id":"2501.03598","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-byzantine-robustness-in-federated","slug":"rethinking-byzantine-robustness-in-federated","title":"Rethinking Byzantine Robustness in Federated Recommendation from Sparse Aggregation Perspective","date":"2025-01-06","arxiv_id":"2501.03301","repositories_listed":1,"syntology":null},{"url":"/paper/cold-start-recommendation-towards-the-era-of","slug":"cold-start-recommendation-towards-the-era-of","title":"Cold-Start Recommendation towards the Era of Large Language Models (LLMs): A Comprehensive Survey and Roadmap","date":"2025-01-03","arxiv_id":"2501.01945","repositories_listed":1,"syntology":null},{"url":"/paper/social-relation-meets-recommendation","slug":"social-relation-meets-recommendation","title":"Contrastive Learning Augmented Social Recommendations","date":"2025-01-03","arxiv_id":"2502.15695","repositories_listed":1,"syntology":null},{"url":"/paper/robust-matrix-completion-for-discrete-rating","slug":"robust-matrix-completion-for-discrete-rating","title":"Robust Matrix Completion for Discrete Rating-Scale Data","date":"2024-12-30","arxiv_id":"2412.20802","repositories_listed":1,"syntology":null},{"url":"/paper/invariant-debiasing-learning-for","slug":"invariant-debiasing-learning-for","title":"Invariant debiasing learning for recommendation via biased imputation","date":"2024-12-28","arxiv_id":"2412.20036","repositories_listed":1,"syntology":null},{"url":"/paper/reclm-recommendation-instruction-tuning","slug":"reclm-recommendation-instruction-tuning","title":"RecLM: Recommendation Instruction Tuning","date":"2024-12-26","arxiv_id":"2412.19302","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-representation-for-interactive","slug":"contrastive-representation-for-interactive","title":"Contrastive Representation for Interactive Recommendation","date":"2024-12-24","arxiv_id":"2412.18396","repositories_listed":1,"syntology":null},{"url":"/paper/prompt-tuning-for-item-cold-start","slug":"prompt-tuning-for-item-cold-start","title":"Prompt Tuning for Item Cold-start Recommendation","date":"2024-12-24","arxiv_id":"2412.18082","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-the-hidden-treasures-enhancing","slug":"unlocking-the-hidden-treasures-enhancing","title":"Unlocking the Hidden Treasures: Enhancing Recommendations with Unlabeled Data","date":"2024-12-24","arxiv_id":"2412.18170","repositories_listed":1,"syntology":null},{"url":"/paper/graphhash-graph-clustering-enables-parameter","slug":"graphhash-graph-clustering-enables-parameter","title":"GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems","date":"2024-12-23","arxiv_id":"2412.17245","repositories_listed":1,"syntology":null},{"url":"/paper/llm-powered-user-simulator-for-recommender","slug":"llm-powered-user-simulator-for-recommender","title":"LLM-Powered User Simulator for Recommender System","date":"2024-12-22","arxiv_id":"2412.16984","repositories_listed":1,"syntology":null},{"url":"/paper/spectrum-based-modality-representation-fusion","slug":"spectrum-based-modality-representation-fusion","title":"Spectrum-based Modality Representation Fusion Graph Convolutional Network for Multimodal Recommendation","date":"2024-12-19","arxiv_id":"2412.14978","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-user-side-knowledge-gap-in","slug":"bridging-the-user-side-knowledge-gap-in","title":"Bridging the User-side Knowledge Gap in Knowledge-aware Recommendations with Large Language Models","date":"2024-12-18","arxiv_id":"2412.13544","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-collaborative-filtering-2","slug":"heterogeneous-graph-collaborative-filtering-2","title":"MixRec: Heterogeneous Graph Collaborative Filtering","date":"2024-12-18","arxiv_id":"2412.13825","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-model-enhanced-recommender","slug":"large-language-model-enhanced-recommender","title":"Large Language Model Enhanced Recommender Systems: A Survey","date":"2024-12-18","arxiv_id":"2412.13432","repositories_listed":1,"syntology":null},{"url":"/paper/modality-independent-graph-neural-networks","slug":"modality-independent-graph-neural-networks","title":"Modality-Independent Graph Neural Networks with Global Transformers for Multimodal Recommendation","date":"2024-12-18","arxiv_id":"2412.13994","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-graph-convolution-multimodal","slug":"beyond-graph-convolution-multimodal","title":"Beyond Graph Convolution: Multimodal Recommendation with Topology-aware MLPs","date":"2024-12-16","arxiv_id":"2412.11747","repositories_listed":1,"syntology":null},{"url":"/paper/one-for-dozens-adaptive-recommendation-for","slug":"one-for-dozens-adaptive-recommendation-for","title":"One for Dozens: Adaptive REcommendation for All Domains with Counterfactual Augmentation","date":"2024-12-16","arxiv_id":"2412.11905","repositories_listed":1,"syntology":null},{"url":"/paper/recsys-arena-pair-wise-recommender-system","slug":"recsys-arena-pair-wise-recommender-system","title":"RecSys Arena: Pair-wise Recommender System Evaluation with Large Language Models","date":"2024-12-15","arxiv_id":"2412.11068","repositories_listed":1,"syntology":null},{"url":"/paper/can-llms-convert-graphs-to-text-attributed","slug":"can-llms-convert-graphs-to-text-attributed","title":"Can LLMs Convert Graphs to Text-Attributed Graphs?","date":"2024-12-13","arxiv_id":"2412.10136","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/can-llms-convert-graphs-to-text-attributed#ran","syntology_url":"https://syntology.ai/paper/2412.10136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.10136"}},"official":{"repos":["zehong-wang/tans"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mopi-hfrs-a-multi-objective-personalized","slug":"mopi-hfrs-a-multi-objective-personalized","title":"MOPI-HFRS: A Multi-objective Personalized Health-aware Food Recommendation System with LLM-enhanced Interpretation","date":"2024-12-12","arxiv_id":"2412.08847","repositories_listed":1,"syntology":null},{"url":"/paper/sprec-leveraging-self-play-to-debias","slug":"sprec-leveraging-self-play-to-debias","title":"SPRec: Leveraging Self-Play to Debias Preference Alignment for Large Language Model-based Recommendations","date":"2024-12-12","arxiv_id":"2412.09243","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sprec-leveraging-self-play-to-debias#ran","syntology_url":"https://syntology.ai/paper/2412.09243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09243"}},"official":{"repos":["regionch/sprec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-for-scholarly-ontology","slug":"large-language-models-for-scholarly-ontology","title":"Large Language Models for Scholarly Ontology Generation: An Extensive Analysis in the Engineering Field","date":"2024-12-11","arxiv_id":"2412.08258","repositories_listed":1,"syntology":null},{"url":"/paper/pyod-2-a-python-library-for-outlier-detection","slug":"pyod-2-a-python-library-for-outlier-detection","title":"PyOD 2: A Python Library for Outlier Detection with LLM-powered Model Selection","date":"2024-12-11","arxiv_id":"2412.12154","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/pyod-2-a-python-library-for-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2412.12154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12154"}},"official":{"repos":["yzhao062/pyod"],"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/scaling-sequential-recommendation-models-with","slug":"scaling-sequential-recommendation-models-with","title":"Scaling Sequential Recommendation Models with Transformers","date":"2024-12-10","arxiv_id":"2412.07585","repositories_listed":1,"syntology":null},{"url":"/paper/graph-sequential-alignment-and-uniformity","slug":"graph-sequential-alignment-and-uniformity","title":"Graph-Sequential Alignment and Uniformity: Toward Enhanced Recommendation Systems","date":"2024-12-05","arxiv_id":"2412.04276","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-hash-for-recommendation-a-survey","slug":"learning-to-hash-for-recommendation-a-survey","title":"Learning to Hash for Recommendation: A Survey","date":"2024-12-05","arxiv_id":"2412.03875","repositories_listed":1,"syntology":null},{"url":"/paper/pre-train-align-and-disentangle-empowering","slug":"pre-train-align-and-disentangle-empowering","title":"Pre-train, Align, and Disentangle: Empowering Sequential Recommendation with Large Language Models","date":"2024-12-05","arxiv_id":"2412.04107","repositories_listed":1,"syntology":null},{"url":"/paper/user-item-fairness-tradeoffs-in","slug":"user-item-fairness-tradeoffs-in","title":"User-item fairness tradeoffs in recommendations","date":"2024-12-05","arxiv_id":"2412.04466","repositories_listed":1,"syntology":null},{"url":"/paper/luxembedder-a-cross-lingual-approach-to","slug":"luxembedder-a-cross-lingual-approach-to","title":"LuxEmbedder: A Cross-Lingual Approach to Enhanced Luxembourgish Sentence Embeddings","date":"2024-12-04","arxiv_id":"2412.03331","repositories_listed":1,"syntology":null},{"url":"/paper/contextgnn-beyond-two-tower-recommendation","slug":"contextgnn-beyond-two-tower-recommendation","title":"ContextGNN: Beyond Two-Tower Recommendation Systems","date":"2024-11-29","arxiv_id":"2411.19513","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/contextgnn-beyond-two-tower-recommendation#ran","syntology_url":"https://syntology.ai/paper/2411.19513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.19513"}},"official":{"repos":["kumo-ai/ContextGNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"e00fcae83be74d078df7e40d5b1dc9b94866da8f9a03008c394a4d241d1c8208","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}