{"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/6","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":6,"pages_in_order":61,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/recommendation-systems/papers/7","papers":[{"url":"/paper/cross-domain-recommendation-meets-large","slug":"cross-domain-recommendation-meets-large","title":"Cross-Domain Recommendation Meets Large Language Models","date":"2024-11-29","arxiv_id":"2411.19862","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-learning-enhanced-multi-group","slug":"supervised-learning-enhanced-multi-group","title":"Supervised Learning-enhanced Multi-Group Actor Critic for Live Stream Allocation in Feed","date":"2024-11-28","arxiv_id":"2412.10381","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-learning-via-knowledge-transfer-for","slug":"ensemble-learning-via-knowledge-transfer-for","title":"Ensemble Learning via Knowledge Transfer for CTR Prediction","date":"2024-11-25","arxiv_id":"2411.16122","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-ternary-weight-embedding-model","slug":"efficient-ternary-weight-embedding-model","title":"Efficient Ternary Weight Embedding Model: Bridging Scalability and Performance","date":"2024-11-23","arxiv_id":"2411.15438","repositories_listed":1,"syntology":null},{"url":"/paper/harec-hyperbolic-graph-llm-alignment-for","slug":"harec-hyperbolic-graph-llm-alignment-for","title":"Breaking Information Cocoons: A Hyperbolic Graph-LLM Framework for Exploration and Exploitation in Recommender Systems","date":"2024-11-21","arxiv_id":"2411.13865","repositories_listed":1,"syntology":null},{"url":"/paper/data-watermarking-for-sequential-recommender","slug":"data-watermarking-for-sequential-recommender","title":"Data Watermarking for Sequential Recommender Systems","date":"2024-11-20","arxiv_id":"2411.12989","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-text-classification-htc-vs","slug":"hierarchical-text-classification-htc-vs","title":"Hierarchical Text Classification (HTC) vs. eXtreme Multilabel Classification (XML): Two Sides of the Same Medal","date":"2024-11-20","arxiv_id":"2411.13687","repositories_listed":1,"syntology":null},{"url":"/paper/on-adaptivity-and-minimax-optimality-of-two","slug":"on-adaptivity-and-minimax-optimality-of-two","title":"On adaptivity and minimax optimality of two-sided nearest neighbors","date":"2024-11-20","arxiv_id":"2411.12965","repositories_listed":1,"syntology":null},{"url":"/paper/on-device-content-based-recommendation-with","slug":"on-device-content-based-recommendation-with","title":"On-device Content-based Recommendation with Single-shot Embedding Pruning: A Cooperative Game Perspective","date":"2024-11-20","arxiv_id":"2411.13052","repositories_listed":1,"syntology":null},{"url":"/paper/multi-grained-preference-enhanced-transformer","slug":"multi-grained-preference-enhanced-transformer","title":"Multi-Grained Preference Enhanced Transformer for Multi-Behavior Sequential Recommendation","date":"2024-11-19","arxiv_id":"2411.12179","repositories_listed":1,"syntology":null},{"url":"/paper/a-pre-trained-graph-based-model-for-adaptive","slug":"a-pre-trained-graph-based-model-for-adaptive","title":"A Pre-Trained Graph-Based Model for Adaptive Sequencing of Educational Documents","date":"2024-11-18","arxiv_id":"2411.11520","repositories_listed":1,"syntology":{"n":15,"n_ran":7,"n_constructed":7,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":15,"phrase":"7 ran (of which 7 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) · 8 unverified; every one of the 7 samples that ran constructed an object rather than computing a result","sample_list":"/paper/a-pre-trained-graph-based-model-for-adaptive#ran","syntology_url":"https://syntology.ai/paper/2411.11520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.11520"}},"official":{"repos":["jvasso/pretrain-rl-adaptive-learning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/oasis-open-agents-social-interaction","slug":"oasis-open-agents-social-interaction","title":"OASIS: Open Agent Social Interaction Simulations with One Million Agents","date":"2024-11-18","arxiv_id":"2411.11581","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/oasis-open-agents-social-interaction#ran","syntology_url":"https://syntology.ai/paper/2411.11581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.11581"}},"official":{"repos":["camel-ai/oasis"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/online-item-cold-start-recommendation-with","slug":"online-item-cold-start-recommendation-with","title":"Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning","date":"2024-11-18","arxiv_id":"2411.11225","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-feature-based-knowledge","slug":"exploring-feature-based-knowledge","title":"Exploring Feature-based Knowledge Distillation for Recommender System: A Frequency Perspective","date":"2024-11-16","arxiv_id":"2411.10676","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/exploring-feature-based-knowledge#ran","syntology_url":"https://syntology.ai/paper/2411.10676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.10676"}},"official":{"repos":["woriazzc/kds"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-user-preferences-a-knowledge-graph","slug":"unveiling-user-preferences-a-knowledge-graph","title":"Unveiling User Preferences: A Knowledge Graph and LLM-Driven Approach for Conversational Recommendation","date":"2024-11-16","arxiv_id":"2411.14459","repositories_listed":1,"syntology":null},{"url":"/paper/language-model-prior-overcomes-cold-start","slug":"language-model-prior-overcomes-cold-start","title":"Language-Model Prior Overcomes Cold-Start Items","date":"2024-11-13","arxiv_id":"2411.09065","repositories_listed":1,"syntology":null},{"url":"/paper/recommender-systems-and-reinforcement","slug":"recommender-systems-and-reinforcement","title":"Recommender systems and reinforcement learning for human-building interaction and context-aware support: A text mining-driven review of scientific literature","date":"2024-11-13","arxiv_id":"2411.08734","repositories_listed":1,"syntology":null},{"url":"/paper/advancing-sustainability-via-recommender","slug":"advancing-sustainability-via-recommender","title":"Advancing Sustainability via Recommender Systems: A Survey","date":"2024-11-12","arxiv_id":"2411.07658","repositories_listed":1,"syntology":null},{"url":"/paper/towards-automated-model-design-on-recommender","slug":"towards-automated-model-design-on-recommender","title":"Towards Automated Model Design on Recommender Systems","date":"2024-11-12","arxiv_id":"2411.07569","repositories_listed":1,"syntology":null},{"url":"/paper/interpret-the-internal-states-of","slug":"interpret-the-internal-states-of","title":"Interpret the Internal States of Recommendation Model with Sparse Autoencoder","date":"2024-11-09","arxiv_id":"2411.06112","repositories_listed":1,"syntology":null},{"url":"/paper/harnessing-high-level-song-descriptors","slug":"harnessing-high-level-song-descriptors","title":"Harnessing High-Level Song Descriptors towards Natural Language-Based Music Recommendation","date":"2024-11-08","arxiv_id":"2411.05649","repositories_listed":1,"syntology":null},{"url":"/paper/boulder2vec-modeling-climber-performances-in","slug":"boulder2vec-modeling-climber-performances-in","title":"Boulder2Vec: Modeling Climber Performances in Professional Bouldering Competitions","date":"2024-11-04","arxiv_id":"2411.02343","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-cognitive-diagnosis-with","slug":"collaborative-cognitive-diagnosis-with","title":"Collaborative Cognitive Diagnosis with Disentangled Representation Learning for Learner Modeling","date":"2024-11-04","arxiv_id":"2411.02066","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-id-based-recommendation-with-large","slug":"enhancing-id-based-recommendation-with-large","title":"Enhancing ID-based Recommendation with Large Language Models","date":"2024-11-04","arxiv_id":"2411.02041","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/enhancing-id-based-recommendation-with-large#ran","syntology_url":"https://syntology.ai/paper/2411.02041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02041"}},"official":{"repos":["newlei/LLM4IDRec"],"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/hacd-harnessing-attribute-semantics-and","slug":"hacd-harnessing-attribute-semantics-and","title":"HACD: Harnessing Attribute Semantics and Mesoscopic Structure for Community Detection","date":"2024-11-04","arxiv_id":"2411.01947","repositories_listed":1,"syntology":null},{"url":"/paper/co-clustering-for-federated-recommender","slug":"co-clustering-for-federated-recommender","title":"Co-clustering for Federated Recommender System","date":"2024-11-03","arxiv_id":"2411.01690","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-robust-regularized-federated","slug":"efficient-and-robust-regularized-federated","title":"Efficient and Robust Regularized Federated Recommendation","date":"2024-11-03","arxiv_id":"2411.01540","repositories_listed":1,"syntology":null},{"url":"/paper/linrec-linear-attention-mechanism-for-long","slug":"linrec-linear-attention-mechanism-for-long","title":"LinRec: Linear Attention Mechanism for Long-term Sequential Recommender Systems","date":"2024-11-03","arxiv_id":"2411.01537","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":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/linrec-linear-attention-mechanism-for-long#ran","syntology_url":"https://syntology.ai/paper/2411.01537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01537"}},"official":{"repos":["Applied-Machine-Learning-Lab/LinRec"],"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/pagerank-bandits-for-link-prediction","slug":"pagerank-bandits-for-link-prediction","title":"PageRank Bandits for Link Prediction","date":"2024-11-03","arxiv_id":"2411.01410","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pagerank-bandits-for-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2411.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01410"}},"official":{"repos":["jiaruzouu/prb"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-on-bundle-recommendation-methods","slug":"a-survey-on-bundle-recommendation-methods","title":"A Survey on Bundle Recommendation: Methods, Applications, and Challenges","date":"2024-11-01","arxiv_id":"2411.00341","repositories_listed":1,"syntology":null},{"url":"/paper/identify-then-recommend-towards-unsupervised","slug":"identify-then-recommend-towards-unsupervised","title":"Identify Then Recommend: Towards Unsupervised Group Recommendation","date":"2024-10-31","arxiv_id":"2410.23757","repositories_listed":1,"syntology":null},{"url":"/paper/psl-rethinking-and-improving-softmax-loss","slug":"psl-rethinking-and-improving-softmax-loss","title":"PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation","date":"2024-10-31","arxiv_id":"2411.00163","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"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) · 0 unverified","sample_list":"/paper/psl-rethinking-and-improving-softmax-loss#ran","syntology_url":"https://syntology.ai/paper/2411.00163","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.00163"}},"official":{"repos":["tiny-snow/ir-benchmark"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/causality-enhanced-behavior-sequence-modeling","slug":"causality-enhanced-behavior-sequence-modeling","title":"Causality-Enhanced Behavior Sequence Modeling in LLMs for Personalized Recommendation","date":"2024-10-30","arxiv_id":"2410.22809","repositories_listed":1,"syntology":null},{"url":"/paper/datarec-a-framework-for-standardizing","slug":"datarec-a-framework-for-standardizing","title":"DataRec: A Python Library for Standardized and Reproducible Data Management in Recommender Systems","date":"2024-10-30","arxiv_id":"2410.22972","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-personalization-for-llm-based","slug":"real-time-personalization-for-llm-based","title":"Real-Time Personalization for LLM-based Recommendation with Customized In-Context Learning","date":"2024-10-30","arxiv_id":"2410.23136","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/real-time-personalization-for-llm-based#ran","syntology_url":"https://syntology.ai/paper/2410.23136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23136"}},"official":{"repos":["ym689/rec_icl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/reasoningrec-bridging-personalized","slug":"reasoningrec-bridging-personalized","title":"ReasoningRec: Bridging Personalized Recommendations and Human-Interpretable Explanations through LLM Reasoning","date":"2024-10-30","arxiv_id":"2410.23180","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-and-improving-adversarial-1","slug":"understanding-and-improving-adversarial-1","title":"Understanding and Improving Adversarial Collaborative Filtering for Robust Recommendation","date":"2024-10-30","arxiv_id":"2410.22844","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/understanding-and-improving-adversarial-1#ran","syntology_url":"https://syntology.ai/paper/2410.22844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22844"}},"official":{"repos":["Kaike-Zhang/PamaCF"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-user-history-with-transformers-for","slug":"leveraging-user-history-with-transformers-for","title":"Leveraging User History with Transformers for News Clicking: The DArgk Approach","date":"2024-10-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pushing-the-performance-envelope-of-dnn-based","slug":"pushing-the-performance-envelope-of-dnn-based","title":"Pushing the Performance Envelope of DNN-based Recommendation Systems Inference on GPUs","date":"2024-10-29","arxiv_id":"2410.22249","repositories_listed":1,"syntology":null},{"url":"/paper/simrec-mitigating-the-cold-start-problem-in","slug":"simrec-mitigating-the-cold-start-problem-in","title":"SimRec: Mitigating the Cold-Start Problem in Sequential Recommendation by Integrating Item Similarity","date":"2024-10-29","arxiv_id":"2410.22136","repositories_listed":1,"syntology":null},{"url":"/paper/genup-generative-user-profilers-as-in-context","slug":"genup-generative-user-profilers-as-in-context","title":"GenUP: Generative User Profilers as In-Context Learners for Next POI Recommender Systems","date":"2024-10-28","arxiv_id":"2410.20643","repositories_listed":1,"syntology":null},{"url":"/paper/recflow-an-industrial-full-flow","slug":"recflow-an-industrial-full-flow","title":"RecFlow: An Industrial Full Flow Recommendation Dataset","date":"2024-10-28","arxiv_id":"2410.20868","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":2,"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/recflow-an-industrial-full-flow#ran","syntology_url":"https://syntology.ai/paper/2410.20868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.20868"}},"official":{"repos":["recflow-iclr/recflow"],"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/coherence-guided-preference-disentanglement","slug":"coherence-guided-preference-disentanglement","title":"Coherence-guided Preference Disentanglement for Cross-domain Recommendations","date":"2024-10-27","arxiv_id":"2410.20580","repositories_listed":1,"syntology":null},{"url":"/paper/personality-analysis-from-online-short-video","slug":"personality-analysis-from-online-short-video","title":"Personality Analysis from Online Short Video Platforms with Multi-domain Adaptation","date":"2024-10-26","arxiv_id":"2411.00813","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-training-for-recommendation-with","slug":"end-to-end-training-for-recommendation-with","title":"End-to-end Training for Recommendation with Language-based User Profiles","date":"2024-10-24","arxiv_id":"2410.18870","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-training-for-recommendation-with#ran","syntology_url":"https://syntology.ai/paper/2410.18870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.18870"}},"official":{"repos":["zhaolingao/langptune"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sentiment-driven-community-detection-in-a","slug":"sentiment-driven-community-detection-in-a","title":"Sentiment-Driven Community Detection in a Network of Perfume Preferences","date":"2024-10-24","arxiv_id":"2410.19177","repositories_listed":1,"syntology":null},{"url":"/paper/fairdgcl-fairness-aware-recommendation-with","slug":"fairdgcl-fairness-aware-recommendation-with","title":"FairDgcl: Fairness-aware Recommendation with Dynamic Graph Contrastive Learning","date":"2024-10-23","arxiv_id":"2410.17555","repositories_listed":1,"syntology":null},{"url":"/paper/taming-the-long-tail-in-human-mobility","slug":"taming-the-long-tail-in-human-mobility","title":"Taming the Long Tail in Human Mobility Prediction","date":"2024-10-19","arxiv_id":"2410.14970","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":8,"n_ran_checked":12,"n_instrument":2,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"14 ran (of which 8 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/taming-the-long-tail-in-human-mobility#ran","syntology_url":"https://syntology.ai/paper/2410.14970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14970"}},"official":{"repos":["yukayo/lotnext"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":8,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/personalized-image-generation-with-large","slug":"personalized-image-generation-with-large","title":"Personalized Image Generation with Large Multimodal Models","date":"2024-10-18","arxiv_id":"2410.14170","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/personalized-image-generation-with-large#ran","syntology_url":"https://syntology.ai/paper/2410.14170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14170"}},"official":{"repos":["yiyanxu/pigeon"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/preference-diffusion-for-recommendation","slug":"preference-diffusion-for-recommendation","title":"Preference Diffusion for Recommendation","date":"2024-10-17","arxiv_id":"2410.13117","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":5,"n_ran_checked":11,"n_instrument":4,"n_unverified":4,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":19,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/preference-diffusion-for-recommendation#ran","syntology_url":"https://syntology.ai/paper/2410.13117","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13117"}},"official":{"repos":["lswhim/preferdiff"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":5,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/adaptive-coordinators-and-prompts-on","slug":"adaptive-coordinators-and-prompts-on","title":"Adaptive Coordinators and Prompts on Heterogeneous Graphs for Cross-Domain Recommendations","date":"2024-10-15","arxiv_id":"2410.11719","repositories_listed":1,"syntology":null},{"url":"/paper/eco-aware-graph-neural-networks-for","slug":"eco-aware-graph-neural-networks-for","title":"Eco-Aware Graph Neural Networks for Sustainable Recommendations","date":"2024-10-12","arxiv_id":"2410.09514","repositories_listed":1,"syntology":null},{"url":"/paper/green-recommender-systems-optimizing-dataset","slug":"green-recommender-systems-optimizing-dataset","title":"Green Recommender Systems: Optimizing Dataset Size for Energy-Efficient Algorithm Performance","date":"2024-10-12","arxiv_id":"2410.09359","repositories_listed":1,"syntology":null},{"url":"/paper/sapient-mastering-multi-turn-conversational","slug":"sapient-mastering-multi-turn-conversational","title":"SAPIENT: Mastering Multi-turn Conversational Recommendation with Strategic Planning and Monte Carlo Tree Search","date":"2024-10-12","arxiv_id":"2410.09580","repositories_listed":1,"syntology":null},{"url":"/paper/disco-a-hierarchical-disentangled-cognitive","slug":"disco-a-hierarchical-disentangled-cognitive","title":"DISCO: A Hierarchical Disentangled Cognitive Diagnosis Framework for Interpretable Job Recommendation","date":"2024-10-10","arxiv_id":"2410.07671","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":7,"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/disco-a-hierarchical-disentangled-cognitive#ran","syntology_url":"https://syntology.ai/paper/2410.07671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07671"}},"official":{"repos":["LabyrinthineLeo/DISCO"],"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/firzen-firing-strict-cold-start-items-with","slug":"firzen-firing-strict-cold-start-items-with","title":"Firzen: Firing Strict Cold-Start Items with Frozen Heterogeneous and Homogeneous Graphs for Recommendation","date":"2024-10-10","arxiv_id":"2410.07654","repositories_listed":1,"syntology":null},{"url":"/paper/towards-next-generation-llm-based-recommender","slug":"towards-next-generation-llm-based-recommender","title":"Towards Next-Generation LLM-based Recommender Systems: A Survey and Beyond","date":"2024-10-10","arxiv_id":"2410.19744","repositories_listed":1,"syntology":null},{"url":"/paper/learning-recommender-systems-with-soft-target","slug":"learning-recommender-systems-with-soft-target","title":"Learning Recommender Systems with Soft Target: A Decoupled Perspective","date":"2024-10-09","arxiv_id":"2410.06536","repositories_listed":1,"syntology":null},{"url":"/paper/mdap-a-multi-view-disentangled-and-adaptive","slug":"mdap-a-multi-view-disentangled-and-adaptive","title":"MDAP: A Multi-view Disentangled and Adaptive Preference Learning Framework for Cross-Domain Recommendation","date":"2024-10-08","arxiv_id":"2410.05877","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"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) · 0 unverified","sample_list":"/paper/mdap-a-multi-view-disentangled-and-adaptive#ran","syntology_url":"https://syntology.ai/paper/2410.05877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05877"}},"official":{"repos":["the-garden-of-sinner/mdap"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-behavioral-sequential-recommendation","slug":"multi-behavioral-sequential-recommendation","title":"Multi-Behavioral Sequential Recommendation","date":"2024-10-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/glee-a-unified-framework-and-benchmark-for","slug":"glee-a-unified-framework-and-benchmark-for","title":"GLEE: A Unified Framework and Benchmark for Language-based Economic Environments","date":"2024-10-07","arxiv_id":"2410.05254","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-social-media-recommendation-impacts","slug":"modeling-social-media-recommendation-impacts","title":"Modeling Social Media Recommendation Impacts Using Academic Networks: A Graph Neural Network Approach","date":"2024-10-06","arxiv_id":"2410.04552","repositories_listed":1,"syntology":null},{"url":"/paper/improving-portfolio-optimization-results-with","slug":"improving-portfolio-optimization-results-with","title":"Improving Portfolio Optimization Results with Bandit Networks","date":"2024-10-05","arxiv_id":"2410.04217","repositories_listed":1,"syntology":null},{"url":"/paper/long-sequence-recommendation-models-need","slug":"long-sequence-recommendation-models-need","title":"Long-Sequence Recommendation Models Need Decoupled Embeddings","date":"2024-10-03","arxiv_id":"2410.02604","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":2,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":9,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/long-sequence-recommendation-models-need#ran","syntology_url":"https://syntology.ai/paper/2410.02604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02604"}},"official":{"repos":["thuml/dare"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/does-graph-prompt-work-a-data-operation","slug":"does-graph-prompt-work-a-data-operation","title":"Does Graph Prompt Work? A Data Operation Perspective with Theoretical Analysis","date":"2024-10-02","arxiv_id":"2410.01635","repositories_listed":1,"syntology":null},{"url":"/paper/elaborative-subtopic-query-reformulation-for","slug":"elaborative-subtopic-query-reformulation-for","title":"Elaborative Subtopic Query Reformulation for Broad and Indirect Queries in Travel Destination Recommendation","date":"2024-10-02","arxiv_id":"2410.01598","repositories_listed":1,"syntology":null},{"url":"/paper/peeling-back-the-layers-an-in-depth","slug":"peeling-back-the-layers-an-in-depth","title":"Peeling Back the Layers: An In-Depth Evaluation of Encoder Architectures in Neural News Recommenders","date":"2024-10-02","arxiv_id":"2410.01470","repositories_listed":1,"syntology":null},{"url":"/paper/delving-deep-into-engagement-prediction-of","slug":"delving-deep-into-engagement-prediction-of","title":"Delving Deep into Engagement Prediction of Short Videos","date":"2024-09-30","arxiv_id":"2410.00289","repositories_listed":1,"syntology":null},{"url":"/paper/neural-click-models-for-recommender-systems","slug":"neural-click-models-for-recommender-systems","title":"Neural Click Models for Recommender Systems","date":"2024-09-30","arxiv_id":"2409.20055","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-cross-entropy-loss-for-sequential","slug":"scalable-cross-entropy-loss-for-sequential","title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","date":"2024-09-27","arxiv_id":"2409.18721","repositories_listed":1,"syntology":null},{"url":"/paper/a-multimodal-single-branch-embedding-network","slug":"a-multimodal-single-branch-embedding-network","title":"A Multimodal Single-Branch Embedding Network for Recommendation in Cold-Start and Missing Modality Scenarios","date":"2024-09-26","arxiv_id":"2409.17864","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-shortest-plank-vulnerability","slug":"improving-the-shortest-plank-vulnerability","title":"Improving the Shortest Plank: Vulnerability-Aware Adversarial Training for Robust Recommender System","date":"2024-09-26","arxiv_id":"2409.17476","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-the-shortest-plank-vulnerability#ran","syntology_url":"https://syntology.ai/paper/2409.17476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17476"}},"official":{"repos":["Kaike-Zhang/VAT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/train-once-deploy-anywhere-matryoshka","slug":"train-once-deploy-anywhere-matryoshka","title":"Train Once, Deploy Anywhere: Matryoshka Representation Learning for Multimodal Recommendation","date":"2024-09-25","arxiv_id":"2409.16627","repositories_listed":1,"syntology":null},{"url":"/paper/creating-healthy-friction-determining","slug":"creating-healthy-friction-determining","title":"Creating Healthy Friction: Determining Stakeholder Requirements of Job Recommendation Explanations","date":"2024-09-24","arxiv_id":"2409.15971","repositories_listed":1,"syntology":null},{"url":"/paper/ducho-meets-elliot-large-scale-benchmarks-for-1","slug":"ducho-meets-elliot-large-scale-benchmarks-for-1","title":"Ducho meets Elliot: Large-scale Benchmarks for Multimodal Recommendation","date":"2024-09-24","arxiv_id":"2409.15857","repositories_listed":1,"syntology":null},{"url":"/paper/tim4rec-an-efficient-sequential","slug":"tim4rec-an-efficient-sequential","title":"TiM4Rec: An Efficient Sequential Recommendation Model Based on Time-Aware Structured State Space Duality Model","date":"2024-09-24","arxiv_id":"2409.16182","repositories_listed":1,"syntology":null},{"url":"/paper/fedslate-a-federated-deep-reinforcement","slug":"fedslate-a-federated-deep-reinforcement","title":"FedSlate:A Federated Deep Reinforcement Learning Recommender System","date":"2024-09-23","arxiv_id":"2409.14872","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-persuasion-towards-conversational","slug":"beyond-persuasion-towards-conversational","title":"Beyond Persuasion: Towards Conversational Recommender System with Credible Explanations","date":"2024-09-22","arxiv_id":"2409.14399","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-bpr-a-replicability-study-of-a","slug":"revisiting-bpr-a-replicability-study-of-a","title":"Revisiting BPR: A Replicability Study of a Common Recommender System Baseline","date":"2024-09-21","arxiv_id":"2409.14217","repositories_listed":1,"syntology":null},{"url":"/paper/data-augmentation-for-sequential","slug":"data-augmentation-for-sequential","title":"Data Augmentation for Sequential Recommendation: A Survey","date":"2024-09-20","arxiv_id":"2409.13545","repositories_listed":1,"syntology":null},{"url":"/paper/hllm-enhancing-sequential-recommendations-via","slug":"hllm-enhancing-sequential-recommendations-via","title":"HLLM: Enhancing Sequential Recommendations via Hierarchical Large Language Models for Item and User Modeling","date":"2024-09-19","arxiv_id":"2409.12740","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/hllm-enhancing-sequential-recommendations-via#ran","syntology_url":"https://syntology.ai/paper/2409.12740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.12740"}},"official":{"repos":["bytedance/hllm"],"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/basket-enhanced-heterogenous-hypergraph-for","slug":"basket-enhanced-heterogenous-hypergraph-for","title":"Basket-Enhanced Heterogenous Hypergraph for Price-Sensitive Next Basket Recommendation","date":"2024-09-18","arxiv_id":"2409.11695","repositories_listed":1,"syntology":null},{"url":"/paper/beeformer-bridging-the-gap-between-semantic","slug":"beeformer-bridging-the-gap-between-semantic","title":"beeFormer: Bridging the Gap Between Semantic and Interaction Similarity in Recommender Systems","date":"2024-09-16","arxiv_id":"2409.10309","repositories_listed":1,"syntology":null},{"url":"/paper/comparative-analysis-of-pretrained-audio","slug":"comparative-analysis-of-pretrained-audio","title":"Comparative Analysis of Pretrained Audio Representations in Music Recommender Systems","date":"2024-09-13","arxiv_id":"2409.08987","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-challenges-of-studying-bias-in","slug":"on-the-challenges-of-studying-bias-in","title":"On the challenges of studying bias in Recommender Systems: A UserKNN case study","date":"2024-09-12","arxiv_id":"2409.08046","repositories_listed":1,"syntology":null},{"url":"/paper/replay-a-recommendation-framework-for","slug":"replay-a-recommendation-framework-for","title":"RePlay: a Recommendation Framework for Experimentation and Production Use","date":"2024-09-11","arxiv_id":"2409.07272","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-learnable-item-tokenization-for","slug":"end-to-end-learnable-item-tokenization-for","title":"Generative Recommender with End-to-End Learnable Item Tokenization","date":"2024-09-09","arxiv_id":"2409.05546","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-diffusion-models-for-recommender","slug":"a-survey-on-diffusion-models-for-recommender","title":"A Survey on Diffusion Models for Recommender Systems","date":"2024-09-08","arxiv_id":"2409.05033","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-sequential-music-recommendation","slug":"enhancing-sequential-music-recommendation","title":"Enhancing Sequential Music Recommendation with Personalized Popularity Awareness","date":"2024-09-06","arxiv_id":"2409.04329","repositories_listed":1,"syntology":null},{"url":"/paper/improved-diversity-promoting-collaborative","slug":"improved-diversity-promoting-collaborative","title":"Improved Diversity-Promoting Collaborative Metric Learning for Recommendation","date":"2024-09-02","arxiv_id":"2409.01012","repositories_listed":1,"syntology":null},{"url":"/paper/fair-reciprocal-recommendation-in-matching","slug":"fair-reciprocal-recommendation-in-matching","title":"Fair Reciprocal Recommendation in Matching Markets","date":"2024-09-01","arxiv_id":"2409.00720","repositories_listed":1,"syntology":null},{"url":"/paper/an-enhanced-batch-query-architecture-in-real","slug":"an-enhanced-batch-query-architecture-in-real","title":"An Enhanced Batch Query Architecture in Real-time Recommendation","date":"2024-08-31","arxiv_id":"2409.00400","repositories_listed":1,"syntology":null},{"url":"/paper/not-all-videos-become-outdated-short-video","slug":"not-all-videos-become-outdated-short-video","title":"Not All Videos Become Outdated: Short-Video Recommendation by Learning to Deconfound Release Interval Bias","date":"2024-08-30","arxiv_id":"2408.17332","repositories_listed":1,"syntology":null},{"url":"/paper/towards-empathetic-conversational-recommender","slug":"towards-empathetic-conversational-recommender","title":"Towards Empathetic Conversational Recommender Systems","date":"2024-08-30","arxiv_id":"2409.10527","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/towards-empathetic-conversational-recommender#ran","syntology_url":"https://syntology.ai/paper/2409.10527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.10527"}},"official":{"repos":["zxd-octopus/ECR"],"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/do-recommender-systems-promote-local-music-a","slug":"do-recommender-systems-promote-local-music-a","title":"Do Recommender Systems Promote Local Music? A Reproducibility Study Using Music Streaming Data","date":"2024-08-29","arxiv_id":"2408.16430","repositories_listed":1,"syntology":null},{"url":"/paper/transformers-meet-act-r-repeat-aware-and","slug":"transformers-meet-act-r-repeat-aware-and","title":"Transformers Meet ACT-R: Repeat-Aware and Sequential Listening Session Recommendation","date":"2024-08-29","arxiv_id":"2408.16578","repositories_listed":1,"syntology":null},{"url":"/paper/cure4rec-a-benchmark-for-recommendation","slug":"cure4rec-a-benchmark-for-recommendation","title":"CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influence","date":"2024-08-26","arxiv_id":"2408.14393","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"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) · 1 unverified","sample_list":"/paper/cure4rec-a-benchmark-for-recommendation#ran","syntology_url":"https://syntology.ai/paper/2408.14393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.14393"}},"official":{"repos":["xiye7lai/cure4rec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cf-kan-kolmogorov-arnold-network-based","slug":"cf-kan-kolmogorov-arnold-network-based","title":"CF-KAN: Kolmogorov-Arnold Network-based Collaborative Filtering to Mitigate Catastrophic Forgetting in Recommender Systems","date":"2024-08-25","arxiv_id":"2409.05878","repositories_listed":1,"syntology":null},{"url":"/paper/csrec-rethinking-sequential-recommendation","slug":"csrec-rethinking-sequential-recommendation","title":"CSRec: Rethinking Sequential Recommendation from A Causal Perspective","date":"2024-08-23","arxiv_id":"2409.05872","repositories_listed":1,"syntology":null},{"url":"/paper/behavior-pattern-mining-based-multi-behavior","slug":"behavior-pattern-mining-based-multi-behavior","title":"Behavior Pattern Mining-based Multi-Behavior Recommendation","date":"2024-08-22","arxiv_id":"2408.12152","repositories_listed":1,"syntology":null}],"record_sha256":"fc9a084e4d533e468a44d3f15946394ecfdc43d8a863fa4b722acfd566d60b81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}