{"id":"W3122240186","doi":"","title":"Optimum Turn-Restricted Paths, Nested Compatibility, and Optimum Convex Polygons","year":2016,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compatibility (geochemistry); Mathematics; Mathematical optimization; Regular polygon; Cutting-plane method; Integer programming; Combinatorics; Convex polygon; Path (computing); Computer science; Geometry; Engineering","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.001963813,0.0005557921,0.0009195028,0.0007713321,0.0001589087,0.0002667391,0.0007770255,0.0008422869,0.0001061732],"category_scores_gemma":[0.0009181888,0.0005809559,0.0001438843,0.0002731383,0.0004320084,0.0001627121,0.001350755,0.002155645,0.00001370391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001008525,"about_ca_system_score_gemma":0.0003628125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004465667,"about_ca_topic_score_gemma":0.00003702271,"domain_scores_codex":[0.9957795,0.0006862374,0.001037244,0.001089288,0.0003119471,0.001095793],"domain_scores_gemma":[0.9962741,0.001470169,0.0001699142,0.001460646,0.0002019846,0.0004231508],"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.00008412949,0.0001331043,0.0249474,0.0006508268,0.0002544465,0.00005394271,0.0006302535,0.8197343,0.001239675,0.0002733649,0.0002055286,0.151793],"study_design_scores_gemma":[0.001280194,0.00006916284,0.02556439,0.0004524039,0.00002008764,0.00002238234,0.0001993035,0.9681148,0.0003772861,0.001070661,0.001916854,0.0009125036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9369075,0.0007135085,0.003651123,0.0006114619,0.001529353,0.00237203,0.0004500469,0.0009353315,0.05282959],"genre_scores_gemma":[0.963314,0.00761224,0.02751292,0.0000406798,0.0002991265,0.000215491,0.0001265357,0.0002590933,0.0006199323],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1508805,"threshold_uncertainty_score":0.9996642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03557851359454558,"score_gpt":0.3186559526578178,"score_spread":0.2830774390632723,"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."}}