{"id":"W171736474","doi":"","title":"Partioning A Bipartite Graph into Vertex-Disjoint Paths.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581128,0.0001961876,0.0002101842,0.000237884,0.0003556066,0.0002097644,0.0009691837,0.00007364136,0.00001959535],"category_scores_gemma":[0.00009066078,0.0001957646,0.0001187366,0.001207832,0.0001473871,0.0007567102,0.0004025637,0.0002576016,0.0002390468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008271494,"about_ca_system_score_gemma":0.0000642047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001104207,"about_ca_topic_score_gemma":0.00002293184,"domain_scores_codex":[0.997879,0.0001656285,0.0003207622,0.0005386377,0.0005067254,0.0005892339],"domain_scores_gemma":[0.9985266,0.0001683825,0.00009560435,0.0009004843,0.000152984,0.0001559146],"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.000007837236,0.0001131254,0.003610547,0.000008894553,0.00001019562,0.00003403456,0.0001789193,0.0001177863,0.002169263,0.9882172,0.001295108,0.004237088],"study_design_scores_gemma":[0.0005486176,0.000101244,0.004040124,0.00002423598,0.000003438696,0.000008151453,0.00001560857,0.004704241,0.005680313,0.9823896,0.002244862,0.0002396002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9134078,0.000805754,0.07639311,0.0009481167,0.002654936,0.0004185846,0.000002066977,0.0008011508,0.004568486],"genre_scores_gemma":[0.9919075,0.00001309744,0.007626608,0.00009857928,0.00001076847,0.0000641788,0.000004883148,0.00002043579,0.0002539681],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07849968,"threshold_uncertainty_score":0.7983049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01171207585279747,"score_gpt":0.2598653087767702,"score_spread":0.2481532329239728,"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."}}