{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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":"e8b04bf3fe90","filters":{"venue":"2018 4th International Conference on Optimization and Applications (ICOA)"}},"results":[{"id":"W2806799977","doi":"10.1109/icoa.2018.8370584","title":"Route planning for electric vehicle efficiency using the Bellman-Ford algorithm on an embedded GPU","year":2018,"lang":"en","type":"article","venue":"2018 4th International Conference on Optimization and Applications (ICOA)","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Dijkstra's algorithm; Traverse; Computer science; Algorithm; Plan (archaeology); Dynamic programming; Process (computing); Enhanced Data Rates for GSM Evolution; Computational complexity theory; Efficient energy use; Energy (signal processing); Work (physics); Shortest path problem; Artificial intelligence; Engineering","authors":[{"name":"Adam Schambers","is_ca":true},{"name":"Matthew Eavis-O'Quinn","is_ca":true},{"name":"Vincent Roberge","is_ca":true},{"name":"Mohammed Tarbouchi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03783492986209856,"gpt":0.3043775762055602,"spread":0.2665426463434616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001736092,0.000382474,0.0002930732,0.0003723926,0.0002847282,0.0005874218,0.0006188204,0.0002944022,0.005034152],"category_scores_gemma":[0.0008584032,0.0001732323,0.0002921701,0.000553383,0.0001642152,0.0003538799,0.0002611951,0.0004043069,0.0004981412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007201219,"about_ca_system_score_gemma":0.001405168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.018543,"about_ca_topic_score_gemma":0.02073594,"domain_scores_codex":[0.9998901,0.00001841806,0.000006101834,0.00002730191,0.00004061131,0.00001741905],"domain_scores_gemma":[0.9997775,0.00007018872,0.00001442909,0.00002897274,0.00009600928,0.00001282048],"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.0001831732,0.0001070146,0.002148687,0.0001069376,0.00004069458,0.0001023307,0.00009199721,0.7482139,0.01934336,0.01240688,0.006214589,0.2110403],"study_design_scores_gemma":[0.00001007237,0.00001461182,0.0002301931,0.000003097941,0.000005059404,0.00001445888,0.000008742816,0.9936551,0.003249715,0.0009759108,0.00182932,0.000003773739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09539258,0.0002224513,0.8849912,0.0002188735,0.00009086742,0.0000678998,0.0002511817,0.004595031,0.01416992],"genre_scores_gemma":[0.4528439,0.0001476528,0.5412452,0.00004280074,0.000009885433,0.00008029043,0.0002662106,0.0003169788,0.00504705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.018543,"threshold_uncertainty_score":0.03687012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2805111833","doi":"10.1109/icoa.2018.8370583","title":"Real-time UAV path-terrain collision evaluation on FPGA","year":2018,"lang":"en","type":"article","venue":"2018 4th International Conference on Optimization and Applications (ICOA)","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":"Royal Military College of Canada","funders":"","keywords":"Terrain; Field-programmable gate array; Collision; Computer science; Path (computing); Real-time computing; Collision avoidance; Embedded system; Computer security; Geography; Computer network","authors":[{"name":"François Charles Joseph Allaire","is_ca":true},{"name":"Mohammed Tarbouchi","is_ca":true},{"name":"Gilles Labonté","is_ca":true},{"name":"Vincent Roberge","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05350136287715848,"gpt":0.3292772157054131,"spread":0.2757758528282546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000157058,0.0004718362,0.0002779035,0.000345488,0.0002238968,0.0004101201,0.0005618315,0.000206142,0.004425341],"category_scores_gemma":[0.0005166375,0.0001616569,0.0001813468,0.0002520019,0.000139331,0.0003735534,0.0001735067,0.0002059218,0.0004382874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005121292,"about_ca_system_score_gemma":0.0004432744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003035866,"about_ca_topic_score_gemma":0.003116928,"domain_scores_codex":[0.9998274,0.00002608767,0.000007872977,0.00003218296,0.00006897403,0.00003740695],"domain_scores_gemma":[0.9998043,0.00007808955,0.00002436778,0.00001949431,0.00006165457,0.00001223795],"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.001475975,0.0001620233,0.004762272,0.0005303978,0.0001331188,0.0007248413,0.0002469222,0.5365101,0.1273406,0.007010762,0.009824215,0.3112788],"study_design_scores_gemma":[0.00008841518,0.0004214213,0.002367773,0.00003122332,0.00003395636,0.0002654129,0.00007667372,0.9163911,0.07157058,0.001142521,0.007580886,0.00002992458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3987424,0.0008467475,0.573706,0.0001604211,0.0001242682,0.0001658195,0.0003085309,0.007409007,0.01853681],"genre_scores_gemma":[0.9014837,0.0001204138,0.09482954,0.00004272369,0.000007320308,0.00006438559,0.0001314218,0.00009742045,0.003223005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004425341,"threshold_uncertainty_score":0.01480424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}