Hi all

Although there is only one publication for 2023 added to https://boinc.berkeley.edu/pubs.php thus far, a cursory search in Google Scholar reveals several additional papers that appear to mention experiments run on BOINC and published in 2023.

What is the standard for including papers in the the publication list? Are any of the below worth including, or would confirmation be needed from the paper author first?

Papers and relevant excerpts below..
--

https://scripts.iucr.org/cgi-bin/paper?S2053273323001948
To avoid high workloads for the control computer of the CrystalMation system, the computing is distributed over several workstations, participating voluntarily, by the grid programming system from the Berkeley Open Infrastructure for Network Computing (BOINC).

https://meetings.aps.org/Meeting/APR23/Session/C09.1
BlackHoles@Home is a proposed BOINC project that leverages new NR techniques

https://www.biorxiv.org/content/10.1101/2023.02.25.529956v1.abstract
Energy landscape calculations for cyclic peptides were done as previously described using Rosetta cycpep_predict application (18–20). Large-scale conformational sampling during these calculations was conducted using the BOINC Rosetta@Home platform ...We thank the volunteer contributors of the BOINC Rosetta@Home project for donating compute cycles for this project

https://www.pnas.org/doi/abs/10.1073/pnas.2207974120
For each blueprint, we extensively sampled structure and sequence space by running up to 10,000 independent trajecto-ries of backbone generation followed by Rosetta sequence design calculations (Materials and Methods) on Rosetta@home (https://boinc.bakerlab.org/rosetta).

https://assets.researchsquare.com/files/rs-2401990/v1/45c5882f-1360-4e85-8c84-ba0ba58ea0ea.pdf?c=1673982925
This simulation experiment ran within the climateprediction.net (CPDN) climate simulation
environment12. CPDN uses the Berkeley Open Infrastructure for Network Computing (BOINC)


https://chart.ch/wp-content/uploads/2023/03/FCChh-stability-2022.pdf
During 2022 the BOINC application for xtrack was developed: xboinc. The application was
implemented on Linux and Windows and available on GitHub [12]. In addition, its validator
and assimilator were developed in order to handle the job submission. The xboinc was tested
locally as well on a test server by the developers. Currently, the application is being configured
in the CERN server to be tested with real volunteers. The application will be available to the
collaboration in S 2023.

https://pubs.rsc.org/en/content/articlehtml/2023/dd/d2dd00092j
TC and BDM would especially like to thank the BOINC community involved in our project, called QuChemPedIA@home (https://quchempedia.univ-angers.fr/athome/). While no results published here came from the community, it is the large failure ratio observed in the DFT calculations during the collaborative computing effort that paved the ideas of this article.


https://www.repo.uni-hannover.de/handle/123456789/13375
The all-sky search for unknown neutron stars in our galaxy detailed in this work used the volunteer distributed computing project Einstein@Home and the ATLAS supercomputer for several months, taking tens of thousands of total CPU-time years to complete.

Thank you for your interest in this topic and please keep up the good work. I have subscribed to this thread in case you have any additions in the future.
I will go through these good looking papers shortly and see if they should be added to our list.

---

Thank you Falconet for pointing that out and it's sure to appear on our list soon.

Most of the papers suggested have been added to the Publications by BOINC Projects webpage.

Falconet wrote:

Another paper that mentions Rosetta@home.
(h/t [VENETO] boboviz)

Added to our list, thanks again.
This is a good opportunity to thank boboviz and BOINC.Italy's Pubblicazioni for being a very useful resource.
Thank you also to Antonio Cerrato, who wrote a thesis based on BOINC.Italy's list and recently alerted me of several papers from that list that should be included in our list.

That's great, thanks for adding them Contact!

Here is a Gerasim:
https://www.researchgate.net/publication/369107897_USE_OF_X-BASED_DIAGONAL_FILLINGS_AND_ESODLS_CMS_SCHEMES_FOR_ENUMERATION_OF_MAIN_CLASSES_OF_DIAGONAL_LATIN_SQUARES

The concept of X-based diagonal fillings in diagonal Latin squares (DLS) is introduced, their enumeration is carried out them, isomorphism classes are constructed, and the interconnection of these problems with problems based on card decks is shown. On their basis, a method for generating strongly normalized canonical forms of the DLS using a limited set of ESODLS CMS schemes is proposed. It makes possible to reduce the necessary computational costs by 3-4 orders of magnitude compared to a software implementation based on a Brute Force based enumeration of the DLS. Using the developed software implementations and the Gerasim@ Home volunteer distributed computing project on the BOINC platform, the number of main classes of DLS of order 9 has been calculated. This number was previously unknown and amounted to 3 292 326 155 394.

Way to go! The paper has been added.

Thanks! This looks like another (26 April 2023):

Sequence-structure-function relationships in the microbial protein universe
https://www.nature.com/articles/s41467-023-37896-w

For the past half-century, structural biologists relied on the notion that similar protein sequences give rise to similar structures and functions. While this assumption has driven research to explore certain parts of the protein universe, it disregards spaces that don’t rely on this assumption. Here we explore areas of the protein universe where similar protein functions can be achieved by different sequences and different structures. We predict ~200,000 structures for diverse protein sequences from 1,003 representative genomes across the microbial tree of life and annotate them functionally on a per-residue basis. Structure prediction is accomplished using the World Community Grid, a large-scale citizen science initiative. The resulting database of structural models is complementary to the AlphaFold database, with regards to domains of life as well as sequence diversity and sequence length. We identify 148 novel folds and describe examples where we map specific functions to structural motifs.

bwindsor22 wrote:

This looks like another

And our first listing for World Community Grid (Microbiome Immunity Project)

Ramanujan machine just posted 3. BOINC is explicitly cited in the first. The second looks like a definition of a mathematical structure; it's used in the first paper to explain BOINC results. The third definitely involved a large computational search, though the compute infrastructure for this search is not explicitly given.

http://www.ramanujanmachine.com/publications/

Algorithm-assisted discovery of an intrinsic order among mathematical constants
Elimelech R., David O., De la Cruz Mengual C., Kalisch R., Berndt W., Shalyt M., Silberstein M., Hadad Y., & Kaminer I.
arXiv 2308.11829 (2023)
A massively parallel computer algorithm has discovered an unprecedented number of continued fraction formulas for fundamental mathematical constants. These formulas unveil a novel mathematical structure that we refer to as the conservative matrix field. This field not only unifies thousands of existing formulas but also generates an infinite array of new formulas. Most importantly, it reveals unexpected relationships among various mathematical constants.

The conservative matrix field
David O.
arXiv 2303.09318 (2023)
A mathematical structure used to study mathematical constants by combining polynomial continued fractions in an interesting way. In particular it is used to reprove and motivate Apery’s original proof of the irrationality of 𝜁(3).

Automated Search for Conjectures on Mathematical Constants using Analysis of Integer Sequences
Razon O., Harris Y., Gottlieb S., Carmon D., David O., & Kaminer I.
International Conference on Machine Learning, PMLR, 28809-28842 (2023)
This algorithm is a different approach for finding conjectures on mathematical constants. Instead of searching for continued fractions, we search for patterns in integer sequences.
The implementation of this algorithm can be found here.

Algorithm-assisted discovery of an intrinsic order among mathematical constants has been added to our list.
The paper is accompanied by an explanatory video and BOINC volunteers are expressly thanked in the expanded description.

---