{"id":"W2566564112","doi":"10.1007/s00453-016-0263-3","title":"Geometric Path Problems with Violations","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Path (computing); Simple polygon; Mathematics; Polygon (computer graphics); Shortest path problem; Longest path problem; Vertex (graph theory); Intersection (aeronautics); Discrete mathematics; Geometry; Monotone polygon; Computer science; Graph","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.0001241199,0.00008751807,0.00007678601,0.0002359627,0.0001136867,0.00006682888,0.0002844941,0.00002872657,0.00003703194],"category_scores_gemma":[0.000029335,0.00005261959,0.00002647644,0.001186801,0.00002182682,0.0004620179,0.00006633334,0.00003914288,0.000139009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003257059,"about_ca_system_score_gemma":0.00007018574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005600508,"about_ca_topic_score_gemma":0.000001966986,"domain_scores_codex":[0.999152,0.00002604803,0.0001295333,0.0002730206,0.0002432917,0.0001761048],"domain_scores_gemma":[0.9993386,0.0001303692,0.0000555831,0.0002655754,0.0001356477,0.00007428649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002382593,0.00006412258,0.0004267962,0.000003749059,0.00002011,0.000005567855,0.00006286065,0.0005698715,0.001376664,0.03144312,0.001034141,0.9649906],"study_design_scores_gemma":[0.007017518,0.002577684,0.152114,0.0003715003,0.00007607592,0.0005711393,0.00003194812,0.3868539,0.04295911,0.09931145,0.305356,0.00275972],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006626463,0.00006857611,0.9902621,0.001514981,0.0001451422,0.0001230033,0.000003957136,0.0001352719,0.001120494],"genre_scores_gemma":[0.8433029,0.00001164028,0.1555074,0.0001401165,0.0001253492,0.00002830035,0.000004848409,0.000006403457,0.0008730601],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9622309,"threshold_uncertainty_score":0.2145765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009575151748726621,"score_gpt":0.2029150373385475,"score_spread":0.1933398855898209,"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."}}