{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007200694,0.0005592758,0.0006754597,0.001213925,0.002086371,0.002661354,0.001518005,0.001079825,0.006347728],"category_scores_gemma":[0.003410106,0.0007425362,0.0005972745,0.001448339,0.001745783,0.003677233,0.001383657,0.001541573,0.0008211652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001325351,"about_ca_system_score_gemma":0.0009575224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002151375,"about_ca_topic_score_gemma":0.003635648,"domain_scores_codex":[0.9992873,0.0002141222,0.00002529723,0.000214451,0.0001077058,0.0001511807],"domain_scores_gemma":[0.9960908,0.001933519,0.0004139152,0.0005684098,0.0003659099,0.0006272923],"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.0005045419,0.0001948487,0.003088763,0.0002886215,0.00008578768,0.0003277483,0.0007879321,0.01372191,0.01777059,0.9203133,0.009903252,0.03301276],"study_design_scores_gemma":[0.00004908514,0.00004182354,0.001033322,0.00003311986,0.00003339351,0.0001904528,0.0002993045,0.02948318,0.003738611,0.9592916,0.00578462,0.00002153717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6431047,0.0007439355,0.2856398,0.002252323,0.0002496619,0.0001847527,0.001666413,0.0007543761,0.06540396],"genre_scores_gemma":[0.8575771,0.0005800971,0.1182996,0.0004254013,0.000203994,0.0002425364,0.001295124,0.0003598248,0.02101624],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006347728,"threshold_uncertainty_score":0.02123523,"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."}}