{"id":"W2516383456","doi":"10.1002/rsa.20743","title":"Arboricity and spanning‐tree packing in random graphs","year":2017,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Toronto; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Minimum spanning tree; Degeneracy (biology); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Planar graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006865817,0.0002131534,0.0004077145,0.0001940916,0.0006571117,0.0006096128,0.0007399971,0.00008261032,0.00000457225],"category_scores_gemma":[0.0002567708,0.0001660492,0.00006423386,0.0001479935,0.0003443415,0.0006390627,0.000496399,0.000314413,5.885253e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001215417,"about_ca_system_score_gemma":0.00002518264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001297932,"about_ca_topic_score_gemma":0.00005036482,"domain_scores_codex":[0.9983882,0.0001267564,0.000224295,0.0005381233,0.000286577,0.0004360233],"domain_scores_gemma":[0.9986764,0.000314851,0.0001402321,0.0006631695,0.00004777109,0.0001576356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007905494,0.0000313321,0.0330611,0.00006847054,0.00007106827,0.0002479477,0.001477714,0.00009656852,0.001292562,0.1885391,0.0000469086,0.7742766],"study_design_scores_gemma":[0.02272824,0.0000935418,0.2068769,0.00006936167,0.00001085312,0.00008647715,0.00006389213,0.02891048,0.001271673,0.7389005,0.000538315,0.0004496904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7837275,0.003799309,0.2085641,0.0008113861,0.0005935535,0.0007367277,0.00001090118,0.0001193615,0.001637123],"genre_scores_gemma":[0.9828905,0.0005083412,0.01640063,0.00005286287,0.00007612706,0.00001449571,9.231613e-7,0.00001165359,0.00004439741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.773827,"threshold_uncertainty_score":0.677129,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01807456090055291,"score_gpt":0.2960829136122864,"score_spread":0.2780083527117335,"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."}}