MétaCan
Menu
Back to cohort
Record W4411687193 · doi:10.61091/um123-15

Alpha-trees over paths and caterpillars

2025· article· en· W4411687193 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.

venuePublished in a venue whose home country is Canada.
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

VenueUtilitas Mathematica · 2025
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsAlpha (finance)Statistics

Abstract

fetched live from OpenAlex

<p>A bipartite labeling of a tree of order <span class="math inline">\(n\)</span> is a bijective function that identifies the vertices of <span class="math inline">\(T\)</span> with the elements of <span class="math inline">\(\{0, 1, \dots, n-1\}\)</span> in such a way that there exists an integer <span class="math inline">\(\lambda\)</span> such that the set of labels on the stable sets of <span class="math inline">\(T\)</span> are <span class="math inline">\(\{0,1, \dots, \lambda\}\)</span> and {<span class="math inline">\(\lambda + 1, \lambda +2. \dots, n-1\}.\)</span> The most restrictive and versatile bipartite labeling is the variety called <span class="math inline">\(\alpha\text{-labeling}\)</span>. In this work we present a new construction of <span class="math inline">\(\alpha\text{-labeled}\)</span> trees where any two adjacent vertices of a path-like tree, or a similar caterpillar, can be amalgamated with selected vertices of two equivalent trees.</p>

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.000
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: none
Teacher disagreement score0.810
Threshold uncertainty score0.385

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.0010.001
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.009
GPT teacher head0.252
Teacher spread0.243 · 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