{"id":"W2075766499","doi":"10.1016/j.endm.2004.03.039","title":"Minimum-Cost Single-Source 2-Splittable Flow","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Minimum-cost flow problem; Mathematical optimization; Mathematics; Flow (mathematics); Vertex (graph theory); Path (computing); Constraint (computer-aided design); Flow network; Enhanced Data Rates for GSM Evolution; Budget constraint; Graph; Computer science; Combinatorics; Economics; Microeconomics; Computer network; Geometry","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004922566,0.000292589,0.0003536223,0.0001973504,0.0001563964,0.0002341529,0.001384731,0.000104251,0.00003310325],"category_scores_gemma":[0.000210848,0.0002803222,0.0001391968,0.0009063028,0.0001139389,0.0004049271,0.0003758777,0.0004397969,0.0000897189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003556627,"about_ca_system_score_gemma":0.0001789457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003472869,"about_ca_topic_score_gemma":0.0001241124,"domain_scores_codex":[0.9975489,0.00004170811,0.0004831722,0.0004957111,0.0004142831,0.001016217],"domain_scores_gemma":[0.9983986,0.000323019,0.0001373723,0.0009925828,0.00004304925,0.0001053944],"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.00001148211,0.000980127,0.00006305134,0.0001769925,0.00006340277,0.00003926221,0.00589386,0.02055617,0.001997988,0.9082485,0.00008233629,0.06188687],"study_design_scores_gemma":[0.0009706678,0.0002254017,0.00002471761,0.0001861693,0.00001165421,0.00007522058,0.00007072266,0.2386233,0.01026218,0.7460412,0.00299586,0.0005129931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02108779,0.0004504562,0.9751391,0.0009604859,0.000153822,0.0003551221,0.000003430797,0.0002434047,0.001606369],"genre_scores_gemma":[0.6023961,0.00003860929,0.3969299,0.0002163294,0.00009356814,0.00005140201,0.000007583696,0.00003691118,0.0002296202],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5813083,"threshold_uncertainty_score":0.9999649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01972464748282074,"score_gpt":0.2491237440068524,"score_spread":0.2293990965240317,"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."}}