{"id":"W2399871227","doi":"","title":"Upper Bounds on the D(β)-Vertex-Distinguishing Total-Chromatic Number of Graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chromatic scale; Vertex (graph theory); Combinatorics; Brooks' theorem; Graph; Discrete mathematics; 1-planar graph; Chordal 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.003035906,0.00174218,0.001117769,0.003267831,0.0023653,0.004142229,0.004796125,0.001865545,0.01551624],"category_scores_gemma":[0.01961836,0.0009324179,0.001097698,0.003369961,0.003712379,0.007251204,0.00430863,0.005172897,0.002162814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004922826,"about_ca_system_score_gemma":0.001777876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002253756,"about_ca_topic_score_gemma":0.004973573,"domain_scores_codex":[0.9979234,0.0003834368,0.00008912814,0.0005787761,0.0005309757,0.0004943554],"domain_scores_gemma":[0.9747624,0.01864329,0.001097447,0.0025864,0.001097899,0.001812662],"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.001296425,0.0004185036,0.01203674,0.001005242,0.0001693046,0.0002203447,0.0006158234,0.04977638,0.01707001,0.8041047,0.04881651,0.06447005],"study_design_scores_gemma":[0.0001374325,0.0001079605,0.006192534,0.000188647,0.0001794726,0.0006797621,0.0002525549,0.1197793,0.008170544,0.842684,0.02153112,0.00009655578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3927366,0.008338536,0.2651011,0.01285284,0.001026686,0.0002979372,0.009049716,0.002759744,0.3078367],"genre_scores_gemma":[0.9240755,0.002361698,0.05641947,0.001107904,0.0004846188,0.0002692545,0.002737962,0.0005113072,0.01203235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01551624,"threshold_uncertainty_score":0.051907,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02253221233133437,"score_gpt":0.2498873187722664,"score_spread":0.227355106440932,"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."}}