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
It is well known that phase function methods allow for the numerical solution of a large class of oscillatory second order linear ordinary differential equations in time independent of frequency. Unfortunately, these methods break down in the commonly-occurring case in which the equation has turning points. We resolve this difficulty by introducing a generalized phase function method for second order linear ordinary differential equations with turning points. More explicitly, we give an efficient numerical algorithm for computing an Airy phase function which efficiently represents the solutions of such an equation. The running time of our algorithm is independent of the magnitude of the logarithmic derivatives of the equation’s solutions, which is a measure of their rate of variation that generalizes the notion of frequency to functions which are rapidly varying but not necessarily oscillatory. Once the Airy phase function has been constructed, any reasonable initial or boundary value problem can be readily solved and, unlike step methods that only generate the values of a rapidly-varying solution at the nodes of a sparse discretization grid that is insufficient for interpolation, the output of our scheme allows for the evaluation of the solution at any point in the equation’s domain. We rigorously justify our approach by proving not only the existence of slowly-varying Airy phase functions, but also the convergence of our numerical method. Moreover, we present the results of extensive numerical experiments demonstrating the efficacy of our algorithm.
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.001 |
| 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.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