{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004986682,0.0002400689,0.000364179,0.0002251489,0.0006226774,0.000477705,0.003436222,0.00005851116,0.00001337209],"category_scores_gemma":[0.0005834174,0.0001496611,0.0001105441,0.001320767,0.008688982,0.0006342007,0.002121666,0.0003189198,0.000007620607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000299594,"about_ca_system_score_gemma":0.00007509325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002243651,"about_ca_topic_score_gemma":7.319349e-7,"domain_scores_codex":[0.9968946,0.0002625563,0.0004909842,0.0007270683,0.0009776931,0.0006471156],"domain_scores_gemma":[0.9961601,0.001567443,0.0001764431,0.001616076,0.0002073918,0.0002725031],"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.000007902026,0.00004596981,0.0002831777,0.00003863606,0.000006799416,7.215529e-7,0.001257109,0.00006178023,0.0004844957,0.9905338,0.000004260617,0.007275331],"study_design_scores_gemma":[0.0001353083,0.00008497322,0.0005275597,0.00002697771,0.000003754709,0.00001336877,0.00002353979,0.4305448,0.001207357,0.5672992,0.00001815734,0.0001149202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1195686,0.00002154913,0.8772964,0.0006922855,0.0001753621,0.0002844403,0.000001531085,0.00007142496,0.001888402],"genre_scores_gemma":[0.8231796,0.000004511313,0.1766468,0.00009133564,0.00005183605,0.0000129814,2.051125e-7,0.000009648369,0.000003119906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.703611,"threshold_uncertainty_score":0.9940088,"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."}}