The Probabilistic Relevance Framework: BM25 and Beyond
The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
The Probabilistic Relevance Framework (PRF) is a formal framework for document retrieval, grounded in work done in the 1970–1980s, which led to the development of one of the most successful text-retrieval algo¬rithms, BM25. In recent years, research in the PRF has yielded new retrieval models capable of taking into account document meta-data (especially structure and link-graph information). Again, this has led to one of the most successful Web-search and corporate-search algo¬rithms, BM25F. This work presents the PRF from a conceptual point of view, describing the probabilistic modelling assumptions behind the framework and the different ranking algorithms that result from its application: the binary independence model, relevance feedback mod¬els, BM25 and BM25F. It also discusses the relation between the PRF and other statistical models for IR, and covers some related topics, such as the use of non-textual features, and parameter optimisation for models with free parameters.
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
“Most flat baselines also lose ground as pressure rises; BM25 drops from 0 . 808 at 3 -hop to 0 . 425 at 5 / 6 -hop, confirming that the difficulty here is driven by the memory dimension rather than by task length per se.”
From MemGym: a Long-Horizon Memory Environment for LLM Agents (2026) · cites this paper as [38]
In the citing paper
“The combination of vector and BM25 [Robertson and Zaragoza, 2009] retrieval through RRF fusion [Cormack et al., 2009] consistently outperforms any single approach, consistent with findings in hybrid search literature [Ma et al., 2021].”
From Cognis: Context-Aware Memory for Conversational AI Agents (2026) · cites this paper as Robertson and Zaragoza, 2009
In the citing paper
“A streamlined dual-store architecture combining OpenSearch (for documents and native BM25 [Robertson and Zaragoza, 2009] search) with a vector database (for Matryoshka [Kusupati et al., 2022] embeddings at 768D and 256D)”
From Cognis: Context-Aware Memory for Conversational AI Agents (2026) · cites this paper as Robertson and Zaragoza, 2009
In the citing paper
“The BM25 retriever clearly outperformed all dense retrievers.”
From In-Context Retrieval-Augmented Language Models (2023) · cites this paper as Robertson and Zaragoza, 2009
In the citing paper
“a 345M parameter GPT-2 enhanced by In-Context RALM outperforms a 762M parameter GPT-2 when employing an off-the-shelf BM25 retriever (Robertson and Zaragoza, 2009)”
From In-Context Retrieval-Augmented Language Models (2023) · cites this paper as Robertson and Zaragoza, 2009
6 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
Learning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836
THE PROBABILITY RANKING PRINCIPLE IN IR
ROBERTSON, S. E. (1977) · Journal of Documentation · doi:10.1108/eb026647 · Cited by 1,103
Self-citationRelevance based language models
Lavrenko, V., & Croft, W. B. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383972 · Cited by 1,037
A probabilistic model of information retrieval: development and comparative experiments
Sparck Jones, K., Walker, S., & Robertson, S. E. (2000) · Information Processing & Management · doi:10.1016/s0306-4573(00)00015-7 · Cited by 942
Self-citationOn Relevance, Probabilistic Indexing and Information Retrieval
Maron, M. E., & Kuhns, J. L. (1960) · Journal of the ACM · doi:10.1145/321033.321035 · Cited by 907
Probabilistic models of information retrieval based on measuring the divergence from randomness
Amati, G., & Van Rijsbergen, C. J. (2002) · ACM Transactions on Information Systems · doi:10.1145/582415.582416 · Cited by 883
A Markov random field model for term dependencies
Metzler, D., & Croft, W. B. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076115 · Cited by 843
Document language models, query models, and risk minimization for information retrieval
Lafferty, J., & Zhai, C. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383970 · Cited by 530
USING PROBABILISTIC MODELS OF DOCUMENT RETRIEVAL WITHOUT RELEVANCE INFORMATION
CROFT, W. B., & HARPER, D. J. (1979) · Journal of Documentation · doi:10.1108/eb026683 · Cited by 433
Research works printed but not linked: 21
- Agarwal, 2005, Proceedings of the NIPS 2005 Workshop on Learning to Rank
- Beaulieu, 1997, Okapi at TREC-5, 143
- Berghen, 2004, CONDOR: A constrained, non-linear, derivative-free parallel optimizer for continuous, high computing load, noisy objective functions
- Blei, 2003, Latent dirichlet allocation, Journal of Machine Learning Research, 3, 993
- Boldi, 2005, MG4J at TREC 2005, 10.6028/NIST.SP.500-266.terabyte-umilano.vigna · doi:10.6028/nist.sp.500-266.terabyte-umilano.vigna
- Craswell, 2005, Microsoft Cambridge at TREC-14: Enterprise track, 10.6028/NIST.SP.500-266.enterprise-microsoft.robertson · doi:10.6028/nist.sp.500-266.enterprise-microsoft.robertson
- Lafferty, 2003, Language Modelling for Information Retrieval, 1
- Metzler, 2009, Information Retrieval in Practice
- Pérez-Agüera, 2008, UCM-Y!R at CLEF 2008 Robust and WSD tasks
- Pérez-Agüera, 2008, Exploiting morphological query structure using genetic optimization
- Robertson, 1983, The unified probabilistic model for IR, 108
- Robertson, 1977, Relevance weighting of search terms, Journal of the American Society for Information Science
- Robertson, 1981, Probabilistic models of indexing and searching, 35
- Robertson, 1994, Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval, 232
- Robertson, 2007, On relevance weights with little relevance information, 16
- Robertson, 1992, Okapi at TREC, 21
- Robertson, 2004, Simple BM25 extension to multiple weighted fields, 42
- Song, 2008, Viewing term proximity from a different perspective, 346
- Tao, 2007, An exploration of proximity measures in information retrieval, 295
- van Os, 2006, PF/Tijah: Text search in an XML database system, 12
- Zaragoza, 2005, Microsoft Cambridge at TREC 2004: Web and HARD track
Cited by
Items 101–150 of 150
AgentPoison: Red-teaming LLM Agents via Poisoning Memory or Knowledge Bases
Chen, Z., Xiang, Z., Xiao, C., Song, D., & Li, B. (2024) · arXiv · doi:10.48550/arxiv.2407.12784 · Cited by 246
“…can be categorized into sparse retrievers (e.g. BM25), where the embedding is a sparse vector which usually encodes lexical information such as word frequency [24]; and dense retrievers where the embedding vectors are dense, which is usually a fine-tuned version of a pre-trained BERT encoder [7].”
Predicting retracted research: a dataset and machine learning approaches
Fletcher, A. H. A., & Stevenson, M. (2025) · Research Integrity and Peer Review · doi:10.1186/s41073-025-00168-w · Cited by 9
“All other text features were represented using term weights produced by Best Matching 25 [29] with k = 2 , b = 0.3 and no maximum vocabulary length specified.”
InfluentialReACC: A Retrieval-Augmented Code Completion Framework
Lu, S., Duan, N., Han, H., Guo, D., Hwang, S.-W., & Svyatkovskiy, A. (2022) · arXiv · doi:10.48550/arxiv.2203.07722 · Cited by 96
“The simplest technique for retrieving code is to build a sparse vector retriever like TF-IDF or BM25 (Robertson and Zaragoza, 2009) which are both based on keyword matching algorithms.”
MethodLLM-augmented multi-agent cooperative framework for medical case retrieval in cardiology
Deng, L., Hu, H., Lu, K., & He, P. (2025) · Journal of King Saud University Computer and Information Sciences · doi:10.1007/s44443-025-00311-z · Cited by 8
GAR-meets-RAG Paradigm for Zero-Shot Information Retrieval
Arora, D., Kini, A., Chowdhury, S. R., Natarajan, N., Sinha, G., & Sharma, A. (2023) · arXiv · doi:10.48550/arxiv.2310.20158 · Cited by 8
STILE: Exploring and Debugging Social Biases in Pre-trained Text Representations
Kabir, S., Li, L., & Zhang, T. (2024) · Proceedings of the CHI Conference on Human Factors in Computing Systems · doi:10.1145/3613904.3642111 · Cited by 8
Generating benchmarks for factuality evaluation of language models
Muhlgay, D., Ram, O., Magar, I., Levine, Y., Ratner, N., Belinkov, Y., Abend, O., Leyton-Brown, K., Shashua, A., & Shoham, Y. (2023) · arXiv · doi:10.48550/arxiv.2307.06908 · Cited by 8
Beamaggr: Beam aggregation reasoning over multi-source knowledge for multi-hop question answering
Chu, Z., Chen, J., Chen, Q., Wang, H., Zhu, K., Du, X., Yu, W., Liu, M., & Qin, B. (2024) · Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2024.acl-long.67 · Cited by 11
Agent-as-a-Judge: Evaluate Agents with Agents
Zhuge, M., Zhao, C., Ashley, D., Wang, W., Khizbullin, D., Xiong, Y., Liu, Z., Chang, E., Krishnamoorthi, R., Tian, Y., et al. (2024) · arXiv · doi:10.48550/arxiv.2410.10934 · Cited by 5
(2025) · doi:10.1145/3737412.3743489 · Cited by 4
“Retrieval methods range from classical BM25 [33] to supervised and heuristic-based ranking approaches [9, 29, 35, 50].”
A Critical Review on Citation Recommendation Systems Through a Graph-Centric Approach
Kefalas, P., Ali, Z., & Manolopoulos, Y. (2026) · SN Computer Science · doi:10.1007/s42979-026-04848-2 · Cited by 4
Lightweight and Direct Document Relevance Optimization for Generative Information Retrieval
Mekonnen, K. A., Tang, Y., & de Rijke, M. (2025) · Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3726302.3730023 · Cited by 3
“Positive samples were selected based on qrels relevance judgments, while negatives were drawn from the top 1000 BM25-retrieved documents, stratified into top (1–100), mid (101–500), and lower (501–1000) ranks.”
InfluentialLongMemEval: Benchmarking Chat Assistants on Long-Term Interactive Memory
Wu, D., Wang, H., Yu, W., Zhang, Y., Chang, K.-W., & Yu, D. (2024) · arXiv · doi:10.48550/arxiv.2410.10813 · Cited by 493
“In Table 9, we compare the performance of Stella V5 with two alternative popular retrievers: BM25 (Robertson & Zaragoza, 2009) and Contriever (Izacard et al., 2022).”
Enhancing Medical Question Answering with LLMs via a Hybrid Retrieval-Augmented Generation Framework
Aljohani, B., & Alsanoosy, T. (2026) · Information · doi:10.3390/info17020133 · Cited by 3
Human-inspired Perspectives: A Survey on AI Long-term Memory
He, Z., Lin, W., Zheng, H., Zhang, F., Jones, M. W., Aitchison, L., Xu, X., Liu, M., Kristensson, P. O., & Shen, J. (2024) · arXiv · doi:10.48550/arxiv.2411.00489 · Cited by 3
“Sparse retrieval, which requires both the query and the memory fragment to be in text format, involves meth-ods such as BM25 [230, 231] and TF-IDF [232].”
Seed-Coder: Let the Code Model Curate Data for Itself
Seed, B., Zhang, Y., Su, J., Sun, Y., Xi, C., Xiao, X., Zheng, S., Zhang, A., Liu, K., Zan, D., et al. (2025) · arXiv · doi:10.48550/arxiv.2506.03524 · Cited by 3
“The context includes the pre-commit code snapshot’s README, directory structure, and top 5 relevant files retrieved via BM25 [Robertson and Zaragoza, 2009].”
HelloBench: Evaluating Long Text Generation Capabilities of Large Language Models
Que, H., Duan, F., He, L., Mou, Y., Zhou, W., Liu, J., Rong, W., Wang, Z. M., Yang, J., Zhang, G., et al. (2024) · arXiv · doi:10.48550/arxiv.2409.16191 · Cited by 3
“• Step 2: To deduplicate the instructions, we used the BM25 algorithm (Robertson et al., 2009) to identify the top-5 most similar instructions for each entry.”
MethodAttribute or Abstain: Large Language Models as Long Document Assistants
Buchmann, J., Liu, X., & Gurevych, I. (2024) · Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2024.emnlp-main.463 · Cited by 3
When Retrieval Augmentation Meets API Documentation: Can LLMs Code with Less-Common Libraries?
Chen, J., Chen, S., Cao, J., Shen, J., & Cheung, S.-C. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3821424 · Cited by 3
“We used BM25 retriever in this RQ since it is robust in domain adaptation [46] and proves most effective in our study (discussed in RQ3 in Section 4.3).”
InfluentialSelf-Critique Guided Iterative Reasoning for Multi-hop Question Answering
Chu, Z., Fan, H., Chen, J., Wang, Q., Yang, M., Liang, J., Wang, Z., Li, H., Tang, G., Liu, M., et al. (2025) · Findings of the Association for Computational Linguistics: ACL 2025 · doi:10.18653/v1/2025.findings-acl.123 · Cited by 2
Low Resource Question Answering: An Amharic Benchmarking Dataset
Taffa, T. A., Usbeck, R., & Assabie, Y. (2024) · Proceedings of the Language Resources and Evaluation Conference · doi:10.63317/283hsucqvqy9 · Cited by 2
HELMET: How to Evaluate Long-Context Language Models Effectively and Thoroughly
Yen, H., Gao, T., Hou, M., Ding, K., Fleischer, D., Izsak, P., Wasserblat, M., & Chen, D. (2024) · arXiv · Cited by 2
FeedbackEval: A Benchmark for Evaluating Large Language Models in Feedback-Driven Code Repair Tasks
Dai, D., Liu, M., Li, A., Cao, J., Wang, Y., Wang, C., Peng, X., & Zheng, Z. (2025) · arXiv · doi:10.48550/arxiv.2504.06939 · Cited by 1
“• Example Selection Shot (ES-shot) : Employs retrieval-based few-shot prompting with BM25 [35] similarity.”
Memory in the Age of AI Agents
Hu, Y., Liu, S., Yue, Y., Zhang, G., Liu, B., Zhu, F., Lin, J., Guo, H., Dou, S., Xi, Z., et al. (2025) · arXiv · doi:10.48550/arxiv.2512.13564 · Cited by 389
CodexGraph: Bridging Large Language Models and Code Repositories via Code Graph Databases
Liu, X., Lan, B., Hu, Z., Liu, Y., Zhang, Z., Wang, F., Shieh, M., & Zhou, W. (2024) · arXiv · doi:10.48550/arxiv.2408.03910 · Cited by 1
LLM Assisted Dual-View Awareness Framework for Smart Contract Vulnerability Detection
Wang, J., Yue, Y., Hu, D., Li, Q., Li, J., & Zhu, W. (2025) · 2025 IEEE 36th International Symposium on Software Reliability Engineering (ISSRE) · doi:10.1109/issre66568.2025.00022 · Cited by 1
Building conversational artifacts to enable digital assistant for apis and rpas
Bandlamudi, J., Mukherjee, K., Agarwal, P., Chaudhuri, R., Pimplikar, R., Dechu, S., Straley, A., Ponniah, A., & Sindhgatta, R. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i21.30306 · Cited by 1
Minions: Cost-efficient Collaboration Between On-device and Cloud Language Models
Narayan, A., Biderman, D., Eyuboglu, S., May, A., Linderman, S., Zou, J., & Re, C. (2025) · arXiv · doi:10.48550/arxiv.2502.15964 · Cited by 1
“In Figure 8 (left), we compare Minion S , Minion , and RAG using BM25 and OpenAI’s text-embedding-3-small embeddings (Robertson & Zaragoza, 2009; Neelakantan et al., 2022).”
AMA-Bench: Evaluating Long-Horizon Memory for Agentic Applications
Zhao, Y., Yuan, B., Huang, J., Yuan, H., Yu, Z., Xu, H., Hu, L., Shankarampeta, A., Huang, Z., Ni, W., et al. (2026) · arXiv · doi:10.48550/arxiv.2602.22769 · Cited by 51
“During question answering, MemAlpha retrieves relevant memories using BM25 sparse retrieval, fetching the top-20 most relevant items per memory type.”
D-MEM: Dopamine-Gated Agentic Memory via Reward Prediction Error Routing
Song, Y., & Xin, Q. (2026) · arXiv · doi:10.48550/arxiv.2603.14597 · Cited by 1
“Subsequent work explored dense passage retrieval [Karpukhin et al., 2020] for richer semantic matching and sparse lexical retrieval via BM25 [Robertson and Zaragoza, 2009] for precise entity-level lookup; hybrid fusion of both [Cormack et al., 2009] has become the practical default in…”
MemTrace: Probing What Final Accuracy Misses in Long-Term Memory
Long, X., Chen, Z., Zeng, S., Wang, S., Guo, K., & Tang, J. (2026) · arXiv · doi:10.48550/arxiv.2606.17328
“(b) RAG configurations include BM25 (Robertson and Zaragoza, 2009), Text-emb-3-small (OpenAI, 2024), Qwen3-Emb (Qwen Team, 2025a), and HippoRAG-v2 (Jimenez Gutier-rez et al., 2024); they retrieve memory evidence before generation.”
Cognis: Context-Aware Memory for Conversational AI Agents
Daftari, P., Patel, K., Kapale, S., George, J., & Surendira, S. (2026) · arXiv · doi:10.48550/arxiv.2604.19771
“Dense retrieval excels at semantic similarity and paraphrase matching, while sparse methods like BM25 [Robertson and Zaragoza, 2009] capture exact term matches that embeddings may miss. Reciprocal Rank Fusion (RRF) [Cormack et al., 2009] provides a simple yet effective method for combining ranked…”
When Continual Learning Moves to Memory: A Study of Experience Reuse in LLM Agents
Hu, Q., Long, Q., & Wang, W. (2026) · arXiv · doi:10.48550/arxiv.2604.27003 · Cited by 19
Hindsight: Structured Agent Memory that Retains, Recalls, and Reflects
Latimer, C., Boschi, N., Neeser, A., Bartholomew, C., Srivastava, G., Wang, X., & Ramakrishnan, N. (2026) · Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations) · doi:10.18653/v1/2026.acl-demo.27 · Cited by 5
“Our multi-strategy re-call pipeline combines HNSW-based vector search (Malkov and Yashunin, 2020), BM25 key-word retrieval (Robertson and Zaragoza, 2009), graph traversal, and temporal filtering.”
MemGym: a Long-Horizon Memory Environment for LLM Agents
Xu, W., Wang, Y., Mei, K., Liang, K., Wang, Z., Jin, M., Zhang, H., Zhang, S.-X., Hua, W., Sahu, S., et al. (2026) · arXiv · doi:10.48550/arxiv.2605.20833 · Cited by 11
“Passthrough (no memory) 0.330 ± 0.049 0.290 ± 0.014 0.009 ± 0.011 BM25 over notes [38] 0.808 ± 0.037 0.555 ± 0.017 0.425 ± 0.048 Naive RAG [25] 0.753 ± 0.039 0.537 ± 0.016 0.442 ± 0.045 Structured summary 0.684 ± 0.045 0.340 ± 0.017 0.257 ± 0.035 A-Mem [50] 0.709 ± 0.043 0.540 ± 0.016 0.518 ± 0.037…”
InfluentialWhat Makes In-Context Examples Effective for Code Generation?
Li, D., Chen, S., Cao, J., & Cheung, S.-C. (2026) · Proceedings of the ACM on Software Engineering · doi:10.1145/3832275
SmartSearch: How Ranking Beats Structure for Conversational Memory Retrieval
Derehag, J., Calva, C., & Ghiurau, T. (2026) · arXiv · doi:10.48550/arxiv.2603.15599
“This replaces BM25’s corpus-statistical weighting (IDF) with a linguistic signal: a speaker name appearing frequently in the conversation (low IDF) receives the highest weight because it is a proper noun and named entity.”
InfluentialAi, Q., Zhan, J., & Liu, Y. (2025) · arXiv · doi:10.48550/arxiv.2501.02842
“Perhaps the most notable difference is that recent studies on naive RAG often prefer the use of neural retrieval models (e.g., dense retrieval models [96]) over traditional term-matching models (e.g., BM25 [97]).”
Just-in-Time Memory: Learning to Curate Task-Adaptive Memory for LLM Agents
Zhou, Y., Li, Y., Liu, Z. L., Yavuz, S., & Joty, S. (2026) · arXiv · doi:10.48550/arxiv.2609.27334 · Cited by 1
“We use BM25 (Robertson & Zaragoza, 2009) over task descriptions only (not trajectory content), keeping retrieval lightweight and decoupled from trajectory length.”
InfluentialRe-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval
Chen, Y., Yoon, J., Sachan, D. S., Wang, Q., Cohen-Addad, V., Bateni, M., Lee, C.-Y., & Pfister, T. (2024) · arXiv · doi:10.48550/arxiv.2408.01875
“When combined with BM25 sparse embeddings, nDCG@5 is significantly increased.”
InfluentialMESH-Harness: Self-Improving Agent Harnesses via Bandit-Guided Compositional Evolution
Shang, Z., Huo, Y., Gong, M., Yan, A., Qu, Z., Dong, J., Low, B. K. H., Wu, C., & Dai, Z. (2026) · arXiv · doi:10.48550/arxiv.2610.05300
Enrich-Retrieve-Rank: Scaling Capability Discovery Beyond In-Context Routing
Sorathiya, N., Zhang, D., & Akhbari, B. (2026) · arXiv · doi:10.48550/arxiv.2608.22695 · Cited by 1
Liang, Z., Sheffield, C., Butera, G., & Antani, S. (2026) · JMIR AI · doi:10.2196/93761
Query Attribute Modeling: Improving Search Relevance with Semantic Search and Meta Data Filtering
Menon, K., Haider, B. A., Arham, M., Mehreen, K., Kadiyala, R. M. R., Shafique, M. A., & Farooq, H. (2025) · 2025 IEEE International Conference on Data Mining Workshops (ICDMW) · doi:10.1109/icdmw69685.2025.00131
“The evaluation involved running each query against five search methods: BM25 keyword-based search [16], semantic search [8], cross-encoder re-ranking, hybrid search, and QAM.”
Eliciting In-context Retrieval and Reasoning for Long-context Large Language Models
Qiu, Y., Embar, V. R., Zhang, Y., Jaitly, N., Cohen, S. B., & Han, B. (2025) · Findings of the Association for Computational Linguistics: ACL 2025 · doi:10.18653/v1/2025.findings-acl.165
CoverageBench: Evaluating Information Coverage across Tasks and Domains
Samuel, S., Yates, A., Lawrie, D., Soboroff, I., Adriaanse, T., Van Durme, B., & Yang, E. (2026) · Proceedings of the 49th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3805712.3808625
BIM Information Extraction Through LLM-based Adaptive Exploration
Hellin, S., Jang, S., Fuchs, S., Nousias, S., & Borrmann, A. (2026) · arXiv · doi:10.48550/arxiv.2605.01698
OBLIQ-Bench: Exposing Overlooked Bottlenecks in Modern Retrievers with Latent and Implicit Queries
Tchuindjo, D., Shah, D., & Khattab, O. (2026) · arXiv · doi:10.48550/arxiv.2605.06235
Graphs Meet AI Agents: Taxonomy, Progress, and Future Opportunities
Bei, Y., Zhang, W., Wang, S., Chen, W., Zhou, S., Chen, H., Li, Y., Bu, J., Pan, S., Yu, Y., et al. (2025) · arXiv · doi:10.48550/arxiv.2506.18019
Metadata
- Authors
- Robertson, S., & Zaragoza, H.
- Affiliations
- Microsoft Research (United Kingdom) (GB)
- Yahoo (Spain) (ES)
- ORCID
- Robertson, Stephen
- Venue
- Foundations and Trends® in Information Retrieval
- Publisher
- Emerald
- Published
- 2009-09-17
- Volume
- 4
- Issue
- 1-2
- Pages
- 1-174
- ISSN
- 1554-0669 (ISSN-L)
- 1554-0677
- OpenAlex
- W4252076394
- Cited by
- 3,374
- References
- 27
- Citations by year
- 2026: 737 · 2025: 605 · 2024: 389 · 2023: 432 · 2022: 282 · 2021: 229 · 2020: 152 · 2019: 120 · 2018: 118 · 2017: 74 · 2016: 79 · 2015: 50 · 2014: 29 · 2013: 36 · 2012: 22
- FWCI
- 36.84
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Foundations and Trends® in Information Retrieval (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Text Analysis Techniques
- Keywords
- BM25, probabilistic retrieval, document structure, link graphs, parameter optimization, web search
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.