MétaCan
Menu
Back to cohort
Record W4405119112 · doi:10.1215/00294527-2024-0017

Classifying Invariants for E1: A Tail of a Generic Real

2024· article· en· W4405119112 on OpenAlexaff
Assaf Shani

Bibliographic record

VenueNotre Dame Journal of Formal Logic · 2024
Typearticle
Languageen
FieldMathematics
TopicAdvanced Topology and Set Theory
Canadian institutionsConcordia University
Fundersnot available
KeywordsMathematicsComputer scienceProgramming language

Abstract

fetched live from OpenAlex

Let E be an analytic equivalence relation on a Polish space. We introduce a framework for studying the possible “reasonable” complete classifications and the complexity of possible classifying invariants for E, such that: (1) the standard results and intuitions regarding classifications by countable structures are preserved in this framework; (2) this framework respects Borel reducibility; and (3) this framework allows for a precise study of the possible invariants of certain equivalence relations which are not classifiable by countable structures, such as E1. In this framework we show that E1 can be classified, with classifying invariants which are κ-sequences of E0-classes where κ=b, and it cannot be classified in such a manner if κ<add(B). These results depend on analyzing the following submodel of a Cohen-real extension. Let ⟨cn:n<ω⟩ be a generic sequence of Cohen reals, and define the tail intersection model M=⋂n<ωV[⟨cm:m≥n⟩]. An analysis of reals in M will provide lower bounds for the possible invariants for E1. We also extend a characterization of turbulence, due to Larson and Zapletal, in terms of intersection models.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.262
Threshold uncertainty score0.374

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.110
GPT teacher head0.372
Teacher spread0.262 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueNotre Dame Journal of Formal LogicSame topicAdvanced Topology and Set TheoryFrench-language works237,207