{"meta":{"query_hash":"1ec55cd01470","filters":{"venue":"Surgery annual"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1ec55cd01470","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026663109405124744,"score_gpt":0.2647983166763428,"score_spread":0.23813520727121806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3941961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005334551,0.00016843254,0.992519,0.000057613208,0.00002778004,0.000053006726,0.000023866613,0.000299179,0.0015165588],"genre_scores_gemma":[0.08421896,0.00032476132,0.91206187,0.00006476398,0.000021631138,0.00032972713,0.0001487745,0.000093438626,0.0027361093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996463,0.00007955082,0.000019497907,0.00007923448,0.00014288658,0.0000324201],"domain_scores_gemma":[0.99958664,0.00022872645,0.000044163018,0.00002500852,0.00009856757,0.000016875423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006934402,0.0011352402,0.0010854185,0.0014317912,0.00078313536,0.0007491644,0.0012848111,0.0016890938,0.0021691478],"category_scores_gemma":[0.0018629939,0.0005714437,0.0009193943,0.0010757293,0.00074398215,0.00072857726,0.0007306795,0.0011405,0.00052497274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005059806,0.000067547815,0.0007061093,0.00012643721,0.00007716888,0.00011985936,0.0001266443,0.74504054,0.0069857733,0.021318078,0.0020331407,0.22334811],"study_design_scores_gemma":[0.000029983627,0.000050395618,0.00019981242,0.000018107592,0.000024157034,0.000077015306,0.00001544871,0.9897181,0.0021161647,0.0051078494,0.002626982,0.000015942875],"about_ca_topic_score_codex":0.0061745634,"about_ca_topic_score_gemma":0.004844212,"teacher_disagreement_score":0.0061745634,"about_ca_system_score_codex":0.0009601082,"about_ca_system_score_gemma":0.0017291248,"threshold_uncertainty_score":0.0122772455},"labels":[],"label_agreement":null}]}