{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004430556,0.0007936837,0.001155195,0.001624668,0.00128423,0.002300837,0.00133823,0.001437188,0.006867234],"category_scores_gemma":[0.0045489,0.0009842104,0.0008663292,0.002866702,0.00153871,0.002932675,0.002241875,0.001320444,0.0008190981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005739256,"about_ca_system_score_gemma":0.0003409778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001405095,"about_ca_topic_score_gemma":0.001417787,"domain_scores_codex":[0.9993062,0.000186628,0.00004550371,0.0001372322,0.0001914349,0.0001329525],"domain_scores_gemma":[0.9980306,0.0008138714,0.0004342007,0.0003678837,0.0001064696,0.000246944],"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.0002811283,0.0002024231,0.002390473,0.0002544869,0.00008047451,0.0008594585,0.0006776634,0.1188224,0.006278492,0.8109201,0.007207201,0.05202553],"study_design_scores_gemma":[0.00002207506,0.00004429463,0.001156585,0.00002567971,0.00002728106,0.0002870225,0.0002029017,0.1502772,0.001146058,0.8440235,0.002770594,0.00001677842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6636256,0.00112285,0.2809866,0.0005501027,0.0001290326,0.00009951278,0.0007268491,0.0003703079,0.05238913],"genre_scores_gemma":[0.9256616,0.00103957,0.05978293,0.0001717644,0.0001567232,0.0001215896,0.00159774,0.0002231132,0.01124503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006867234,"threshold_uncertainty_score":0.02297318,"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."}}