Bibliographic record
Abstract
We describe maximal, in a sense made precise, <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper L"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">L</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {L}</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-analytic continuations of germs at <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="plus normal infinity"> <mml:semantics> <mml:mrow> <mml:mo>+</mml:mo> <mml:mi mathvariant="normal">∞</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">+\infty</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of unary functions definable in the o-minimal structure <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper R Subscript an comma exp"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">R</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mtext>an,exp</mml:mtext> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">\mathbb {R}_\textrm {an,exp}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> on the Riemann surface <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-struck upper L"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">L</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathbb {L}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of the logarithm. As one application, we give an upper bound on the logarithmic-exponential complexity of the compositional inverse of an infinitely increasing such germ, in terms of its own logarithmic-exponential complexity and its level. As a second application, we strengthen Wilkie’s theorem on definable complex analytic continuations of germs belonging to the residue field <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper R Subscript poly"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">R</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mtext>poly</mml:mtext> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">\mathcal {R}_{\text {poly}}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of the valuation ring of all polynomially bounded definable germs.
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 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.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.004 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.010 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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 teacher head, 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".