{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003724816,0.0009944073,0.001322806,0.001403247,0.001263668,0.00119485,0.001471352,0.001600137,0.009276235],"category_scores_gemma":[0.003092866,0.0008292324,0.0008586572,0.0009393776,0.0005942986,0.001604033,0.001763939,0.0009614203,0.001880637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005308259,"about_ca_system_score_gemma":0.001164238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002434743,"about_ca_topic_score_gemma":0.004760052,"domain_scores_codex":[0.9994137,0.00008001861,0.00003513126,0.0001262592,0.0002130779,0.0001317914],"domain_scores_gemma":[0.9991021,0.0003393106,0.00009887096,0.0001650239,0.0002008658,0.00009395222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002495308,0.0007064877,0.01209738,0.0008309642,0.0003030651,0.001352676,0.001324611,0.450904,0.09401634,0.03658703,0.01153069,0.3878514],"study_design_scores_gemma":[0.00015285,0.000902824,0.002984797,0.0001606352,0.0001318079,0.0005245891,0.0008256153,0.8976529,0.04380885,0.035791,0.01700732,0.00005665557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3143817,0.000213314,0.659613,0.000423468,0.0001358248,0.0005862334,0.0009703974,0.001643498,0.02203249],"genre_scores_gemma":[0.5012226,0.0001307978,0.4894582,0.00005723938,0.00001790128,0.0002862747,0.001265314,0.0003003138,0.007261423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009276235,"threshold_uncertainty_score":0.03103215,"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."}}