{"id":"W1702956999","doi":"10.1002/rsa.20649","title":"Finding Adam in random growing trees","year":2016,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Ministerio de Ciencia y Tecnología","keywords":"Preferential attachment; Combinatorics; Vertex (graph theory); Mathematics; Tree (set theory); Exponential growth; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Graph; Complex network","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.00356886,0.0008391372,0.00176036,0.001329067,0.00129369,0.002035903,0.001961374,0.002108069,0.00332323],"category_scores_gemma":[0.02554328,0.001032689,0.001221864,0.001135206,0.002189477,0.003521597,0.002258151,0.001888275,0.0008177579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001376875,"about_ca_system_score_gemma":0.0008236721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008287544,"about_ca_topic_score_gemma":0.001159143,"domain_scores_codex":[0.998149,0.000865062,0.0001069141,0.0004559954,0.0002451794,0.0001777037],"domain_scores_gemma":[0.9797472,0.01653088,0.001259213,0.001180846,0.000624586,0.000657333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005358639,0.0001535648,0.006693902,0.0005259679,0.0001589397,0.0004407051,0.0007012587,0.5766267,0.005001923,0.3381758,0.006369334,0.06461619],"study_design_scores_gemma":[0.00004370733,0.00004175226,0.0002288771,0.0000272106,0.00001603768,0.0000913251,0.00003950767,0.8134655,0.001154268,0.1839199,0.0009612684,0.00001048154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2849437,0.0008839428,0.7066562,0.001357158,0.00007956924,0.0001441873,0.0002464552,0.0009447068,0.004743996],"genre_scores_gemma":[0.7340002,0.0004280945,0.2598999,0.0002929542,0.00007727636,0.0002097558,0.0004812324,0.0002838865,0.004326737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00356886,"threshold_uncertainty_score":0.01887417,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03529323304074504,"score_gpt":0.3187274823374269,"score_spread":0.2834342492966818,"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."}}