{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299034,0.001073557,0.001121332,0.002939524,0.001300154,0.002019622,0.001791253,0.001803353,0.002326474],"category_scores_gemma":[0.02125192,0.0007412791,0.0009710857,0.002332206,0.003782659,0.003939538,0.002523467,0.001954346,0.0002944387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001719854,"about_ca_system_score_gemma":0.0005115911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008746114,"about_ca_topic_score_gemma":0.000796692,"domain_scores_codex":[0.9983991,0.0007778598,0.00006349963,0.0002697204,0.0002747919,0.0002150015],"domain_scores_gemma":[0.9754335,0.01818352,0.003215104,0.001167353,0.0007624942,0.001238069],"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.0003331056,0.0001668903,0.00468758,0.0002562091,0.00009372773,0.0006993275,0.000571352,0.2923698,0.009658431,0.669312,0.003083783,0.01876777],"study_design_scores_gemma":[0.00003535263,0.00009760446,0.0008399888,0.00003432289,0.00002842603,0.0003264195,0.00009255204,0.7465931,0.001883568,0.2488431,0.001196481,0.00002912344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4075578,0.002628694,0.5737762,0.003059646,0.000119334,0.0001461956,0.0002023878,0.0004472002,0.01206252],"genre_scores_gemma":[0.9600911,0.001244816,0.03484376,0.000288902,0.0002871845,0.000166554,0.000136016,0.0001123692,0.002829246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00299034,"threshold_uncertainty_score":0.0158146,"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."}}