MétaCan
Menu
Back to cohort
Record W2024571590 · doi:10.1007/s10240-014-0063-8

Finite basis for analytic multiple gaps

2014· article· fr· W2024571590 on OpenAlexafffund
Antonio Avilés, Stevo Todorčević

Bibliographic record

VenuePublications mathématiques de l IHÉS · 2014
Typearticle
Languagefr
FieldMathematics
TopicAdvanced Topology and Set Theory
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of CanadaFP7 People: Marie-Curie ActionsCentre National de la Recherche ScientifiqueFondation Sciences Mathématiques de ParisMinisterio de Economía y Competitividad
KeywordsCountable setMathematicsPairwise comparisonPartition (number theory)Basis (linear algebra)CombinatoricsClass (philosophy)Finite setTree (set theory)Discrete mathematicsSet (abstract data type)Integer (computer science)Computer scienceMathematical analysis

Abstract

fetched live from OpenAlex

An n -gap consists of n many pairwise orthogonal families of subsets of a countable set that cannot be separated. We prove that for every positive integer n there is a finite basis for the class of analytic n -gaps. The proof requires an analysis of certain combinatorial problems on the n -adic tree, and in particular a new partition theorem for trees.

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.002
metaresearch head score (Gemma)0.017
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Meta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.365
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.017
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.037
GPT teacher head0.328
Teacher spread0.291 · 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.

Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations11
Published2014
Admission routes2
Has abstractyes

Explore more

Same venuePublications mathématiques de l IHÉSSame topicAdvanced Topology and Set TheoryFrench-language works237,207