{"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/2","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":14,"rows_per_page":100,"rows":[101,200],"of":1309,"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","prev":"/task/collaborative-filtering","next":"/task/collaborative-filtering/papers/3","papers":[{"url":"/paper/squeeze-and-excitation-a-weighted-graph","slug":"squeeze-and-excitation-a-weighted-graph","title":"Squeeze and Excitation: A Weighted Graph Contrastive Learning for Collaborative Filtering","date":"2025-04-06","arxiv_id":"2504.04443","repositories_listed":1,"syntology":null},{"url":"/paper/improvement-graph-convolution-collaborative","slug":"improvement-graph-convolution-collaborative","title":"Improvement Graph Convolution Collaborative Filtering with Weighted addition input","date":"2025-03-27","arxiv_id":"2503.21468","repositories_listed":1,"syntology":null},{"url":"/paper/variational-bayesian-personalized-ranking","slug":"variational-bayesian-personalized-ranking","title":"Variational Bayesian Personalized Ranking","date":"2025-03-14","arxiv_id":"2503.11067","repositories_listed":1,"syntology":null},{"url":"/paper/harmonizing-large-language-models-with","slug":"harmonizing-large-language-models-with","title":"Harmonizing Large Language Models with Collaborative Behavioral Signals for Conversational Recommendation","date":"2025-03-12","arxiv_id":"2503.10703","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-retrieval-for-large-language","slug":"collaborative-retrieval-for-large-language","title":"Collaborative Retrieval for Large Language Model-based Conversational Recommender Systems","date":"2025-02-19","arxiv_id":"2502.14137","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-popularity-bias-in-collaborative","slug":"mitigating-popularity-bias-in-collaborative","title":"Unbiased Collaborative Filtering with Fair Sampling","date":"2025-02-19","arxiv_id":"2502.13840","repositories_listed":1,"syntology":null},{"url":"/paper/g-refer-graph-retrieval-augmented-large","slug":"g-refer-graph-retrieval-augmented-large","title":"G-Refer: Graph Retrieval-Augmented Large Language Model for Explainable Recommendation","date":"2025-02-18","arxiv_id":"2502.12586","repositories_listed":1,"syntology":null},{"url":"/paper/criteria-aware-graph-filtering-extremely-fast","slug":"criteria-aware-graph-filtering-extremely-fast","title":"Criteria-Aware Graph Filtering: Extremely Fast Yet Accurate Multi-Criteria Recommendation","date":"2025-02-13","arxiv_id":"2502.09046","repositories_listed":1,"syntology":null},{"url":"/paper/use-of-air-quality-sensor-network-data-for","slug":"use-of-air-quality-sensor-network-data-for","title":"Use of Air Quality Sensor Network Data for Real-time Pollution-Aware POI Suggestion","date":"2025-02-13","arxiv_id":"2502.09155","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-filtering-meets-spectrum-shift","slug":"collaborative-filtering-meets-spectrum-shift","title":"Collaborative Filtering Meets Spectrum Shift: Connecting User-Item Interaction with Graph-Structured Side Information","date":"2025-02-12","arxiv_id":"2502.08071","repositories_listed":1,"syntology":null},{"url":"/paper/flow-matching-for-collaborative-filtering","slug":"flow-matching-for-collaborative-filtering","title":"Flow Matching for Collaborative Filtering","date":"2025-02-11","arxiv_id":"2502.07303","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-controlled-differential-1","slug":"graph-neural-controlled-differential-1","title":"Graph Neural Controlled Differential Equations For Collaborative Filtering","date":"2025-01-23","arxiv_id":"2501.13908","repositories_listed":1,"syntology":null},{"url":"/paper/diffusion-models-in-recommendation-systems-a","slug":"diffusion-models-in-recommendation-systems-a","title":"Diffusion Models in Recommendation Systems: A Survey","date":"2025-01-17","arxiv_id":"2501.10548","repositories_listed":1,"syntology":null},{"url":"/paper/reclm-recommendation-instruction-tuning","slug":"reclm-recommendation-instruction-tuning","title":"RecLM: Recommendation Instruction Tuning","date":"2024-12-26","arxiv_id":"2412.19302","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-the-hidden-treasures-enhancing","slug":"unlocking-the-hidden-treasures-enhancing","title":"Unlocking the Hidden Treasures: Enhancing Recommendations with Unlabeled Data","date":"2024-12-24","arxiv_id":"2412.18170","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-collaborative-filtering-2","slug":"heterogeneous-graph-collaborative-filtering-2","title":"MixRec: Heterogeneous Graph Collaborative Filtering","date":"2024-12-18","arxiv_id":"2412.13825","repositories_listed":1,"syntology":null},{"url":"/paper/stair-manipulating-collaborative-and","slug":"stair-manipulating-collaborative-and","title":"STAIR: Manipulating Collaborative and Multimodal Information for E-Commerce Recommendation","date":"2024-12-16","arxiv_id":"2412.11729","repositories_listed":1,"syntology":null},{"url":"/paper/language-model-prior-overcomes-cold-start","slug":"language-model-prior-overcomes-cold-start","title":"Language-Model Prior Overcomes Cold-Start Items","date":"2024-11-13","arxiv_id":"2411.09065","repositories_listed":1,"syntology":null},{"url":"/paper/recommender-systems-and-reinforcement","slug":"recommender-systems-and-reinforcement","title":"Recommender systems and reinforcement learning for human-building interaction and context-aware support: A text mining-driven review of scientific literature","date":"2024-11-13","arxiv_id":"2411.08734","repositories_listed":1,"syntology":null},{"url":"/paper/co-clustering-for-federated-recommender","slug":"co-clustering-for-federated-recommender","title":"Co-clustering for Federated Recommender System","date":"2024-11-03","arxiv_id":"2411.01690","repositories_listed":1,"syntology":null},{"url":"/paper/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/simultaneous-unlearning-of-multiple-protected","slug":"simultaneous-unlearning-of-multiple-protected","title":"Simultaneous Unlearning of Multiple Protected User Attributes From Variational Autoencoder Recommenders Using Adversarial Training","date":"2024-10-28","arxiv_id":"2410.20965","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-the-not-so-obvious-simple-and-fast","slug":"explaining-the-not-so-obvious-simple-and-fast","title":"Explaining the (Not So) Obvious: Simple and Fast Explanation of STAN, a Next Point of Interest Recommendation System","date":"2024-10-04","arxiv_id":"2410.03841","repositories_listed":1,"syntology":null},{"url":"/paper/neural-collaborative-filtering-to-detect","slug":"neural-collaborative-filtering-to-detect","title":"Neural Collaborative Filtering to Detect Anomalies in Human Semantic Trajectories","date":"2024-09-27","arxiv_id":"2409.18427","repositories_listed":1,"syntology":null},{"url":"/paper/twincl-a-twin-graph-contrastive-learning","slug":"twincl-a-twin-graph-contrastive-learning","title":"TwinCL: A Twin Graph Contrastive Learning Model for Collaborative Filtering","date":"2024-09-27","arxiv_id":"2409.19169","repositories_listed":1,"syntology":null},{"url":"/paper/a-multimodal-single-branch-embedding-network","slug":"a-multimodal-single-branch-embedding-network","title":"A Multimodal Single-Branch Embedding Network for Recommendation in Cold-Start and Missing Modality Scenarios","date":"2024-09-26","arxiv_id":"2409.17864","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-bpr-a-replicability-study-of-a","slug":"revisiting-bpr-a-replicability-study-of-a","title":"Revisiting BPR: A Replicability Study of a Common Recommender System Baseline","date":"2024-09-21","arxiv_id":"2409.14217","repositories_listed":1,"syntology":null},{"url":"/paper/beeformer-bridging-the-gap-between-semantic","slug":"beeformer-bridging-the-gap-between-semantic","title":"beeFormer: Bridging the Gap Between Semantic and Interaction Similarity in Recommender Systems","date":"2024-09-16","arxiv_id":"2409.10309","repositories_listed":1,"syntology":null},{"url":"/paper/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/improved-diversity-promoting-collaborative","slug":"improved-diversity-promoting-collaborative","title":"Improved Diversity-Promoting Collaborative Metric Learning for Recommendation","date":"2024-09-02","arxiv_id":"2409.01012","repositories_listed":1,"syntology":null},{"url":"/paper/cf-kan-kolmogorov-arnold-network-based","slug":"cf-kan-kolmogorov-arnold-network-based","title":"CF-KAN: Kolmogorov-Arnold Network-based Collaborative Filtering to Mitigate Catastrophic Forgetting in Recommender Systems","date":"2024-08-25","arxiv_id":"2409.05878","repositories_listed":1,"syntology":null},{"url":"/paper/fair-augmentation-for-graph-collaborative","slug":"fair-augmentation-for-graph-collaborative","title":"Fair Augmentation for Graph Collaborative Filtering","date":"2024-08-22","arxiv_id":"2408.12208","repositories_listed":1,"syntology":null},{"url":"/paper/easyrec-simple-yet-effective-language-models","slug":"easyrec-simple-yet-effective-language-models","title":"EasyRec: Simple yet Effective Language Models for Recommendation","date":"2024-08-16","arxiv_id":"2408.08821","repositories_listed":1,"syntology":null},{"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/modality-balanced-learning-for-multimedia","slug":"modality-balanced-learning-for-multimedia","title":"Modality-Balanced Learning for Multimedia Recommendation","date":"2024-07-26","arxiv_id":"2408.06360","repositories_listed":1,"syntology":null},{"url":"/paper/text-driven-neural-collaborative-filtering","slug":"text-driven-neural-collaborative-filtering","title":"Text-Driven Neural Collaborative Filtering Model for Paper Source Tracing","date":"2024-07-25","arxiv_id":"2407.17722","repositories_listed":1,"syntology":null},{"url":"/paper/l-2cl-embarrassingly-simple-layer-to-layer","slug":"l-2cl-embarrassingly-simple-layer-to-layer","title":"L^2CL: Embarrassingly Simple Layer-to-Layer Contrastive Learning for Graph Collaborative Filtering","date":"2024-07-19","arxiv_id":"2407.14266","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-review-of-recommender-systems","slug":"a-comprehensive-review-of-recommender-systems","title":"A Comprehensive Review of Recommender Systems: Transitioning from Theory to Practice","date":"2024-07-18","arxiv_id":"2407.13699","repositories_listed":1,"syntology":null},{"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/a-thorough-performance-benchmarking-on","slug":"a-thorough-performance-benchmarking-on","title":"A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems","date":"2024-06-25","arxiv_id":"2406.17335","repositories_listed":1,"syntology":null},{"url":"/paper/simce-simplifying-cross-entropy-loss-for","slug":"simce-simplifying-cross-entropy-loss-for","title":"SimCE: Simplifying Cross-Entropy Loss for Collaborative Filtering","date":"2024-06-23","arxiv_id":"2406.16170","repositories_listed":1,"syntology":null},{"url":"/paper/larp-language-audio-relational-pre-training","slug":"larp-language-audio-relational-pre-training","title":"LARP: Language Audio Relational Pre-training for Cold-Start Playlist Continuation","date":"2024-06-20","arxiv_id":"2406.14333","repositories_listed":1,"syntology":null},{"url":"/paper/unifying-graph-convolution-and-contrastive","slug":"unifying-graph-convolution-and-contrastive","title":"Unifying Graph Convolution and Contrastive Learning in Collaborative Filtering","date":"2024-06-20","arxiv_id":"2406.13996","repositories_listed":1,"syntology":null},{"url":"/paper/an-interpretable-alternative-to-neural","slug":"an-interpretable-alternative-to-neural","title":"An Interpretable Alternative to Neural Representation Learning for Rating Prediction -- Transparent Latent Class Modeling of User Reviews","date":"2024-06-17","arxiv_id":"2407.00063","repositories_listed":1,"syntology":null},{"url":"/paper/how-powerful-is-graph-filtering-for","slug":"how-powerful-is-graph-filtering-for","title":"How Powerful is Graph Filtering for Recommendation","date":"2024-06-13","arxiv_id":"2406.08827","repositories_listed":1,"syntology":null},{"url":"/paper/xrec-large-language-models-for-explainable","slug":"xrec-large-language-models-for-explainable","title":"XRec: Large Language Models for Explainable Recommendation","date":"2024-06-04","arxiv_id":"2406.02377","repositories_listed":1,"syntology":null},{"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/popularity-aware-alignment-and-contrast-for","slug":"popularity-aware-alignment-and-contrast-for","title":"Popularity-Aware Alignment and Contrast for Mitigating Popularity Bias","date":"2024-05-31","arxiv_id":"2405.20718","repositories_listed":1,"syntology":null},{"url":"/paper/lusifer-llm-based-user-simulated-feedback","slug":"lusifer-llm-based-user-simulated-feedback","title":"Lusifer: LLM-based User SImulated Feedback Environment for online Recommender systems","date":"2024-05-22","arxiv_id":"2405.13362","repositories_listed":1,"syntology":null},{"url":"/paper/cela-cost-efficient-language-model-alignment","slug":"cela-cost-efficient-language-model-alignment","title":"CELA: Cost-Efficient Language Model Alignment for CTR Prediction","date":"2024-05-17","arxiv_id":"2405.10596","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-individuality-and-collectivity","slug":"exploring-the-individuality-and-collectivity","title":"Exploring the Individuality and Collectivity of Intents behind Interactions for Graph Collaborative Filtering","date":"2024-05-15","arxiv_id":"2405.09042","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-adaptation-from-large-language","slug":"knowledge-adaptation-from-large-language","title":"LEARN: Knowledge Adaptation from Large Language Model to Recommendation for Practical Industrial Application","date":"2024-05-07","arxiv_id":"2405.03988","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/knowledge-adaptation-from-large-language#ran","syntology_url":"https://syntology.ai/paper/2405.03988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03988"}},"official":{"repos":["adxcreative/LEARN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-margin-loss-proposal-and-application-in","slug":"multi-margin-loss-proposal-and-application-in","title":"Multi-Margin Cosine Loss: Proposal and Application in Recommender Systems","date":"2024-05-07","arxiv_id":"2405.04614","repositories_listed":1,"syntology":null},{"url":"/paper/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/countering-mainstream-bias-via-end-to-end","slug":"countering-mainstream-bias-via-end-to-end","title":"Countering Mainstream Bias via End-to-End Adaptive Local Learning","date":"2024-04-13","arxiv_id":"2404.08887","repositories_listed":1,"syntology":null},{"url":"/paper/a-review-of-modern-recommender-systems-using","slug":"a-review-of-modern-recommender-systems-using","title":"A Review of Modern Recommender Systems Using Generative Models (Gen-RecSys)","date":"2024-03-31","arxiv_id":"2404.00579","repositories_listed":1,"syntology":null},{"url":"/paper/kguf-simple-knowledge-aware-graph-based","slug":"kguf-simple-knowledge-aware-graph-based","title":"KGUF: Simple Knowledge-aware Graph-based Recommender with User-based Semantic Features Filtering","date":"2024-03-29","arxiv_id":"2403.20095","repositories_listed":1,"syntology":null},{"url":"/paper/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/lightweight-embeddings-for-graph","slug":"lightweight-embeddings-for-graph","title":"Lightweight Embeddings for Graph Collaborative Filtering","date":"2024-03-27","arxiv_id":"2403.18479","repositories_listed":1,"syntology":null},{"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/afdgcf-adaptive-feature-de-correlation-graph","slug":"afdgcf-adaptive-feature-de-correlation-graph","title":"AFDGCF: Adaptive Feature De-correlation Graph Collaborative Filtering for Recommendations","date":"2024-03-26","arxiv_id":"2403.17416","repositories_listed":1,"syntology":null},{"url":"/paper/all-in-one-heterogeneous-interaction-modeling","slug":"all-in-one-heterogeneous-interaction-modeling","title":"All-in-One: Heterogeneous Interaction Modeling for Cold-Start Rating Prediction","date":"2024-03-26","arxiv_id":"2403.17740","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-aware-dual-side-attribute-enhanced","slug":"knowledge-aware-dual-side-attribute-enhanced","title":"Knowledge-aware Dual-side Attribute-enhanced Recommendation","date":"2024-03-24","arxiv_id":"2403.16037","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-enhanced-recommendation-with-user","slug":"knowledge-enhanced-recommendation-with-user","title":"Knowledge-Enhanced Recommendation with User-Centric Subgraph Network","date":"2024-03-21","arxiv_id":"2403.14377","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-matrix-factorization-by-dynamic","slug":"accelerating-matrix-factorization-by-dynamic","title":"Accelerating Matrix Factorization by Dynamic Pruning for Fast Recommendation","date":"2024-03-18","arxiv_id":"2404.04265","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-completion-with-convex-optimization","slug":"matrix-completion-with-convex-optimization","title":"Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image Inpainting","date":"2024-03-04","arxiv_id":"2403.01919","repositories_listed":1,"syntology":null},{"url":"/paper/deep-rating-elicitation-for-new-users-in","slug":"deep-rating-elicitation-for-new-users-in","title":"Deep Rating Elicitation for New Users in Collaborative Filtering","date":"2024-02-26","arxiv_id":"2402.16327","repositories_listed":1,"syntology":null},{"url":"/paper/disentangled-graph-variational-auto-encoder","slug":"disentangled-graph-variational-auto-encoder","title":"Disentangled Graph Variational Auto-Encoder for Multimodal Recommendation with Interpretability","date":"2024-02-25","arxiv_id":"2402.16110","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-and-provably-fair-exposure-control","slug":"scalable-and-provably-fair-exposure-control","title":"Scalable and Provably Fair Exposure Control for Large-Scale Recommender Systems","date":"2024-02-22","arxiv_id":"2402.14369","repositories_listed":1,"syntology":null},{"url":"/paper/general-debiasing-for-graph-based","slug":"general-debiasing-for-graph-based","title":"General Debiasing for Graph-based Collaborative Filtering via Adversarial Graph Dropout","date":"2024-02-21","arxiv_id":"2402.13769","repositories_listed":1,"syntology":null},{"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/from-variability-to-stability-advancing","slug":"from-variability-to-stability-advancing","title":"From Variability to Stability: Advancing RecSys Benchmarking Practices","date":"2024-02-15","arxiv_id":"2402.09766","repositories_listed":1,"syntology":null},{"url":"/paper/multi-behavior-collaborative-filtering-with","slug":"multi-behavior-collaborative-filtering-with","title":"Multi-Behavior Collaborative Filtering with Partial Order Graph Convolutional Networks","date":"2024-02-12","arxiv_id":"2402.07659","repositories_listed":1,"syntology":null},{"url":"/paper/prototypical-contrastive-learning-through","slug":"prototypical-contrastive-learning-through","title":"Prototypical Contrastive Learning through Alignment and Uniformity for Recommendation","date":"2024-02-03","arxiv_id":"2402.02079","repositories_listed":1,"syntology":null},{"url":"/paper/a-personalized-framework-for-consumer-and","slug":"a-personalized-framework-for-consumer-and","title":"A Personalized Framework for Consumer and Producer Group Fairness Optimization in Recommender Systems","date":"2024-02-01","arxiv_id":"2402.00485","repositories_listed":1,"syntology":null},{"url":"/paper/cf4j-collaborative-filtering-for-java","slug":"cf4j-collaborative-filtering-for-java","title":"CF4J: Collaborative Filtering for Java","date":"2024-02-01","arxiv_id":"2402.01008","repositories_listed":1,"syntology":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/understanding-biases-in-chatgpt-based","slug":"understanding-biases-in-chatgpt-based","title":"Understanding Biases in ChatGPT-based Recommender Systems: Provider Fairness, Temporal Stability, and Recency","date":"2024-01-19","arxiv_id":"2401.10545","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-hardness-negative-sampling-for","slug":"adaptive-hardness-negative-sampling-for","title":"Adaptive Hardness Negative Sampling for Collaborative Filtering","date":"2024-01-10","arxiv_id":"2401.05191","repositories_listed":1,"syntology":null},{"url":"/paper/dualvae-dual-disentangled-variational","slug":"dualvae-dual-disentangled-variational","title":"DualVAE: Dual Disentangled Variational AutoEncoder for Recommendation","date":"2024-01-10","arxiv_id":"2401.04914","repositories_listed":1,"syntology":null},{"url":"/paper/the-impact-of-differential-privacy-on","slug":"the-impact-of-differential-privacy-on","title":"The Impact of Differential Privacy on Recommendation Accuracy and Popularity Bias","date":"2024-01-08","arxiv_id":"2401.03883","repositories_listed":1,"syntology":null},{"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/temporally-and-distributionally-robust","slug":"temporally-and-distributionally-robust","title":"Temporally and Distributionally Robust Optimization for Cold-Start Recommendation","date":"2023-12-15","arxiv_id":"2312.09901","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-collaborative-filtering-for-matrix","slug":"dynamic-collaborative-filtering-for-matrix","title":"Dynamic Collaborative Filtering for Matrix- and Tensor-based Recommender Systems","date":"2023-12-04","arxiv_id":"2312.10064","repositories_listed":1,"syntology":null},{"url":"/paper/collaborative-word-based-pre-trained-item","slug":"collaborative-word-based-pre-trained-item","title":"Collaborative Word-based Pre-trained Item Representation for Transferable Recommendation","date":"2023-11-17","arxiv_id":"2311.10501","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-plugins-enhancing-large-language","slug":"knowledge-plugins-enhancing-large-language","title":"Knowledge Plugins: Enhancing Large Language Models for Domain-Specific Recommendations","date":"2023-11-16","arxiv_id":"2311.10779","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-federated-collaborative","slug":"heterogeneous-federated-collaborative","title":"Heterogeneous federated collaborative filtering using FAIR: Federated Averaging in Random Subspaces","date":"2023-11-03","arxiv_id":"2311.01722","repositories_listed":1,"syntology":null},{"url":"/paper/lfg-a-generative-network-for-real-time","slug":"lfg-a-generative-network-for-real-time","title":"LFG: A Generative Network for Real-Time Recommendation","date":"2023-10-31","arxiv_id":"2310.20189","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-in-recommender-systems-a-survey","slug":"embedding-in-recommender-systems-a-survey","title":"Embedding in Recommender Systems: A Survey","date":"2023-10-28","arxiv_id":"2310.18608","repositories_listed":1,"syntology":null},{"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/topology-aware-debiased-self-supervised-graph","slug":"topology-aware-debiased-self-supervised-graph","title":"Topology-aware Debiased Self-supervised Graph Learning for Recommendation","date":"2023-10-24","arxiv_id":"2310.15858","repositories_listed":1,"syntology":null},{"url":"/paper/item-graph2vec-a-efficient-and-effective","slug":"item-graph2vec-a-efficient-and-effective","title":"Item-Graph2vec: a Efficient and Effective Approach using Item Co-occurrence Graph Embedding for Collaborative Filtering","date":"2023-10-22","arxiv_id":"2310.14215","repositories_listed":1,"syntology":null},{"url":"/paper/batch-mix-negative-sampling-for-learning","slug":"batch-mix-negative-sampling-for-learning","title":"Batch-Mix Negative Sampling for Learning Recommendation Retrievers","date":"2023-10-21","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"9181b919077e22a897eca130ef6c518558a2a4d76fa4f9e3ed7e51084d853157","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}