3-D probability density imaging of Euler solutions using gravity data: a case study of Mount Milligan, Canada
Bibliographic record
Abstract
Abstract Euler deconvolution is a widely used automatic or semi-automatic method for potential field data. However, it yields many spurious solutions that complicate interpretation and must be reduced, eliminated, recognized, or ignored during interpretation. This study proposes a post-processing algorithm that converts Euler solutions produced by tensor Euler deconvolution of gravity data with an unprescribed structural index into probability values ( p values) using the B-spline series density estimation (BSS) method. The p values of the Euler solution set form a probability density distribution on the estimation grid. The BSS method relies on the fact that while spurious solutions are sparse and ubiquitous, Euler deconvolution yields many similar or duplicate solutions, which may tightly cluster near real sources. The p values of the Euler solution clusters form multi-layered isosurfaces that can be used to discriminate neighboring target sources because the p values of spurious solutions are vanishingly small, making it simple to remove their interference from the probability density distribution. In all synthetic cases, the geometric outlines of anomaly sources are estimated from probability density isosurfaces approximating synthetic model parameters. The BSS method was then applied to airborne gravity data from Mount Milligan, British Columbia, Canada. Subsequently, results from synthetic models and field data show that the proposed method can successfully localize meaningful geological targets.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".