{"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/ran/1","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":4,"rows_per_page":100,"rows":[1,100],"of":330,"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/papers/ran/1","prev":null,"next":"/task/recommendation-systems/papers/ran/2","papers":[{"url":"/paper/cove-compressed-vocabulary-expansion-makes","slug":"cove-compressed-vocabulary-expansion-makes","title":"CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems","date":"2025-06-24","arxiv_id":"2506.19993","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/cove-compressed-vocabulary-expansion-makes#ran","syntology_url":"https://syntology.ai/paper/2506.19993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.19993"}},"official":{"repos":["haochenzhang717/cove-official-repo"],"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/2505-10940","slug":"2505-10940","title":"Who You Are Matters: Bridging Topics and Social Roles via LLM-Enhanced Logical Recommendation","date":"2025-05-16","arxiv_id":"2505.10940","repositories_listed":0,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/2505-10940#ran","syntology_url":"https://syntology.ai/paper/2505.10940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.10940"}},"official":null}},{"url":"/paper/comrecgc-global-graph-counterfactual","slug":"comrecgc-global-graph-counterfactual","title":"COMRECGC: Global Graph Counterfactual Explainer through Common Recourse","date":"2025-05-11","arxiv_id":"2505.07081","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/comrecgc-global-graph-counterfactual#ran","syntology_url":"https://syntology.ai/paper/2505.07081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.07081"}},"official":{"repos":["ssggreg/comrecgc"],"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","unlocated"]}}},{"url":"/paper/rec-r1-bridging-generative-large-language","slug":"rec-r1-bridging-generative-large-language","title":"Rec-R1: Bridging Generative Large Language Models and User-Centric Recommendation Systems via Reinforcement Learning","date":"2025-03-31","arxiv_id":"2503.24289","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rec-r1-bridging-generative-large-language#ran","syntology_url":"https://syntology.ai/paper/2503.24289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.24289"}},"official":{"repos":["linjc16/Rec-R1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/empowering-retrieval-based-conversational","slug":"empowering-retrieval-based-conversational","title":"Empowering Retrieval-based Conversational Recommendation with Contrasting User Preferences","date":"2025-03-27","arxiv_id":"2503.22005","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/empowering-retrieval-based-conversational#ran","syntology_url":"https://syntology.ai/paper/2503.22005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.22005"}},"official":{"repos":["kookeej/coral"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-overprescribing-challenges-fine","slug":"addressing-overprescribing-challenges-fine","title":"Addressing Overprescribing Challenges: Fine-Tuning Large Language Models for Medication Recommendation Tasks","date":"2025-03-05","arxiv_id":"2503.03687","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/addressing-overprescribing-challenges-fine#ran","syntology_url":"https://syntology.ai/paper/2503.03687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.03687"}},"official":{"repos":["zzhustc2016/lamo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/agentsociety-challenge-designing-llm-agents","slug":"agentsociety-challenge-designing-llm-agents","title":"AgentSociety Challenge: Designing LLM Agents for User Modeling and Recommendation on Web Platforms","date":"2025-02-26","arxiv_id":"2502.18754","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/agentsociety-challenge-designing-llm-agents#ran","syntology_url":"https://syntology.ai/paper/2502.18754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.18754"}},"official":{"repos":["tsinghua-fib-lab/agentsocietychallenge"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/instructagent-building-user-controllable","slug":"instructagent-building-user-controllable","title":"iAgent: LLM Agent as a Shield between User and Recommender Systems","date":"2025-02-20","arxiv_id":"2502.14662","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/instructagent-building-user-controllable#ran","syntology_url":"https://syntology.ai/paper/2502.14662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14662"}},"official":{"repos":["wujiangxu/iagent"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/eager-llm-enhancing-large-language-models-as","slug":"eager-llm-enhancing-large-language-models-as","title":"EAGER-LLM: Enhancing Large Language Models as Recommenders through Exogenous Behavior-Semantic Integration","date":"2025-02-20","arxiv_id":"2502.14735","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/eager-llm-enhancing-large-language-models-as#ran","syntology_url":"https://syntology.ai/paper/2502.14735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14735"}},"official":{"repos":["Indolent-Kawhi/EAGER-LLM"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-jensen-gap-for-max-min-group","slug":"bridging-jensen-gap-for-max-min-group","title":"Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation","date":"2025-02-13","arxiv_id":"2502.09319","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bridging-jensen-gap-for-max-min-group#ran","syntology_url":"https://syntology.ai/paper/2502.09319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09319"}},"official":{"repos":["xuchen0427/fairdual"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tgb-seq-benchmark-challenging-temporal-gnns","slug":"tgb-seq-benchmark-challenging-temporal-gnns","title":"TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics","date":"2025-02-05","arxiv_id":"2502.02975","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tgb-seq-benchmark-challenging-temporal-gnns#ran","syntology_url":"https://syntology.ai/paper/2502.02975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.02975"}},"official":{"repos":["TGB-Seq/TGB-Seq"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/patchrec-multi-grained-patching-for-efficient","slug":"patchrec-multi-grained-patching-for-efficient","title":"Multi-Grained Patch Training for Efficient LLM-based Recommendation","date":"2025-01-25","arxiv_id":"2501.15087","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/patchrec-multi-grained-patching-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2501.15087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15087"}},"official":{"repos":["ljy0ustc/patchrec"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-feedback-bandits-on-similar-arms-with","slug":"graph-feedback-bandits-on-similar-arms-with","title":"Graph Feedback Bandits on Similar Arms: With and Without Graph Structures","date":"2025-01-24","arxiv_id":"2501.14314","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-feedback-bandits-on-similar-arms-with#ran","syntology_url":"https://syntology.ai/paper/2501.14314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.14314"}},"official":{"repos":["qh1874/GraphBandits_SimilarArms"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-based-multi-objective-deep-learning","slug":"gradient-based-multi-objective-deep-learning","title":"Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond","date":"2025-01-19","arxiv_id":"2501.10945","repositories_listed":3,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradient-based-multi-objective-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2501.10945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.10945"}},"official":{"repos":["baijiong-lin/awesome-multi-objective-deep-learning","median-research-group/libmtl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/can-llms-convert-graphs-to-text-attributed","slug":"can-llms-convert-graphs-to-text-attributed","title":"Can LLMs Convert Graphs to Text-Attributed Graphs?","date":"2024-12-13","arxiv_id":"2412.10136","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/can-llms-convert-graphs-to-text-attributed#ran","syntology_url":"https://syntology.ai/paper/2412.10136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.10136"}},"official":{"repos":["zehong-wang/tans"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/sprec-leveraging-self-play-to-debias","slug":"sprec-leveraging-self-play-to-debias","title":"SPRec: Leveraging Self-Play to Debias Preference Alignment for Large Language Model-based Recommendations","date":"2024-12-12","arxiv_id":"2412.09243","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sprec-leveraging-self-play-to-debias#ran","syntology_url":"https://syntology.ai/paper/2412.09243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09243"}},"official":{"repos":["regionch/sprec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pyod-2-a-python-library-for-outlier-detection","slug":"pyod-2-a-python-library-for-outlier-detection","title":"PyOD 2: A Python Library for Outlier Detection with LLM-powered Model Selection","date":"2024-12-11","arxiv_id":"2412.12154","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pyod-2-a-python-library-for-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2412.12154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12154"}},"official":{"repos":["yzhao062/pyod"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contextgnn-beyond-two-tower-recommendation","slug":"contextgnn-beyond-two-tower-recommendation","title":"ContextGNN: Beyond Two-Tower Recommendation Systems","date":"2024-11-29","arxiv_id":"2411.19513","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/contextgnn-beyond-two-tower-recommendation#ran","syntology_url":"https://syntology.ai/paper/2411.19513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.19513"}},"official":{"repos":["kumo-ai/ContextGNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/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/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/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/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/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/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/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/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/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/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/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/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/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/large-language-model-empowered-embedding","slug":"large-language-model-empowered-embedding","title":"LLMEmb: Large Language Model Can Be a Good Embedding Generator for Sequential Recommendation","date":"2024-09-30","arxiv_id":"2409.19925","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-model-empowered-embedding#ran","syntology_url":"https://syntology.ai/paper/2409.19925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19925"}},"official":{"repos":["applied-machine-learning-lab/llmemb","liuqidong07/LLMEmb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/can-large-language-models-analyze-graphs-like","slug":"can-large-language-models-analyze-graphs-like","title":"Can Large Language Models Analyze Graphs like Professionals? A Benchmark, Datasets and Models","date":"2024-09-29","arxiv_id":"2409.19667","repositories_listed":2,"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":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) · 0 unverified","sample_list":"/paper/can-large-language-models-analyze-graphs-like#ran","syntology_url":"https://syntology.ai/paper/2409.19667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19667"}},"official":{"repos":["bupt-gamma/prograph"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"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/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/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/do-we-really-need-to-drop-items-with-missing","slug":"do-we-really-need-to-drop-items-with-missing","title":"Do We Really Need to Drop Items with Missing Modalities in Multimodal Recommendation?","date":"2024-08-21","arxiv_id":"2408.11767","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/do-we-really-need-to-drop-items-with-missing#ran","syntology_url":"https://syntology.ai/paper/2408.11767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.11767"}},"official":{"repos":["sisinflab/graph-missing-modalities"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerating-the-surrogate-retraining-for","slug":"accelerating-the-surrogate-retraining-for","title":"Accelerating the Surrogate Retraining for Poisoning Attacks against Recommender Systems","date":"2024-08-20","arxiv_id":"2408.10666","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accelerating-the-surrogate-retraining-for#ran","syntology_url":"https://syntology.ai/paper/2408.10666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.10666"}},"official":{"repos":["WuYunfan/GradientPassingAttack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/harnessing-multimodal-large-language-models","slug":"harnessing-multimodal-large-language-models","title":"Harnessing Multimodal Large Language Models for Multimodal Sequential Recommendation","date":"2024-08-19","arxiv_id":"2408.09698","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/harnessing-multimodal-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2408.09698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.09698"}},"official":{"repos":["yuyangye/mllm-msr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/customizing-language-models-with-instance","slug":"customizing-language-models-with-instance","title":"Customizing Language Models with Instance-wise LoRA for Sequential Recommendation","date":"2024-08-19","arxiv_id":"2408.10159","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":7,"n_ran_checked":7,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":13,"phrase":"8 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/customizing-language-models-with-instance#ran","syntology_url":"https://syntology.ai/paper/2408.10159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.10159"}},"official":{"repos":["akalikong/ilora"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/review-driven-personalized-preference","slug":"review-driven-personalized-preference","title":"Review-driven Personalized Preference Reasoning with Large Language Models for Recommendation","date":"2024-08-12","arxiv_id":"2408.06276","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/review-driven-personalized-preference#ran","syntology_url":"https://syntology.ai/paper/2408.06276","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06276"}},"official":{"repos":["jieyong99/exp3rt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-decoding-acceleration-framework-for","slug":"a-decoding-acceleration-framework-for","title":"Efficiency Unleashed: Inference Acceleration for LLM-based Recommender Systems with Speculative Decoding","date":"2024-08-11","arxiv_id":"2408.05676","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-decoding-acceleration-framework-for#ran","syntology_url":"https://syntology.ai/paper/2408.05676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.05676"}},"official":{"repos":["yunjiaxi/laser"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/matrrec-uniting-mamba-and-transformer-for","slug":"matrrec-uniting-mamba-and-transformer-for","title":"MaTrRec: Uniting Mamba and Transformer for Sequential Recommendation","date":"2024-07-27","arxiv_id":"2407.19239","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/matrrec-uniting-mamba-and-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2407.19239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.19239"}},"official":{"repos":["unintelligentmumu/matrrec"],"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/gume-graphs-and-user-modalities-enhancement","slug":"gume-graphs-and-user-modalities-enhancement","title":"GUME: Graphs and User Modalities Enhancement for Long-Tail Multimodal Recommendation","date":"2024-07-17","arxiv_id":"2407.12338","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"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) · 1 unverified","sample_list":"/paper/gume-graphs-and-user-modalities-enhancement#ran","syntology_url":"https://syntology.ai/paper/2407.12338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12338"}},"official":{"repos":["nangongningyi/gume"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/language-models-encode-collaborative-signals","slug":"language-models-encode-collaborative-signals","title":"Language Representations Can be What Recommenders Need: Findings and Potentials","date":"2024-07-07","arxiv_id":"2407.05441","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/language-models-encode-collaborative-signals#ran","syntology_url":"https://syntology.ai/paper/2407.05441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05441"}},"official":{"repos":["lehengthu/alpharec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/jump-starting-bandits-with-llm-generated","slug":"jump-starting-bandits-with-llm-generated","title":"Jump Starting Bandits with LLM-Generated Prior Knowledge","date":"2024-06-27","arxiv_id":"2406.19317","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/jump-starting-bandits-with-llm-generated#ran","syntology_url":"https://syntology.ai/paper/2406.19317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.19317"}},"official":{"repos":["BorealisAI/jump-starting-bandits"],"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/graphsnapshot-graph-machine-learning","slug":"graphsnapshot-graph-machine-learning","title":"GraphSnapShot: Caching Local Structure for Fast Graph Learning","date":"2024-06-25","arxiv_id":"2406.17918","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/graphsnapshot-graph-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2406.17918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17918"}},"official":{"repos":["noakliu/graphsnapshot"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-multi-modal-recommender-systems-by","slug":"improving-multi-modal-recommender-systems-by","title":"Improving Multi-modal Recommender Systems by Denoising and Aligning Multi-modal Content and User Feedback","date":"2024-06-18","arxiv_id":"2406.12501","repositories_listed":2,"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/improving-multi-modal-recommender-systems-by#ran","syntology_url":"https://syntology.ai/paper/2406.12501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12501"}},"official":{"repos":["enoche/mmrec"],"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/uniglm-training-one-unified-language-model","slug":"uniglm-training-one-unified-language-model","title":"UniGLM: Training One Unified Language Model for Text-Attributed Graph Embedding","date":"2024-06-17","arxiv_id":"2406.12052","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/uniglm-training-one-unified-language-model#ran","syntology_url":"https://syntology.ai/paper/2406.12052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12052"}},"official":{"repos":["nyushcs/uniglm"],"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/on-softmax-direct-preference-optimization-for","slug":"on-softmax-direct-preference-optimization-for","title":"On Softmax Direct Preference Optimization for Recommendation","date":"2024-06-13","arxiv_id":"2406.09215","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/on-softmax-direct-preference-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2406.09215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09215"}},"official":{"repos":["chenyuxin1999/s-dpo"],"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/modeling-user-retention-through-generative","slug":"modeling-user-retention-through-generative","title":"Modeling User Retention through Generative Flow Networks","date":"2024-06-10","arxiv_id":"2406.06043","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modeling-user-retention-through-generative#ran","syntology_url":"https://syntology.ai/paper/2406.06043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06043"}},"official":{"repos":["Applied-Machine-Learning-Lab/GFN4Retention"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/selfgnn-self-supervised-graph-neural-networks","slug":"selfgnn-self-supervised-graph-neural-networks","title":"SelfGNN: Self-Supervised Graph Neural Networks for Sequential Recommendation","date":"2024-05-31","arxiv_id":"2405.20878","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/selfgnn-self-supervised-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.20878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20878"}},"official":{"repos":["hkuds/selfgnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-are-zero-shot-next","slug":"large-language-models-are-zero-shot-next","title":"Large Language Models are Zero-Shot Next Location Predictors","date":"2024-05-31","arxiv_id":"2405.20962","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-models-are-zero-shot-next#ran","syntology_url":"https://syntology.ai/paper/2405.20962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20962"}},"official":{"repos":["ssai-trento/llm-zero-shot-nl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dataset-regeneration-for-sequential","slug":"dataset-regeneration-for-sequential","title":"Dataset Regeneration for Sequential Recommendation","date":"2024-05-28","arxiv_id":"2405.17795","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dataset-regeneration-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2405.17795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17795"}},"official":{"repos":["ustc-starteam/dr4sr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/repeat-aware-neighbor-sampling-for-dynamic","slug":"repeat-aware-neighbor-sampling-for-dynamic","title":"Repeat-Aware Neighbor Sampling for Dynamic Graph Learning","date":"2024-05-24","arxiv_id":"2405.17473","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/repeat-aware-neighbor-sampling-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2405.17473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17473"}},"official":{"repos":["Hope-Rita/RepeatMixer"],"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/comera-computing-and-memory-efficient","slug":"comera-computing-and-memory-efficient","title":"CoMERA: Computing- and Memory-Efficient Training via Rank-Adaptive Tensor Optimization","date":"2024-05-23","arxiv_id":"2405.14377","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":2,"n_ran_checked":6,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"9 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/comera-computing-and-memory-efficient#ran","syntology_url":"https://syntology.ai/paper/2405.14377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14377"}},"official":{"repos":["ziyangjoy/comera"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/svd-ae-simple-autoencoders-for-collaborative","slug":"svd-ae-simple-autoencoders-for-collaborative","title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","date":"2024-05-08","arxiv_id":"2405.04746","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/svd-ae-simple-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/2405.04746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04746"}},"official":{"repos":["jeongwhanchoi/svd-ae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["named_in_paper","official"]}}},{"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/sc-otgm-single-cell-perturbation-modeling-by","slug":"sc-otgm-single-cell-perturbation-modeling-by","title":"sc-OTGM: Single-Cell Perturbation Modeling by Solving Optimal Mass Transport on the Manifold of Gaussian Mixtures","date":"2024-05-06","arxiv_id":"2405.03726","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/sc-otgm-single-cell-perturbation-modeling-by#ran","syntology_url":"https://syntology.ai/paper/2405.03726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03726"}},"official":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/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/hyperparameter-optimization-can-even-be","slug":"hyperparameter-optimization-can-even-be","title":"Hyperparameter Optimization Can Even be Harmful in Off-Policy Learning and How to Deal with It","date":"2024-04-23","arxiv_id":"2404.15084","repositories_listed":0,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/hyperparameter-optimization-can-even-be#ran","syntology_url":"https://syntology.ai/paper/2404.15084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15084"}},"official":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/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/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/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/pmg-personalized-multimodal-generation-with","slug":"pmg-personalized-multimodal-generation-with","title":"PMG : Personalized Multimodal Generation with Large Language Models","date":"2024-04-07","arxiv_id":"2404.08677","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pmg-personalized-multimodal-generation-with#ran","syntology_url":"https://syntology.ai/paper/2404.08677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08677"}},"official":{"repos":["Suikasxt/PMG"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/iisan-efficiently-adapting-multimodal","slug":"iisan-efficiently-adapting-multimodal","title":"IISAN: Efficiently Adapting Multimodal Representation for Sequential Recommendation with Decoupled PEFT","date":"2024-04-02","arxiv_id":"2404.02059","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/iisan-efficiently-adapting-multimodal#ran","syntology_url":"https://syntology.ai/paper/2404.02059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.02059"}},"official":{"repos":["gair-lab/iisan","jjgenailab/iisan"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"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/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/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/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/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/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/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/dgr-a-general-graph-desmoothing-framework-for","slug":"dgr-a-general-graph-desmoothing-framework-for","title":"DGR: A General Graph Desmoothing Framework for Recommendation via Global and Local Perspectives","date":"2024-03-07","arxiv_id":"2403.04287","repositories_listed":0,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"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) · 4 unverified","sample_list":"/paper/dgr-a-general-graph-desmoothing-framework-for#ran","syntology_url":"https://syntology.ai/paper/2403.04287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04287"}},"official":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/actions-speak-louder-than-words-trillion","slug":"actions-speak-louder-than-words-trillion","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","date":"2024-02-27","arxiv_id":"2402.17152","repositories_listed":12,"syntology":{"n":42,"n_ran":15,"n_constructed":13,"n_ran_checked":14,"n_instrument":1,"n_unverified":27,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":3,"phrase":"15 ran (of which 13 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 27 unverified","sample_list":"/paper/actions-speak-louder-than-words-trillion#ran","syntology_url":"https://syntology.ai/paper/2402.17152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17152"}},"official":{"repos":["facebookresearch/generative-recommenders"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["listed","official"]}}},{"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/item-side-fairness-of-large-language-model","slug":"item-side-fairness-of-large-language-model","title":"Item-side Fairness of Large Language Model-based Recommendation System","date":"2024-02-23","arxiv_id":"2402.15215","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/item-side-fairness-of-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2402.15215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15215"}},"official":{"repos":["jiangm-c/ifairlrs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-agent-collaboration-framework-for","slug":"multi-agent-collaboration-framework-for","title":"MACRec: a Multi-Agent Collaboration Framework for Recommendation","date":"2024-02-23","arxiv_id":"2402.15235","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-agent-collaboration-framework-for#ran","syntology_url":"https://syntology.ai/paper/2402.15235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15235"}},"official":{"repos":["wzf2000/macrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/recwizard-a-toolkit-for-conversational","slug":"recwizard-a-toolkit-for-conversational","title":"RecWizard: A Toolkit for Conversational Recommendation with Modular, Portable Models and Interactive User Interface","date":"2024-02-23","arxiv_id":"2402.15591","repositories_listed":1,"syntology":{"n":13,"n_ran":7,"n_constructed":5,"n_ran_checked":5,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":13,"phrase":"7 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/recwizard-a-toolkit-for-conversational#ran","syntology_url":"https://syntology.ai/paper/2402.15591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15591"}},"official":{"repos":["mcauley-lab/recwizard"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/flame-self-supervised-low-resource-taxonomy","slug":"flame-self-supervised-low-resource-taxonomy","title":"FLAME: Self-Supervised Low-Resource Taxonomy Expansion using Large Language Models","date":"2024-02-21","arxiv_id":"2402.13623","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/flame-self-supervised-low-resource-taxonomy#ran","syntology_url":"https://syntology.ai/paper/2402.13623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13623"}},"official":{"repos":["sahilmishra0012/flame"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-time-graph-neural-networks-for","slug":"linear-time-graph-neural-networks-for","title":"Linear-Time Graph Neural Networks for Scalable Recommendations","date":"2024-02-21","arxiv_id":"2402.13973","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/linear-time-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2402.13973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13973"}},"official":{"repos":["qwq2000/thewebconf24-ltgnn-pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/can-gnn-be-good-adapter-for-llms","slug":"can-gnn-be-good-adapter-for-llms","title":"Can GNN be Good Adapter for LLMs?","date":"2024-02-20","arxiv_id":"2402.12984","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 2 unverified","sample_list":"/paper/can-gnn-be-good-adapter-for-llms#ran","syntology_url":"https://syntology.ai/paper/2402.12984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12984"}},"official":{"repos":["zjunet/graphadapter","hxttkl/GraphAdapter"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neighborhood-enhanced-supervised-contrastive","slug":"neighborhood-enhanced-supervised-contrastive","title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","date":"2024-02-18","arxiv_id":"2402.11523","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neighborhood-enhanced-supervised-contrastive#ran","syntology_url":"https://syntology.ai/paper/2402.11523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11523"}},"official":null}},{"url":"/paper/node-duplication-improves-cold-start-link","slug":"node-duplication-improves-cold-start-link","title":"Node Duplication Improves Cold-start Link Prediction","date":"2024-02-15","arxiv_id":"2402.09711","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/node-duplication-improves-cold-start-link#ran","syntology_url":"https://syntology.ai/paper/2402.09711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09711"}},"official":{"repos":["snap-research/nodedup"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/future-impact-decomposition-in-request-level","slug":"future-impact-decomposition-in-request-level","title":"Future Impact Decomposition in Request-level Recommendations","date":"2024-01-29","arxiv_id":"2401.16108","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/future-impact-decomposition-in-request-level#ran","syntology_url":"https://syntology.ai/paper/2401.16108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16108"}},"official":{"repos":["wangxiaobei565/itemdecomposition"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/macro-graph-neural-networks-for-online","slug":"macro-graph-neural-networks-for-online","title":"Macro Graph Neural Networks for Online Billion-Scale Recommender Systems","date":"2024-01-26","arxiv_id":"2401.14939","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/macro-graph-neural-networks-for-online#ran","syntology_url":"https://syntology.ai/paper/2401.14939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14939"}},"official":{"repos":["yuanchenbei/macgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/denoising-diffusion-recommender-model","slug":"denoising-diffusion-recommender-model","title":"Denoising Diffusion Recommender Model","date":"2024-01-13","arxiv_id":"2401.06982","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/denoising-diffusion-recommender-model#ran","syntology_url":"https://syntology.ai/paper/2401.06982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06982"}},"official":{"repos":["polaris-jz/ddrm"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"a4b2b5abbca109e17466bbd550e9683c4ae1e63df7dedde315bdd4e3e3f2f9e6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}