{"id":"W2017360257","doi":"10.1016/j.tcs.2011.11.010","title":"On sum coloring and sum multi-coloring for restricted families of graphs","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy coloring; Complete coloring; Combinatorics; Graph coloring; Mathematics; Brooks' theorem; Fractional coloring; Edge coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003133765,0.00179256,0.002427707,0.002974542,0.004163713,0.004494344,0.003669504,0.002357009,0.01039538],"category_scores_gemma":[0.0156775,0.001674247,0.003168913,0.005666581,0.00471671,0.01372906,0.005513249,0.0069482,0.001007277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00320061,"about_ca_system_score_gemma":0.001583607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004908822,"about_ca_topic_score_gemma":0.00567999,"domain_scores_codex":[0.9979585,0.0008320044,0.0000890475,0.0004221612,0.0003692399,0.0003289538],"domain_scores_gemma":[0.9862304,0.009938152,0.0007374456,0.001092383,0.0008549021,0.001146548],"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.0002256723,0.0001229845,0.001113065,0.0002285073,0.00005802988,0.0001726245,0.0007918337,0.01657999,0.0008913721,0.9502513,0.008897491,0.02066711],"study_design_scores_gemma":[0.00002264075,0.00002205552,0.0003053961,0.00003682142,0.00004101107,0.0001293755,0.0002092575,0.03371771,0.0002172869,0.9625347,0.00274088,0.00002284406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2798324,0.005503156,0.6220978,0.007119939,0.001186051,0.0001809949,0.0008915197,0.0006436562,0.08254446],"genre_scores_gemma":[0.800612,0.006665454,0.140773,0.002284984,0.00240217,0.0004333721,0.001847335,0.00102507,0.04395662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01039538,"threshold_uncertainty_score":0.03477603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04880908630460297,"score_gpt":0.3005876451882362,"score_spread":0.2517785588836332,"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."}}