{"id":"W4414474364","doi":"10.1016/j.disc.2025.114809","title":"On the structure of perfectly divisible graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique number; Induced subgraph; Graph; Perfect graph; Divisibility rule; Bounded function; Split graph; Clique graph","routes":{"ca_aff":true,"ca_fund":true,"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.0002847371,0.0001221026,0.0001732611,0.0001538929,0.0001332389,0.00006896286,0.001314899,0.00003935665,0.00003629038],"category_scores_gemma":[0.0003020697,0.00007054463,0.00009388743,0.0008297845,0.0001465586,0.0001050747,0.0003224207,0.0001908046,0.0000102911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001251517,"about_ca_system_score_gemma":0.00003556749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001277622,"about_ca_topic_score_gemma":0.000001740012,"domain_scores_codex":[0.9989671,0.00007798699,0.0002105333,0.0001960183,0.0003343569,0.0002140705],"domain_scores_gemma":[0.9979113,0.0008620435,0.00008505001,0.001036825,0.00007355214,0.00003116624],"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.000002912823,0.00002411503,0.00004131029,0.00007100797,0.00002278796,8.44179e-7,0.0005711702,0.0000749456,0.00447288,0.993779,0.0002720527,0.0006669541],"study_design_scores_gemma":[0.00009167559,0.00004496391,0.0000901555,0.00008602374,0.00000501878,0.000001118469,0.0001227154,0.0094915,0.03332243,0.9566137,0.00006159353,0.00006909219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2999051,0.0001158107,0.6764321,0.001392823,0.0001710417,0.000523823,0.00002052365,0.0001101329,0.02132863],"genre_scores_gemma":[0.9803785,0.000006015908,0.01900732,0.0001518439,0.000003987857,0.000005109216,8.637079e-7,0.000007459681,0.0004388912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6804734,"threshold_uncertainty_score":0.2876727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01446986753105458,"score_gpt":0.2910837840134021,"score_spread":0.2766139164823475,"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."}}