🔥 FIRE 2026 Shared Track

MAST Multilingual Agentic Search Track

Can search agents answer complex questions posed in any language?

MAST is a new shared track at FIRE 2026 that evaluates the performance of multilingual agentic systems (multilingual search & agents) to retrieve evidence & produce correct answers for queries posed on 21 typologically diverse languages.

21 Languages
1,050 Query–Answer Pairs
~100K Documents
📣 News

About MAST

A cross-lingual agentic information retrieval challenge

Agents combined with search tools has demonstrated impressive capabilities on complex fact-seeking benchmarks such as BrowseComp [1]. However, existing search agent benchmarks are mostly in English — leaving the question unanswered: how well do agentic search systems perform when the user's queries are expressed in their potentially native and non-English languages?

MAST benchmark is focused on evaluation of multilingual agentic search systems. In our inaugral 2026 year, we are building on BrowseComp-Plus (ACL 2026) [2], a reproducible & verifiable extension of BrowseComp with 830 challenging English queries with a verified English corpus of ~100,000 web-sourced documents and human judgments. This year, we are translating queries across 15 typologically diverse languages potentially spoken by over 1.6 billion people.

This year's task is cross-lingual: queries are asked in one language, documents & answers are in English, and systems can reason, iteratively search, plan, and synthesize in either language. e.g., a search agent can ask a query in Chinese, use multilingual retriever to retrieve English documents for a given query in Chinese.

Next year, based on the feedback from this year's participants, we plan to extend MAST to use a multilingual corpus and human-written queries in 15+ languages.

🌐
Multilingual Query
e.g., Chinese, Hindi, Swahili…
🤖
Agentic Search System
Iterative retrieval + reasoning
📚
English Document Corpus
~100K BrowseComp-Plus docs
English Answer
Short, verifiable, exact

Two Tracks in 2026

Choose the track that fits your research interest

Track 1

MAST Multilingual

Cross-lingual agentic search in 15 typologically diverse languages

Participating systems receive queries in one of 15 languages spanning high, mid, and low-resource settings. The goal is to retrieve the relevant documents from BrowseComp-Plus corpus and produce a correct, concise answer in English.

🟢 High Resource English · Chinese · French · Russian · Spanish · German
🟡 Mid Resource Finnish · Arabic · Hindi · Bengali · Thai · Urdu · Tamil
🔴 Low Resource Swahili · Welsh
  • 📝 50 queries per language
  • 📚 ~100,000 English BrowseComp-Plus documents
  • 📐 Evaluated on Recall (retrieval) + Answer Accuracy
  • 🔁 Agentic runs (iterative) and retrieval-only both accepted
Track 2

MAST Indic

Deep-research agents for the Indian languages

A dedicated track for Indic languages. MAST Indic focuses on 9 Indic languages, morphologically rich languages, and spoken commonly in India.

🟡 Mid Resource (Indic) Hindi · Bengali · Tamil · Telugu · Kannada · Gujarati
🔴 Low Resource (Indic) Punjabi · Odia · Malayalam
  • 📝 50 queries per language across 9 Indic languages
  • 📚 ~100,000 English BrowseComp-Plus corpus
  • 🖋️ Covers 9 distinct scripts (Devanagari, Bengali, Tamil, Telugu, Kannada, Gujarati, Gurmukhi, Odia, Malayalam)
  • 📐 Evaluated on Recall (retrieval) + Answer Accuracy
  • 🤝 Collaboration with Indian NLP communities

Languages

Track 1 — MAST Multilingual: 15 typologically diverse languages

Language Code Family Regions of Speakers Script Speakers (M) Resource Tier
🟢 High Resource
EnglishenIndo-EuropeanUnited States, United Kingdom, Canada, Australia and globallyLatin1,500+High
ChinesezhSino-TibetanChina, Taiwan, Singapore, MalaysiaHan1,351High
FrenchfrIndo-EuropeanFrance, DR Congo, Canada, Belgium, SwitzerlandLatin332High
RussianruIndo-EuropeanRussia, Belarus, Kazakhstan, Kyrgyzstan, TajikistanCyrillic199High
SpanishesIndo-EuropeanSpain, Mexico, Latin AmericaLatin510High
GermandeIndo-EuropeanGermany, Austria, Switzerland, LiechtensteinLatin133High
🟡 Mid Resource
ArabicarAfro-AsiaticEgypt, Algeria, Saudi Arabia, Iraq, MoroccoArabic375Mid
BengalibnIndo-EuropeanBangladesh, IndiaBengali280Mid
FinnishfiUralicFinland, SwedenLatin6Mid
HindihiIndo-EuropeanIndiaDevanagari584Mid
ThaithKra-DaiThailandThai56Mid
UrduurIndo-EuropeanPakistan, IndiaArabic313Mid
TamiltaDravidianIndia, Sri Lanka, Singapore, MalaysiaTamil91Mid
🔴 Low Resource
SwahiliswNiger-CongoTanzania, Kenya, Uganda, DR CongoLatin194Low
WelshcyIndo-EuropeanWales, ArgentinaLatin0.92Low

Task & Evaluation

What systems must do, and how they are measured

🎯

Multilingual Retrieval & Reasoning

Given a query in a non-English language and the full BrowseComp-Plus corpus, participating systems must retrieve relevant evidence documents In English and produce a short and correct answer in English. Systems can be fully agentic involving open-source or closed-source systems and tools.

📐

Retrieval Evaluation

Every team must submit a list of retrieved document IDs per search turn. We will evaluate Recall against the human-verified relevance labels from BrowseComp-Plus, computed per language and aggregated per resource tier. We also evaluate search efficiency, i.e., the number of search turns required to reach the correct answer.

🧠

Answer Accuracy (EM)

The headline leaderboard metric is Exact Match (EM) accuracy: the system's predicted English Exact Answer is compared against the BrowseComp-Plus ground-truth answer after normalisation, and averaged over languages. An LLM judge — either open-source (e.g., Qwen3-32B) or closed-source (e.g., Opus 5) — is additionally used to adjudicate semantically equivalent answers.

View leaderboard →
📦

Submission Format

Runs are submitted as JSONL files containing reasoning steps, tool calls, retrieved document IDs per search round, and a final output answer. Maximum 3 runs per language per team.

View format spec →

Leaderboard

Official ranking by Exact Match (EM) accuracy on the held-out test queries

Track 1 — MAST Multilingual: 15 typologically diverse languages

# LLM Retriever Type Judge EM Overall ▾ Recall Overall Search Turns Avg.
1 gpt-oss-20b Baseline Qwen3-8B Agentic Opus 5 39.47 54.34 27.79
2 Tongyi-DR-30B Baseline Qwen3-8B Agentic Opus 5 39.07 47.57 26.04
3 DR-Tulu-8B Baseline Qwen3-8B Agentic Opus 5 13.33 24.19 4.77

Per-language results

Language Tier gpt-oss-20b Tongyi-DR-30B DR-Tulu-8B
EM (%)Recall (%)Search Turns EM (%)Recall (%)Search Turns EM (%)Recall (%)Search Turns
English enHigh48.0062.8328.4650.0064.3630.6032.0043.635.00
Chinese zhHigh44.0061.8527.2638.0040.7123.2812.0021.514.72
French frHigh44.0060.0828.1642.0048.9428.1818.0031.944.62
Russian ruHigh44.0060.2928.9836.0051.9326.6618.0030.534.84
Spanish esHigh40.0048.3727.7046.0050.8128.0616.0027.334.62
German deHigh44.0055.6826.0036.0046.6926.1210.0023.974.86
Arabic arMid42.0055.5728.1252.0052.9226.0812.0026.564.56
Bengali bnMid40.0055.1227.9244.0054.7226.7216.0021.824.78
Finnish fiMid34.0051.7728.8834.0050.1629.9214.0023.225.06
Hindi hiMid40.0056.6827.7248.0051.0325.1216.0026.204.82
Thai thMid32.0050.9726.6630.0040.5619.888.0023.854.88
Urdu urMid38.0051.6326.8836.0051.5627.4812.0020.814.60
Tamil taMid42.0056.0029.7046.0048.9425.0610.0021.794.52
Swahili swLow28.0044.9627.1624.0029.8425.282.007.294.92
Welsh cyLow32.0043.3127.2624.0030.3722.104.0012.394.78
Agentic iterative search (snippet only - 512 tokens; five snippets per search) + reasoning

EM and recall are reported as percentages over the held-out test queries; search turns are average search calls per query. Each overall value is the simple average of its per-language values. Teams that submit runs but do not submit a working note may be excluded from the final leaderboard. Where a team submits multiple runs for a language, only the best-scoring eligible run is ranked.

Submission Format

JSONL output format shown below. Example submissions available on GitHub → BrowseComp-Plus.

output.jsonl
JSONL
{
  "query_id": "zh-798",
  "language": "chinese",
  "retriever": "Qwen/Qwen3-Embedding-8B",
  "llm": "Alibaba-NLP/Tongyi-DeepResearch-30B-A3B",
  "tool_call_counts": { "search": 24 },
  "retrieved_docids": [
    ["81120", "10986", "11064", "83777", "9823"],
    ...
    ["81120", ...]  // kth search round
  ],
  "result": [
    {
      "type": "reasoning",
      "tool_name": null,
      "arguments": null,
      "output": "Let me search for information about..."
    },
    {
      "type": "tool_call",
      "tool_name": "search",
      "arguments": "query: \"As of December 2023\" coordinator research group founded in 2009",
      "output": "[{\"docid\": \"81120\", \"score\": 8.43, \"snippet\": \"...\"}]"
    },
    {
      "type": "output_text",
      "tool_name": null,
      "arguments": null,
      "output": "Explanation: I attempted to solve this ... Exact Answer: compassionate pugilist"
    }
  ]
}

No more than 3 output files per language per team. There is no restriction on the language used by the LLM during reasoning; however, direct translation of the original query to English as the only retrieval strategy is discouraged.

How to Submit

Validate offline, then upload through the submission portal.

01

Validate with the CLI

Every file is one language: one JSON object per line covering all 50 official query ids of that language, with the same language, llm and retriever in every record. Check files before uploading with mast-validate; the portal runs exactly the same checks.

terminal
bash
pip install git+https://github.com/mast-benchmark/mast-validate
mast-validate runs/hi.jsonl --track indic
mast-validate runs.zip --track multilingual --json report.json

Exit code 0 is clean, 1 warnings only, 2 errors. Errors block a file; warnings do not, but each one costs score.

02

Upload to the portal

Submit at the MAST 2026 submission portal with your registered team name, the track, and an email address from your registration. Upload one .jsonl (or .jsonl.gz), or one .zip / .tar.gz holding one file per language, named however you like.

One button: the page validates the upload and records every file that passes, then shows one row per language with what happened and a receipt. Files with errors are not recorded; fix them and submit again, and unchanged languages are skipped automatically.

03

Slots and receipts

Three slots per team, track and language. A new run takes the next free slot; when all three are filled, tick replace the oldest run to overwrite the oldest. Every recorded run gets a receipt id and a sha256; keep the receipt, it is your proof of submission and exactly what gets evaluated.

Query ids may be the dataset form ("zh-798") or a bare number such as 798; both are accepted. Deadline: September 15, 2026, 23:59 AoE.

Working Notes

System description papers for FIRE 2026 proceedings

📄

Submission

Each participating team must submit one working note per track describing their system and approach. Working notes are submitted centrally via the FIRE 2026 submission system.

📐

Format

Working notes must follow the CEUR-WS single-column format (ceurart style, as used by the CEUR Workshop Proceedings). Minimum 6 pages, maximum 10 pages, including references. Use descriptive titles — do not include team or track names in the title.

- Overleaf Template (CEUR-WS)

- Examples (FIRE 2025 Working Notes)

✍️

What to Include

  • System description: retriever, LLM, and agentic pipeline
  • Experimental setup and any training/fine-tuning details
  • Per-language and per-resource-tier results
  • Error analysis and qualitative observations
  • Limitations and future directions
📅

Deadlines

  • Sep 15, 2026 — Run submission deadline
  • Sep 30, 2026 — Declaration of results
  • Oct 15, 2026 — Camera-ready copies of working notes due
  • Oct 30, 2026 — Overview paper due

⚠️ Author names should not include prefixes (Dr., Prof., etc.). At least one author per working note must be registered for FIRE 2026. Teams that submit runs but do not submit a working note may be excluded from the final leaderboard.

Schedule

MAST @ FIRE 2026 Tentative Timeline (subject to change)

June 10, 2026
Track website opens · Registration begins
August 1, 2026
Test data released for all languages
September 15, 2026
Run submission deadline
September 30, 2026
Declaration of results · Public leaderboard
October 15, 2026
Camera-ready copies of working notes due
October 30, 2026
Overview paper due

How to Participate

Three steps to join MAST

01

Register

Fill in the registration form with your team name, member names, affiliations, and the language(s) you plan to participate in. Teams are limited to 4 members.

Register →
02

Download Data

Access the released test queries and the English document corpus through the MAST Hugging Face organization. Baseline retrieval runs will be provided.

Multilingual Queries → Indic Queries → Documents →
03

Submit Runs

Validate your JSONL files with mast-validate, then upload up to 3 runs per language through the submission portal before September 15, 2026. Submit a working note describing your system and approach (6–10 pages including references, CEUR-WS format).

How to submit →

Stay Connected

Register for MAST 2026

Registration is free and open to academic groups, industry labs, and individual researchers. After registering, you will be added to the track mailing list and Slack workspace.

  • ✔ Access to all released data and baselines
  • ✔ Track announcements and updates
  • ✔ Eligibility to submit runs and working notes
  • ✔ Invitation to the FIRE 2026 results session
Register via Google Forms →

Registration closes September 15th, 2026.

Organizers

Nandan Thakur
Postdoctoral Researcher
Microsoft Research India

Lead of BEIR and MIRACL. Co-organizer of TREC-RAG 2024 & 2025.

Crystina Zhang
PhD Candidate
University of Waterloo

Lead of Mr. TyDi and MIRACL. Co-organizer of CIRAL @ FIRE 2023.

Sahel Sharifymoghaddam
PhD Candidate
University of Waterloo

Creator of RankLLM. Co-author of BrowseComp-Plus.

Xueguang Ma
PhD Candidate
University of Waterloo

Creator of RepLLaMA, DRAMA, DSE. Lead of BrowseComp-Plus.

Zijian Chen
Undergraduate Researcher
University of Waterloo

Lead developer of BrowseComp-Plus and AgentIR.

Jimmy Lin
Professor & Cheriton Chair
University of Waterloo

David R. Cheriton Chair in Computer Science.

Related Work & Baselines

Building on a strong foundation