{"id":"W4280507516","doi":"10.3390/mca27030042","title":"Finding the Conjectured Sequence of Largest Small n-Polygons by Numerical Optimization","year":2022,"lang":"en","type":"article","venue":"Mathematical and Computational Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Polygon (computer graphics); Solver; Sequence (biology); Mathematics; Combinatorics; Class (philosophy); Range (aeronautics); Applied mathematics; Mathematical optimization; Algorithm; Computer science; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038059,0.000619481,0.0007022172,0.0006799086,0.000518913,0.001161259,0.0009198337,0.0008335261,0.003284947],"category_scores_gemma":[0.006840191,0.0005265732,0.0008148844,0.0003841056,0.001414371,0.001586946,0.001068023,0.001170201,0.0005251226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009496992,"about_ca_system_score_gemma":0.001286417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00266891,"about_ca_topic_score_gemma":0.003484168,"domain_scores_codex":[0.9996608,0.00009438826,0.00001528813,0.00007554129,0.0001013098,0.00005262579],"domain_scores_gemma":[0.9981846,0.001127248,0.0002289513,0.0001922859,0.0001683695,0.0000984509],"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.00005668825,0.00003472267,0.001694403,0.0001340814,0.00001154685,0.0001018801,0.00008855478,0.8797517,0.003194558,0.1000478,0.001802968,0.01308105],"study_design_scores_gemma":[0.000006858754,0.00001742235,0.0001269327,0.00001961754,0.000002889317,0.00002747869,0.00004023743,0.9679635,0.001152929,0.02925369,0.001382634,0.000005793778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09751798,0.0002601111,0.8851396,0.0005068214,0.00006114272,0.00006621452,0.0002678118,0.0002686903,0.0159116],"genre_scores_gemma":[0.6104947,0.0004227794,0.3826907,0.0001600846,0.00003829803,0.000290787,0.000411278,0.0003052746,0.005186116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003284947,"threshold_uncertainty_score":0.01098931,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02207728021900386,"score_gpt":0.2503259929153343,"score_spread":0.2282487126963304,"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."}}