{"id":"W4251499002","doi":"10.1002/jgt.20036","title":"Graphs with independent perfect matchings","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Perfect graph theorem; Strong perfect graph theorem; Perfect graph; Trivially perfect graph; Matching (statistics); Discrete mathematics; Line graph; Graph; Pathwidth","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.00266372,0.0002056941,0.0003142387,0.0008472377,0.0001955776,0.0001405933,0.001663736,0.00006695413,0.00002187949],"category_scores_gemma":[0.00008459543,0.0001391378,0.000264402,0.001026571,0.0002661684,0.001179845,0.0001651146,0.0007361675,0.00001634973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007372459,"about_ca_system_score_gemma":0.0002062922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003511265,"about_ca_topic_score_gemma":0.000003718508,"domain_scores_codex":[0.9976788,0.0002933516,0.0004062723,0.0002567782,0.0009416797,0.0004230963],"domain_scores_gemma":[0.9982328,0.0002569706,0.0003937526,0.0005359714,0.0003234078,0.000257055],"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.0003271062,0.0001415922,0.0007481507,0.00001297583,0.0001193909,0.0004195616,0.001092278,0.001060786,0.002850948,0.986265,0.00002516734,0.006937024],"study_design_scores_gemma":[0.001406799,0.000911441,0.001971515,0.0001057483,0.00001614321,0.001574988,0.0002163398,0.000008040547,0.005354081,0.9881095,0.0001368781,0.0001885362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4206887,0.000593255,0.5768531,0.0004722705,0.0002231542,0.0001119319,8.189743e-7,0.00004916851,0.001007618],"genre_scores_gemma":[0.9704252,0.00009551882,0.0290757,0.0002596549,0.00004883105,0.000003282575,1.594335e-7,0.00002175558,0.00006987912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5497366,"threshold_uncertainty_score":0.5673877,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009461830976999132,"score_gpt":0.2545278158753462,"score_spread":0.2450659848983471,"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."}}