{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005366833,0.0005207243,0.00124184,0.000190804,0.0001392058,0.0001519727,0.0003135337,0.0004264587,0.0001094476],"category_scores_gemma":[0.001610028,0.0003531852,0.0001855631,0.00009888731,0.00008358999,0.00009088447,0.0004510339,0.0006558218,0.000001937466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005764813,"about_ca_system_score_gemma":0.0001004028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004176967,"about_ca_topic_score_gemma":0.00002948511,"domain_scores_codex":[0.9975601,0.0001082131,0.0007125892,0.0006958148,0.0004000694,0.000523171],"domain_scores_gemma":[0.9967088,0.002430159,0.0002786154,0.0003506062,0.00006774499,0.0001640998],"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.00226758,0.00009558631,0.00007012936,0.002487994,0.0004476988,0.0002969469,0.001654129,0.000127585,0.000458918,0.7217855,0.0009307432,0.2693772],"study_design_scores_gemma":[0.01190887,0.0000453776,0.000101976,0.0008644491,0.0001261476,0.00003512992,0.00010039,0.01013353,0.0002168777,0.9757671,0.0001978133,0.00050234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02208887,0.002611142,0.9708604,0.0003993147,0.001514391,0.001082886,0.0003903832,0.0001290625,0.000923533],"genre_scores_gemma":[0.9254586,0.0007126062,0.07203861,0.0001360327,0.001051262,0.0001759159,0.0000367111,0.0001191132,0.0002711717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9033697,"threshold_uncertainty_score":0.999892,"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."}}