{"id":"W2404700317","doi":"","title":"On the choosability of bipartite graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; 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.001536342,0.0006412862,0.001035947,0.001417637,0.001565054,0.003016805,0.001816213,0.001770424,0.01591538],"category_scores_gemma":[0.01061275,0.0008086551,0.00091538,0.002286078,0.00341667,0.008100083,0.00253798,0.00344233,0.001760608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001900404,"about_ca_system_score_gemma":0.0008044955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001739131,"about_ca_topic_score_gemma":0.002317493,"domain_scores_codex":[0.9986151,0.000540908,0.00006792903,0.0002727419,0.0002623358,0.0002408507],"domain_scores_gemma":[0.9883561,0.00926779,0.0005379813,0.001021764,0.000245282,0.000571077],"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.0001495392,0.00008169293,0.001235015,0.0002412338,0.0000328119,0.00009382323,0.0002358354,0.009721885,0.001361324,0.9421238,0.01649679,0.0282264],"study_design_scores_gemma":[0.0000396027,0.00001862589,0.0006028449,0.00004050638,0.00001724424,0.0001362014,0.000118486,0.01799714,0.0005607989,0.9750562,0.005398049,0.00001434761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3106248,0.00749675,0.4124446,0.01360568,0.0009608861,0.0002288246,0.002829178,0.0009368699,0.2508725],"genre_scores_gemma":[0.8877622,0.004829957,0.06868137,0.00185838,0.001228558,0.0002845942,0.002492061,0.0005226686,0.03234019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01591538,"threshold_uncertainty_score":0.05324233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01301832496837969,"score_gpt":0.2276900903568137,"score_spread":0.214671765388434,"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."}}