3-D inversion of induced polarization data
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
Abstract We present an algorithm for inverting induced polarization (IP) data acquired in a 3-D environment. The algorithm is based upon the linearized equation for the IP response, and the inverse problem is solved by minimizing an objective function of the chargeability model subject to data and bound constraints. The minimization is carried out using an interior-point method in which the bounds are incorporated by using a logarithmic barrier and the solution of the linear equations is accelerated using wavelet transforms. Inversion of IP data requires knowledge of the background conductivity. We study the effect of different approximations to the background conductivity by comparing IP inversions performed using different conductivity models, including a uniform half-space and conductivities recovered from one-pass 3-D inversions, composite 2-D inversions, limited AIM updates, and full 3-D nonlinear inversions of the dc resistivity data. We demonstrate that, when the background conductivity is simple, reasonable IP results are obtainable without using the best conductivity estimate derived from full 3-D inversion of the dc resistivity data. As a final area of investigation, we study the joint use of surface and borehole data to improve the resolution of the recovered chargeability models. We demonstrate that the joint inversion of surface and crosshole data produces chargeability models superior to those obtained from inversions of individual data sets.
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.000 |
| 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 it