{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001487825,0.0003765649,0.0005206823,0.000309407,0.00121464,0.0002028355,0.0006478861,0.0001139922,0.0005463943],"category_scores_gemma":[0.0006243808,0.0003328379,0.000342456,0.001167885,0.000418336,0.0003340972,0.000316682,0.0003152856,0.0008757733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008601219,"about_ca_system_score_gemma":0.00008618039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006027695,"about_ca_topic_score_gemma":0.00005620965,"domain_scores_codex":[0.9969189,0.0001394313,0.0007948012,0.0006882674,0.0007001463,0.0007584994],"domain_scores_gemma":[0.9975287,0.0006465395,0.0003077792,0.001072665,0.0001692831,0.0002750268],"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.000006323057,0.0006782356,0.0001036673,0.0001012991,0.00010401,0.000002867779,0.003805465,0.000009030514,0.00167193,0.9776134,0.01380588,0.002097849],"study_design_scores_gemma":[0.0004518721,0.00005334941,0.0002050181,0.0001184292,0.0001910846,0.00001945189,0.001022672,0.00094657,0.002157908,0.9838666,0.0105262,0.0004408128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6125688,0.0008415765,0.133338,0.01466641,0.001163295,0.003800601,0.00008021008,0.002466036,0.2310751],"genre_scores_gemma":[0.9087009,0.00001758896,0.08930705,0.0002452558,0.000110348,0.0003684207,0.000009290953,0.00005627741,0.001184872],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2961321,"threshold_uncertainty_score":0.9999124,"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."}}