{"id":"W2249548238","doi":"10.1002/jgt.22258","title":"On the structure of (banner, odd hole)‐free graphs","year":2018,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","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","keywords":"Combinatorics; Mathematics; Perfect graph; Chordal graph; Induced subgraph; Split graph; Perfect graph theorem; Vertex (graph theory); Discrete mathematics; Wheel graph; Graph; Graph power; 1-planar graph; Line graph; Pathwidth","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":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004377982,0.0005042314,0.0008438203,0.001436893,0.0002377765,0.0001763888,0.00995927,0.0003864857,0.0001515915],"category_scores_gemma":[0.001366969,0.0003035904,0.00104372,0.00105213,0.001321177,0.000337972,0.002509468,0.002896976,0.000007238132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000598902,"about_ca_system_score_gemma":0.0003393755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003057793,"about_ca_topic_score_gemma":0.00000366514,"domain_scores_codex":[0.9944593,0.001684326,0.001087317,0.0005435506,0.001670707,0.0005548556],"domain_scores_gemma":[0.9910031,0.002165789,0.002076599,0.003339858,0.001181432,0.0002332168],"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.0003874053,0.0001076106,0.00005302412,0.00007327412,0.0003862553,0.00004960358,0.000554456,0.0006339315,0.002489038,0.9877555,0.004723439,0.00278645],"study_design_scores_gemma":[0.00048069,0.000613389,0.0004130722,0.0004693479,0.00004772494,0.00008487233,0.000103598,0.0001230115,0.01203069,0.9851104,0.0002388179,0.0002843783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7467739,0.004695022,0.2353919,0.002370644,0.005192735,0.000984367,0.0002274764,0.0001107386,0.004253172],"genre_scores_gemma":[0.9913529,0.0003696987,0.007363501,0.0004465437,0.0002961498,0.000003430401,0.000001920771,0.00004969679,0.0001161917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2445789,"threshold_uncertainty_score":0.9999416,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02039802155274871,"score_gpt":0.286452243771761,"score_spread":0.2660542222190123,"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."}}