{"id":"W2100967180","doi":"10.1016/j.jda.2003.12.004","title":"Optimizing a constrained convex polygonal annulus","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polygon (computer graphics); Star-shaped polygon; Polygon covering; Convex polygon; Rectilinear polygon; Regular polygon; Annulus (botany); Mathematics; Point in polygon; Combinatorics; Mathematical optimization; Algorithm; Computer science; Convex set; Geometry; Simple polygon; Convex optimization","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.0003908907,0.0001173838,0.0002037549,0.0002117518,0.0001063316,0.0001567904,0.0003912284,0.00004588381,0.00001826307],"category_scores_gemma":[0.0000557112,0.00009911349,0.0001459981,0.0003877683,0.00005123358,0.0008128041,0.00007253561,0.0001886735,0.00001101315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006675679,"about_ca_system_score_gemma":0.0003647862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005415369,"about_ca_topic_score_gemma":8.779658e-7,"domain_scores_codex":[0.9987249,0.00003898721,0.0004312314,0.0001503137,0.0004592215,0.0001952976],"domain_scores_gemma":[0.9990347,0.0000596305,0.000308996,0.0001379805,0.0002941837,0.0001645288],"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.0001219035,0.0004846965,0.0001040301,0.0000414271,0.0004762466,0.001067204,0.005196714,0.5116156,0.01825968,0.2195174,0.001562028,0.241553],"study_design_scores_gemma":[0.01845963,0.004487698,0.006420944,0.0005575613,0.0001817852,0.01201222,0.0009847149,0.7000489,0.0523676,0.1855604,0.01696352,0.001955006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0127263,0.0006587427,0.9817258,0.003472076,0.0007678806,0.00005786593,0.000004518568,0.00002470788,0.0005621202],"genre_scores_gemma":[0.5802977,0.00002566978,0.4189537,0.0002797866,0.0003780577,9.121708e-7,0.00000251899,0.000005208641,0.00005646703],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5675714,"threshold_uncertainty_score":0.404173,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01249269046030971,"score_gpt":0.2567539926501066,"score_spread":0.2442613021897969,"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."}}