{"id":"W2549642977","doi":"10.1016/j.tcs.2016.11.014","title":"Covering points with convex sets of minimum size","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Automated Road and Building Extraction","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Education; Hankuk University of Foreign Studies","keywords":"Perimeter; Mathematics; Regular polygon; Combinatorics; Cover (algebra); Bounded function; Plane (geometry); Cluster analysis; Convex set; Set (abstract data type); Algorithm; Computer science; Convex optimization; Geometry; Statistics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.0002303095,0.00008027615,0.000107123,0.00004314012,0.0000451308,0.00002242885,0.0002260102,0.00002697505,0.0000711646],"category_scores_gemma":[0.0000295043,0.00004604345,0.00001646589,0.0002118011,0.0009258919,0.0001945797,0.00005251419,0.00004792796,0.00002439953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002769801,"about_ca_system_score_gemma":0.00001641674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.916365e-7,"about_ca_topic_score_gemma":7.63737e-8,"domain_scores_codex":[0.9992885,0.000009896607,0.0001121829,0.0001518976,0.0002267908,0.0002107257],"domain_scores_gemma":[0.9995148,0.0001761542,0.00002027186,0.0001702415,0.00004456966,0.00007399756],"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.00005941607,0.00005793591,0.0006960202,0.00008316025,0.00002704741,0.00002228837,0.0003672385,0.002945926,0.4282891,0.4910364,0.0002059328,0.07620954],"study_design_scores_gemma":[0.0008377048,0.0003517526,0.01141931,0.0004428735,0.00001521119,0.00009416208,0.000009429234,0.5022461,0.4652991,0.01868841,0.0001852147,0.0004106853],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6423237,0.000004693722,0.3557487,0.00009214156,0.000192301,0.00003692851,0.000001426773,0.0001728595,0.001427367],"genre_scores_gemma":[0.9863959,0.000003228381,0.01353381,0.00002540564,0.00002815215,9.746295e-7,7.053821e-8,0.000008129889,0.00000431408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4993002,"threshold_uncertainty_score":0.3411487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004117169033881237,"score_gpt":0.2045481531417101,"score_spread":0.2004309841078289,"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."}}