{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348445,0.000638139,0.001773191,0.0008801973,0.0007921556,0.001981271,0.001666572,0.001763451,0.007804242],"category_scores_gemma":[0.006109277,0.0007034356,0.001015975,0.001918495,0.001025332,0.004391405,0.001350275,0.003504771,0.001095161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007803426,"about_ca_system_score_gemma":0.0007986774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005197263,"about_ca_topic_score_gemma":0.000660766,"domain_scores_codex":[0.9989915,0.0003862049,0.00005766751,0.000173592,0.0003248341,0.00006615082],"domain_scores_gemma":[0.9968832,0.002413857,0.0001144889,0.000308048,0.000187368,0.00009299524],"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.0002655612,0.0001480653,0.0005470121,0.0007987194,0.00008323132,0.000160186,0.0003828973,0.0471849,0.003875835,0.6850361,0.05355072,0.2079667],"study_design_scores_gemma":[0.00005389811,0.00004472783,0.0002749494,0.00005917602,0.00002390287,0.0001771103,0.00007236547,0.07818323,0.001078366,0.9084789,0.01154239,0.00001110037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04088651,0.003081033,0.9160864,0.003860581,0.0002753688,0.0001685841,0.001719128,0.0005576724,0.03336464],"genre_scores_gemma":[0.283212,0.003305646,0.6802063,0.0006920505,0.0009099634,0.0006321876,0.005674938,0.0007229876,0.02464392],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007804242,"threshold_uncertainty_score":0.02610779,"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."}}