{"id":"W1554852049","doi":"10.1007/978-3-642-15369-3_25","title":"Maximum Flows on Disjoint Paths","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Upper and lower bounds; Combinatorics; Maximum flow problem; Mathematics; Path (computing); Enhanced Data Rates for GSM Evolution; Flow (mathematics); Simple (philosophy); Constant (computer programming); Flow network; Planar; Discrete mathematics; Computer science; Geometry; Mathematical analysis","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.0005740512,0.001134601,0.0009131443,0.002092672,0.001559313,0.001823092,0.001052693,0.0009928411,0.01281985],"category_scores_gemma":[0.003259045,0.001099747,0.0009467978,0.002777057,0.001329567,0.006250375,0.002683163,0.00306506,0.001305967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001054676,"about_ca_system_score_gemma":0.0005419971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004723557,"about_ca_topic_score_gemma":0.0006171215,"domain_scores_codex":[0.9995251,0.000108255,0.00002658311,0.000117315,0.0001476599,0.00007521188],"domain_scores_gemma":[0.9984354,0.001072789,0.00009461978,0.0001484635,0.0001231755,0.0001254372],"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.00007250557,0.00003265677,0.0001040466,0.0002702137,0.0000186461,0.00004937694,0.0001956197,0.00675903,0.001813387,0.9310666,0.007992003,0.05162591],"study_design_scores_gemma":[0.00001326524,0.000013413,0.0001232672,0.00004144319,0.00001208981,0.00007729851,0.00003756871,0.005608643,0.0005925527,0.9825508,0.01092281,0.000006780181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1063923,0.005073071,0.4947111,0.002807425,0.0007470943,0.0002220222,0.001092713,0.0006101934,0.388344],"genre_scores_gemma":[0.5425144,0.01051346,0.2978936,0.0008469599,0.001385881,0.0006964006,0.002162091,0.0007909954,0.1431962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01281985,"threshold_uncertainty_score":0.04288667,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01871409523069201,"score_gpt":0.2704832735398518,"score_spread":0.2517691783091598,"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."}}