{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002550962,0.0006349797,0.001041668,0.001910962,0.0009315907,0.001722302,0.001490218,0.001257026,0.002650825],"category_scores_gemma":[0.01521715,0.0006696708,0.0005640193,0.001185455,0.002685204,0.003329604,0.001659303,0.001240079,0.0002751487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001206204,"about_ca_system_score_gemma":0.0003875406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005899545,"about_ca_topic_score_gemma":0.0005678788,"domain_scores_codex":[0.9986287,0.000565944,0.00006656374,0.0002389753,0.0002753001,0.0002244819],"domain_scores_gemma":[0.9824176,0.01248535,0.002589561,0.0009108051,0.0006698237,0.0009268243],"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.0004911084,0.0001758746,0.004829323,0.0002486605,0.0001103168,0.0006850492,0.0004045519,0.255502,0.01397572,0.7055926,0.00348491,0.01449997],"study_design_scores_gemma":[0.00005963517,0.00009978052,0.001367349,0.0000440966,0.00002543102,0.0003427497,0.00009148913,0.7042198,0.003354636,0.289395,0.0009708398,0.00002919259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7271904,0.0011099,0.260488,0.001345865,0.00006219246,0.00007133856,0.0001735612,0.0002615488,0.009297202],"genre_scores_gemma":[0.9899791,0.0002619237,0.00845058,0.0001086844,0.00007775913,0.00005130803,0.00008528562,0.00003729757,0.0009479805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002650825,"threshold_uncertainty_score":0.01349092,"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."}}