{"id":"W2143618826","doi":"10.5555/2634074.2634097","title":"Arboricity and spanning-tree packing in random graphs with an application to load balancing","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Random graph; Graph; Disjoint sets; Spanning tree; Degree (music); Minimum spanning tree; Discrete mathematics; Planar graph; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.001143617,0.0002456439,0.0002908183,0.0003145799,0.0001684475,0.0001840844,0.0006941229,0.00006543302,9.150781e-7],"category_scores_gemma":[0.00005629057,0.00020164,0.00003580284,0.0009928058,0.00009504022,0.0006122889,0.0002045782,0.000270024,0.00001167471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009570656,"about_ca_system_score_gemma":0.00005296293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001454148,"about_ca_topic_score_gemma":0.0002142361,"domain_scores_codex":[0.9975296,0.0002309982,0.0002427183,0.0008669228,0.0005919217,0.0005378292],"domain_scores_gemma":[0.9984386,0.0002195257,0.00008824507,0.0008606564,0.0001063659,0.0002866227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001807314,0.0004114451,0.04787087,0.0001350258,0.00008183288,0.0000819582,0.007432512,0.02531331,0.05602621,0.4530275,0.00003928982,0.4077727],"study_design_scores_gemma":[0.007119462,0.003382936,0.04516872,0.0003377132,0.00001941338,0.00004500444,0.0002403516,0.8299905,0.01634307,0.09478946,0.001084261,0.001479091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1311215,0.00003715933,0.8653305,0.0008456578,0.00006671048,0.0005814435,0.000002460664,0.0001504357,0.00186407],"genre_scores_gemma":[0.9536109,0.00001538592,0.04586405,0.0002561033,0.00006257593,0.0001296597,0.000004000245,0.00002631543,0.00003104074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8224893,"threshold_uncertainty_score":0.8222641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007603731631552604,"score_gpt":0.2650003601434302,"score_spread":0.2573966285118776,"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."}}