GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • ReScience C
  • READ
  • WRITE
  • EDIT
  • BOARD
  • FAQ
  • NEWS

This view

  • Original page
  • New address

GeezerVison is showing rescience.github.io — ReScience C

Reproducible Science is good. Replicated Science is better.

ReScience C is a platinum open-access peer-reviewed journal that targets computational research and encourages the explicit replication of already published research, promoting new and open-source implementations in order to ensure that the original research is reproducible. You can read about the ideas behind ReScience C in the article Sustainable computational science: the ReScience initiative

To achieve this goal, the whole publishing chain is radically different from other traditional scientific journals. ReScience C lives on GitHub where each new implementation of a computational study is made available together with comments, explanations and tests. Each submission takes the form of an issue that is publicly reviewed and tested in order to guarantee that any researcher can re-use it. If you ever replicated computational results (or failed at) from the literature in your research, ReScience C is the perfect place to publish your new implementation.

ReScience C is collaborative and open by design. Everything can be forked and modified. Don’t hesitate to write a submission, join us and to become a reviewer.


Latest publications

  1. Replication in Computer Graphics (Python) | 10.5281/zenodo.18400484 | PDF | Code | Review | BibTeX
    Perazzo, D., Castro, D.G.N.S., Velho, L., and Figueiredo, L.H. de. 2026. [Re] Curve-Fitting with Piecewise Parametric Cubics. ReScience C 11, 1, #1.

    @article{Perazzo:2026,
      author = {Perazzo, Daniel and Castro, Davi Guimarães Nunes Sena and Velho, Luiz and de Figueiredo, Luiz Henrique},
      title = {{[Re] Curve-Fitting with Piecewise Parametric Cubics}},
      journal = {ReScience C},
      year = {2026},
      month = jan,
      volume = {11},
      number = {1},
      pages = {{#1}},
      doi = {10.5281/zenodo.18400484},
      url = {https://zenodo.org/record/18400484/files/article.pdf},
      code_url = {https://github.com/danperazzo/plass_reproduction},
      code_doi = {},
      code_swh = {swh:1:dir:7b13298f404e5f6ac951ffc8a5e811045f5e8abc},
      data_url = {},
      data_doi = {},
      review_url = {https://github.com/ReScience/submissions/issues/93},
      type = {Replication},
      language = {Python},
      domain = {Computer Graphics},
      keywords = {rescience c, rescience x, Python, curve fitting, geometric modeling, computer graphics}
    }
    
  2. Replication in Machine Learning (Python) | 10.5281/zenodo.18401497 | PDF | Code | Review | BibTeX
    Hudovernik, V., Rot, Ž., Vovk, K., Škodnik, L., and Zajc, L.Č. 2026. Learning with Noisy Labels [ Re]visited. ReScience C 11, 1, #2.

    @article{Hudovernik:2026,
      author = {Hudovernik, Valter and Rot, Žiga and Vovk, Klemen and Škodnik, Luka and Zajc, Luka Čehovin},
      title = {{Learning with Noisy Labels [~Re]visited}},
      journal = {ReScience C},
      year = {2026},
      month = jan,
      volume = {11},
      number = {1},
      pages = {{#2}},
      doi = {10.5281/zenodo.18401497},
      url = {https://zenodo.org/record/18401497/files/article.pdf},
      code_url = {https://github.com/KlemenVovk/noisy-labels},
      code_doi = {},
      code_swh = {swh:1:dir:22222955c66aeb7e379a16b45d208fcf3d64a11d},
      data_url = {},
      data_doi = {},
      review_url = {https://openreview.net/forum?id=GKZ2leags0},
      type = {Replication},
      language = {Python},
      domain = {Machine Learning},
      keywords = {Learning with noisy labels, deep learning, Python}
    }
    
  3. Replication in Artificial Intelligence (Python) | 10.5281/zenodo.16374814 | PDF | Code | Data | Review | BibTeX
    Belitsky, M., Laitenberger, F., Sheremet, D., and Belkacemi, N. 2025. [Re] Learning Fair Graph Representations via Automated Data Augmentations. ReScience C 10, 1, #6.

    @article{Belitsky:2025,
      author = {Belitsky, Max and Laitenberger, Filipe and Sheremet, Denys and Belkacemi, Nordin},
      title = {{[Re] Learning Fair Graph Representations via Automated Data Augmentations}},
      journal = {ReScience C},
      year = {2025},
      month = jul,
      volume = {10},
      number = {1},
      pages = {{#6}},
      doi = {10.5281/zenodo.16374814},
      url = {https://zenodo.org/record/16374814/files/article.pdf},
      code_url = {https://zenodo.org/records/13834566},
      code_doi = {10.5281/zenodo.13834566},
      code_swh = {swh:1:snp:894decb239b454eaed7dc5c99d9fe6b5400d7a26},
      data_url = {https://zenodo.org/records/13837423},
      data_doi = {10.5281/zenodo.13837423},
      review_url = {https://openreview.net/forum?id=9OlU865dAF},
      type = {Replication},
      language = {Python},
      domain = {Artificial Intelligence},
      keywords = {python, graph, deep learning}
    }
    


Latest News

  • Ten Years Reproducibility Challenge Oct 11, 2019

    Did you ever try to run an old code that you wrote for a scientific article you published years ago? Did you encounter any problems? Were you successful? We are curious to hear your story. This is the reason why we are editing a special issue of ReScience to collect these stories.

    The ten years reproducibility challenge is an invitation for researchers to try to run the code they’ve created for a scientific publication that was published more than ten years ago. This code can be anything (statistical analysis, numerical simulation, data processing, etc.), can be written in any language and can address any scientific domain. The only mandatory condition to enter the challenge is to have published a scientific article before 2010, in a journal or a conference with proceedings, which contains results produced by code, irrespectively of whether this code was published in some form at the time or not.

    Note that we do not ask you to write a new version of your old code. We ask you instead to try to make your old code to run on modern hardware/software (with minimal modifications) in order to check if you can obtain the exact same results that were published at least ten years ago.

    Sounds easy? We have good reasons to think this might be more difficult than you think. And maybe the first problem you’ll have to solve is to find your own source code.

    More information at: rescience.github.io/ten-years

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.