| { | |
| "key": "aimo-validation-amc", | |
| "title": "AI-MO AIMO validation AMC", | |
| "provider": "huggingface", | |
| "reference": "AI-MO/aimo-validation-amc", | |
| "purpose": [ | |
| "held-out validation", | |
| "easier sanity checks" | |
| ], | |
| "answer_type": "integer answer in [0, 99999]", | |
| "local_artifact": null, | |
| "notes": "Good early warning set before spending Kaggle submissions.", | |
| "split": "train", | |
| "rows": 83, | |
| "columns": [ | |
| "id", | |
| "problem", | |
| "answer", | |
| "url" | |
| ], | |
| "sample": [ | |
| { | |
| "id": 0, | |
| "problem": "$\\frac{m}{n}$ is the Irreducible fraction value of \\[3+\\frac{1}{3+\\frac{1}{3+\\frac13}}\\], what is the value of $m+n$?", | |
| "answer": 142.0, | |
| "url": "https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_1" | |
| }, | |
| { | |
| "id": 1, | |
| "problem": "How many ways are there to split the integers $1$ through $14$ into $7$ pairs such that in each pair, the greater number is at least $2$ times the lesser number?", | |
| "answer": 144.0, | |
| "url": "https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_10" | |
| } | |
| ] | |
| } | |