{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001703809,0.0003862257,0.0007510515,0.001365472,0.001000708,0.001670574,0.001377828,0.0009909293,0.003538722],"category_scores_gemma":[0.01363343,0.0006587169,0.000606011,0.0006925017,0.001693456,0.002728841,0.001452049,0.001287084,0.0003300243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001967169,"about_ca_system_score_gemma":0.0005769567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002292698,"about_ca_topic_score_gemma":0.002637016,"domain_scores_codex":[0.9992908,0.0001647764,0.00003130097,0.0001626464,0.0001833999,0.0001669515],"domain_scores_gemma":[0.9915065,0.005106238,0.00117243,0.0006710157,0.0006679886,0.0008758904],"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.0002723638,0.00008670207,0.01357133,0.0002012048,0.00007057223,0.0005600857,0.001000116,0.1149513,0.01798101,0.8253675,0.003335725,0.02260227],"study_design_scores_gemma":[0.00007479035,0.0001313943,0.006761667,0.00005165303,0.00005184679,0.0008235021,0.0002741003,0.556806,0.003485167,0.4274601,0.00402159,0.00005804294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8157262,0.0009477459,0.1734636,0.0004363728,0.00002466962,0.00008732721,0.0003953932,0.000304433,0.008614294],"genre_scores_gemma":[0.9799867,0.000274702,0.01678313,0.0001107561,0.00003485623,0.00006679474,0.0002269511,0.00007473824,0.002441387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003538722,"threshold_uncertainty_score":0.01427281,"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."}}