{"id":"W4404995978","doi":"10.48550/arxiv.2411.18614","title":"Optimal root recovery for uniform attachment trees and $d$-regular growing trees","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Root (linguistics); Combinatorics; Tree (set theory); Mathematics; Set (abstract data type); Upper and lower bounds; Preferential attachment; Binary logarithm; Discrete mathematics; Computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.004224132,0.001351432,0.001881488,0.001104243,0.001377712,0.00235158,0.00380026,0.003172582,0.004651334],"category_scores_gemma":[0.04182387,0.0009685322,0.00119366,0.00151829,0.002630898,0.005231429,0.003973734,0.003216449,0.001529473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002265527,"about_ca_system_score_gemma":0.001307577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001649577,"about_ca_topic_score_gemma":0.002413091,"domain_scores_codex":[0.9974598,0.0007804784,0.0001607596,0.0009333059,0.0003917759,0.0002738251],"domain_scores_gemma":[0.9698111,0.02303663,0.001611141,0.003722725,0.0009373917,0.0008810819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001521913,0.0004003533,0.006122828,0.0009384794,0.0001944459,0.0004063308,0.0009034268,0.5239948,0.01990682,0.3048851,0.01344667,0.1272788],"study_design_scores_gemma":[0.00009591266,0.00009391118,0.0004905448,0.00004147803,0.00003583628,0.0001354093,0.00007120436,0.816296,0.003316546,0.1782225,0.001177521,0.00002317364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1736494,0.001623348,0.8136068,0.001962453,0.0000989328,0.0001666679,0.0005812381,0.001330727,0.006980456],"genre_scores_gemma":[0.6339535,0.0008723858,0.3575633,0.0007898354,0.0001510093,0.0003322737,0.001126347,0.0006525212,0.004558781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004651334,"threshold_uncertainty_score":0.02233964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08551445399600212,"score_gpt":0.2473959607276376,"score_spread":0.1618815067316355,"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."}}