Jun421/GAREN-data

Dataset

GAREN Data

0

6 commits

1 linked in READMEs

updated Sep 4, 2026

See the code

README

GAREN Data

Preprocessed artifacts for GAREN — Group-Aware Adaptive Retrieval for Evidence Navigation, covering all 12 BRIGHT categories. Everything here is derived from BRIGHT (Su et al., 2024).

With this dataset you can run GAREN directly, skipping the group-construction stage (which otherwise needs an 80B model and several hours of summarization).

Contents

PathSizeDescription
corpus/<task>.json2.2 GBChunked corpus, {docno, content} per document
qa_data/<task>.json45 MBQueries with gold_ids, excluded_ids, reasoning
GRAPH/qwen3/graph/<task>/209 MBL0 doc–doc k-NN graph (k=16, Qwen3-Embedding-4B, exact cosine)
GRAPH/qwen3/summary/<task>/1.6 GBL1 communities (Leiden) + LLM group summaries
anchor/<task>/164 MBl0_l1_anchor.json (doc → L1 groups), l1_doc_ids.json (L1 group → docs)
first_stage/bm25/2.2 GBBM25 first-stage retrieval caches (top-1000)

Total: 6.7 GB.

Graph files

Each GRAPH/qwen3/graph/<task>/ holds four files:

edges.u32.np     uint32, (n_docs, k) row-major — neighbour indices
weights.f16.np   float16, (n_docs * k,)        — cosine similarities
docnos.npids     npids.Lookup                  — row index ↔ docno
pt_meta.json     {doc_count, k, ...}

Statistics

TaskDocumentsQueriesL1 groups
biology57,3591035,183
earth_science121,24911611,485
economics50,2201034,561
psychology52,8351014,789
robotics61,9611014,861
stackoverflow107,0811178,136
sustainable_living60,7921085,540
leetcode413,93214240,861
pony7,894112621
aops188,00211116,558
theoremqa_questions188,00219416,558
theoremqa_theorems23,839762,196
Total1,333,1661,384121,349

How it was built

  1. Embeddings — each corpus is encoded with Qwen/Qwen3-Embedding-4B (vLLM pooling).
  2. L0 graph — exact-cosine k-NN (k=16) via faiss.IndexFlatIP after L2 normalization, with self-edges removed.
  3. L1 groups — hierarchical Leiden community detection over the L0 graph (max_cluster_size=20), then one summary per community generated by Qwen/Qwen3-Next-80B-A3B-Instruct-FP8.
  4. Anchors — inverted index mapping every document to the L1 groups that contain it.

Usage

hf download Jun421/GAREN-data --repo-type=dataset --local-dir data/

Then, from the GAREN repository:

bash bash/run_ours.sh

The layout matches the paths the runner scripts expect, so no further moving is needed.

bright
reasoning-intensive-retrieval
reranking
retrieval

Jun421/GAREN-data

Dataset

GAREN Data

0

6 commits

1 linked in READMEs

updated Sep 4, 2026

See the code

README

GAREN Data

Preprocessed artifacts for GAREN — Group-Aware Adaptive Retrieval for Evidence Navigation, covering all 12 BRIGHT categories. Everything here is derived from BRIGHT (Su et al., 2024).

With this dataset you can run GAREN directly, skipping the group-construction stage (which otherwise needs an 80B model and several hours of summarization).

Contents

PathSizeDescription
corpus/<task>.json2.2 GBChunked corpus, {docno, content} per document
qa_data/<task>.json45 MBQueries with gold_ids, excluded_ids, reasoning
GRAPH/qwen3/graph/<task>/209 MBL0 doc–doc k-NN graph (k=16, Qwen3-Embedding-4B, exact cosine)
GRAPH/qwen3/summary/<task>/1.6 GBL1 communities (Leiden) + LLM group summaries
anchor/<task>/164 MBl0_l1_anchor.json (doc → L1 groups), l1_doc_ids.json (L1 group → docs)
first_stage/bm25/2.2 GBBM25 first-stage retrieval caches (top-1000)

Total: 6.7 GB.

Graph files

Each GRAPH/qwen3/graph/<task>/ holds four files:

edges.u32.np     uint32, (n_docs, k) row-major — neighbour indices
weights.f16.np   float16, (n_docs * k,)        — cosine similarities
docnos.npids     npids.Lookup                  — row index ↔ docno
pt_meta.json     {doc_count, k, ...}

Statistics

TaskDocumentsQueriesL1 groups
biology57,3591035,183
earth_science121,24911611,485
economics50,2201034,561
psychology52,8351014,789
robotics61,9611014,861
stackoverflow107,0811178,136
sustainable_living60,7921085,540
leetcode413,93214240,861
pony7,894112621
aops188,00211116,558
theoremqa_questions188,00219416,558
theoremqa_theorems23,839762,196
Total1,333,1661,384121,349

How it was built

  1. Embeddings — each corpus is encoded with Qwen/Qwen3-Embedding-4B (vLLM pooling).
  2. L0 graph — exact-cosine k-NN (k=16) via faiss.IndexFlatIP after L2 normalization, with self-edges removed.
  3. L1 groups — hierarchical Leiden community detection over the L0 graph (max_cluster_size=20), then one summary per community generated by Qwen/Qwen3-Next-80B-A3B-Instruct-FP8.
  4. Anchors — inverted index mapping every document to the L1 groups that contain it.

Usage

hf download Jun421/GAREN-data --repo-type=dataset --local-dir data/

Then, from the GAREN repository:

bash bash/run_ours.sh

The layout matches the paths the runner scripts expect, so no further moving is needed.

bright
reasoning-intensive-retrieval
reranking
retrieval