{"id":"W4389129622","doi":"10.1016/j.jctb.2023.11.005","title":"Hitting all maximum stable sets in P5-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Bounded function; Induced subgraph; Conjecture; Discrete mathematics; Graph; Vertex (graph theory); Induced path; Cardinality (data modeling); Longest path problem; Chordal graph; Computer science","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.0009831534,0.001308894,0.001971713,0.003417701,0.006185142,0.005625894,0.003438588,0.003081894,0.01598416],"category_scores_gemma":[0.007940405,0.001854008,0.001966656,0.003284381,0.003077067,0.006153252,0.004246605,0.003110609,0.002198232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001801245,"about_ca_system_score_gemma":0.001159446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002062225,"about_ca_topic_score_gemma":0.003899589,"domain_scores_codex":[0.9985874,0.0002421778,0.00007744602,0.0003533829,0.0003590468,0.0003805833],"domain_scores_gemma":[0.992366,0.004690757,0.0006639202,0.0006205105,0.0005869091,0.001071981],"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.001325342,0.0004283434,0.008059186,0.0006568849,0.0003233532,0.00160033,0.002920686,0.01993332,0.01222725,0.9022617,0.01624998,0.03401369],"study_design_scores_gemma":[0.0001521011,0.0001097577,0.001604303,0.00006869368,0.0001099748,0.000503567,0.0008516889,0.03366872,0.0057778,0.954245,0.002864368,0.00004394667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8924408,0.0004367441,0.05772825,0.001403593,0.0001327851,0.0001543135,0.001246655,0.0006959909,0.04576092],"genre_scores_gemma":[0.9658939,0.0002411527,0.01640743,0.0003387886,0.00007864712,0.0001733901,0.001790104,0.0002592687,0.01481734],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01598416,"threshold_uncertainty_score":0.05347228,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02160194537809893,"score_gpt":0.2915751323696592,"score_spread":0.2699731869915602,"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."}}