{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005291475,0.001012912,0.001194361,0.002814348,0.004069749,0.005243764,0.001217808,0.002183991,0.0197574],"category_scores_gemma":[0.00258794,0.001141021,0.001297678,0.002050372,0.003896838,0.005554667,0.006439917,0.005403091,0.002628001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001276905,"about_ca_system_score_gemma":0.0006935516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001368483,"about_ca_topic_score_gemma":0.001933828,"domain_scores_codex":[0.9990394,0.000176043,0.00004543753,0.0001990897,0.0002252422,0.0003147391],"domain_scores_gemma":[0.9981997,0.0008208264,0.0001693996,0.0001677443,0.0001604058,0.0004818104],"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.00007589527,0.00003659459,0.0002193976,0.00005267234,0.000007605093,0.0002141363,0.0005214609,0.0004670618,0.0007770289,0.992631,0.002115271,0.00288187],"study_design_scores_gemma":[0.00003768881,0.00001253306,0.0002691766,0.00001956086,0.00001233606,0.0001413644,0.0003154035,0.001319584,0.0005823647,0.9905779,0.00669861,0.00001358094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5554525,0.0008623168,0.1612401,0.004578114,0.001122877,0.0001998012,0.001380692,0.001490417,0.2736732],"genre_scores_gemma":[0.9149232,0.000607555,0.0208241,0.0007545387,0.0004095621,0.0001749299,0.001356225,0.0006480185,0.06030178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0197574,"threshold_uncertainty_score":0.06609505,"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."}}