{"id":"W2402364738","doi":"","title":"On k-Guarding Polygons.","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Time complexity; Binary logarithm; Approximation algorithm; Simple polygon; Log-log plot; Set (abstract data type); Discrete mathematics; Regular polygon; Graph; Computer science; Geometry","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.0002961694,0.0009416725,0.0009056303,0.0005061076,0.0006294178,0.001237792,0.001678044,0.0006401562,0.007259327],"category_scores_gemma":[0.002580931,0.0005535212,0.0009205249,0.001540431,0.001096216,0.003107693,0.002268435,0.001097802,0.002025988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007508303,"about_ca_system_score_gemma":0.0006748825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002738799,"about_ca_topic_score_gemma":0.003544451,"domain_scores_codex":[0.9994018,0.00008816677,0.00004106099,0.0001755269,0.0001513899,0.0001419248],"domain_scores_gemma":[0.9985771,0.000575098,0.0002531019,0.0004232178,0.00006770177,0.0001037896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001160501,0.0002414226,0.005424904,0.001028572,0.000114643,0.001008298,0.0005875117,0.5758722,0.02195108,0.102304,0.01058446,0.2797224],"study_design_scores_gemma":[0.0001476641,0.0002027895,0.001589263,0.0001007323,0.00005666045,0.0009719314,0.0004294926,0.7379143,0.01731334,0.2196264,0.02161314,0.00003433839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2036874,0.0008638716,0.7634646,0.000479162,0.0001295068,0.0002629778,0.001500362,0.002213689,0.02739843],"genre_scores_gemma":[0.4899635,0.0008616468,0.4970674,0.0001163899,0.00006063977,0.0001482258,0.002319012,0.0002407957,0.009222439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007259327,"threshold_uncertainty_score":0.0242849,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01200100300417718,"score_gpt":0.2154717437809386,"score_spread":0.2034707407767615,"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."}}