{"list":"other","total":51,"rows":[{"id":"1809.09600","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","created":"2018-09-25","cited_by_count":3754},{"id":"1611.09268","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","created":"2016-11-28","cited_by_count":1605},{"id":"2309.08600","title":"Sparse Autoencoders Find Highly Interpretable Features in Language Models","created":"2023-09-15","cited_by_count":1420},{"id":"1803.05355","title":"FEVER: a large-scale dataset for Fact Extraction and VERification","created":"2018-03-14","cited_by_count":1375},{"id":"2506.05176","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","created":"2025-06-05","cited_by_count":1261},{"id":"2104.08663","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","created":"2021-04-17","cited_by_count":1252},{"id":"2004.12832","title":"ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT","created":"2020-04-27","cited_by_count":1178},{"id":"2308.03281","title":"Towards General Text Embeddings with Multi-stage Contrastive Learning","created":"2023-08-07","cited_by_count":723},{"id":"2210.07316","title":"MTEB: Massive Text Embedding Benchmark","created":"2022-10-13","cited_by_count":640},{"id":"2004.14974","title":"Fact or Fiction: Verifying Scientific Claims","created":"2020-04-30","cited_by_count":554},{"id":"2406.04093","title":"Scaling and evaluating sparse autoencoders","created":"2024-06-06","cited_by_count":553},{"id":"2112.01488","title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction","created":"2021-12-02","cited_by_count":476},{"id":"2004.07180","title":"SPECTER: Document-level Representation Learning using Citation-informed Transformers","created":"2020-04-15","cited_by_count":430},{"id":"2401.08281","title":"The Faiss library","created":"2024-01-16","cited_by_count":376},{"id":"2401.00368","title":"Improving Text Embeddings with Large Language Models","created":"2023-12-31","cited_by_count":303},{"id":"2407.14435","title":"Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoders","created":"2024-07-19","cited_by_count":300},{"id":"2107.05720","title":"SPLADE: Sparse Lexical and Expansion Model for First Stage Ranking","created":"2021-07-12","cited_by_count":286},{"id":"2205.13147","title":"Matryoshka Representation Learning","created":"2022-05-26","cited_by_count":282},{"id":"2012.00614","title":"CLIMATE-FEVER: A Dataset for Verification of Real-World Climate Claims","created":"2020-12-01","cited_by_count":196},{"id":"2404.16014","title":"Improving Dictionary Learning with Gated Sparse Autoencoders","created":"2024-04-24","cited_by_count":179},{"id":"2409.10173","title":"jina-embeddings-v3: Multilingual Embeddings With Task LoRA","created":"2024-09-16","cited_by_count":141},{"id":"2412.06410","title":"BatchTopK Sparse Autoencoders","created":"2024-12-09","cited_by_count":130},{"id":"2109.10086","title":"SPLADE v2: Sparse Lexical and Expansion Model for Information Retrieval","created":"2021-09-21","cited_by_count":127},{"id":"2104.07186","title":"COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List","created":"2021-04-15","cited_by_count":113},{"id":"2508.21038","title":"On the Theoretical Limitations of Embedding-Based Retrieval","created":"2025-08-28","cited_by_count":104},{"id":"2205.09707","title":"PLAID: An Efficient Engine for Late Interaction Retrieval","created":"2022-05-19","cited_by_count":101},{"id":"2511.07025","title":"Llama-Embed-Nemotron-8B: A Universal Text Embedding Model for Multilingual and Cross-Lingual Tasks","created":"2025-11-10","cited_by_count":51},{"id":"2506.20923","title":"KaLM-Embedding-V2: Superior Training Techniques and Data Inspire A Versatile Embedding Model","created":"2025-06-26","cited_by_count":36},{"id":"2405.19504","title":"MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings","created":"2024-05-29","cited_by_count":32},{"id":"2410.19730","title":"Counting Ability of Large Language Models and Impact of Tokenization","created":"2024-10-25","cited_by_count":32},{"id":"2304.01982","title":"Rethinking the Role of Token Retrieval in Multi-Vector Retrieval","created":"2023-04-04","cited_by_count":31},{"id":"2403.07241","title":"Calibrating Multi-modal Representations: A Pursuit of Group Robustness without Annotations","created":"2024-03-12","cited_by_count":30},{"id":"2402.09642","title":"Answer is All You Need: Instruction-following Text Embedding via Answering the Question","created":"2024-02-15","cited_by_count":27},{"id":"2503.01776","title":"Beyond Matryoshka: Revisiting Sparse Coding for Adaptive Representation","created":"2025-03-03","cited_by_count":26},{"id":"2412.03223","title":"Linq-Embed-Mistral Technical Report","created":"2024-12-04","cited_by_count":20},{"id":"2501.00961","title":"Uncovering Memorization Effect in the Presence of Spurious Correlations","created":"2025-01-01","cited_by_count":20},{"id":"2403.12459","title":"Non-negative Contrastive Learning","created":"2024-03-19","cited_by_count":19},{"id":"2501.17788","title":"WARP: An Efficient Engine for Multi-Vector Retrieval","created":"2025-01-29","cited_by_count":17},{"id":"2308.09419","title":"Attention Calibration for Transformer-based Sequential Recommendation","created":"2023-08-18","cited_by_count":15},{"id":"2211.12148","title":"Aligning Source Visual and Target Language Domains for Unpaired Video Captioning","created":"2022-11-22","cited_by_count":14},{"id":"2306.14462","title":"Multi-task Item-attribute Graph Pre-training for Strict Cold-start Item Recommendation","created":"2023-06-26","cited_by_count":13},{"id":"2211.01267","title":"Multi-Vector Retrieval as Sparse Alignment","created":"2022-11-02","cited_by_count":12},{"id":"2210.15748","title":"DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queries","created":"2022-10-27","cited_by_count":10},{"id":"2505.11471","title":"CRISP: Clustering Multi-Vector Representations for Denoising and Pruning","created":"2025-05-16","cited_by_count":8},{"id":"2406.17968","title":"Efficient Document Ranking with Learnable Late Interactions","created":"2024-06-25","cited_by_count":6},{"id":"2602.05735","title":"CSRv2: Unlocking Ultra-Sparse Embeddings","created":"2026-02-05","cited_by_count":6},{"id":"2410.20163","title":"UniHGKR: Unified Instruction-aware Heterogeneous Knowledge Retrievers","created":"2024-10-26","cited_by_count":5},{"id":"2605.03314","title":"When to Think, When to Speak: Learning Disclosure Policies for LLM Reasoning","created":"2026-05-05","cited_by_count":5},{"id":"2510.08203","title":"Memory Retrieval and Consolidation in Large Language Models through Function Tokens","created":"2025-10-09","cited_by_count":4},{"id":"2603.22300","title":"Scaling Attention via Feature Sparsity","created":"2026-03-17","cited_by_count":2},{"id":"2404.02805","title":"Efficient Multi-Vector Dense Retrieval Using Bit Vectors","created":"2024-04-03","cited_by_count":1}],"next_cursor":null}