{"id":"W1992400796","doi":"10.1016/s0012-365x(01)00054-1","title":"On the divisibility of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Mathematics; Combinatorics; Divisibility rule; Perfect graph; Perfect graph theorem; Conjecture; Trivially perfect graph; Induced subgraph; Split graph; Discrete mathematics; Graph; Clique number; Vertex (graph theory); Partition (number theory); Cograph; Chromatic scale; Line graph; Pathwidth","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.0006005004,0.0001012195,0.0001465782,0.00006489442,0.00009511822,0.00004232932,0.001177068,0.00002615216,0.0001280314],"category_scores_gemma":[0.0004348797,0.00005796968,0.0001010484,0.0004596522,0.0001873287,0.0001246764,0.0002315849,0.0001402216,0.00009090501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009781768,"about_ca_system_score_gemma":0.00000437036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.033757e-7,"about_ca_topic_score_gemma":5.061713e-7,"domain_scores_codex":[0.9988506,0.00008898918,0.0002313052,0.000191807,0.000428193,0.0002090962],"domain_scores_gemma":[0.9975466,0.000968164,0.0001000299,0.001280136,0.00005741995,0.0000477186],"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":[9.375262e-7,0.00007814376,0.00003670199,0.00002690176,0.000008830348,0.000001173215,0.00114919,0.00001743478,0.0001463867,0.9970771,0.0002571059,0.001200059],"study_design_scores_gemma":[0.00007162388,0.00006440868,0.00009205741,0.00002657163,0.00000212807,0.000001845142,0.00007768338,0.05468935,0.002234624,0.9426198,0.00004797797,0.00007194087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2458275,0.0001160747,0.7068018,0.001727972,0.00009659991,0.0005534178,0.00001133692,0.0001444635,0.0447208],"genre_scores_gemma":[0.9814726,0.00000966577,0.01811511,0.00007871015,0.000004435136,0.00001369877,2.376317e-7,0.000007975073,0.0002976378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7356451,"threshold_uncertainty_score":0.2363935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04652455214468322,"score_gpt":0.2935728521492843,"score_spread":0.2470483000046011,"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."}}