{"id":"W4403096939","doi":"10.1016/j.comgeo.2024.102147","title":"Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Euclidean distance; Maximum likelihood; Euclidean geometry; Computer science; Mathematical optimization; Constrained optimization problem; Mathematics; Combinatorics; Algorithm; Optimization problem; Artificial intelligence; Statistics; Geometry","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high","status":"direct model label, unvalidated"}],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002988592,0.001300144,0.001594966,0.002035803,0.0007533844,0.002383688,0.002328096,0.002123406,0.004404955],"category_scores_gemma":[0.02739075,0.001123483,0.001032138,0.001608037,0.001896257,0.003752642,0.003423062,0.002536363,0.001204723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001102907,"about_ca_system_score_gemma":0.002032036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003062591,"about_ca_topic_score_gemma":0.003345655,"domain_scores_codex":[0.9983658,0.0006512639,0.00009296973,0.0002538426,0.0005638391,0.000072184],"domain_scores_gemma":[0.9917092,0.006031416,0.0004379668,0.0007161176,0.0008548067,0.0002504956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002577403,0.000114672,0.0009167992,0.0003373922,0.0001013361,0.0001387785,0.000229617,0.7030609,0.003961115,0.1213845,0.003844579,0.1656526],"study_design_scores_gemma":[0.0000113438,0.00003456739,0.0001368829,0.00001640329,0.000006832524,0.00002993188,0.00001885495,0.9453839,0.0009824657,0.05233929,0.001024762,0.00001468956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009399137,0.0002681672,0.9883527,0.0002066448,0.00004783893,0.0000316726,0.00006000541,0.0004151745,0.001218601],"genre_scores_gemma":[0.2423197,0.0004876207,0.7501569,0.0001233917,0.0001273591,0.0002275534,0.0004188007,0.0007988153,0.005339884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004404955,"threshold_uncertainty_score":0.01580536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007015648072327307,"score_gpt":0.2517664130013479,"score_spread":0.2447507649290206,"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."}}