{"id":"W3214090100","doi":"10.1007/978-3-030-96731-4_11","title":"The Polygon Burning Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Voronoi diagram; Geodesic; Combinatorics; Polygon (computer graphics); Vertex (graph theory); Regular polygon; Polygon covering; Approximation algorithm; Monotone polygon; Simple polygon; Mathematics; Computer science; Algorithm; Discrete mathematics; Geometry; Graph","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.0005351104,0.0007471983,0.00106215,0.0006973705,0.001277532,0.002549542,0.001725135,0.001814383,0.02877432],"category_scores_gemma":[0.003134676,0.0007087958,0.0009341999,0.001366226,0.001780168,0.004098989,0.002863026,0.004011859,0.004032246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007317725,"about_ca_system_score_gemma":0.0005833185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008122014,"about_ca_topic_score_gemma":0.0006977049,"domain_scores_codex":[0.999505,0.0001087668,0.00002213035,0.0001405418,0.0001599161,0.00006356251],"domain_scores_gemma":[0.9994774,0.0002654385,0.00004526961,0.0001106079,0.00005419242,0.00004700871],"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":[0.00008755395,0.0000442907,0.0001449516,0.0001940584,0.00002191629,0.0001122028,0.0001232187,0.01380558,0.001000693,0.8743465,0.0267927,0.08332637],"study_design_scores_gemma":[0.00001890287,0.00001386424,0.0001088882,0.00005434382,0.0000104984,0.0001705517,0.00009117861,0.02744301,0.0007424043,0.9338281,0.03750862,0.000009593279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.04175573,0.007706306,0.4220587,0.00492114,0.001548962,0.0001393963,0.0007925248,0.0003713699,0.5207058],"genre_scores_gemma":[0.4239171,0.01021384,0.2377866,0.001546988,0.00163939,0.0004073143,0.003236741,0.001079426,0.3201725],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02877432,"threshold_uncertainty_score":0.09625971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0135978653437067,"score_gpt":0.2359951616198393,"score_spread":0.2223972962761326,"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."}}