{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008799773,0.000163276,0.0002138377,0.00007052551,0.0001674978,0.0001538694,0.0007426372,0.0000663786,0.00001486513],"category_scores_gemma":[0.0004507632,0.0001141112,0.0001018369,0.0005839102,0.0001098352,0.0001950535,0.0002314271,0.0001863459,0.0001440735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002951299,"about_ca_system_score_gemma":0.00008182487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001048699,"about_ca_topic_score_gemma":0.000001042481,"domain_scores_codex":[0.9984148,0.0001344535,0.0003167452,0.0003005479,0.0005505848,0.0002829384],"domain_scores_gemma":[0.9982987,0.0002958618,0.0001653578,0.0008730369,0.0002277013,0.0001393296],"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.000002958362,0.0001030328,0.002915462,0.000008807893,0.00001960653,0.000004975539,0.0008445698,0.00001642679,0.0001087185,0.9870701,0.008629587,0.0002756942],"study_design_scores_gemma":[0.0005005953,0.0001026769,0.001067286,0.00008352075,0.000008733043,0.00001988468,0.00006401794,0.003598423,0.0008555248,0.9933529,0.0001947308,0.0001516374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9815266,0.00009155042,0.00005411637,0.0009760639,0.002731738,0.000124752,8.63453e-7,0.0001478625,0.01434643],"genre_scores_gemma":[0.9980065,0.000002081742,0.001399344,0.0003644685,0.000001291568,0.00001089722,0.000001179036,0.000012961,0.0002012602],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01647989,"threshold_uncertainty_score":0.465332,"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."}}