MétaCan
Menu
Back to cohort
Record W2049562387 · doi:10.1007/s11512-009-0118-0

Long and short paths in uniform random recursive dags

2010· article· sv· W2049562387 on OpenAlexaff
Luc Devroye, Svante Janson

Bibliographic record

VenueArkiv för matematik · 2010
Typearticle
Languagesv
FieldComputer Science
TopicAlgorithms and Data Compression
Canadian institutionsMcGill University
Fundersnot available
KeywordsDirected acyclic graphCombinatoricsMathematicsPath (computing)Node (physics)Binary logarithmRandom graphRoot (linguistics)Shortest path problemConstant (computer programming)Discrete mathematicsGraphComputer sciencePhysics

Abstract

fetched live from OpenAlex

In a uniform random recursive k-directed acyclic graph, there is a root, 0, and each node in turn, from 1 to n, chooses k uniform random parents from among the nodes of smaller index. If Sn is the shortest path distance from node n to the root, then we determine the constant σ such that Sn/log n→σ in probability as n→∞. We also show that max 1≤i≤nSi/log n→σ in probability.

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.004
metaresearch head score (Gemma)0.035
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: none
Teacher disagreement score0.005
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.035
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.003
Science and technology studies0.0020.003
Scholarly communication0.0020.006
Open science0.0020.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0050.001

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.011
GPT teacher head0.250
Teacher spread0.239 · 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

Citations16
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueArkiv för matematikSame topicAlgorithms and Data CompressionFrench-language works237,207