{"id":"W97986267","doi":"","title":"Splitters and barriers in open graphs having a perfect internal matching","year":2008,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Strong perfect graph theorem; Matching (statistics); Combinatorics; Perfect graph; Mathematics; Context (archaeology); Chordal graph; Discrete mathematics; Computer science; Graph; Pathwidth; Line graph; 1-planar graph; Statistics","routes":{"ca_aff":true,"ca_fund":false,"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.0005242155,0.0001516278,0.0001954505,0.0002339796,0.0001799116,0.0002384423,0.001737335,0.00004559483,0.00004247111],"category_scores_gemma":[0.000127004,0.000145827,0.0000403626,0.0004134402,0.0002373323,0.0008456219,0.00154657,0.0003365152,0.00001311878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004511463,"about_ca_system_score_gemma":0.00006402342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003495866,"about_ca_topic_score_gemma":0.00005969867,"domain_scores_codex":[0.9983884,0.0001709466,0.0002031833,0.0005223546,0.0002611818,0.0004539517],"domain_scores_gemma":[0.9989366,0.0002443763,0.00004603753,0.0005082366,0.00002548942,0.0002392625],"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.0003280782,0.0002038277,0.3449655,0.00007100437,0.0001240912,0.001927574,0.04396439,0.0001504547,0.03679876,0.5062793,0.001435251,0.06375182],"study_design_scores_gemma":[0.004809525,0.000726781,0.4363611,0.0005301932,0.000015644,0.001840582,0.001377885,0.01877086,0.005920098,0.5224966,0.005323885,0.001826822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9849617,0.00009805665,0.008420134,0.0007604277,0.00007636132,0.0002759339,9.930086e-7,0.00005006398,0.00535628],"genre_scores_gemma":[0.9852905,0.00007518221,0.0140101,0.000302474,0.00001096938,0.00002417141,4.582402e-7,0.00001496923,0.0002712278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09139567,"threshold_uncertainty_score":0.5946651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01903305142870743,"score_gpt":0.2841289702447476,"score_spread":0.2650959188160402,"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."}}