{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328467,0.002014068,0.001239365,0.001616595,0.002067636,0.002634087,0.003267498,0.001482306,0.0153921],"category_scores_gemma":[0.005748053,0.0006800888,0.001207864,0.001783591,0.002900001,0.006617182,0.002955939,0.004071,0.003291413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003661311,"about_ca_system_score_gemma":0.001657213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004040633,"about_ca_topic_score_gemma":0.007134512,"domain_scores_codex":[0.9980665,0.0002601267,0.00006877368,0.0005305748,0.000399043,0.0006749575],"domain_scores_gemma":[0.994864,0.003018772,0.0003204482,0.000973605,0.0003766289,0.0004464517],"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.001640755,0.000360127,0.004737574,0.001460149,0.0002259428,0.0004278897,0.0007535553,0.2768727,0.0519219,0.4833333,0.05247555,0.1257906],"study_design_scores_gemma":[0.0001622516,0.0004787591,0.00390191,0.0002474626,0.0002017901,0.001059408,0.0004119625,0.600374,0.02614397,0.3038371,0.06300255,0.0001789142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1532148,0.005592683,0.6913298,0.008286641,0.0006023045,0.0002499757,0.002250509,0.002654636,0.1358186],"genre_scores_gemma":[0.7598369,0.004130051,0.1921761,0.002418674,0.0006523915,0.0006687274,0.002342517,0.001105928,0.03666885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0153921,"threshold_uncertainty_score":0.05149168,"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."}}