Search for Sub-Relativistic Magnetic Monopoles with the IceCube Neutrino Observatory
Bibliographic record
Abstract
Magnetic monopoles are beyond standard model particles, predicted by Grand Unified Theories (GUTs) to be created during the early universe. At typical masses of the GUT-scale - above $10^{14}$ GeV - these particles would move at sub-relativistic speeds. The Rubakov-Callan effect predicts that magnetic monopoles can catalyze nucleon decays, in particular the decay of protons. This results in a unique signature of small particle cascades along the trajectory of the slow moving magnetic monopole. Since 2012, a dedicated Slow-Particle Filter has been implemented in the IceCube Neutrino Observatory for the detection of magnetic monopoles. Current limits set an upper bound for the monopole flux at $\Phi_{\mathrm{90}}\leq 10^{-17}$ to $10^{-18} \mathrm{cm}^{-2}\mathrm{s}^{-1}\mathrm{sr}^{-1}$ depending on the catalysis cross section for the proton decay. A detection of the monopole flux thus requires exceptional background rejection and signal efficiency. This is accomplished using machine learning methods. In this analysis, we use a multi-level boosted decision tree classifier. We present the strategy behind the background and signal simulation, the classification efficiency, and IceCube’s projected sensitivity for the detection of sub-relativistic magnetic monopoles.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".