Bibliographic record
Abstract
A trivial automorphism of the Boolean algebra P ( N ) / F i n \mathcal P(\mathbb N) / \mathrm {Fin} is an automorphism induced by the action of some function N â N \mathbb N \rightarrow \mathbb N . The forcing axiom O C A T \mathsf {OCA}_{\mathrm {T}} implies all automorphisms are trivial, and therefore two trivial automorphisms are conjugate if and only if they have the same (modulo finite) orbit structure. We show that the Continuum Hypothesis implies that two trivial automorphisms are conjugate if and only if there are no first-order obstructions to their conjugacy and their indices have the same parity, if and only if the given trivial automorphisms are conjugate in some forcing extension of the universe. To each automorphism α \alpha of P ( N ) / F i n \raise 1.5pt\hbox {\(\scriptstyle \mathcal {P}(\mathbb {N})\)}\mkern -1mu/\mkern -1mu{\scriptstyle \mathrm {Fin}} we associate the first-order structure A α = ( P ( N )
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.003 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.001 | 0.004 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.027 | 0.006 |
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 source (direct Gemma or distilled Codex), 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".