<?xml version="1.0" encoding="UTF-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xml:lang="en">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>Ten Simple Rules for Reproducible Computational Research</title>
        <author>Geir Kjetil Sandve</author>
        <author>Anton Nekrutenko</author>
        <author>James Taylor</author>
        <author>Eivind Hovig</author>
      </titleStmt>
      <publicationStmt>
        <p>Tag layer of the DHSS Meta-Tagging Project. The article text is reproduced from the
           staged copy named in sourceDesc and is not altered; the tags are held separately in
           standOff so that overlapping and nested spans are preserved.</p>
      </publicationStmt>
      <sourceDesc>
        <bibl>
          <title>Ten Simple Rules for Reproducible Computational Research</title>
          <date>2013</date>
          <publisher>PLoS Computational Biology</publisher>
          <idno type="DOI">10.1371/journal.pcbi.1003285</idno>
          
          <idno type="record">sandve2013-ten-simple-rules-reproducible-computational-research</idno>
          <note type="staged-file">sandve2013-ten-simple-rules-reproducible-computational-research.txt, the project's staged copy</note>
          <note type="text-sha1">6397f5afe9ebff7ca2b3c49ad33026eb56e4f478</note>
          <note type="rights">cc-by</note>
        </bibl>
      </sourceDesc>
    </fileDesc>
    <profileDesc>
      <textClass><keywords><term>scientific-computing</term></keywords></textClass>
      <particDesc>
        <person xml:id="paper"><p>the paper's own words</p></person>
        <person xml:id="tagger"><p>the tag layer; a sentence written by the tagger about the
          paper, always anchored to a quotation but not itself a quotation</p></person>
      </particDesc>
    </profileDesc>
    <revisionDesc>
      <change when="2026-10-06"
              who="build_paper_edition.py">104 spans located by searching the stored text for the quote's exact words, allowing any whitespace between them</change>
    </revisionDesc>
  </teiHeader>
  <standOff>
    <spanGrp type="tags">
      <span xml:id="t0" from="#a7" to="#a8" type="object_of_study" ana="#object_of_study" resp="#paper">practical information-handling and provenance practices for reproducible computational research</span>
      <span xml:id="t1" from="#a1" to="#a2" type="research_question" ana="#research_question" resp="#paper">what minimum habits and technical practices let researchers and peers reproduce computational analyses and trace claims to results</span>
      <span xml:id="t2" from="#a15" to="#a16" type="contribution" ana="#contribution" resp="#paper">presents ten implementable rules covering workflow provenance, automation, environment capture, versioning, intermediates, randomness, plots, layered outputs, claim links, and public access</span>
      <span xml:id="t3" from="#a15" to="#a16" type="claim_type" ana="#claim_type" resp="#paper">method</span>
      <span xml:id="t4" from="#a11" to="#a12" type="phenomenon" ana="#phenomenon" resp="#paper">failure or success in exactly reproducing computational research results</span>
      <span xml:id="t5" from="#a7" to="#a8" type="method" ana="#method" resp="#paper">practice-report<term>practice-report</term></span>
      <span xml:id="t6" from="#a17" to="#a18" type="mechanisms" ana="#mechanisms[0]" resp="#tagger" cert="0.95">Recording the full sequence, software, versions, parameters, and inputs preserves how a result was produced.<term>provenance capture</term></span>
      <span xml:id="t7" from="#a19" to="#a20" type="mechanisms" ana="#mechanisms[1]" resp="#tagger" cert="0.95">Directly executable specifications keep documentation aligned with the analysis actually run.<term>workflow execution</term></span>
      <span xml:id="t8" from="#a21" to="#a22" type="mechanisms" ana="#mechanisms[2]" resp="#tagger" cert="0.95">Commands, scripts, or framework components replace manual edits and make transformations reenactable.<term>automation of data manipulation</term></span>
      <span xml:id="t9" from="#a23" to="#a24" type="mechanisms" ana="#mechanisms[3]" resp="#tagger" cert="0.95">Preserving exact program versions or a full virtual machine protects against software and dependency change.<term>environment archiving</term></span>
      <span xml:id="t10" from="#a27" to="#a28" type="mechanisms" ana="#mechanisms[4]" resp="#tagger" cert="0.95">Systematic code-state history permits recovery of the exact script that produced a result.<term>version control</term></span>
      <span xml:id="t11" from="#a29" to="#a30" type="mechanisms" ana="#mechanisms[5]" resp="#tagger" cert="0.95">Stored intermediate outputs expose discrepancies and localize the step at which reproduction diverges.<term>intermediate checkpointing</term></span>
      <span xml:id="t12" from="#a31" to="#a32" type="mechanisms" ana="#mechanisms[6]" resp="#tagger" cert="0.95">Reusing the same initial random seed yields the same random numbers and exact stochastic results.<term>seed capture</term></span>
      <span xml:id="t13" from="#a33" to="#a34" type="mechanisms" ana="#mechanisms[7]" resp="#tagger" cert="0.95">Stored source and processed values let a figure be modified or interrogated without rerunning the entire analysis.<term>plot-data retention</term></span>
      <span xml:id="t14" from="#a35" to="#a36" type="mechanisms" ana="#mechanisms[8]" resp="#tagger" cert="0.9">Links connect summary values to permanent detailed output for inspection and validation.<term>hierarchical hypertext output</term></span>
      <span xml:id="t15" from="#a41" to="#a42" type="mechanisms" ana="#mechanisms[9]" resp="#tagger" cert="0.95">A path or result identifier embedded with a statement preserves access to its exact support.<term>claim-result linking</term></span>
      <span xml:id="t16" from="#a43" to="#a44" type="mechanisms" ana="#mechanisms[10]" resp="#tagger" cert="0.95">Sharing data, code, versions, parameters, and intermediates makes peer reproduction practically possible.<term>public research packaging</term></span>
      <span xml:id="t17" from="#a1" to="#a2" type="limitations" ana="#limitations[0]" resp="#tagger" cert="0.95">Full replication on independently collected data is often infeasible, motivating the weaker reproducibility standard.</span>
      <span xml:id="t18" from="#a9" to="#a10" type="limitations" ana="#limitations[1]" resp="#tagger" cert="0.95">Publication pressure creates a tradeoff between comprehensive provenance work and releasing results while relevant.</span>
      <span xml:id="t19" from="#a11" to="#a12" type="limitations" ana="#limitations[2]" resp="#tagger" cert="0.95">Even self-reproduction requires care because software versions, parameters, and preprocessing create exponentially many configurations.</span>
      <span xml:id="t20" from="#a7" to="#a8" type="limitations" ana="#limitations[3]" resp="#tagger" cert="0.9">A bare command-line workflow may require every rule to be handled explicitly, while integrated frameworks provide only partial support.</span>
      <span xml:id="t21" from="#a29" to="#a30" type="limitations" ana="#limitations[4]" resp="#tagger" cert="0.95">Storage of every intermediate result may be limited by available space.</span>
      <span xml:id="t22" from="#a21" to="#a22" type="limitations" ana="#limitations[5]" resp="#tagger" cert="0.95">If manual operations cannot be avoided, the approach falls back to documenting modified or moved files and purposes.</span>
      <span xml:id="t23" from="#a1" to="#a2" type="concepts" ana="#concepts[0]" resp="#paper" cert="0.95">replication<term>replication</term></span>
      <span xml:id="t24" from="#a1" to="#a2" type="concepts" ana="#concepts[1]" resp="#paper" cert="0.95">reproducible research<term>reproducible research</term></span>
      <span xml:id="t25" from="#a3" to="#a4" type="concepts" ana="#concepts[2]" resp="#paper" cert="0.95">culture of reproducibility<term>culture of reproducibility</term></span>
      <span xml:id="t26" from="#a15" to="#a16" type="concepts" ana="#concepts[3]" resp="#paper" cert="0.95">computational research<term>computational research</term></span>
      <span xml:id="t27" from="#a17" to="#a18" type="concepts" ana="#concepts[4]" resp="#paper" cert="0.95">analysis workflow<term>analysis workflow</term></span>
      <span xml:id="t28" from="#a17" to="#a18" type="concepts" ana="#concepts[5]" resp="#paper" cert="0.95">sequence of steps<term>sequence of steps</term></span>
      <span xml:id="t29" from="#a17" to="#a18" type="concepts" ana="#concepts[6]" resp="#paper" cert="0.95">critical details<term>critical details</term></span>
      <span xml:id="t30" from="#a17" to="#a18" type="concepts" ana="#concepts[7]" resp="#paper" cert="0.95">name and version of the program<term>name and version of the program</term></span>
      <span xml:id="t31" from="#a17" to="#a18" type="concepts" ana="#concepts[8]" resp="#paper" cert="0.95">exact parameters and inputs<term>exact parameters and inputs</term></span>
      <span xml:id="t32" from="#a19" to="#a20" type="concepts" ana="#concepts[9]" resp="#paper" cert="0.95">executable descriptions<term>executable descriptions</term></span>
      <span xml:id="t33" from="#a19" to="#a20" type="concepts" ana="#concepts[10]" resp="#paper" cert="0.95">shell scripts<term>shell scripts</term></span>
      <span xml:id="t34" from="#a19" to="#a20" type="concepts" ana="#concepts[11]" resp="#paper" cert="0.95">makefiles<term>makefiles</term></span>
      <span xml:id="t35" from="#a21" to="#a22" type="concepts" ana="#concepts[12]" resp="#paper" cert="0.95">manual procedures<term>manual procedures</term></span>
      <span xml:id="t36" from="#a21" to="#a22" type="concepts" ana="#concepts[13]" resp="#paper" cert="0.95">execution of programs<term>execution of programs</term></span>
      <span xml:id="t37" from="#a23" to="#a24" type="concepts" ana="#concepts[14]" resp="#paper" cert="0.95">exact versions of programs<term>exact versions of programs</term></span>
      <span xml:id="t38" from="#a23" to="#a24" type="concepts" ana="#concepts[15]" resp="#paper" cert="0.9">virtual machine image<term>virtual machine image</term></span>
      <span xml:id="t39" from="#a27" to="#a28" type="concepts" ana="#concepts[16]" resp="#paper" cert="0.95">version control system<term>version control system</term></span>
      <span xml:id="t40" from="#a25" to="#a26" type="concepts" ana="#concepts[17]" resp="#paper" cert="0.95">code state<term>code state</term></span>
      <span xml:id="t41" from="#a29" to="#a30" type="concepts" ana="#concepts[18]" resp="#paper" cert="0.95">intermediate results<term>intermediate results</term></span>
      <span xml:id="t42" from="#a29" to="#a30" type="concepts" ana="#concepts[19]" resp="#paper" cert="0.95">standardized formats<term>standardized formats</term></span>
      <span xml:id="t43" from="#a31" to="#a32" type="concepts" ana="#concepts[20]" resp="#paper" cert="0.95">random seed<term>random seed</term></span>
      <span xml:id="t44" from="#a33" to="#a34" type="concepts" ana="#concepts[21]" resp="#paper" cert="0.95">raw data<term>raw data</term></span>
      <span xml:id="t45" from="#a33" to="#a34" type="concepts" ana="#concepts[22]" resp="#paper" cert="0.95">processed values<term>processed values</term></span>
      <span xml:id="t46" from="#a35" to="#a36" type="concepts" ana="#concepts[23]" resp="#paper" cert="0.95">hierarchical analysis output<note>about this quote: THE TERM IS NOT IN THE QUOTE - the term is the rule the quote sits under (&#x27;Rule 8: Generate Hierarchical Analysis Output, Allowing Layers of Increasing Detail to Be Inspected&#x27;).</note><term>hierarchical analysis output</term></span>
      <span xml:id="t47" from="#a35" to="#a36" type="concepts" ana="#concepts[24]" resp="#paper" cert="0.95">summarized results<term>summarized results</term></span>
      <span xml:id="t48" from="#a39" to="#a40" type="concepts" ana="#concepts[25]" resp="#paper" cert="0.95">textual statements<term>textual statements</term></span>
      <span xml:id="t49" from="#a39" to="#a40" type="concepts" ana="#concepts[26]" resp="#paper" cert="0.95">underlying results<term>underlying results</term></span>
      <span xml:id="t50" from="#a43" to="#a44" type="concepts" ana="#concepts[27]" resp="#paper" cert="0.95">public access<term>public access</term></span>
      <span xml:id="t51" from="#a43" to="#a44" type="concepts" ana="#concepts[28]" resp="#paper" cert="0.95">input data<term>input data</term></span>
      <span xml:id="t52" from="#a45" to="#a46" type="concepts" ana="#concepts[29]" resp="#paper" cert="0.9">transparency<term>transparency</term></span>
      <span xml:id="t53" from="#a45" to="#a46" type="concepts" ana="#concepts[30]" resp="#paper" cert="0.9">trustworthiness<term>trustworthiness</term></span>
      <span xml:id="t54" from="#a11" to="#a12" type="concepts" ana="#concepts[31]" resp="#paper" cert="0.9">reproduce the results yourself<term>reproduce the results yourself</term></span>
      <span xml:id="t55" from="#a1" to="#a2" type="unhoused_relations" ana="#unhoused_relations[0]" resp="#tagger" cert="0.95">replication → cumulative science<note>Replication is described as the cornerstone of cumulative science. — the relation stated: Replication is the cornerstone of cumulative science.</note></span>
      <span xml:id="t56" from="#a17" to="#a18" type="unhoused_relations" ana="#unhoused_relations[1]" resp="#tagger" cert="0.95">sequence of steps → analysis workflow<note>The authors refer to an automated or manual sequence of steps as an analysis workflow. — the relation stated: A sequence of interrelated analysis steps is called an analysis workflow.</note></span>
      <span xml:id="t57" from="#a5" to="#a6" type="unhoused_relations" ana="#unhoused_relations[2]" resp="#tagger" cert="0.95">lack of reproducibility → individual researcher burden<note>Poor reproducibility creates extra work for the original researcher. — the relation stated: Lack of reproducibility can burden the individual researcher.</note></span>
      <span xml:id="t58" from="#a31" to="#a32" type="unhoused_relations" ana="#unhoused_relations[3]" resp="#tagger" cert="0.95">random seed → exact stochastic result<note>The same seed permits exact reproduction of analyses involving randomness. — the relation stated: Recording and reusing a seed permits identical random sequences.</note></span>
      <span xml:id="t59" from="#a33" to="#a34" type="unhoused_relations" ana="#unhoused_relations[4]" resp="#tagger" cert="0.95">raw data → plot<note>Raw and processed values are retained behind a plot for retrieval and reconstruction. — the relation stated: Stored raw data supports modification and fine-value inspection of figures.</note></span>
      <span xml:id="t60" from="#a39" to="#a40" type="unhoused_relations" ana="#unhoused_relations[5]" resp="#tagger" cert="0.95">textual statements → underlying results<note>Interpretive statements should be connected to the precise results supporting them. — the relation stated: Claims and interpretations require a retrievable connection to their supporting results.</note></span>
      <span xml:id="t61" from="#a45" to="#a46" type="unhoused_relations" ana="#unhoused_relations[6]" resp="#tagger" cert="0.9">peer reproducibility → trustworthiness<note>Making peer reproduction realistic sends a signal of trustworthiness. — the relation stated: Peer reproducibility signals quality, trustworthiness, and transparency.</note></span>
      <span xml:id="t62" from="#a9" to="#a10" type="unhoused_relations" ana="#unhoused_relations[7]" resp="#tagger" cert="0.95">reproducibility practices → publication timing<note>Researchers face a tradeoff between ideal provenance and publishing while work remains relevant. — the relation stated: Reproducibility ideals can compete with deadlines and relevance.</note></span>
      <span xml:id="t63" from="#a7" to="#a8" type="unhoused_relations" ana="#unhoused_relations[8]" resp="#tagger" cert="0.9">integrated framework → ten reproducibility rules<note>Integrated analysis systems may already support some or most of the rules. — the relation stated: Integrated frameworks may provide partial or full procedural support.</note></span>
      <span xml:id="t64" from="#a43" to="#a44" type="unhoused_relations" ana="#unhoused_relations[9]" resp="#tagger" cert="0.95">public access → peer reproducibility<note>Sharing scripts, data, configurations, and results makes peer reproduction practical. — the relation stated: Publicly accessible research materials permit peers to attempt reproduction.</note></span>
      <span xml:id="t65" from="#a19" to="#a20" type="unhoused_relations" ana="#unhoused_relations[10]" resp="#tagger" cert="0.95">shell scripts → executable descriptions<note>Shell scripts are one possible form of directly executable workflow description. — the relation stated: Executable descriptions might take the form of simple shell scripts.</note></span>
      <span xml:id="t66" from="#a19" to="#a20" type="unhoused_relations" ana="#unhoused_relations[11]" resp="#tagger" cert="0.95">makefiles → executable descriptions<note>Makefiles are one possible form of directly executable workflow description. — the relation stated: Executable descriptions might take the form of makefiles.</note></span>
      <span xml:id="t67" from="#a11" to="#a12" type="senses" ana="#senses[0]" resp="#tagger" cert="0.95">reproducibility - minimum standard: the original researcher can repeat an analysis on original data</span>
      <span xml:id="t68" from="#a13" to="#a14" type="senses" ana="#senses[1]" resp="#tagger" cert="0.95">reproducibility - peer standard: others have a practical possibility of reproducing results</span>
      <span xml:id="t69" from="#a13" to="#a14" type="senses" ana="#senses[2]" resp="#tagger" cert="0.9">reproducibility - reuse standard: prior work can be routinely reused for productivity</span>
      <span xml:id="t70" from="#a19" to="#a20" type="senses" ana="#senses[3]" resp="#tagger" cert="0.95">workflow - documented: a manually recorded sequence that may drift from performed analysis</span>
      <span xml:id="t71" from="#a19" to="#a20" type="senses" ana="#senses[4]" resp="#tagger" cert="0.95">workflow - executable: a directly runnable specification synchronized with the analysis</span>
      <span xml:id="t72" from="#a17" to="#a18" type="senses" ana="#senses[5]" resp="#tagger" cert="0.95">result provenance - computational: programs, versions, parameters, inputs, and code states</span>
      <span xml:id="t73" from="#a37" to="#a38" type="senses" ana="#senses[6]" resp="#tagger" cert="0.95">result provenance - interpretive: links between textual statements and supporting outputs</span>
      <span xml:id="t74" from="#a35" to="#a36" type="senses" ana="#senses[7]" resp="#tagger" cert="0.95">analysis output - summary layer: plots and tables used in an article</span>
      <span xml:id="t75" from="#a35" to="#a36" type="senses" ana="#senses[8]" resp="#tagger" cert="0.95">analysis output - detail layer: values underlying summarized results</span>
      <span xml:id="t76" from="#a3" to="#a4" type="claim_relations" ana="#claim_relations[0]" resp="#tagger" cert="0.95">supports → culture of reproducibility in computational science<note>note: The rules operationalize the community-level call for transparent, reproducible published claims.</note></span>
      <span xml:id="t77" from="#a21" to="#a22" type="claim_relations" ana="#claim_relations[1]" resp="#tagger" cert="0.95">critiques → manual data manipulation in computational workflows<note>note: Manual procedures are presented as inefficient, error-prone, and hard to reproduce.</note></span>
      <span xml:id="t78" from="#a7" to="#a8" type="claim_relations" ana="#claim_relations[2]" resp="#tagger" cert="0.9">builds-on → workflow management and integrated analysis frameworks<note>note: Existing frameworks are described as already supporting many of the rules.</note></span>
      <span xml:id="t79" from="#a17" to="#a18" type="concept_edges" ana="#concept_edges[0]" resp="#tagger" cert="0.95">name and version of the program —part-of→ critical details<note>the relation itself is separately evidenced · strength of the relation: 1 · note: Categorical constituent relation. · the relation stated: Critical execution details explicitly include the program name and version.</note><term>name and version of the program</term><term>critical details</term></span>
      <span xml:id="t80" from="#a17" to="#a18" type="concept_edges" ana="#concept_edges[1]" resp="#tagger" cert="0.95">exact parameters and inputs —part-of→ critical details<note>the relation itself is separately evidenced · strength of the relation: 1 · note: Categorical constituent relation. · the relation stated: Critical execution details explicitly include exact parameters and inputs.</note><term>exact parameters and inputs</term><term>critical details</term></span>
      <span xml:id="t81" from="#a21" to="#a22" type="concept_edges" ana="#concept_edges[2]" resp="#tagger" cert="0.95">manual procedures —contrasted-with→ execution of programs<note>the relation itself is separately evidenced · strength of the relation: 0.95 · note: Flat procedural contrast. · the relation stated: Program execution is explicitly recommended instead of manual data manipulation procedures.</note><term>manual procedures</term><term>execution of programs</term></span>
      <span xml:id="t82" from="#a1" to="#a2" type="content_tags" ana="#content_tags.findings[0]" resp="#tagger" cert="0.95">Reproducibility is proposed as an attainable minimum standard when independent full replication is infeasible.</span>
      <span xml:id="t83" from="#a7" to="#a8" type="content_tags" ana="#content_tags.findings[1]" resp="#tagger" cert="0.95">Reproducibility depends on researcher habits as well as enabling technologies.</span>
      <span xml:id="t84" from="#a5" to="#a6" type="content_tags" ana="#content_tags.findings[2]" resp="#tagger" cert="0.9">The authors argue that reproducibility can save time and enable reuse of methods, code, and results.</span>
      <span xml:id="t85" from="#a11" to="#a12" type="content_tags" ana="#content_tags.findings[3]" resp="#tagger" cert="0.95">At minimum, a researcher should be able to reproduce their own result and explain it precisely.</span>
      <span xml:id="t86" from="#a19" to="#a20" type="content_tags" ana="#content_tags.findings[4]" resp="#tagger" cert="0.95">Executable workflow descriptions remain synchronized with performed analyses better than manually maintained documentation.</span>
      <span xml:id="t87" from="#a21" to="#a22" type="content_tags" ana="#content_tags.findings[5]" resp="#tagger" cert="0.95">Manual data manipulation is characterized as inefficient, error-prone, and difficult to reproduce.</span>
      <span xml:id="t88" from="#a23" to="#a24" type="content_tags" ana="#content_tags.findings[6]" resp="#tagger" cert="0.95">Exact program versions, code states, parameters, inputs, and random seeds can be necessary for exact reproduction.</span>
      <span xml:id="t89" from="#a29" to="#a30" type="content_tags" ana="#content_tags.findings[7]" resp="#tagger" cert="0.95">Intermediate results support debugging, parameter comparison, partial reruns, inconsistency localization, and process inspection.</span>
      <span xml:id="t90" from="#a35" to="#a36" type="content_tags" ana="#content_tags.findings[8]" resp="#tagger" cert="0.95">Hierarchical output lets readers move from summarized results to the detailed values beneath them.</span>
      <span xml:id="t91" from="#a37" to="#a38" type="content_tags" ana="#content_tags.findings[9]" resp="#tagger" cert="0.95">Textual scientific claims carry information beyond numerical results but require traceable links to supporting outputs.</span>
      <span xml:id="t92" from="#a43" to="#a44" type="content_tags" ana="#content_tags.findings[10]" resp="#tagger" cert="0.95">The recommended public research package includes input data, scripts, versions, parameters, and intermediate results.</span>
      <span xml:id="t93" from="#a45" to="#a46" type="content_tags" ana="#content_tags.findings[11]" resp="#tagger" cert="0.9">Peer reproducibility is argued to signal quality, trustworthiness, and transparency.</span>
      <span xml:id="t94" from="#a1" to="#a2" type="content_tags" ana="#content_tags.definitions[0]" resp="#tagger" cert="0.95">a minimum standard in which results and protocols permit repetition and extension of analyses on the original data<term>reproducible research</term></span>
      <span xml:id="t95" from="#a17" to="#a18" type="content_tags" ana="#content_tags.definitions[1]" resp="#tagger" cert="0.95">an automated or manual sequence of interrelated commands, scripts, or programs from raw data to a final result<term>analysis workflow</term></span>
      <span xml:id="t96" from="#a19" to="#a20" type="content_tags" ana="#content_tags.definitions[2]" resp="#tagger" cert="0.95">a directly runnable workflow specification such as a shell script, makefile, or stored workflow<term>executable description</term></span>
      <span xml:id="t97" from="#a27" to="#a28" type="content_tags" ana="#content_tags.definitions[3]" resp="#tagger" cert="0.95">a system such as Subversion, Git, or Mercurial that stores code states throughout development<term>version control system</term></span>
      <span xml:id="t98" from="#a35" to="#a36" type="content_tags" ana="#content_tags.definitions[4]" resp="#tagger" cert="0.9">layered output connecting summarized results with inspectable underlying detail<term>hierarchical analysis output</term></span>
      <span xml:id="t99" from="#a17" to="#a18" type="content_tags" ana="#content_tags.variables[1]" resp="#tagger" cert="0.95">parameters and inputs<term>parameters and inputs</term></span>
      <span xml:id="t100" from="#a25" to="#a26" type="content_tags" ana="#content_tags.variables[2]" resp="#tagger" cert="0.95">code state<term>code state</term></span>
      <span xml:id="t101" from="#a31" to="#a32" type="content_tags" ana="#content_tags.variables[3]" resp="#tagger" cert="0.95">random seed<term>random seed</term></span>
      <span xml:id="t102" from="#a33" to="#a34" type="content_tags" ana="#content_tags.variables[4]" resp="#tagger" cert="0.95">raw data<term>raw data</term></span>
      <span xml:id="t103" from="#a29" to="#a30" type="content_tags" ana="#content_tags.variables[5]" resp="#tagger" cert="0.95">intermediate result<term>intermediate result</term></span>
    </spanGrp>
  </standOff>
  <text>
    <body>
        <p><anchor xml:id="a0"/> Ten Simple Rules for Reproducible Computational Research</p>
        <p><anchor xml:id="a1"/>Replication is the cornerstone of a cumulative science [1] . However, new tools and technologies, massive amounts of data, interdisciplinary approaches, and the complexity of the questions being asked are complicating replication efforts, as are increased pressures on scientists to advance their research [2] . As full replication of studies on independently collected data is often not feasible, there has recently been a call for reproducible research as an attainable minimum standard for assessing the value of scientific claims [3] . This requires that papers in experimental science describe the results and provide a sufficiently clear protocol to allow successful repetition and extension of analyses based on original data<anchor xml:id="a2"/> [4] .</p>
        <p><anchor xml:id="a3"/>The importance of replication and reproducibility has recently been exemplified through studies showing that scientific papers commonly leave out experimental details essential for reproduction [5] , studies showing difficulties with replicating published experimental results [6] , an increase in retracted papers [7] , and through a high number of failing clinical trials [8] , [9] . This has led to discussions on how individual researchers, institutions, funding bodies, and journals can establish routines that increase transparency and reproducibility. In order to foster such aspects, it has been suggested that the scientific community needs to develop a “culture of reproducibility” for computational science, and to require it for published claims<anchor xml:id="a4"/> [3] .</p>
        <p><anchor xml:id="a5"/>We want to emphasize that reproducibility is not only a moral responsibility with respect to the scientific field, but that a lack of reproducibility can also be a burden for you as an individual researcher. As an example, a good practice of reproducibility is necessary in order to allow previously developed methodology to be effectively applied on new data, or to allow reuse of code and results for new projects. In other words, good habits of reproducibility may actually turn out to be a time-saver in the longer run.<anchor xml:id="a6"/></p>
        <p><anchor xml:id="a7"/>We further note that reproducibility is just as much about the habits that ensure reproducible research as the technologies that can make these processes efficient and realistic. Each of the following ten rules captures a specific aspect of reproducibility, and discusses what is needed in terms of information handling and tracking of procedures. If you are taking a bare-bones approach to bioinformatics analysis, i.e., running various custom scripts from the command line, you will probably need to handle each rule explicitly. If you are instead performing your analyses through an integrated framework (such as GenePattern [10] , Galaxy [11] , LONI pipeline [12] , or Taverna [13] ), the system may already provide full or partial support for most of the rules. What is needed on your part is then merely the knowledge of how to exploit these existing possibilities.<anchor xml:id="a8"/></p>
        <p><anchor xml:id="a9"/>In a pragmatic setting, with publication pressure and deadlines, one may face the need to make a trade-off between the ideals of reproducibility and the need to get the research out while it is still relevant. This trade-off becomes more important when considering that a large part of the analyses being tried out never end up yielding any results. However, frequently one will, with the wisdom of hindsight, contemplate the missed opportunity to ensure reproducibility, as it may already be too late to take the necessary notes from memory (or at least much more difficult than to do it while underway). We believe that the rewards of reproducibility will compensate for the risk of having spent valuable time developing an annotated catalog of analyses that turned out as blind alleys.<anchor xml:id="a10"/></p>
        <p><anchor xml:id="a11"/>As a minimal requirement, you should at least be able to reproduce the results yourself. This would satisfy the most basic requirements of sound research, allowing any substantial future questioning of the research to be met with a precise explanation. Although it may sound like a very weak requirement, even this level of reproducibility will often require a certain level of care in order to be met. There will for a given analysis be an exponential number of possible combinations of software versions, parameter values, pre-processing steps, and so on, meaning that a failure to take notes may make exact reproduction essentially impossible.<anchor xml:id="a12"/></p>
        <p><anchor xml:id="a13"/>With this basic level of reproducibility in place, there is much more that can be wished for. An obvious extension is to go from a level where you can reproduce results in case of a critical situation to a level where you can practically and routinely reuse your previous work and increase your productivity. A second extension is to ensure that peers have a practical possibility of reproducing your results, which can lead to increased trust in, interest for, and citations of your work<anchor xml:id="a14"/> [6] , [14] .</p>
        <p><anchor xml:id="a15"/>We here present ten simple rules for reproducibility of computational research. These rules can be at your disposal for whenever you want to make your research more accessible—be it for peers or for your future self.<anchor xml:id="a16"/></p>
        <p>Rule 1: For Every Result, Keep Track of How It Was Produced</p>
        <p><anchor xml:id="a17"/>Whenever a result may be of potential interest, keep track of how it was produced. When doing this, one will frequently find that getting from raw data to the final result involves many interrelated steps (single commands, scripts, programs). We refer to such a sequence of steps, whether it is automated or performed manually, as an analysis workflow. While the essential part of an analysis is often represented by only one of the steps, the full sequence of pre- and post-processing steps are often critical in order to reach the achieved result. For every involved step, you should ensure that every detail that may influence the execution of the step is recorded. If the step is performed by a computer program, the critical details include the name and version of the program, as well as the exact parameters and inputs that were used.<anchor xml:id="a18"/></p>
        <p><anchor xml:id="a19"/>Although manually noting the precise sequence of steps taken allows for an analysis to be reproduced, the documentation can easily get out of sync with how the analysis was really performed in its final version. By instead specifying the full analysis workflow in a form that allows for direct execution, one can ensure that the specification matches the analysis that was (subsequently) performed, and that the analysis can be reproduced by yourself or others in an automated way. Such executable descriptions [10] might come in the form of simple shell scripts or makefiles [15] , [16] at the command line, or in the form of stored workflows in a workflow management system<anchor xml:id="a20"/> [10] , [11] , [13] , [17] , [18] .</p>
        <p>As a minimum, you should at least record sufficient details on programs, parameters, and manual procedures to allow yourself, in a year or so, to approximately reproduce the results.</p>
        <p>Rule 2: Avoid Manual Data Manipulation Steps</p>
        <p><anchor xml:id="a21"/>Whenever possible, rely on the execution of programs instead of manual procedures to modify data. Such manual procedures are not only inefficient and error-prone, they are also difficult to reproduce. If working at the UNIX command line, manual modification of files can usually be replaced by the use of standard UNIX commands or small custom scripts. If working with integrated frameworks, there will typically be a quite rich collection of components for data manipulation. As an example, manual tweaking of data files to attain format compatibility should be replaced by format converters that can be reenacted and included into executable workflows. Other manual operations like the use of copy and paste between documents should also be avoided. If manual operations cannot be avoided, you should as a minimum note down which data files were modified or moved, and for what purpose.<anchor xml:id="a22"/></p>
        <p>Rule 3: Archive the Exact Versions of All External Programs Used</p>
        <p><anchor xml:id="a23"/>In order to exactly reproduce a given result, it may be necessary to use programs in the exact versions used originally. Also, as both input and output formats may change between versions, a newer version of a program may not even run without modifying its inputs. Even having noted which version was used of a given program, it is not always trivial to get hold of a program in anything but the current version. Archiving the exact versions of programs actually used may thus save a lot of hassle at later stages. In some cases, all that is needed is to store a single executable or source code file. In other cases, a given program may again have specific requirements to other installed programs/packages, or dependencies to specific operating system components. To ensure future availability, the only viable solution may then be to store a full virtual machine image of the operating system and program. As a minimum, you should note the exact names and versions of the main programs you use.<anchor xml:id="a24"/></p>
        <p>Rule 4: Version Control All Custom Scripts</p>
        <p><anchor xml:id="a25"/>Even the slightest change to a computer program can have large intended or unintended consequences. When a continually developed piece of code (typically a small script) has been used to generate a certain result, only that exact state of the script may be able to produce that exact output, even given the same input data and parameters. As also discussed for rules 3 and 6, exact reproduction of results may in certain situations be essential. If computer code is not systematically archived along its evolution, backtracking to a code state that gave a certain result may be a hopeless task. This can cast doubt on previous results, as it may be impossible to know if they were partly the result of a bug or otherwise unfortunate behavior.<anchor xml:id="a26"/></p>
        <p><anchor xml:id="a27"/>The standard solution to track evolution of code is to use a version control system [15] , such as Subversion, Git, or Mercurial. These systems are relatively easy to set up and use, and may be used to systematically store the state of the code throughout development at any desired time granularity.<anchor xml:id="a28"/></p>
        <p>As a minimum, you should archive copies of your scripts from time to time, so that you keep a rough record of the various states the code has taken during development.</p>
        <p>Rule 5: Record All Intermediate Results, When Possible in Standardized Formats</p>
        <p><anchor xml:id="a29"/>In principle, as long as the full process used to produce a given result is tracked, all intermediate data can also be regenerated. In practice, having easily accessible intermediate results may be of great value. Quickly browsing through intermediate results can reveal discrepancies toward what is assumed, and can in this way uncover bugs or faulty interpretations that are not apparent in the final results. Secondly, it more directly reveals consequences of alternative programs and parameter choices at individual steps. Thirdly, when the full process is not readily executable, it allows parts of the process to be rerun. Fourthly, when reproducing results, it allows any experienced inconsistencies to be tracked to the steps where the problems arise. Fifth, it allows critical examination of the full process behind a result, without the need to have all executables operational. When possible, store such intermediate results in standardized formats. As a minimum, archive any intermediate result files that are produced when running an analysis (as long as the required storage space is not prohibitive).<anchor xml:id="a30"/></p>
        <p>Rule 6: For Analyses That Include Randomness, Note Underlying Random Seeds</p>
        <p><anchor xml:id="a31"/>Many analyses and predictions include some element of randomness, meaning the same program will typically give slightly different results every time it is executed (even when receiving identical inputs and parameters). However, given the same initial seed, all random numbers used in an analysis will be equal, thus giving identical results every time it is run. There is a large difference between observing that a result has been reproduced exactly or only approximately. While achieving equal results is a strong indication that a procedure has been reproduced exactly, it is often hard to conclude anything when achieving only approximately equal results. For analyses that involve random numbers, this means that the random seed should be recorded. This allows results to be reproduced exactly by providing the same seed to the random number generator in future runs. As a minimum, you should note which analysis steps involve randomness, so that a certain level of discrepancy can be anticipated when reproducing the results.<anchor xml:id="a32"/></p>
        <p>Rule 7: Always Store Raw Data behind Plots</p>
        <p><anchor xml:id="a33"/>From the time a figure is first generated to it being part of a published article, it is often modified several times. In some cases, such modifications are merely visual adjustments to improve readability, or to ensure visual consistency between figures. If raw data behind figures are stored in a systematic manner, so as to allow raw data for a given figure to be easily retrieved, one can simply modify the plotting procedure, instead of having to redo the whole analysis. An additional advantage of this is that if one really wants to read fine values in a figure, one can consult the raw numbers. In cases where plotting involves more than a direct visualization of underlying numbers, it can be useful to store both the underlying data and the processed values that are directly visualized. An example of this is the plotting of histograms, where both the values before binning (original data) and the counts per bin (heights of visualized bars) could be stored. When plotting is performed using a command-based system like R, it is convenient to also store the code used to make the plot. One can then apply slight modifications to these commands, instead of having to specify the plot from scratch. As a minimum, one should note which data formed the basis of a given plot and how this data could be reconstructed.<anchor xml:id="a34"/></p>
        <p>Rule 8: Generate Hierarchical Analysis Output, Allowing Layers of Increasing Detail to Be Inspected</p>
        <p><anchor xml:id="a35"/>The final results that make it to an article, be it plots or tables, often represent highly summarized data. For instance, each value along a curve may in turn represent averages from an underlying distribution. In order to validate and fully understand the main result, it is often useful to inspect the detailed values underlying the summaries.<anchor xml:id="a36"/> A common but impractical way of doing this is to incorporate various debug outputs in the source code of scripts and programs. When the storage context allows, it is better to simply incorporate permanent output of all underlying data when a main result is generated, using a systematic naming convention to allow the full data underlying a given summarized value to be easily found. We find hypertext (i.e., html file output) to be particularly useful for this purpose. This allows summarized results to be generated along with links that can be very conveniently followed (by simply clicking) to the full data underlying each summarized value. When working with summarized results, you should as a minimum at least once generate, inspect, and validate the detailed values underlying the summaries.</p>
        <p>Rule 9: Connect Textual Statements to Underlying Results</p>
        <p><anchor xml:id="a37"/>Throughout a typical research project, a range of different analyses are tried and interpretation of the results made. Although the results of analyses and their corresponding textual interpretations are clearly interconnected at the conceptual level, they tend to live quite separate lives in their representations: results usually live on a data area on a server or personal computer, while interpretations live in text documents in the form of personal notes or emails to collaborators. Such textual interpretations are not generally mere shadows of the results—they often involve viewing the results in light of other theories and results. As such, they carry extra information, while at the same time having their necessary support in a given result.<anchor xml:id="a38"/></p>
        <p><anchor xml:id="a39"/>If you want to reevaluate your previous interpretations, or allow peers to make their own assessment of claims you make in a scientific paper, you will have to connect a given textual statement (interpretation, claim, conclusion) to the precise results underlying the statement. Making this connection when it is needed may be difficult and error-prone, as it may be hard to locate the exact result underlying and supporting the statement from a large pool of different analyses with various versions.<anchor xml:id="a40"/></p>
        <p><anchor xml:id="a41"/>To allow efficient retrieval of details behind textual statements, we suggest that statements are connected to underlying results already from the time the statements are initially formulated (for instance in notes or emails). Such a connection can for instance be a simple file path to detailed results, or the ID of a result in an analysis framework, included within the text itself. For an even tighter integration, there are tools available to help integrate reproducible analyses directly into textual documents, such as Sweave [19] , the GenePattern Word add-in [4] , and Galaxy Pages [20] . These solutions can also subsequently be used in connection with publications, as discussed in the next rule.<anchor xml:id="a42"/></p>
        <p>As a minimum, you should provide enough details along with your textual interpretations so as to allow the exact underlying results, or at least some related results, to be tracked down in the future.</p>
        <p>Rule 10: Provide Public Access to Scripts, Runs, and Results</p>
        <p><anchor xml:id="a43"/>Last, but not least, all input data, scripts, versions, parameters, and intermediate results should be made publicly and easily accessible. Various solutions have now become available to make data sharing more convenient, standardized, and accessible in particular domains, such as for gene expression data [21] – [23] . Most journals allow articles to be supplemented with online material, and some journals have initiated further efforts for making data and code more integrated with publications [3] , [24] . As a minimum, you should submit the main data and source code as supplementary material, and be prepared to respond to any requests for further data or methodology details by peers.<anchor xml:id="a44"/></p>
        <p><anchor xml:id="a45"/>Making reproducibility of your work by peers a realistic possibility sends a strong signal of quality, trustworthiness, and transparency. This could increase the quality and speed of the reviewing process on your work, the chances of your work getting published, and the chances of your work being taken further and cited by other researchers after publication<anchor xml:id="a46"/> [25] .<anchor xml:id="a47"/></p>
    </body>
  </text>
</TEI>
