{"id":"W2028813890","doi":"10.1016/j.disc.2004.12.005","title":"Disjoint paths in arborescences","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Disjoint sets; Vertex (graph theory); Arc (geometry); Directed graph; Discrete mathematics; Tree (set theory); Graph","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.0005742779,0.0007076036,0.0007741374,0.002414911,0.002109707,0.002790294,0.00127036,0.001308954,0.01204675],"category_scores_gemma":[0.005509901,0.001087659,0.0007716626,0.002859952,0.001818513,0.005022406,0.002522049,0.002487827,0.001058905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009396332,"about_ca_system_score_gemma":0.000406983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001060574,"about_ca_topic_score_gemma":0.002347916,"domain_scores_codex":[0.9993358,0.0001341335,0.00005177183,0.0002088497,0.0001622645,0.000107096],"domain_scores_gemma":[0.9944563,0.003543627,0.000633186,0.0003163387,0.0004040412,0.0006465612],"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.0001968256,0.0000819284,0.002305677,0.0003113611,0.00006310536,0.0007504093,0.001310505,0.005682498,0.00419895,0.9530255,0.00429399,0.02777925],"study_design_scores_gemma":[0.00005654024,0.00003601251,0.001174858,0.00006518313,0.0000517873,0.0006619144,0.0004857102,0.009842642,0.001047747,0.9757063,0.01085707,0.00001420945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7670091,0.001358461,0.1584116,0.001689752,0.0001849141,0.0001710708,0.001372888,0.0004583941,0.06934392],"genre_scores_gemma":[0.8685384,0.001813724,0.09132009,0.0004394716,0.0001744402,0.0003058876,0.002366027,0.0002980433,0.03474389],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01204675,"threshold_uncertainty_score":0.04030043,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02141297348337464,"score_gpt":0.3004454709950707,"score_spread":0.2790324975116961,"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."}}