{"id":"W2408456090","doi":"","title":"Generalized Watchman Route Problem with Discrete View Cost.","year":2007,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Approximation algorithm; Viewpoints; Mathematics; Combinatorics; Mathematical optimization; Time complexity; Computer science; Boundary (topology); Algorithm; Discrete mathematics","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.0006620836,0.0001951178,0.0002223486,0.00007665326,0.000115942,0.0001604654,0.0008290625,0.00005382239,0.00001940661],"category_scores_gemma":[0.000007823357,0.0001297087,0.00004382416,0.0004540527,0.00004528161,0.0004124465,0.0001770345,0.000140627,0.0001260432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005612156,"about_ca_system_score_gemma":0.000061205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001596061,"about_ca_topic_score_gemma":0.00003133903,"domain_scores_codex":[0.9982615,0.00004390626,0.0002716361,0.0004624394,0.000400725,0.0005598435],"domain_scores_gemma":[0.9989137,0.00006181189,0.00008760022,0.0006565279,0.00007182476,0.0002085486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000123291,0.0003645394,0.02813365,0.0001696135,0.0003520303,0.002193082,0.005417073,0.02099116,0.001796092,0.4724038,0.01939568,0.44866],"study_design_scores_gemma":[0.008780687,0.001691314,0.05603243,0.0007415101,0.0001137787,0.001339081,0.0001834749,0.6892609,0.01769,0.01082287,0.2091195,0.004224432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001563893,0.00007512526,0.97367,0.001197502,0.0001611347,0.0003608918,0.000001030609,0.0004531202,0.02251728],"genre_scores_gemma":[0.0272121,0.000007902958,0.9674808,0.0008119443,0.00007522449,0.00001923611,0.000007012804,0.00001595002,0.004369803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6682698,"threshold_uncertainty_score":0.5289366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01810994743151535,"score_gpt":0.2669738652415942,"score_spread":0.2488639178100788,"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."}}