{"total":104,"rows":[{"id":"2509.18095","title":"MetaEmbed: Scaling Multimodal Retrieval at Test-Time with Flexible Late Interaction","created":"2025-09-22","cited_by_count":39,"area":null},{"id":"2510.07784","title":"PLUM: Adapting Pre-trained Language Models for Industrial-scale Generative Recommendations","created":"2025-10-09","cited_by_count":30,"area":null},{"id":"2510.09782","title":"The Geometry of Reasoning: Flowing Logics in Representation Space","created":"2025-10-10","cited_by_count":21,"area":"lr"},{"id":"2604.21748","title":"StructMem: Structured Memory for Long-Horizon Behavior in LLMs","created":"2026-04-23","cited_by_count":18,"area":"lr"},{"id":"2603.01097","title":"Understanding LoRA as Knowledge Memory: An Empirical Analysis","created":"2026-03-01","cited_by_count":12,"area":null},{"id":"2510.00671","title":"Milco: Learned Sparse Retrieval Across Languages via a Multilingual Connector","created":"2025-10-01","cited_by_count":9,"area":null},{"id":"2510.14278","title":"PRISM: Agentic Retrieval with LLMs for Multi-Hop Question Answering","created":"2025-10-16","cited_by_count":8,"area":"agents"},{"id":"2510.26012","title":"AutoSurvey2: Empowering Researchers with Next Level Automated Literature Surveys","created":"2025-10-29","cited_by_count":8,"area":null},{"id":"2602.08382","title":"Dynamic Long Context Reasoning over Compressed Memory via End-to-End Reinforcement Learning","created":"2026-02-09","cited_by_count":8,"area":"lr"},{"id":"2602.21456","title":"Revisiting Text Ranking in Deep Research","created":"2026-02-25","cited_by_count":7,"area":null},{"id":"2509.25522","title":"Understanding Generative Recommendation with Semantic IDs from a Model-scaling View","created":"2025-09-29","cited_by_count":6,"area":null},{"id":"2510.23807","title":"Beyond the Failures: Rethinking Foundation Models in Pathology","created":"2025-10-27","cited_by_count":6,"area":null},{"id":"2602.12192","title":"Query-focused and Memory-aware Reranker for Long Context Processing","created":"2026-02-12","cited_by_count":6,"area":null},{"id":"2602.22647","title":"Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators","created":"2026-02-26","cited_by_count":6,"area":null},{"id":"2509.18552","title":"Global Minimizers of Sigmoid Contrastive Loss","created":"2025-09-23","cited_by_count":5,"area":null},{"id":"2510.10009","title":"Beyond the limitation of a single query: Train your LLM for query expansion with Reinforcement Learning","created":"2025-10-11","cited_by_count":5,"area":null},{"id":"2511.02770","title":"Beyond Single Embeddings: Capturing Diverse Targets with Multi-Query Retrieval","created":"2025-11-04","cited_by_count":5,"area":null},{"id":"2511.22150","title":"From Topology to Retrieval: Decoding Embedding Spaces with Unified Signatures","created":"2025-11-27","cited_by_count":5,"area":null},{"id":"2602.16201","title":"Long-Tail Knowledge in Large Language Models: Taxonomy, Mechanisms, Interventions and Implications","created":"2026-02-18","cited_by_count":5,"area":null},{"id":"2602.23320","title":"ParamMem: Augmenting Language Agents with Parametric Reflective Memory","created":"2026-02-26","cited_by_count":5,"area":null},{"id":"2510.13217","title":"LLM-guided Hierarchical Search for End-to-end Reasoning Intensive Retrieval","created":"2025-10-15","cited_by_count":4,"area":"lr"},{"id":"2601.20131","title":"Taxonomy of the Retrieval System Framework: Pitfalls and Paradigms","created":"2026-01-27","cited_by_count":4,"area":null},{"id":"2606.11780","title":"What Limits Does Quantization Place on Dense Top-$k$ Retrieval? A Theoretical Study","created":"2026-06-10","cited_by_count":4,"area":null},{"id":"2606.30877","title":"A Systematic Approach to Multi-Agent AI from Advanced Regulatory Control Theory: Safe and Auditable LLM Operator Agents for Process Control","created":"2026-06-29","cited_by_count":4,"area":"agents"},{"id":"2511.08505","title":"Structured RAG for Answering Aggregative Questions","created":"2025-11-11","cited_by_count":3,"area":"rag"},{"id":"2601.07782","title":"Beyond Single-Shot: Multi-step Tool Retrieval via Query Planning","created":"2026-01-12","cited_by_count":3,"area":"agents"},{"id":"2603.02098","title":"Efficient and High-Fidelity Omni Modality Retrieval","created":"2026-03-02","cited_by_count":3,"area":null},{"id":"2605.23556","title":"Is Dimensionality a Barrier for Retrieval Models?","created":"2026-05-22","cited_by_count":3,"area":null},{"id":"2606.30911","title":"Why Solve It Twice? Hierarchical Accumulation of Skills for Transfer-Efficient ML Engineering","created":"2026-06-29","cited_by_count":3,"area":null},{"id":"2608.21494","title":"Retrieval Needs Multivectors: An Exponential Separation","created":"2026-08-21","cited_by_count":3,"area":null},{"id":"2510.04392","title":"Improving Consistency in Retrieval-Augmented Systems with Group Similarity Rewards","created":"2025-10-05","cited_by_count":2,"area":"rag"},{"id":"2510.09885","title":"Diffusion-Inspired Masked Fine-Tuning for Knowledge Injection in Autoregressive LLMs","created":"2025-10-10","cited_by_count":2,"area":null},{"id":"2604.14488","title":"Controlling Authority Retrieval: A Missing Retrieval Objective for Authority-Governed Knowledge","created":"2026-04-15","cited_by_count":2,"area":null},{"id":"2605.06647","title":"Superintelligent Retrieval Agent: The Next Frontier of Agentic Retrieval","created":"2026-05-07","cited_by_count":2,"area":"rag"},{"id":"2605.10616","title":"MulTaBench: Benchmarking Multimodal Tabular Learning with Text and Image","created":"2026-05-11","cited_by_count":2,"area":null},{"id":"2606.21649","title":"EvoEmbedding: Evolvable Representations for Long-Context Retrieval and Agentic Memory","created":"2026-06-19","cited_by_count":2,"area":"agents"},{"id":"2607.01538","title":"Can Language Models Actually Retrieve In-Context? Drowning in Documents at Million Token Scale","created":"2026-07-01","cited_by_count":2,"area":null},{"id":"2609.22486","title":"Semantics Delivery Network: Rethinking Web Retrieval Infrastructure for LLM Agents","created":"2026-09-18","cited_by_count":2,"area":"lr"},{"id":"2510.11507","title":"Automatic Music Sample Identification with Multi-Track Contrastive Learning","created":"2025-10-13","cited_by_count":1,"area":null},{"id":"2510.15620","title":"On-device Semantic Selection Made Low Latency and Memory Efficient with Monolithic Forwarding","created":"2025-10-17","cited_by_count":1,"area":"rag"},{"id":"2510.24652","title":"Optimizing Retrieval for RAG via Reinforcement Learning","created":"2025-10-28","cited_by_count":1,"area":"lr"},{"id":"2511.00444","title":"LIR: The First Workshop on Late Interaction and Multi Vector Retrieval @ ECIR 2026","created":"2025-11-01","cited_by_count":1,"area":null},{"id":"2601.10215","title":"Topo-RAG: Topology-aware retrieval for hybrid text-table documents","created":"2026-01-15","cited_by_count":1,"area":null},{"id":"2601.18747","title":"The $\\mathbf{P}$-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs","created":"2026-01-26","cited_by_count":1,"area":"lr"},{"id":"2601.21525","title":"LMK > CLS: Landmark Pooling for Dense Embeddings","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2602.08896","title":"OmniReview: A Large-scale Benchmark and LLM-enhanced Framework for Realistic Reviewer Recommendation","created":"2026-02-09","cited_by_count":1,"area":null},{"id":"2602.09616","title":"With Argus Eyes: Assessing Retrieval Gaps via Uncertainty Scoring to Detect and Remedy Retrieval Blind Spots","created":"2026-02-10","cited_by_count":1,"area":"rag"},{"id":"2602.13466","title":"Language Model Memory and Memory Models for Language","created":"2026-02-13","cited_by_count":1,"area":null},{"id":"2602.16192","title":"Revolutionizing Long-Term Memory in AI: New Horizons with High-Capacity and High-Speed Storage","created":"2026-02-18","cited_by_count":1,"area":null},{"id":"2603.07146","title":"Fine-Grained Table Retrieval Through the Lens of Complex Queries","created":"2026-03-07","cited_by_count":1,"area":null},{"id":"2604.10604","title":"NSFL: A Post-Training Neuro-Symbolic Fuzzy Logic Framework for Boolean Operators in Neural Embeddings","created":"2026-04-12","cited_by_count":1,"area":null},{"id":"2604.15827","title":"UsefulBench: Towards Decision-Useful Information as a Target for Information Retrieval","created":"2026-04-17","cited_by_count":1,"area":null},{"id":"2605.03346","title":"Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch","created":"2026-05-05","cited_by_count":1,"area":null},{"id":"2605.24938","title":"Your Embedding Model is SMARTer Than You Think","created":"2026-05-24","cited_by_count":1,"area":null},{"id":"2605.29168","title":"Better Later Than Sooner: Neuro-Symbolic Knowledge Graph Construction via Ontology-grounded Post-extraction Correction","created":"2026-05-27","cited_by_count":1,"area":"lr"},{"id":"2605.30120","title":"No More K-means: Single-Stage Sparse Coding for Efficient Multi-Vector Retrieval","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","cited_by_count":1,"area":null},{"id":"2606.17910","title":"Non-negative Elastic Net Decoding for Information Retrieval","created":"2026-06-16","cited_by_count":1,"area":null},{"id":"2606.25147","title":"TokenMinds: Pretrained User Tokens and Embeddings for User Understanding in Large Recommender Systems","created":"2026-06-23","cited_by_count":1,"area":null},{"id":"2609.07561","title":"EigenLI: Spectral Approximations to Late Interaction","created":"2026-09-07","cited_by_count":1,"area":null},{"id":"2510.01469","title":"A-VERT: Agnostic Verification with Embedding Ranking Targets","created":"2025-10-01","cited_by_count":0,"area":null},{"id":"2510.10123","title":"The Hybrid Multimodal Graph Index (HMGI): A Comprehensive Framework for Integrated Relational and Vector Search","created":"2025-10-11","cited_by_count":0,"area":null},{"id":"2510.14626","title":"GemiRec: Interest Quantization and Generation for Multi-Interest Recommendation","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2510.16609","title":"Prior Knowledge Makes It Possible: From Sublinear Graph Algorithms to LLM Test-Time Methods","created":"2025-10-18","cited_by_count":0,"area":"rag"},{"id":"2510.18691","title":"Investigating LLM Capabilities on Long Context Comprehension for Medical Question Answering","created":"2025-10-21","cited_by_count":0,"area":null},{"id":"2510.21729","title":"CustomIR: Unsupervised Fine-Tuning of Dense Embeddings for Known Document Corpora","created":"2025-09-30","cited_by_count":0,"area":"rag"},{"id":"2511.00855","title":"All-in-one Graph-based Indexing for Hybrid Search on GPUs","created":"2025-11-02","cited_by_count":0,"area":"rag"},{"id":"2511.17680","title":"Research and Prototyping Study of an LLM-Based Chatbot for Electromagnetic Simulations","created":"2025-11-21","cited_by_count":0,"area":null},{"id":"2511.19325","title":"Generative Query Expansion with Multilingual LLMs for Cross-Lingual Information Retrieval","created":"2025-11-24","cited_by_count":0,"area":null},{"id":"2601.14478","title":"Large Language Models for Large-Scale, Rigorous Qualitative Analysis in Applied Health Services Research","created":"2026-01-20","cited_by_count":0,"area":null},{"id":"2601.20844","title":"$\\mathbb{R}^{2k}$ is Theoretically Large Enough for Embedding-based Top-$k$ Retrieval","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2602.03640","title":"Tutorial on Reasoning for IR & IR for Reasoning","created":"2026-02-03","cited_by_count":0,"area":"lr"},{"id":"2602.17639","title":"IntRec: Intent-based Retrieval with Contrastive Refinement","created":"2026-02-19","cited_by_count":0,"area":null},{"id":"2603.06660","title":"Approximate Nearest Neighbor Search for Modern AI: A Projection-Augmented Graph Approach","created":"2026-03-01","cited_by_count":0,"area":null},{"id":"2603.22340","title":"Graphs RAG at Scale: Beyond Retrieval-Augmented Generation With Labeled Property Graphs and Resource Description Framework for Complex and Unknown Search Spaces","created":"2026-03-21","cited_by_count":0,"area":"rag"},{"id":"2604.16576","title":"On the Robustness of LLM-Based Dense Retrievers: A Systematic Analysis of Generalizability and Stability","created":"2026-04-17","cited_by_count":0,"area":null},{"id":"2604.17344","title":"FLARE: Task-agnostic embedding model evaluation through a normalization process","created":"2026-04-19","cited_by_count":0,"area":null},{"id":"2604.20417","title":"Semantic Recall for Vector Search","created":"2026-04-22","cited_by_count":0,"area":null},{"id":"2605.03824","title":"Reproducing Complex Set-Compositional Information Retrieval","created":"2026-05-05","cited_by_count":0,"area":null},{"id":"2605.07158","title":"Topic Is Not Agenda: A Citation-Community Audit of Text Embeddings","created":"2026-05-08","cited_by_count":0,"area":"rag"},{"id":"2605.24764","title":"Spectral Retrieval: Multi-Scale Sinc Convolution over Token Embeddings for Localized Retrieval in LLM Multi-Agent Systems","created":"2026-05-23","cited_by_count":0,"area":null},{"id":"2605.29384","title":"Latent Terms: Dense Retrievers Contain Trivially Extractable BM25-ready Zipfian Vocabularies","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2605.30917","title":"Inference-Free Multimodal Learned Sparse Retrieval for Production-Scale Visual Document Search","created":"2026-05-29","cited_by_count":0,"area":null},{"id":"2606.18520","title":"Compact Geometric Representations of Hierarchies","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2606.28343","title":"The Crowded Embedding Space: A Mean-Field Mechanism for Emergent Marginalization in Retrieval-Augmented Agents","created":"2026-06-01","cited_by_count":0,"area":"rag"},{"id":"2606.28359","title":"The Voronoi Bottleneck: Capacity-Aware Dense Retrieval for Product Search","created":"2026-06-09","cited_by_count":0,"area":null},{"id":"2606.31156","title":"One Retrieval to Cover Them All: Co-occurrence-Aware Knowledge Base Reorganization for Session-Level RAG","created":"2026-06-30","cited_by_count":0,"area":"rag"},{"id":"2607.04391","title":"Memory-Orchestrated Semantic System (MOSS): An Auditable Agentic Memory Architecture","created":"2026-07-05","cited_by_count":0,"area":"agents"},{"id":"2607.17742","title":"Semantically Similar, Logically Distinct: Diagnosing the Semantic-Answerability Gap in Table RAG","created":"2026-07-20","cited_by_count":0,"area":"rag"},{"id":"2608.00065","title":"H+ Embedding: Harmonizing Global and Token-Level Retrieval with Context-Dependent Phrases","created":"2026-07-29","cited_by_count":0,"area":null},{"id":"2608.11427","title":"Three Tokens Force Exponential Feature Rank in Nonnegative Kernel Attention","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2608.15971","title":"The Limits of Binding in Dual Encoders","created":"2026-08-16","cited_by_count":0,"area":null},{"id":"2608.17088","title":"There is No Theoretical Curse of Multilinguality For Embedding Space Structure","created":"2026-08-17","cited_by_count":0,"area":null},{"id":"2608.29951","title":"Spatial Matryoshka Training for Multi-Granularity Visual Document Retrieval","created":"2026-08-30","cited_by_count":0,"area":null},{"id":"2609.01657","title":"NeoMME: A Single-Tower Multimodal-Native Multilingual Foundation Encoder for Efficient Fine-Tuning and Inference","created":"2026-08-31","cited_by_count":0,"area":"mllm"},{"id":"2609.20821","title":"Embedding Models Measure in Peculiar Ways","created":"2026-09-17","cited_by_count":0,"area":null},{"id":"2609.29245","title":"No More Free Lunch: Corpus Task Complexity Matters as Corpora Grow","created":"2026-09-24","cited_by_count":0,"area":null},{"id":"2609.38374","title":"Doc2LoRA Provides Decodable Representations of Scientific Ideas","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.38743","title":"Learning to Route in Visual Space via Multi-Step Embedding Retrieval","created":"2026-09-30","cited_by_count":0,"area":"agents"},{"id":"2610.02749","title":"Learning Query Encoders Can Be Hard Even When Vector Retrieval Is Geometrically Easy","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":"100"}