{"id":"W2606500388","doi":"10.1016/j.dam.2018.01.007","title":"Minimal obstructions to 2-polar cographs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Cograph; Combinatorics; Mathematics; Induced subgraph; Partition (number theory); Disjoint sets; Split graph; Multipartite; Induced path; Discrete mathematics; Graph; Polar; Chordal graph; 1-planar graph; Longest path problem","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003026867,0.0001922263,0.000215414,0.0002503353,0.0003010142,0.0001585165,0.001250939,0.00006180131,0.0000564339],"category_scores_gemma":[0.00007453508,0.0001719646,0.00007852257,0.001151475,0.0002561034,0.0001979201,0.0005186186,0.0001563036,0.0008283085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002571897,"about_ca_system_score_gemma":0.0000325027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001661116,"about_ca_topic_score_gemma":0.000005124196,"domain_scores_codex":[0.9983171,0.00001710123,0.0002969535,0.0004276666,0.0004369903,0.0005041615],"domain_scores_gemma":[0.998291,0.0001490952,0.00008082982,0.001110008,0.000119979,0.0002491523],"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.000007668697,0.00004116081,0.00001231533,0.00002198147,0.00002032172,0.00000227595,0.001985961,0.000005752923,0.01319063,0.9799115,0.0005647304,0.004235716],"study_design_scores_gemma":[0.0003851938,0.0002278504,0.0002178199,0.00003353186,0.00001634038,0.00003127458,0.0009839466,0.004873071,0.03361193,0.9490152,0.01006054,0.0005432888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02868704,0.00001320401,0.9355354,0.0002752798,0.0001481447,0.0004512074,0.00001178226,0.0002960633,0.03458183],"genre_scores_gemma":[0.3592488,0.000002319737,0.6401724,0.0001802768,0.00009205414,0.00008358368,0.000002508526,0.00002422152,0.0001938891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3305617,"threshold_uncertainty_score":0.9999496,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02074531159405537,"score_gpt":0.2972813654376966,"score_spread":0.2765360538436413,"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."}}