<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="other" dtd-version="1.2" xml:lang="en">
    <front>
        <journal-meta>
            <journal-id journal-id-type="pmc">F1000Research</journal-id>
            <journal-title-group>
                <journal-title>F1000Research</journal-title>
            </journal-title-group>
            <issn pub-type="epub">2046-1402</issn>
            <publisher>
                <publisher-name>F1000 Research Limited</publisher-name>
                <publisher-loc>London, UK</publisher-loc>
            </publisher>
        </journal-meta>
        <article-meta>
            <article-id pub-id-type="doi">10.12688/f1000research.180013.1</article-id>
            <article-categories>
                <subj-group subj-group-type="heading">
                    <subject>Opinion Article</subject>
                </subj-group>
                <subj-group>
                    <subject>Articles</subject>
                </subj-group>
            </article-categories>
            <title-group>
                <article-title>Insights from the SwissRN Computational Reproducibility Hackathon 2025</article-title>
                <fn-group content-type="pub-status">
                    <fn>
                        <p>[version 1; peer review: 1 approved with reservations]</p>
                    </fn>
                </fn-group>
            </title-group>
            <contrib-group>
                <contrib contrib-type="author" corresp="yes">
                    <name>
                        <surname>Willems</surname>
                        <given-names>Tom</given-names>
                    </name>
                    <role content-type="http://credit.niso.org/">Formal Analysis</role>
                    <role content-type="http://credit.niso.org/">Visualization</role>
                    <role content-type="http://credit.niso.org/">Writing &#x2013; Original Draft Preparation</role>
                    <role content-type="http://credit.niso.org/">Writing &#x2013; Review &amp; Editing</role>
                    <uri content-type="orcid">https://orcid.org/0000-0001-9872-0724</uri>
                    <xref ref-type="corresp" rid="c1">a</xref>
                    <xref ref-type="aff" rid="a1">1</xref>
                    <xref ref-type="aff" rid="a2">2</xref>
                </contrib>
                <contrib contrib-type="author" corresp="no">
                    <name>
                        <surname>K&#x00fc;hlwein</surname>
                        <given-names>Tobias</given-names>
                    </name>
                    <role content-type="http://credit.niso.org/">Writing &#x2013; Review &amp; Editing</role>
                    <uri content-type="orcid">https://orcid.org/0009-0001-5778-3910</uri>
                    <xref ref-type="aff" rid="a3">3</xref>
                </contrib>
                <contrib contrib-type="author" corresp="no">
                    <name>
                        <surname>Voigt</surname>
                        <given-names>Matthias</given-names>
                    </name>
                    <role content-type="http://credit.niso.org/">Conceptualization</role>
                    <role content-type="http://credit.niso.org/">Writing &#x2013; Review &amp; Editing</role>
                    <xref ref-type="aff" rid="a3">3</xref>
                </contrib>
                <contrib contrib-type="author" corresp="no">
                    <name>
                        <surname>Kurschilgen</surname>
                        <given-names>Michael</given-names>
                    </name>
                    <role content-type="http://credit.niso.org/">Conceptualization</role>
                    <role content-type="http://credit.niso.org/">Writing &#x2013; Review &amp; Editing</role>
                    <uri content-type="orcid">https://orcid.org/0000-0001-6109-4969</uri>
                    <xref ref-type="aff" rid="a3">3</xref>
                </contrib>
                <contrib contrib-type="author" corresp="no">
                    <name>
                        <surname>J Stekhoven</surname>
                        <given-names>Daniel</given-names>
                    </name>
                    <role content-type="http://credit.niso.org/">Conceptualization</role>
                    <role content-type="http://credit.niso.org/">Formal Analysis</role>
                    <role content-type="http://credit.niso.org/">Writing &#x2013; Original Draft Preparation</role>
                    <role content-type="http://credit.niso.org/">Writing &#x2013; Review &amp; Editing</role>
                    <uri content-type="orcid">https://orcid.org/0000-0003-3163-3161</uri>
                    <xref ref-type="aff" rid="a4">4</xref>
                    <xref ref-type="aff" rid="a5">5</xref>
                </contrib>
                <aff id="a1">
                    <label>1</label>Department of Psychology, University of Zurich, Zurich, 8050, Switzerland</aff>
                <aff id="a2">
                    <label>2</label>Institute of Psychology, University of Bern, Bern, 3012, Switzerland</aff>
                <aff id="a3">
                    <label>3</label>UniDistance Suisse, Brig, 3900, Switzerland</aff>
                <aff id="a4">
                    <label>4</label>NEXUS Personalized Health, ETH Zurich, Zurich, 8092, Switzerland</aff>
                <aff id="a5">
                    <label>5</label>Swiss Institute of Bioinformatics, Lausanne, 1015, Switzerland</aff>
            </contrib-group>
            <author-notes>
                <corresp id="c1">
                    <label>a</label>
                    <email xlink:href="mailto:tomericwillems@pm.me">tomericwillems@pm.me</email>
                </corresp>
                <fn fn-type="conflict">
                    <p>No competing interests were disclosed.</p>
                </fn>
            </author-notes>
            <pub-date pub-type="epub">
                <day>9</day>
                <month>5</month>
                <year>2026</year>
            </pub-date>
            <pub-date pub-type="collection">
                <year>2026</year>
            </pub-date>
            <volume>15</volume>
            <elocation-id>692</elocation-id>
            <history>
                <date date-type="accepted">
                    <day>22</day>
                    <month>4</month>
                    <year>2026</year>
                </date>
            </history>
            <permissions>
                <copyright-statement>Copyright: &#x00a9; 2026 Willems T et al.</copyright-statement>
                <copyright-year>2026</copyright-year>
                <license xlink:href="https://creativecommons.org/licenses/by/4.0/">
                    <license-p>This is an open access article distributed under the terms of the Creative Commons Attribution Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
                </license>
            </permissions>
            <self-uri content-type="pdf" xlink:href="https://f1000research.com/articles/15-692/pdf"/>
            <abstract>
                <p>Computational reproducibility hackathons provide a hands-on opportunity for identifying barriers to reproducible research. The Swiss Reproducibility Network (SwissRN) hosted a Computational Reproducibility Hackathon at UniDistance Suisse in Brig, Switzerland, with participants from diverse scientific disciplines. 19 participants attempted to reproduce five published computational analyses, achieving at least partial success in four cases. Documentation quality, software environments, and data accessibility emerged as the most critical factors for successful reproduction. These findings inform ongoing efforts to develop practical best-practice guidance and training initiatives to improve computational reproducibility across disciplines.</p>
            </abstract>
            <kwd-group kwd-group-type="author">
                <kwd>Reproducibility</kwd>
                <kwd>Hackathon</kwd>
                <kwd>Open Science</kwd>
                <kwd>Metascience</kwd>
                <kwd>Computational Research</kwd>
                <kwd>Software</kwd>
                <kwd>Community Engagement</kwd>
            </kwd-group>
            <funding-group>
                <award-group id="fund-1">
                    <funding-source>NEXUS Personalized Health, ETH Zurich, 8092 Zurich, Switzerland</funding-source>
                </award-group>
                <funding-statement>The author(s) declared that no grants were involved in supporting this work.</funding-statement>
            </funding-group>
        </article-meta>
    </front>
    <body>
        <sec id="sec1" sec-type="intro">
            <title>Introduction</title>
            <p>Reproducibility is fundamental to science because it ensures that research results are transparent and verifiable. Computational reproducibility focuses on the ability to obtain consistent results using the original data and computational steps, essentially testing the robustness of the code and analysis. Within the framework of open science, computational reproducibility is tightly connected to, yet distinct from, the broader concept of replicability, which addresses whether a similar result can be achieved using the same methods with new data.</p>
            <p>At a reproducibility hackathon, the goal is to use the provided data and code, usually from a published article, to determine whether the analysis described by the authors can be repeated with consistent results. Besides confirming that the computations run as intended, this often involves checking compatibility across different operating systems and software versions. The process relies heavily on full access to both data and code, making open sharing essential. For software in particular, clear documentation and adherence to established standards and ontologies are equally important pillars of reproducible work.</p>
            <p>Such hackathons offer excellent hands-on experience, especially for early-career researchers, who can develop good research habits before rigid routines form. Building on the success of the reproducibility hackathon satellite event at the Swiss Reproducibility Conference 2024, an independent hackathon was held at UniDistance Suisse in Brig, Switzerland on June 6, 2025. The event brought together 19 participants representing a vast range of scientific disciplines and eager to strengthen reproducible research practices. In this report, we present key insights that emerged during the event.</p>
        </sec>
        <sec id="sec2" sec-type="results">
            <title>Results</title>
            <p>Details of the reproduction efforts are available on ReproHack Hub (
                <ext-link ext-link-type="uri" xlink:href="https://www.reprohack.org/event/34/">https://www.reprohack.org/event/34/</ext-link>), including the individual reproduction reports. Five original research papers were submitted for the hackathon, with some authors attending and engaging in reproducing work other than their own. The event emphasized a constructive and collaborative atmosphere, focusing on learning opportunities rather than criticism of the paper content. Authors who were present answered questions and provided support during the reproduction attempts.</p>
            <p>Participants came from diverse scientific backgrounds, many were unfamiliar with the specific topics or computational methods involved. Working in groups and having direct access to the authors created a productive and supportive environment that enabled mutual learning for both participants and authors.</p>
            <p>Four of the five submissions were at least partially reproduced (
                <xref ref-type="table" rid="T1">
Table 1</xref>). Participants encountered several common hurdles, including unclear or missing documentation, unspecified software dependencies, and difficulties accessing code or datasets. Differences in hardware setups also contributed to variations in results, complicating replication efforts. One difficulty was the lack of version documentation for packages within the used programs. This led to the inability to reproduce certain aspects as the functionality of packages changed over time. Further, certain individualized variables were only partially explained which made it difficult to understand their exact usage and how to manipulate them. Throughout the event, participants tackled these issues and provided valuable feedback to the original authors. Many challenges appeared solvable by improving or adding metadata and clarifying documentation, while others, such as configuring containerized environments, required more technical expertise. At the end of the day, teams shared their findings and discussed obstacles and potential solutions, fostering a deeper understanding of how reproducibility can be improved in practice.</p>
            <table-wrap id="T1" orientation="portrait" position="float">
                <label>
Table 1. </label>
                <caption>
                    <title>Submissions to reproducibility hackathon.</title>
                    <p>MRS reflects subjective assessments by participants and should be interpreted as indicative rather than definitive.</p>
                </caption>
                <table content-type="article-table" frame="hsides">
                    <thead>
                        <tr>
                            <th align="left" colspan="1" rowspan="1" valign="top">Title</th>
                            <th align="left" colspan="1" rowspan="1" valign="top">
MRS</th>
                            <th align="left" colspan="1" rowspan="1" valign="top">
Reviews</th>
                        </tr>
                    </thead>
                    <tbody>
                        <tr>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">On reduced input-output dynamic mode decomposition
                                <sup>
                                    <xref ref-type="bibr" rid="ref1">1</xref>
                                </sup>
                            </td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">2</td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">1</td>
                        </tr>
                        <tr>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">Bore me (not): boredom impairs recognition memory but not the pupil old/new effect
                                <sup>
                                    <xref ref-type="bibr" rid="ref2">2</xref>
                                </sup>
                            </td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">8</td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">1</td>
                        </tr>
                        <tr>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">Closed-Form Power and Sample Size Calculations for Bayes Factors
                                <sup>
                                    <xref ref-type="bibr" rid="ref3">3</xref>
                                </sup>
                            </td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">8</td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">3</td>
                        </tr>
                        <tr>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">Gender Equity Navigator (GEN)
                                <sup>
                                    <xref ref-type="bibr" rid="ref4">4</xref>
                                </sup>
                            </td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">0</td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">2</td>
                        </tr>
                        <tr>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">Wastewater monitoring of SARS-CoV-2 shows high correlation with COVID-19 case numbers and allowed early detection of the first confirmed B.1.1.529 infection in Switzerland
                                <sup>
                                    <xref ref-type="bibr" rid="ref5">5</xref>
                                </sup>
                            </td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">6</td>
                            <td align="left" colspan="1" rowspan="1" valign="bottom">5</td>
                        </tr>
                    </tbody>
                </table>
            </table-wrap>
            <p>The mean reproducibility score (MRS) shown in 
                <xref ref-type="table" rid="T1">
Table 1</xref> represents the average of all submitted reviews to the question: &#x201c;How much of the paper did you manage to reproduce?&#x201d;, rated on a scale of 0 to 10.</p>
            <p>Participants shared their experiences as shown in 
                <xref ref-type="fig" rid="f1">
Figure 1</xref>, expressing a mix of frustration and engagement throughout the reproduction efforts. Despite the difficulties, there was a clear interest and satisfaction in contributing to the important topic of reproducibility. Many appreciated the group setting and the exchange of perspectives across different levels of expertise.</p>
            <fig fig-type="figure" id="f1" orientation="portrait" position="float">
                <label>
Figure 1. </label>
                <caption>
                    <title>Wordles of terms submitted by participants in the final discussion of the hackathon through an online survey tool.</title>
                    <p>The larger a word appears the more often it was mentioned by participants. The questions were: What were your main emotions during the reproduction attempt? What worked well? What didn&#x2019;t work at all?</p>
                </caption>
                <graphic id="gr1" orientation="portrait" position="float" xlink:href="https://f1000research-files.f1000.com/manuscripts/198581/aaa8f9bd-49c9-4f5a-9f28-452122d2df28_figure1.gif"/>
            </fig>
            <p>Large language models (LLMs), such as ChatGPT, played a helpful role in creating computational environments even for those with limited technical knowledge. Outdated software and package versions proved to be significant obstacles, alongside insufficient documentation. While researchers have limited control over software stability, the responsibility for clear documentation lies with the authors. However, the lack of strong incentives often discourages investment in detailed documentation. LLMs may help ease this burden by improving clarity and readability, although their use should remain cautious and supervised. Participants later emphasized, as reflected in 
                <xref ref-type="fig" rid="f2">
Figure 2</xref>, that effective documentation is one of the most critical factors for successful reproducibility.</p>
            <fig fig-type="figure" id="f2" orientation="portrait" position="float">
                <label>
Figure 2. </label>
                <caption>
                    <title>Summary of participant responses on factors enabling reproducibility.</title>
                </caption>
                <graphic id="gr2" orientation="portrait" position="float" xlink:href="https://f1000research-files.f1000.com/manuscripts/198581/aaa8f9bd-49c9-4f5a-9f28-452122d2df28_figure2.gif"/>
            </fig>
        </sec>
        <sec id="sec3" sec-type="discussion">
            <title>Discussion</title>
            <p>The discussions at the end of the hackathon converged on a shared understanding that computational reproducibility is less a single technical hurdle and more an ecosystem problem, shaped by documentation quality, software evolution, and community norms. While participants encountered a wide range of domain-specific challenges, the obstacles they identified were remarkably consistent across projects and disciplines.</p>
            <p>A central theme was the importance of clear, structured documentation, which participants ranked as the single most important factor when attempting to reproduce computational work. Documentation was repeatedly described as the primary entry point into a project, enabling others to understand assumptions, variable definitions, data preprocessing steps, and expected outputs. Even well-written and logically structured code proved difficult to reuse in the absence of sufficient explanatory context. This aligns with the observation that documentation often determines whether reproduction efforts can begin at all, rather than how efficiently they proceed.</p>
            <p>Closely related to documentation, environment capture and documentation emerged as a top priority in the participant-derived checklist, receiving the highest importance rating (mean 4.4 on a 1&#x2013;5 scale, tied with data accessibility and versioning). Participants emphasized that reproducibility is strongly undermined when software dependencies, package versions, or operating system assumptions are not explicitly recorded. The rapid evolution of scientific software ecosystems means that even relatively recent code may fail to execute without careful environment specification. While researchers cannot fully control external software changes, they can mitigate their impact through explicit version pinning, environment files, and containerized setups.</p>
            <p>Data accessibility and versioning were rated equally important (mean 4.4), reflecting the practical reality that reproduction efforts cannot proceed if datasets are unavailable, poorly documented, or ambiguously versioned. Participants noted that even when data were technically accessible, missing metadata, unclear preprocessing steps, or undocumented transformations created substantial barriers. Persistent identifiers for datasets and clear links between data versions and specific analyses were repeatedly highlighted as good practice.</p>
            <p>Other checklist components (code structure, sharing, and execution (mean 3.9), result provenance and reporting (mean 3.8), and randomness control and determinism (mean 3.3)) were seen as important but secondary. This ordering suggests a pragmatic perspective: reproducibility first depends on being able to run an analysis at all, before finer-grained concerns such as numerical determinism or formal provenance tracking become relevant. Participants also ranked &#x201c;nice code&#x201d; and &#x201c;containers&#x201d; highly when asked about the most important aspects of reproduction, reinforcing the idea that readability, modularity, and standardized execution environments meaningfully lower the barrier for third-party reuse.</p>
            <p>Importantly, these discussions underscored that reproducibility should be approached as a process designed from the outset, rather than a retrospective fix. Participants agreed that early planning &#x2013; such as deciding where code and data will be hosted, how versions will be tracked, and how results will be reported &#x2013; has a disproportionately large impact on downstream reproducibility. Rather than debating optimal tools, participants advocated for clear, well-documented choices that can be understood and reused by others. Support structures, including research software engineers and data stewards, were identified as key enablers, particularly for researchers without formal training in software development.</p>
            <p>Finally, the role of institutional and journal-level policies was discussed. Mandatory data and code sharing requirements were widely acknowledged as having already improved reproducibility standards, although participants noted that compliance alone does not guarantee usability. In this context, lightweight tools, such as checklists, example repositories, and shared templates, were seen as promising mechanisms to translate policy requirements into meaningful practice.</p>
        </sec>
        <sec id="sec4">
            <title>Outlook</title>
            <p>
The SwissRN Computational Reproducibility Hackathon demonstrated that hands-on reproduction efforts can generate not only valuable feedback for individual projects, but also transferable insights into the structural conditions that enable or hinder computational reproducibility. Building on these experiences, a central ambition emerging from this initiative is to move beyond isolated events toward the development of widely accessible, community-driven best practices for computational reproducibility, and to embed these practices sustainably into research training.</p>
            <p>Repeated hackathons conducted across different regions, institutions, and scientific domains, without being fixed to a specific topic, provide a particularly powerful mechanism for identifying generalizable reproducibility principles. By deliberately exposing a wide variety of computational workflows to reproduction attempts, such events allow recurring challenges and effective solutions to surface independently of discipline-specific conventions. At the same time, they naturally reveal topical or methodological special cases, which can be documented as extensions rather than exceptions to a shared core of best practices.</p>
            <p>A key next step is therefore to distill the insights gained from multiple hackathons into a concise, practical best-practice guide for computational reproducibility, grounded in empirical experience rather than abstract recommendations. Participant feedback from this and future events can directly inform the structure of such guidance, prioritizing aspects that have the greatest downstream impact, such as documentation quality, environment capture, and data accessibility, while offering pragmatic advice on code organization, provenance tracking, and randomness control. Making this guidance openly available in modular, reusable formats (e.g., checklists, templates, example repositories) will be essential to ensure broad adoption.</p>
            <p>Beyond documentation, there is a clear opportunity and responsibility to translate these best practices into effective educational offerings, particularly at the undergraduate level and across disciplines. Teaching computational reproducibility early, before ad-hoc habits become entrenched, has the potential to raise baseline standards across entire research communities. Rather than treating reproducibility as an advanced or optional topic, it should be integrated into core curricula wherever computational methods are used.</p>
            <p>To scale such efforts sustainably, we see strong alignment with established training frameworks such as The Carpentries,
                <sup>
                    <xref ref-type="bibr" rid="ref6">6</xref>,
                    <xref ref-type="bibr" rid="ref7">7</xref>
                </sup> emphasizing reusable lesson materials, instructor training, and a &#x201c;teach the teachers&#x201d; model. Casting reproducibility content into this framework would allow best practices to be disseminated efficiently, adapted locally, and maintained collaboratively. In this context, close collaboration with the SwissRN Working Group for Training represents a natural and important next step, ensuring that methodological insights from hackathons are translated into pedagogically sound, high-quality training resources.</p>
            <p>Ultimately, reproducibility hackathons should be understood as catalysts within a larger ecosystem; linking empirical assessment, community knowledge generation, and education. By systematically connecting hackathon-derived insights with open best-practice guidance and scalable training initiatives, SwissRN can contribute to a durable improvement in computational reproducibility across disciplines and career stages.</p>
        </sec>
    </body>
    <back>
        <sec id="sec9" sec-type="data-availability">
            <title>Data availability</title>
            <sec id="sec10">
                <title>Underlying data</title>
                <p>Repository name: Insights from the SwissRN Computational Reproducibility Hackathon 2025. 
                    <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.17605/OSF.IO/3WFSQ">https://doi.org/10.17605/OSF.IO/3WFSQ</ext-link>.
                    <sup>
                        <xref ref-type="bibr" rid="ref8">8</xref>
                    </sup>
                </p>
                <p>The project contains the following underlying data:
                    <list list-type="bullet">
                        <list-item>
                            <label>&#x2022;</label>
                            <p>mentimeter_results.xlsx (raw, unaveraged behavioral data)</p>
                        </list-item>
                        <list-item>
                            <label>&#x2022;</label>
                            <p>create_figs.py (script that uses behavioral data to create figures 1 and 2 for the manuscript</p>
                        </list-item>
                        <list-item>
                            <label>&#x2022;</label>
                            <p>figure1.tiff (figure 1 as it is displayed in this manuscript)</p>
                        </list-item>
                        <list-item>
                            <label>&#x2022;</label>
                            <p>figure2.tiff (figure 2 as it is displayed in this manuscript)</p>
                        </list-item>
                    </list>
                </p>
            </sec>
            <sec id="sec11">
                <title>Extended data</title>
                <p>We do not report any extended data.</p>
                <p>Data are available under the terms of the 
                    <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License (CC BY 4.0, https://creativecommons.org/licenses/by/4.0/)</ext-link>.</p>
            </sec>
        </sec>
        <ack>
            <title>Acknowledgements</title>
            <p>The authors would like to thank all participants of the hackathon: Meret Hildebrandt, Simon Ruch, Chhavi Sachdeva, Lucia-Manuela Cantonas, Emilie Morgan de Paula, Flora Logoz, Niels Kempkens, Alexandra Lapteva, Nadia Maggetti, Antoine Buetti-Dinh, Ivan Topolsky, Gabe Winter, Viktoriia Apalkova, Rimaite Auguste, Yulia Kulagina, Jelena &#x010c;uklina, Benjamin Dominitz, Tuba Kadriye. The authors would like to thank UniDistance Suisse for hosting the event.</p>
        </ack>
        <ref-list>
            <title>References</title>
            <ref id="ref1">
                <label>1</label>
                <mixed-citation publication-type="journal">
                    <person-group person-group-type="author">

                        <name name-style="western">
                            <surname>Benner</surname>
                            <given-names>P</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Himpe</surname>
                            <given-names>C</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Mitchell</surname>
                            <given-names>T</given-names>
                        </name>
</person-group>:
                    <article-title>On reduced input-output dynamic mode decomposition.</article-title>
                    <source>

                        <italic toggle="yes">Adv Comput Math.</italic>
</source>
                    <year>2018 Dec</year>;<volume>44</volume>(<issue>6</issue>):<fpage>1751</fpage>&#x2013;<lpage>1768</lpage>.
                    <pub-id pub-id-type="doi">10.1007/s10444-018-9592-x</pub-id>
                </mixed-citation>
            </ref>
            <ref id="ref2">
                <label>2</label>
                <mixed-citation publication-type="journal">
                    <person-group person-group-type="author">

                        <name name-style="western">
                            <surname>Lapteva</surname>
                            <given-names>A</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Schnyder</surname>
                            <given-names>S</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Wolff</surname>
                            <given-names>W</given-names>
                        </name>

                        <etal/>
</person-group>:
                    <article-title>Bore me (not): boredom impairs recognition memory but not the pupil old/new effect.</article-title>
                    <source>

                        <italic toggle="yes">Q J Exp Psychol (Hove).</italic>
</source>
                    <year>2025 Mar 13</year>;<volume>17470218251329255</volume>:<fpage>17470218251329255</fpage>.</mixed-citation>
            </ref>
            <ref id="ref3">
                <label>3</label>
                <mixed-citation publication-type="journal">
                    <person-group person-group-type="author">

                        <name name-style="western">
                            <surname>Pawel</surname>
                            <given-names>S</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Held</surname>
                            <given-names>L</given-names>
                        </name>
</person-group>:
                    <article-title>Closed-form power and sample size calculations for Bayes factors.</article-title>
                    <source>

                        <italic toggle="yes">Am Stat.</italic>
</source>
                    <year>2025 Jul 3</year>;<volume>79</volume>(<issue>3</issue>):<fpage>330</fpage>&#x2013;<lpage>344</lpage>.
                    <pub-id pub-id-type="doi">10.1080/00031305.2025.2467919</pub-id>
                </mixed-citation>
            </ref>
            <ref id="ref4">
                <label>4</label>
                <mixed-citation publication-type="book">
                    <source>

                        <italic toggle="yes">gender-equity-navigator.</italic>
</source>
                    <publisher-name>Github</publisher-name>;<year>[cited 2025 Nov 26]</year>.
                    <ext-link ext-link-type="uri" xlink:href="https://github.com/tubakadriye/gender-equity-navigator">Reference Source</ext-link>
                </mixed-citation>
            </ref>
            <ref id="ref5">
                <label>5</label>
                <mixed-citation publication-type="journal">
                    <person-group person-group-type="author">

                        <name name-style="western">
                            <surname>Bagutti</surname>
                            <given-names>C</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Alt Hug</surname>
                            <given-names>M</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Heim</surname>
                            <given-names>P</given-names>
                        </name>

                        <etal/>
</person-group>:
                    <article-title>Wastewater monitoring of SARS-CoV-2 shows high correlation with COVID-19 case numbers and allowed early detection of the first confirmed B.1.1.529 infection in Switzerland: results of an observational surveillance study.</article-title>
                    <source>

                        <italic toggle="yes">Swiss Med Wkly.</italic>
</source>
                    <year>2022 Jun 20</year>;<volume>152</volume>(<issue>2526</issue>):<fpage>w30202</fpage>.</mixed-citation>
            </ref>
            <ref id="ref6">
                <label>6</label>
                <mixed-citation publication-type="journal">
                    <person-group person-group-type="author">

                        <name name-style="western">
                            <surname>Wilson</surname>
                            <given-names>G</given-names>
                        </name>
</person-group>:
                    <article-title>Software Carpentry: lessons learned.</article-title>
                    <source>

                        <italic toggle="yes">F1000Res.</italic>
</source>
                    <year>2014 Feb 19</year>;<volume>3</volume>(<issue>62</issue>):<fpage>62</fpage>.
                    <pub-id pub-id-type="doi">10.12688/f1000research.3-62.v1</pub-id>
                </mixed-citation>
            </ref>
            <ref id="ref7">
                <label>7</label>
                <mixed-citation publication-type="book">
                    <source>

                        <italic toggle="yes">The Carpentries.</italic>
</source>
                    <publisher-name>The Carpentries</publisher-name>;<year>2023 [cited 2026 Apr 10]</year>.
                    <ext-link ext-link-type="uri" xlink:href="https://carpentries.org/">Reference Source</ext-link>
                </mixed-citation>
            </ref>
            <ref id="ref8">
                <label>8</label>
                <mixed-citation publication-type="other">
                    <person-group person-group-type="author">

                        <name name-style="western">
                            <surname>Willems</surname>
                            <given-names>TE</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Stekhoven</surname>
                            <given-names>D</given-names>
                        </name>

                        <name name-style="western">
                            <surname>Kurschilgen</surname>
                            <given-names>M</given-names>
                        </name>

                        <etal/>
</person-group>:
                    <article-title>Insights from the SwissRN Computational Reproducibility Hackathon 2025.</article-title>
                    <source>

                        <italic toggle="yes">OSF.</italic>
</source>
                    <year>2026 [cited 2026 Apr 21]</year>.
                    <pub-id pub-id-type="doi">10.17605/OSF.IO/3WFSQ</pub-id>
                </mixed-citation>
            </ref>
        </ref-list>
    </back>
    <sub-article article-type="reviewer-report" id="report483839">
        <front-stub>
            <article-id pub-id-type="doi">10.5256/f1000research.198581.r483839</article-id>
            <title-group>
                <article-title>Reviewer response for version 1</article-title>
            </title-group>
            <contrib-group>
                <contrib contrib-type="author">
                    <name>
                        <surname>Samuel</surname>
                        <given-names>Sheeba</given-names>
                    </name>
                    <xref ref-type="aff" rid="r483839a1">1</xref>
                    <role>Referee</role>
                    <uri content-type="orcid">https://orcid.org/0000-0002-7981-8504</uri>
                </contrib>
                <aff id="r483839a1">
                    <label>1</label>Chemnitz University of Technology, Chemnitz, Germany</aff>
            </contrib-group>
            <author-notes>
                <fn fn-type="conflict">
                    <p>
                        <bold>Competing interests: </bold>No competing interests were disclosed.</p>
                </fn>
            </author-notes>
            <pub-date pub-type="epub">
                <day>26</day>
                <month>5</month>
                <year>2026</year>
            </pub-date>
            <permissions>
                <copyright-statement>Copyright: &#x00a9; 2026 Samuel S</copyright-statement>
                <copyright-year>2026</copyright-year>
                <license xlink:href="https://creativecommons.org/licenses/by/4.0/">
                    <license-p>This is an open access peer review report distributed under the terms of the Creative Commons Attribution Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
                </license>
            </permissions>
            <related-article ext-link-type="doi" id="relatedArticleReport483839" related-article-type="peer-reviewed-article" xlink:href="10.12688/f1000research.180013.1"/>
            <custom-meta-group>
                <custom-meta>
                    <meta-name>recommendation</meta-name>
                    <meta-value>approve-with-reservations</meta-value>
                </custom-meta>
            </custom-meta-group>
        </front-stub>
        <body>
            <p>This opinion article presents reflections and lessons learned from the SwissRN Computational Reproducibility Hackathon 2025, where participants attempted to reproduce analyses from five published computational studies. The manuscript highlights practical barriers to computational reproducibility, including insufficient documentation, missing environment specifications, and data accessibility challenges. The paper also discusses the educational and community-building value of reproducibility hackathons and proposes future directions for training and best-practice development.</p>
            <p> </p>
            <p> Strengths:</p>
            <p> * The manuscript is clearly written and accessible to a broad interdisciplinary audience.&#x00a0;</p>
            <p> * The practical insights derived from hands-on reproduction attempts are valuable and potentially useful for researchers, institutions, and reproducibility initiatives.</p>
            <p> </p>
            <p> </p>
            <p> Weakness:</p>
            <p> * The manuscript does not provide sufficient methodological information about how reproduction attempts were evaluated. For example: How were participants assigned to projects?</p>
            <p> Were standardized evaluation criteria used?, How was the Mean Reproducibility Score (MRS) aggregated and interpreted?, What constituted &#x201c;partial reproduction&#x201d;?</p>
            <p> * Only five papers were included, limiting the strength of broader conclusions. While this is acknowledged implicitly, the limitations should be discussed more explicitly.</p>
            <p> * The article is primarily descriptive. Although appropriate for an opinion piece, the discussion could be strengthened by deeper synthesis or comparison with existing reproducibility literature and prior ReproHack initiatives and see if things have changed.</p>
            <p> * Some original authors attended the hackathon and supported reproduction attempts. While this likely improved the learning experience, it may also have influenced reproducibility outcomes. This potential bias should be acknowledged more explicitly.</p>
            <p> * The discussion of large language models is interesting but underdeveloped. The authors mention benefits and caution but do not elaborate on specific use cases, risks, or limitations. The authors should clarify: what kinds of reproducibility tasks LLMs assisted with, where they were beneficial, and what risks or inaccuracies may arise from relying on them.</p>
            <p> * The manuscript provides very limited information about the five reproduced studies beyond their titles and reproducibility scores. Readers cannot assess whether the reported challenges are generalizable because important characteristics of the reproduced papers are missing, including: computational complexity, disciplinary background, scale of the datasets, type of computational workflow, and expected technical difficulty of reproduction.For example, reproducing a statistical analysis in R differs substantially from reproducing a machine learning pipeline or a high-performance computational workflow. Without this context, interpretation of the outcomes remains difficult.</p>
            <p> * The manuscript emphasizes environment capture and containerization as important factors but does not report whether the submitted papers actually included: Docker/Singularity containers, Conda environments, reproducibility manifests, package lock files, CI/CD pipelines, or workflow managers.</p>
            <p> * The article does not specify: which programming languages were used, whether analyses relied on Jupyter notebooks, RMarkdown, standalone scripts, pipelines, or GUIs,</p>
            <p> or whether proprietary software was involved. These details are highly relevant because reproducibility barriers often differ substantially across computational ecosystems.</p>
            <p> * The manuscript mentions that participants came from diverse disciplines, but no information is provided regarding: computational expertise, programming proficiency,</p>
            <p> prior reproducibility experience, or familiarity with the reproduced methods. Since reproducibility outcomes are strongly influenced by user expertise, this information is necessary for interpreting the findings.</p>
            <p> * The manuscript does not explain how papers were assigned to participants or groups. It is unclear whether: participants self-selected projects, assignments were randomized,</p>
            <p> expertise matching was considered, or group sizes differed across projects.</p>
            <p> * The paper does not discuss whether participants used existing reproducibility-support tools.</p>
            <p> * Consider discussing whether barriers differed between notebook-based workflows, script-based analyses, statistical pipelines, or more complex computational infrastructures.</p>
            <p> * Figures 1 and 2 are referenced briefly, but the manuscript provides limited interpretation of the findings shown in these visualizations. How is 'nice code' defined? What does 'careful language' mean in this context?</p>
            <p> * A brief description of the ReproHack Hub platform may help readers unfamiliar with it.</p>
            <p> </p>
            <p> </p>
            <p> </p>
            <p>Is the topic of the opinion article discussed accurately in the context of the current literature?</p>
            <p>Partly</p>
            <p>Are arguments sufficiently supported by evidence from the published literature?</p>
            <p>No</p>
            <p>Are all factual statements correct and adequately supported by citations?</p>
            <p>No</p>
            <p>Are the conclusions drawn balanced and justified on the basis of the presented arguments?</p>
            <p>Yes</p>
            <p>Reviewer Expertise:</p>
            <p>Computational Reproducibility, Knowledge Engineering, Data Provenance, Semantic Web, Data Management</p>
            <p>I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above.</p>
        </body>
    </sub-article>
</article>
