{"id":"W2119116325","doi":"10.1017/s0963548309990290","title":"Conflict-Free Colourings of Graphs and Hypergraphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Neighbourhood (mathematics); Vertex (graph theory); Lemma (botany); Upper and lower bounds; Graph; Chromatic scale; Discrete mathematics","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.001511399,0.0002315977,0.000408683,0.0002689169,0.0002619063,0.00009207043,0.001908245,0.0001045005,0.00000137154],"category_scores_gemma":[0.0006881881,0.0002372758,0.0001127618,0.001464656,0.000327838,0.0003660878,0.001055914,0.0003660635,0.000001550197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005922692,"about_ca_system_score_gemma":0.00006987763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007560571,"about_ca_topic_score_gemma":6.372611e-7,"domain_scores_codex":[0.9975758,0.0002016395,0.0005065916,0.0006855439,0.0005027234,0.0005276997],"domain_scores_gemma":[0.9971592,0.0005250247,0.000219194,0.001474088,0.0004164281,0.0002060113],"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.00001162725,0.0002095178,0.009404681,0.00006040159,0.00001123083,0.00000511148,0.0005109728,0.00005738907,0.000876599,0.9778544,0.00004467958,0.01095337],"study_design_scores_gemma":[0.0007578725,0.0004109896,0.02155998,0.00003734579,0.000004575665,0.00001744019,0.00001650216,0.008213989,0.002539543,0.9660839,0.0001316667,0.0002262344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9432079,0.000697325,0.05242458,0.0007159051,0.000229525,0.0005339244,0.000001801399,0.0003420642,0.001846957],"genre_scores_gemma":[0.9740596,0.00002699733,0.02577903,0.00009528721,0.000007047705,0.000003100573,6.843646e-7,0.000009068669,0.00001912587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03085174,"threshold_uncertainty_score":0.9675827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02230752856673305,"score_gpt":0.2705696345529421,"score_spread":0.248262105986209,"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."}}