MétaCan
Menu
Back to cohort
Record W1901357871 · doi:10.1002/jgt.21655

Transversals in Trees

2012· article· en· W1901357871 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueJournal of Graph Theory · 2012
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsConcordia UniversityMcGill UniversitySocial Sciences and Humanities Research CouncilNatural Sciences and Engineering Research Council of Canada
FundersMcGill University
KeywordsLibrary scienceComputer scienceOperations researchEngineering

Abstract

fetched live from OpenAlex

A transversal in a rooted tree is any set of nodes that meets every path from the root to a leaf. We let c(T,k) denote the number oftransversals of size k in a rooted tree T.We define a partial order on the set of all rooted trees with n nodes by saying that a tree T succeeds a tree T. if c(T,k) is at least c(T,k) for all k and strictly greater than c(T,k) for at leastone k. We prove that, for every choice of positive integers d and n, the set of all rooted trees on n nodes where each node has atmost d children has aunique minimal element with respect to this partial order and we describethis tree. In addition, we determine asymptotically the expected values of c(T,k) in special families of trees. © 2012 Wiley Periodicals, Inc.

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.002
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.842
Threshold uncertainty score0.165

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.002
Open science0.0010.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.013
GPT teacher head0.239
Teacher spread0.225 · 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