{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002383717,0.001517605,0.00257868,0.00363931,0.00177355,0.005467239,0.004929935,0.003504115,0.00501099],"category_scores_gemma":[0.01989285,0.001820765,0.001735805,0.008240855,0.003825257,0.01262043,0.002922145,0.005856981,0.0009876324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002500106,"about_ca_system_score_gemma":0.001798792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001716378,"about_ca_topic_score_gemma":0.002588417,"domain_scores_codex":[0.9983345,0.0006198122,0.00009612339,0.0004262752,0.0003666478,0.0001566322],"domain_scores_gemma":[0.9805401,0.01672336,0.0009336246,0.0006855961,0.0007565389,0.0003607678],"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.00008150657,0.0001596302,0.0007153018,0.0006672021,0.00007421881,0.00008079859,0.0003727309,0.1131557,0.0006591775,0.7948224,0.0103974,0.07881379],"study_design_scores_gemma":[0.00001825013,0.00001688501,0.000131036,0.00005713448,0.00002559575,0.00008099958,0.0000722723,0.1660554,0.000212446,0.831004,0.002310548,0.00001546755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02828815,0.008236773,0.9490252,0.002312592,0.0002390226,0.00007280981,0.0004129345,0.0004061996,0.01100633],"genre_scores_gemma":[0.4251371,0.01662892,0.5390633,0.00110941,0.001748072,0.0005321215,0.001580109,0.0005033533,0.01369769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005467239,"threshold_uncertainty_score":0.0181396,"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."}}