{"id":"W75907754","doi":"","title":"Vertex-Disjoint Paths in Graphs","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Disjoint sets; Vertex (graph theory); Combinatorics; Graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.0009405114,0.001078258,0.001103,0.003141881,0.002832056,0.004715123,0.00182735,0.002222914,0.01218835],"category_scores_gemma":[0.007191813,0.001327842,0.001044766,0.005750693,0.002757232,0.01068083,0.003878448,0.003194162,0.001830761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001551774,"about_ca_system_score_gemma":0.001016548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001418131,"about_ca_topic_score_gemma":0.001946337,"domain_scores_codex":[0.9987135,0.0003390637,0.00009571194,0.0003599128,0.0003118862,0.0001798859],"domain_scores_gemma":[0.9945157,0.003749082,0.0005376331,0.0004323028,0.0003024945,0.0004626954],"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.0000901337,0.00005643339,0.0006579263,0.0002074453,0.00002699283,0.000165362,0.0005737019,0.003048873,0.000881832,0.9608622,0.004519091,0.02890996],"study_design_scores_gemma":[0.00001646914,0.00001000263,0.0001555829,0.00002423382,0.00001779924,0.0001066294,0.00009771884,0.002296785,0.0002695193,0.992561,0.004437923,0.000006296931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4549998,0.004530338,0.3848565,0.005866684,0.0007362671,0.0003404758,0.003025029,0.00154042,0.1441045],"genre_scores_gemma":[0.7989023,0.004823723,0.1385608,0.001080896,0.0004989254,0.0004065939,0.002970319,0.0004787733,0.0522777],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01218835,"threshold_uncertainty_score":0.04077405,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01695028605852787,"score_gpt":0.2743511412015198,"score_spread":0.2574008551429919,"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."}}