{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005451232,0.0001366418,0.0002225561,0.00009380911,0.0001070697,0.00003519395,0.001105859,0.00004446662,0.000009592217],"category_scores_gemma":[0.0001182382,0.00007539392,0.00007497794,0.0004982746,0.0003631714,0.0001693546,0.0001923857,0.0001459324,0.000004937236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001033618,"about_ca_system_score_gemma":0.00003228755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003509702,"about_ca_topic_score_gemma":0.00001894788,"domain_scores_codex":[0.9985591,0.00004073274,0.000361796,0.0001749565,0.0005608521,0.0003026271],"domain_scores_gemma":[0.9978983,0.0006566418,0.000280696,0.0009025388,0.0002013817,0.00006047803],"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.00004708956,0.00003647845,0.0003867684,0.0001461796,0.0000575881,0.00000368975,0.001291302,0.00006926129,0.01290932,0.9837107,0.00002781605,0.001313828],"study_design_scores_gemma":[0.0004899777,0.0002948237,0.001159692,0.000143603,0.00001758892,0.00002086849,0.0009868186,0.005236814,0.1579708,0.8332046,0.0002399826,0.0002344636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4442568,0.0001363242,0.5478584,0.00006262941,0.00007881172,0.0003756623,0.00002064414,0.00005104692,0.007159738],"genre_scores_gemma":[0.8911842,0.00001995781,0.1086482,0.000008914203,0.00000912728,0.000001053,0.000001050074,0.0000136102,0.0001139584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4469273,"threshold_uncertainty_score":0.3074475,"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."}}