{"id":"W2003347187","doi":"10.1155/2008/597408","title":"Bipartite Toughness and <i>k</i>‐Factors in Bipartite Graphs","year":2008,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Algorithm; Bipartite graph; Artificial intelligence; Computer science; Mathematics; Graph; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.001272011,0.0001180186,0.000256572,0.0003851123,0.0001127544,0.0001598452,0.0008947899,0.00003588348,0.0000201916],"category_scores_gemma":[0.0004761223,0.00007841667,0.00005706404,0.0003862437,0.0005870525,0.0008266828,0.0002650821,0.0001541178,0.00000358118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001724705,"about_ca_system_score_gemma":0.00005720225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002654907,"about_ca_topic_score_gemma":0.000002919717,"domain_scores_codex":[0.9982104,0.00004113171,0.0005217851,0.0001763792,0.0008308024,0.0002195591],"domain_scores_gemma":[0.9986039,0.0007221935,0.0002377966,0.0001177335,0.0001725981,0.0001458045],"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.000006223471,0.0002536954,0.006175004,0.00003761348,0.000027137,0.0001157813,0.003950374,0.00002927662,0.001635855,0.9861462,0.00003297362,0.001589834],"study_design_scores_gemma":[0.0004250969,0.0001613528,0.001894222,0.0002035655,0.00000453226,0.001112515,0.0005533288,0.01706745,0.00378578,0.9745027,0.0001354904,0.0001539898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9174107,0.0002320916,0.08041975,0.0008779222,0.0001347483,0.0000720078,0.00000108855,0.00001185063,0.0008398911],"genre_scores_gemma":[0.9097968,0.0003634783,0.08973205,0.0000549654,0.00002221095,0.000002371616,7.886436e-8,0.000004504787,0.00002354702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01703818,"threshold_uncertainty_score":0.3197739,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04947404051399971,"score_gpt":0.3301412564827257,"score_spread":0.280667215968726,"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."}}