MétaCan
Menu
Back to cohort
Record W2057097927 · doi:10.4236/apm.2014.45024

A Solution of a Problem of I. P. Natanson Concerning the Decomposition of an Interval into Disjoint Perfect Sets

2014· article· en· W2057097927 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueAdvances in Pure Mathematics · 2014
Typearticle
Languageen
FieldMathematics
TopicMathematics and Applications
Canadian institutionsnot available
FundersYork University
KeywordsMathematicsDisjoint setsDisjoint union (topology)Lebesgue measureBounded functionInterval (graph theory)Cardinality (data modeling)Real lineDiscrete mathematicsLebesgue integrationMeasure (data warehouse)CombinatoricsHilbert spacePure mathematicsMathematical analysis

Abstract

fetched live from OpenAlex

In a previous paper published in this journal, it was demonstrated that any bounded, closed interval of the real line can, except for a set of Lebesgue measure 0, be expressed as a union of c pairwise disjoint perfect sets, where c is the cardinality of the continuum. It turns out that the methodology presented there cannot be used to show that such an interval is actually decomposable into c nonoverlapping perfect sets without the exception of a set of Lebesgue measure 0. We shall show, utilizing a Hilbert-type space-filling curve, that such a decomposition is possible. Furthermore, we prove that, in fact, any interval, bounded or not, can be so expressed.

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.

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.112
Threshold uncertainty score0.478

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.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.023
GPT teacher head0.348
Teacher spread0.325 · 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