{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004835769,0.0001457288,0.0002795476,0.001116039,0.00008692472,0.00008285233,0.001084816,0.00006344289,0.00003002959],"category_scores_gemma":[0.0006036385,0.000117766,0.0002391026,0.001520489,0.0001502826,0.000875035,0.00007741189,0.000562487,0.000008246852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004048011,"about_ca_system_score_gemma":0.0001042032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.596813e-7,"about_ca_topic_score_gemma":0.000002449719,"domain_scores_codex":[0.997462,0.0009085628,0.0005135834,0.000199873,0.0004990622,0.0004169422],"domain_scores_gemma":[0.9982604,0.0006415282,0.0003020615,0.0004519827,0.0001824374,0.0001616388],"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.00004468374,0.00009318255,0.005846027,0.000006930796,0.0000244038,0.0002363925,0.000596605,0.0001013632,0.001487411,0.9765272,0.00004832132,0.01498744],"study_design_scores_gemma":[0.0005997939,0.0001597982,0.002726099,0.00006531482,0.000003630282,0.0002541435,0.0002432641,0.0000315813,0.002911979,0.9916563,0.001210114,0.0001379541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3135267,0.003904283,0.6703027,0.0002271353,0.0008413129,0.000172684,9.940792e-7,0.00004586773,0.01097838],"genre_scores_gemma":[0.985554,0.0002037463,0.01397701,0.00015126,0.0000276437,0.000002349951,6.190448e-8,0.00001310843,0.00007078002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6720273,"threshold_uncertainty_score":0.480236,"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."}}