{"id":"W2132073309","doi":"10.1016/s0012-365x(03)00197-3","title":"Coloring the hypergraph of maximal cliques of a graph with no long path","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Graph; Discrete mathematics; Fractional coloring; Graph coloring; Graph power; Line graph","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.0007666767,0.0002609233,0.0005426381,0.0001028518,0.0001576239,0.00001886945,0.0003865827,0.00009507313,0.00006837171],"category_scores_gemma":[0.0004724131,0.0001403065,0.0002265972,0.0003239814,0.000477101,0.00007811894,0.00008088152,0.0001931016,0.000001417365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001013423,"about_ca_system_score_gemma":0.00003460034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005016496,"about_ca_topic_score_gemma":0.000006680158,"domain_scores_codex":[0.998319,0.0001257998,0.0006320896,0.0001915164,0.0004454374,0.0002861281],"domain_scores_gemma":[0.9977267,0.0007096579,0.0005254144,0.0007640027,0.0002175485,0.00005672225],"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.00004516792,0.0001159772,0.002446462,0.0008516118,0.0001942669,0.000005380145,0.003988091,0.000006557986,0.0004153152,0.9917805,0.00009015909,0.00006056923],"study_design_scores_gemma":[0.0004617232,0.0003309452,0.0004880893,0.0004352451,0.0002537267,0.00005326015,0.002272984,0.0001265939,0.01456656,0.9805797,0.0001419806,0.0002891724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9603713,0.0001807808,0.009593562,0.00002072723,0.0001145953,0.0004901582,0.00002685425,0.00005147425,0.02915056],"genre_scores_gemma":[0.938718,0.00004817788,0.06096557,0.00002128814,0.00002175875,0.00002353405,0.000001569577,0.00004774001,0.0001523098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05137201,"threshold_uncertainty_score":0.5721532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01983438949883126,"score_gpt":0.2645574246920283,"score_spread":0.244723035193197,"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."}}