{"id":"W2624045917","doi":"10.48550/arxiv.1706.02028","title":"On Guarding Orthogonal Polygons with Bounded Treewidth","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Bounded function; Combinatorics; Polygon (computer graphics); Mathematics; Guard (computer science); Rectangle; Partial k-tree; Discrete mathematics; 1-planar graph; Computer science; Graph; Chordal graph; Pathwidth; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001995519,0.0002827777,0.000252612,0.0003302273,0.0005298597,0.0003868512,0.001401529,0.0001659132,0.00002204587],"category_scores_gemma":[0.00003563295,0.0002895743,0.0001499161,0.0003045248,0.00008796942,0.0004124335,0.0008374992,0.0004349839,0.00007084707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001569752,"about_ca_system_score_gemma":0.0004480929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004019011,"about_ca_topic_score_gemma":0.00007128923,"domain_scores_codex":[0.9983405,0.00008665318,0.0001302955,0.0009940098,0.0001662947,0.0002821971],"domain_scores_gemma":[0.9981124,0.0001190691,0.0002779818,0.00117783,0.0001632,0.0001494579],"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.0000526635,0.00006963042,0.000505855,0.00001585068,0.00008378013,0.0002191083,0.00006806073,0.4008111,0.00001359791,0.5955633,0.0003447279,0.002252387],"study_design_scores_gemma":[0.001117004,0.000277764,0.006533621,0.0002460903,0.00008892361,0.00002636962,0.00001817334,0.7270766,0.0002367904,0.2621036,0.001426234,0.0008487686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3010579,0.00002579906,0.6896196,0.0001911428,0.0005064357,0.0001618625,0.00001164707,0.000139976,0.00828558],"genre_scores_gemma":[0.9924721,0.0000264758,0.003754283,0.0001283259,0.0001355923,0.000001069624,0.00004085562,0.00001270961,0.003428628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6914141,"threshold_uncertainty_score":0.9999557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0755831907290783,"score_gpt":0.1960492017622367,"score_spread":0.1204660110331584,"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."}}