MétaCan
Menu
Back to cohort
Record W4317565756 · doi:10.5281/zenodo.7552628

Monochromatic forests of finite subsets of N

2000· article· en· W4317565756 on OpenAlexaff
Tom C. Brown

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsMonochromatic colorMathematicsComputer sciencePhysicsOptics

Abstract

fetched live from OpenAlex

It is known that if $N$ is finitely colored, then some color class is piecewise syndetic. (See Definition 1.1 below for a definition of piecewise syndetic.) We generalize this result by considering finite colorings of the set of all finite subsets of $N$ . The monochromatic objects obtained are “$d$-copies” of arbitrary finite forests and arbitrary infinite forests of finite height. Van der Waerden’s theorem on arithmetic progressions is generalized in a similar way. Ramsey’s theorem and van der Waerden’s theorem are used in some of the proofs.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0000.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0030.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.026
GPT teacher head0.290
Teacher spread0.264 · 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 source (direct Gemma or distilled Codex), 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

Citations0
Published2000
Admission routes1
Has abstractyes

Explore more

Same topicLimits and Structures in Graph TheoryFrench-language works237,207