{"id":"W3092889289","doi":"10.4230/lipics.socg.2019.15","title":"Preconditioning for the Geometric Transportation Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computational geometry; Logarithm; Euclidean space; Transportation theory; Euclidean geometry; Mathematics; Geometric networks; Mathematical optimization; Dimension (graph theory); Geometric programming; Integer (computer science); Simple (philosophy); Approximation algorithm; Discrete mathematics; Combinatorics; Computer science; Graph theory; Algorithm; Geometry; Mathematical analysis","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.0006590412,0.0002600398,0.0002831894,0.0003363405,0.0005287577,0.0005120636,0.00133413,0.0001212295,0.00004722797],"category_scores_gemma":[0.00003762138,0.000201037,0.0003121535,0.0007608465,0.00006684343,0.001908611,0.00008712785,0.0002631162,0.00009484468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005941603,"about_ca_system_score_gemma":0.0000628944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001208724,"about_ca_topic_score_gemma":0.00001787563,"domain_scores_codex":[0.9979664,0.00001624896,0.0007855913,0.0002673946,0.0003917411,0.0005726432],"domain_scores_gemma":[0.9980473,0.0005314565,0.0003705121,0.000683859,0.0002721854,0.00009472125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002100618,0.0007990284,0.01447005,0.003186324,0.0008683889,0.000002003582,0.03216456,0.01087625,0.00008196804,0.5925116,0.01885418,0.3259756],"study_design_scores_gemma":[0.006850322,0.0009856524,0.01720021,0.0002860062,0.0001107359,0.00004421994,0.001676276,0.6516534,0.001459552,0.03483537,0.2836698,0.001228465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03400972,0.00007296081,0.9590697,0.0005372714,0.001306941,0.002717299,0.0004931036,0.0002165434,0.001576481],"genre_scores_gemma":[0.7725003,0.00004625208,0.2231138,0.001398864,0.000228624,0.0008711443,0.0008720804,0.00004852582,0.0009204136],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7384906,"threshold_uncertainty_score":0.8198051,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01397383616257701,"score_gpt":0.2383796590727227,"score_spread":0.2244058229101456,"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."}}