Computational generation of tailored radionuclide libraries for alpha-particle and gamma-ray spectrometry
Bibliographic record
Abstract
Radionuclide identification is a radioanalytical method employed in various scientific disciplines that utilize alpha-particle or gamma-ray spectrometric assays, ranging from astrophysics to nuclear medicine. Radionuclide libraries in conventional radionuclide identification systems are crafted in a manual fashion, accompanying labor-intensive and error-prone user tasks and hindering library customization. This research presents a computational algorithm and the architecture of its dedicated software that can automatically generate tailored radionuclide libraries. Progenitor-progeny recurrence relations were modeled to enable recursive computation of radionuclide subsets. This theoretical concept was incorporated into open-source software called and validated against four actinide decay series and 12 radioactive substances, including a uranium-glazed legacy Fiestaware, natural uranium and thorium sources, a Ra 226 sample, and the medical radionuclides Ac 225 , Lu 177 , and Tc 99 m . The developed algorithm yielded radionuclide libraries for all the tested specimens within minutes, demonstrating its efficiency and applicability across diverse scenarios. The proposed approach introduces a framework for computerized radionuclide library generation, thereby trivializing library-driven radionuclide identification and facilitating the spectral recognition of unregistered radionuclides in radiation spectrometry. Published by the American Physical Society 2024
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".