---
title: "Massimiliano Pronesti · IBM — author profile and papers"
description: "Massimiliano Pronesti, IBM: 2 papers on Elamur Research (2026), h-index 1 — affiliations, topics, co-authors and who cites them in our library."
canonical: "https://research.elamur.ai/free/en/authors/massimiliano-pronesti/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/massimiliano-pronesti/)

[home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Massimiliano Pronesti

# Massimiliano Pronesti

Massimiliano Pronesti has 2 papers in our library, in 2026, most of them on [Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/); often with [Anya Belz](https://md.research.elamur.ai/free/en/authors/anya-belz/), [Yufang Hou](https://md.research.elamur.ai/free/en/authors/yufang-hou/).

2 papers in our library · 2026

[OpenAlex](https://openalex.org/A5117862655) · [**h-index 1**](https://openalex.org/authors/A5117862655) · [20 works](https://openalex.org/works?filter=author.id:A5117862655) · [2 citations](https://openalex.org/works?filter=author.id:A5117862655&sort=cited_by_count:desc) OpenAlex, 2026-10-14

[📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/massimiliano-pronesti/#papers) · [🔗 Cited 2 times in our library](https://md.research.elamur.ai/free/en/authors/massimiliano-pronesti/cited-by/) · [⭐ Paper Stars ranking: #11208](https://md.research.elamur.ai/free/en/paper-stars/page/113/#star-11208)

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Massimiliano+Pronesti) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Massimiliano+Pronesti) · [dblp](https://dblp.org/search?q=Massimiliano+Pronesti) · [ACL Anthology](https://aclanthology.org/search/?q=Massimiliano+Pronesti)

## Affiliations

[🏢**IBM** Armonk · United States 2024–2026 · 9 papers*current*](https://md.research.elamur.ai/free/en/companies/ibm/) · [🎓**Dublin City University** Dublin · Ireland 2024–2026 · 7 papers*current*](https://md.research.elamur.ai/free/en/universities/dublin-city-university/) · [🏢**IBM** Dublin · Ireland 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/companies/ibm-ireland/) · [🔬**IBM Research - Ireland** Dublin · Ireland 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/labs/ibm-research-ireland/)

From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine.

## Fields, topics and concepts

Of its works in our library, with the number of works on each.

📚 Shelves 8 The field of science this work belongs to (OpenAlex fields).[Artificial Intelligence · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Arts and Humanities · 2 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Language and Linguistics · 2 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · [Biochemistry, Genetics and Molecular Biology · 1 work](https://md.research.elamur.ai/free/en/shelves/biochemistry-genetics-and-molecular-biology/) · [Decision Sciences · 1 work](https://md.research.elamur.ai/free/en/shelves/decision-sciences/) · [Molecular Biology · 1 work](https://md.research.elamur.ai/free/en/shelves/biochemistry-genetics-and-molecular-biology/molecular-biology/) · [Statistics, Probability and Uncertainty · 1 work](https://md.research.elamur.ai/free/en/shelves/decision-sciences/statistics-probability-and-uncertainty/)

🧭 Topics 1 Research subjects and languages the work is about.[Reasoning · 1 work](https://md.research.elamur.ai/free/en/topics/reasoning/)

## Works by year

### 2020s

[**2026** 2 papers](https://md.research.elamur.ai/free/en/authors/massimiliano-pronesti/year/2026/)

## Papers

The most cited first (OpenAlex and our library).

1. **[Beyond Outcome Verification: Verifiable Process Reward Models for Structured Reasoning](https://md.research.elamur.ai/free/en/papers/pronesti-2026-beyond-outcome-verification-verifiable-process/)** *(2026 · 2 citations)* Reinforcement learning with verifiable rewards (RLVR) has improved LLMs on code and mathematics, but it only checks the final answer.
2. **[AutoForest: Automatically Generating Forest Plots from Biomedical Studies with End-to-End Evidence Extraction and Synthesis](https://md.research.elamur.ai/free/en/papers/pronesti-2026-autoforest-automatically-generating-forest-plots/)** *(2026)* Building forest plots for systematic reviews is still slow, piecemeal work. Reviewers read trial reports, settle on the intervention, comparator and outcome, copy numbers by hand, and then enter structured data into tools such as RevMan. AutoForest is presented as the first system to cover this whole chain, starting…

## Co-authors here

2 co-authors with a page, the most papers together first.

- [Anya Belz](https://md.research.elamur.ai/free/en/authors/anya-belz/) ×2
- [Yufang Hou](https://md.research.elamur.ai/free/en/authors/yufang-hou/) ×2

## Venues

Where their works here were published, the most works first, with the editions of those that have a page.

- [Annual Meeting of the Association for Computational Linguistics (ACL)](https://md.research.elamur.ai/free/en/venues/acl/): [ACL 2026](https://md.research.elamur.ai/free/en/venues/acl/2026/)
- [Findings of the Association for Computational Linguistics](https://md.research.elamur.ai/free/en/venues/findings/): [Findings of the Association for Computational Linguistics 2026](https://md.research.elamur.ai/free/en/venues/findings/2026/)

## Cited by

Papers of our library cite their works 2 times (of the 149,439 papers whose bibliographies we read); [1 citing paper with a page here →](https://md.research.elamur.ai/free/en/authors/massimiliano-pronesti/cited-by/).

Updated 1 November 2026
