{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528818,0.0001523195,0.0001896664,0.0003134413,0.00009569005,0.00008004237,0.001200251,0.00006765236,0.00002855953],"category_scores_gemma":[0.0001170677,0.0001519262,0.00007275256,0.001542791,0.00008325891,0.0005756001,0.0003706223,0.0002979256,0.000175956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007792534,"about_ca_system_score_gemma":0.00005507053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002910462,"about_ca_topic_score_gemma":0.00001619859,"domain_scores_codex":[0.9982315,0.0001495981,0.0002356562,0.0004496631,0.0003900552,0.000543531],"domain_scores_gemma":[0.9986972,0.0001770953,0.00004713382,0.0008542505,0.00007415508,0.0001501882],"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.00001207095,0.0001271663,0.01307668,0.000003593326,0.000005047556,0.0001784404,0.0002166083,0.00001330163,0.0003304406,0.9731525,0.0002646427,0.01261949],"study_design_scores_gemma":[0.0007819466,0.00009978286,0.01260282,0.00001883838,8.357857e-7,0.00002180251,0.00002561912,0.002851271,0.0004678034,0.981533,0.001413731,0.0001825738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9843343,0.0003156327,0.004239848,0.0005494366,0.001636358,0.0002833258,8.584224e-7,0.0002454926,0.008394693],"genre_scores_gemma":[0.9977231,0.00008595517,0.001771555,0.0001474258,0.000002064126,0.00003241719,0.000001199866,0.00001395741,0.000222299],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01338877,"threshold_uncertainty_score":0.619537,"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."}}