{"id":"W2401317033","doi":"","title":"The adjacent vertex-distinguishing total chromatic number of 1-tree.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Chromatic scale; Combinatorics; Tree (set theory); Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009628563,0.0004817317,0.0006032282,0.001874944,0.002214917,0.003225072,0.001931469,0.001253216,0.0120622],"category_scores_gemma":[0.005380085,0.0004092157,0.0005032091,0.001910072,0.002433471,0.005142762,0.001719122,0.002033241,0.001021401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002505938,"about_ca_system_score_gemma":0.001021708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002325447,"about_ca_topic_score_gemma":0.003007252,"domain_scores_codex":[0.9992036,0.0001811864,0.00003086933,0.000230911,0.0001489466,0.0002045904],"domain_scores_gemma":[0.9958531,0.002514721,0.000434406,0.0004402801,0.000291955,0.0004657017],"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.0004642007,0.0000811162,0.003964841,0.0002285315,0.00003270537,0.00009454492,0.0004009611,0.01114073,0.005687275,0.9390192,0.01454126,0.02434457],"study_design_scores_gemma":[0.00006432596,0.00005320766,0.003088228,0.0000522196,0.00006168542,0.0003620968,0.0003423384,0.0401846,0.003828008,0.9420843,0.009839542,0.00003938465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7905044,0.00119265,0.06706503,0.003587315,0.00033765,0.00008303943,0.002853159,0.0004246525,0.1339522],"genre_scores_gemma":[0.9690598,0.0004835019,0.01807404,0.0003028411,0.0001566391,0.00007243393,0.001234926,0.0001292753,0.01048655],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0120622,"threshold_uncertainty_score":0.04035205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00869605042671837,"score_gpt":0.236512851221053,"score_spread":0.2278168007943347,"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."}}