{"id":"W4412402096","doi":"10.55016/ojs/cdm.v10i2.62253","title":"A Lower Bound for Radio k-chromatic Number of an Arbitrary Graph","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Graph; Windmill graph; Upper and lower bounds; Friendship graph; Discrete mathematics; Graph power; Line 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.0005538105,0.0001778794,0.0003392124,0.0001265944,0.0001781771,0.00008912705,0.0006109513,0.00007888665,0.00002763629],"category_scores_gemma":[0.0004746008,0.0001189333,0.000176438,0.0004153337,0.0001161647,0.0003648551,0.0001173504,0.00004980657,0.00007524347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003693382,"about_ca_system_score_gemma":0.0000901908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005504571,"about_ca_topic_score_gemma":0.000003037591,"domain_scores_codex":[0.9984983,0.00004311017,0.0005241072,0.0003122744,0.0002531171,0.0003691314],"domain_scores_gemma":[0.9978895,0.0003854616,0.0001782712,0.0009405365,0.0003766492,0.0002295918],"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.000008012792,0.0002153371,0.00001667065,0.00006416007,0.00004581084,0.000002213357,0.0003703781,0.000006430713,0.007286986,0.9900576,0.0009717627,0.0009546161],"study_design_scores_gemma":[0.000996248,0.0002100915,0.00004350156,0.0002923324,0.00004597368,0.00003345388,0.00002659029,0.007928127,0.008347183,0.9810984,0.0007152406,0.0002628232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1448701,0.00005232976,0.8519847,0.001536315,0.0002029734,0.0005653757,0.0002135918,0.0001615124,0.0004130613],"genre_scores_gemma":[0.6443825,0.000005474613,0.354923,0.0001652195,0.00001638973,0.0001379967,0.000009948774,0.00002008721,0.0003392886],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4995124,"threshold_uncertainty_score":0.4849958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01292965334663468,"score_gpt":0.2846970305328423,"score_spread":0.2717673771862077,"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."}}