{"id":"W1566305412","doi":"","title":"Minimum Cost Flow Problem on Dynamic Multi Generative Network flows","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Minimum-cost flow problem; Flow network; Multi-commodity flow problem; Mathematical optimization; Computer science; Computation; Flow (mathematics); Time horizon; Mathematics; Algorithm","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008089573,0.0002110006,0.000178784,0.0002631808,0.0006682373,0.0003380371,0.0003110502,0.000192721,0.0005342792],"category_scores_gemma":[0.00008080183,0.0002019212,0.0000512713,0.0008005105,0.0001011528,0.0002091142,0.00006083252,0.001230931,0.0008556931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083526,"about_ca_system_score_gemma":0.0001234519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004543645,"about_ca_topic_score_gemma":0.002169064,"domain_scores_codex":[0.9981409,0.0001567747,0.0003074119,0.0003499145,0.0004294084,0.0006156113],"domain_scores_gemma":[0.9988108,0.0001341824,0.000009007282,0.0004655414,0.0003920111,0.0001884837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003773984,0.0000621108,0.00001502463,0.00001249673,0.00003125754,0.000004657122,0.0004880738,0.9759745,0.005341094,0.0007055278,0.004044885,0.01331659],"study_design_scores_gemma":[0.0004918128,0.00006466603,0.00007675841,0.00002623791,0.000003947875,0.000007215976,0.00004327316,0.989058,0.0005253284,0.00007166209,0.009403591,0.0002275047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0631322,0.0005182999,0.8837163,0.003171893,0.006159337,0.00820852,0.0004073068,0.001893284,0.03279289],"genre_scores_gemma":[0.3394892,0.0002531424,0.6502193,0.0001444927,0.0008743335,0.001008651,0.0004620825,0.0001554442,0.007393402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.276357,"threshold_uncertainty_score":0.9999223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04003761077161055,"score_gpt":0.337510223600903,"score_spread":0.2974726128292925,"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."}}