{"id":"W2035974993","doi":"10.1016/j.dam.2004.02.014","title":"Multi-terminal multipath flows: synthesis","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor; University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Path (computing); Flow network; Disjoint sets; Shortest path problem; Undirected graph; Flow (mathematics); Enhanced Data Rates for GSM Evolution; Polynomial; Discrete mathematics; Maximum flow problem; Multi-commodity flow problem; Topology (electrical circuits); Graph; Computer science; Geometry; Telecommunications","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.0004450547,0.0002883431,0.0003401297,0.0001694024,0.0002100568,0.0001637972,0.001541233,0.00009402078,0.00002112183],"category_scores_gemma":[0.0001603032,0.0002451819,0.0001239051,0.0004553394,0.0001345175,0.0003097646,0.0004926797,0.0002461792,0.0004535882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006541111,"about_ca_system_score_gemma":0.00006867815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003500102,"about_ca_topic_score_gemma":0.000005534318,"domain_scores_codex":[0.9979395,0.00002180514,0.0003918994,0.0005217817,0.000531438,0.0005935982],"domain_scores_gemma":[0.9980711,0.0002964862,0.0001377013,0.001231552,0.00005984518,0.0002032719],"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.00001479998,0.0004263951,0.000008965874,0.0002023909,0.00004911889,0.0000900212,0.003798039,0.001575136,0.03625795,0.9438713,0.00001626846,0.01368968],"study_design_scores_gemma":[0.002585649,0.0001076939,0.0002039298,0.0002927608,0.00005504403,0.0001644361,0.00144282,0.1686483,0.1227148,0.7018374,0.0004729466,0.001474254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02715368,0.00003267606,0.9685532,0.0001258353,0.00006308279,0.0004682724,0.000009038281,0.0003456482,0.003248537],"genre_scores_gemma":[0.3493104,0.000009626696,0.6503451,0.00004856325,0.00002609354,0.000174841,0.000001721957,0.00002914916,0.00005453304],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3221567,"threshold_uncertainty_score":0.9998226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02898757932986056,"score_gpt":0.2962409616097549,"score_spread":0.2672533822798943,"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."}}