{"id":"W2274875244","doi":"10.46298/dmtcs.2097","title":"Bounding the monomial index and (1,l)-weight choosability of a graph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Monomial; Upper and lower bounds; Bound graph; Discrete mathematics; Graph power; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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.001138032,0.0006860544,0.000852656,0.001660774,0.000785831,0.001717493,0.001395242,0.0007068477,0.003863059],"category_scores_gemma":[0.006453322,0.0005736065,0.0008441873,0.001300861,0.002430146,0.002765562,0.00144512,0.001849044,0.0004395531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001933586,"about_ca_system_score_gemma":0.000566242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00112836,"about_ca_topic_score_gemma":0.001432898,"domain_scores_codex":[0.9992303,0.0001259695,0.00003902033,0.0001974331,0.0002010362,0.0002062088],"domain_scores_gemma":[0.9964187,0.002226352,0.0003853666,0.0004005019,0.000187079,0.0003819633],"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.0002694776,0.0001104082,0.005600997,0.0001901156,0.00004288648,0.0002800262,0.0004666449,0.09593665,0.02059061,0.8547293,0.00147963,0.02030325],"study_design_scores_gemma":[0.00003739447,0.0001333106,0.00271142,0.00004326259,0.00004584176,0.0002714294,0.0001170118,0.2540983,0.009491962,0.7303018,0.002697004,0.00005123165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6733948,0.000530766,0.295638,0.0007679009,0.00006136347,0.00007042788,0.0005719156,0.0002953553,0.0286695],"genre_scores_gemma":[0.969062,0.000462899,0.02612478,0.00007399407,0.00009053986,0.00005164624,0.0003257108,0.00009480157,0.003713589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003863059,"threshold_uncertainty_score":0.01402926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0133706421567809,"score_gpt":0.2796127339591611,"score_spread":0.2662420918023802,"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."}}