Complete dataset card: licence, NOTICE, schema, benchmark links, citation

#2
by benchgen - opened
Files changed (2) hide show
  1. NOTICE.md +17 -0
  2. README.md +60 -34
NOTICE.md ADDED
@@ -0,0 +1,17 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ # Notice
2
+
3
+ `rewards.jsonl` contains measurements produced by Benchgen and is released under CC-BY-4.0.
4
+ It contains no question text and no raw model output.
5
+
6
+ Task identifiers refer to rows of upstream public datasets. Those datasets keep their own licences:
7
+
8
+ | Dataset | Licence |
9
+ |---|---|
10
+ | HuggingFaceH4/MATH-500 | MIT (inherited from MATH; the mirror lists no licence field) |
11
+ | TIGER-Lab/MMLU-Pro | MIT |
12
+ | cais/mmlu | MIT |
13
+ | allenai/ai2_arc | CC-BY-SA-4.0 |
14
+ | openai/gsm8k | MIT |
15
+ | opencompass/AIME2025 | MIT |
16
+
17
+ Licences were read from each dataset's Hugging Face metadata on 2026-10-15. Check the upstream page before redistributing.
README.md CHANGED
@@ -1,7 +1,6 @@
1
  ---
2
- license: other
3
- license_name: mixed-upstream
4
- license_link: https://github.com/tahsinsoyak/benchgen-router-dataset
5
  task_categories:
6
  - question-answering
7
  - text-classification
@@ -19,15 +18,13 @@ configs:
19
  data_files: rewards.jsonl
20
  ---
21
 
22
- # BenchGen Router Pilot: per-question agent rewards
23
 
24
- A **routing** dataset: for each question, how every agent in a fixed pool actually performed.
25
- It is the input a model-selection policy trains on — not a question-answering dataset.
26
 
27
- Each row is one task. `mean_reward[i]` is the accuracy of agent `agent_order[i]` over
28
- 3 independent attempts. Ties are preserved explicitly rather than collapsed by `argmax`,
29
- because on easy questions several agents are genuinely equal and pretending otherwise teaches a
30
- router a coin flip.
31
 
32
  ## Contents
33
 
@@ -37,7 +34,15 @@ router a coin flip.
37
  | --- | --- |
38
  | Source | HuggingFaceH4/MATH-500 14, TIGER-Lab/MMLU-Pro 10, allenai/ai2_arc 6, cais/mmlu 10, openai/gsm8k 4, opencompass/AIME2025 2 |
39
  | Domain | knowledge 20, math 20, reasoning 6 |
40
- | Difficulty | easy 9, hard 18, medium 19 |
 
 
 
 
 
 
 
 
41
 
42
  ## The pool
43
 
@@ -49,10 +54,18 @@ router a coin flip.
49
  | 4 | `open_mid` | `mistralai/mistral-nemo` | direct | 0.03 |
50
  | 7 | `open_cheap_reasoning` | `inclusionai/ling-3.0-flash` | reasoning | 0.063 |
51
 
 
52
 
53
- ## Collected but excluded
 
 
 
 
 
54
 
55
- These were collected and are not in this release, because a label we cannot trust is worse than no label.
 
 
56
 
57
  | Source | Why |
58
  | --- | --- |
@@ -60,35 +73,48 @@ These were collected and are not in this release, because a label we cannot trus
60
 
61
  ## What is deliberately not here
62
 
63
- - **No question text.** Upstream licences differ per source: ARC-Challenge is share-alike, and
64
- MMLU-Pro's licence was never verified. `task_id` identifies the upstream row so prompts can be
65
- rehydrated from the original datasets.
66
- - **No raw completions.** Provider terms on republishing model outputs were not cleared. The
67
- routing signal — correctness, ties, empties, errors — survives without them.
68
 
69
  ## Limitations, stated plainly
70
 
71
- - **High tie rate (43/46 tasks).** Most agents solve most of these questions, so the
72
- per-question best agent is often arbitrary. A router trained on this alone learns little; the
73
- dataset is most useful as evidence that routing does not pay on saturated benchmarks.
74
- - **One agent dominates.** `frontier_a` or `frontier_b` is the best agent on almost every
75
- dataset here, so the pool behaves as a ranking rather than a set of specialists. That is a
76
- property of the pool, and no amount of extra data changes it.
77
- - **The pool was hand-picked, not selected by measurement.** Trinity's Appendix A.6 chooses
78
- agents and datasets jointly from a full screening matrix; that screening was skipped for cost.
79
- - **No direct-vs-reasoning contrast.** The intended pair of one base model in both modes was
80
- dropped: every candidate `-thinking` slug ignored `max_tokens` (24k-75k tokens against a 4,096
81
- cap), which breaks protocol comparability.
82
  - **No code domain.** Execution-based grading needs a sandbox that does not exist here.
83
  - **Small.** This is a pilot, sized to a strict budget.
84
 
85
  ## Protocol
86
 
87
- Identical for every agent, because `E(D, M)` is not comparable otherwise: `max_tokens` 4096,
88
- `temperature` 0.1, `top_p` 1.0, minimal reasoning effort, 3 repetitions. Any response
89
- exceeding the token cap aborts collection rather than being recorded, so no row mixes protocols.
90
 
91
  ## Grading
92
 
93
- Answers are extracted by tagged answer, boxed LaTeX, labelled answer, then a last-number
94
- fallback that strips markup first. An empty response is never scored correct.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
  ---
2
+ license: cc-by-4.0
3
+ license_link: https://huggingface.co/datasets/benchgen/router-pilot/blob/main/NOTICE.md
 
4
  task_categories:
5
  - question-answering
6
  - text-classification
 
18
  data_files: rewards.jsonl
19
  ---
20
 
21
+ # Benchgen Router Pilot: per-question agent rewards
22
 
23
+ A **routing** dataset: for each question, how every agent in a fixed pool actually performed. It is the input a model-selection policy trains on, not a question-answering dataset. Published by [Benchgen](https://benchgen.com/?utm_source=huggingface&utm_medium=dataset_card&utm_campaign=router-lite&utm_content=router-pilot-header), the benchmarking infrastructure for AI agents.
 
24
 
25
+ Each row is one task. `mean_reward[i]` is the accuracy of agent `agent_order[i]` over 3 independent attempts. Ties are preserved explicitly rather than collapsed by `argmax`, because on easy questions several agents are genuinely equal and pretending otherwise teaches a router a coin flip.
26
+
27
+ Companion dataset with the prompts: [`benchgen/router-pilot-tasks`](https://huggingface.co/datasets/benchgen/router-pilot-tasks). Join on `task_id`.
 
28
 
29
  ## Contents
30
 
 
34
  | --- | --- |
35
  | Source | HuggingFaceH4/MATH-500 14, TIGER-Lab/MMLU-Pro 10, allenai/ai2_arc 6, cais/mmlu 10, openai/gsm8k 4, opencompass/AIME2025 2 |
36
  | Domain | knowledge 20, math 20, reasoning 6 |
37
+ | Difficulty | easy 9, medium 19, hard 18 |
38
+
39
+ ## Schema (`rewards.jsonl`)
40
+
41
+ | Field | Type | Notes |
42
+ | --- | --- | --- |
43
+ | `task_id` | string | Join key with `benchgen/router-pilot-tasks`, format `{source}/{split}/{index}` |
44
+ | `agent_order` | list of string | The 5 agent ids, in the order used by every array below |
45
+ | `mean_reward` | list of float | Accuracy of each agent over 3 attempts, 0.0 to 1.0 |
46
 
47
  ## The pool
48
 
 
54
  | 4 | `open_mid` | `mistralai/mistral-nemo` | direct | 0.03 |
55
  | 7 | `open_cheap_reasoning` | `inclusionai/ling-3.0-flash` | reasoning | 0.063 |
56
 
57
+ ## Provenance and licence
58
 
59
+ This dataset contains **our own measurements** (graded correctness per agent per task). It contains no question text and no raw model output.
60
+
61
+ | Part | Licence | Note |
62
+ | --- | --- | --- |
63
+ | Reward labels (`rewards.jsonl`) | CC-BY-4.0 | Measurements by Benchgen. Attribute "Benchgen" |
64
+ | Task identity (`task_id`) | n/a | Identifies an upstream row, no upstream text is included |
65
 
66
+ Upstream sources the tasks come from (licence recorded 2026-10-15 from each dataset's Hugging Face metadata): `openbmb/RLPR-Train-Dataset` Apache-2.0 (excluded, see below), `HuggingFaceH4/MATH-500` MIT (inherited from MATH, the mirror lists no licence field), `TIGER-Lab/MMLU-Pro` MIT, `cais/mmlu` MIT, `allenai/ai2_arc` CC-BY-SA-4.0, `openai/gsm8k` MIT, `opencompass/AIME2025` MIT.
67
+
68
+ ## Collected but excluded
69
 
70
  | Source | Why |
71
  | --- | --- |
 
73
 
74
  ## What is deliberately not here
75
 
76
+ - **No question text.** Upstream licences differ per source, and ARC-Challenge is share-alike. `task_id` identifies the upstream row so prompts can be rehydrated from the original datasets.
77
+ - **No raw completions.** Provider terms on republishing model outputs were not cleared. The routing signal (correctness, ties, empties, errors) survives without them.
 
 
 
78
 
79
  ## Limitations, stated plainly
80
 
81
+ - **High tie rate (43 of 46 tasks).** Most agents solve most of these questions, so the per-question best agent is often arbitrary. A router trained on this alone learns little. The dataset is most useful as evidence that routing does not pay on saturated benchmarks.
82
+ - **One agent dominates.** `frontier_a` or `frontier_b` is the best agent on almost every dataset here, so the pool behaves as a ranking rather than a set of specialists. That is a property of the pool, and no amount of extra data changes it.
83
+ - **The pool was hand-picked, not selected by measurement.** Trinity's Appendix A.6 chooses agents and datasets jointly from a full screening matrix. That screening was skipped for cost.
84
+ - **No direct-vs-reasoning contrast.** The intended pair of one base model in both modes was dropped: every candidate `-thinking` slug ignored `max_tokens` (24k to 75k tokens against a 4,096 cap), which breaks protocol comparability.
 
 
 
 
 
 
 
85
  - **No code domain.** Execution-based grading needs a sandbox that does not exist here.
86
  - **Small.** This is a pilot, sized to a strict budget.
87
 
88
  ## Protocol
89
 
90
+ Identical for every agent, because `E(D, M)` is not comparable otherwise: `max_tokens` 4096, `temperature` 0.1, `top_p` 1.0, minimal reasoning effort, 3 repetitions. Any response exceeding the token cap aborts collection rather than being recorded, so no row mixes protocols.
 
 
91
 
92
  ## Grading
93
 
94
+ Answers are extracted by tagged answer, boxed LaTeX, labelled answer, then a last-number fallback that strips markup first. An empty response is never scored correct.
95
+
96
+ ## Run the underlying benchmarks on Benchgen
97
+
98
+ These are the public benchmarks the tasks were drawn from. Each has a page on Benchgen with a leaderboard and evaluations:
99
+
100
+ | Source | Benchgen page |
101
+ | --- | --- |
102
+ | MATH-500 | [benchgen.com/benchmarks/lightman-et-al-openai/math-500](https://benchgen.com/benchmarks/lightman-et-al-openai/math-500?utm_source=huggingface&utm_medium=dataset_card&utm_campaign=router-lite&utm_content=math-500) |
103
+ | MMLU-Pro | [benchgen.com/benchmarks/tiger-ai-lab-university-of-waterloo/mmlu-pro](https://benchgen.com/benchmarks/tiger-ai-lab-university-of-waterloo/mmlu-pro?utm_source=huggingface&utm_medium=dataset_card&utm_campaign=router-lite&utm_content=mmlu-pro) |
104
+ | MMLU | [benchgen.com/benchmarks/hendrycks-et-al/mmlu](https://benchgen.com/benchmarks/hendrycks-et-al/mmlu?utm_source=huggingface&utm_medium=dataset_card&utm_campaign=router-lite&utm_content=mmlu) |
105
+ | GSM8K | [benchgen.com/benchmarks/cobbe-et-al-openai/gsm8k](https://benchgen.com/benchmarks/cobbe-et-al-openai/gsm8k?utm_source=huggingface&utm_medium=dataset_card&utm_campaign=router-lite&utm_content=gsm8k) |
106
+ | ARC-Challenge | [benchgen.com/benchmarks/clark-et-al-allen-institute-for-ai/arc-c](https://benchgen.com/benchmarks/clark-et-al-allen-institute-for-ai/arc-c?utm_source=huggingface&utm_medium=dataset_card&utm_campaign=router-lite&utm_content=arc-c) |
107
+ | AIME 2025 | [benchgen.com/benchmarks/mathematical-association-of-america/aime-2025](https://benchgen.com/benchmarks/mathematical-association-of-america/aime-2025?utm_source=huggingface&utm_medium=dataset_card&utm_campaign=router-lite&utm_content=aime-2025) |
108
+
109
+ To evaluate a router built from this data, see the [Router Fidelity Benchmark](https://benchgen.com/benchmarks/platform/router-fidelity-benchmark?utm_source=huggingface&utm_medium=dataset_card&utm_campaign=router-lite&utm_content=router-fidelity).
110
+
111
+ ## Citation
112
+
113
+ ```bibtex
114
+ @misc{benchgen_router_pilot_2026,
115
+ title = {Benchgen Router Pilot: per-question agent rewards},
116
+ author = {{Benchgen}},
117
+ year = {2026},
118
+ howpublished = {\url{https://huggingface.co/datasets/benchgen/router-pilot}}
119
+ }
120
+ ```