Bibliographic record
Abstract
An abelian group <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is said to be cancellable if whenever <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A circled-plus upper G"> <mml:semantics> <mml:mrow> <mml:mi>A</mml:mi> <mml:mo> ⊕ </mml:mo> <mml:mi>G</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">A \oplus G</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is isomorphic to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A circled-plus upper H"> <mml:semantics> <mml:mrow> <mml:mi>A</mml:mi> <mml:mo> ⊕ </mml:mo> <mml:mi>H</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">A \oplus H</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding="application/x-tex">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is isomorphic to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper H"> <mml:semantics> <mml:mi>H</mml:mi> <mml:annotation encoding="application/x-tex">H</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We show that the index set of cancellable rank 1 torsion-free abelian groups is <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Pi 4 Superscript 0"> <mml:semantics> <mml:msubsup> <mml:mi mathvariant="normal"> Π </mml:mi> <mml:mn>4</mml:mn> <mml:mn>0</mml:mn> </mml:msubsup> <mml:annotation encoding="application/x-tex">\Pi ^0_4</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="m"> <mml:semantics> <mml:mi>m</mml:mi> <mml:annotation encoding="application/x-tex">m</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -complete, showing that the classification by Fuchs and Loonstra cannot be simplified. For arbitrary non-finitely generated groups, we show that the cancellation property is <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Pi 1 Superscript 1"> <mml:semantics> <mml:msubsup> <mml:mi mathvariant="normal"> Π </mml:mi> <mml:mn>1</mml:mn> <mml:mn>1</mml:mn> </mml:msubsup> <mml:annotation encoding="application/x-tex">\Pi ^1_1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="m"> <mml:semantics> <mml:mi>m</mml:mi> <mml:annotation encoding="application/x-tex">m</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -hard; we know of no upper bound, but we conjecture that it is <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="normal upper Pi 2 Superscript 1"> <mml:semantics> <mml:msubsup> <mml:mi mathvariant="normal"> Π </mml:mi> <mml:mn>2</mml:mn> <mml:mn>1</mml:mn> </mml:msubsup> <mml:annotation encoding="application/x-tex">\Pi ^1_2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="m"> <mml:semantics> <mml:mi>m</mml:mi> <mml:annotation encoding="application/x-tex">m</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -complete.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.004 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| 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 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".