{"id":"W2950566000","doi":"10.1137/1.9781611973082.86","title":"New Approximation Algorithms for Minimum Enclosing Convex Shapes","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Regular polygon; Algorithm; Computer science; Approximation algorithm; Mathematics; 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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003082943,0.0003387714,0.0003610814,0.0002035051,0.00007486407,0.001481029,0.002157095,0.0002793912,0.00002527473],"category_scores_gemma":[0.00009864137,0.0003215241,0.0001640712,0.0001424851,0.00004745319,0.001260605,0.002057801,0.0002392246,0.00002524224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006409401,"about_ca_system_score_gemma":0.0003960246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006670351,"about_ca_topic_score_gemma":0.000001474402,"domain_scores_codex":[0.998059,0.0000197632,0.0004205275,0.0008863966,0.0002732087,0.0003411048],"domain_scores_gemma":[0.998503,0.00007955216,0.0003148068,0.0006943828,0.0002738213,0.0001344372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005266019,0.00007080745,0.0000043492,0.0003674489,0.0000339053,0.000002780728,0.0006733036,0.000004241083,0.0004909904,0.07673349,0.02419399,0.8974195],"study_design_scores_gemma":[0.0001318338,0.00005848316,0.000009050238,0.0002226214,0.00001517251,0.000007586505,0.000006979566,0.2365,0.05039185,0.710043,0.002142733,0.0004706892],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001870815,0.0002073832,0.939766,0.000374834,0.0004208427,0.0007367263,0.000005690776,0.001909428,0.05656032],"genre_scores_gemma":[0.005578489,0.00001054785,0.9896221,0.0003117709,0.0001643466,0.0001572193,0.00002264935,0.00003294591,0.004099992],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8969488,"threshold_uncertainty_score":0.9999237,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06960156800308266,"score_gpt":0.3076578932617822,"score_spread":0.2380563252586995,"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."}}