{"id":"W2175518075","doi":"10.1016/j.disc.2003.05.001","title":"Induced matchings in intersection graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Split graph; Block graph; Discrete mathematics; Pathwidth; Induced subgraph; Intersection graph; Matching (statistics); Interval graph; 1-planar graph; Cograph; Line graph; Graph; Vertex (graph theory)","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.0006691866,0.0001315995,0.0001657098,0.0002841035,0.00006377183,0.00009914657,0.0005464577,0.00005391336,0.00001891492],"category_scores_gemma":[0.0002264247,0.0001161494,0.00006368029,0.0007808325,0.00003861854,0.0004431513,0.0001175417,0.000241585,0.00005820512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005094087,"about_ca_system_score_gemma":0.0000261809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006152003,"about_ca_topic_score_gemma":0.00001266643,"domain_scores_codex":[0.9987804,0.0001058384,0.0002696711,0.00026002,0.0002726573,0.0003114203],"domain_scores_gemma":[0.9991422,0.0001358554,0.00007839309,0.0005361455,0.0000368277,0.00007056832],"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.000001727759,0.00004883338,0.000208977,0.00003048801,0.000005520597,0.000009423743,0.003014666,0.00001784224,0.002573416,0.99313,0.00001450591,0.0009445663],"study_design_scores_gemma":[0.0002445627,0.00004834045,0.0001768078,0.00005341107,0.000001545621,0.00002684117,0.0006965099,0.007350218,0.006722695,0.9844009,0.0001108106,0.0001674022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4400026,0.00001907905,0.5449464,0.00009743193,0.000145781,0.0002168389,6.008592e-7,0.0001137475,0.01445757],"genre_scores_gemma":[0.923646,0.000004104708,0.07612487,0.00005003002,0.000004317058,0.00002470527,5.928414e-7,0.00001404815,0.0001313834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4836434,"threshold_uncertainty_score":0.4736433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02698763385987632,"score_gpt":0.3014352730218232,"score_spread":0.2744476391619469,"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."}}