{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001899606,0.0008959242,0.00103422,0.001267314,0.001846604,0.002517459,0.002115323,0.003189148,0.01662806],"category_scores_gemma":[0.02452252,0.0007172005,0.001028084,0.001993102,0.002427877,0.005339709,0.00489158,0.007490731,0.001338668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009917865,"about_ca_system_score_gemma":0.001370643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001111037,"about_ca_topic_score_gemma":0.000964323,"domain_scores_codex":[0.9977436,0.0007443548,0.0001068922,0.0003416134,0.000828538,0.0002350102],"domain_scores_gemma":[0.9927374,0.004304703,0.0008213877,0.0009025335,0.0006729837,0.0005609181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009146491,0.00005366669,0.0005828376,0.000113716,0.00002299745,0.0001823386,0.0001130604,0.02092605,0.000479747,0.9479165,0.007465349,0.02205219],"study_design_scores_gemma":[0.00002230306,0.00003079675,0.0001625611,0.00002121287,0.000008268415,0.0001524924,0.00006355441,0.05594154,0.0002572324,0.9387953,0.004535277,0.000009505803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2076944,0.001180575,0.6586934,0.0078408,0.001102844,0.0001676243,0.0009413784,0.0005608347,0.1218181],"genre_scores_gemma":[0.8249079,0.0009231127,0.125909,0.001122164,0.0004717362,0.0002731741,0.001385947,0.0006893003,0.04431768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01662806,"threshold_uncertainty_score":0.05562639,"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."}}