{"id":"W1512495408","doi":"10.1023/a:1013587415197","title":"Optimal BSR Solutions to Several Convex Polygon Problems","year":2002,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polygon (computer graphics); Regular polygon; Computer science; Convex polygon; Star-shaped polygon; Point in polygon; Reduction (mathematics); Constant (computer programming); Convex set; Rectilinear polygon; Algorithm; Combinatorics; Mathematics; Convex optimization; Simple polygon; Geometry; Telecommunications","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.001134216,0.0001082285,0.0001552418,0.0001846424,0.0003902578,0.0001320872,0.0007148157,0.00003168155,0.00003645212],"category_scores_gemma":[0.00006306481,0.00007874117,0.00008593051,0.0005769216,0.00002563402,0.0005198941,0.0002223297,0.0002353594,0.00006119063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005432818,"about_ca_system_score_gemma":0.00004241016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001094823,"about_ca_topic_score_gemma":0.000001668992,"domain_scores_codex":[0.9986492,0.0001465534,0.000419784,0.0001188539,0.0003839266,0.0002816389],"domain_scores_gemma":[0.9990922,0.000208784,0.0001314163,0.000190041,0.0002505456,0.0001270462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004884332,0.00007458042,0.00005685717,0.000006114041,0.00003123229,0.000007750712,0.005793897,0.9581448,0.005248986,0.002882471,0.005282967,0.02246544],"study_design_scores_gemma":[0.0003490229,0.0002628159,0.001027443,0.00005506852,0.00001614427,0.0008964164,0.0001406494,0.9920607,0.000926459,0.0004852779,0.00362319,0.0001567626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3025896,0.0003972221,0.6918573,0.004357698,0.0004769549,0.00007997591,5.066421e-7,0.00002550794,0.0002152491],"genre_scores_gemma":[0.9307606,0.00001814596,0.06788971,0.0006873505,0.0004883261,5.732018e-7,4.286932e-7,0.000006066795,0.0001487586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.628171,"threshold_uncertainty_score":0.3210972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04107786948675623,"score_gpt":0.2352461827380934,"score_spread":0.1941683132513371,"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."}}