{"id":"W4402461337","doi":"10.1137/23m157627x","title":"Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Spanning tree; Combinatorics; Minimum spanning tree; Algorithm; Discrete mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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.001679756,0.0001230335,0.0001273747,0.0008910921,0.0001336919,0.0005071388,0.0003136871,0.00005583118,0.00002302829],"category_scores_gemma":[0.0001777217,0.0001033524,0.00004764391,0.0009992389,0.00006694953,0.001044161,0.00008656528,0.0004429122,0.000006755407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004762424,"about_ca_system_score_gemma":0.000057236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.148356e-7,"about_ca_topic_score_gemma":7.904773e-7,"domain_scores_codex":[0.9985737,0.0003533098,0.0002484699,0.0002671621,0.0003009906,0.0002563968],"domain_scores_gemma":[0.999084,0.0005147784,0.00005742813,0.0001734102,0.00006394305,0.0001064344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006858946,0.00004101014,0.0001680454,0.00001564779,0.00002503812,0.0002461852,0.001505756,0.5901849,0.0002282254,0.3186097,0.00009665872,0.08881031],"study_design_scores_gemma":[0.0003241133,0.0001970935,0.0003277894,0.0002459486,0.000003157488,0.0001675373,0.0001103467,0.8409053,0.0001176494,0.156973,0.0004836191,0.0001444013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005228286,0.001427835,0.9911171,0.0006959225,0.0003569412,0.00009732364,0.000001066705,0.0000820473,0.0009934828],"genre_scores_gemma":[0.7340166,0.002721671,0.2619975,0.0003689052,0.0001911804,0.00001517919,0.00000409876,0.00004635352,0.0006384625],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7291195,"threshold_uncertainty_score":0.4890352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01727637826205133,"score_gpt":0.3002095516113,"score_spread":0.2829331733492487,"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."}}