{"id":"W2952728573","doi":"10.48550/arxiv.1208.5172","title":"An iterative scheme for solving the optimal transportation problem","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"","keywords":"Measure (data warehouse); Scheme (mathematics); Mathematical optimization; Transportation theory; Function (biology); Upper and lower bounds; Iterative method; Computer science; Mathematics","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.0001525182,0.0001990236,0.0001740618,0.00005864158,0.0001212506,0.0000738821,0.0002586414,0.0001688838,0.0000500887],"category_scores_gemma":[0.000007838341,0.0001837997,0.0001166606,0.0001227041,0.00004516147,0.000286883,0.00002431535,0.0002731022,0.00001002449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006605768,"about_ca_system_score_gemma":0.00002037016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004420584,"about_ca_topic_score_gemma":0.00001117419,"domain_scores_codex":[0.9992848,0.00001761174,0.000156377,0.0002533336,0.00003989151,0.0002479986],"domain_scores_gemma":[0.9994158,0.00006227718,0.00006481765,0.0002725847,0.00008722828,0.00009731006],"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.00001087361,0.00004065524,0.00006687408,0.0002715068,0.00006891332,0.000002126247,0.001312737,0.9474329,0.0001101743,0.05025157,0.00006383367,0.000367876],"study_design_scores_gemma":[0.0002285152,0.0000189025,0.0000439499,0.00005941952,0.0001033735,3.442634e-7,0.0003385865,0.9943128,0.0002182448,0.003894374,0.0005292205,0.0002522946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07907027,0.00004756132,0.9188748,0.00001887852,0.0001622949,0.000674663,0.00003030317,0.0003295874,0.0007916158],"genre_scores_gemma":[0.9603111,0.00002693938,0.03922493,0.00001532619,0.00007923549,0.00001040814,0.0001290809,0.00003802188,0.000165027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8812408,"threshold_uncertainty_score":0.7495133,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05555063535320044,"score_gpt":0.1962799357954532,"score_spread":0.1407293004422528,"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."}}