{"id":"W2399115616","doi":"","title":"On perfect matchings of complements of line graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Strong perfect graph theorem; Combinatorics; Line (geometry); Line graph; Graph; Pathwidth; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009239977,0.0006663444,0.001039182,0.002917224,0.002913982,0.003833693,0.001275891,0.001848476,0.01648341],"category_scores_gemma":[0.007819328,0.0008483665,0.00106984,0.002722294,0.00280933,0.008460551,0.00300399,0.001886778,0.002054013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001626519,"about_ca_system_score_gemma":0.0007817474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002409765,"about_ca_topic_score_gemma":0.003009642,"domain_scores_codex":[0.9985598,0.0004626461,0.00007681762,0.0002923228,0.000296954,0.0003114658],"domain_scores_gemma":[0.9954714,0.002553649,0.0007538762,0.0003599303,0.0004051354,0.0004560864],"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.00009424171,0.00004108447,0.0006709693,0.00009586173,0.0000222111,0.0002205622,0.0003110108,0.001778341,0.0007501504,0.9803945,0.004557744,0.01106328],"study_design_scores_gemma":[0.00002313569,0.00002549838,0.0005017631,0.00006969662,0.00002986574,0.0003545808,0.0003200317,0.008158407,0.0008191452,0.980217,0.009462267,0.00001867048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.506825,0.00266431,0.2248062,0.002547496,0.0007151901,0.0002421573,0.001826217,0.0008243415,0.2595491],"genre_scores_gemma":[0.9215063,0.001551192,0.03995878,0.0006416884,0.00041761,0.0001456777,0.001714831,0.0002848999,0.03377896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01648341,"threshold_uncertainty_score":0.05514246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01831039347412789,"score_gpt":0.3032759917307409,"score_spread":0.2849655982566131,"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."}}