{"id":"W1842824552","doi":"10.1007/978-3-642-02017-9_47","title":"The Two-Guard Polygon Walk Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Polygon (computer graphics); Simple polygon; Visibility polygon; Guard (computer science); Computer science; Boundary (topology); Visibility; Point (geometry); Computer graphics (images); Regular polygon; Mathematics; Geometry; Physics; Optics; 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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001239625,0.0004552108,0.0003333915,0.000551291,0.0007564723,0.001150097,0.003264145,0.0001846078,0.000009986068],"category_scores_gemma":[0.00005702237,0.0003400864,0.0001423164,0.0007442622,0.0003976959,0.0005678915,0.0007881329,0.0006966017,0.00008753804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000256757,"about_ca_system_score_gemma":0.0006795415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001205224,"about_ca_topic_score_gemma":0.00008976457,"domain_scores_codex":[0.9962906,0.00005080215,0.0005398821,0.0012586,0.001205053,0.000655047],"domain_scores_gemma":[0.9974565,0.0005971297,0.0002838886,0.001182458,0.0003233449,0.0001566997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003366225,0.00001236205,0.000002719746,0.000005148165,0.000005331277,0.0000186832,0.0001615951,0.05544776,0.00007681705,0.09466545,0.00006114863,0.8495396],"study_design_scores_gemma":[0.0002423164,0.0001841262,0.0000872837,0.0001116516,0.000005717615,0.00009197325,6.91605e-8,0.4059976,0.001117255,0.569189,0.02246658,0.0005064979],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004227768,0.001076036,0.9834085,0.003764782,0.001659888,0.0004217573,0.000001805287,0.0001575529,0.009467435],"genre_scores_gemma":[0.08028948,0.0002102137,0.906846,0.004941086,0.00216634,0.00002374605,0.00001750226,0.00004737938,0.005458223],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8490331,"threshold_uncertainty_score":0.9999051,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01236877948629696,"score_gpt":0.2445929990505315,"score_spread":0.2322242195642346,"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."}}