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
A novel method for finding allowed regions in the space of CFT-data, coined navigator method, was recently proposed in [1]. Its efficacy was demonstrated in the simplest example possible, i.e. that of the mixed-correlator study of the 3D Ising Model. In this paper, we would like to show that the navigator method may also be applied to the study of the family of d <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>d</mml:mi> </mml:math> -dimensional O(N) <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy="false" form="prefix">(</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy="false" form="postfix">)</mml:mo> </mml:mrow> </mml:math> models. We will aim to follow these models in the (d,N) <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mo stretchy="false" form="prefix">(</mml:mo> <mml:mi>d</mml:mi> <mml:mo>,</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy="false" form="postfix">)</mml:mo> </mml:mrow> </mml:math> plane. We will see that the ``sailing’’ from island to island can be understood in the context of the navigator as a parametric optimization problem, and we will exploit this fact to implement a simple and effective path-following algorithm. By sailing with the navigator through the (d,N) <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mo stretchy="false" form="prefix">(</mml:mo> <mml:mi>d</mml:mi> <mml:mo>,</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy="false" form="postfix">)</mml:mo> </mml:mrow> </mml:math> plane, we will provide estimates of the scaling dimensions (\Delta_{\phi},\Delta_{s},\Delta_{t}) <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mo stretchy="false" form="prefix">(</mml:mo> <mml:msub> <mml:mi>Δ</mml:mi> <mml:mi>ϕ</mml:mi> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>Δ</mml:mi> <mml:mi>s</mml:mi> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>Δ</mml:mi> <mml:mi>t</mml:mi> </mml:msub> <mml:mo stretchy="false" form="postfix">)</mml:mo> </mml:mrow> </mml:math> in the entire range (d,N) \in [3,4] \times [1,3] <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mo stretchy="false" form="prefix">(</mml:mo> <mml:mi>d</mml:mi> <mml:mo>,</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy="false" form="postfix">)</mml:mo> <mml:mo>∈</mml:mo> <mml:mo stretchy="false" form="prefix">[</mml:mo> <mml:mn>3</mml:mn> <mml:mo>,</mml:mo> <mml:mn>4</mml:mn> <mml:mo stretchy="false" form="postfix">]</mml:mo> <mml:mo>×</mml:mo> <mml:mo stretchy="false" form="prefix">[</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> <mml:mo stretchy="false" form="postfix">]</mml:mo> </mml:mrow> </mml:math> . We will show that to our level of precision, we cannot see the non-unitary nature of the O(N) <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy="false" form="prefix">(</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy="false" form="postfix">)</mml:mo> </mml:mrow> </mml:math> models due to the fractional values of d <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>d</mml:mi> </mml:math> or N <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mi>N</mml:mi> </mml:math> in this range. We will also study the limit N \to 1 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>→</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , and see that we cannot find any solution to the unitary mixed-correlator crossing equations below N=1 <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> .
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.001 | 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.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