{"id":"W1982128583","doi":"10.1007/s00454-008-9127-1","title":"Traversing a Set of Points with a Minimum Number of Turns","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Path (computing); 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.0002091179,0.0001753954,0.0002939269,0.000363176,0.0001043844,0.00002303204,0.0003897632,0.00005645229,0.00006486307],"category_scores_gemma":[0.00004673025,0.0001611343,0.0001183119,0.001599735,0.0001553685,0.0004359826,0.0001077916,0.0001081036,0.000019844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003124532,"about_ca_system_score_gemma":0.0002541782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001915159,"about_ca_topic_score_gemma":0.00000148954,"domain_scores_codex":[0.9981338,0.00007321648,0.0004490609,0.0003539409,0.0007782718,0.0002117053],"domain_scores_gemma":[0.9985867,0.0003209716,0.0002981573,0.0002478604,0.0004459471,0.0001003657],"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.0004921437,0.0007828696,0.0682966,0.000517045,0.0007059278,0.0001606311,0.01309323,0.6588073,0.001836294,0.238464,0.001941453,0.01490249],"study_design_scores_gemma":[0.004501662,0.0008675831,0.3807114,0.0002823829,0.00007667411,0.001485513,0.0004228471,0.5579115,0.006277516,0.04504163,0.001316487,0.001104884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5233951,0.00004883065,0.4752609,0.0001813975,0.00008179196,0.00009420801,0.00002508141,0.00002839463,0.000884313],"genre_scores_gemma":[0.8414412,0.000005079081,0.1582186,0.00009591507,0.00005142831,0.00000387138,0.00008657408,0.000009096873,0.00008831836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.318046,"threshold_uncertainty_score":0.6570864,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01893516591749736,"score_gpt":0.2642083172706151,"score_spread":0.2452731513531178,"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."}}