Bibliographic record
Abstract
As Russell's paradox of "the set of all sets that do not contain themselves" indicated long ago, matters go seriously amiss if one operates an ontology of unrestricted totalization. Some sort of restriction must be placed on such items as "the set of all sets that have the feature F' or "the conjunction of all truths that have the feature G." But generally, logicians here introduce such formalized and complex devices as the theory of types or the doctrine of impredictivity. The present paper argues for the informal and elementary idea that the items invoked in a proper identification have themselves already been identified. Even as an explanation is not satisfactory that proceeds in terms of items that themselves require prior explanation, so the same holds with identification. And heed of this elementary idea suffices to sideline those otherwise paradoxical perplexities.
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.008 | 0.015 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.005 | 0.024 |
| Scholarly communication | 0.007 | 0.018 |
| Open science | 0.002 | 0.009 |
| Research integrity | 0.003 | 0.006 |
| Insufficient payload (model declined to judge) | 0.007 | 0.002 |
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".