{"id":"W3941961","doi":"","title":"A Genetic Algorithm for calculating minimum distance between convex and concave bodies","year":2001,"lang":"en","type":"article","venue":"Surgery annual","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Regular polygon; Focus (optics); Convergence (economics); Genetic algorithm; Mathematical optimization; Simple (philosophy); Path (computing); Algorithm; Mathematics; Robot; Motion planning; Separation (statistics); Computer science; Artificial intelligence; 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":[],"consensus_categories":[],"category_scores_codex":[0.0004788743,0.000198235,0.0003970898,0.00009727913,0.0002209869,0.000113271,0.0002616715,0.00008627139,0.000002244943],"category_scores_gemma":[0.0001698344,0.0001983357,0.00008845273,0.0001807778,0.0001243352,0.0003384671,0.0001197999,0.0001047514,0.000008122293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002629431,"about_ca_system_score_gemma":0.00007848869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002165603,"about_ca_topic_score_gemma":8.995204e-7,"domain_scores_codex":[0.9983263,0.00007794192,0.0003663866,0.0004904076,0.0002298265,0.0005091537],"domain_scores_gemma":[0.9976911,0.001568672,0.0001452319,0.0003028075,0.0001309385,0.0001612419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008504346,0.00003450219,0.1484105,0.00005137423,0.00008881027,0.0002754061,0.003098059,0.0001950121,0.00001508233,0.0003109766,0.004959856,0.8425519],"study_design_scores_gemma":[0.000804072,0.0001746012,0.2082343,0.0002005199,0.00004956903,0.0002123966,0.0005442415,0.757098,0.0001672229,0.002407403,0.02902514,0.001082574],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0414416,0.0006143172,0.9565939,0.0003908079,0.000415771,0.0001967692,0.00008162478,0.0001588347,0.0001064133],"genre_scores_gemma":[0.365247,0.00004363433,0.6327489,0.0004085905,0.0006974586,0.00006690693,0.00002721187,0.00003319039,0.0007270482],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8414693,"threshold_uncertainty_score":0.8087896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02666310940512474,"score_gpt":0.2647983166763428,"score_spread":0.2381352072712181,"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."}}