ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
Recent progress in Natural Language Understanding (NLU) is driving fast-paced advances in Information Retrieval (IR), largely owed to fine-tuning deep language models (LMs) for document ranking. While remarkably effective, the ranking models based on these LMs increase computational cost by orders of magnitude over prior approaches, particularly as they must feed each query-document pair through a massive neural network to compute a single relevance score. To tackle this, we present ColBERT, a novel ranking model that adapts deep LMs (in particular, BERT) for efficient retrieval. ColBERT introduces a late interaction architecture that independently encodes the query and the document using BERT and then employs a cheap yet powerful interaction step that models their fine-grained similarity. By delaying and yet retaining this fine-granular interaction, ColBERT can leverage the expressiveness of deep LMs while simultaneously gaining the ability to pre-compute document representations offline, considerably speeding up query processing. Crucially, ColBERT's pruning-friendly interaction mechanism enables leveraging vector-similarity indexes for end-to-end retrieval directly from millions of documents. We extensively evaluate ColBERT using two recent passage search datasets. Results show that ColBERT's effectiveness is competitive with existing BERT-based models (and outperforms every non-BERT baseline), while executing two orders-of-magnitude faster and requiring up to four orders-of-magnitude fewer FLOPs per query.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The only ML component is a CrossEncoder reranker ( mxbai-rerank-large-v1 , 435M parameters, DeBERTaV3) fused with ColBERT (Khattab & Zaharia, 2020) via Reciprocal Rank Fusion (RRF), applied after retrieval is complete to prioritize passages before token-budget truncation.”
From SmartSearch: How Ranking Beats Structure for Conversational Memory Retrieval (2026) · cites this paper as Khattab & Zaharia, 2020
In the citing paper
“While dense retrievers like Dense Passage Retrieval (DPR) [14] and late-interaction models like ColBERT [15] improve recall on single-hop queries, they often struggle with multi-hop reasoning, where the answer depends on composing information from multiple disjoint documents [20, 6].”
From Replace, Don't Expand: Mitigating Context Dilution in Multi-Hop RAG via Fixed-Budget Evidence Assembly (2025) · cites this paper as [15]
In the citing paper
“Research on retrieval optimization has explored multiple techniques, yet studies specifically focused on prefetching size in RaLM systems are still limited.”
From Exploring Optimal Prefetching Sizes in RaLMSpec to Enhance Retrieval-Augmented Generation Efficiency (2025) · cites this paper as [9]
In the citing paper
“Early RAG implementations, however, often relied on document retrieval methods that introduced noise and excessive context [26, 55, 60, 122].”
From LEGO-GraphRAG: Modularizing Graph-Based Retrieval-Augmented Generation for Design Space Exploration (2025) · cites this paper as [55]
In the citing paper
“Standard retrieval methods like RAG and MemoryBank (Zhong et al., 2024) rely fundamentally on vector similarity (Karpukhin et al., 2020; Khattab and Zaharia, 2020), representing memories as isolated points in embedding space (Hu et al., 2025). Consequently, they struggle with queries requiring causal bridging between semantically dissimilar or distant events (Yang et al., 2018; Qi et al., 2019; Tr”
From Synapse: Empowering LLM Agents with Episodic-Semantic Memory via Spreading Activation (2026) · cites this paper as Khattab and Zaharia, 2020
Citations
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404 · cited 1×
“At a high level, TK improves the KNRM architecture described earlier: while KNRM employs kernel pooling on top of word-embedding-based interaction, TK uses a Transformer [34] component for contextually encoding queries and documents before kernel pooling.”
MethodBERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173 · cited 2×
“Among them, a recent approach has emerged that ne-tunes deep pre-trained language models (LMs) like ELMo [29] and BERT [5] for estimating relevance.”
BackgroundGoogle's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation
Wu, Y., Schuster, M., Chen, Z., Le, Q. V., Norouzi, M., Macherey, W., Krikun, M., Cao, Y., Gao, Q., Macherey, K., et al. (2016) · arXiv · doi:10.48550/arxiv.1609.08144 · Cited by 5,319
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jégou, H. (2017) · arXiv · doi:10.48550/arxiv.1702.08734 · Cited by 4,140 · cited 2×
“Additionally, it enables ColBERT to leverage vector-similarity search indexes (e.g., [1, 16]) to retrieve the top-k results directly from a large document collection, substantially improving recall over models that only re-rank the output of term-based retrieval.”
MethodMS MARCO: A Human Generated MAchine Reading COmprehension Dataset
Bajaj, P., Campos, D., Craswell, N., Deng, L., Gao, J., Liu, X., Majumder, R., McNamara, A., Mitra, B., Nguyen, T., et al. (2016) · arXiv · doi:10.48550/arxiv.1611.09268 · Cited by 2,473
Robertson, S. E., Walker, S., Jones, S., Hancock‐Beaulieu, M., & Gatford, M. (1994) · Text REtrieval Conference · Cited by 2,212
Learning deep structured semantic models for web search using clickthrough data
Huang, P.-S., He, X., Gao, J., Deng, L., Acero, A., & Heck, L. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505665 · Cited by 2,009 · cited 1×
“On the le, Figure 2 (a) illustrates representation-focused rankers, which independently compute an embedding for q and another for d and estimate relevance as a single similarity score between two vectors [13, 41].”
BackgroundTinyBERT: Distilling BERT for natural language understanding
Jiao, X., Yin, Y., Shang, L., Jiang, X., Chen, X., Li, L., Wang, F., & Liu, Q. (2020) · Findings of the Association for Computational Linguistics: EMNLP 2020 · doi:10.18653/v1/2020.findings-emnlp.372 · Cited by 1,786
A Deep Relevance Matching Model for Ad-hoc Retrieval
Guo, J., Fan, Y., Ai, Q., & Croft, W. B. (2016) · Proceedings of the 25th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2983323.2983769 · Cited by 806 · cited 1×
“Over the past few years, the Information Retrieval (IR) community has witnessed the introduction of a host of neural ranking models, including DRMM [8], KNRM [5, 36], and Duet [21, 23].”
BackgroundNogueira, R., & Cho, K. (2019) · arXiv · doi:10.48550/arxiv.1901.04085 · Cited by 615 · cited 9×
“Similar to [25], we fine-tune all ColBERT models with learning rate 3 × 10 − 6 with a batch size 32.”
BackgroundMethodInfluential
Research works printed but not linked: 14
- Zhuyun Dai and Jamie Callan . 2019 a. Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrieval. arXiv preprint arXiv:1910.10687 ( 2019 ). Zhuyun Dai and Jamie Callan. 2019 a. Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrieval. arXiv preprint arXiv:1910.10687 (2019). · arXiv
- Zhuyun Dai and Jamie Callan . 2019 b. Deeper Text Understanding for IR with Contextual Neural Language Modeling. arXiv preprint arXiv:1905.09217 ( 2019 ). Zhuyun Dai and Jamie Callan. 2019 b. Deeper Text Understanding for IR with Contextual Neural Language Modeling. arXiv preprint arXiv:1905.09217 (2019). · arXiv
- Jiafeng Guo , Yixing Fan , Liang Pang , Liu Yang , Qingyao Ai , Hamed Zamani , Chen Wu , W Bruce Croft , and Xueqi Cheng . 2019. A deep look into neural ranking models for information retrieval. arXiv preprint arXiv:1903.06902 ( 2019 ). Jiafeng Guo, Yixing Fan, Liang Pang, Liu Yang, Qingyao Ai, Hamed Zamani, Chen Wu, W Bruce Croft, and Xueqi Cheng. 2019. A deep look into neural ranking models for information retrieval. arXiv preprint arXiv:1903.06902 (2019). · arXiv
- Sebastian Hofst"atter and Allan Hanbury . 2019. Let's measure run time! Extending the IR replicability infrastructure to include performance aspects. arXiv preprint arXiv:1907.04614 ( 2019 ). Sebastian Hofst"atter and Allan Hanbury. 2019. Let's measure run time! Extending the IR replicability infrastructure to include performance aspects. arXiv preprint arXiv:1907.04614 (2019). · arXiv
- Sebastian Hofst"atter, Markus Zlabinger , and Allan Hanbury . 2019 b. TU Wien@ TREC Deep Learning'19--Simple Contextualization for Re-ranking. arXiv preprint arXiv:1912.01385 ( 2019 ). Sebastian Hofst"atter, Markus Zlabinger, and Allan Hanbury. 2019 b. TU Wien@ TREC Deep Learning'19--Simple Contextualization for Re-ranking. arXiv preprint arXiv:1912.01385 (2019). · arXiv
- Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). · arXiv
- Bhaskar Mitra and Nick Craswell . 2019. An Updated Duet Model for Passage Re-ranking. arXiv preprint arXiv:1903.07666 ( 2019 ). Bhaskar Mitra and Nick Craswell. 2019. An Updated Duet Model for Passage Re-ranking. arXiv preprint arXiv:1903.07666 (2019). · arXiv
- Bhaskar Mitra , Corby Rosset , David Hawking , Nick Craswell , Fernando Diaz , and Emine Yilmaz . 2019. Incorporating query term independence assumption for efficient retrieval and ranking using deep neural networks. arXiv preprint arXiv:1907.03693 ( 2019 ). Bhaskar Mitra, Corby Rosset, David Hawking, Nick Craswell, Fernando Diaz, and Emine Yilmaz. 2019. Incorporating query term independence assumption for efficient retrieval and ranking using deep neural networks. arXiv preprint arXiv:1907.03693 (2019). · arXiv
- Rodrigo Nogueira , Wei Yang , Kyunghyun Cho , and Jimmy Lin . 2019 b. Multi-Stage Document Ranking with BERT. arXiv preprint arXiv:1910.14424 ( 2019 ). Rodrigo Nogueira, Wei Yang, Kyunghyun Cho, and Jimmy Lin. 2019 b. Multi-Stage Document Ranking with BERT. arXiv preprint arXiv:1910.14424 (2019). · arXiv
- Rodrigo Nogueira , Wei Yang , Jimmy Lin , and Kyunghyun Cho . 2019 c. Document Expansion by Query Prediction. arXiv preprint arXiv:1904.08375 ( 2019 ). Rodrigo Nogueira, Wei Yang, Jimmy Lin, and Kyunghyun Cho. 2019 c. Document Expansion by Query Prediction. arXiv preprint arXiv:1904.08375 (2019). · arXiv
- Matthew E Peters , Mark Neumann , Mohit Iyyer , Matt Gardner , Christopher Clark , Kenton Lee , and Luke Zettlemoyer . 2018. Deep contextualized word representations. arXiv preprint arXiv:1802.05365 ( 2018 ). Matthew E Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer. 2018. Deep contextualized word representations. arXiv preprint arXiv:1802.05365 (2018). · arXiv
- Yifan Qiao , Chenyan Xiong , Zhenghao Liu , and Zhiyuan Liu . 2019. Understanding the Behaviors of BERT in Ranking. arXiv preprint arXiv:1904.07531 ( 2019 ). Yifan Qiao, Chenyan Xiong, Zhenghao Liu, and Zhiyuan Liu. 2019. Understanding the Behaviors of BERT in Ranking. arXiv preprint arXiv:1904.07531 (2019). · arXiv
- Colin Raffel , Noam Shazeer , Adam Roberts , Katherine Lee , Sharan Narang , Michael Matena , Yanqi Zhou , Wei Li , and Peter J Liu . 2019. Exploring the limits of transfer learning with a unified text-to-text transformer. arXiv preprint arXiv:1910.10683 ( 2019 ). Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J Liu. 2019. Exploring the limits of transfer learning with a unified text-to-text transformer. arXiv preprint arXiv:1910.10683 (2019). · arXiv
- Raphael Tang , Yao Lu , Linqing Liu , Lili Mou , Olga Vechtomova , and Jimmy Lin . 2019. Distilling task-specific knowledge from BERT into simple neural networks. arXiv preprint arXiv:1903.12136 ( 2019 ). Raphael Tang, Yao Lu, Linqing Liu, Lili Mou, Olga Vechtomova, and Jimmy Lin. 2019. Distilling task-specific knowledge from BERT into simple neural networks. arXiv preprint arXiv:1903.12136 (2019). · arXiv
Cited by
Items 101–200 of 1,023
Promptagator: Few-shot Dense Retrieval From 8 Examples
Dai, Z., Zhao, V. Y., Ma, J., Luan, Y., Ni, J., Lu, J., Bakalov, A., Guu, K., Hall, K. B., & Chang, M.-W. (2022) · arXiv · doi:10.48550/arxiv.2209.11755 · Cited by 43
OmniTab: Pretraining with Natural and Synthetic Data for Few-shot Table-based Question Answering
Jiang, Z., Mao, Y., He, P., Neubig, G., & Chen, W. (2022) · Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2022.naacl-main.68 · Cited by 36
A Unified Framework for Learned Sparse Retrieval
Nguyen, T. D.-M., MacAvaney, S., & Yates, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-28241-6_7 · Cited by 82
“, [12,13,38]) and learned sparse retrieval (e.”
MethodUnderstand What LLM Needs: Dual Preference Alignment for Retrieval-Augmented Generation
Dong, G., Zhu, Y., Zhang, C., Wang, Z., Wen, J.-R., & Dou, Z. (2025) · International World Wide Web Conference (WWW) · doi:10.1145/3696410.3714717 · Cited by 97
“A series of sentence transformer models [50, 51, 52, 53] have achieved excellent fine-grained ranking by better aligning the representations between queries and documents.”
Predicting Efficiency/Effectiveness Trade-offs for Dense vs. Sparse Retrieval Strategy Selection
Arabzadeh, N., Yan, X., & Clarke, C. L. A. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3482159 · Cited by 41
“These dense retrievers use contextualized pre-trained transformer models to map query and documents into an embedding space [4, 11, 12, 24, 26].”
MethodDealing with Typos for BERT-based Passage Retrieval and Ranking
Zhuang, S., & Zuccon, G. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.225 · Cited by 67
Salient Phrase Aware Dense Retrieval: Can a Dense Retriever Imitate a Sparse One?
Chen, X., Lakhotia, K., Oğuz, B., Gupta, A., Lewis, P., Peshterliev, S., Mehdad, Y., Gupta, S., & Yih, W.-T. (2022) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2022.findings-emnlp.19 · Cited by 66
Contrastive Learning of User Behavior Sequence for Context-Aware Document Ranking
Zhu, Y., Nie, J., Dou, Z., Ma, Z., Zhang, X., Du, P., Zuo, X., & Jiang, H. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482243 · Cited by 54
Ali, A. F., Tufail, A., Silva, L. C. D., & Abas, P. E. (2024) · Applied System Innovation · doi:10.3390/asi7050091 · Cited by 49
Karakurt, E., & Akbulut, A. (2025) · Applied Sciences · doi:10.3390/app16010368 · Cited by 62
Gospodinov, M. V., MacAvaney, S., & Macdonald, C. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-28238-6_31 · Cited by 49
PeerQA: A Scientific Question Answering Dataset from Peer Reviews
Baumgärtner, T., Briscoe, T., & Gurevych, I. (2025) · Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers) · doi:10.18653/v1/2025.naacl-long.22 · Cited by 39
Injecting the BM25 Score as Text Improves BERT-Based Re-rankers
Askari, A., Abolghasemi, A., Pasi, G., Kraaij, W., & Verberne, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-28244-7_5 · Cited by 77
UDAPDR: Unsupervised Domain Adaptation via LLM Prompting and Distillation of Rerankers
Saad-Falcon, J., Khattab, O., Santhanam, K., Florian, R., Franz, M., Roukos, S., Sil, A., Sultan, M., & Potts, C. (2023) · Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2023.emnlp-main.693 · Cited by 27
Self-citationGao, J., Gou, Y., Xu, Y., Yang, Y., Long, C., & Wong, R. C.-W. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3725413 · Cited by 101
Phrase Retrieval Learns Passage Retrieval, Too
Lee, J., Wettig, A., & Chen, D. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.297 · Cited by 58
“The performance improves with a larger number of vectors per passage, which aligns with the findings of multi-vector encoding models (Khattab and Zaharia, 2020; Luan et al., 2021).”
BackgroundInfluential(2023) · doi:10.18653/v1/2023.emnlp-main.364 · Cited by 38
On Approximate Nearest Neighbour Selection for Multi-Stage Dense Retrieval
Macdonald, C., & Tonellotto, N. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482156 · Cited by 37
“1), as exemplified by the ColBERT approach [9], and discuss how to obtain and use rankings from the first stage of this architecture (Section 2.”
BackgroundMethodInfluentialIn-Depth Analysis of Graph-Based RAG in a Unified Framework
Zhou, Y., Su, Y., Sun, Y., Wang, S. L., Wang, T., He, R., Zhang, Y., Liang, S., Liu, X., Ma, Y., et al. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3773731.3773738 · Cited by 92
Datta, S., Ganguly, D., Greene, D., & Mitra, M. (2022) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3488560.3498491 · Cited by 52
“While the benefits of using supervised approaches have predominantly been established for ranking [5, 12, 18, 26] and recommendation tasks [16, 29, 40, 44], the exploration of supervised approaches for QPP has been limited.”
Transfer Learning Approaches for Building Cross-Language Dense Retrieval Models
Nair, S., Yang, E., Lawrie, D., Duh, K., McNamee, P., Murray, K., Mayfield, J., & Oard, D. W. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-99736-6_26 · Cited by 84
Learning to retrieve passages without supervision
Ram, O., Shachaf, G., Levy, O., Berant, J., & Globerson, A. (2022) · Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2022.naacl-main.193 · Cited by 35
Pre-train a Discriminative Text Encoder for Dense Retrieval via Contrastive Span Prediction
Ma, X., Guo, J., Zhang, R., Fan, Y., & Cheng, X. (2022) · Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3477495.3531772 · Cited by 35
“Without loss of generality, dense retrieval usually utilizes a Siamese or bi-encoder architecture to encode queries and documents into low-dimensional representations to abstract their semantic information [17, 18, 20, 37, 39, 40].”
BackgroundMethodInfluentialHuang, Z., Yu, P., & Allan, J. (2023) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3539597.3570468 · Cited by 64
Alaofi, M., Thomas, P., Scholer, F., & Sanderson, M. (2024) · Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region (SIGIR-AP) · doi:10.1145/3673791.3698431 · Cited by 69
Questions Are All You Need to Train a Dense Passage Retriever
Sachan, D. S., Lewis, M., Yogatama, D., Zettlemoyer, L., Pineau, J., & Zaheer, M. (2023) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00564 · Cited by 76
“Multi-vector encoders for questions and passages are more accurate than dualencoders, (Luan et al., 2021; Khattab and Zaharia, 2020; Humeau et al., 2020), although at the cost of an increased latency and storage requirements.”
BackgroundQuery Performance Prediction for Neural IR: Are We There Yet?
Faggioli, G., Formal, T., Marchesin, S., Clinchant, S., Ferro, N., & Piwowarski, B. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-28244-7_15 · Cited by 53
Enhancing Question Answering for Enterprise Knowledge Bases using Large Language Models
Jiang, F., Qin, C., Yao, K., Fang, C., Zhuang, F., Zhu, H., & Xiong, H. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-5562-2_18 · Cited by 53
Retrieval-Augmented Generation (RAG) and LLM Integration
Tural, B., Örpek, Z., & Destan, Z. (2024) · International Symposium on Innovative Approaches in Smart Technologies (ISAS) · doi:10.1109/isas64331.2024.10845308 · Cited by 55
Wahidur, R. S. M., Kim, S., Choi, H., Bhatti, D. S., & Lee, H.-N. (2025) · IEEE Access · doi:10.1109/access.2025.3542125 · Cited by 57
Adaptive Re-Ranking with a Corpus Graph
MacAvaney, S., Tonellotto, N., & Macdonald, C. (2022) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3511808.3557231 · Cited by 76
“Among this group, Gar performs competitively, outmatched only by ColBERT-PRF [39] and the recent SPLADE [7] model (though the differences in performance are not statistically significant).”
BackgroundMethodInfluentialRocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-rankingPreprint
Ren, R., Qu, Y., Liu, J., Zhao, W. X., She, Q., Wu, H. R., Wang, H., & Wen, J.-R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.07367 · Cited by 70
“…retrievers include DPR (Karpukhin et al., 2020), DPR-E, ANCE (Xiong et al., 2020a), ME-BERT (Luan et al., 2021), NPRINC (Lu et al., 2020), ColBERT (Khattab and Zaharia, 2020) RocketQA (Qu et al., 2021), TAS-Balanced (Hof-stätter et al., 2021), ADORE+STAR (Zhan et al., 2021) and PAIR (Ren et al.,…”
BackgroundExplaining Documents' Relevance to Search QueriesPreprint
Rahimi, R., Kim, Y., Zamani, H., & Allan, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.01314 · Cited by 41
“This architecture also allows pre-computation of document representations similar to the recent Bert-based rankers [26, 38].”
MethodPradeep, R., Liu, Y., Zhang, X., Li, Y., Yates, A., & Lin, J. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-99736-6_44 · Cited by 72
“[28] train a bi-encoder by using on-the-fly knowledge distillation from a ColBERT [22] teacher model that computes soft-labels for in-batch negatives.”
MethodInternational Natural Gas Price Trends Prediction with Historical Prices and Related News
Guan, R., Wang, A., Liang, Y., Fu, J., & Han, X. (2022) · Energies · doi:10.3390/en15103573 · Cited by 32
Hofstätter, S., Khattab, O., Althammer, S., Sertkan, M., & Hanbury, A. (2022) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3511808.3557367 · Cited by 67
“Tomaximize transparency, we do not apply the query augmentation mechanism of Khattab and Zaharia [24] (see §2.”
BackgroundMethodInfluentialSelf-citationMGeo: Multi-Modal Geographic Language Model Pre-Training
Ding, R., Chen, B., Xie, P., Huang, F., Li, X., Zhang, Q., & Xu, Y. (2023) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3539618.3591728 · Cited by 39
A White Box Analysis of ColBERT
Formal, T., Piwowarski, B., & Clinchant, S. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-72240-1_23 · Cited by 34
Generative retrieval for conversational question answering
Li, Y., Yang, N., Wang, L., Wei, F., & Li, W. (2023) · Information Processing & Management · doi:10.1016/j.ipm.2023.103475 · Cited by 42
“Additionally, we applied a question rewriting module or included the conversation context to adapt ColBERT to the conversational setting.”
InfluentialLearning To Retrieve: How to Train a Dense Retrieval Model Effectively and EfficientlyPreprint
Zhan, J., Mao, J., Liu, Y., Zhang, M., & Ma, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.10469 · Cited by 51
“Khattab et al. [20] further applied their proposed ColBERT for end-to-end retrieval.”
InfluentialKnowledge assimilation: Implementing knowledge-guided agricultural large language model
Jiang, J., Yan, L., Liu, H., Xia, Z., Wang, H., Yang, Y., & Guan, Y. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.113197 · Cited by 37
Chalkidis, I., Fergadiotis, M., Manginas, N., Katakalou, E., & Malakasiotis, P. (2021) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.18653/v1/2021.eacl-main.305 · Cited by 50
Semantic matching based legal information retrieval system for COVID-19 pandemic
Zhu, J., Wu, J., Luo, X., & Liu, J. (2023) · Artificial Intelligence and Law · doi:10.1007/s10506-023-09354-x · Cited by 30
“Khattab and Zaharia (2020) proposed a ranking model called ColBERT, which uses BERT to encode queries and documents independently to accomplish end-to-end retrieval of millions of documents.”
BackgroundScaling Laws For Dense Retrieval
Fang, Y., Zhan, J., Ai, Q., Mao, J., Su, W., Chen, J., & Liu, Y. (2024) · Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3626772.3657743 · Cited by 28
Faster Learned Sparse Retrieval with Block-Max Pruning
Mallia, A., Suel, T., & Tonellotto, N. (2024) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3626772.3657906 · Cited by 28
Enhancing Energy-Awareness in Deep Learning through Fine-Grained Energy Measurement
Rajput, S., Widmayer, T., Shang, Z., Kechagia, M., Sarro, F., & Sharma, T. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3680470 · Cited by 42
More Robust Dense Retrieval with Contrastive Dual Learning
Li, Y., Liu, Z., Xiong, C., & Liu, Z. (2021) · ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR) · doi:10.1145/3471158.3472245 · Cited by 53
“While some work [17] proposes a late query–document interaction paradigm to improve the retrieval effectiveness, many others focus on learning better representations with contrastive training.”
BackgroundMethodInfluentialZhuang, S., & Zuccon, G. (2022) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3477495.3531951 · Cited by 51
ReprBERT: Distilling BERT to an Efficient Representation-Based Relevance Model for E-Commerce
Yao, S., Tan, J., Chen, X., Zhang, J., Zeng, X., & Yang, K. (2022) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3534678.3539090 · Cited by 54
“Inspired by Khattab and Zaharia [10], we propose a late interaction module in ReprBERT to introduce interaction after the embeddings of query q and product p.”
MethodKong, W., Khadanga, S., Li, C., Gupta, S. K., Zhang, M., Xu, W., & Bendersky, M. (2022) · Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3534678.3539137 · Cited by 34
Mukund, S. A., & Easwarakumar, K. S. (2025) · Symmetry · doi:10.3390/sym17050633 · Cited by 52
Cohen, D., Mitra, B., Lesota, O., Rekabsaz, N., & Eickhoff, C. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3462951 · Cited by 49
Managing ML pipelines: feature stores and the coming wave of embedding ecosystems
Orr, L., Sanyal, A., Ling, X., Goel, K., & Leszczynski, M. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3476311.3476402 · Cited by 36
“Once trained, they can provide lift in numerous downstream tasks like recommendation systems [21], information retrieval [15], and data integration [20].”
BackgroundSalemi, A., Pizzorno, J. A., & Zamani, H. (2023) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3539618.3591629 · Cited by 47
“Another approach is to distill knowledge from multi-vector dense retrieval models, such as ColBERT [24] to single-vector dense retrievers [63].”
BackgroundMethodRA-DIT: Retrieval-Augmented Dual Instruction Tuning
Lin, X. V., Chen, X., Chen, M., Shi, W., Lomeli, M., James, R., Rodriguez, P., Kahn, J., Szilvasy, G., Lewis, M., et al. (2023) · arXiv · doi:10.48550/arxiv.2310.01352 · Cited by 26
Improving Document Representations by Generating Pseudo Query Embeddings for Dense Retrieval
Tang, H., Sun, X., Jin, B., Wang, J., Zhang, F., & Wu, W. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.392 · Cited by 26
Gou, Y., Gao, J., Xu, Y., & Long, C. (2025) · Proceedings of the ACM on Management of Data · doi:10.1145/3709730 · Cited by 60
“Nearest neighbor search on high-dimensional vector data is a fundamental problem and has many real-world applications, including databases [15, 58, 63, 77], information retrieval [7, 50, 58, 69], large language models [14, 51–53] and recommendation sys-tem [70, 79, 82].”
MS MARCO Chameleons: Challenging the MS MARCO Leaderboard with Extremely Obstinate Queries
Arabzadeh, N., Mitra, B., & Bagheri, E. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482011 · Cited by 35
“TCT-ColBERT [27]9: This model builds on the TCT-ColBERT method [21] by enabling an approximate nearest neighbor search by distilling knowledge from TCT-ColBERT’s MaxSim operator.”
MethodTencent Text-Video Retrieval: Hierarchical Cross-Modal Interactions With Multi-Level Representations
Jiang, J., Min, S., Kong, W., Wang, H., Li, Z., & Liu, W. (2022) · IEEE Access · doi:10.1109/access.2022.3227973 · Cited by 63
PROD: Progressive Distillation for Dense Retrieval
Lin, Z., Gong, Y., Liu, X., Zhang, H., Lin, C., Dong, A., Jiao, J., Lu, J., Jiang, D., Majumder, R., et al. (2023) · International World Wide Web Conference (WWW) · doi:10.1145/3543507.3583421 · Cited by 45
SLEDGE: A Simple Yet Effective Baseline for Coronavirus Scientific Knowledge SearchPreprint
MacAvaney, S., Cohan, A., & Goharian, N. (2020) · arXiv (Cornell University) · Cited by 26
Towards Effective and Efficient Sparse Neural Information Retrieval
Formal, T., Lassance, C., Piwowarski, B., & Clinchant, S. (2024) · ACM Transactions on Information Systems · doi:10.1145/3634912 · Cited by 50
“30 We consider two main families of approaches: (i) sparse , which include models like BM25 [91], doc2query-T5 [78], or DeepImpact [69], and (ii) dense , which include models like ANCE [114], TAS-B [39], or ColBERT [45].”
TravelRAG: A Tourist Attraction Retrieval Framework Based on Multi-Layer Knowledge Graph
Song, S., Yang, C., Li, X., Shang, H., Li, Z., & Chang, Y. (2024) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi13110414 · Cited by 40
Learning Robust Dense Retrieval Models from Incomplete Relevance Labels
Prakash, P., Killingback, J., & Zamani, H. (2021) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3404835.3463106 · Cited by 26
“As mentioned in Section 1, dense retrieval is an efficient and effective standalone retrieval solution that has recently attracted considerable attention in the IR literature [3, 9, 11, 18].”
BackgroundMethodConstructing Tree-based Index for Efficient and Effective Dense Retrieval
Li, H., Ai, Q., Zhan, J., Mao, J., Liu, Y., Liu, Z., & Cao, Z. (2023) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3539618.3591651 · Cited by 42
“As DR models have shown promising performance in multi-stage retrieval systems, especially in the first stage retrieval [16, 17, 20, 29, 33, 39], how to develop effective and efficient indexing technique for dense retrieval has become an important question for the research community.”
BackgroundMeadows, J., & Freitas, A. (2023) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00594 · Cited by 43
“Combining explicit similarity-based search (Zhong and Zanibbi, 2019; Meadows and Freitas, 2021) with modern encoders (Khattab and Zaharia, 2020; Karpukhin et al., 2020) delivers leading performance.”
BackgroundA Test Collection of Synthetic Documents for Training Rankers: ChatGPT vs. Human Experts
Askari, A., Aliannejadi, M., Kanoulas, E., & Verberne, S. (2023) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3583780.3615111 · Cited by 45
PIDRo: Parallel Isomeric Attention with Dynamic Routing for Text-Video Retrieval
Guan, P., Pei, R., Shao, B., Liu, J., Li, W., Gu, J., Xu, H., Xu, S., Yan, Y., & Lam, E. Y. M. (2023) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.01025 · Cited by 40
“To solve this problem, some meth-ods conduct fine-grained interaction over token representations [41, 20].”
BackgroundBalaji, B., Vunnava, V. S. G., Domingo, N. G. G., Gupta, S., Gupta, H., Guest, G., & Srinivasan, A. (2023) · ACM Journal on Computing and Sustainable Societies · doi:10.1145/3616385 · Cited by 32
Meng, S., Chen, J., & Zheng, I. (2026) · Journal of Technology Informatics and Engineering · doi:10.51903/jtie.v5i1.537 · Cited by 24
Multi-Vector Models with Textual Guidance for Fine-Grained Scientific Document Similarity
Mysore, S., Cohan, A., & Hope, T. (2022) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/2022.naacl-main.331 · Cited by 74
UnifieR: A Unified Retriever for Large-Scale Retrieval
Shen, T., Geng, X., Tao, C., Xu, C., Long, G., Zhang, K., & Jiang, D. (2023) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3580305.3599927 · Cited by 41
Patel, L., Jha, S., Pan, M., Gupta, H., Asawa, P., Guestrin, C., & Zaharia, M. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3749646.3749685 · Cited by 23
Self-citationFRCL-MNER: A Finer Grained Rank-Based Contrastive Learning Framework for Multimodal NER
Yan, T., Zhao, S., Ma, W., Song, S., Wang, C., Rao, Z., Chen, S., Luo, Z., & Liu, X. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3528567 · Cited by 26
“To achieve this, previous works [13], [51], [52] perform mean-max strategies.”
Are Neural Ranking Models Robust?
Wu, C. H., Zhang, R., Guo, J., Fan, Y., & Cheng, X. (2022) · ACM Transactions on Information Systems · doi:10.1145/3534928 · Cited by 51
Accelerating Learned Sparse Indexes Via Term Impact Decomposition
Mackenzie, J., Mallia, A., Moffat, A., & Petri, M. (2022) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2022.findings-emnlp.205 · Cited by 38
RLocator: Reinforcement Learning for Bug Localization
Chakraborty, P., Alfadel, M., & Nagappan, M. (2024) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2024.3452595 · Cited by 37
Co-design Hardware and Algorithm for Vector Search
Jiang, W., Li, S., Zhu, Y., Licht, J. D. F., He, Z., Shi, R., Renggli, C., Zhang, S., Rekatsinas, T., Hoefler, T., et al. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3581784.3607045 · Cited by 48
“These engines employ machine learning models to represent web pages as vectors and retrieve pages by calculating the distances between query vectors and web vectors [12, 29, 38, 39, 61].”
Beyond Scores: A Modular RAG-Based System for Automatic Short Answer Scoring with Feedback
Fateen, M., Wang, B., & Mine, T. (2024) · IEEE Access · doi:10.1109/access.2024.3508747 · Cited by 36
“Inspired by similarity-based scoring [14], our method retrieves the most similar answers from a short answer scoring feedback dataset using the ColBERT retrieval [15] model.”
MethodNeural Approaches to Multilingual Information Retrieval
Lawrie, D., Yang, E., Oard, D. W., & Mayfield, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-28244-7_33 · Cited by 49
“Third, drawing its structure from ColBERT [26], ColBERT-X limits ranking latency by sepa-rating query and document transformer networks, allowing offline indexing.”
MethodInfluentialLearning to Relate to Previous Turns in Conversational Search
Mo, F., Nie, J., Huang, K., Mao, K., Zhu, Y., Li, P., & Liu, Y. (2023) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3580305.3599411 · Cited by 27
Retrieval as Attention: End-to-end Learning of Retrieval and Reading within a Single Transformer
Jiang, Z., Gao, L., Wang, Z., Araki, J., Ding, H., Callan, J., & Neubig, G. (2022) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2022.emnlp-main.149 · Cited by 62
Memory$^3$: Language Modeling with Explicit Memory
Yang, H., Lin, Z., Wang, W., Wu, H., Li, Z., Tang, B., Wei, W., Wang, J., Tang, Z., Song, S., et al. (2024) · Journal of Machine Learning · doi:10.4208/jml.240708 · Cited by 90
“…key-values, such retrieval can work without the need to finetune the LLM. Specifically, this multi-vector retrieval can follow the routine of [61] with the additional constraint that a query from attention head h can only search for keys from h , while the sparse attention queries can be…”
BackgroundLearning Multiple Intent Representations for Search Queries
Hashemi, H., Zamani, H., & Croft, W. B. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482445 · Cited by 33
“It is also an important component in late combination neural ranking models [13, 21], such as DSSM [25], SNRM [79], ColBERT [28], andANCE [72].”
MethodAnalysing the Robustness of Dual Encoders for Dense Retrieval Against Misspellings
Sidiropoulos, G., & Kanoulas, E. (2022) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3477495.3531818 · Cited by 54
Hindsight: Posterior-guided training of retrievers for improved open-ended generationPreprint
Paranjape, A., Khattab, O., Potts, C., Zaharia, M., & Manning, C. D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.07752 · Cited by 48
Self-citationCaseGNN: Graph Neural Networks for Legal Case Retrieval with Text-Attributed Graphs
Tang, Y., Qiu, R., Liu, Y., Li, X., & Huang, Z. H. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-56060-6_6 · Cited by 23
Suri, S., Ilyas, I. F., Ré, C., & Rekatsinas, T. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3494124.3494149 · Cited by 35
BLISS: A Billion scale Index using Iterative Re-partitioning
Gupta, G., Medini, T., Shrivastava, A., & Smola, A. J. (2022) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3534678.3539414 · Cited by 45
“Examples of this can be found in algorithms such as ColBERT for Question Answering [20], SLICE [14] (Bing Search), and DSSM [13] (Amazon Search).”
MethodUnsupervised Query Performance Prediction for Neural Models with Pairwise Rank Preferences
Singh, A., Ganguly, D., Datta, S., & Macdonald, C. (2023) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3539618.3592082 · Cited by 26
What Are You Token About? Dense Retrieval as Distributions Over the Vocabulary
Ram, O., Bezalel, L., Zicher, A., Belinkov, Y., Berant, J., & Globerson, A. (2023) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2023.acl-long.140 · Cited by 53
Towards Query Performance Prediction for Neural Information Retrieval: Challenges and Opportunities
Faggioli, G., Formal, T., Lupart, S., Marchesin, S., Clinchant, S., Ferro, N., & Piwowarski, B. (2023) · ACM SIGIR International Conference on Theory of Information Retrieval (ICTIR) · doi:10.1145/3578337.3605142 · Cited by 25
Resources for Brewing BEIR: Reproducible Reference Models and Statistical Analyses
Kamalloo, E., Thakur, N., Lassance, C., Ma, X., Yang, J.-H., & Lin, J. (2024) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3626772.3657862 · Cited by 50
“This led to the development of many so-called dense retrieval models [17, 21, 22, 34, 35, 45].”
BackgroundAnytime Ranking on Document-Ordered Indexes
Mackenzie, J., Petri, M., & Moffat, A. (2021) · ACM Transactions on Information Systems · doi:10.1145/3467890 · Cited by 23
“In addition, complex neural models are often used in components such as query expansion, query understanding, and document re-ranking [23, 30, 40], further restricting the time available to the first stage of the retrieval pipeline.”
MethodYou Only Need One Model for Open-domain Question Answering
Lee, H., Kedia, A., Lee, J., Paranjape, A., Manning, C. D., & Woo, K.-G. (2022) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2022.emnlp-main.198 · Cited by 39
Baleen: Robust Multi-Hop Reasoning at Scale via Condensed RetrievalPreprint
Khattab, O., Potts, C., & Zaharia, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.00436 · Cited by 75
Self-citationMulti-stage Training with Improved Negative Contrast for Neural Passage Retrieval
Lu, J. R., Ábrego, G. H., Ma, J., Ni, J., & Yang, Y. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.492 · Cited by 34
“TCT-ColBERT (Lin et al., 2021) uses ColBERT (Khattab and Zaharia, 2020) as teacher with augmented training data containing hard negatives and then distills its knowledge into a student dual encoder model.”
MethodTransfer learning and multi-phase training for accurate diacritization of Arabic poetry
Abandah, G. A., Suyyagh, A., & Abdel-Majeed, M. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.04.005 · Cited by 23
Towards Robust Ranker for Text Retrieval
Zhou, Y., Shen, T., Geng, X., Tao, C., Xu, C., Long, G., Jiao, B., & Jiang, D. (2023) · Findings of the Association for Computational Linguistics: ACL (Findings of ACL) · doi:10.18653/v1/2023.findings-acl.332 · Cited by 83
MicroBERT: Distilling MoE-Based Knowledge from BERT into a Lighter Model
Zheng, D., Li, J., Yang, Y., Wang, Y., & Pang, P. C. (2024) · Applied Sciences · doi:10.3390/app14146171 · Cited by 24
Metadata
- Authors
- Khattab, O., & Zaharia, M.
- Affiliations
- Stanford University (US)
- Venue
- Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2020-07-25
- Pages
- 39-48
- OpenAlex
- W3021397474
- Cited by
- 1,301
- References
- 21
- Citations by year
- 2026: 346 · 2025: 277 · 2024: 197 · 2023: 184 · 2022: 143 · 2021: 135 · 2020: 18
- FWCI
- 90.73
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) (publishedVersion)
- Funders
- NSF (CNS-1651570)
- Topics
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
- Keywords
- Colbert, BERT, document ranking, information retrieval, query-document similarity, efficient retrieval
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.