{"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/2","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":2,"pages_in_order":4,"rows_per_page":100,"rows":[101,200],"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":"/task/recommendation-systems/papers/ran/1","next":"/task/recommendation-systems/papers/ran/3","papers":[{"url":"/paper/ada-retrieval-an-adaptive-multi-round","slug":"ada-retrieval-an-adaptive-multi-round","title":"Ada-Retrieval: An Adaptive Multi-Round Retrieval Paradigm for Sequential Recommendations","date":"2024-01-12","arxiv_id":"2401.06633","repositories_listed":1,"syntology":{"n":14,"n_ran":8,"n_constructed":4,"n_ran_checked":7,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":14,"phrase":"8 ran (of which 4 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/ada-retrieval-an-adaptive-multi-round#ran","syntology_url":"https://syntology.ai/paper/2401.06633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06633"}},"official":{"repos":["ll0ruc/ada-retrieval"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":4,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/poisoning-attacks-against-recommender-systems","slug":"poisoning-attacks-against-recommender-systems","title":"Poisoning Attacks against Recommender Systems: A Survey","date":"2024-01-03","arxiv_id":"2401.01527","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/poisoning-attacks-against-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/2401.01527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.01527"}},"official":{"repos":["coderwzw/arlib"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distillation-is-all-you-need-for-practically","slug":"distillation-is-all-you-need-for-practically","title":"Curriculum-scheduled Knowledge Distillation from Multiple Pre-trained Teachers for Multi-domain Sequential Recommendation","date":"2024-01-01","arxiv_id":"2401.00797","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distillation-is-all-you-need-for-practically#ran","syntology_url":"https://syntology.ai/paper/2401.00797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00797"}},"official":{"repos":["rucaibox/ckd-mdsr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffkg-knowledge-graph-diffusion-model-for","slug":"diffkg-knowledge-graph-diffusion-model-for","title":"DiffKG: Knowledge Graph Diffusion Model for Recommendation","date":"2023-12-28","arxiv_id":"2312.16890","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/diffkg-knowledge-graph-diffusion-model-for#ran","syntology_url":"https://syntology.ai/paper/2312.16890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16890"}},"official":{"repos":["hkuds/diffkg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-survey-of-evaluation","slug":"a-comprehensive-survey-of-evaluation","title":"A Comprehensive Survey of Evaluation Techniques for Recommendation Systems","date":"2023-12-26","arxiv_id":"2312.16015","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-comprehensive-survey-of-evaluation#ran","syntology_url":"https://syntology.ai/paper/2312.16015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16015"}},"official":{"repos":["aryan-jadon/evaluation-metrics-for-recommendation-systems"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unlocking-the-potential-of-large-language","slug":"unlocking-the-potential-of-large-language","title":"Unlocking the Potential of Large Language Models for Explainable Recommendations","date":"2023-12-25","arxiv_id":"2312.15661","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unlocking-the-potential-of-large-language#ran","syntology_url":"https://syntology.ai/paper/2312.15661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.15661"}},"official":{"repos":["godfire66666/llm_rec_explanation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/user-consented-federated-recommender-system","slug":"user-consented-federated-recommender-system","title":"User Consented Federated Recommender System Against Personalized Attribute Inference Attack","date":"2023-12-23","arxiv_id":"2312.16203","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/user-consented-federated-recommender-system#ran","syntology_url":"https://syntology.ai/paper/2312.16203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.16203"}},"official":{"repos":["hkust-knowcomp/uc-fedrec"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-attentive-inductive-bias-for-sequential","slug":"an-attentive-inductive-bias-for-sequential","title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","date":"2023-12-16","arxiv_id":"2312.10325","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}},"official":{"repos":["jeongwhanchoi/BSARec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/finding-paths-for-explainable-mooc","slug":"finding-paths-for-explainable-mooc","title":"Finding Paths for Explainable MOOC Recommendation: A Learner Perspective","date":"2023-12-11","arxiv_id":"2312.10082","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":12,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/finding-paths-for-explainable-mooc#ran","syntology_url":"https://syntology.ai/paper/2312.10082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10082"}},"official":{"repos":["epfl-ml4ed/courserec"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/e4srec-an-elegant-effective-efficient","slug":"e4srec-an-elegant-effective-efficient","title":"E4SRec: An Elegant Effective Efficient Extensible Solution of Large Language Models for Sequential Recommendation","date":"2023-12-05","arxiv_id":"2312.02443","repositories_listed":2,"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/e4srec-an-elegant-effective-efficient#ran","syntology_url":"https://syntology.ai/paper/2312.02443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02443"}},"official":{"repos":["hestiasky/e4srec"],"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/agd-an-auto-switchable-optimizer-using-1","slug":"agd-an-auto-switchable-optimizer-using-1","title":"AGD: an Auto-switchable Optimizer using Stepwise Gradient Difference for Preconditioning Matrix","date":"2023-12-04","arxiv_id":"2312.01658","repositories_listed":2,"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":1,"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/agd-an-auto-switchable-optimizer-using-1#ran","syntology_url":"https://syntology.ai/paper/2312.01658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01658"}},"official":{"repos":["intelligent-machine-learning/atorch","intelligent-machine-learning/dlrover"],"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":["community","official"]}}},{"url":"/paper/normed-spaces-for-graph-embedding","slug":"normed-spaces-for-graph-embedding","title":"Normed Spaces for Graph Embedding","date":"2023-12-03","arxiv_id":"2312.01502","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/normed-spaces-for-graph-embedding#ran","syntology_url":"https://syntology.ai/paper/2312.01502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01502"}},"official":{"repos":["andyweizhao/graphs-normed-spaces"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/recexplainer-aligning-large-language-models","slug":"recexplainer-aligning-large-language-models","title":"RecExplainer: Aligning Large Language Models for Explaining Recommendation Models","date":"2023-11-18","arxiv_id":"2311.10947","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/recexplainer-aligning-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2311.10947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.10947"}},"official":{"repos":["microsoft/recai"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-graph-aware-diffusion-modeling-for","slug":"towards-graph-aware-diffusion-modeling-for","title":"Graph Signal Diffusion Model for Collaborative Filtering","date":"2023-11-15","arxiv_id":"2311.08744","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"4 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/towards-graph-aware-diffusion-modeling-for#ran","syntology_url":"https://syntology.ai/paper/2311.08744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.08744"}},"official":{"repos":["hasined/giffcf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adapting-large-language-models-by-integrating","slug":"adapting-large-language-models-by-integrating","title":"Adapting Large Language Models by Integrating Collaborative Semantics for Recommendation","date":"2023-11-15","arxiv_id":"2311.09049","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adapting-large-language-models-by-integrating#ran","syntology_url":"https://syntology.ai/paper/2311.09049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.09049"}},"official":{"repos":["rucaibox/lc-rec"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/do-llms-implicitly-exhibit-user","slug":"do-llms-implicitly-exhibit-user","title":"A Study of Implicit Ranking Unfairness in Large Language Models","date":"2023-11-13","arxiv_id":"2311.07054","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/do-llms-implicitly-exhibit-user#ran","syntology_url":"https://syntology.ai/paper/2311.07054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.07054"}},"official":{"repos":["xuchen0427/implicit_rank_unfairness"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/apgl4sr-a-generic-framework-with-adaptive-and","slug":"apgl4sr-a-generic-framework-with-adaptive-and","title":"APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation","date":"2023-11-06","arxiv_id":"2311.02816","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/apgl4sr-a-generic-framework-with-adaptive-and#ran","syntology_url":"https://syntology.ai/paper/2311.02816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02816"}},"official":{"repos":["graph-team/apgl4sr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/architectural-sweet-spots-for-modeling-human","slug":"architectural-sweet-spots-for-modeling-human","title":"Architectural Sweet Spots for Modeling Human Label Variation by the Example of Argument Quality: It's Best to Relate Perspectives!","date":"2023-11-06","arxiv_id":"2311.03153","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/architectural-sweet-spots-for-modeling-human#ran","syntology_url":"https://syntology.ai/paper/2311.03153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03153"}},"official":{"repos":["phhei/relateperspectives-sweetspots"],"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/collaborative-large-language-model-for","slug":"collaborative-large-language-model-for","title":"Collaborative Large Language Model for Recommender Systems","date":"2023-11-02","arxiv_id":"2311.01343","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/collaborative-large-language-model-for#ran","syntology_url":"https://syntology.ai/paper/2311.01343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.01343"}},"official":{"repos":["yaochenzhu/llm4rec"],"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/llmrec-large-language-models-with-graph","slug":"llmrec-large-language-models-with-graph","title":"LLMRec: Large Language Models with Graph Augmentation for Recommendation","date":"2023-11-01","arxiv_id":"2311.00423","repositories_listed":1,"syntology":{"n":16,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":12,"n_pointer_only":6,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 1 honoured, 1 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/llmrec-large-language-models-with-graph#ran","syntology_url":"https://syntology.ai/paper/2311.00423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00423"}},"official":{"repos":["hkuds/llmrec"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/empowering-collaborative-filtering-with","slug":"empowering-collaborative-filtering-with","title":"Empowering Collaborative Filtering with Principled Adversarial Contrastive Loss","date":"2023-10-28","arxiv_id":"2310.18700","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":2,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/empowering-collaborative-filtering-with#ran","syntology_url":"https://syntology.ai/paper/2310.18700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18700"}},"official":{"repos":["lehengthu/advinfonce"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-conversational-recommendation-5","slug":"improving-conversational-recommendation-5","title":"Improving Conversational Recommendation Systems via Bias Analysis and Language-Model-Enhanced Data Augmentation","date":"2023-10-25","arxiv_id":"2310.16738","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/improving-conversational-recommendation-5#ran","syntology_url":"https://syntology.ai/paper/2310.16738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16738"}},"official":{"repos":["wangxieric/bias-crs"],"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/torchsparse-efficient-training-and-inference","slug":"torchsparse-efficient-training-and-inference","title":"TorchSparse++: Efficient Training and Inference Framework for Sparse Convolution on GPUs","date":"2023-10-25","arxiv_id":"2311.12862","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/torchsparse-efficient-training-and-inference#ran","syntology_url":"https://syntology.ai/paper/2311.12862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.12862"}},"official":{"repos":["mit-han-lab/torchsparse"],"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/using-causality-aware-graph-neural-networks","slug":"using-causality-aware-graph-neural-networks","title":"Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs","date":"2023-10-24","arxiv_id":"2310.15865","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/using-causality-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.15865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15865"}},"official":{"repos":["pathpy/pathpyg"],"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/representation-learning-with-large-language","slug":"representation-learning-with-large-language","title":"Representation Learning with Large Language Models for Recommendation","date":"2023-10-24","arxiv_id":"2310.15950","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/representation-learning-with-large-language#ran","syntology_url":"https://syntology.ai/paper/2310.15950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15950"}},"official":{"repos":["hkuds/rlmrec"],"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/mlfmf-data-sets-for-machine-learning-for-1","slug":"mlfmf-data-sets-for-machine-learning-for-1","title":"MLFMF: Data Sets for Machine Learning for Mathematical Formalization","date":"2023-10-24","arxiv_id":"2310.16005","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/mlfmf-data-sets-for-machine-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2310.16005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16005"}},"official":{"repos":["ul-fmf/mlfmf-data"],"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":["found_in_text","official"]}}},{"url":"/paper/intent-contrastive-learning-with-cross","slug":"intent-contrastive-learning-with-cross","title":"Intent Contrastive Learning with Cross Subsequences for Sequential Recommendation","date":"2023-10-22","arxiv_id":"2310.14318","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/intent-contrastive-learning-with-cross#ran","syntology_url":"https://syntology.ai/paper/2310.14318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14318"}},"official":{"repos":["qinhsiu/icsrec"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-generative-agents-in-recommendation","slug":"on-generative-agents-in-recommendation","title":"On Generative Agents in Recommendation","date":"2023-10-16","arxiv_id":"2310.10108","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/on-generative-agents-in-recommendation#ran","syntology_url":"https://syntology.ai/paper/2310.10108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10108"}},"official":{"repos":["LehengTHU/Agent4Rec"],"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/talk-like-a-graph-encoding-graphs-for-large","slug":"talk-like-a-graph-encoding-graphs-for-large","title":"Talk like a Graph: Encoding Graphs for Large Language Models","date":"2023-10-06","arxiv_id":"2310.04560","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"5 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/talk-like-a-graph-encoding-graphs-for-large#ran","syntology_url":"https://syntology.ai/paper/2310.04560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04560"}},"official":{"repos":["ChristianaKang11/google-graphqa"],"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":["listed","official"]}}},{"url":"/paper/making-users-indistinguishable-attribute-wise","slug":"making-users-indistinguishable-attribute-wise","title":"Making Users Indistinguishable: Attribute-wise Unlearning in Recommender Systems","date":"2023-10-06","arxiv_id":"2310.05847","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/making-users-indistinguishable-attribute-wise#ran","syntology_url":"https://syntology.ai/paper/2310.05847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05847"}},"official":null}},{"url":"/paper/newsreclib-a-pytorch-lightning-library-for","slug":"newsreclib-a-pytorch-lightning-library-for","title":"NewsRecLib: A PyTorch-Lightning Library for Neural News Recommendation","date":"2023-10-02","arxiv_id":"2310.01146","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":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) · 0 unverified","sample_list":"/paper/newsreclib-a-pytorch-lightning-library-for#ran","syntology_url":"https://syntology.ai/paper/2310.01146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01146"}},"official":{"repos":["andreeaiana/newsreclib"],"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/graph-enhanced-optimizers-for-structure-aware","slug":"graph-enhanced-optimizers-for-structure-aware","title":"Graph-enhanced Optimizers for Structure-aware Recommendation Embedding Evolution","date":"2023-09-24","arxiv_id":"2310.03032","repositories_listed":1,"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":0,"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/graph-enhanced-optimizers-for-structure-aware#ran","syntology_url":"https://syntology.ai/paper/2310.03032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03032"}},"official":{"repos":["mtandhj/sevo"],"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/kuaisim-a-comprehensive-simulator-for","slug":"kuaisim-a-comprehensive-simulator-for","title":"KuaiSim: A Comprehensive Simulator for Recommender Systems","date":"2023-09-22","arxiv_id":"2309.12645","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kuaisim-a-comprehensive-simulator-for#ran","syntology_url":"https://syntology.ai/paper/2309.12645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.12645"}},"official":{"repos":["applied-machine-learning-lab/kuaisim"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/turning-dross-into-gold-loss-is-bert4rec","slug":"turning-dross-into-gold-loss-is-bert4rec","title":"Turning Dross Into Gold Loss: is BERT4Rec really better than SASRec?","date":"2023-09-14","arxiv_id":"2309.07602","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"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) · 1 unverified","sample_list":"/paper/turning-dross-into-gold-loss-is-bert4rec#ran","syntology_url":"https://syntology.ai/paper/2309.07602","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.07602"}},"official":{"repos":["antklen/sasrec-bert4rec-recsys23"],"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/ninerec-a-benchmark-dataset-suite-for","slug":"ninerec-a-benchmark-dataset-suite-for","title":"NineRec: A Benchmark Dataset Suite for Evaluating Transferable Recommendation","date":"2023-09-14","arxiv_id":"2309.07705","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/ninerec-a-benchmark-dataset-suite-for#ran","syntology_url":"https://syntology.ai/paper/2309.07705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.07705"}},"official":{"repos":["westlake-repl/ninerec","anonymous-ninerec/ninerec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/an-image-dataset-for-benchmarking-recommender","slug":"an-image-dataset-for-benchmarking-recommender","title":"An Image Dataset for Benchmarking Recommender Systems with Raw Pixels","date":"2023-09-13","arxiv_id":"2309.06789","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":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/an-image-dataset-for-benchmarking-recommender#ran","syntology_url":"https://syntology.ai/paper/2309.06789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.06789"}},"official":{"repos":["westlake-repl/pixelrec"],"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/multi-relational-contrastive-learning-for","slug":"multi-relational-contrastive-learning-for","title":"Multi-Relational Contrastive Learning for Recommendation","date":"2023-09-03","arxiv_id":"2309.01103","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"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) · 5 unverified","sample_list":"/paper/multi-relational-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2309.01103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.01103"}},"official":{"repos":["HKUDS/RCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/cagra-highly-parallel-graph-construction-and","slug":"cagra-highly-parallel-graph-construction-and","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs","date":"2023-08-29","arxiv_id":"2308.15136","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":8,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cagra-highly-parallel-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2308.15136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.15136"}},"official":{"repos":["rapidsai/raft"],"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":["listed","official"]}}},{"url":"/paper/text-matching-improves-sequential","slug":"text-matching-improves-sequential","title":"Text Matching Improves Sequential Recommendation by Reducing Popularity Biases","date":"2023-08-27","arxiv_id":"2308.14029","repositories_listed":1,"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":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) · 2 unverified","sample_list":"/paper/text-matching-improves-sequential#ran","syntology_url":"https://syntology.ai/paper/2308.14029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14029"}},"official":{"repos":["openmatch/taste"],"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/lkpnr-llm-and-kg-for-personalized-news","slug":"lkpnr-llm-and-kg-for-personalized-news","title":"LKPNR: LLM and KG for Personalized News Recommendation Framework","date":"2023-08-23","arxiv_id":"2308.12028","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lkpnr-llm-and-kg-for-personalized-news#ran","syntology_url":"https://syntology.ai/paper/2308.12028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12028"}},"official":{"repos":["xuan-zw/lkpnr"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/llmrec-benchmarking-large-language-models-on","slug":"llmrec-benchmarking-large-language-models-on","title":"LLMRec: Benchmarking Large Language Models on Recommendation Task","date":"2023-08-23","arxiv_id":"2308.12241","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/llmrec-benchmarking-large-language-models-on#ran","syntology_url":"https://syntology.ai/paper/2308.12241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12241"}},"official":{"repos":["williamliujl/llmrec"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/rella-retrieval-enhanced-large-language","slug":"rella-retrieval-enhanced-large-language","title":"ReLLa: Retrieval-enhanced Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation","date":"2023-08-22","arxiv_id":"2308.11131","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/rella-retrieval-enhanced-large-language#ran","syntology_url":"https://syntology.ai/paper/2308.11131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11131"}},"official":{"repos":["lavieenrose365/rella"],"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/test-time-embedding-normalization-for","slug":"test-time-embedding-normalization-for","title":"Test Time Embedding Normalization for Popularity Bias Mitigation","date":"2023-08-22","arxiv_id":"2308.11288","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":3,"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/test-time-embedding-normalization-for#ran","syntology_url":"https://syntology.ai/paper/2308.11288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11288"}},"official":{"repos":["ml-postech/tten"],"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/single-user-injection-for-invisible-shilling","slug":"single-user-injection-for-invisible-shilling","title":"Single-User Injection for Invisible Shilling Attack against Recommender Systems","date":"2023-08-21","arxiv_id":"2308.10467","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/single-user-injection-for-invisible-shilling#ran","syntology_url":"https://syntology.ai/paper/2308.10467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10467"}},"official":{"repos":["kdegroup/sui-attack"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-bi-step-grounding-paradigm-for-large","slug":"a-bi-step-grounding-paradigm-for-large","title":"A Bi-Step Grounding Paradigm for Large Language Models in Recommendation Systems","date":"2023-08-16","arxiv_id":"2308.08434","repositories_listed":3,"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/a-bi-step-grounding-paradigm-for-large#ran","syntology_url":"https://syntology.ai/paper/2308.08434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08434"}},"official":{"repos":["sai990323/grounding4rec"],"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/temporal-interest-network-for-click-through","slug":"temporal-interest-network-for-click-through","title":"Temporal Interest Network for User Response Prediction","date":"2023-08-15","arxiv_id":"2308.08487","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"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) · 3 unverified","sample_list":"/paper/temporal-interest-network-for-click-through#ran","syntology_url":"https://syntology.ai/paper/2308.08487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08487"}},"official":{"repos":["zhouxy1003/tin"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sslrec-a-self-supervised-learning-library-for","slug":"sslrec-a-self-supervised-learning-library-for","title":"SSLRec: A Self-Supervised Learning Framework for Recommendation","date":"2023-08-10","arxiv_id":"2308.05697","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/sslrec-a-self-supervised-learning-library-for#ran","syntology_url":"https://syntology.ai/paper/2308.05697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05697"}},"official":{"repos":["hkuds/sslrec"],"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/widespread-flaws-in-offline-evaluation-of","slug":"widespread-flaws-in-offline-evaluation-of","title":"Widespread Flaws in Offline Evaluation of Recommender Systems","date":"2023-07-27","arxiv_id":"2307.14951","repositories_listed":4,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/widespread-flaws-in-offline-evaluation-of#ran","syntology_url":"https://syntology.ai/paper/2307.14951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.14951"}},"official":{"repos":["hidasib/GRU4Rec","hidasib/recsys_eval_flaws"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/trea-tree-structure-reasoning-schema-for","slug":"trea-tree-structure-reasoning-schema-for","title":"TREA: Tree-Structure Reasoning Schema for Conversational Recommendation","date":"2023-07-20","arxiv_id":"2307.10543","repositories_listed":1,"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":20,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/trea-tree-structure-reasoning-schema-for#ran","syntology_url":"https://syntology.ai/paper/2307.10543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.10543"}},"official":{"repos":["windylee0822/trea"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/alleviating-matthew-effect-of-offline","slug":"alleviating-matthew-effect-of-offline","title":"Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation","date":"2023-07-10","arxiv_id":"2307.04571","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/alleviating-matthew-effect-of-offline#ran","syntology_url":"https://syntology.ai/paper/2307.04571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04571"}},"official":{"repos":["chongminggao/dorl-codes"],"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":["listed","official"]}}},{"url":"/paper/exploring-large-language-model-for-graph-data","slug":"exploring-large-language-model-for-graph-data","title":"Exploring Large Language Model for Graph Data Understanding in Online Job Recommendations","date":"2023-07-10","arxiv_id":"2307.05722","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/exploring-large-language-model-for-graph-data#ran","syntology_url":"https://syntology.ai/paper/2307.05722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.05722"}},"official":{"repos":["wlik/glrec"],"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/knowledge-graph-self-supervised","slug":"knowledge-graph-self-supervised","title":"Knowledge Graph Self-Supervised Rationalization for Recommendation","date":"2023-07-06","arxiv_id":"2307.02759","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/knowledge-graph-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2307.02759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.02759"}},"official":{"repos":["hkuds/kgrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/text-based-large-language-model-for","slug":"text-based-large-language-model-for","title":"GenRec: Large Language Model for Generative Recommendation","date":"2023-07-02","arxiv_id":"2307.00457","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/text-based-large-language-model-for#ran","syntology_url":"https://syntology.ai/paper/2307.00457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00457"}},"official":{"repos":["rutgerswiselab/genrec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-personalized-cold-start","slug":"towards-personalized-cold-start","title":"Could Small Language Models Serve as Recommenders? Towards Data-centric Cold-start Recommendations","date":"2023-06-29","arxiv_id":"2306.17256","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-personalized-cold-start#ran","syntology_url":"https://syntology.ai/paper/2306.17256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17256"}},"official":{"repos":["jacksonwuxs/promptrec"],"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/openp5-benchmarking-foundation-models-for","slug":"openp5-benchmarking-foundation-models-for","title":"OpenP5: An Open-Source Platform for Developing, Training, and Evaluating LLM-based Recommender Systems","date":"2023-06-19","arxiv_id":"2306.11134","repositories_listed":4,"syntology":{"n":25,"n_ran":23,"n_constructed":0,"n_ran_checked":20,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":18,"n_pointer_only":9,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 1 violated, 18 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/openp5-benchmarking-foundation-models-for#ran","syntology_url":"https://syntology.ai/paper/2306.11134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11134"}},"official":{"repos":["agiresearch/openp5"],"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":["listed","official"]}}},{"url":"/paper/katakomba-tools-and-benchmarks-for-data","slug":"katakomba-tools-and-benchmarks-for-data","title":"Katakomba: Tools and Benchmarks for Data-Driven NetHack","date":"2023-06-14","arxiv_id":"2306.08772","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/katakomba-tools-and-benchmarks-for-data#ran","syntology_url":"https://syntology.ai/paper/2306.08772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08772"}},"official":{"repos":["corl-team/katakomba"],"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/when-to-show-a-suggestion-integrating-human","slug":"when-to-show-a-suggestion-integrating-human","title":"When to Show a Suggestion? Integrating Human Feedback in AI-Assisted Programming","date":"2023-06-08","arxiv_id":"2306.04930","repositories_listed":1,"syntology":{"n":19,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/when-to-show-a-suggestion-integrating-human#ran","syntology_url":"https://syntology.ai/paper/2306.04930","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04930"}},"official":{"repos":["microsoft/coderec_programming_states"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-flow-network-for-listwise","slug":"generative-flow-network-for-listwise","title":"Generative Flow Network for Listwise Recommendation","date":"2023-06-04","arxiv_id":"2306.02239","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":0,"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/generative-flow-network-for-listwise#ran","syntology_url":"https://syntology.ai/paper/2306.02239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02239"}},"official":{"repos":["charliemat/gfn4rec"],"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/graph-transformer-for-recommendation","slug":"graph-transformer-for-recommendation","title":"Graph Transformer for Recommendation","date":"2023-06-04","arxiv_id":"2306.02330","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/graph-transformer-for-recommendation#ran","syntology_url":"https://syntology.ai/paper/2306.02330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02330"}},"official":{"repos":["hkuds/gformer"],"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/dothash-estimating-set-similarity-metrics-for","slug":"dothash-estimating-set-similarity-metrics-for","title":"DotHash: Estimating Set Similarity Metrics for Link Prediction and Document Deduplication","date":"2023-05-27","arxiv_id":"2305.17310","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/dothash-estimating-set-similarity-metrics-for#ran","syntology_url":"https://syntology.ai/paper/2305.17310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17310"}},"official":{"repos":["mikeheddes/dothash"],"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/vip5-towards-multimodal-foundation-models-for","slug":"vip5-towards-multimodal-foundation-models-for","title":"VIP5: Towards Multimodal Foundation Models for Recommendation","date":"2023-05-23","arxiv_id":"2305.14302","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vip5-towards-multimodal-foundation-models-for#ran","syntology_url":"https://syntology.ai/paper/2305.14302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14302"}},"official":{"repos":["jeykigung/vip5"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-the-evaluation-for-conversational","slug":"rethinking-the-evaluation-for-conversational","title":"Rethinking the Evaluation for Conversational Recommendation in the Era of Large Language Models","date":"2023-05-22","arxiv_id":"2305.13112","repositories_listed":1,"syntology":{"n":17,"n_ran":5,"n_constructed":1,"n_ran_checked":4,"n_instrument":1,"n_unverified":12,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 1 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) · 12 unverified","sample_list":"/paper/rethinking-the-evaluation-for-conversational#ran","syntology_url":"https://syntology.ai/paper/2305.13112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13112"}},"official":{"repos":["rucaibox/ievalm-crs"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/pina-leveraging-side-information-in-extreme","slug":"pina-leveraging-side-information-in-extreme","title":"PINA: Leveraging Side Information in eXtreme Multi-label Classification via Predicted Instance Neighborhood Aggregation","date":"2023-05-21","arxiv_id":"2305.12349","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/pina-leveraging-side-information-in-extreme#ran","syntology_url":"https://syntology.ai/paper/2305.12349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12349"}},"official":{"repos":["amzn/pecos"],"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/unified-embedding-battle-tested-feature","slug":"unified-embedding-battle-tested-feature","title":"Unified Embedding: Battle-Tested Feature Representations for Web-Scale ML Systems","date":"2023-05-20","arxiv_id":"2305.12102","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unified-embedding-battle-tested-feature#ran","syntology_url":"https://syntology.ai/paper/2305.12102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12102"}},"official":null}},{"url":"/paper/large-language-models-are-zero-shot-rankers","slug":"large-language-models-are-zero-shot-rankers","title":"Large Language Models are Zero-Shot Rankers for Recommender Systems","date":"2023-05-15","arxiv_id":"2305.08845","repositories_listed":2,"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":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) · 0 unverified","sample_list":"/paper/large-language-models-are-zero-shot-rankers#ran","syntology_url":"https://syntology.ai/paper/2305.08845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08845"}},"official":{"repos":["rucaibox/llmrank"],"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/momo-momentum-models-for-adaptive-learning","slug":"momo-momentum-models-for-adaptive-learning","title":"MoMo: Momentum Models for Adaptive Learning Rates","date":"2023-05-12","arxiv_id":"2305.07583","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/momo-momentum-models-for-adaptive-learning#ran","syntology_url":"https://syntology.ai/paper/2305.07583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07583"}},"official":{"repos":["fabian-sp/MoMo"],"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-classification-of-feedback-loops-and-their","slug":"a-classification-of-feedback-loops-and-their","title":"A Classification of Feedback Loops and Their Relation to Biases in Automated Decision-Making Systems","date":"2023-05-10","arxiv_id":"2305.06055","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/a-classification-of-feedback-loops-and-their#ran","syntology_url":"https://syntology.ai/paper/2305.06055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06055"}},"official":{"repos":["paganick/feedback-loops-and-biases"],"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/recommender-systems-with-generative-retrieval","slug":"recommender-systems-with-generative-retrieval","title":"Recommender Systems with Generative Retrieval","date":"2023-05-08","arxiv_id":"2305.05065","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/recommender-systems-with-generative-retrieval#ran","syntology_url":"https://syntology.ai/paper/2305.05065","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05065"}},"official":null}},{"url":"/paper/miread-simple-method-for-learning-high","slug":"miread-simple-method-for-learning-high","title":"MIReAD: Simple Method for Learning High-quality Representations from Scientific Documents","date":"2023-05-07","arxiv_id":"2305.04177","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/miread-simple-method-for-learning-high#ran","syntology_url":"https://syntology.ai/paper/2305.04177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04177"}},"official":{"repos":["arazd/miread"],"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/uncovering-chatgpt-s-capabilities-in","slug":"uncovering-chatgpt-s-capabilities-in","title":"Uncovering ChatGPT's Capabilities in Recommender Systems","date":"2023-05-03","arxiv_id":"2305.02182","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/uncovering-chatgpt-s-capabilities-in#ran","syntology_url":"https://syntology.ai/paper/2305.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02182"}},"official":{"repos":["rainym00d/llm4rs"],"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/tallrec-an-effective-and-efficient-tuning","slug":"tallrec-an-effective-and-efficient-tuning","title":"TALLRec: An Effective and Efficient Tuning Framework to Align Large Language Model with Recommendation","date":"2023-04-30","arxiv_id":"2305.00447","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tallrec-an-effective-and-efficient-tuning#ran","syntology_url":"https://syntology.ai/paper/2305.00447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00447"}},"official":{"repos":["sai990323/tallrec"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/melt-mutual-enhancement-of-long-tailed-user","slug":"melt-mutual-enhancement-of-long-tailed-user","title":"MELT: Mutual Enhancement of Long-Tailed User and Item for Sequential Recommendation","date":"2023-04-17","arxiv_id":"2304.08382","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/melt-mutual-enhancement-of-long-tailed-user#ran","syntology_url":"https://syntology.ai/paper/2304.08382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.08382"}},"official":{"repos":["rlqja1107/melt"],"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","unlocated"]}}},{"url":"/paper/diffurec-a-diffusion-model-for-sequential","slug":"diffurec-a-diffusion-model-for-sequential","title":"DiffuRec: A Diffusion Model for Sequential Recommendation","date":"2023-04-03","arxiv_id":"2304.00686","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/diffurec-a-diffusion-model-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2304.00686","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00686"}},"official":{"repos":["whuir/diffurec"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamically-expandable-graph-convolution-for","slug":"dynamically-expandable-graph-convolution-for","title":"Dynamically Expandable Graph Convolution for Streaming Recommendation","date":"2023-03-21","arxiv_id":"2303.11700","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/dynamically-expandable-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2303.11700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11700"}},"official":{"repos":["bokwaiho/degc"],"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/debiased-contrastive-learning-for-sequential","slug":"debiased-contrastive-learning-for-sequential","title":"Debiased Contrastive Learning for Sequential Recommendation","date":"2023-03-21","arxiv_id":"2303.11780","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"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 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) · 2 unverified","sample_list":"/paper/debiased-contrastive-learning-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2303.11780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11780"}},"official":{"repos":["hkuds/dcrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lightgcl-simple-yet-effective-graph","slug":"lightgcl-simple-yet-effective-graph","title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation","date":"2023-02-16","arxiv_id":"2302.08191","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"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 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/lightgcl-simple-yet-effective-graph#ran","syntology_url":"https://syntology.ai/paper/2302.08191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08191"}},"official":{"repos":["hkuds/lightgcl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/practical-cross-system-shilling-attacks-with","slug":"practical-cross-system-shilling-attacks-with","title":"Practical Cross-System Shilling Attacks with Limited Access to Data","date":"2023-02-14","arxiv_id":"2302.07145","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/practical-cross-system-shilling-attacks-with#ran","syntology_url":"https://syntology.ai/paper/2302.07145","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.07145"}},"official":{"repos":["KDEGroup/PC-Attack"],"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/graph-signal-sampling-for-inductive-one-bit","slug":"graph-signal-sampling-for-inductive-one-bit","title":"Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution","date":"2023-02-08","arxiv_id":"2302.03933","repositories_listed":1,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/graph-signal-sampling-for-inductive-one-bit#ran","syntology_url":"https://syntology.ai/paper/2302.03933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03933"}},"official":{"repos":["cchao0116/GSIMC-ICLR2023"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-recommendations-with-reinforcement","slug":"multi-task-recommendations-with-reinforcement","title":"Multi-Task Recommendations with Reinforcement Learning","date":"2023-02-07","arxiv_id":"2302.03328","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/multi-task-recommendations-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2302.03328","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03328"}},"official":{"repos":["applied-machine-learning-lab/rmtl"],"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/prefrec-preference-based-recommender-systems","slug":"prefrec-preference-based-recommender-systems","title":"PrefRec: Recommender Systems with Human Preferences for Reinforcing Long-term User Engagement","date":"2022-12-06","arxiv_id":"2212.02779","repositories_listed":1,"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/prefrec-preference-based-recommender-systems#ran","syntology_url":"https://syntology.ai/paper/2212.02779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.02779"}},"official":null}},{"url":"/paper/link-prediction-with-non-contrastive-learning","slug":"link-prediction-with-non-contrastive-learning","title":"Link Prediction with Non-Contrastive Learning","date":"2022-11-25","arxiv_id":"2211.14394","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/link-prediction-with-non-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2211.14394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14394"}},"official":{"repos":["snap-research/non-contrastive-link-prediction"],"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/a-survey-of-deep-graph-clustering-taxonomy","slug":"a-survey-of-deep-graph-clustering-taxonomy","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","date":"2022-11-23","arxiv_id":"2211.12875","repositories_listed":2,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-survey-of-deep-graph-clustering-taxonomy#ran","syntology_url":"https://syntology.ai/paper/2211.12875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12875"}},"official":{"repos":["marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering","yueliu1999/awesome-deep-graph-clustering"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/perturbation-recovery-method-for","slug":"perturbation-recovery-method-for","title":"Blurring-Sharpening Process Models for Collaborative Filtering","date":"2022-11-17","arxiv_id":"2211.09324","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/perturbation-recovery-method-for#ran","syntology_url":"https://syntology.ai/paper/2211.09324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09324"}},"official":{"repos":["jeongwhanchoi/bspm"],"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/unlearning-nonlinear-graph-classifiers-in-the","slug":"unlearning-nonlinear-graph-classifiers-in-the","title":"Unlearning Graph Classifiers with Limited Data Resources","date":"2022-11-06","arxiv_id":"2211.03216","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/unlearning-nonlinear-graph-classifiers-in-the#ran","syntology_url":"https://syntology.ai/paper/2211.03216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03216"}},"official":null}},{"url":"/paper/kglm-integrating-knowledge-graph-structure-in","slug":"kglm-integrating-knowledge-graph-structure-in","title":"KGLM: Integrating Knowledge Graph Structure in Language Models for Link Prediction","date":"2022-11-04","arxiv_id":"2211.02744","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":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/kglm-integrating-knowledge-graph-structure-in#ran","syntology_url":"https://syntology.ai/paper/2211.02744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02744"}},"official":{"repos":["ibpa/kglm"],"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/a-gpu-specialized-inference-parameter-server","slug":"a-gpu-specialized-inference-parameter-server","title":"A GPU-specialized Inference Parameter Server for Large-Scale Deep Recommendation Models","date":"2022-10-17","arxiv_id":"2210.08804","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-gpu-specialized-inference-parameter-server#ran","syntology_url":"https://syntology.ai/paper/2210.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08804"}},"official":{"repos":["nvidia-merlin/hugectr"],"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/tenrec-a-large-scale-multipurpose-benchmark","slug":"tenrec-a-large-scale-multipurpose-benchmark","title":"Tenrec: A Large-scale Multipurpose Benchmark Dataset for Recommender Systems","date":"2022-10-13","arxiv_id":"2210.10629","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tenrec-a-large-scale-multipurpose-benchmark#ran","syntology_url":"https://syntology.ai/paper/2210.10629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10629"}},"official":{"repos":["yuangh-x/2022-nips-tenrec"],"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/dreamshard-generalizable-embedding-table","slug":"dreamshard-generalizable-embedding-table","title":"DreamShard: Generalizable Embedding Table Placement for Recommender Systems","date":"2022-10-05","arxiv_id":"2210.02023","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dreamshard-generalizable-embedding-table#ran","syntology_url":"https://syntology.ai/paper/2210.02023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02023"}},"official":{"repos":["daochenzha/dreamshard"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-principled-user-side-recommender","slug":"towards-principled-user-side-recommender","title":"Towards Principled User-side Recommender Systems","date":"2022-08-21","arxiv_id":"2208.09864","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-principled-user-side-recommender#ran","syntology_url":"https://syntology.ai/paper/2208.09864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.09864"}},"official":{"repos":["joisino/consul"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/croloss-towards-a-customizable-loss-for","slug":"croloss-towards-a-customizable-loss-for","title":"CROLoss: Towards a Customizable Loss for Retrieval Models in Recommender Systems","date":"2022-08-05","arxiv_id":"2208.02971","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/croloss-towards-a-customizable-loss-for#ran","syntology_url":"https://syntology.ai/paper/2208.02971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.02971"}},"official":{"repos":["WDdeBWT/CROLoss"],"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/every-preference-changes-differently-neural","slug":"every-preference-changes-differently-neural","title":"Everyone's Preference Changes Differently: Weighted Multi-Interest Retrieval Model","date":"2022-07-14","arxiv_id":"2207.06652","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":6,"n_ran_checked":9,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"14 ran (of which 6 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/every-preference-changes-differently-neural#ran","syntology_url":"https://syntology.ai/paper/2207.06652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06652"}},"official":{"repos":["shihui2010/mip"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":6,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/contextual-bandits-with-smooth-regret","slug":"contextual-bandits-with-smooth-regret","title":"Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces","date":"2022-07-12","arxiv_id":"2207.05849","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/contextual-bandits-with-smooth-regret#ran","syntology_url":"https://syntology.ai/paper/2207.05849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05849"}},"official":{"repos":["pmineiro/smoothcb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficiently-leveraging-multi-level-user","slug":"efficiently-leveraging-multi-level-user","title":"Efficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Network","date":"2022-06-26","arxiv_id":"2206.12781","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficiently-leveraging-multi-level-user#ran","syntology_url":"https://syntology.ai/paper/2206.12781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12781"}},"official":{"repos":["Peiyance/Atten-Mixer-torch"],"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","unlocated"]}}},{"url":"/paper/towards-representation-alignment-and","slug":"towards-representation-alignment-and","title":"Towards Representation Alignment and Uniformity in Collaborative Filtering","date":"2022-06-26","arxiv_id":"2206.12811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/towards-representation-alignment-and#ran","syntology_url":"https://syntology.ai/paper/2206.12811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12811"}},"official":{"repos":["thuwangcy/directau"],"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/on-the-generalizability-and-predictability-of","slug":"on-the-generalizability-and-predictability-of","title":"On the Generalizability and Predictability of Recommender Systems","date":"2022-06-23","arxiv_id":"2206.11886","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":4,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-generalizability-and-predictability-of#ran","syntology_url":"https://syntology.ai/paper/2206.11886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11886"}},"official":{"repos":["naszilla/reczilla"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-universal-sequence-representation","slug":"towards-universal-sequence-representation","title":"Towards Universal Sequence Representation Learning for Recommender Systems","date":"2022-06-13","arxiv_id":"2206.05941","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"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 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) · 2 unverified","sample_list":"/paper/towards-universal-sequence-representation#ran","syntology_url":"https://syntology.ai/paper/2206.05941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05941"}},"official":{"repos":["rucaibox/unisrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/comprehensive-fair-meta-learned-recommender","slug":"comprehensive-fair-meta-learned-recommender","title":"Comprehensive Fair Meta-learned Recommender System","date":"2022-06-09","arxiv_id":"2206.04789","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/comprehensive-fair-meta-learned-recommender#ran","syntology_url":"https://syntology.ai/paper/2206.04789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04789"}},"official":{"repos":["weitianxin/CLOVER"],"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/infinite-recommendation-networks-a-data","slug":"infinite-recommendation-networks-a-data","title":"Infinite Recommendation Networks: A Data-Centric Approach","date":"2022-06-03","arxiv_id":"2206.02626","repositories_listed":5,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/infinite-recommendation-networks-a-data#ran","syntology_url":"https://syntology.ai/paper/2206.02626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02626"}},"official":{"repos":["noveens/distill_cf","noveens/infinite_ae_cf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/generalized-delayed-feedback-model-with-post","slug":"generalized-delayed-feedback-model-with-post","title":"Generalized Delayed Feedback Model with Post-Click Information in Recommender Systems","date":"2022-06-01","arxiv_id":"2206.00407","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":3,"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/generalized-delayed-feedback-model-with-post#ran","syntology_url":"https://syntology.ai/paper/2206.00407","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.00407"}},"official":{"repos":["ThyrixYang/gdfm_nips22"],"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/fairness-in-the-first-stage-of-two-stage","slug":"fairness-in-the-first-stage-of-two-stage","title":"Uncertainty Quantification for Fairness in Two-Stage Recommender Systems","date":"2022-05-30","arxiv_id":"2205.15436","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-in-the-first-stage-of-two-stage#ran","syntology_url":"https://syntology.ai/paper/2205.15436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15436"}},"official":{"repos":["lequnwang/fair-two-stage-recommender"],"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"]}}}],"record_sha256":"277cd5e4d914ec60591ff9880cfce77fe734a1fb130206ea506122546f3d851f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}