{"id":"W3198964105","doi":"10.1007/978-3-030-86593-1_14","title":"Minimum Consistent Subset Problem for Trees","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Colored; Planar graph; Chromatic scale; Graph; Undirected graph; Mathematics; Time complexity; Computer science; Discrete mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091014,0.0004252738,0.0004809168,0.0004706735,0.0002799098,0.0007600464,0.002480225,0.0002602654,0.00001817337],"category_scores_gemma":[0.0001858027,0.0003876504,0.0001661435,0.0004151224,0.0003900554,0.0003838798,0.0008362169,0.0005411028,0.00002492919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001740425,"about_ca_system_score_gemma":0.0007041381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001514095,"about_ca_topic_score_gemma":0.0001513561,"domain_scores_codex":[0.996523,0.00004451647,0.0005133108,0.001690077,0.0006845951,0.0005445605],"domain_scores_gemma":[0.9969025,0.0006911904,0.0003259847,0.001581769,0.0003445985,0.0001539801],"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.000007329882,0.00004649639,0.0000919356,0.00009950783,0.00001739413,0.00003549297,0.000428193,0.006028601,0.0003266123,0.1296213,0.0003099563,0.8629872],"study_design_scores_gemma":[0.0006326855,0.000334725,0.0003968634,0.0006001669,0.00002313042,0.0001162456,4.900229e-7,0.8147749,0.0009234069,0.1133119,0.06779221,0.001093314],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000202904,0.0005988464,0.990762,0.003330813,0.001053194,0.0004974884,0.00002392165,0.0001598262,0.003553624],"genre_scores_gemma":[0.03513005,0.00006902473,0.959442,0.001728808,0.0005276682,0.00005250183,0.0001510425,0.00004344486,0.002855449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8618939,"threshold_uncertainty_score":0.9998575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02628647100805752,"score_gpt":0.2639921728160224,"score_spread":0.2377057018079649,"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."}}