BBBruno Barbarioli

Bruno Barbarioli

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Bruno Barbarioli has a total of 277 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Multi-agent Reproducibility Auditing with Verifiable Evidence

    by Bruno Barbarioli, Juan Pablo Aparicio, Abel Brodeur, Ghina Abdul Baki, Luna Fazio, David Valenta

    Reproducibility audits must establish whether published conclusions follow from the underlying data and analysis. We present a multi-agent protocol that links audit findings to source evidence, recorded decisions and human-verifiable checks. Five area auditors examine an article and its deposited materials; author-provided code is optional. A coordinator adjudicates findings, and critics from a second model family challenge the report before gated verification and release. The framework retains confirmed findings, tested negatives and exclusions, making the audit itself inspectable and contestable. An implemented single-agent baseline uses the same sources and evidence standards. Eighteen evaluation quantities assess finding validity, self-correction, compliance, reproducibility and resource use.

  • Open Access

    AI-assisted teams outperform AI-led teams but not human-only teams in assessing research reproducibility in quantitative social science

    by Abel Brodeur, David Valenta, Alexandru Marcoci, Juan P. Aparicio, Derek Mikola, Bruno Barbarioli, Rohan Alexander, Lachlan Deer, Tom Stafford, Lars Vilhuber, et al.

    Large Language Models (LLMs) such as ChatGPT are transforming how scientists conduct and validate research, offering promise as tools to improve scientific reproducibility. However, computational reproducibility and error detection remain expensive and labor-intensive. We experimentally test how collaboration between researchers and LLM assistants influences the reproduction of quantitative social science findings across different levels of AI autonomy. We randomly assigned 288 researchers to 103 teams working under three conditions: human-only, AI-assisted (using ChatGPT as a collaborative tool), or AI-led (ChatGPT operating with minimal human oversight). Teams reproduced published results from leading social science journals, detected coding errors, and proposed robustness checks. Human-only and AI-assisted teams achieved comparable reproduction rates (94% vs. 91%) and performed similarly on most outcomes, except human-only teams identified significantly more major coding errors. Both substantially outperformed AI-led teams, which achieved only a 37% reproduction rate, detected fewer errors across all categories, proposed weaker robustness checks, and required more time. This autonomous approach, however, likely represents only a lower bound of AI capabilities. Despite rapid model advances, expert human judgment currently remains indispensable for reliable empirical verification. While AI assistance did not degrade most outcomes, it provided no measurable advantages and was associated with reduced detection of major errors. However, the 37% autonomous reproduction rate indicates that AI could provide value in settings where scale or cost constraints preclude human review of papers, even though general-purpose LLMs offer no immediate advantages for human-supervised verification.


  • Open Access

    Hierarchical Residual Encoding for Multiresolution Time Series Compression

    by Bruno Barbarioli, Gabriel Mersy, Stavros Sintos, Sanjay Krishnan

    Data compression is a key technique for reducing the cost of data transfer from storage to compute nodes. Increasingly, modern data scales necessitate lossy compression techniques, where exactness is sacrificed for a smaller compressed representation. One challenge in lossy compression is that different applications may have different accuracy demands. Today's compression techniques struggle in this setting either forcing the user to compress at the strictest accuracy demand, or to re-encode the data at multiple resolutions. This paper proposes a simple, but effective multiresolution compression algorithm for time series data, where a single encoding can effectively be decompressed at multiple output resolutions. There are a number of benefits over current state-of-the-art techniques for time series compression. (1) The storage footprint of this encoding is smaller than re-encoding the data at multiple resolutions. (2) Similarly, the compression latency is generally smaller than re-encoding at multiple resolutions. (3) Finally, the decompression latency of our encoding is significantly faster than single encodings at the strictest accuracy demand.