{"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/8","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":8,"pages_in_order":61,"rows_per_page":100,"rows":[701,800],"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/7","next":"/task/recommendation-systems/papers/9","papers":[{"url":"/paper/cela-cost-efficient-language-model-alignment","slug":"cela-cost-efficient-language-model-alignment","title":"CELA: Cost-Efficient Language Model Alignment for CTR Prediction","date":"2024-05-17","arxiv_id":"2405.10596","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-static-calibration-the-impact-of-user","slug":"beyond-static-calibration-the-impact-of-user","title":"Beyond Static Calibration: The Impact of User Preference Dynamics on Calibrated Recommendation","date":"2024-05-16","arxiv_id":"2405.10232","repositories_listed":1,"syntology":null},{"url":"/paper/positional-encoding-is-not-the-same-as","slug":"positional-encoding-is-not-the-same-as","title":"Positional encoding is not the same as context: A study on positional encoding for sequential recommendation","date":"2024-05-16","arxiv_id":"2405.10436","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"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) · 0 unverified","sample_list":"/paper/positional-encoding-is-not-the-same-as#ran","syntology_url":"https://syntology.ai/paper/2405.10436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.10436"}},"official":{"repos":["researcher1741/position_encoding_srs"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-the-individuality-and-collectivity","slug":"exploring-the-individuality-and-collectivity","title":"Exploring the Individuality and Collectivity of Intents behind Interactions for Graph Collaborative Filtering","date":"2024-05-15","arxiv_id":"2405.09042","repositories_listed":1,"syntology":null},{"url":"/paper/treatment-effect-estimation-for-user-interest","slug":"treatment-effect-estimation-for-user-interest","title":"Treatment Effect Estimation for User Interest Exploration on Recommender Systems","date":"2024-05-14","arxiv_id":"2405.08582","repositories_listed":1,"syntology":null},{"url":"/paper/a-llm-based-controllable-scalable-human","slug":"a-llm-based-controllable-scalable-human","title":"A LLM-based Controllable, Scalable, Human-Involved User Simulator Framework for Conversational Recommender Systems","date":"2024-05-13","arxiv_id":"2405.08035","repositories_listed":1,"syntology":null},{"url":"/paper/is-interpretable-machine-learning-effective","slug":"is-interpretable-machine-learning-effective","title":"Is Interpretable Machine Learning Effective at Feature Selection for Neural Learning-to-Rank?","date":"2024-05-13","arxiv_id":"2405.07782","repositories_listed":1,"syntology":null},{"url":"/paper/music-emotion-prediction-using-recurrent","slug":"music-emotion-prediction-using-recurrent","title":"Music Emotion Prediction Using Recurrent Neural Networks","date":"2024-05-10","arxiv_id":"2405.06747","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-baseline-corrections-for-off-policy","slug":"optimal-baseline-corrections-for-off-policy","title":"Optimal Baseline Corrections for Off-Policy Contextual Bandits","date":"2024-05-09","arxiv_id":"2405.05736","repositories_listed":1,"syntology":null},{"url":"/paper/federated-adaptation-for-foundation-model","slug":"federated-adaptation-for-foundation-model","title":"Federated Adaptation for Foundation Model-based Recommendations","date":"2024-05-08","arxiv_id":"2405.04840","repositories_listed":1,"syntology":null},{"url":"/paper/learning-social-graph-for-inactive-user","slug":"learning-social-graph-for-inactive-user","title":"Learning Social Graph for Inactive User Recommendation","date":"2024-05-08","arxiv_id":"2405.05288","repositories_listed":1,"syntology":null},{"url":"/paper/dataset-and-models-for-item-recommendation","slug":"dataset-and-models-for-item-recommendation","title":"Dataset and Models for Item Recommendation Using Multi-Modal User Interactions","date":"2024-05-07","arxiv_id":"2405.04246","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-adaptation-from-large-language","slug":"knowledge-adaptation-from-large-language","title":"LEARN: Knowledge Adaptation from Large Language Model to Recommendation for Practical Industrial Application","date":"2024-05-07","arxiv_id":"2405.03988","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/knowledge-adaptation-from-large-language#ran","syntology_url":"https://syntology.ai/paper/2405.03988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03988"}},"official":{"repos":["adxcreative/LEARN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-margin-loss-proposal-and-application-in","slug":"multi-margin-loss-proposal-and-application-in","title":"Multi-Margin Cosine Loss: Proposal and Application in Recommender Systems","date":"2024-05-07","arxiv_id":"2405.04614","repositories_listed":1,"syntology":null},{"url":"/paper/hire-me-or-not-examining-language-model-s","slug":"hire-me-or-not-examining-language-model-s","title":"Hire Me or Not? Examining Language Model's Behavior with Occupation Attributes","date":"2024-05-06","arxiv_id":"2405.06687","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/hire-me-or-not-examining-language-model-s#ran","syntology_url":"https://syntology.ai/paper/2405.06687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.06687"}},"official":{"repos":["daminz97/multi-step_gsv"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tf4ctr-twin-focus-framework-for-ctr","slug":"tf4ctr-twin-focus-framework-for-ctr","title":"TF4CTR: Twin Focus Framework for CTR Prediction via Adaptive Sample Differentiation","date":"2024-05-06","arxiv_id":"2405.03167","repositories_listed":1,"syntology":null},{"url":"/paper/vector-quantization-for-recommender-systems-a","slug":"vector-quantization-for-recommender-systems-a","title":"Vector Quantization for Recommender Systems: A Review and Outlook","date":"2024-05-06","arxiv_id":"2405.03110","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-recommendation-via","slug":"multi-objective-recommendation-via","title":"Multi-Objective Recommendation via Multivariate Policy Learning","date":"2024-05-03","arxiv_id":"2405.02141","repositories_listed":1,"syntology":null},{"url":"/paper/fair-recommendations-with-limited-sensitive","slug":"fair-recommendations-with-limited-sensitive","title":"Fair Recommendations with Limited Sensitive Attributes: A Distributionally Robust Optimization Approach","date":"2024-05-02","arxiv_id":"2405.01063","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-activity-driven-music-listening-with","slug":"modeling-activity-driven-music-listening-with","title":"Modeling Activity-Driven Music Listening with PACE","date":"2024-05-02","arxiv_id":"2405.01417","repositories_listed":1,"syntology":null},{"url":"/paper/a-first-look-at-selection-bias-in-preference","slug":"a-first-look-at-selection-bias-in-preference","title":"A First Look at Selection Bias in Preference Elicitation for Recommendation","date":"2024-05-01","arxiv_id":"2405.00554","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-sampling-for-contrastive-views-and","slug":"stochastic-sampling-for-contrastive-views-and","title":"SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation","date":"2024-05-01","arxiv_id":"2405.00287","repositories_listed":1,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 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; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/stochastic-sampling-for-contrastive-views-and#ran","syntology_url":"https://syntology.ai/paper/2405.00287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.00287"}},"official":{"repos":["jeongwhanchoi/scone"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/be-aware-of-the-neighborhood-effect-modeling","slug":"be-aware-of-the-neighborhood-effect-modeling","title":"Be Aware of the Neighborhood Effect: Modeling Selection Bias under Interference","date":"2024-04-30","arxiv_id":"2404.19620","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/be-aware-of-the-neighborhood-effect-modeling#ran","syntology_url":"https://syntology.ai/paper/2404.19620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19620"}},"official":{"repos":["haoxuanli-pku/iclr24-interference"],"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/going-beyond-popularity-and-positivity-bias","slug":"going-beyond-popularity-and-positivity-bias","title":"Going Beyond Popularity and Positivity Bias: Correcting for Multifactorial Bias in Recommender Systems","date":"2024-04-29","arxiv_id":"2404.18640","repositories_listed":1,"syntology":null},{"url":"/paper/hmar-hierarchical-masked-attention-for-multi","slug":"hmar-hierarchical-masked-attention-for-multi","title":"HMAR: Hierarchical Masked Attention for Multi-Behaviour Recommendation","date":"2024-04-29","arxiv_id":"2405.09638","repositories_listed":1,"syntology":null},{"url":"/paper/conformal-ranked-retrieval","slug":"conformal-ranked-retrieval","title":"Two-stage Risk Control with Application to Ranked Retrieval","date":"2024-04-27","arxiv_id":"2404.17769","repositories_listed":1,"syntology":null},{"url":"/paper/towards-robust-recommendation-a-review-and-an","slug":"towards-robust-recommendation-a-review-and-an","title":"Towards Robust Recommendation: A Review and an Adversarial Robustness Evaluation Library","date":"2024-04-27","arxiv_id":"2404.17844","repositories_listed":1,"syntology":null},{"url":"/paper/truthsr-trustworthy-sequential-recommender","slug":"truthsr-trustworthy-sequential-recommender","title":"TruthSR: Trustworthy Sequential Recommender Systems via User-generated Multimodal Content","date":"2024-04-26","arxiv_id":"2404.17238","repositories_listed":1,"syntology":null},{"url":"/paper/introducing-eeg-analyses-to-help-personal","slug":"introducing-eeg-analyses-to-help-personal","title":"Introducing EEG Analyses to Help Personal Music Preference Prediction","date":"2024-04-24","arxiv_id":"2404.15753","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-graph-completion-using-structural","slug":"knowledge-graph-completion-using-structural","title":"Knowledge Graph Completion using Structural and Textual Embeddings","date":"2024-04-24","arxiv_id":"2404.16206","repositories_listed":1,"syntology":null},{"url":"/paper/mamba-360-survey-of-state-space-models-as","slug":"mamba-360-survey-of-state-space-models-as","title":"Mamba-360: Survey of State Space Models as Transformer Alternative for Long Sequence Modelling: Methods, Applications, and Challenges","date":"2024-04-24","arxiv_id":"2404.16112","repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-causal-preference-learning-for","slug":"cross-domain-causal-preference-learning-for","title":"Cross-Domain Causal Preference Learning for Out-of-Distribution Recommendation","date":"2024-04-23","arxiv_id":"2404.14856","repositories_listed":1,"syntology":null},{"url":"/paper/from-matching-to-generation-a-survey-on","slug":"from-matching-to-generation-a-survey-on","title":"From Matching to Generation: A Survey on Generative Information Retrieval","date":"2024-04-23","arxiv_id":"2404.14851","repositories_listed":1,"syntology":null},{"url":"/paper/manipulating-recommender-systems-a-survey-of","slug":"manipulating-recommender-systems-a-survey-of","title":"Manipulating Recommender Systems: A Survey of Poisoning Attacks and Countermeasures","date":"2024-04-23","arxiv_id":"2404.14942","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-filtering-based-on-diffusion","slug":"collaborative-filtering-based-on-diffusion","title":"Collaborative Filtering Based on Diffusion Models: Unveiling the Potential of High-Order Connectivity","date":"2024-04-22","arxiv_id":"2404.14240","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/collaborative-filtering-based-on-diffusion#ran","syntology_url":"https://syntology.ai/paper/2404.14240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14240"}},"official":{"repos":["jackfrost168/cf_diff"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-level-sequence-denoising-with-cross","slug":"multi-level-sequence-denoising-with-cross","title":"Multi-Level Sequence Denoising with Cross-Signal Contrastive Learning for Sequential Recommendation","date":"2024-04-22","arxiv_id":"2404.13878","repositories_listed":1,"syntology":null},{"url":"/paper/turbo-cf-matrix-decomposition-free-graph","slug":"turbo-cf-matrix-decomposition-free-graph","title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","date":"2024-04-22","arxiv_id":"2404.14243","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/turbo-cf-matrix-decomposition-free-graph#ran","syntology_url":"https://syntology.ai/paper/2404.14243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14243"}},"official":{"repos":["jindeok/turbo-cf"],"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/finerec-exploring-fine-grained-sequential","slug":"finerec-exploring-fine-grained-sequential","title":"FineRec:Exploring Fine-grained Sequential Recommendation","date":"2024-04-19","arxiv_id":"2404.12975","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/finerec-exploring-fine-grained-sequential#ran","syntology_url":"https://syntology.ai/paper/2404.12975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12975"}},"official":{"repos":["zhang-xiaokun/finerec"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/relationship-discovery-for-drug","slug":"relationship-discovery-for-drug","title":"CausalMed: Causality-Based Personalized Medication Recommendation Centered on Patient health state","date":"2024-04-18","arxiv_id":"2404.12228","repositories_listed":1,"syntology":null},{"url":"/paper/sigformer-sign-aware-graph-transformer-for","slug":"sigformer-sign-aware-graph-transformer-for","title":"SIGformer: Sign-aware Graph Transformer for Recommendation","date":"2024-04-18","arxiv_id":"2404.11982","repositories_listed":1,"syntology":null},{"url":"/paper/behavior-alignment-a-new-perspective-of","slug":"behavior-alignment-a-new-perspective-of","title":"Behavior Alignment: A New Perspective of Evaluating LLM-based Conversational Recommender Systems","date":"2024-04-17","arxiv_id":"2404.11773","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-cascaded-graph-convolution","slug":"disentangled-cascaded-graph-convolution","title":"Disentangled Cascaded Graph Convolution Networks for Multi-Behavior Recommendation","date":"2024-04-17","arxiv_id":"2404.11519","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-meet-collaborative","slug":"large-language-models-meet-collaborative","title":"Large Language Models meet Collaborative Filtering: An Efficient All-round LLM-based Recommender System","date":"2024-04-17","arxiv_id":"2404.11343","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/large-language-models-meet-collaborative#ran","syntology_url":"https://syntology.ai/paper/2404.11343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11343"}},"official":{"repos":["ghdtjr/a-llmrec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unifying-bias-and-unfairness-in-information","slug":"unifying-bias-and-unfairness-in-information","title":"Bias and Unfairness in Information Retrieval Systems: New Challenges in the LLM Era","date":"2024-04-17","arxiv_id":"2404.11457","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-based-graph-collaborative-filtering","slug":"cluster-based-graph-collaborative-filtering","title":"Cluster-based Graph Collaborative Filtering","date":"2024-04-16","arxiv_id":"2404.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":6,"phrase":"6 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cluster-based-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/2404.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10321"}},"official":{"repos":["zhao254014/clustergcf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/course-recommender-systems-need-to-consider","slug":"course-recommender-systems-need-to-consider","title":"Course Recommender Systems Need to Consider the Job Market","date":"2024-04-16","arxiv_id":"2404.10876","repositories_listed":1,"syntology":null},{"url":"/paper/hellinger-ucb-a-novel-algorithm-for","slug":"hellinger-ucb-a-novel-algorithm-for","title":"HELLINGER-UCB: A novel algorithm for stochastic multi-armed bandit problem and cold start problem in recommender system","date":"2024-04-16","arxiv_id":"2404.10207","repositories_listed":1,"syntology":null},{"url":"/paper/nfarec-a-negative-feedback-aware-recommender","slug":"nfarec-a-negative-feedback-aware-recommender","title":"NFARec: A Negative Feedback-Aware Recommender Model","date":"2024-04-10","arxiv_id":"2404.06900","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-training-of-multimodal-model-and","slug":"end-to-end-training-of-multimodal-model-and","title":"End-to-end training of Multimodal Model and ranking Model","date":"2024-04-09","arxiv_id":"2404.06078","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-survey-on-self-supervised","slug":"a-comprehensive-survey-on-self-supervised","title":"A Comprehensive Survey on Self-Supervised Learning for Recommendation","date":"2024-04-04","arxiv_id":"2404.03354","repositories_listed":1,"syntology":null},{"url":"/paper/concept-an-evaluation-protocol-on","slug":"concept-an-evaluation-protocol-on","title":"Concept -- An Evaluation Protocol on Conversational Recommender Systems with System-centric and User-centric Factors","date":"2024-04-04","arxiv_id":"2404.03304","repositories_listed":1,"syntology":null},{"url":"/paper/does-knowledge-graph-really-matter-for","slug":"does-knowledge-graph-really-matter-for","title":"KG4RecEval: Does Knowledge Graph Really Matter for Recommender Systems?","date":"2024-04-04","arxiv_id":"2404.03164","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-for-optimizing-both","slug":"sequential-recommendation-for-optimizing-both","title":"Sequential Recommendation for Optimizing Both Immediate Feedback and Long-term Retention","date":"2024-04-04","arxiv_id":"2404.03637","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":13,"phrase":"13 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequential-recommendation-for-optimizing-both#ran","syntology_url":"https://syntology.ai/paper/2404.03637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03637"}},"official":{"repos":["applied-machine-learning-lab/dt4ier"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-language-modeling-paradigm","slug":"understanding-language-modeling-paradigm","title":"Understanding Language Modeling Paradigm Adaptations in Recommender Systems: Lessons Learned and Open Challenges","date":"2024-04-04","arxiv_id":"2404.03788","repositories_listed":1,"syntology":null},{"url":"/paper/a-review-of-modern-recommender-systems-using","slug":"a-review-of-modern-recommender-systems-using","title":"A Review of Modern Recommender Systems Using Generative Models (Gen-RecSys)","date":"2024-03-31","arxiv_id":"2404.00579","repositories_listed":1,"syntology":null},{"url":"/paper/tired-of-plugins-large-language-models-can-be","slug":"tired-of-plugins-large-language-models-can-be","title":"LLMTreeRec: Unleashing the Power of Large Language Models for Cold-Start Recommendations","date":"2024-03-31","arxiv_id":"2404.00702","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-yet-effective-approach-for","slug":"a-simple-yet-effective-approach-for","title":"A Simple Yet Effective Approach for Diversified Session-Based Recommendation","date":"2024-03-30","arxiv_id":"2404.00261","repositories_listed":1,"syntology":null},{"url":"/paper/kguf-simple-knowledge-aware-graph-based","slug":"kguf-simple-knowledge-aware-graph-based","title":"KGUF: Simple Knowledge-aware Graph-based Recommender with User-based Semantic Features Filtering","date":"2024-03-29","arxiv_id":"2403.20095","repositories_listed":1,"syntology":null},{"url":"/paper/review-based-cross-domain-recommendation-via","slug":"review-based-cross-domain-recommendation-via","title":"Review-Based Hyperbolic Cross-Domain Recommendation","date":"2024-03-29","arxiv_id":"2403.20298","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-in-ranking-robustness-through","slug":"fairness-in-ranking-robustness-through","title":"Fairness in Ranking: Robustness through Randomization without the Protected Attribute","date":"2024-03-28","arxiv_id":"2403.19419","repositories_listed":1,"syntology":null},{"url":"/paper/a-situation-aware-enhancer-for-personalized","slug":"a-situation-aware-enhancer-for-personalized","title":"A Situation-aware Enhancer for Personalized Recommendation","date":"2024-03-27","arxiv_id":"2403.18317","repositories_listed":1,"syntology":null},{"url":"/paper/enhanced-generative-recommendation-via","slug":"enhanced-generative-recommendation-via","title":"Content-Based Collaborative Generation for Recommender Systems","date":"2024-03-27","arxiv_id":"2403.18480","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/enhanced-generative-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/2403.18480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.18480"}},"official":{"repos":["junewang0614/colarec"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/how-does-message-passing-improve","slug":"how-does-message-passing-improve","title":"How Does Message Passing Improve Collaborative Filtering?","date":"2024-03-27","arxiv_id":"2404.08660","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/how-does-message-passing-improve#ran","syntology_url":"https://syntology.ai/paper/2404.08660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08660"}},"official":{"repos":["snap-research/test-time-aggregation-for-cf"],"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/sequential-recommendation-with-latent","slug":"sequential-recommendation-with-latent","title":"Sequential Recommendation with Latent Relations based on Large Language Model","date":"2024-03-27","arxiv_id":"2403.18348","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/sequential-recommendation-with-latent#ran","syntology_url":"https://syntology.ai/paper/2403.18348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.18348"}},"official":{"repos":["ysh-1998/lrd"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stock-recommendations-for-individual","slug":"stock-recommendations-for-individual","title":"Stock Recommendations for Individual Investors: A Temporal Graph Network Approach with Mean-Variance Efficient Sampling","date":"2024-03-27","arxiv_id":"2404.07223","repositories_listed":1,"syntology":null},{"url":"/paper/to-recommend-or-not-recommendability","slug":"to-recommend-or-not-recommendability","title":"To Recommend or Not: Recommendability Identification in Conversations with Pre-trained Language Models","date":"2024-03-27","arxiv_id":"2403.18628","repositories_listed":1,"syntology":null},{"url":"/paper/afdgcf-adaptive-feature-de-correlation-graph","slug":"afdgcf-adaptive-feature-de-correlation-graph","title":"AFDGCF: Adaptive Feature De-correlation Graph Collaborative Filtering for Recommendations","date":"2024-03-26","arxiv_id":"2403.17416","repositories_listed":1,"syntology":null},{"url":"/paper/all-in-one-heterogeneous-interaction-modeling","slug":"all-in-one-heterogeneous-interaction-modeling","title":"All-in-One: Heterogeneous Interaction Modeling for Cold-Start Rating Prediction","date":"2024-03-26","arxiv_id":"2403.17740","repositories_listed":1,"syntology":null},{"url":"/paper/eulerformer-sequential-user-behavior-modeling","slug":"eulerformer-sequential-user-behavior-modeling","title":"EulerFormer: Sequential User Behavior Modeling with Complex Vector Attention","date":"2024-03-26","arxiv_id":"2403.17729","repositories_listed":1,"syntology":null},{"url":"/paper/leave-no-patient-behind-enhancing-medication","slug":"leave-no-patient-behind-enhancing-medication","title":"Leave No Patient Behind: Enhancing Medication Recommendation for Rare Disease Patients","date":"2024-03-26","arxiv_id":"2403.17745","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":0,"n_no_contract":6,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/leave-no-patient-behind-enhancing-medication#ran","syntology_url":"https://syntology.ai/paper/2403.17745","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17745"}},"official":{"repos":["zzhustc2016/raremed"],"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/touch-the-core-exploring-task-dependence","slug":"touch-the-core-exploring-task-dependence","title":"Touch the Core: Exploring Task Dependence Among Hybrid Targets for Recommendation","date":"2024-03-26","arxiv_id":"2403.17442","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-based-negative-sampling-on-graphs","slug":"diffusion-based-negative-sampling-on-graphs","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","date":"2024-03-25","arxiv_id":"2403.17259","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/diffusion-based-negative-sampling-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2403.17259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17259"}},"official":{"repos":["ntkien1904/dmns"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-augmentation-for-recommendation","slug":"graph-augmentation-for-recommendation","title":"Graph Augmentation for Recommendation","date":"2024-03-25","arxiv_id":"2403.16656","repositories_listed":1,"syntology":null},{"url":"/paper/a-temporal-graph-network-framework-for","slug":"a-temporal-graph-network-framework-for","title":"A Temporal Graph Network Framework for Dynamic Recommendation","date":"2024-03-24","arxiv_id":"2403.16066","repositories_listed":1,"syntology":null},{"url":"/paper/leave-no-one-behind-online-self-supervised","slug":"leave-no-one-behind-online-self-supervised","title":"Leave No One Behind: Online Self-Supervised Self-Distillation for Sequential Recommendation","date":"2024-03-22","arxiv_id":"2404.07219","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-enhanced-recommendation-with-user","slug":"knowledge-enhanced-recommendation-with-user","title":"Knowledge-Enhanced Recommendation with User-Centric Subgraph Network","date":"2024-03-21","arxiv_id":"2403.14377","repositories_listed":1,"syntology":null},{"url":"/paper/a-large-language-model-enhanced-sequential","slug":"a-large-language-model-enhanced-sequential","title":"A Large Language Model Enhanced Sequential Recommender for Joint Video and Comment Recommendation","date":"2024-03-20","arxiv_id":"2403.13574","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"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) · 0 unverified","sample_list":"/paper/a-large-language-model-enhanced-sequential#ran","syntology_url":"https://syntology.ai/paper/2403.13574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13574"}},"official":{"repos":["rucaibox/lsvcr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/harnessing-large-language-models-for-text","slug":"harnessing-large-language-models-for-text","title":"Harnessing Large Language Models for Text-Rich Sequential Recommendation","date":"2024-03-20","arxiv_id":"2403.13325","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/harnessing-large-language-models-for-text#ran","syntology_url":"https://syntology.ai/paper/2403.13325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13325"}},"official":{"repos":["zhengzhi-1997/llm-trsr"],"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/algorithmic-collective-action-in-recommender","slug":"algorithmic-collective-action-in-recommender","title":"Algorithmic Collective Action in Recommender Systems: Promoting Songs by Reordering Playlists","date":"2024-03-19","arxiv_id":"2404.04269","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/algorithmic-collective-action-in-recommender#ran","syntology_url":"https://syntology.ai/paper/2404.04269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.04269"}},"official":{"repos":["joebaumann/recsys-collectiveaction"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerating-matrix-factorization-by-dynamic","slug":"accelerating-matrix-factorization-by-dynamic","title":"Accelerating Matrix Factorization by Dynamic Pruning for Fast Recommendation","date":"2024-03-18","arxiv_id":"2404.04265","repositories_listed":1,"syntology":null},{"url":"/paper/is-contrastive-learning-necessary-a-study-of","slug":"is-contrastive-learning-necessary-a-study-of","title":"Is Contrastive Learning Necessary? A Study of Data Augmentation vs Contrastive Learning in Sequential Recommendation","date":"2024-03-17","arxiv_id":"2403.11136","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-large-language-models-as","slug":"evaluating-large-language-models-as","title":"Evaluating Large Language Models as Generative User Simulators for Conversational Recommendation","date":"2024-03-13","arxiv_id":"2403.09738","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/evaluating-large-language-models-as#ran","syntology_url":"https://syntology.ai/paper/2403.09738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09738"}},"official":{"repos":["granelle/naacl24-user-sim"],"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/empowering-sequential-recommendation-from","slug":"empowering-sequential-recommendation-from","title":"Empowering Sequential Recommendation from Collaborative Signals and Semantic Relatedness","date":"2024-03-12","arxiv_id":"2403.07623","repositories_listed":1,"syntology":null},{"url":"/paper/proactive-recommendation-with-iterative","slug":"proactive-recommendation-with-iterative","title":"Proactive Recommendation with Iterative Preference Guidance","date":"2024-03-12","arxiv_id":"2403.07571","repositories_listed":1,"syntology":null},{"url":"/paper/recai-leveraging-large-language-models-for","slug":"recai-leveraging-large-language-models-for","title":"RecAI: Leveraging Large Language Models for Next-Generation Recommender Systems","date":"2024-03-11","arxiv_id":"2403.06465","repositories_listed":1,"syntology":null},{"url":"/paper/aligning-large-language-models-for","slug":"aligning-large-language-models-for","title":"Aligning Large Language Models for Controllable Recommendations","date":"2024-03-08","arxiv_id":"2403.05063","repositories_listed":1,"syntology":null},{"url":"/paper/aligning-gptrec-with-beyond-accuracy-goals","slug":"aligning-gptrec-with-beyond-accuracy-goals","title":"Aligning GPTRec with Beyond-Accuracy Goals with Reinforcement Learning","date":"2024-03-07","arxiv_id":"2403.04875","repositories_listed":1,"syntology":null},{"url":"/paper/pearl-a-review-driven-persona-knowledge","slug":"pearl-a-review-driven-persona-knowledge","title":"Pearl: A Review-driven Persona-Knowledge Grounded Conversational Recommendation Dataset","date":"2024-03-07","arxiv_id":"2403.04460","repositories_listed":1,"syntology":null},{"url":"/paper/reproducing-popularity-bias-in-recommendation","slug":"reproducing-popularity-bias-in-recommendation","title":"Reproducing Popularity Bias in Recommendation: The Effect of Evaluation Strategies","date":"2024-03-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fedhcdr-federated-cross-domain-recommendation","slug":"fedhcdr-federated-cross-domain-recommendation","title":"FedHCDR: Federated Cross-Domain Recommendation with Hypergraph Signal Decoupling","date":"2024-03-05","arxiv_id":"2403.02630","repositories_listed":1,"syntology":null},{"url":"/paper/uplift-modeling-for-target-user-attacks-on","slug":"uplift-modeling-for-target-user-attacks-on","title":"Uplift Modeling for Target User Attacks on Recommender Systems","date":"2024-03-05","arxiv_id":"2403.02692","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-completion-with-convex-optimization","slug":"matrix-completion-with-convex-optimization","title":"Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image Inpainting","date":"2024-03-04","arxiv_id":"2403.01919","repositories_listed":1,"syntology":null},{"url":"/paper/recommending-missed-citations-identified-by","slug":"recommending-missed-citations-identified-by","title":"Recommending Missed Citations Identified by Reviewers: A New Task, Dataset and Baselines","date":"2024-03-04","arxiv_id":"2403.01873","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"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) · 0 unverified","sample_list":"/paper/recommending-missed-citations-identified-by#ran","syntology_url":"https://syntology.ai/paper/2403.01873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01873"}},"official":{"repos":["chainsawm/rmc"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/opengraph-towards-open-graph-foundation","slug":"opengraph-towards-open-graph-foundation","title":"OpenGraph: Towards Open Graph Foundation Models","date":"2024-03-02","arxiv_id":"2403.01121","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/opengraph-towards-open-graph-foundation#ran","syntology_url":"https://syntology.ai/paper/2403.01121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01121"}},"official":{"repos":["hkuds/opengraph"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mentor-multi-level-self-supervised-learning","slug":"mentor-multi-level-self-supervised-learning","title":"MENTOR: Multi-level Self-supervised Learning for Multimodal Recommendation","date":"2024-02-29","arxiv_id":"2402.19407","repositories_listed":1,"syntology":null},{"url":"/paper/prospect-personalized-recommendation-on-large","slug":"prospect-personalized-recommendation-on-large","title":"Prospect Personalized Recommendation on Large Language Model-based Agent Platform","date":"2024-02-28","arxiv_id":"2402.18240","repositories_listed":1,"syntology":null},{"url":"/paper/sequence-level-semantic-representation-fusion","slug":"sequence-level-semantic-representation-fusion","title":"Sequence-level Semantic Representation Fusion for Recommender Systems","date":"2024-02-28","arxiv_id":"2402.18166","repositories_listed":1,"syntology":null},{"url":"/paper/promptmm-multi-modal-knowledge-distillation","slug":"promptmm-multi-modal-knowledge-distillation","title":"PromptMM: Multi-Modal Knowledge Distillation for Recommendation with Prompt-Tuning","date":"2024-02-27","arxiv_id":"2402.17188","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":11,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/promptmm-multi-modal-knowledge-distillation#ran","syntology_url":"https://syntology.ai/paper/2402.17188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17188"}},"official":{"repos":["hkuds/promptmm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/boxrec-recommending-a-box-of-preferred","slug":"boxrec-recommending-a-box-of-preferred","title":"BOXREC: Recommending a Box of Preferred Outfits in Online Shopping","date":"2024-02-26","arxiv_id":"2402.16660","repositories_listed":1,"syntology":null},{"url":"/paper/deep-rating-elicitation-for-new-users-in","slug":"deep-rating-elicitation-for-new-users-in","title":"Deep Rating Elicitation for New Users in Collaborative Filtering","date":"2024-02-26","arxiv_id":"2402.16327","repositories_listed":1,"syntology":null}],"record_sha256":"8fb35327d55d2fd3d55f11a08514a814d1ecec8f301d06c19235c97db6ae0d2b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}