{"id":"W2110393165","doi":"10.37236/3153","title":"Nonrepetitive Colourings of Planar Graphs with $O(\\log n)$ Colours","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Australian Research Council; Australian Government","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Chromatic scale; Graph; Bounded function; Outerplanar graph; Upper and lower bounds; Path (computing); Discrete mathematics; Pathwidth; Line graph; Computer science","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.001386243,0.0001618644,0.0003312182,0.0002407427,0.0001408057,0.00005657435,0.001965544,0.0000541688,0.00001235917],"category_scores_gemma":[0.0001022842,0.00009887591,0.0001180809,0.001052334,0.0002753662,0.0005454469,0.000113023,0.0008643873,0.000009076234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001851803,"about_ca_system_score_gemma":0.0005832276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001490425,"about_ca_topic_score_gemma":0.000005051697,"domain_scores_codex":[0.997758,0.0002577876,0.0003888784,0.0001580489,0.0007519124,0.0006853459],"domain_scores_gemma":[0.99734,0.0005884452,0.0005992223,0.0004687388,0.0008819348,0.0001217203],"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.00008345984,0.0001201977,0.0007602755,0.000007962475,0.0001172007,0.00001500828,0.0003619493,0.00005785646,0.0006486512,0.9972009,0.0002219285,0.0004046079],"study_design_scores_gemma":[0.0009132953,0.002769157,0.001787916,0.00003791039,0.00002018984,0.0003233664,0.0002013743,0.0001510022,0.005978463,0.9873274,0.0003643351,0.0001255934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.76693,0.001583961,0.227038,0.002414854,0.0002225952,0.0004411565,8.677821e-7,0.00003165739,0.001336987],"genre_scores_gemma":[0.9988077,0.0003110834,0.0005637415,0.00006900048,0.0000160598,0.000008782958,1.650095e-7,0.00001472117,0.0002087889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2318777,"threshold_uncertainty_score":0.4032042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006035786116298683,"score_gpt":0.2290286958457537,"score_spread":0.222992909729455,"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."}}