A NEW MONTE CARLO METHOD FOR TIME-DEPENDENT NEUTRINO RADIATION TRANSPORT
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Monte Carlo approaches to radiation transport have several attractive properties compared to deterministic \nmethods. These include simplicity of implementation, high accuracy, and good parallel scaling. Moreover, \nMonte Carlo methods can handle complicated geometries and are relatively easy to extend to multiple spatial \ndimensions, which makes them particularly interesting in modeling complex multi-dimensional astrophysical \nphenomena such as core-collapse supernovae. The aim of this paper is to explore Monte Carlo methods for \nmodeling neutrino transport in core-collapse supernovae. We generalize the implicit Monte Carlo photon transport \nscheme of Fleck & Cummings and gray discrete-diffusion scheme of Densmore et al. to energy-, time-, \nand velocity-dependent neutrino transport. Using our 1D spherically-symmetric implementation, we show that, \nsimilar to the photon transport case, the implicit scheme enables significantly larger timesteps compared with \nexplicit time discretization, without sacrificing accuracy, while the discrete-diffusion method leads to significant \nspeed-ups at high optical depth. Our results suggest that a combination of spectral, velocity-dependent, \nimplicit Monte Carlo and discrete-diffusion Monte Carlo methods represents an attractive approach for use in \nneutrino radiation-hydrodynamics simulations of core-collapse supernovae. Our velocity-dependent scheme \ncan easily be adapted to photon transport. \n
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it