{"id":"W1997658699","doi":"10.1016/j.disc.2006.10.011","title":"The structure of well-covered graphs with no cycles of length 4","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Discrete mathematics; Equivalence relation; Graph; Vector space; Independent set","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.0003376392,0.0005016826,0.0006298603,0.002306281,0.001627513,0.002724164,0.001244345,0.001329645,0.004946335],"category_scores_gemma":[0.002563568,0.0009330169,0.0004795682,0.001613638,0.001566798,0.004278489,0.001190426,0.001058793,0.0006267742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000833977,"about_ca_system_score_gemma":0.000502574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009647875,"about_ca_topic_score_gemma":0.001137875,"domain_scores_codex":[0.9995816,0.00008938682,0.00001889851,0.0001037148,0.0001070771,0.0000992465],"domain_scores_gemma":[0.9970059,0.001252151,0.000648396,0.000312621,0.0003125918,0.0004684318],"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.0004781246,0.00008888958,0.004026481,0.0001877198,0.00005160755,0.000479777,0.001685965,0.006722602,0.01363513,0.9521812,0.006441339,0.01402112],"study_design_scores_gemma":[0.00006093864,0.00007288158,0.003592487,0.00003937715,0.00004641285,0.000496148,0.000528136,0.02163471,0.003403124,0.9637929,0.006297392,0.00003562148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.958644,0.0005572725,0.0205451,0.001000862,0.00003723411,0.00003267724,0.0008434968,0.0001787385,0.01816053],"genre_scores_gemma":[0.9782113,0.0005204754,0.01008707,0.0002590189,0.0001092752,0.00007098939,0.001458661,0.0001096684,0.009173559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004946335,"threshold_uncertainty_score":0.01654708,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01090387482020259,"score_gpt":0.2742881681302803,"score_spread":0.2633842933100777,"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."}}