{"id":"W2086681505","doi":"10.5539/jmr.v2n1p28","title":"Applications of Maximal Network Flow Problems in Transportation and Assignment Problems","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Flow network; Flow (mathematics); Mathematical optimization; Transportation theory; Dual (grammatical number); Assignment problem; Process (computing); Tree (set theory); Algorithm; Combinatorics; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.004312868,0.00004628057,0.0001445096,0.0001985956,0.0001359421,0.00003689929,0.0001431989,0.0000812241,0.0000507009],"category_scores_gemma":[0.00009845158,0.00004052743,0.00002890361,0.0004371126,0.0001626406,0.0001493992,0.000002846856,0.0003850212,0.000001058648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002298959,"about_ca_system_score_gemma":0.0001788248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008628538,"about_ca_topic_score_gemma":0.001723179,"domain_scores_codex":[0.9984408,0.0000876694,0.0004954786,0.00006923451,0.0007274565,0.0001793647],"domain_scores_gemma":[0.9988987,0.0002828239,0.0002444507,0.00007049392,0.0004204691,0.00008307278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007844881,0.002403795,0.3042953,0.001790358,0.0001196015,0.00001752549,0.2669031,0.2520225,0.006957978,0.1314533,0.001556274,0.0324018],"study_design_scores_gemma":[0.006590263,0.001458346,0.2709223,0.003398788,0.0002027541,0.00003937268,0.06535258,0.08051141,0.00116721,0.4989721,0.07032155,0.001063365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7325003,0.0003628228,0.2581863,0.001947246,0.0002052127,0.001655109,0.00001903302,0.00002226945,0.005101684],"genre_scores_gemma":[0.9463678,0.0002532779,0.05311362,0.000003095391,0.00009160201,0.00002427892,0.000004581677,0.000007452,0.0001343007],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3675188,"threshold_uncertainty_score":0.1672747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05344592199758834,"score_gpt":0.3683133832193372,"score_spread":0.3148674612217488,"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."}}