{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007595573,0.0007363864,0.0005538036,0.001316533,0.001458401,0.001297363,0.001022378,0.0007384904,0.01341729],"category_scores_gemma":[0.004257309,0.0006715184,0.0008883714,0.002265214,0.001156107,0.00292942,0.00249106,0.001424417,0.003701992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005731696,"about_ca_system_score_gemma":0.0007020443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001856825,"about_ca_topic_score_gemma":0.004143553,"domain_scores_codex":[0.9989179,0.0003974646,0.00004867111,0.0002633932,0.000173055,0.0001994733],"domain_scores_gemma":[0.996366,0.001718183,0.0002392292,0.001107724,0.0002955644,0.0002732654],"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.0007938801,0.0002863653,0.001955495,0.0007928633,0.0002001018,0.000722486,0.001577343,0.05658668,0.03264546,0.6766613,0.03332787,0.1944503],"study_design_scores_gemma":[0.00008300847,0.0001637886,0.001349089,0.0001313671,0.0001431366,0.0005324652,0.0005116399,0.1352377,0.01340107,0.8025671,0.04583397,0.00004579029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1104484,0.0007826248,0.818609,0.0007082256,0.0002036675,0.0003704216,0.001416655,0.001796931,0.06566418],"genre_scores_gemma":[0.5170023,0.001085622,0.4124309,0.0007110439,0.0002091544,0.0005440617,0.003704942,0.0009436534,0.06336828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01341729,"threshold_uncertainty_score":0.04488528,"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."}}