{"id":"W2114935764","doi":"10.1002/jgt.10126","title":"Packing paths in digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Bishop's University","funders":"","keywords":"Combinatorics; Digraph; Bipartite graph; Mathematics; Packing problems; Disjoint sets; Vertex (graph theory); Matching (statistics); Undirected graph; 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.0004815955,0.0007014374,0.0006340137,0.001886654,0.001616417,0.002074465,0.0008520397,0.0009669436,0.01115793],"category_scores_gemma":[0.002927347,0.0008240706,0.0008389805,0.003419573,0.001042211,0.003229235,0.00161564,0.001261513,0.001089381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002256498,"about_ca_system_score_gemma":0.001070905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005136316,"about_ca_topic_score_gemma":0.006250876,"domain_scores_codex":[0.9991678,0.0001802358,0.0000656078,0.000250884,0.000124149,0.0002113762],"domain_scores_gemma":[0.9981759,0.0009724649,0.0002221585,0.0002544778,0.0001456797,0.0002294225],"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.0003527988,0.0003061839,0.004102148,0.0006072816,0.0001369661,0.001422537,0.001047663,0.1194376,0.00644867,0.6898859,0.02503836,0.1512139],"study_design_scores_gemma":[0.00008471761,0.0001697429,0.001944395,0.0001779749,0.00007256474,0.001135755,0.0006249218,0.1873273,0.003189778,0.7510764,0.05414019,0.00005618171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.474082,0.002661972,0.4064154,0.002855084,0.0002860731,0.0006992622,0.006063739,0.001853337,0.1050832],"genre_scores_gemma":[0.7890912,0.001953922,0.1800754,0.000698743,0.0001095959,0.0004203401,0.005294287,0.0001793302,0.02217725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01115793,"threshold_uncertainty_score":0.03732699,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01678610636798969,"score_gpt":0.2814075109099237,"score_spread":0.2646214045419341,"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."}}