MétaCan
Menu
Back to cohort
Record W4412647884 · doi:10.55016/ojs/cdm.v2i1.61950

A canonical partition theorem for trees

2007· article· en· W4412647884 on OpenAlexvenueno aff
Vojkan Vuksanovic

Bibliographic record

VenueContributions to Discrete Mathematics · 2007
Typearticle
Languageen
FieldMathematics
TopicGraph theory and applications
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsPartition (number theory)CombinatoricsDiscrete mathematics

Abstract

fetched live from OpenAlex

In this paper we prove a canonical partition theorem for weakly embedded subtrees of a given regular tree. It was brought to my attention that there is a paper of Milliken "Canonical partition theorem for strongly embedded subtrees of regular trees" circulated in the 1980's. This paper is still unpublished and the results in my paper are discovered independently. Although it is possible to conclude the result about weakly embedded subtrees from Milliken's paper, we give a direct proof which works for both, weakly and strongly embedded subtrees.

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.002
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: none
Teacher disagreement score0.843
Threshold uncertainty score0.701

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.002
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.032
GPT teacher head0.364
Teacher spread0.333 · 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

Citations0
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueContributions to Discrete MathematicsSame topicGraph theory and applicationsFrench-language works237,207