{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0414416,0.0006143172,0.9565939,0.0003908079,0.00041577098,0.00019676916,0.00008162478,0.00015883472,0.00010641329],"genre_scores_gemma":[0.36524704,0.000043634333,0.6327489,0.00040859054,0.0006974586,0.00006690693,0.000027211872,0.000033190387,0.0007270482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983263,0.00007794192,0.00036638658,0.00049040763,0.0002298265,0.0005091537],"domain_scores_gemma":[0.9976911,0.001568672,0.00014523187,0.00030280752,0.00013093853,0.00016124189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047887425,0.00019823496,0.00039708975,0.00009727913,0.00022098685,0.00011327102,0.0002616715,0.00008627139,0.0000022449428],"category_scores_gemma":[0.0001698344,0.00019833572,0.000088452725,0.00018077785,0.00012433516,0.00033846713,0.000119799945,0.000104751416,0.000008122293],"study_design_candidate":"design_other","study_design_consensus":null,"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.000008504346,0.000034502194,0.14841047,0.000051374227,0.000088810266,0.00027540606,0.0030980585,0.00019501212,0.000015082333,0.00031097664,0.004959856,0.84255195],"study_design_scores_gemma":[0.00080407195,0.00017460117,0.20823425,0.00020051988,0.000049569026,0.00021239657,0.0005442415,0.757098,0.00016722291,0.0024074034,0.029025145,0.001082574],"about_ca_topic_score_codex":0.000021656035,"about_ca_topic_score_gemma":8.9952044e-7,"teacher_disagreement_score":0.84146935,"about_ca_system_score_codex":0.000026294309,"about_ca_system_score_gemma":0.00007848869,"threshold_uncertainty_score":0.8087896},"labels":[],"label_agreement":null}]}