{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001473679,0.0001525704,0.0001086357,0.0001553084,0.0004357643,0.00008240187,0.0003174703,0.0001194932,0.00007739282],"category_scores_gemma":[0.00001251874,0.0001328975,0.00002884295,0.0002098606,0.0001116731,0.0001435847,0.00002722864,0.0001581058,0.0000189594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007646468,"about_ca_system_score_gemma":0.00003720072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004810403,"about_ca_topic_score_gemma":0.000002679327,"domain_scores_codex":[0.9991655,0.00001635421,0.0002214579,0.0002633386,0.000140439,0.0001929167],"domain_scores_gemma":[0.9993907,0.00004997066,0.00007877016,0.0002515371,0.0001777289,0.00005133149],"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.00006919652,0.0002106748,0.0001242644,0.00001329121,0.00009076947,5.138034e-7,0.0006266659,0.6030253,0.004860821,0.298224,0.0004180104,0.09233657],"study_design_scores_gemma":[0.0003094817,0.0001445286,0.00007884951,0.00001549708,0.00001237255,0.000004792301,0.0001492244,0.9929607,0.002583792,0.001209576,0.002373912,0.0001572695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01918692,0.00002458957,0.9728233,0.000356078,0.0001521413,0.000514236,0.00004210442,0.0002818128,0.006618837],"genre_scores_gemma":[0.981814,0.00005236627,0.01697158,0.000286759,0.0002546218,0.0002269538,0.0001037494,0.00002813806,0.000261848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9626271,"threshold_uncertainty_score":0.5419402,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006041735,0.0002349166,0.0001776241,0.0003094974,0.0003532169,0.0003871951,0.0007904677,0.000128296,0.0003859164],"category_scores_gemma":[0.0001002364,0.0002290118,0.0000421675,0.0003990641,0.0001446993,0.0004059587,0.0001473391,0.0001412806,0.0006770617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001624616,"about_ca_system_score_gemma":0.0001681383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002385324,"about_ca_topic_score_gemma":0.000001366092,"domain_scores_codex":[0.9977009,0.0001339122,0.0003884034,0.000720725,0.0008215531,0.0002345005],"domain_scores_gemma":[0.9979354,0.0001128943,0.0002761915,0.0006272508,0.0008992519,0.0001490044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001058222,0.0008104403,0.000131205,0.00001632223,0.0001045915,0.000004332255,0.00131973,0.2077398,0.003761302,0.6360074,0.01907156,0.1309275],"study_design_scores_gemma":[0.0005652267,0.0002404311,0.0004258396,0.00007261865,0.00001055289,0.000008551121,0.00003280529,0.9914718,0.0005691201,0.002575704,0.00378014,0.0002471947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001079058,0.000006070794,0.9145752,0.002907933,0.0004325034,0.0007742149,0.00004211751,0.000243243,0.07993961],"genre_scores_gemma":[0.3140502,0.0003779611,0.6726663,0.001956575,0.001277295,0.001212184,0.0008891044,0.00006773148,0.007502597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.783732,"threshold_uncertainty_score":0.9338832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}