{"meta":{"query_hash":"cc8e4962e023","filters":{"venue":"International Journal of Ad Hoc and Ubiquitous Computing"},"cohort_total":8,"direct_labels_cover":0,"predictions_cover":8,"exported":8,"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/cc8e4962e023","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Ad+Hoc+and+Ubiquitous+Computing"},"results":[{"id":"W1661725067","doi":"10.1504/ijahuc.2015.070587","title":"Spectrum sharing model for OFDMA macro-femtocell networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Femtocell; Macrocell; Computer science; Computer network; Throughput; Telecommunications link; Transmitter power output; Bandwidth (computing); Reuse; Base station; Cellular network; Orthogonal frequency-division multiple access; Quality of service; Telecommunications; Transmitter; Orthogonal frequency-division multiplexing; Wireless; Channel (broadcasting)","score_opus":0.022273857667352223,"score_gpt":0.2612364077213507,"score_spread":0.23896255005399847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661725067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089641936,0.0020724481,0.90626013,0.000102297476,0.0015747256,0.000090305075,0.000004114014,0.000050987517,0.00020307118],"genre_scores_gemma":[0.9665606,0.00023803736,0.031962667,0.00004488418,0.0010556014,0.0000015634472,0.000003876355,0.00003280231,0.000099943565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991024,0.0000055232117,0.00043445642,0.00010605588,0.00017754947,0.00017401385],"domain_scores_gemma":[0.99926025,0.000053569787,0.00020596645,0.000058607013,0.00031516413,0.000106431035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002698208,0.000120433055,0.00018667923,0.00012373264,0.00003791689,0.000085952444,0.00024516476,0.000056319754,0.000001570187],"category_scores_gemma":[0.000029216113,0.00012050773,0.00006299816,0.000049404578,0.000013557416,0.00022733482,0.000068519206,0.00015477401,6.1856105e-7],"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.00004550733,0.000009623089,0.00034363827,0.000015181019,0.00007412995,0.000009641528,0.0004894602,0.98988205,0.00016551795,0.00033769457,0.00031900057,0.00830854],"study_design_scores_gemma":[0.0008358145,0.000047632733,0.000035115514,0.00014634801,0.0000152355415,0.0001361523,0.000097344746,0.9961392,0.00022558139,0.0019310063,0.00027153717,0.00011902956],"about_ca_topic_score_codex":0.0000010633564,"about_ca_topic_score_gemma":0.0000043259447,"teacher_disagreement_score":0.8769187,"about_ca_system_score_codex":0.00013271913,"about_ca_system_score_gemma":0.000022908214,"threshold_uncertainty_score":0.49141625},"labels":[],"label_agreement":null},{"id":"W1992405447","doi":"10.1504/ijahuc.2007.011600","title":"New hierarchical approach to reactive routing protocols for wireless ad hoc networks with cross-layer design","year":2006,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Distributed computing; Dynamic Source Routing; Zone Routing Protocol; Ad hoc wireless distribution service; Wireless ad hoc network; Routing protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Hierarchical routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.024139021160758327,"score_gpt":0.299834536240636,"score_spread":0.27569551507987766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992405447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031022485,0.0002953804,0.9648057,0.00038243545,0.0004522827,0.0026684697,0.0000015276662,0.000057980153,0.00031369345],"genre_scores_gemma":[0.54935366,0.000009278992,0.4485662,0.00024738754,0.0016027098,0.00010572555,0.0000023587088,0.000027644512,0.000085057814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973156,0.00012174945,0.0008084622,0.0004992991,0.0007421018,0.00051280536],"domain_scores_gemma":[0.99729884,0.00063000433,0.0007572372,0.0002308488,0.0008184225,0.00026466753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010638424,0.0002899769,0.00042375294,0.00019797114,0.00023295514,0.0008953908,0.0013604959,0.00012596938,0.0000015347324],"category_scores_gemma":[0.000049636623,0.00023937142,0.00013527401,0.00026753577,0.0000630068,0.00056363444,0.00037624224,0.0005368972,9.896166e-7],"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.0013262968,0.00024258268,0.0010446605,0.000018087156,0.00021295037,0.00010645133,0.0010981559,0.50010544,0.00041609522,0.010565902,0.0018636367,0.48299974],"study_design_scores_gemma":[0.0031315323,0.0013657482,0.0042453445,0.0006456704,0.000023726127,0.0011764488,0.000059118513,0.9817536,0.0007782827,0.0023012834,0.0040479144,0.00047132384],"about_ca_topic_score_codex":0.000009486277,"about_ca_topic_score_gemma":0.0000058969345,"teacher_disagreement_score":0.51833117,"about_ca_system_score_codex":0.00017656037,"about_ca_system_score_gemma":0.00029499206,"threshold_uncertainty_score":0.97612834},"labels":[],"label_agreement":null},{"id":"W2047873690","doi":"10.1504/ijahuc.2008.017004","title":"Hybrid routing protocol with Quality of Service support for Ad Hoc Wireless Networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Zone Routing Protocol; Routing protocol; Ad hoc wireless distribution service; Mobile ad hoc network; Distributed computing; Node (physics); Adaptive quality of service multi-hop routing; Routing (electronic design automation); Network packet","score_opus":0.026235939075310168,"score_gpt":0.3031509205056559,"score_spread":0.2769149814303457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047873690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27877262,0.000106924,0.7167775,0.00040569858,0.0005123721,0.0032795458,0.0000039074494,0.000037146652,0.00010428076],"genre_scores_gemma":[0.9500535,0.000037193055,0.04846473,0.0005467946,0.00063805573,0.00020730252,0.0000030241617,0.000022976856,0.000026432384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972749,0.00011431107,0.00115406,0.00032833108,0.00076996174,0.00035847872],"domain_scores_gemma":[0.9957667,0.0005161831,0.0016860714,0.0002455486,0.0016321247,0.00015337791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012081927,0.00022892926,0.0004899634,0.00013871829,0.00018837542,0.00012788286,0.0012583871,0.000070769696,0.000005165085],"category_scores_gemma":[0.000048312606,0.00019342828,0.0001467705,0.00018465624,0.00008511277,0.000506126,0.00038119548,0.00035483562,6.564412e-7],"study_design_candidate":"simulation_or_modeling","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.0038989375,0.0010425344,0.016646322,0.00045709955,0.0013536362,0.0009992019,0.0064769858,0.16950461,0.0014894217,0.010243133,0.0023715943,0.7855165],"study_design_scores_gemma":[0.006044975,0.0017805151,0.012000336,0.0009248379,0.00003220593,0.0034774137,0.00015654929,0.9689727,0.0016614252,0.00060901075,0.0037729254,0.00056713587],"about_ca_topic_score_codex":0.0000106429,"about_ca_topic_score_gemma":0.00001547597,"teacher_disagreement_score":0.79946804,"about_ca_system_score_codex":0.00008571726,"about_ca_system_score_gemma":0.00028477135,"threshold_uncertainty_score":0.78877765},"labels":[],"label_agreement":null},{"id":"W2120891293","doi":"10.1504/ijahuc.2010.031224","title":"Transport protocol for real-time communication in Wireless Sensor Networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Protocol (science); Computer network; Throughput; User Datagram Protocol; Wireless sensor network; Real-time communication; Wireless; Communications protocol; Wireless network; Real Time Streaming Protocol; Real-time computing; Distributed computing; Internet protocol suite; Telecommunications; The Internet","score_opus":0.010106253004403763,"score_gpt":0.284840049142235,"score_spread":0.2747337961378312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120891293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58331513,0.000026207896,0.40709662,0.00099963,0.0009830635,0.0069232997,0.0000016203206,0.00006870678,0.0005856968],"genre_scores_gemma":[0.89154327,0.000035691195,0.10731685,0.0001150824,0.0004954251,0.000430096,0.000003769377,0.000018780103,0.000041014682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842405,0.000073542375,0.00069411006,0.00021126296,0.0003533025,0.00024375413],"domain_scores_gemma":[0.9981306,0.00043932896,0.00057716714,0.0002320391,0.0005286187,0.00009221258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088790763,0.00015025606,0.00025331305,0.00021385314,0.000101427824,0.00014063324,0.0011393708,0.0001164206,0.0000040321415],"category_scores_gemma":[0.000030906936,0.0001395556,0.00009980315,0.00015101863,0.000065659515,0.0002988228,0.00014030705,0.00046654447,6.8008416e-7],"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.000788084,0.00076739717,0.008748609,0.00006129754,0.00020262405,0.0002526094,0.0027997866,0.53567743,0.017911715,0.02614576,0.00058413716,0.40606058],"study_design_scores_gemma":[0.002000288,0.00014702148,0.0056760227,0.0003077808,0.0000056781946,0.00029972027,0.000031286618,0.98833776,0.00060176384,0.00027870777,0.002120431,0.0001935163],"about_ca_topic_score_codex":0.000012430068,"about_ca_topic_score_gemma":0.00004124154,"teacher_disagreement_score":0.45266038,"about_ca_system_score_codex":0.000046003865,"about_ca_system_score_gemma":0.0000715348,"threshold_uncertainty_score":0.5690912},"labels":[],"label_agreement":null},{"id":"W2160960055","doi":"10.1504/ijahuc.2008.017003","title":"A multi-gateway-based architecture for integrating ad hoc networks with the internet using multiple Foreign Agents","year":2008,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; The Internet; Wireless ad hoc network; Vehicular ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Routing protocol; Wireless; Routing (electronic design automation); Telecommunications; World Wide Web; Network packet","score_opus":0.027430189065159656,"score_gpt":0.26521412167319003,"score_spread":0.23778393260803038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160960055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27704915,0.0014320345,0.72028345,0.00035344568,0.00059239205,0.0002347534,0.0000025269476,0.000034441622,0.000017774135],"genre_scores_gemma":[0.71756494,0.00005382481,0.2812371,0.0006293455,0.00046536047,0.000004105886,0.000003340558,0.00002365283,0.00001832101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978883,0.00013012833,0.0006415234,0.00035941842,0.0005672385,0.00041338944],"domain_scores_gemma":[0.9972088,0.0008218837,0.000899856,0.0002357031,0.0006883306,0.00014543216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006510324,0.00029542536,0.00035089173,0.00019273831,0.0003351601,0.0003094156,0.0014735843,0.00009757293,0.0000029544913],"category_scores_gemma":[0.00010274191,0.00019485096,0.00023715534,0.00020371702,0.00015285847,0.00029906502,0.0003351073,0.00061068527,4.8625935e-7],"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.0005422183,0.00016858055,0.0029945693,0.000022631317,0.00046051666,0.00037186523,0.004853812,0.7540999,0.00028460057,0.00034101927,0.0008220833,0.23503819],"study_design_scores_gemma":[0.0022466371,0.0004548988,0.0008922828,0.00044132408,0.000028275952,0.0015355336,0.0002400962,0.9914524,0.0001691304,0.00008888733,0.0022221156,0.0002284395],"about_ca_topic_score_codex":0.000010763693,"about_ca_topic_score_gemma":0.00006522016,"teacher_disagreement_score":0.4405158,"about_ca_system_score_codex":0.00012935286,"about_ca_system_score_gemma":0.00017186403,"threshold_uncertainty_score":0.79457915},"labels":[],"label_agreement":null},{"id":"W4396799150","doi":"10.1504/ijahuc.2024.10064040","title":"Energy Efficient Random Forest Classifier-Based Secure Routing for Opportunistic Internet of Things","year":2024,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Random forest; Internet of Things; Classifier (UML); Computer network; The Internet; Computer security; Artificial intelligence; World Wide Web","score_opus":0.016055544782703088,"score_gpt":0.26262597609873334,"score_spread":0.24657043131603024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396799150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11128485,0.0013504233,0.88303125,0.0008501978,0.0032008695,0.00007450099,0.000004422031,0.000049897284,0.00015357429],"genre_scores_gemma":[0.97713655,0.000055933386,0.02191766,0.00032186942,0.0005120901,0.0000011603555,0.000005679773,0.000018093577,0.000030961597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804944,0.00006893279,0.0008073128,0.00026773583,0.00056212075,0.00024448187],"domain_scores_gemma":[0.99727744,0.0013242933,0.00055814744,0.00013260478,0.0005959158,0.00011158538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008183966,0.00017919052,0.00033524816,0.0003264012,0.00006614066,0.00038113527,0.0009260116,0.00009240178,0.000003553116],"category_scores_gemma":[0.00013125649,0.00015670506,0.0002360813,0.0001501702,0.00007737898,0.00021869659,0.00022897206,0.00027937457,4.6595989e-7],"study_design_candidate":"simulation_or_modeling","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.00062328734,0.00027961537,0.00039028545,0.00026933898,0.0007824048,0.00073767564,0.008371282,0.08288941,0.0015244551,0.34324446,0.0018966196,0.5589912],"study_design_scores_gemma":[0.0011618488,0.00024154896,0.00004895471,0.0010766236,0.00003106268,0.0003442222,0.0000968683,0.9913888,0.00072266074,0.0021798117,0.002560992,0.00014661987],"about_ca_topic_score_codex":0.00001552376,"about_ca_topic_score_gemma":0.0000044919075,"teacher_disagreement_score":0.90849936,"about_ca_system_score_codex":0.000095819225,"about_ca_system_score_gemma":0.00019042044,"threshold_uncertainty_score":0.63902473},"labels":[],"label_agreement":null},{"id":"W4399178597","doi":"10.1504/ijahuc.2024.138743","title":"Energy efficient random forest classifier-based secure routing for opportunistic internet of things","year":2024,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Random forest; Internet of Things; Classifier (UML); Computer network; The Internet; Artificial intelligence; Computer security; World Wide Web","score_opus":0.015381109941420558,"score_gpt":0.25628867964609464,"score_spread":0.24090756970467408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399178597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09123309,0.00097602524,0.90363955,0.0006795191,0.0032054293,0.000060670627,0.0000026676216,0.000039166644,0.00016385302],"genre_scores_gemma":[0.98668337,0.000067988694,0.012454302,0.00027475384,0.00046186362,0.0000010956855,0.0000034270438,0.000010902594,0.00004226939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847245,0.000057662255,0.0006546193,0.00021325154,0.00042844596,0.00017356989],"domain_scores_gemma":[0.99826306,0.0006471259,0.00044578855,0.00009075471,0.00046824457,0.000085043845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081636023,0.00013344026,0.00024320628,0.00029734417,0.00007777692,0.00030278624,0.0005757312,0.00007214336,0.000005536586],"category_scores_gemma":[0.00009353513,0.00011337628,0.00019434356,0.00014350009,0.00005188766,0.00024854802,0.00017504694,0.00021817557,4.5982492e-7],"study_design_candidate":"simulation_or_modeling","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.0005681444,0.00016385417,0.000100914294,0.00015262685,0.00034727342,0.00020644623,0.0036776809,0.01837052,0.0017976514,0.19575655,0.0013766137,0.77748173],"study_design_scores_gemma":[0.00092970167,0.00035300403,0.00003906363,0.00078379014,0.000022669221,0.00025236094,0.00005179096,0.9855354,0.0012830038,0.003280822,0.007358653,0.0001097627],"about_ca_topic_score_codex":0.000014516248,"about_ca_topic_score_gemma":0.000005154061,"teacher_disagreement_score":0.9671649,"about_ca_system_score_codex":0.00007007781,"about_ca_system_score_gemma":0.0001512581,"threshold_uncertainty_score":0.46233505},"labels":[],"label_agreement":null},{"id":"W4408969406","doi":"10.1504/ijahuc.2025.10070267","title":"Integrated Optimisation of Traffic Signals and Platoon Trajectories with Advanced Forward-looking Planning in the Connected Vehicle Environment","year":2025,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Traffic control and management","field":"Engineering","cited_by":0,"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 Alberta","funders":"","keywords":"Platoon; Computer science; Real-time computing; Operations research; Artificial intelligence; Control (management)","score_opus":0.005372079596503408,"score_gpt":0.21368602280098603,"score_spread":0.20831394320448263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408969406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856445,0.0019430498,0.011906026,0.00015916085,0.00014882808,0.00009077162,0.0000015012671,0.000015478943,0.000090653106],"genre_scores_gemma":[0.9984855,0.00018547848,0.0012493929,0.000036570822,0.000031298638,0.0000012477406,0.0000018270612,0.0000054352645,0.0000032626247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933755,0.000024793793,0.0003064827,0.00007189389,0.0001714777,0.00008780971],"domain_scores_gemma":[0.9995988,0.0001869373,0.000113011345,0.000034950677,0.000049822465,0.000016488639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022564069,0.00008809293,0.0001569773,0.00015413477,0.00003092495,0.000041079486,0.000114631235,0.000024238137,0.0000017556462],"category_scores_gemma":[0.000014859289,0.000063293184,0.00002360935,0.000069153786,0.000024849523,0.00009124762,0.000019983669,0.00013846446,4.073061e-8],"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.000139774,0.000021527605,0.00036751633,0.000024036966,0.0001327503,0.000019918896,0.002495097,0.8126892,0.0020330555,0.00011662487,0.00001191284,0.1819486],"study_design_scores_gemma":[0.0060852114,0.0006351997,0.061994027,0.0018071211,0.0001281312,0.00011557766,0.013883113,0.9103404,0.002194699,0.00018188708,0.0023399692,0.0002946356],"about_ca_topic_score_codex":0.0000019683048,"about_ca_topic_score_gemma":0.000008382891,"teacher_disagreement_score":0.18165396,"about_ca_system_score_codex":0.000042723706,"about_ca_system_score_gemma":0.0000143738325,"threshold_uncertainty_score":0.25810212},"labels":[],"label_agreement":null}]}