Update README.md
Browse files
README.md
CHANGED
|
@@ -29,5 +29,13 @@ The dataset contains ~1M reasoning steps across 11 domains, where each step is a
|
|
| 29 |
The data is structurally precise but generated via templates; it is most effective when combined with natural CoT datasets (e.g., PRM800k, Math-Shepherd).
|
| 30 |
|
| 31 |
## Citation
|
|
|
|
| 32 |
If you use this dataset, please cite:
|
| 33 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 29 |
The data is structurally precise but generated via templates; it is most effective when combined with natural CoT datasets (e.g., PRM800k, Math-Shepherd).
|
| 30 |
|
| 31 |
## Citation
|
| 32 |
+
|
| 33 |
If you use this dataset, please cite:
|
| 34 |
+
|
| 35 |
+
```bibtex
|
| 36 |
+
@inproceedings{prmsmeetplanning2026,
|
| 37 |
+
title={Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards},
|
| 38 |
+
author={Pisano, Raffaele and Navigli, Roberto},
|
| 39 |
+
booktitle={Proceedings of ACL 2026},
|
| 40 |
+
year={2026}
|
| 41 |
+
}
|