{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096474,0.001392505,0.0008984075,0.001145854,0.002078731,0.003131822,0.004031861,0.001476086,0.01333543],"category_scores_gemma":[0.01102463,0.001377613,0.001360647,0.001877881,0.003306905,0.007477257,0.003659737,0.002805794,0.002757115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002381604,"about_ca_system_score_gemma":0.001111188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002968289,"about_ca_topic_score_gemma":0.008144014,"domain_scores_codex":[0.9975581,0.0005972763,0.0001389764,0.000603794,0.0005022448,0.0005996226],"domain_scores_gemma":[0.9787722,0.01426498,0.002086241,0.003446876,0.0006897836,0.0007399346],"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.002293495,0.0008494697,0.009880831,0.002198656,0.000258792,0.001712225,0.002328982,0.1605864,0.09595454,0.5152998,0.03353354,0.1751032],"study_design_scores_gemma":[0.0002550143,0.0003660824,0.005009525,0.0001582494,0.0002127635,0.001655678,0.0005607019,0.2248323,0.02978977,0.7136522,0.02339404,0.0001138174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5680768,0.002541224,0.3459667,0.002926253,0.0002308051,0.0004011711,0.001517564,0.00276821,0.07557125],"genre_scores_gemma":[0.7746549,0.001985227,0.1918019,0.00105744,0.0003000267,0.0003812752,0.003188854,0.001440242,0.0251902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01333543,"threshold_uncertainty_score":0.04461145,"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."}}