{"id":"W2061541114","doi":"10.1016/s0925-7721(03)00027-0","title":"Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Combinatorics; Quadrilateral; Planar graph; Vertex (graph theory); Mathematics; Diagonal; Monochromatic color; Graph; Vertex cover; Plane (geometry); Time complexity; Algorithm; Geometry; Physics","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.000590833,0.00022261,0.000224042,0.0005221373,0.0004937786,0.0002998571,0.0002388164,0.00008554818,0.00001088018],"category_scores_gemma":[0.0001598144,0.0002348501,0.0001051611,0.001056697,0.00006545999,0.0005707626,0.00006406495,0.0001201897,0.00001334976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003807532,"about_ca_system_score_gemma":0.0001118386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007419782,"about_ca_topic_score_gemma":0.000001826627,"domain_scores_codex":[0.9982998,0.00007270851,0.0003465494,0.0005685548,0.0003636389,0.0003487425],"domain_scores_gemma":[0.998457,0.0008152421,0.0001269517,0.0001852268,0.0002490988,0.0001665089],"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.00001518279,0.00009326908,0.001145797,0.00003959312,0.00009404077,0.00008001395,0.0002825684,0.2688007,0.0001202499,0.697609,0.001160104,0.03055948],"study_design_scores_gemma":[0.001095305,0.0001923636,0.004635544,0.00001571517,0.00002188466,0.001840023,0.0001152088,0.817685,0.0003295464,0.1700687,0.003517096,0.0004836138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1963232,0.0007550025,0.8016069,0.0002527062,0.0005093259,0.000235823,0.00002481315,0.0001232847,0.0001688999],"genre_scores_gemma":[0.5686304,0.000004976407,0.4309134,0.0002207182,0.00005483103,0.00001974006,0.00004847479,0.00001036635,0.00009712514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5488843,"threshold_uncertainty_score":0.9576911,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02691526093557751,"score_gpt":0.2724761922961346,"score_spread":0.2455609313605571,"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."}}