{"id":"W2096249258","doi":"10.1016/j.jctb.2013.11.003","title":"Packing of rigid spanning subgraphs and spanning trees","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spanning tree; Combinatorics; Minimum degree spanning tree; Minimum spanning tree; Connected dominating set; Mathematics; Connected component; Graph factorization; Graph; Connectivity; Vertex connectivity; Trémaux tree; Disjoint sets; Distance-hereditary graph; Discrete mathematics; Line graph; Graph power; Pathwidth","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.0002813908,0.0001168669,0.0003179621,0.0001499889,0.00005566232,0.00006291024,0.000104832,0.00005769357,0.0001192492],"category_scores_gemma":[0.00008280796,0.00009113061,0.0001003126,0.0001838611,0.00006602141,0.0006092194,0.00002044277,0.0001428976,6.572815e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000017091,"about_ca_system_score_gemma":0.000008876022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006061164,"about_ca_topic_score_gemma":5.806633e-7,"domain_scores_codex":[0.9991885,0.00004926091,0.0004132141,0.00005649014,0.0001678537,0.0001246701],"domain_scores_gemma":[0.9993473,0.00009549566,0.0002234049,0.00008051825,0.0001902796,0.00006296601],"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.0007343849,0.00008704339,0.03895297,0.0003776568,0.001962635,0.00004238887,0.008043679,0.1430533,0.1137925,0.6412793,0.001581137,0.050093],"study_design_scores_gemma":[0.002774112,0.0008038222,0.04501454,0.000522915,0.0003911738,0.0001922727,0.003838021,0.01046247,0.06585141,0.8676178,0.001807359,0.0007240583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9952264,0.0009751114,0.001330813,0.00003281279,0.001451913,0.00004625635,7.355711e-7,0.00002172834,0.0009142429],"genre_scores_gemma":[0.9983338,0.0002050749,0.001162923,0.00000563715,0.0002516226,7.422521e-7,7.738965e-7,0.00001478141,0.0000247195],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2263385,"threshold_uncertainty_score":0.3716198,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003737840103404133,"score_gpt":0.1803484334699583,"score_spread":0.1766105933665542,"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."}}