{"id":"W2082259377","doi":"10.1002/net.21590","title":"Formulations and exact solution approaches for the degree preserving spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Spanning tree; Degree (music); Minimum spanning tree; Mathematical optimization; Tree (set theory); Mathematics; Computer science; Minimum degree spanning tree; Distributed minimum spanning tree; Combinatorics","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.0009528588,0.00008787967,0.00008330131,0.00004725351,0.0003471846,0.0001590886,0.0005560397,0.00005358156,6.706828e-7],"category_scores_gemma":[0.00008867811,0.0000620687,0.00003369559,0.0002794605,0.00006450329,0.000592183,0.0003684598,0.0001560387,9.259616e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002873462,"about_ca_system_score_gemma":0.00003195881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008191551,"about_ca_topic_score_gemma":0.00005504592,"domain_scores_codex":[0.9990687,0.00006349591,0.0001202981,0.0002399853,0.0001729143,0.0003346117],"domain_scores_gemma":[0.9988685,0.0005061012,0.00005418465,0.0003986946,0.00008056139,0.00009192064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003455703,0.00002127836,0.002130046,0.00001394513,0.00002680527,6.754178e-7,0.0009529788,0.2165811,0.0000107942,0.2042057,0.001983505,0.5740387],"study_design_scores_gemma":[0.0002507235,0.00005020091,0.001998441,0.0000125029,0.000004848038,0.000004404996,0.00004937824,0.9169952,0.00000728915,0.07890972,0.001643979,0.00007331583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008415818,0.001243378,0.9941432,0.0008115461,0.00007794804,0.0005433283,4.964782e-7,0.00008165537,0.002256873],"genre_scores_gemma":[0.8636082,0.00001442715,0.1357177,0.00003625269,0.0001677409,0.0001626027,0.000003076509,0.00001140088,0.0002785175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8627667,"threshold_uncertainty_score":0.2670299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2254207703533971,"score_gpt":0.3143817814222265,"score_spread":0.08896101106882945,"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."}}