{"total":24,"rows":[{"id":"2406.06647","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","created":"2024-06-10","cited_by_count":43,"area":null},{"id":"2502.08767","title":"SelfElicit: Your Language Model Secretly Knows Where is the Relevant Evidence","created":"2025-02-12","cited_by_count":18,"area":null},{"id":"2505.12709","title":"Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics","created":"2025-05-19","cited_by_count":17,"area":null},{"id":"2412.21151","title":"PyG-SSL: A Graph Self-Supervised Learning Toolkit","created":"2024-12-30","cited_by_count":14,"area":null},{"id":"2412.08174","title":"Can Graph Neural Networks Learn Language with Extremely Weak Text Supervision?","created":"2024-12-11","cited_by_count":13,"area":null},{"id":"2405.16805","title":"Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization","created":"2024-05-27","cited_by_count":12,"area":null},{"id":"2505.18442","title":"Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting","created":"2025-05-24","cited_by_count":12,"area":null},{"id":"2411.01992","title":"Ask, and it shall be given: On the Turing completeness of prompting","created":"2024-11-04","cited_by_count":10,"area":null},{"id":"2502.19334","title":"Joint Optimal Transport and Embedding for Network Alignment","created":"2025-02-26","cited_by_count":10,"area":null},{"id":"2510.13855","title":"Harnessing Consistency for Robust Test-Time LLM Ensemble","created":"2025-10-12","cited_by_count":10,"area":null},{"id":"2411.09852","title":"InterFormer: Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction","created":"2024-11-15","cited_by_count":8,"area":null},{"id":"2505.17293","title":"Graph Data Selection for Domain Adaptation: A Model-Free Approach","created":"2025-05-22","cited_by_count":7,"area":null},{"id":"2603.27678","title":"Prototype-Aligned Federated Soft-Prompts for Continual Web Personalization","created":"2026-03-29","cited_by_count":5,"area":null},{"id":"2509.08829","title":"PerFairX: Is There a Balance Between Fairness and Personality in Large Language Model Recommendations?","created":"2025-08-20","cited_by_count":3,"area":null},{"id":"2505.03655","title":"Counterfactual Inference for Eliminating Sentiment Bias in Recommender Systems","created":"2025-05-06","cited_by_count":2,"area":null},{"id":"2507.03861","title":"Continual Recommender Systems","created":"2025-07-05","cited_by_count":2,"area":null},{"id":"2510.25093","title":"Continual Low-Rank Adapters for LLM-based Generative Recommender Systems","created":"2025-10-29","cited_by_count":2,"area":null},{"id":"2509.00109","title":"Bias Mitigation for AI-Feedback Loops in Recommender Systems: A Systematic Literature Review and Taxonomy","created":"2025-08-28","cited_by_count":1,"area":null},{"id":"2509.12530","title":"Graph Homophily Booster: Rethinking the Role of Discrete Features on Heterophilic Graphs","created":"2025-09-16","cited_by_count":1,"area":null},{"id":"2602.07256","title":"Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learning","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2603.10160","title":"ReMix: Reinforcement routing for mixtures of LoRAs in LLM finetuning","created":"2026-03-10","cited_by_count":1,"area":null},{"id":"2605.24395","title":"AvAtar: Learning to Align via Active Optimal Transport","created":"2026-05-23","cited_by_count":1,"area":null},{"id":"2601.20848","title":"Post-Training Fairness Control: A Single-Train Framework for Dynamic Fairness in Recommendation","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2606.20554","title":"Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation","created":"2026-06-18","cited_by_count":0,"area":null}],"next_cursor":null}