{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004460107,0.0001228856,0.0001653581,0.00002815264,0.0002528607,0.0001300478,0.0006635015,0.00004583575,0.000004078451],"category_scores_gemma":[0.0002069597,0.00008931738,0.00007902602,0.0003579582,0.00005607529,0.0001605775,0.0001285049,0.0001312586,0.00004284233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002370367,"about_ca_system_score_gemma":0.00004622209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002293818,"about_ca_topic_score_gemma":0.000001352306,"domain_scores_codex":[0.9987479,0.00006784995,0.0003114606,0.0002320752,0.0003567372,0.0002839658],"domain_scores_gemma":[0.998813,0.0001996654,0.0001476038,0.0006239647,0.0001310262,0.00008475393],"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.000002236223,0.00008209408,0.000545987,0.000005713983,0.00001011945,0.000005017486,0.0002858361,0.00001355707,0.0005254675,0.9880477,0.001827063,0.008649278],"study_design_scores_gemma":[0.0004566485,0.00009138427,0.005572592,0.00006670502,0.000006951201,0.00002141142,0.00001973871,0.008776662,0.001300614,0.9833605,0.000197468,0.0001293373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9867336,0.0004171022,0.000181392,0.001241766,0.00258849,0.0001353507,3.876876e-7,0.0001771213,0.008524759],"genre_scores_gemma":[0.9976808,0.00001168779,0.002008591,0.0001312205,0.000001342361,0.000003169465,7.380106e-7,0.000005535925,0.0001568535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01094723,"threshold_uncertainty_score":0.3642257,"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."}}