{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001375054,0.000201442,0.0002781275,0.0005492814,0.0004074316,0.0001128962,0.002154548,0.00005850842,0.000004860115],"category_scores_gemma":[0.0003910319,0.0001685337,0.00007143421,0.001585571,0.004140525,0.0006143592,0.001108591,0.0002101627,0.000004246172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003511208,"about_ca_system_score_gemma":0.00008175558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006864879,"about_ca_topic_score_gemma":0.000001326863,"domain_scores_codex":[0.9974886,0.0001100578,0.00031784,0.0008040332,0.0005590225,0.0007204228],"domain_scores_gemma":[0.9975166,0.001034138,0.00009364794,0.0007709535,0.0003143104,0.0002703681],"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.00008415584,0.00009922904,0.0003274789,0.00002044266,0.000005712973,0.000005151337,0.0008210022,0.00004323673,0.002635987,0.9856157,0.000002721776,0.01033915],"study_design_scores_gemma":[0.0007486269,0.001257038,0.008240324,0.00006404598,0.00000500593,0.00001013129,0.00003589182,0.2346705,0.050402,0.7042824,0.00001207713,0.0002718914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3307388,0.00001870105,0.6679817,0.00004097086,0.0002381664,0.0003135465,0.000002575015,0.00009882388,0.0005667008],"genre_scores_gemma":[0.7355984,0.00001149303,0.2642858,0.00005355695,0.00001305416,0.00002428153,2.105948e-7,0.000008338646,0.000004914859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4048595,"threshold_uncertainty_score":0.9985696,"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."}}