---
title: open-s1
canonical_url: "https://www.modelscope.cn/datasets/knoveleng/open-s1"
md_url: "https://www.modelscope.cn/datasets/knoveleng/open-s1.md"
repository: knoveleng/open-s1
last_updated: 2026-03-18
license: mit
storage_size: "37 MB"
downloads: 983
stars: 0
---

# open-s1

> open-s1 - knoveleng 在 ModelScope 开源的数据集。Dataset Description Repository: knoveleng/open-rs Paper: Reinforcement Learning for Reasoning in Small LLMs: What Works and What Doesn’t

knoveleng/open-s1 是 ModelScope 魔搭社区上的数据集，存储大小 37 MB，采用 mit 许可。

- **Repository**: knoveleng/open-s1
- **License**: mit
- **Storage size**: 37 MB
- **Downloads**: 983
- **Stars**: 0
- **Last updated**: 2026-03-18

Source: https://www.modelscope.cn/datasets/knoveleng/open-s1

---

# Open-S1 Dataset

## Dataset Description
- **Repository**: [knoveleng/open-rs](https://github.com/knoveleng/open-rs)
- **Paper**: [Reinforcement Learning for Reasoning in Small LLMs: What Works and What Doesn’t](https://arxiv.org/abs/2503.16219)

### Summary
The `open-s1` dataset contains 18,615 mathematical reasoning problems, filtered from the [s1K dataset](https://huggingface.co/datasets/simplescaling/s1K). It’s part of the [Open RS](https://github.com/knoveleng/open-rs) project, aimed at enhancing reasoning in small LLMs using reinforcement learning.

## Usage
Load the dataset with the Hugging Face `datasets` library:
```python
from datasets import load_dataset

ds = load_dataset("knoveleng/open-s1")["train"]
print(ds[0])
```

## Dataset Structure

### Data Instance
An example entry:
```json
{
  "problem": "Decide whether there exists a function $f : \\mathbb{Z} \\rightarrow \\mathbb{Z}$ such that for each $k = 0, 1, ..., 1996$ and any integer $m$, the equation $f(x) + kx = m$ has at least one integral solution $x$.",
  "solution": "To determine if such a function \(f : \\mathbb{Z} \\rightarrow \\mathbb{Z}\) exists, consider the equation \(f(x) + kx = m\). Rewrite it as \(f(x) = m - kx\). Define \(x = 1997n + t\), where \(n \\in \\mathbb{Z}\) and \(t = 0, 1, ..., 1996\), covering all integers uniquely. Set \(f(1997n + t) = m - k(1997n + t)\). Verify: \(f(1997n + t) + k(1997n + t) = (m - k(1997n + t)) + k(1997n + t) = m\), which holds for any \(m\). Thus, the function satisfies the condition. Final answer: \( \\boxed{f(1997n + t) = m - k(1997n + t)} \).",
  "answer": "f(1997n + t) = m - k(1997n + t)",
  "source": "AI-MO/NuminaMath-CoT/aops_forum",
  "messages": [
    {
      "content": "Decide whether there exists a function $f : \\mathbb{Z} \\rightarrow \\mathbb{Z}$ such that for each $k = 0, 1, ..., 1996$ and any integer $m$, the equation $f(x) + kx = m$ has at least one integral solution $x$.",
      "role": "user"
    },
    {
      "content": "<think>
Let’s analyze: rewrite \(f(x) + kx = m\) as \(f(x) = m - kx\). Use \(x = 1997n + t\), \(t = 0, ..., 1996\), \(n \\in \\mathbb{Z}\). Define \(f(1997n + t) = m - k(1997n + t)\). Check: \(f(1997n + t) + k(1997n + t) = m - k(1997n + t) + k(1997n + t) = m\). This works for all \(m\), so the answer is \( \\boxed{f(1997n + t) = m - k(1997n + t)} \).
</think>
Final answer: $\\boxed{f(1997n + t) = m - k(1997n + t)}$",
      "role": "assistant"
    }
  ]
}
```

### Data Fields
- **`problem`**: Mathematical question (string).
- **`solution`**: Detailed solution (string).
- **`answer`**: Final answer (string).
- **`source`**: Origin from the s1K dataset (string).
- **`messages`**: List of user/assistant interactions, each with:
  - `content`: Text of the message (string).
  - `role`: Role of the sender, e.g., "user" or "assistant" (string).

## Citation
```bibtex
@inproceedings{
    dang2026reinforcement,
    title={Reinforcement Learning for Reasoning in Small {LLM}s: What Works and What Doesn{\textquoteright}t},
    author={Quy-Anh Dang and Chris Ngo},
    booktitle={Logical and Symbolic Reasoning in Language Models @ AAAI 2026},
    year={2026},
    url={https://openreview.net/forum?id=3pWL6Zxc4A}
}
```
