{
  "meta": {
    "pretty_name": "ArXiv-Math",
    "dataset_id": "evalscope/arxivmath",
    "paper_url": null,
    "tags": [
      "Math",
      "Reasoning"
    ],
    "metrics": [
      {
        "acc": {
          "numeric": true
        }
      }
    ],
    "few_shot_num": 0,
    "eval_split": "train",
    "train_split": "",
    "subset_list": [
      "arxiv/december",
      "arxiv/february",
      "arxiv/january",
      "arxiv/march"
    ],
    "description": "## Overview\n\nArXiv-Math is a benchmark of 103 research-level mathematics problems extracted from arXiv preprints. These problems represent cutting-edge mathematical research and test the ability of language models to reason about advanced mathematical concepts at the frontier of knowledge.\n\n## Task Description\n\n- **Task Type**: Research-Level Mathematics Problem Solving\n- **Input**: Advanced mathematical problem from arXiv papers\n- **Output**: Step-by-step solution with final answer\n- **Difficulty**: Research / graduate level\n\n## Key Features\n\n- 103 problems sourced from arXiv preprints (December 2024 - March 2025)\n- Four monthly subsets: december, february, january, march\n- Covers diverse areas: algebra, combinatorics, analysis, geometry, number theory\n- Problems require deep mathematical reasoning and domain expertise\n- Represents the frontier of mathematical research difficulty\n\n## Evaluation Notes\n\n- Default configuration uses **0-shot** evaluation\n- Answers should be formatted within `\\boxed{}` for proper extraction\n- Numeric accuracy metric with symbolic equivalence checking\n- Results can be broken down by monthly competition subset",
    "prompt_template": "Problem:\n{question}\n\nPlease reason step by step, and put your final answer within \\boxed{{}}.\n",
    "system_prompt": "",
    "few_shot_prompt_template": "",
    "aggregation": "mean",
    "extra_params": {},
    "sandbox_config": {},
    "category": "llm"
  },
  "statistics": {
    "total_samples": 103,
    "subset_stats": [
      {
        "name": "arxiv/december",
        "sample_count": 17,
        "prompt_length_mean": 720.88,
        "prompt_length_min": 256,
        "prompt_length_max": 1392,
        "prompt_length_std": 277.74,
        "target_length_mean": 7.24
      },
      {
        "name": "arxiv/february",
        "sample_count": 32,
        "prompt_length_mean": 573.78,
        "prompt_length_min": 269,
        "prompt_length_max": 1147,
        "prompt_length_std": 216.63,
        "target_length_mean": 11.94
      },
      {
        "name": "arxiv/january",
        "sample_count": 23,
        "prompt_length_mean": 711.17,
        "prompt_length_min": 325,
        "prompt_length_max": 1270,
        "prompt_length_std": 221.28,
        "target_length_mean": 12.35
      },
      {
        "name": "arxiv/march",
        "sample_count": 31,
        "prompt_length_mean": 554.32,
        "prompt_length_min": 224,
        "prompt_length_max": 1213,
        "prompt_length_std": 229.5,
        "target_length_mean": 9.87
      }
    ],
    "prompt_length": {
      "mean": 622.88,
      "min": 224,
      "max": 1392,
      "std": 240.75
    },
    "target_length_mean": 10.63,
    "computed_at": "2026-07-03T16:31:10.357416"
  },
  "sample_example": {
    "data": {
      "input": [
        {
          "id": "c7cbf85d",
          "content": "Problem:\nLet $k$ be a field, let $V$ be a $k$-vector space of dimension $d$, and let $G\\subseteq GL(V)$ be a finite group. Set $r:=\\dim_k (V^*)^G$ and assume $r\\ge 1$. Let $R:=k[V]^G$ be the invariant ring, and write its Hilbert quasi-polynom ... [TRUNCATED 71 chars] ... {d-2}+\\cdots+a_1(n)n+a_0(n),\n\\]\nwhere each $a_i(n)$ is a periodic function of $n$. Compute the sum of the indices $i\\in\\{0,1,\\dots,d-1\\}$ for which $a_i(n)$ is constant.\n\nPlease reason step by step, and put your final answer within \\boxed{}.\n"
        }
      ],
      "target": "\\frac{r(2d-r-1)}{2}",
      "id": 0,
      "group_id": 0,
      "subset_key": "arxiv/december",
      "metadata": {
        "problem_idx": 1,
        "problem_type": [
          ""
        ],
        "source": 2512.00811
      }
    },
    "subset": "arxiv/december",
    "truncated": false
  },
  "readme": {
    "en": "# ArXiv-Math\n\n## Overview\n\nArXiv-Math is a benchmark of 103 research-level mathematics problems extracted from arXiv preprints. These problems represent cutting-edge mathematical research and test the ability of language models to reason about advanced mathematical concepts at the frontier of knowledge.\n\n## Task Description\n\n- **Task Type**: Research-Level Mathematics Problem Solving\n- **Input**: Advanced mathematical problem from arXiv papers\n- **Output**: Step-by-step solution with final answer\n- **Difficulty**: Research / graduate level\n\n## Key Features\n\n- 103 problems sourced from arXiv preprints (December 2024 - March 2025)\n- Four monthly subsets: december, february, january, march\n- Covers diverse areas: algebra, combinatorics, analysis, geometry, number theory\n- Problems require deep mathematical reasoning and domain expertise\n- Represents the frontier of mathematical research difficulty\n\n## Evaluation Notes\n\n- Default configuration uses **0-shot** evaluation\n- Answers should be formatted within `\\boxed{}` for proper extraction\n- Numeric accuracy metric with symbolic equivalence checking\n- Results can be broken down by monthly competition subset\n\n## Properties\n\n| Property | Value |\n|----------|-------|\n| **Benchmark Name** | `arxivmath` |\n| **Dataset ID** | [evalscope/arxivmath](https://modelscope.cn/datasets/evalscope/arxivmath/summary) |\n| **Paper** | N/A |\n| **Tags** | `Math`, `Reasoning` |\n| **Metrics** | `acc` |\n| **Default Shots** | 0-shot |\n| **Evaluation Split** | `train` |\n\n\n## Data Statistics\n\n| Metric | Value |\n|--------|-------|\n| Total Samples | 103 |\n| Prompt Length (Mean) | 622.88 chars |\n| Prompt Length (Min/Max) | 224 / 1392 chars |\n\n**Per-Subset Statistics:**\n\n| Subset | Samples | Prompt Mean | Prompt Min | Prompt Max |\n|--------|---------|-------------|------------|------------|\n| `arxiv/december` | 17 | 720.88 | 256 | 1392 |\n| `arxiv/february` | 32 | 573.78 | 269 | 1147 |\n| `arxiv/january` | 23 | 711.17 | 325 | 1270 |\n| `arxiv/march` | 31 | 554.32 | 224 | 1213 |\n\n## Sample Example\n\n**Subset**: `arxiv/december`\n\n```json\n{\n  \"input\": [\n    {\n      \"id\": \"c7cbf85d\",\n      \"content\": \"Problem:\\nLet $k$ be a field, let $V$ be a $k$-vector space of dimension $d$, and let $G\\\\subseteq GL(V)$ be a finite group. Set $r:=\\\\dim_k (V^*)^G$ and assume $r\\\\ge 1$. Let $R:=k[V]^G$ be the invariant ring, and write its Hilbert quasi-polynom ... [TRUNCATED 71 chars] ... {d-2}+\\\\cdots+a_1(n)n+a_0(n),\\n\\\\]\\nwhere each $a_i(n)$ is a periodic function of $n$. Compute the sum of the indices $i\\\\in\\\\{0,1,\\\\dots,d-1\\\\}$ for which $a_i(n)$ is constant.\\n\\nPlease reason step by step, and put your final answer within \\\\boxed{}.\\n\"\n    }\n  ],\n  \"target\": \"\\\\frac{r(2d-r-1)}{2}\",\n  \"id\": 0,\n  \"group_id\": 0,\n  \"subset_key\": \"arxiv/december\",\n  \"metadata\": {\n    \"problem_idx\": 1,\n    \"problem_type\": [\n      \"\"\n    ],\n    \"source\": 2512.00811\n  }\n}\n```\n\n## Prompt Template\n\n**Prompt Template:**\n```text\nProblem:\n{question}\n\nPlease reason step by step, and put your final answer within \\boxed{{}}.\n\n```\n\n## Usage\n\n### Using CLI\n\n```bash\nevalscope eval \\\n    --model YOUR_MODEL \\\n    --api-url OPENAI_API_COMPAT_URL \\\n    --api-key EMPTY_TOKEN \\\n    --datasets arxivmath \\\n    --limit 10  # Remove this line for formal evaluation\n```\n\n### Using Python\n\n```python\nfrom evalscope import run_task\nfrom evalscope.config import TaskConfig\n\ntask_cfg = TaskConfig(\n    model='YOUR_MODEL',\n    api_url='OPENAI_API_COMPAT_URL',\n    api_key='EMPTY_TOKEN',\n    datasets=['arxivmath'],\n    dataset_args={\n        'arxivmath': {\n            # subset_list: ['arxiv/december', 'arxiv/february', 'arxiv/january']  # optional, evaluate specific subsets\n        }\n    },\n    limit=10,  # Remove this line for formal evaluation\n)\n\nrun_task(task_cfg=task_cfg)\n```\n\n\n",
    "zh": "# ArXiv-Math\n\n## 概述\n\nArXiv-Math 是一个包含 103 道研究级数学问题的基准测试，这些问题均摘自 arXiv 预印本论文。这些问题代表了前沿数学研究，用于评估语言模型在知识前沿对高级数学概念进行推理的能力。\n\n## 任务描述\n\n- **任务类型**：研究级数学问题求解  \n- **输入**：来自 arXiv 论文的高级数学问题  \n- **输出**：分步解答及最终答案  \n- **难度**：研究级 / 研究生水平  \n\n## 主要特点\n\n- 103 道问题来源于 arXiv 预印本（2024 年 12 月至 2025 年 3 月）  \n- 包含四个按月划分的子集：december、february、january、march  \n- 覆盖多个数学领域：代数、组合数学、分析、几何、数论  \n- 问题需要深厚的数学推理能力和领域专业知识  \n- 代表当前数学研究难度的最前沿  \n\n## 评估说明\n\n- 默认配置使用 **0-shot** 评估  \n- 答案应使用 `\\boxed{}` 格式包裹，以便正确提取  \n- 采用数值准确率指标，并结合符号等价性检查  \n- 结果可按每月竞赛子集分别统计  \n\n## 属性\n\n| 属性 | 值 |\n|----------|-------|\n| **基准测试名称** | `arxivmath` |\n| **数据集ID** | [evalscope/arxivmath](https://modelscope.cn/datasets/evalscope/arxivmath/summary) |\n| **论文** | N/A |\n| **标签** | `Math`, `Reasoning` |\n| **指标** | `acc` |\n| **默认示例数** | 0-shot |\n| **评估划分** | `train` |\n\n\n## 数据统计\n\n| 指标 | 值 |\n|--------|-------|\n| 总样本数 | 103 |\n| 提示词长度（平均） | 622.88 字符 |\n| 提示词长度（最小/最大） | 224 / 1392 字符 |\n\n**各子集统计数据：**\n\n| 子集 | 样本数 | 提示词平均长度 | 提示词最小长度 | 提示词最大长度 |\n|--------|---------|-------------|------------|------------|\n| `arxiv/december` | 17 | 720.88 | 256 | 1392 |\n| `arxiv/february` | 32 | 573.78 | 269 | 1147 |\n| `arxiv/january` | 23 | 711.17 | 325 | 1270 |\n| `arxiv/march` | 31 | 554.32 | 224 | 1213 |\n\n## 样例示例\n\n**子集**: `arxiv/december`\n\n```json\n{\n  \"input\": [\n    {\n      \"id\": \"c7cbf85d\",\n      \"content\": \"Problem:\\nLet $k$ be a field, let $V$ be a $k$-vector space of dimension $d$, and let $G\\\\subseteq GL(V)$ be a finite group. Set $r:=\\\\dim_k (V^*)^G$ and assume $r\\\\ge 1$. Let $R:=k[V]^G$ be the invariant ring, and write its Hilbert quasi-polynom ... [TRUNCATED 71 chars] ... {d-2}+\\\\cdots+a_1(n)n+a_0(n),\\n\\\\]\\nwhere each $a_i(n)$ is a periodic function of $n$. Compute the sum of the indices $i\\\\in\\\\{0,1,\\\\dots,d-1\\\\}$ for which $a_i(n)$ is constant.\\n\\nPlease reason step by step, and put your final answer within \\\\boxed{}.\\n\"\n    }\n  ],\n  \"target\": \"\\\\frac{r(2d-r-1)}{2}\",\n  \"id\": 0,\n  \"group_id\": 0,\n  \"subset_key\": \"arxiv/december\",\n  \"metadata\": {\n    \"problem_idx\": 1,\n    \"problem_type\": [\n      \"\"\n    ],\n    \"source\": 2512.00811\n  }\n}\n```\n\n## 提示模板\n\n**提示模板：**\n```text\nProblem:\n{question}\n\nPlease reason step by step, and put your final answer within \\boxed{{}}.\n\n```\n\n## 使用方法\n\n### 使用 CLI\n\n```bash\nevalscope eval \\\n    --model YOUR_MODEL \\\n    --api-url OPENAI_API_COMPAT_URL \\\n    --api-key EMPTY_TOKEN \\\n    --datasets arxivmath \\\n    --limit 10  # 正式评估时请删除此行\n```\n\n### 使用 Python\n\n```python\nfrom evalscope import run_task\nfrom evalscope.config import TaskConfig\n\ntask_cfg = TaskConfig(\n    model='YOUR_MODEL',\n    api_url='OPENAI_API_COMPAT_URL',\n    api_key='EMPTY_TOKEN',\n    datasets=['arxivmath'],\n    dataset_args={\n        'arxivmath': {\n            # subset_list: ['arxiv/december', 'arxiv/february', 'arxiv/january']  # 可选，用于评估特定子集\n        }\n    },\n    limit=10,  # 正式评估时请删除此行\n)\n\nrun_task(task_cfg=task_cfg)\n```",
    "content_hash": "58be919ef115ea9f048f19a5c20f5825",
    "needs_translation": false
  },
  "updated_at": "2026-07-03T16:31:10.439972",
  "translation_updated_at": "2026-07-03T16:31:16"
}