{"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/collaborative-filtering/papers/ran/1","list_of":"/task/collaborative-filtering","task":"Collaborative Filtering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,63],"of":63,"counts":{"archive_papers_tagged":1309,"with_a_code_link":461,"where_syntology_ran_a_sample":63,"not_listed_spam_title":0,"listed":1309,"listed_where_code_ran":63,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":4,"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/collaborative-filtering/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/llm2rec-large-language-models-are-powerful","slug":"llm2rec-large-language-models-are-powerful","title":"LLM2Rec: Large Language Models Are Powerful Embedding Models for Sequential Recommendation","date":"2025-06-16","arxiv_id":"2506.21579","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/llm2rec-large-language-models-are-powerful#ran","syntology_url":"https://syntology.ai/paper/2506.21579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.21579"}},"official":{"repos":["happypointer/llm2rec"],"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/understanding-and-improving-adversarial-1","slug":"understanding-and-improving-adversarial-1","title":"Understanding and Improving Adversarial Collaborative Filtering for Robust Recommendation","date":"2024-10-30","arxiv_id":"2410.22844","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/understanding-and-improving-adversarial-1#ran","syntology_url":"https://syntology.ai/paper/2410.22844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22844"}},"official":{"repos":["Kaike-Zhang/PamaCF"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-model-empowered-embedding","slug":"large-language-model-empowered-embedding","title":"LLMEmb: Large Language Model Can Be a Good Embedding Generator for Sequential Recommendation","date":"2024-09-30","arxiv_id":"2409.19925","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-model-empowered-embedding#ran","syntology_url":"https://syntology.ai/paper/2409.19925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19925"}},"official":{"repos":["applied-machine-learning-lab/llmemb","liuqidong07/LLMEmb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-graph-contrastive-learning-with-1","slug":"enhancing-graph-contrastive-learning-with-1","title":"Enhancing Graph Contrastive Learning with Reliable and Informative Augmentation for Recommendation","date":"2024-09-09","arxiv_id":"2409.05633","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/enhancing-graph-contrastive-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2409.05633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05633"}},"official":{"repos":["rucaibox/cogcl"],"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/personalized-federated-collaborative","slug":"personalized-federated-collaborative","title":"Personalized Federated Collaborative Filtering: A Variational AutoEncoder Approach","date":"2024-08-16","arxiv_id":"2408.08931","repositories_listed":1,"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/personalized-federated-collaborative#ran","syntology_url":"https://syntology.ai/paper/2408.08931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08931"}},"official":{"repos":["mtics/feddae"],"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/language-models-encode-collaborative-signals","slug":"language-models-encode-collaborative-signals","title":"Language Representations Can be What Recommenders Need: Findings and Potentials","date":"2024-07-07","arxiv_id":"2407.05441","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/language-models-encode-collaborative-signals#ran","syntology_url":"https://syntology.ai/paper/2407.05441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05441"}},"official":{"repos":["lehengthu/alpharec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fourierkan-gcf-fourier-kolmogorov-arnold","slug":"fourierkan-gcf-fourier-kolmogorov-arnold","title":"FourierKAN-GCF: Fourier Kolmogorov-Arnold Network -- An Effective and Efficient Feature Transformation for Graph Collaborative Filtering","date":"2024-06-03","arxiv_id":"2406.01034","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/fourierkan-gcf-fourier-kolmogorov-arnold#ran","syntology_url":"https://syntology.ai/paper/2406.01034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01034"}},"official":{"repos":["jinfeng-xu/fkan-gcf"],"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/implicitslim-and-how-it-improves-embedding","slug":"implicitslim-and-how-it-improves-embedding","title":"ImplicitSLIM and How it Improves Embedding-based Collaborative Filtering","date":"2024-05-31","arxiv_id":"2406.00198","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":2,"n_no_contract":4,"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, 2 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/implicitslim-and-how-it-improves-embedding#ran","syntology_url":"https://syntology.ai/paper/2406.00198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00198"}},"official":{"repos":["ilya-shenbin/implicitslim"],"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/svd-ae-simple-autoencoders-for-collaborative","slug":"svd-ae-simple-autoencoders-for-collaborative","title":"SVD-AE: Simple Autoencoders for Collaborative Filtering","date":"2024-05-08","arxiv_id":"2405.04746","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/svd-ae-simple-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/2405.04746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04746"}},"official":{"repos":["jeongwhanchoi/svd-ae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/knowledge-adaptation-from-large-language","slug":"knowledge-adaptation-from-large-language","title":"LEARN: Knowledge Adaptation from Large Language Model to Recommendation for Practical Industrial Application","date":"2024-05-07","arxiv_id":"2405.03988","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/knowledge-adaptation-from-large-language#ran","syntology_url":"https://syntology.ai/paper/2405.03988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03988"}},"official":{"repos":["adxcreative/LEARN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-sampling-for-contrastive-views-and","slug":"stochastic-sampling-for-contrastive-views-and","title":"SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation","date":"2024-05-01","arxiv_id":"2405.00287","repositories_listed":1,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/stochastic-sampling-for-contrastive-views-and#ran","syntology_url":"https://syntology.ai/paper/2405.00287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.00287"}},"official":{"repos":["jeongwhanchoi/scone"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/debiased-collaborative-filtering-with-kernel","slug":"debiased-collaborative-filtering-with-kernel","title":"Debiased Collaborative Filtering with Kernel-Based Causal Balancing","date":"2024-04-30","arxiv_id":"2404.19596","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":2,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/debiased-collaborative-filtering-with-kernel#ran","syntology_url":"https://syntology.ai/paper/2404.19596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.19596"}},"official":{"repos":["haoxuanli-pku/iclr24-kernel-balancing"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":2,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/collaborative-filtering-based-on-diffusion","slug":"collaborative-filtering-based-on-diffusion","title":"Collaborative Filtering Based on Diffusion Models: Unveiling the Potential of High-Order Connectivity","date":"2024-04-22","arxiv_id":"2404.14240","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/collaborative-filtering-based-on-diffusion#ran","syntology_url":"https://syntology.ai/paper/2404.14240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14240"}},"official":{"repos":["jackfrost168/cf_diff"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/turbo-cf-matrix-decomposition-free-graph","slug":"turbo-cf-matrix-decomposition-free-graph","title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","date":"2024-04-22","arxiv_id":"2404.14243","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/turbo-cf-matrix-decomposition-free-graph#ran","syntology_url":"https://syntology.ai/paper/2404.14243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.14243"}},"official":{"repos":["jindeok/turbo-cf"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-meet-collaborative","slug":"large-language-models-meet-collaborative","title":"Large Language Models meet Collaborative Filtering: An Efficient All-round LLM-based Recommender System","date":"2024-04-17","arxiv_id":"2404.11343","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/large-language-models-meet-collaborative#ran","syntology_url":"https://syntology.ai/paper/2404.11343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.11343"}},"official":{"repos":["ghdtjr/a-llmrec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cluster-based-graph-collaborative-filtering","slug":"cluster-based-graph-collaborative-filtering","title":"Cluster-based Graph Collaborative Filtering","date":"2024-04-16","arxiv_id":"2404.10321","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cluster-based-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/2404.10321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10321"}},"official":{"repos":["zhao254014/clustergcf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sequential-recommendation-with-latent","slug":"sequential-recommendation-with-latent","title":"Sequential Recommendation with Latent Relations based on Large Language Model","date":"2024-03-27","arxiv_id":"2403.18348","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequential-recommendation-with-latent#ran","syntology_url":"https://syntology.ai/paper/2403.18348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.18348"}},"official":{"repos":["ysh-1998/lrd"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhanced-generative-recommendation-via","slug":"enhanced-generative-recommendation-via","title":"Content-Based Collaborative Generation for Recommender Systems","date":"2024-03-27","arxiv_id":"2403.18480","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/enhanced-generative-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/2403.18480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.18480"}},"official":{"repos":["junewang0614/colarec"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/how-does-message-passing-improve","slug":"how-does-message-passing-improve","title":"How Does Message Passing Improve Collaborative Filtering?","date":"2024-03-27","arxiv_id":"2404.08660","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-does-message-passing-improve#ran","syntology_url":"https://syntology.ai/paper/2404.08660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08660"}},"official":{"repos":["snap-research/test-time-aggregation-for-cf"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neighborhood-enhanced-supervised-contrastive","slug":"neighborhood-enhanced-supervised-contrastive","title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","date":"2024-02-18","arxiv_id":"2402.11523","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neighborhood-enhanced-supervised-contrastive#ran","syntology_url":"https://syntology.ai/paper/2402.11523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11523"}},"official":null}},{"url":"/paper/recdcl-dual-contrastive-learning-for","slug":"recdcl-dual-contrastive-learning-for","title":"RecDCL: Dual Contrastive Learning for Recommendation","date":"2024-01-28","arxiv_id":"2401.15635","repositories_listed":1,"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/recdcl-dual-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2401.15635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15635"}},"official":{"repos":["thudm/recdcl"],"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/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/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/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/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/robust-collaborative-filtering-to-popularity","slug":"robust-collaborative-filtering-to-popularity","title":"Robust Collaborative Filtering to Popularity Distribution Shift","date":"2023-10-16","arxiv_id":"2310.10696","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/robust-collaborative-filtering-to-popularity#ran","syntology_url":"https://syntology.ai/paper/2310.10696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10696"}},"official":{"repos":["anzhang314/popgo"],"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/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/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/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/disentangled-contrastive-collaborative","slug":"disentangled-contrastive-collaborative","title":"Disentangled Contrastive Collaborative Filtering","date":"2023-05-04","arxiv_id":"2305.02759","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/disentangled-contrastive-collaborative#ran","syntology_url":"https://syntology.ai/paper/2305.02759","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.02759"}},"official":{"repos":["hkuds/dccf"],"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/invariant-collaborative-filtering-to","slug":"invariant-collaborative-filtering-to","title":"Invariant Collaborative Filtering to Popularity Distribution Shift","date":"2023-02-10","arxiv_id":"2302.05328","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/invariant-collaborative-filtering-to#ran","syntology_url":"https://syntology.ai/paper/2302.05328","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.05328"}},"official":{"repos":["anzhang314/invcf"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"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/incorporating-bias-aware-margins-into","slug":"incorporating-bias-aware-margins-into","title":"Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filtering","date":"2022-10-20","arxiv_id":"2210.11054","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/incorporating-bias-aware-margins-into#ran","syntology_url":"https://syntology.ai/paper/2210.11054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.11054"}},"official":{"repos":["anzhang314/bc-loss"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/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/gram-fast-fine-tuning-of-pre-trained-language","slug":"gram-fast-fine-tuning-of-pre-trained-language","title":"GRAM: Fast Fine-tuning of Pre-trained Language Models for Content-based Collaborative Filtering","date":"2022-04-08","arxiv_id":"2204.04179","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":4,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gram-fast-fine-tuning-of-pre-trained-language#ran","syntology_url":"https://syntology.ai/paper/2204.04179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.04179"}},"official":{"repos":["yoonseok312/gram"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/on-sampling-collaborative-filtering-datasets","slug":"on-sampling-collaborative-filtering-datasets","title":"On Sampling Collaborative Filtering Datasets","date":"2022-01-13","arxiv_id":"2201.04768","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/on-sampling-collaborative-filtering-datasets#ran","syntology_url":"https://syntology.ai/paper/2201.04768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.04768"}},"official":{"repos":["noveens/sampling_cf"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-or-non-linear-that-is-the-question","slug":"linear-or-non-linear-that-is-the-question","title":"Linear, or Non-Linear, That is the Question!","date":"2021-11-14","arxiv_id":"2111.07265","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/linear-or-non-linear-that-is-the-question#ran","syntology_url":"https://syntology.ai/paper/2111.07265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.07265"}},"official":{"repos":["jeongwhanchoi/HMLET"],"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-trend-networks-for-recommendations","slug":"graph-trend-networks-for-recommendations","title":"Graph Trend Filtering Networks for Recommendations","date":"2021-08-12","arxiv_id":"2108.05552","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/graph-trend-networks-for-recommendations#ran","syntology_url":"https://syntology.ai/paper/2108.05552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05552"}},"official":{"repos":["wenqifan03/gtn-sigir2022"],"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/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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/lt-ocf-learnable-time-ode-based-collaborative#ran","syntology_url":"https://syntology.ai/paper/2108.06208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06208"}},"official":{"repos":["jeongwhanchoi/lt-ocf"],"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/causal-intervention-for-leveraging-popularity","slug":"causal-intervention-for-leveraging-popularity","title":"Causal Intervention for Leveraging Popularity Bias in Recommendation","date":"2021-05-13","arxiv_id":"2105.06067","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/causal-intervention-for-leveraging-popularity#ran","syntology_url":"https://syntology.ai/paper/2105.06067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.06067"}},"official":{"repos":["zyang1580/PDA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/counterfactual-explanations-for-neural","slug":"counterfactual-explanations-for-neural","title":"Counterfactual Explanations for Neural Recommenders","date":"2021-05-11","arxiv_id":"2105.05008","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/counterfactual-explanations-for-neural#ran","syntology_url":"https://syntology.ai/paper/2105.05008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.05008"}},"official":{"repos":["hieptk/accent"],"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/mining-latent-structures-for-multimedia","slug":"mining-latent-structures-for-multimedia","title":"Mining Latent Structures for Multimedia Recommendation","date":"2021-04-19","arxiv_id":"2104.09036","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mining-latent-structures-for-multimedia#ran","syntology_url":"https://syntology.ai/paper/2104.09036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09036"}},"official":{"repos":["CRIPAC-DIG/LATTICE"],"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/performance-of-hyperbolic-geometry-models-on","slug":"performance-of-hyperbolic-geometry-models-on","title":"Performance of Hyperbolic Geometry Models on Top-N Recommendation Tasks","date":"2020-08-15","arxiv_id":"2008.06716","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/performance-of-hyperbolic-geometry-models-on#ran","syntology_url":"https://syntology.ai/paper/2008.06716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06716"}},"official":{"repos":["evfro/HyperbolicRecommenders"],"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/explainable-recommendation-via-interpretable","slug":"explainable-recommendation-via-interpretable","title":"Explainable Recommendation via Interpretable Feature Mapping and Evaluation of Explainability","date":"2020-07-12","arxiv_id":"2007.06133","repositories_listed":0,"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/explainable-recommendation-via-interpretable#ran","syntology_url":"https://syntology.ai/paper/2007.06133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06133"}},"official":null}},{"url":"/paper/inductive-relational-matrix-completion","slug":"inductive-relational-matrix-completion","title":"Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach","date":"2020-07-09","arxiv_id":"2007.04833","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/inductive-relational-matrix-completion#ran","syntology_url":"https://syntology.ai/paper/2007.04833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04833"}},"official":{"repos":["qitianwu/IDCF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/disentangled-graph-collaborative-filtering","slug":"disentangled-graph-collaborative-filtering","title":"Disentangled Graph Collaborative Filtering","date":"2020-07-03","arxiv_id":"2007.01764","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/disentangled-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/2007.01764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01764"}},"official":{"repos":["xiangwang1223/disentangled_graph_collaborative_filtering"],"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":["listed","official","unlocated"]}}},{"url":"/paper/towards-an-appropriate-query-key-and-value","slug":"towards-an-appropriate-query-key-and-value","title":"Towards an Appropriate Query, Key, and Value Computation for Knowledge Tracing","date":"2020-02-14","arxiv_id":"2002.07033","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-an-appropriate-query-key-and-value#ran","syntology_url":"https://syntology.ai/paper/2002.07033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07033"}},"official":null}},{"url":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","repositories_listed":18,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lightgcn-simplifying-and-powering-graph#ran","syntology_url":"https://syntology.ai/paper/2002.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02126"}},"official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/recvae-a-new-variational-autoencoder-for-top","slug":"recvae-a-new-variational-autoencoder-for-top","title":"RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback","date":"2019-12-24","arxiv_id":"1912.11160","repositories_listed":3,"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":0,"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/recvae-a-new-variational-autoencoder-for-top#ran","syntology_url":"https://syntology.ai/paper/1912.11160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11160"}},"official":{"repos":["ilya-shenbin/RecVAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mixed-dimension-embeddings-with-application","slug":"mixed-dimension-embeddings-with-application","title":"Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems","date":"2019-09-25","arxiv_id":"1909.11810","repositories_listed":6,"syntology":{"n":26,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":26,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mixed-dimension-embeddings-with-application#ran","syntology_url":"https://syntology.ai/paper/1909.11810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11810"}},"official":{"repos":["facebookresearch/dlrm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-graph-collaborative-filtering","slug":"neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","arxiv_id":"1905.08108","repositories_listed":21,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-graph-collaborative-filtering#ran","syntology_url":"https://syntology.ai/paper/1905.08108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08108"}},"official":{"repos":["xiangwang1223/neural_graph_collaborative_filtering"],"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/190503375","slug":"190503375","title":"Embarrassingly Shallow Autoencoders for Sparse Data","date":"2019-05-08","arxiv_id":"1905.03375","repositories_listed":9,"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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190503375#ran","syntology_url":"https://syntology.ai/paper/1905.03375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03375"}},"official":null}},{"url":"/paper/on-the-difficulty-of-evaluating-baselines-a","slug":"on-the-difficulty-of-evaluating-baselines-a","title":"On the Difficulty of Evaluating Baselines: A Study on Recommender Systems","date":"2019-05-04","arxiv_id":"1905.01395","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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/on-the-difficulty-of-evaluating-baselines-a#ran","syntology_url":"https://syntology.ai/paper/1905.01395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01395"}},"official":null}},{"url":"/paper/190412575","slug":"190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","arxiv_id":"1904.12575","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190412575#ran","syntology_url":"https://syntology.ai/paper/1904.12575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12575"}},"official":{"repos":["hwwang55/KGCN"],"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":["listed","official"]}}},{"url":"/paper/multi-task-feature-learning-for-knowledge","slug":"multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","arxiv_id":"1901.08907","repositories_listed":3,"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/multi-task-feature-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1901.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08907"}},"official":{"repos":["hwwang55/MKR"],"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/oboe-collaborative-filtering-for-automl","slug":"oboe-collaborative-filtering-for-automl","title":"OBOE: Collaborative Filtering for AutoML Model Selection","date":"2018-08-09","arxiv_id":"1808.03233","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/oboe-collaborative-filtering-for-automl#ran","syntology_url":"https://syntology.ai/paper/1808.03233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.03233"}},"official":{"repos":["udellgroup/oboe"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ripplenet-propagating-user-preferences-on-the","slug":"ripplenet-propagating-user-preferences-on-the","title":"RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems","date":"2018-03-09","arxiv_id":"1803.03467","repositories_listed":9,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ripplenet-propagating-user-preferences-on-the#ran","syntology_url":"https://syntology.ai/paper/1803.03467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03467"}},"official":{"repos":["hwwang55/RippleNet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/variational-autoencoders-for-collaborative","slug":"variational-autoencoders-for-collaborative","title":"Variational Autoencoders for Collaborative Filtering","date":"2018-02-16","arxiv_id":"1802.05814","repositories_listed":18,"syntology":{"n":21,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":1,"phrase":"14 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; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/variational-autoencoders-for-collaborative#ran","syntology_url":"https://syntology.ai/paper/1802.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05814"}},"official":{"repos":["dawenl/vae_cf"],"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/probabilistic-matrix-factorization-for","slug":"probabilistic-matrix-factorization-for","title":"Probabilistic Matrix Factorization for Automated Machine Learning","date":"2017-05-15","arxiv_id":"1705.05355","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/probabilistic-matrix-factorization-for#ran","syntology_url":"https://syntology.ai/paper/1705.05355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.05355"}},"official":{"repos":["rsheth80/pmf-automl"],"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/a-neural-autoregressive-approach-to","slug":"a-neural-autoregressive-approach-to","title":"A Neural Autoregressive Approach to Collaborative Filtering","date":"2016-05-31","arxiv_id":"1605.09477","repositories_listed":3,"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-neural-autoregressive-approach-to#ran","syntology_url":"https://syntology.ai/paper/1605.09477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.09477"}},"official":null}},{"url":"/paper/preference-completion-large-scale","slug":"preference-completion-large-scale","title":"Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons","date":"2015-07-16","arxiv_id":"1507.04457","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/preference-completion-large-scale#ran","syntology_url":"https://syntology.ai/paper/1507.04457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1507.04457"}},"official":null}},{"url":"/paper/a-contextual-bandit-approach-to-personalized","slug":"a-contextual-bandit-approach-to-personalized","title":"A Contextual-Bandit Approach to Personalized News Article Recommendation","date":"2010-02-28","arxiv_id":"1003.0146","repositories_listed":12,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/a-contextual-bandit-approach-to-personalized#ran","syntology_url":"https://syntology.ai/paper/1003.0146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1003.0146"}},"official":null}},{"url":"/paper/matrix-completion-from-noisy-entries","slug":"matrix-completion-from-noisy-entries","title":"Matrix Completion from Noisy Entries","date":"2009-06-11","arxiv_id":"0906.2027","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/matrix-completion-from-noisy-entries#ran","syntology_url":"https://syntology.ai/paper/0906.2027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0906.2027"}},"official":null}}],"record_sha256":"bbce17eb0fceae705b418ca6567b81255d0987e17161de231e4f6191836e802b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}