{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000602494,0.00006081705,0.00005786701,0.00006934364,0.00009174114,0.000167493,0.0005120389,0.0000185579,0.000442073],"category_scores_gemma":[0.00001419876,0.00004843279,0.00004316972,0.0002034766,0.00001973529,0.0003003354,0.0001440338,0.00006863609,0.001394436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008452337,"about_ca_system_score_gemma":0.000008364335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008202075,"about_ca_topic_score_gemma":0.00000153144,"domain_scores_codex":[0.99944,0.00001452155,0.00007383791,0.0001763151,0.0001303968,0.0001649148],"domain_scores_gemma":[0.9994758,0.00007942495,0.00001386351,0.0003515148,0.00002245402,0.00005699468],"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":[1.450456e-7,0.00001762872,0.00003569337,7.642429e-7,0.000002889406,0.000001244713,0.00004631374,0.000007904587,0.00009556811,0.9018807,0.01211013,0.08580098],"study_design_scores_gemma":[0.0002563845,0.0001357804,0.006450938,0.00001678374,0.000001273982,0.00001694226,0.00003582761,0.1658688,0.003419598,0.8143818,0.009096182,0.000319626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0185903,0.00002006211,0.7749026,0.003357829,0.0004812776,0.000108568,2.324656e-7,0.0003893088,0.2021498],"genre_scores_gemma":[0.8970243,0.000001926286,0.09860383,0.002105983,0.00004566747,0.00001157534,2.350834e-7,0.000003385793,0.002203061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8784341,"threshold_uncertainty_score":0.9993831,"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."}}