{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"1ec55cd01470","filters":{"venue":"Surgery annual"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"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","authors":[{"name":"Juan A. Carretero","is_ca":true},{"name":"Meyer Nahon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02666310940512474,"gpt":0.2647983166763428,"spread":0.2381352072712181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006934402,0.00113524,0.001085419,0.001431791,0.0007831354,0.0007491644,0.001284811,0.001689094,0.002169148],"category_scores_gemma":[0.001862994,0.0005714437,0.0009193943,0.001075729,0.0007439821,0.0007285773,0.0007306795,0.0011405,0.0005249727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009601082,"about_ca_system_score_gemma":0.001729125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006174563,"about_ca_topic_score_gemma":0.004844212,"domain_scores_codex":[0.9996463,0.00007955082,0.00001949791,0.00007923448,0.0001428866,0.0000324201],"domain_scores_gemma":[0.9995866,0.0002287265,0.00004416302,0.00002500852,0.00009856757,0.00001687542],"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.00005059806,0.00006754781,0.0007061093,0.0001264372,0.00007716888,0.0001198594,0.0001266443,0.7450405,0.006985773,0.02131808,0.002033141,0.2233481],"study_design_scores_gemma":[0.00002998363,0.00005039562,0.0001998124,0.00001810759,0.00002415703,0.00007701531,0.00001544871,0.9897181,0.002116165,0.005107849,0.002626982,0.00001594287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005334551,0.0001684325,0.992519,0.00005761321,0.00002778004,0.00005300673,0.00002386661,0.000299179,0.001516559],"genre_scores_gemma":[0.08421896,0.0003247613,0.9120619,0.00006476398,0.00002163114,0.0003297271,0.0001487745,0.00009343863,0.002736109],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006174563,"threshold_uncertainty_score":0.01227725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}