LakeQuest: A Three-Domain Benchmark for Grounded
Question Answering across Data Lakes

Michael Solodko1Steven GongGuangwei YuSatya Krishna Gorti
Jesse C. CresswellVictor Zhong

University of Waterloo Layer 6 AI


Code, data, and starter kit: https://github.com/michael0402/LakeQuest-starter-kit
LakeQuest Open Dev: https://www.codabench.org/competitions/17066/
LakeQuest Open Test: https://www.codabench.org/competitions/17065/
LakeQuest Closed Test (Code Evaluation): https://www.codabench.org/competitions/17064/


Abstract

While modern question answering (QA) systems excel on clean, schema-aligned corpora, real-world knowledge is rarely so neatly packaged. Answering questions over enterprise and scientific data lakes requires systems to navigate heterogeneous, weakly structured collections of tables, passages, and linked metadata. Current benchmarks abstract away this noisy discovery process, failing to evaluate end-to-end performance. To bridge this gap, we introduce LakeQuest, a human-validated benchmark of 9,846 QA pairs designed to evaluate the end-to-end retrieve-and-synthesize pipeline over realistic data lakes. LakeQuest spans three diverse domains—AI/ML metadata, retail banking, and multimodal biomedical drug information—and pairs every question with exact, modality-aware evidence pointers. By isolating source discovery from cross-modal synthesis, LakeQuest exposes critical failure modes in modern QA systems. Our baseline evaluations, including standard Retrieval-Augmented Generation (RAG) and agentic tool-use methods, reveal that high-quality retrieval does not guarantee correct reasoning. Systems consistently struggle with relation chaining in metadata graphs, policy grounding in bank ledgers, and joint tabular QA in biomedical contexts, highlighting the need for robust discovery and faithful cross-file composition mechanisms in future agentic QA systems.

1 Introduction↩︎

Question answering (QA) systems have achieved strong performance on curated, homogeneous corpora, ranging from reading comprehension [1] to open-domain text retrieval [2] and multi-hop reasoning [3]. However, real-world enterprise and scientific knowledge is rarely stored as flat text. Instead, it often resides in data lakes: heterogeneous, weakly structured collections of tables, passages, and linked metadata.

Answering natural language questions over data lakes requires navigating siloed sources, combining cross-modal evidence, and maintaining explicit provenance. However, modern retrieve-and-synthesize architectures [4], [5] lack evaluation environments that simultaneously stress discovery, cross-source composition, and faithful attribution over heterogeneous corpora. Existing benchmarks bypass the noise, scale, and weak metadata characteristic of real data lakes, evaluating either pure data discovery without natural language synthesis, or reasoning over already-clean, schema-aligned text.

To bridge this gap, we introduce LakeQuest, a benchmark designed to evaluate the end-to-end QA pipeline over realistic data lakes. LakeQuest provides a shared construction and evaluation framework instantiated across three diverse domains: AI/ML metadata, a realistic retail bank, and multimodal biomedical drug information. Rather than flattening these domains into a uniform representation, LakeQuest preserves their native structural heterogeneity as data lakes. Each benchmark instance pairs a natural language question with a reference answer and exact, modality-aware evidence pointers (e.g., specific table rows or passage spans). Furthermore, because LakeQuest preserves the native structure of the data lakes, it inherently captures factual redundancy. A system might successfully synthesize a grounded answer by discovering valid alternative provenance (e.g., a redundant table or densely informative passage) even if the target gold artifact is missed. This explicit attribution enables precise isolation of system failures into discovery errors (failing to retrieve evidence) versus reasoning errors (failing to synthesize an answer from the retrieved evidence) [6], [7].

We construct LakeQuest using a reproducible five-stage pipeline encompassing domain instantiation, language-model-driven QA synthesis, structural filtering, semantic validation, and rigorous human review. The resulting benchmark contains 9,846 human-validated QA pairs that entail single-source lookup, cross-source composition, and multi-hop reasoning.

Evaluating a diverse suite of baselines—from zero-shot reasoning [8] and standard retrieval-augmented generation (RAG) [4] to structured pipelines and agentic tool-use methods such as XMode [9] and ReSP [10]—we find that the bottlenecks in data lake QA remain fundamentally unsolved and are strongly domain-dependent. Specifically, accurate retrieval does not guarantee faithful reasoning when cross-modal composition is required, and even agentic strategies struggle with multi-hop discovery over weakly structured metadata.

Our primary contributions are: (1) The LakeQuest Benchmark: A human-validated dataset of over 9.8k questions evaluating grounded reasoning across three heterogeneous data lakes (AI/ML, Retail Banking, and Biomedical Drug). (2) A Reproducible Construction Framework: A five-stage protocol for synthesizing, filtering, and validating QA pairs with explicit evidence traces over weakly structured corpora. (3) Empirical Analysis of Modern QA: Extensive baseline evaluations revealing that high retrieval quality does not consistently translate into accurate, faithful answers—especially when multi-step or cross-source composition is required.

Figure 1: Overview of LakeQuest. The benchmark spans three heterogeneous data lakes built under a shared construction and evaluation protocol for grounded question answering.

2 Related Work↩︎

Table 1 provides a structural comparison between LakeQuest and existing QA and data discovery benchmarks across modalities, evidence tracing, and evaluation scope.

Table 1: Comparison of with existing QA and data discovery benchmarks. Modality describes the data formats involved. Ev indicates the presence of explicit evidence traces linking answers to sources. Md denotes the inclusion of weak metadata and distractor documents to test retrieval robustness. Val indicates datasets that underwent human validation. Objects denotes approximate source-side evidence containers (e.g., paragraphs, tables, passages, or hybrid contexts).
Benchmark Modality Ev Md Val # Qs Objects Task Domain
HotpotQA Text \(\bm{✔}\) \(\bm{\times}\) \(\bm{✔}\) 113k
paragraphs
Reasoning Wikipedia
HybridQA
Text \(\bm{\times}\) \(\bm{\times}\) \(\bm{✔}\) 69k+
293k passages
Reasoning Wikipedia
TAT-QA
Text \(\bm{\times}\) \(\bm{\times}\) \(\bm{✔}\) 16k+
contexts
QA Finance
LakeBench
Metadata \(\bm{\times}\) \(\bm{✔}\) \(\bm{✔}\) 10k+
tables
Discovery Open Data
Metadata \(\bm{✔}\) \(\bm{✔}\) \(\bm{✔}\) 9.8k
10k+ bank records +
500k+ drug texts/tables
QA
Banking
Drug

3.0pt

Data Discovery and Integration. Data management literature extensively studies how to discover, link, and integrate datasets [11], [12]. Accordingly, benchmarking efforts in this space, such as LakeBench [13] and CMDL [14], evaluate the retrieval of joinable tables or cross-modal artifacts. While essential for data discovery, these benchmarks remain purely retrieval-focused and do not evaluate natural language synthesis.

Text-centric and Multi-hop QA. In the NLP community, QA benchmarks have evolved from single-document reading comprehension [1] to open-domain retrieval [2] and multi-hop reasoning with HotpotQA [3]. While foundational, these datasets largely assume text-centric evidence within curated, relatively homogeneous corpora (e.g., Wikipedia). Real data lakes, however, are characterized by weak metadata, fragmented entity references, and a mixture of semi-structured objects, making reasoning pathways noisier than those found in standard text-only multi-hop settings.

Hybrid and Multimodal QA. A closer line of work evaluates QA over multiple evidence types. HybridQA [15] and OTT-QA [16] require reasoning across tables and text, while TAT-QA [17] emphasizes numerical reasoning over financial reports. MultiModalQA [18] expands the scope to joint reasoning over text, tables, and images. While these benchmarks require cross-modal synthesis, they generally operate over highly curated, schema-aligned, or task-specific corpora. They do not model the core challenges of enterprise data lakes: navigating siloed, weakly linked sources, resolving entities across heterogeneous files, and maintaining strict, modality-aware provenance for auditability.

Retrieval-Grounded and Agentic Systems. Methodologically, LakeQuest provides a necessary testbed for modern retrieve-and-synthesize pipelines. RAG [4] and fusion-in-decoder (FiD) [19] established paradigms for grounding generation in retrieved contexts, while recent methods propose structured decomposition [20], iterative tool use [5], [21], and multi-agent orchestration like Symphony [22]. By providing a heterogeneous environment with explicit evidence requirements and realistic discovery bottlenecks, LakeQuest enables the community to rigorously evaluate whether these control strategies can handle the noise and scale of real-world data lakes.

3 The LakeQuest Framework↩︎

To rigorously evaluate QA over heterogeneous data lakes, we require a framework that isolates source discovery from cross-modal synthesis, scales across domains, and maintains strict provenance. LakeQuest operationalizes this through a formalized task definition and a reproducible construction pipeline.

3.1 Problem Formulation and Task Taxonomy↩︎

We formulate grounded data lake QA: given a data lake \(\mathcal{D} = \{d_1, \dots, d_n\}\) (where \(d_i\) is a table, passage, or metadata record) and a natural language question \(q\), a system \(f\) must return a textual answer \(\hat{a}\) and a precise supporting evidence set \(\hat{E} \subseteq \mathcal{D}\): \(f(q, \mathcal{D}) \rightarrow (\hat{a}, \hat{E})\). Modern agents decompose this operation into retrieve-and-synthesize workflows: \(\hat{E} = R(q, \mathcal{D})\) and \(\hat{a} = G(q, \hat{E})\). By requiring systems to output \(\hat{E}\), LakeQuest allows us to independently evaluate the retrieval mechanism \(R\) (discovery) and the generator \(G\) (synthesis).

To systematically test this pipeline, LakeQuest is organized into four distinct reasoning families: single-source lookups requiring fact extraction from isolated objects; cross-source composition necessitating the combination of facts across multiple heterogeneous objects (e.g., joining a policy with a transaction); multi-hop reasoning requiring chained inference over intermediate entities or linked metadata; and anchor-based retrieval, which conditions questions on a selected entity, forcing the agent to reason over related entities amidst semantically close distractors.

Unlike standard text QA benchmarks where evidence is simply a document ID, LakeQuest enforces modality-aware provenance. Each benchmark instance is defined by the tuple \(x_i = (q_i, a^*_i, E^*_i, m_i)\), where \(E^*_i\) resolves to concrete sub-document units (e.g., specific table rows or exact passage spans) and \(m_i\) tracks the question family and domain metadata. Figure 2 illustrates a concrete cross-source instance from the Retail Bank data lake.

Figure 2: Anatomy of a LakeQuest instance — this requires identifying and synthesizing specific, sub-document evidence units across multiple heterogeneous sources to derive the correct answer.

3.2 The Shared Five-Stage Pipeline↩︎

Manually authoring tens of thousands of complex, cross-modal QA pairs is unscalable, while purely synthetic datasets often suffer from hallucinations and trivial reasoning pathways. To balance scale with rigor, we construct LakeQuest using an LLM-in-the-loop pipeline consisting of five shared stages across all domains (a visual schematic of the Retail Bank data lake question-answer synthesis process is provided in App 16).

The five shared stages include: (1) Lake Instantiation, preserving the domain’s native schema rather than homogenizing documents; (2) Candidate Synthesis, where a strong language model (OpenAI GPT-5, Feb. 1, 2026) synthesizes a candidate question \(q\), answer \(a^*\), and exact evidence pointers \(E^*\) from a sampled evidence subgraph; (3) Structural Filtering, which programmatically removes malformed outputs or deictic questions; (4) Semantic Filtering, utilizing an LLM-as-a-judge to reject trivial candidates answerable via parametric memory alone; and (5) Human Validation, the definitive gate for benchmark inclusion, assessing answerability and attribution. Exact prompts and rubrics are detailed in App 11.

3.3 Human Validation and Quality Control↩︎

To guarantee evaluation fidelity, all items passing the automated filters are subjected to rigorous human validation. Annotators were tasked with independently verifying two criteria: Answerability (can the question be answered exclusively using the cited evidence?) and Attribution (is the generated answer completely faithful to the cited text/table?). The use of human annotators was approved by the ethics review board at the authors’ institution. Prolific annotators (paid $12 USD/hr) independently verified each item under this protocol. Inter-annotator agreement (Fleiss’ \(\kappa\)) demonstrates strong consistency across raters: \(0.82\) for Answerability and \(0.85\) for Attribution. Full annotator guidelines, including a screenshot of the custom validation interface (Figure 3), are provided in App 12. Only instances that achieved strict human consensus were retained in the final LakeQuest release.

Table 2: Abstraction map to unify task design while preserving domain-native structure.
Domain Lake Representation Task Abstraction Primary Reasoning Stress
AI/ML Linked metadata entities (models, datasets, relations) Entity/relation QA with lookup, composition, hop, and anchor families Entity disambiguation and relation chaining
Retail Bank Structured operational records with policy context Persona-workflow tasks with client/group scopes Decision grounding under workflow/policy constraints
Drug Hybrid tables + scientific passages with linkage artifacts Evidence-bundle QA across single-modality and mixed-modality settings Cross-modality evidence integration and multi-hop synthesis

4 The LakeQuest Dataset — Instantiating the Three Data Lakes↩︎

To evaluate the framework across diverse reasoning requirements, LakeQuest instantiates three data lakes: an AI/ML metadata repository, a synthetic retail banking system, and a biomedical corpus. Table 2 outlines the high-level abstractions used to preserve the native structures of these domains. Furthermore, Table 3 details the final benchmark coverage and human annotation outcomes across these three lakes.

4.0.0.1 AI/ML Data Lake

The AI/ML data lake focuses on entity disambiguation and relation chaining over weakly linked metadata. We construct the corpus using a snapshot of the Hugging Face Hub API [23]. The resulting lake consists of model cards and dataset cards, which are inherently semi-structured. We instantiate 5 distinct question families in this domain, yielding 3,578 human-validated questions (see Table 3 for a high-level summary and Table 7 in App 10 for the detailed breakdown).

These tasks map to our core reasoning taxonomy by requiring systems to deduce specific hyperparameters from isolated cards (single-source), synthesize constraints by jointly reasoning over explicitly linked model and dataset cards (cross-source), chain relations across the metadata graph to link datasets and subsequent models (multi-hop), and formulate queries around specific anchor entities despite lexical drift (anchor-based).

4.0.0.2 Retail Bank Data Lake

The Retail Bank data lake evaluates grounded decision-making under strict policy constraints. Because real operational banking data is highly restricted, we generate a high-fidelity synthetic lake by deriving generation seed examples and instantiating an open-banking-inspired relational schema (client, account, transaction, and policy entities). We then populate client profiles, transaction ledgers, and institutional policy documents. We further validate that transaction distributions are similar between the synthetic lake and original real banking data by matching graph density on client profiles. Tasks are formulated across 9 persona-driven workflows (e.g., a fraud analyst investigating a transaction, or an auditor reviewing compliance), yielding 2,964 validated questions (detailed breakdown provided in Table 8, App 10).

These workflows map to core reasoning families: single-source lookups for retrieving isolated facts (e.g., account tiers or policy limits); cross-source composition to combine unstructured policy rules with structured transaction ledgers (e.g., checking if a wire transfer violates a tiered policy); multi-hop reasoning to trace complex fund flows across multiple tables before applying operational rules; and anchor-based retrieval to disambiguate compliance policies based on client attributes amidst overlapping regional guidelines.

4.0.0.3 Drug Data Lake

The Drug data lake stresses multimodal evidence integration. We construct this corpus by fusing structured XML records from DrugBank 6.0 [24] with open-access scientific literature indexed in PubMed [25]. This heterogeneous mixture of dense text and structured properties instantiates 5 question families, producing 3,304 validated questions (see Table 9 in App 10 for statistical breakdown).

The reasoning families in this domain stress multimodal evidence integration: single-source lookups extract precise values from isolated DrugBank tables or PubMed abstracts; cross-source composition synthesizes answers by linking unstructured text passages (e.g., mechanism of action) to structured tables (e.g., biochemical properties); multi-hop reasoning chains relationships across modalities (e.g., identifying a target in a table, then finding passages detailing its metabolic pathway); and anchor-based retrieval requires identifying correct active compounds amidst structurally similar distractors and complex aliases.

4.0.0.4 Splits and Licensing

To prevent contamination, we define (open) validation (20%) and test (80%) splits at the entity rather than question level (i.e., \(\mathrm{Entity}(\mathrm{val}) \cap \mathrm{Entity}(\mathrm{test}) = \emptyset\)). The LakeQuest benchmark and underlying corpora are hosted on Hugging Face at anonymousurl. The AI/ML and Retail Bank subsets are released under an MIT license. For the Drug subset, we release benchmark annotations and evidence pointers, while use of underlying DrugBank tables remains subject to DrugBank licensing terms and PubMed-linked content remains subject to NLM/PubMed access policies and publisher rights.

Table 3: Benchmark coverage summary across all three lakes after human validation.
Domain Question Families Questions Correct AIS Answerable
AI/ML source combos 3,935 3,750 3,687 3,578
Retail Bank personas 3,312 3,047 3,003 2,964
Drug source combos 3,574 3,434 3,373 3,304
Total 10,821 10,231 10,063 9,846

5 Experimental Setup and Baselines↩︎

To benchmark grounded reasoning over data lakes, we define a unified evaluation contract and test representative QA baselines ranging from direct prompting to agentic tool use.

5.0.0.1 Evaluation Metrics

Because data lake QA serves both high-assurance settings (where hallucination is unacceptable) and exploratory analytics (where cost and speed are critical), we treat evaluation as a multi-dimensional quality-cost trade-off. We evaluate systems across four axes:

  • Accuracy (Correctness): We report binary correctness using rubric-based LLM-as-a-judge for baseline runs (including direct-answer and reasoning-answer correctness where applicable), and human-judged correctness for annotated benchmark slices in App 10.

  • Faithfulness (Attribution): Whether the predicted answer \(\hat{a}\) is supported by the predicted evidence set \(\hat{E}\). We operationalize this using Attributable to Identified Sources (AIS) style judgments [26], aligned with the human attribution protocol used throughout this benchmark.

  • Retrieval Quality: Domain/modality-aware recall of gold evidence \(E^*\) in \(\hat{E}\) (e.g., card retrieval in AI/ML, policy and table recall in Retail Bank, and passage/table recall in Drug). For unstructured evidence, success is chunk-level span inclusion; for structured evidence, we require retrieval of the referenced source object and apply row/field-level checks when explicit row-level pointers are available. Because real-world data lakes inherently contain redundant information (e.g., same fact appearing in multiple tables/passages), this metric serves as a strict lower bound. A system may retrieve valid alternative evidence that correctly answers the question despite missing the specific gold artifact.

  • Token Usage: End-to-end retrieval-plus-synthesis token footprint, reported as total model tokens (and normalized per-query token count) under the evaluation-time configuration.

Table 4: Baseline results for the AI/ML data lake. Metrics are Retrieval Recall (\(R\)), Accuracy (\(A\)), Faithfulness (\(F\)), and Token Count (\(T\)). Token Count (\(T\)) is reported in thousands of generation tokens per query. Model and Dataset are single-source lookup and anchor questions, Model-Dataset is cross-source composition, and Model-hop and Dataset-hop are multi-hop reasoning questions.
2-5 (l)6-7 Question Type \(R\) \(A\) \(F\) \(T\) \(A\) \(T\)
Model
Dataset
Model-Dataset
Model-hop
Dataset-hop

5.0.0.2 Evaluated Baselines

We establish baseline performance using models with different levels of agentic complexity. We use GPT-5 as the generator (kept fixed within each experiment suite) [27] and FAISS-backed text-embedding-3-small for retrieval [28]. Comprehensive details, including system instructions, retrieval formatting templates, and agentic tool-use prompts for the evaluated systems, are provided in App 11.

  • Zero-Shot Prompting: A naive baseline that directly prompts the generator LLM without explicit retrieval, testing the limits of parametric memory and instruction following.

  • Retrieval-Augmented Generation (RAG) [4]: Used as our baseline for the document-only AI/ML data lake, this is a standard retrieve-then-generate pipeline. We chunk unstructured passages and structured metadata cards into overlapping text segments before indexing; we then retrieve the top-\(k\) most relevant chunks and synthesize a final answer. We experiment with different values of \(k\) and finalize on \(k=5\), which consistently attains strong performance.

  • Agentic and Structured Pipelines (XMode, ReSP) [9], [10]: Standard RAG is structurally insufficient for Retail Bank and Drug because it cannot natively execute the relational row operations that navigate Retail Bank transaction records and Drug ledgers. Instead, we evaluate stronger multi-step baselines that go beyond single-shot text retrieval by interleaving reasoning and tool use. In our implementation, XMode acts as a tool-augmented RAG system: it uses an iterative loop with passage retrieval from a FAISS index alongside direct query/SQL access to structured tables. ReSP follows an iterative retrieve–summarize–plan style decomposition.

6 Results and Cross-Domain Analysis↩︎

We evaluate baselines across the three domains to understand where modern retrieve-and-synthesize systems fail. Across domains, retrieval quality alone is insufficient; grounded data-lake QA requires stronger cross-source composition and attribution mechanisms.

6.1 AI/ML Data Lake: Discovery is the primary bottleneck↩︎

The AI/ML lake is challenging due to scale—it is built from a Hugging Face model-card corpus with over 1M cards and normalized into a large model–dataset graph with on-demand card-text retrieval—and the inconsistencies between how different authors document artifacts. As shown in Table 4, the RAG baseline exhibits a notable gap between exact-match Recall (\(R\)) and Accuracy (\(A\)). For example, on isolated Model questions, RAG achieves 0.35 Accuracy despite a recall of 0.09. This gap validates that real data lakes contain factual redundancy, for example from models that have been duplicated with minor modifications; the retriever frequently finds valid alternative evidence to synthesize the correct answer even if it misses the specific gold artifact (\(E^*\)). This reinforces that \(R\) acts as a strict lower bound and suggests improved retrieval as a logical next step for metadata QA. In summary, the wide gap between modest recall and reasoning accuracy suggests that navigating weakly linked metadata via dense retrieval is insufficient for reliable entity disambiguation and relation chaining.

6.2 Retail Bank Data Lake: A failure of grounding, not retrieval↩︎

Table 5 reports performance on the Retail Bank lake. This domain is distinctive because benchmark items are framed as operational decisions requiring both unstructured policy retrieval and structured table lookups. The XMode baseline generally achieves high Policy Recall (0.85+ for seven of the nine personas, though struggling on the Data Analyst and Salesperson workflows), but Table Recall varies significantly across the board. More importantly, final answer accuracy is often much lower than policy recall. This exposes a synthesis gap: while agentic systems reliably retrieve abstract governing rules, they fundamentally struggle to ground those rules against specific operational ledgers to execute a faithful decision. Notably, the zero-shot baseline achieves high accuracy on certain workflows (e.g., 0.88 for the Financial planner). While our semantic filter successfully removes simple factoid lookups, frontier LLMs possess strong parametric priors for standard financial principles, allowing them to often deduce correct operational outcomes without context. However, because this zero-shot reasoning lacks explicit provenance (Faithfulness is strictly zero), it highlights why our benchmark requires grounded synthesis; in an enterprise setting, an accurate but ungrounded answer remains an unauditable liability.

Table 5: Baseline results for the Retail Bank data lake. Metrics are Table Recall (\(R_T\)), Policy Recall (\(R_P\)), Accuracy (\(A\)), Faithfulness (\(F\)), and Token Count (\(T\); k-tokens/query, as in Table [tbl:tab:rag95results95aiml]). Persona workflows span all four families in the task taxonomy depending on whether the task is isolated lookup, policy-ledger composition, multi-step trace, or anchor-conditioned policy selection.
2-6 (lr)7-11 (l)12-13 Persona \(R_T\) \(R_P\) \(A\) \(F\) \(T\) \(R_T\) \(R_P\) \(A\) \(F\) \(T\) \(A\) \(T\)
Accountant
Auditor
Customer service (CS)
CS manager
Data analyst
Financial planner
Fraud analyst
Insurance analyst
Salesperson

6.3 Drug Data Lake: Joint tabular QA remains challenging↩︎

Table 6 reports performance on the Drug data lake, which stresses multimodal question answering across passages and tables. The strongest results appear on Passage questions, where XMode achieves near-perfect recall (0.98), accuracy (0.97), and faithfulness (0.97). Passage-hop questions remain relatively strong: despite Passage Recall dropping to 0.72, answer accuracy is 0.86, suggesting systems can often synthesize correct answers from partially recovered text. This gap indicates that retrieving the correct table is often not sufficient; the remaining challenge lies in extracting the right fields and composing them into a correct answer. Difficulty increases further for Table-hop questions, where Table Recall drops to 0.48 and accuracy to 0.44, showing that multi-step reasoning over structured biomedical evidence remains substantially harder than single-table lookup.

The mixed Passage-Table family further reinforces this point. Although exact retrieval is very strong in both modalities—0.73 Passage Recall and 0.98 Table Recall—end-to-end accuracy reaches only 0.66. In other words, the main bottleneck is no longer finding the relevant evidence, but correctly integrating heterogeneous evidence across text and tables. Taken together, these results suggest that the Drug data lake is best characterized not as a retrieval-limited setting, but as a cross-modal synthesis setting in which joint reasoning over structured and unstructured biomedical evidence remains the main challenge.

Table 6: Baseline results for the Drug data lake. Metrics are Passage Recall (\(R_P\)), Table Recall (\(R_T\)), Accuracy (\(A\)), Faithfulness (\(F\)), and Token Count (\(T\); k-tokens/query, as in Table [tbl:tab:rag95results95aiml]). Passage/Table map to Single-source lookups and anchor questions, Passage-Table maps to Cross-source, and Passage-hop/Table-hop map to Multi-hop. token counts are estimated full generation tokens per question (approximate).
2-6 (lr)7-11 (l)12-13 Question Type \(R_P\) \(R_T\) \(A\) \(F\) \(T\) \(R_P\) \(R_T\) \(A\) \(F\) \(T\) \(A\) \(T\)
Passage
Table
Passage-Table
Passage-hop
Table-hop

6.4 Cross-Domain Takeaways↩︎

Across all three lakes, a consistent narrative emerges: high retrieval quality alone does not guarantee correct reasoning. We highlight two major takeaways for future system design:

The Divergence of Discovery vs. Synthesis: By isolating source discovery from synthesis using a controlled context-bundle ablation (App 14), we find that failure modes are strictly domain-dependent. When provided with perfect gold evidence, AI/ML accuracy saturates at 98.7%, proving that the AI/ML lake is purely a discovery bottleneck. Conversely, Drug lake accuracy only reaches 62.5% even with perfect evidence, demonstrating that cross-modal reasoning over dense biomedical tables remains fundamentally broken in LLMs, independent of retrieval performance.

The Compounding Cost and Latency of Agentic Navigation: While standard single-shot RAG cannot natively navigate the relational topologies of the Retail Bank and Drug lakes, agentic loop-based methods (e.g., XMode) introduce a compounding token and temporal overhead. Table 4 shows that the zero-shot baseline uses only ~0.05–0.07 k-tokens per query (~0.06 on average). In contrast, single-shot RAG requires retrieving and processing substantially larger context, increasing token usage to ~0.34–0.49 k-tokens per query. Transitioning to iterative agentic navigation compounds this further. As reflected by the proxy token values in Tables 6 and 5, iterative navigation increases token consumption significantly—in the Retail Bank lake, to roughly 1.00–1.27 k-tokens per query (about 5–8\(\times\) over zero-shot and up to ~3\(\times\) over standard RAG). Beyond token footprint, multi-step retrieval loops incur sequential latency bottlenecks, presenting a practical constraint for real-time operational environments like front-line customer service.

7 Limitations↩︎

Domain Scope and Synthetic Data: LakeQuest evaluates text and tables, excluding dynamic logs and raw audio/visual data (e.g., vision-model caveats rely on text metadata; see App 13). Furthermore, the Retail Bank domain relies on synthetic data for privacy, which may alter real-world noise distributions.

Model Monoculture and Evaluator Bias: Using an LLM to synthesize candidate questions risks introducing distributional bias that favors the generator’s reasoning patterns. We mitigated this via strict human validation. However, evaluating baselines and rubric-based correctness with the same LLM family (GPT-5) used for synthesis introduces a risk of self-preference bias [29], which may overstate measured baseline performance. Future evaluations using independent frontier models will help separate general architectural bottlenecks from model-specific priors.

Factual Redundancy: Data lakes inherently contain redundant facts. Because LakeQuest strictly tracks single-path gold evidence (\(E^*_i\)), systems might retrieve valid alternative provenance. Consequently, our retrieval metric serves as a conservative lower bound.

8 Conclusion↩︎

We introduced LakeQuest, a comprehensive benchmark and reproducible construction framework for grounded question answering over heterogeneous data lakes. Encompassing AI/ML, retail banking, and biomedical domains, the benchmark provides a shared, human-validated evaluation environment that explicitly pairs natural language questions with precise, modality-aware evidence pointers. Through baseline evaluations, we demonstrated that high retrieval quality alone is insufficient; modern retrieve-and-synthesize architectures fail differently across domains, struggling with relation chaining, policy grounding, and multimodal composition. Ultimately, LakeQuest provides the necessary evaluation infrastructure to drive the next generation of reliable, agentic QA systems capable of rigorous discovery and faithful attribution over real-world data lakes.

9 Ethics and Reproducibility Statements↩︎

9.0.0.1 Ethics Statement.

LakeQuest includes retail banking and biomedical QA tasks where hallucinated or weakly grounded answers pose significant real-world risks. Consequently, this benchmark explicitly evaluates Faithfulness alongside accuracy, and human validation ensures that all queries are natively answerable from the retrieved context. However, strong performance on LakeQuest does not constitute an endorsement for the autonomous deployment of these systems in high-stakes, real-world decision pipelines. LakeQuest is intended as a rigorous evaluation resource, not a substitute for domain expertise or human oversight.

For the human validation, we recruited and paid data annotators using the Prolific platform [30], ensuring that research ethics were upheld. We acknowledge that ethical considerations are extremely important for any research involving human subjects, and we have ensured that our research meets the Code of Ethics for COLM 2026. Our research plan was reviewed and approved by the ethics review board at our institution. In addition, we took steps to ensure research ethics including: reviewing our institution’s protocols for ethical research; only showing suitable content to participants; collecting consent from annotators regarding how the data would be collected, used, and retained; and paying all recruits a fair wage above the minimum wage in the jurisdiction of the recruitment platform.

9.0.0.2 Reproducibility Statement

To ensure the full reproducibility of our five-stage dataset construction pipeline and evaluation framework, we release all artifacts associated with this work. The LakeQuest benchmark, including human validation annotations, explicit evidence pointers, and the underlying data lake corpora (subject to their respective licensing), is hosted on Hugging Face Datasets at anonymousurl. Furthermore, our complete codebase—containing the automated generation pipeline, human-annotation UI, and all baseline implementations (RAG, XMode, ReSP) with exact prompts—is detailed in App 11 and will be open-sourced upon publication.

Acknowledgments↩︎

We are grateful to Layer 6 AI at TD and the Vector Institute for their support of this work. This research was also supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC) through Discovery Grant.

10 Detailed Dataset Statistics↩︎

This section provides a granular breakdown of the human validation results across all three data lakes. As described in Sec 3.3, all candidate question-answer pairs generated by the synthesis pipeline underwent rigorous human review. The tables below report the total number of synthesized candidates (Questions) alongside the number of instances that successfully passed three key human-annotation criteria:

  • Correct: The reference answer is factually accurate and logically sound.

  • AIS (Attributable to Identified Sources): The reference answer is strictly entailed by the provided evidence pointers, with no hallucinations or reliance on external knowledge.

  • Answerable: The question provides sufficient context to be answered exclusively using the retrieved data lake artifacts.

Only instances that passed all criteria were included in the final benchmark.

10.1 AI/ML Data Lake Statistics↩︎

Table 7 presents the validation breakdown for the AI/ML repository. In this domain, questions are structurally categorized based on the underlying metadata entities (Model Cards vs. Dataset Cards) and whether the reasoning requires multi-hop entity resolution across the AI/ML graph.

Table 7: Detailed human-annotation results for the AI/ML data lake, categorized by metadata entity types and graph topology.
Question Type Questions Correct AIS Answerable
Model
Dataset
Model-Dataset
Model-hop
Dataset-hop
Total 3935 3750 3687 3578

10.2 Retail Bank Data Lake Statistics↩︎

Table 8 outlines the validation results for the synthetic Retail Bank data lake. Unlike the other domains, Retail Bank QA instances are categorized by operational personas, testing how well models can ground their reasoning in strict policy constraints under different institutional workflows.

Table 8: Detailed human-annotation results for the Retail Bank data lake, categorized by persona-driven operational workflows.
Persona Questions Correct AIS Answerable
Accountant
Auditor
Customer service (CS)
CS manager
Data analyst
Financial Planner
Fraud analyst
Insurance analyst
Salesperson
Total 3312 3047 3003 2964

10.3 Drug Data Lake Statistics↩︎

Table 9 details the validation outcomes for the Drug data lake. The task families here stress cross-modal synthesis, dividing questions based on whether the required evidence resides in unstructured scientific text (Passages), structured biochemical records (Tables), or a combination of both.

Table 9: Detailed human-annotation results for the Drug data lake, categorized by modality-specific reasoning requirements.
Question Type Questions Correct AIS Answerable
Passage
Table
Passage-Table
Passage-hop
Table-hop
Total 3,574 3434 3373 3304

11 Prompt Templates↩︎

This section details the exact prompt templates used for dataset synthesis, LLM-as-a-judge filtering, and baseline evaluation.

11.1 Candidate Synthesis Prompts↩︎

To generate candidate QA pairs, we provided the language model with a sampled evidence subgraph and the following instructions. The system prompt was shared across synthesis settings, while the task prompt was instantiated with minor wording changes depending on whether the evidence subgraph contained a model–dataset pair, multiple related model cards, multiple related dataset cards, or an anchor-plus-positive-plus-distractor setup.

System Instructions:
You are a data scientist working with models and data on huggingface.

Input Context:
{evidence_subgraph}

Task:
I’m going to show you one or more model cards and/or dataset cards. What natural question and answer might you ask that implicitly requires consulting information from the shown evidence subgraph? You should pretend that you cannot see the cards when asking the question (except in the anchored setting, where the anchor card is visible but the supporting and distractor cards are not). If you cannot think of one, then return an empty string. This should be a question that naturally requires consulting information from the provided evidence and should not be a chain of multiple unrelated questions that merely happen to require multiple cards. After the question, provide: (1) a direct answer (short, exact answer), and (2) an explained answer (slightly longer answer with brief justification from the cards). Always answer in the following format:

<question>
<direct_answer>
<explained_answer>

11.2 Baseline Evaluation Prompts: Agentic Tool Use (XMode)↩︎

For our agentic baselines, we framed the data lake navigation as an iterative tool-use task.

Agent Instructions:
You are an AI agent for data lake question answering. Given a user question, iteratively reason over the question, retrieve the top-\(k\) relevant documents from the indexed data lake for the current question or sub-question, and summarize each document with respect to both the original question and the current sub-question. After each retrieval round, decide whether the accumulated evidence is sufficient to answer the original question; if not, propose the next sub-question and continue. We use up to 3 iterations, retrieve \(k=5\) documents per step, and use either similarity search or MMR retrieval. After the final step, generate the answer only from the accumulated evidence.

12 Human Annotation Guidelines and Interface↩︎

To ensure high data quality, annotators were provided with a custom web interface that displayed the generated question, the synthesized answer, and the exact supporting evidence chunks. Annotators were tasked with independently verifying two criteria: Answerability (can the question be answered exclusively using the cited evidence?) and Attribution (is the generated answer completely faithful to the cited text/table?). We emphasize that this task evaluates strict textual entailment and reading comprehension based entirely on the provided evidence, rather than requiring annotators to verify external scientific or financial validity.

Figure 3: Screenshot of the custom validation UI. Annotators are presented with the highlighted evidence constraints and must explicitly accept or reject the instance based on the provided rubrics.
  • Is the answer correct? Mark “Yes” only when the answer matches facts stated in the provided evidence.

  • Does the evidence support the answer? Mark “Yes” only when specific sentences/rows in the provided evidence explicitly support the answer.

  • Any additional comments/thoughts. Add a short note explaining the decision, especially for “No” labels, and reference the relevant evidence span.

  • Use only provided evidence. Do not use outside knowledge; if the answer contradicts the provided evidence, mark it incorrect and unsupported.

13 Extended Case Studies and Error Analysis↩︎

To qualitatively illustrate the quantitative failure modes discussed in Sec 6, we provide representative trace-level examples from the AI/ML and Drug data lakes. The cases below show three recurring error patterns: schema-confusable retrieval, relation chaining failure across closely related model cards, and multimodal metadata composition failure in vision–language datasets.

Table 10: A representative schema-grounding failure in the AI/ML data lake: retrieval finds the right capability class (function calling) but misses the target card’s exact token schema.
Domain AI/ML (Schema-Confusable Retrieval)
Question What prompt format does 0-hero/Matter-0.1-7B use, and which special tokens does it provide for function calling?
Gold Evidence The Matter-0.1-7B card states that the model uses ChatML prompt format; its Function Calling section lists <|begin_func|>, <|end_func|>, <|begin_func_response|>, and <|end_func_response|>.
Gold Answer ChatML prompt format; function-call tokens <|begin_func|> and <|end_func|>; function-response tokens <|begin_func_response|> and <|end_func_response|>.
RAG Predicted Evidence The retriever surfaced schema-similar tool-use models such as meetkai/functionary-medium-v3.1 and meetkai/functionary-small-v3.1, plus unrelated cards, instead of grounding on the target Matter card.
RAG Predicted Answer “Prompt format: ChatML-style. Function-calling special tokens: <|tool_call|> and <|tool_response|>.”
Failure Mode Analysis The retriever found semantically similar function-calling cards, but not the target-specific token schema. The generator then copied the more common tool_call/tool_response convention, yielding a partially correct yet still wrong answer.
Table 11: A relation-chaining failure: the system retrieves locally similar model cards but does not gather the exact sibling set required for accurate cross-card comparison.
Domain AI/ML (Relation Chaining)
Question Among fsicoli’s fine-tuned Whisper models (whisper-small-pt-1000h, whisper-medium-pt-1000h, and whisper-large-v3-pt-1000h), which achieves the lowest WER on the shared evaluation dataset, and what are the WERs for each model?
Gold Evidence The three model cards report WERs of 0.1490 (whisper-small-pt-1000h), 0.1147 (whisper-medium-pt-1000h), and 0.1113 (whisper-large-v3-pt-1000h), all on the same Portuguese speech dataset family.
Gold Answer whisper-large-v3-pt-1000h has the lowest WER (0.1113), followed by whisper-medium-pt-1000h (0.1147) and whisper-small-pt-1000h (0.1490).
RAG Predicted Evidence The retriever pulled neighboring Whisper cards such as fsicoli/whisper-large-v3-pt-cv16 and several unrelated Whisper models, but failed to assemble the three required pt-1000h cards into a single comparison set.
RAG Predicted Answer “I don’t see WERs for fsicoli’s pt-1000h models in the provided context. The only fsicoli metric here is for whisper-large-v3-pt-cv16 with WER \(\approx\) 0.1076.”
Failure Mode Analysis This error is not a pure hallucination; it is a chaining failure. The system retrieved a nearby family member with a very similar identifier, but missed the exact trio needed for cross-card aggregation, so it could not complete the comparison.
Table 12: A multimodal composition failure: the answer depends on jointly grounding license metadata and image-rights caveats across two vision–language dataset cards.
Domain AI/ML (Multimodal Composition)
Question Do FreedomIntelligence/ALLaVA-4V and FreedomIntelligence/ALLaVA-4V-Chinese allow commercial use?
Gold Evidence The ALLaVA-4V dataset card lists license cc-by-nc-4.0; ALLaVA-4V-Chinese lists apache-2.0. The ALLaVA-4V card also states that the authors “do not own right to any image contained within the images.zip file,” requiring users to respect original image copyrights.
Gold Answer No. ALLaVA-4V is non-commercial, while ALLaVA-4V-Chinese is Apache-2.0; moreover, commercial reuse still requires checking the rights of the underlying third-party images.
RAG Predicted Evidence The retriever returned image-generation model cards such as LarryAIDraw/* and svjack/Stable-Diffusion-FineTuned-zh-*, rather than the two ALLaVA dataset cards whose licenses had to be composed.
RAG Predicted Answer “I can’t confirm that from the provided context. If the license is Apache-2.0, MIT, BSD, or CC-BY, commercial use is generally allowed; if it is CC-BY-NC, it is not allowed.”
Failure Mode Analysis The query requires composing metadata from two vision–language dataset cards and incorporating an image-rights caveat. Retrieval drifted toward visually related generative model cards, so the generator defaulted to generic licensing heuristics instead of grounding on the relevant multimodal datasets.
Table 13: Representative Drug failure case from the evidence-provided ablation: the model receives the correct table evidence but still fails to produce the correct answer.
Domain Drug (Evidence-Provided Generation Failure)
Question Which cited reference mentions “Lorazepam”, and does that reference include an ISBN?
Gold Evidence In drugbank-drugs_textbooks, the row with ref-id=T385 has citation “Ghiasi N. and Marwaha R. (2018). Lorazepam” and isbn = NaN (parent_key=DB00186).
Gold Answer T385; it does not include an ISBN (missing / NaN).
LLM Generated Answer “Not determinable from the provided snippets; no citation mentioning ‘Lorazepam’ is shown, so the ISBN status is unknown.”
Failure Mode Analysis In the context-bundle ablation, the model was given the correct evidence chunk (plus four distractor tables), so retrieval was not the bottleneck. The key row was present in context, but the model failed to attend to and extract it, defaulting to an abstention-style response. This is a generation-under-sufficient-evidence failure rather than a retrieval miss.

14 Controlled Context-Bundle Ablation↩︎

We ran a fixed context-bundle ablation on the AI/ML, Retail Bank, and Drug data lakes to reduce retrieval variance and better isolate answer synthesis. In each case, the model was given a fixed evidence bundle containing the gold evidence plus relevant distractors, and we evaluated both a direct answer and a reasoning answer using the same LLM-as-a-judge pipeline as in the main experiments.

Table 14: LLM correctness results for the fixed context-bundle ablation across data lakes.
Data Lake Baseline Avg. Correctness Direct Correctness Reasoning Correctness
AI/ML Context Bundle 0.9875 0.9750
Retail Bank Context Bundle 0.7500 0.7500
Drug Context Bundle 0.6250 0.6000

4pt

The results show a sharp cross-domain difference. On AI/ML, performance is nearly saturated once gold evidence is present; Retail Bank is materially higher but not saturated, while Drug remains lowest under the same setup, indicating that synthesis over heterogeneous evidence remains a substantial challenge; reasoning is equal to or stronger than direct answers across lakes.

15 LLM-as-a-Judge Consistency Analysis↩︎

To assess the stability of our rubric-based LLM-as-a-judge evaluation, we repeated the same AI/ML data lake evaluation three times under an identical setup and report per-question-family correctness in Table 15. The results are highly consistent across runs, with only minor variation across the three repeated tests, suggesting that the judge-based correctness metric is sufficiently stable for the comparative analyses reported in the main paper.

Table 15: Repeated-run LLM correctness on the AI/ML data lake.
Question Type LLM Correctness – Test 1 LLM Correctness – Test 2 LLM Correctness – Test 3
Model 0.250 0.245
Dataset 0.140 0.140
Model-Dataset 0.320 0.320
Model-hop 0.155 0.160
Dataset-hop 0.380 0.375

4pt

16 Retail Bank Data Lake QA Generation Example↩︎

Figure 4 illustrates the end-to-end question-answer synthesis pipeline for the Retail Bank data lake. The process begins by sampling a dense evidence subgraph consisting of a client profile, a transaction ledger, and a governing institutional policy. The generator model is instructed to synthesize a realistic operational query (e.g., a fraud analyst checking a transaction limit) that strictly requires joining facts across all three sampled artifacts. Following generation, the pipeline programmatically filters deictic or ill-formed queries, and an LLM-as-a-judge verifies that the question cannot be answered via parametric memory alone. Finally, the instance undergoes human validation to ensure strict attribution to the highlighted evidence spans.

Figure 4: Example of QA generation for the Retail Bank data lake.

17 Open Source Model Results Ablation↩︎

Table 16: Baseline results for the AI/ML data lake using gpt-oss-20b
2-5 (l)6-7 Question Type \(R\) \(A\) \(F\) \(T\) \(A\) \(T\)
Model
Dataset
Model-Dataset
Model-hop
Dataset-hop
Table 17: Baseline results for the Retail Bank data lake using gpt-oss-20b.
2-6 (lr)7-11 (l)12-13 Persona \(R_T\) \(R_P\) \(A\) \(F\) \(T\) \(R_T\) \(R_P\) \(A\) \(F\) \(T\) \(A\) \(T\)
Accountant
Auditor
Customer service (CS)
CS manager
Data analyst
Financial planner
Fraud analyst
Insurance analyst
Salesperson
Table 18: Baseline results for the Drug data lake using gpt-oss-20b.
2-6 (lr)7-11 (l)12-13 Question Type \(R_P\) \(R_T\) \(A\) \(F\) \(T\) \(R_P\) \(R_T\) \(A\) \(F\) \(T\) \(A\) \(T\)
Passage
Table
Passage-Table
Passage-hop
Table-hop

References↩︎

[1]
P. Rajpurkar, J. Zhang, K. Lopyrev, and P. Liang, SQuAD: 100,000+ questions for machine comprehension of text,” in Proceedings of the 2016 conference on empirical methods in natural language processing, 2016, pp. 2383–2392, doi: 10.18653/v1/D16-1264.
[2]
T. Kwiatkowski et al., Natural Questions: A Benchmark for Question Answering Research,” Transactions of the Association for Computational Linguistics, vol. 7, pp. 452–466, 2019, doi: 10.1162/tacl_a_00276.
[3]
Z. Yang et al., HotpotQA: A dataset for diverse, explainable multi-hop question answering,” in Proceedings of the 2018 conference on empirical methods in natural language processing, 2018, pp. 2369–2380, doi: 10.18653/v1/D18-1259.
[4]
P. S. H. Lewis et al., “Retrieval-augmented generation for knowledge-intensive NLP tasks,” in Advances in neural information processing systems 33, 2020.
[5]
S. Yao et al., ReAct: Synergizing reasoning and acting in language models,” in The eleventh international conference on learning representations, 2023.
[6]
[7]
K. K. Leung et al., “Classifying and addressing the diversity of errors in retrieval-augmented generation systems,” in Proceedings of the 19th conference of the European chapter of the Association for Computational Linguistics (volume 1: Long papers), 2026.
[8]
T. Kojima, S. S. Gu, M. Reid, Y. Matsuo, and Y. Iwasawa, “Large language models are zero-shot reasoners,” in Advances in neural information processing systems 35, 2022.
[9]
F. Nooralahzadeh, Y. Zhang, J. Fürst, and K. Stockinger, “Multi-modal data exploration via language agents,” in Proceedings of the 14th international joint conference on natural language processing and the 4th conference of the asia-pacific chapter of the association for computational linguistics, 2025, pp. 795–813.
[10]
Z. Jiang, M. Sun, L. Liang, and Z. Zhang, “Retrieve, summarize, plan: Advancing multi-hop question answering with an iterative approach,” in Companion proceedings of the ACM on web conference 2025, 2025, pp. 1677–1686, doi: 10.1145/3701716.3716889.
[11]
R. C. Fernandez, Z. Abedjan, F. Koko, G. Yuan, S. Madden, and M. Stonebraker, “Aurum: A data discovery system,” in 2018 IEEE 34th international conference on data engineering (ICDE), 2018, pp. 1001–1012, doi: 10.1109/ICDE.2018.00094.
[12]
G. Fan, J. Wang, Y. Li, D. Zhang, and R. J. Miller, “Semantics-aware dataset discovery from data lakes with contextualized column-based representation learning,” Proceedings of the VLDB Endowment, vol. 16, no. 7, pp. 1726–1739, 2023, doi: 10.14778/3587136.3587146.
[13]
Y. Deng et al., LakeBench: A benchmark for discovering joinable and unionable tables in data lakes,” Proceedings of the VLDB Endowment, vol. 17, no. 8, pp. 1925–1938, 2024, doi: 10.14778/3659437.3659448.
[14]
M. Y. Eltabakh, M. Kunjir, A. K. Elmagarmid, and M. S. Ahmad, “Cross modal data discovery over structured and unstructured data lakes,” Proceedings of the VLDB Endowment, vol. 16, no. 11, pp. 3377–3390, 2023, doi: 10.14778/3611479.3611533.
[15]
W. Chen, H. Zha, Z. Chen, W. Xiong, H. Wang, and W. Y. Wang, HybridQA: A dataset of multi-hop question answering over tabular and textual data,” in Findings of the association for computational linguistics: EMNLP 2020, 2020, pp. 1026–1036, doi: 10.18653/v1/2020.findings-emnlp.91.
[16]
W. Chen, M.-W. Chang, E. Schlinger, W. Y. Wang, and W. W. Cohen, “Open question answering over tables and text,” in 9th international conference on learning representations, ICLR 2021, virtual event, austria, may 3-7, 2021, 2021.
[17]
F. Zhu et al., TAT-QA: A question answering benchmark on a hybrid of tabular and textual content in finance,” in 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), 2021, pp. 3277–3287, doi: 10.18653/v1/2021.acl-long.254.
[18]
A. Talmor et al., MultiModalQA: Complex question answering over text, tables and images,” in 9th international conference on learning representations, 2021.
[19]
G. Izacard and E. Grave, “Leveraging passage retrieval with generative models for open domain question answering,” in Proceedings of the 16th conference of the european chapter of the association for computational linguistics: Main volume, 2021, pp. 874–880, doi: 10.18653/v1/2021.eacl-main.74.
[20]
D. Zhou et al., “Least-to-most prompting enables complex reasoning in large language models,” in The eleventh international conference on learning representations, 2023.
[21]
T. Schick et al., Toolformer: Language Models Can Teach Themselves to Use Tools,” in Advances in neural information processing systems 36, 2023.
[22]
N. Tang et al., “Symphony: Towards trustworthy question answering and verification using RAG over multimodal data lakes,” IEEE Data Engineering Bulletin, vol. 48, no. 4, pp. 135–146, 2024.
[23]
Hugging Face, Accessed 2025-12-01Hugging Face Hub API,” 2025. https://huggingface.co/docs/huggingface_hub/v0.5.1/en/package_reference/hf_api (accessed Mar. 31, 2026).
[24]
C. Knox et al., DrugBank 6.0: the DrugBank Knowledgebase for 2024,” Nucleic Acids Research, vol. 52, no. D1, pp. D1265–D1275, 2024, doi: 10.1093/nar/gkad976.
[25]
E. W. Sayers et al., “Database resources of the National Center for Biotechnology Information in 2026,” Nucleic Acids Research, vol. 54, no. D1, pp. D20–D27, 2026, doi: 10.1093/nar/gkaf1060.
[26]
H. Rashkin et al., “Measuring attribution in natural language generation models,” Computational Linguistics, vol. 49, no. 4, pp. 777–840, 2023, doi: 10.1162/coli_a_00486.
[27]
OpenAI, Version dated August 13, 2025GPT-5 System Card.” https://cdn.openai.com/gpt-5-system-card.pdf, 2025.
[28]
M. Douze et al., The Faiss Library,” IEEE Transactions on Big Data, vol. 12, no. 2, pp. 346–361, 2026, doi: 10.1109/TBDATA.2025.3618474.
[29]
L. Zheng et al., Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena,” in Advances in neural information processing systems 36, 2023.
[30]
Prolific, Accessed 2026-03-31Prolific Recruitment Platform,” 2026. https://www.prolific.com/ (accessed Mar. 31, 2026).

  1. Correspondence to: msolodko@uwaterloo.ca↩︎