{"id":"W2102172432","doi":"10.1142/s0218195910003232","title":"GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Mathematics; Approximation algorithm; Combinatorics; Boundary (topology); Viewpoints; Time complexity; Mathematical optimization; Algorithm; Discrete mathematics; Computer science","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.0005787862,0.0002005113,0.0002528681,0.0005937492,0.0001838306,0.0005099701,0.001950873,0.0000719303,0.0001658485],"category_scores_gemma":[0.00002920551,0.000163609,0.0001451188,0.0008930348,0.0001272891,0.001002352,0.0002006734,0.0005024945,0.00007356269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008641062,"about_ca_system_score_gemma":0.0004333313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001074221,"about_ca_topic_score_gemma":0.00001217118,"domain_scores_codex":[0.9972548,0.00006719116,0.0007566184,0.000317311,0.001354772,0.0002492927],"domain_scores_gemma":[0.9959777,0.0002352539,0.000644736,0.0003049045,0.002571832,0.0002655925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006042469,0.0004601408,0.002090128,0.00002291164,0.0004060986,0.00002970725,0.0002226228,0.2608788,0.0005320079,0.6224545,0.001367751,0.1114749],"study_design_scores_gemma":[0.003901334,0.0002832333,0.006642,0.0001040921,0.00005517876,0.001386213,0.00004281637,0.1049532,0.0005079027,0.140077,0.7413187,0.0007283766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002431909,0.00008145079,0.987161,0.007162981,0.0003129587,0.000591258,0.00003312491,0.00006827158,0.002157055],"genre_scores_gemma":[0.3650082,0.00006909467,0.6328094,0.0009053517,0.0005354878,0.0001841127,0.000107372,0.0000226677,0.000358287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.739951,"threshold_uncertainty_score":0.6671783,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01205896636511554,"score_gpt":0.2997036074054154,"score_spread":0.2876446410402999,"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."}}