MétaCan
Menu
Back to cohort
Record W2153541768 · doi:10.1002/rsa.10103

Random suffix search trees

2003· article· en· W2153541768 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.

Bibliographic record

VenueRandom Structures and Algorithms · 2003
Typearticle
Languageen
FieldComputer Science
TopicAlgorithms and Data Compression
Canadian institutionsMcGill University
Fundersnot available
KeywordsCombinatoricsMathematicsRandom binary treeBinary search treeSelf-balancing binary search treeIndependent and identically distributed random variablesTree (set theory)Optimal binary search treeB-treeSuffixSequence (biology)Suffix treeBinary numberDiscrete mathematicsBinary treeK-ary treeRandom variableStatisticsTree structureArithmetic

Abstract

fetched live from OpenAlex

Abstract A random suffix search tree is a binary search tree constructed for the suffixes X i = 0 · B i B i +1 B i +2 … of a sequence B 1 , B 2 , B 3 , … of independent identically distributed random b ‐ary digits B j . Let D n denote the depth of the node for X n in this tree when B 1 is uniform on ℤ b . We show that for any value of b > 1, 𝔼 D n = 2 log n + O (log 2 log n ), just as for the random binary search tree. We also show that D n /𝔼 D n → 1 in probability. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003

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.001
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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.791
Threshold uncertainty score0.766

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.252
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