{"id":"W2558490395","doi":"10.1016/j.disc.2017.09.013","title":"Structure and algorithms for (cap, even hole)-free graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003684869,0.0001766978,0.0002438013,0.00008284092,0.0005806014,0.0005222262,0.002379562,0.00007327655,0.000005850732],"category_scores_gemma":[0.000568321,0.0001402926,0.00008366683,0.00007604808,0.0002457889,0.0005655826,0.0009271548,0.0001389873,0.000003708607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001169859,"about_ca_system_score_gemma":0.00002251715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002752912,"about_ca_topic_score_gemma":0.000006639247,"domain_scores_codex":[0.9987512,0.00002532443,0.0002017206,0.0003531325,0.0003100984,0.00035851],"domain_scores_gemma":[0.99719,0.0002162069,0.0001928189,0.002172399,0.00009713057,0.0001314431],"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.000005468125,0.00001809547,0.0001484051,0.0001571496,0.00003224496,0.000005622076,0.0008461866,0.000006841913,0.0007292539,0.9849629,0.0003765101,0.01271128],"study_design_scores_gemma":[0.000512892,0.00006740405,0.0004366159,0.00004099392,0.00000900636,0.00001213146,0.00009023752,0.04725459,0.002034123,0.9489145,0.0004322027,0.0001952664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02502954,0.0001443062,0.9717465,0.000931814,0.0001587749,0.0005883642,0.0001330474,0.00009895679,0.001168701],"genre_scores_gemma":[0.320242,0.00002495508,0.6790112,0.00004621836,0.00006371844,0.00004618489,0.000005766056,0.00003104663,0.000528887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2952125,"threshold_uncertainty_score":0.5720968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03568801725379487,"score_gpt":0.3306678270001661,"score_spread":0.2949798097463712,"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."}}