{"total":32,"rows":[{"id":"2109.12613","title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","created":"2021-09-26","cited_by_count":65,"area":null},{"id":"2105.06339","title":"Graph Learning based Recommender Systems: A Review","created":"2021-05-13","cited_by_count":59,"area":null},{"id":"2108.07567","title":"How Powerful is Graph Convolution for Recommendation?","created":"2021-08-17","cited_by_count":50,"area":null},{"id":"2102.09267","title":"Sparse-Interest Network for Sequential Recommendation","created":"2021-02-18","cited_by_count":38,"area":null},{"id":"2404.12008","title":"How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspective","created":"2024-04-18","cited_by_count":21,"area":null},{"id":"2302.04775","title":"Adap-$\\tau$: Adaptively Modulating Embedding Magnitude for Recommendation","created":"2023-02-09","cited_by_count":19,"area":null},{"id":"2108.06889","title":"Causal Incremental Graph Convolution for Recommender System Retraining","created":"2021-08-16","cited_by_count":14,"area":null},{"id":"2210.08189","title":"Parameter-free Dynamic Graph Embedding for Link Prediction","created":"2022-10-15","cited_by_count":12,"area":null},{"id":"2105.11625","title":"Boosting-GNN: Boosting Algorithm for Graph Networks on Imbalanced Node Classification","created":"2021-05-25","cited_by_count":10,"area":null},{"id":"2411.00163","title":"PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation","created":"2024-10-31","cited_by_count":9,"area":null},{"id":"2304.07014","title":"AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothing","created":"2023-04-14","cited_by_count":7,"area":null},{"id":"2403.11408","title":"Layer-diverse Negative Sampling for Graph Neural Networks","created":"2024-03-18","cited_by_count":7,"area":null},{"id":"2504.17304","title":"You Are What You Bought: Generating Customer Personas for E-commerce Applications","created":"2025-04-24","cited_by_count":7,"area":null},{"id":"2208.06794","title":"DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction","created":"2022-08-14","cited_by_count":5,"area":null},{"id":"2312.12882","title":"BSL: Understanding and Improving Softmax Loss for Recommendation","created":"2023-12-20","cited_by_count":5,"area":null},{"id":"2301.03780","title":"Time-aware Hyperbolic Graph Attention Network for Session-based Recommendation","created":"2023-01-10","cited_by_count":3,"area":null},{"id":"2308.00404","title":"Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis","created":"2023-08-01","cited_by_count":3,"area":null},{"id":"2402.08426","title":"Frequency-aware Graph Signal Processing for Collaborative Filtering","created":"2024-02-13","cited_by_count":3,"area":null},{"id":"2412.07188","title":"Graph Neural Networks Are More Than Filters: Revisiting and Benchmarking from A Spectral Perspective","created":"2024-12-10","cited_by_count":3,"area":null},{"id":"2408.01701","title":"Signal-SGN: A Spiking Graph Convolutional Network for Skeletal Action Recognition via Learning Temporal-Frequency Dynamics","created":"2024-08-03","cited_by_count":2,"area":null},{"id":"2503.04406","title":"Training-free Adjustable Polynomial Graph Filtering for Ultra-fast Multimodal Recommendation","created":"2025-03-06","cited_by_count":2,"area":null},{"id":"2506.15120","title":"Advancing Loss Functions in Recommender Systems: A Comparative Study with a R\\'enyi Divergence-Based Solution","created":"2025-06-18","cited_by_count":2,"area":null},{"id":"2209.15454","title":"GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials","created":"2022-09-30","cited_by_count":1,"area":null},{"id":"2402.09600","title":"Graph Contrastive Learning with Low-Rank Regularization and Low-Rank Attention for Noisy Node Classification","created":"2024-02-14","cited_by_count":1,"area":null},{"id":"2601.19276","title":"Talos: Optimizing Top-$K$ Accuracy in Recommender Systems","created":"2026-01-27","cited_by_count":1,"area":null},{"id":"2201.03696","title":"Stratified Graph Spectra","created":"2022-01-10","cited_by_count":0,"area":null},{"id":"2201.11511","title":"Density-Aware Hyper-Graph Neural Networks for Graph-based Semi-supervised Node Classification","created":"2022-01-27","cited_by_count":0,"area":null},{"id":"2306.04214","title":"DualHGNN: A Dual Hypergraph Neural Network for Semi-Supervised Node Classification based on Multi-View Learning and Density Awareness","created":"2023-06-07","cited_by_count":0,"area":null},{"id":"2406.11576","title":"Harmonizing Feature Maps: A Graph Convolutional Approach for Enhancing Adversarial Robustness","created":"2024-06-17","cited_by_count":0,"area":null},{"id":"2409.14198","title":"A Sinkhorn Regularized Adversarial Network for Image Guided DEM Super-resolution using Frequency Selective Hybrid Graph Transformer","created":"2024-09-21","cited_by_count":0,"area":null},{"id":"2601.04291","title":"Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendation","created":"2026-01-07","cited_by_count":0,"area":null},{"id":"2603.20338","title":"Low-pass Personalized Subgraph Federated Recommendation","created":"2026-03-20","cited_by_count":0,"area":null}],"next_cursor":null}