{"id":"W4399371091","doi":"10.7155/jgaa.v28i1.2929","title":"The Minimum Consistent Spanning Subset Problem on Trees","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Spanning tree; Combinatorics; Minimum spanning tree; Mathematics; Computer science","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.0004577346,0.00007270651,0.00008973263,0.0001362925,0.0003199307,0.0005185492,0.000317846,0.00002499371,0.000002597551],"category_scores_gemma":[0.000007930681,0.0000433052,0.00007845256,0.0004355265,0.0000814331,0.0001856677,0.00004412736,0.0001840775,0.000005996375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001191843,"about_ca_system_score_gemma":0.00006705708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001709759,"about_ca_topic_score_gemma":0.000002037867,"domain_scores_codex":[0.9992012,0.00003214039,0.0002736381,0.0001334943,0.0002254205,0.0001341204],"domain_scores_gemma":[0.9992882,0.0002122839,0.00009503124,0.000165128,0.0001360319,0.000103344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004571902,0.00008579106,0.00005450116,0.00002125364,0.00008532403,0.00001246162,0.0004916115,0.001107657,0.0002336825,0.5495132,0.007662926,0.440727],"study_design_scores_gemma":[0.0005018372,0.0005044496,0.00114116,0.0002059499,0.0000364785,0.000327669,0.0003625015,0.2160837,0.0002122391,0.0958059,0.6845638,0.0002542897],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004627982,0.003853628,0.9787018,0.01468783,0.0001733214,0.0002931781,0.000005785204,0.00005284314,0.001768807],"genre_scores_gemma":[0.5182654,0.01754501,0.4567111,0.001698184,0.001286442,0.0004146311,0.00001014997,0.00006597732,0.00400307],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6769009,"threshold_uncertainty_score":0.5000382,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01845779344746803,"score_gpt":0.2757615769877305,"score_spread":0.2573037835402625,"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."}}