{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003433555,0.0002931757,0.0004786982,0.001380794,0.0007695419,0.001808119,0.0006412269,0.0006133941,0.004243017],"category_scores_gemma":[0.00311171,0.0003828586,0.0004297753,0.0008490996,0.001567691,0.003043548,0.001646174,0.0007706999,0.0004079754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004065531,"about_ca_system_score_gemma":0.0002697496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005486983,"about_ca_topic_score_gemma":0.0005970428,"domain_scores_codex":[0.9996897,0.00004585829,0.0000185509,0.0000808046,0.00007099624,0.00009406828],"domain_scores_gemma":[0.9980348,0.00104287,0.0003549703,0.0001640971,0.0001523392,0.0002509592],"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.0002608639,0.0000414445,0.002113701,0.0001460171,0.00002565876,0.0004512872,0.0006993376,0.006855023,0.01244442,0.9581814,0.001240389,0.01754046],"study_design_scores_gemma":[0.0000529714,0.00009023002,0.001700515,0.00004816454,0.00004543718,0.0007694511,0.0007184937,0.03107531,0.008218973,0.9518927,0.005361465,0.00002631012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.832287,0.0007642182,0.1461694,0.0003170635,0.00005536036,0.00004616039,0.0002245711,0.0002995941,0.0198367],"genre_scores_gemma":[0.9768529,0.0003204095,0.01846404,0.00005322048,0.0000313139,0.00004428532,0.0002264366,0.00005058593,0.003956803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004243017,"threshold_uncertainty_score":0.01419431,"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."}}