{"id":"W3083134037","doi":"10.1002/rsa.20391","title":"Depth Properties of scaled attachment random recursive trees","year":2011,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Random walk; Binary logarithm; Tree (set theory); Random variable; Random graph; Sequence (biology); Preferential attachment; Random binary tree; Random tree; Discrete mathematics; Binary tree; Statistics; Graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002068914,0.0002217613,0.0005946935,0.00005449147,0.0001020158,0.00002112131,0.0001459542,0.00009105264,0.0001112307],"category_scores_gemma":[0.000462272,0.0001416932,0.00009525825,0.00007287904,0.0001427452,0.00005606593,0.00006122857,0.0001189601,0.00000137426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001052369,"about_ca_system_score_gemma":0.00002724332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004358145,"about_ca_topic_score_gemma":0.00001754869,"domain_scores_codex":[0.9987596,0.00005587742,0.0004145453,0.0002580735,0.0002582246,0.0002536258],"domain_scores_gemma":[0.9991081,0.0002927857,0.0001761053,0.000186626,0.0001214934,0.0001149008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.009745105,0.0003826806,0.0001659036,0.001512639,0.0007587976,0.00005282223,0.01089359,0.00000674904,0.003641941,0.7886558,0.0006304141,0.1835536],"study_design_scores_gemma":[0.01497707,0.0003992236,0.0004889888,0.0002069903,0.0002866934,0.0000558655,0.0007105815,0.003287759,0.02557924,0.9535701,0.00008214903,0.0003553113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1467887,0.003374295,0.8454707,0.00007127628,0.0005226818,0.001258215,0.0001018607,0.0001006247,0.002311665],"genre_scores_gemma":[0.9375351,0.0001400521,0.06206122,0.00002946877,0.00008156038,0.00003599757,0.000002709425,0.00002244071,0.00009145281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7907464,"threshold_uncertainty_score":0.5778082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0614846637957399,"score_gpt":0.2928030503401969,"score_spread":0.231318386544457,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}