{"id":"W2040426893","doi":"10.1556/sscmath.42.2005.3.3","title":"Partitioning a graph into vertex-disjoint paths","year":2005,"lang":"en","type":"article","venue":"Studia Scientiarum Mathematicarum Hungarica","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics; Integer (computer science); Computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000872321,0.0006291826,0.0007608152,0.001050072,0.00154877,0.001105649,0.001070859,0.0009908128,0.002734521],"category_scores_gemma":[0.005012857,0.0005449613,0.0005230228,0.001242208,0.001208559,0.003392783,0.002136122,0.000756996,0.0003975017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00076352,"about_ca_system_score_gemma":0.0007944533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090297,"about_ca_topic_score_gemma":0.001415254,"domain_scores_codex":[0.9989101,0.0003082151,0.00007999108,0.0003448634,0.0001287552,0.0002281476],"domain_scores_gemma":[0.9978005,0.001139706,0.000309475,0.000360007,0.000128175,0.0002620088],"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.001347397,0.0002815899,0.008585243,0.001191317,0.000222818,0.001389679,0.001809307,0.2243749,0.03843114,0.484519,0.005822711,0.232025],"study_design_scores_gemma":[0.0001354242,0.0003841728,0.002378837,0.0001344445,0.0001066757,0.001057664,0.001427082,0.2321552,0.01262839,0.7307064,0.01881959,0.00006617921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5230339,0.00098473,0.4633985,0.0006990387,0.00006509459,0.0003291042,0.0006351192,0.0002761863,0.01057838],"genre_scores_gemma":[0.6780742,0.0008533121,0.3150814,0.0001280559,0.00005214447,0.0002055264,0.0009946965,0.00008942464,0.004521283],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002734521,"threshold_uncertainty_score":0.009147882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02783879000953422,"score_gpt":0.304229183738962,"score_spread":0.2763903937294278,"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."}}