{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025006525,0.0007198797,0.9524611,0.00063768664,0.000119545715,0.000077213444,0.00036367463,0.00017228887,0.020442054],"genre_scores_gemma":[0.91605794,0.0011253565,0.052583206,0.0003010635,0.00014563992,0.0003272447,0.00024482174,0.00009237251,0.0291223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994469,0.00016498328,0.00001485902,0.00009128227,0.00015282429,0.00012904429],"domain_scores_gemma":[0.9993923,0.00033130893,0.00007882579,0.000028375769,0.00012557092,0.000043569944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083846424,0.0010172839,0.00082601164,0.00046970442,0.00055018795,0.0014043361,0.0018127046,0.0015006448,0.0043353573],"category_scores_gemma":[0.0012344786,0.00039802067,0.00072160194,0.00093837216,0.00083613774,0.0012315882,0.0009521645,0.0012806997,0.0009172313],"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.000029665944,0.00002952606,0.00014552819,0.0000421733,0.000013578871,0.00012993065,0.000043969034,0.9661763,0.00093709904,0.026961468,0.0012322852,0.0042584934],"study_design_scores_gemma":[0.0000026884,0.000008854913,0.00003687996,0.0000020380753,0.000002232987,0.000010852867,0.000009582117,0.99604684,0.000051620533,0.0035645794,0.00026144687,0.0000023434022],"about_ca_topic_score_codex":0.0093195485,"about_ca_topic_score_gemma":0.0068300497,"teacher_disagreement_score":0.0093195485,"about_ca_system_score_codex":0.0015355246,"about_ca_system_score_gemma":0.0010558219,"threshold_uncertainty_score":0.018530607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093747245,0.0014927088,0.99376845,0.00015805823,0.00029205548,0.00013025157,0.000030415467,0.00074654695,0.0024440065],"genre_scores_gemma":[0.06226829,0.0026372583,0.9272666,0.0005258991,0.00039633625,0.0006958134,0.00023895215,0.00015138485,0.005819449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846387,0.0003390546,0.00017224482,0.0001766621,0.0007461962,0.00010197551],"domain_scores_gemma":[0.99885607,0.0002769347,0.00013812014,0.00024720645,0.0004061281,0.00007556352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019208329,0.0009251702,0.00067860004,0.000928269,0.00077383127,0.0015612489,0.0027467741,0.0010240342,0.0016416493],"category_scores_gemma":[0.0018569521,0.000613502,0.00084163685,0.0008495018,0.0010052171,0.0024502166,0.001513648,0.0021661741,0.0009363814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00013308281,0.00017438155,0.00067215296,0.0012625449,0.0002817359,0.00059820904,0.0007927095,0.07399824,0.05179066,0.47438705,0.018629652,0.37727958],"study_design_scores_gemma":[0.00010952345,0.00062777323,0.0005802848,0.00021195968,0.00035754673,0.0012367786,0.00016100102,0.6012023,0.019540725,0.16131757,0.2144628,0.00019175312],"about_ca_topic_score_codex":0.0011343121,"about_ca_topic_score_gemma":0.0017645479,"teacher_disagreement_score":0.0027467741,"about_ca_system_score_codex":0.00084810617,"about_ca_system_score_gemma":0.0010913361,"threshold_uncertainty_score":0.010158479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028876584,0.005433053,0.9542975,0.0006683007,0.0007280736,0.0005347248,0.00018570754,0.0024028078,0.0068732477],"genre_scores_gemma":[0.51150936,0.0026682643,0.47530183,0.0006317775,0.0004703088,0.0011890538,0.00085979444,0.00027038562,0.0070991684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981164,0.0006436334,0.00017285468,0.00014986313,0.0007985116,0.00011878882],"domain_scores_gemma":[0.9978738,0.0008347085,0.000248345,0.00037060882,0.0005593431,0.0001131644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001816402,0.0007575687,0.00097555073,0.0011128475,0.00070086267,0.0014588619,0.0025843421,0.001288793,0.001492025],"category_scores_gemma":[0.0034065684,0.00028239706,0.00047822433,0.0015078692,0.0007537829,0.002842453,0.0017409913,0.0011674522,0.0007650783],"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.0015041154,0.00043568807,0.0019383286,0.0016596654,0.000599186,0.0013677193,0.00077969773,0.12962465,0.10010264,0.15629445,0.017564284,0.58812964],"study_design_scores_gemma":[0.0005212895,0.0020771038,0.0012816342,0.0001445145,0.0004884149,0.0030767452,0.00021630856,0.7735992,0.028635673,0.0818971,0.10779636,0.00026559737],"about_ca_topic_score_codex":0.00048348878,"about_ca_topic_score_gemma":0.00052244763,"teacher_disagreement_score":0.0025843421,"about_ca_system_score_codex":0.0004755666,"about_ca_system_score_gemma":0.0005939971,"threshold_uncertainty_score":0.009606183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006558386,0.023279848,0.93410856,0.002125968,0.0048488877,0.002679169,0.0010880866,0.0037438294,0.021567388],"genre_scores_gemma":[0.17375955,0.03874552,0.71687347,0.0035291144,0.00250001,0.012902558,0.0087078605,0.0020461513,0.04093579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952486,0.001561349,0.00094624684,0.00026200156,0.0017319352,0.0002497987],"domain_scores_gemma":[0.99693465,0.0010126577,0.00039962502,0.0004897966,0.0010180403,0.00014524952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003954763,0.0017773786,0.0017697588,0.0017026343,0.0014792017,0.0032105348,0.0029693777,0.0026196276,0.0059569445],"category_scores_gemma":[0.0068247374,0.0006567117,0.00089844037,0.003761922,0.001304147,0.0034734341,0.0019413169,0.004328373,0.0048698406],"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.0011826591,0.00053040165,0.0013161815,0.0076557854,0.000651608,0.0036502276,0.001570042,0.033998743,0.088085875,0.31499434,0.115273796,0.4310904],"study_design_scores_gemma":[0.0003906403,0.0011905311,0.0010013189,0.002001917,0.00041954557,0.0033739079,0.00045452573,0.12766482,0.046832725,0.10600639,0.7102268,0.00043698936],"about_ca_topic_score_codex":0.0013299729,"about_ca_topic_score_gemma":0.000804148,"teacher_disagreement_score":0.0059569445,"about_ca_system_score_codex":0.0015612094,"about_ca_system_score_gemma":0.001995888,"threshold_uncertainty_score":0.020915091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028746078,0.00059400406,0.95878935,0.000266604,0.00019208665,0.00037604079,0.000042266234,0.0034727843,0.00752079],"genre_scores_gemma":[0.2461099,0.00067279075,0.74460083,0.00026643722,0.0000710551,0.0002717788,0.0002294794,0.00009511888,0.0076826545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977714,0.000049924216,0.000020529853,0.000045926336,0.000080444726,0.000026048476],"domain_scores_gemma":[0.9998142,0.000019949233,0.000021613154,0.000046727084,0.00005727951,0.000040193314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043431512,0.0003718818,0.00036989225,0.00064953015,0.0005397424,0.00082978694,0.0015473372,0.0008473562,0.0010889511],"category_scores_gemma":[0.0003799811,0.00025971033,0.0005282198,0.00056616997,0.00042853656,0.0013685484,0.00085046847,0.0009269013,0.00055392523],"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.00040313444,0.0007416864,0.0046261484,0.00078428775,0.00033360516,0.0018941973,0.0008291472,0.09268656,0.19613485,0.18534486,0.010697437,0.50552416],"study_design_scores_gemma":[0.00020936725,0.0018488804,0.0036789195,0.00015517704,0.00047870516,0.003085499,0.00019033332,0.75450766,0.069323346,0.032355018,0.13399142,0.00017564218],"about_ca_topic_score_codex":0.0014869281,"about_ca_topic_score_gemma":0.0021268274,"teacher_disagreement_score":0.0015473372,"about_ca_system_score_codex":0.00044276577,"about_ca_system_score_gemma":0.000733054,"threshold_uncertainty_score":0.0036429167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09782454,0.0007704842,0.8966717,0.0004512124,0.00018457291,0.00016207015,0.00024004528,0.0013373784,0.0023579467],"genre_scores_gemma":[0.8970883,0.00024784636,0.10058473,0.00011688212,0.00005698618,0.00009232479,0.00041963934,0.000037191407,0.0013560083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995109,0.00009249924,0.000029351811,0.00008848843,0.00017642319,0.00010231811],"domain_scores_gemma":[0.99889225,0.0005110609,0.00014337577,0.00011088893,0.0003011475,0.000041254625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012078823,0.00057887,0.0008650252,0.00065980986,0.00065431575,0.00049630005,0.000958012,0.0006644008,0.00068387244],"category_scores_gemma":[0.0024446493,0.00018304934,0.0005088933,0.00054104096,0.0003093297,0.0010420583,0.00046748552,0.00063332275,0.0002500656],"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.00027104444,0.00021532034,0.0035911407,0.00008208412,0.000088275134,0.0002060631,0.000059317317,0.7322058,0.008709893,0.006205497,0.0056699417,0.2426956],"study_design_scores_gemma":[0.000006122128,0.000048826092,0.0002491733,0.0000027779479,0.0000089457835,0.000038947048,0.0000073419596,0.9970541,0.00081103016,0.0014603138,0.00030721058,0.0000051699867],"about_ca_topic_score_codex":0.005682625,"about_ca_topic_score_gemma":0.007931695,"teacher_disagreement_score":0.005682625,"about_ca_system_score_codex":0.0006760735,"about_ca_system_score_gemma":0.001011444,"threshold_uncertainty_score":0.011299074},"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":"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.11235723,0.0008542207,0.8815633,0.00048964407,0.00020636745,0.00016883748,0.00027204573,0.0014961141,0.0025922407],"genre_scores_gemma":[0.9006407,0.00025167884,0.096962556,0.00011859851,0.000058712307,0.00008956026,0.00044457096,0.000037886264,0.0013957391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953437,0.000085927415,0.000028089455,0.000086078006,0.00016517687,0.000100354955],"domain_scores_gemma":[0.99896324,0.00047535778,0.00013146509,0.00009948729,0.00029138193,0.000039019615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011636358,0.0005944867,0.00086552935,0.00066464266,0.0006358336,0.0005007631,0.0009487921,0.00065741304,0.0007050232],"category_scores_gemma":[0.0023127308,0.00018359786,0.00051237433,0.00052767154,0.00029200187,0.0010164004,0.00043655178,0.00063218415,0.00025608944],"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.0002759855,0.00022297914,0.0037904119,0.00007988431,0.000089817026,0.00019725299,0.00005519489,0.7338124,0.008201471,0.00544404,0.005647041,0.24218342],"study_design_scores_gemma":[0.000005979493,0.000048046924,0.0002591501,0.0000027760432,0.000009136788,0.000036490943,0.0000071986956,0.9972223,0.0007762845,0.0013353185,0.0002923244,0.0000049549435],"about_ca_topic_score_codex":0.006130356,"about_ca_topic_score_gemma":0.008341965,"teacher_disagreement_score":0.006130356,"about_ca_system_score_codex":0.00067345425,"about_ca_system_score_gemma":0.000990423,"threshold_uncertainty_score":0.012189388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04755342,0.00010570512,0.9483059,0.000071158924,0.000022964039,0.000052339856,0.000047153626,0.00023813249,0.0036032281],"genre_scores_gemma":[0.90608174,0.000078600504,0.09219017,0.00002374563,0.000009656062,0.00009300222,0.00007098431,0.000050512666,0.001401692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972445,0.00007442489,0.000011031257,0.00005210953,0.000080075704,0.000057864232],"domain_scores_gemma":[0.9996092,0.00019952895,0.00005651126,0.000023302826,0.000072521216,0.000038950304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005835037,0.0008580442,0.0005825482,0.0005401843,0.0002887339,0.000901881,0.00069894706,0.0006776791,0.0009992223],"category_scores_gemma":[0.0015837423,0.0004057749,0.0004944076,0.00047282694,0.00051370036,0.00065243087,0.0009640496,0.00073190226,0.00013773289],"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.000013796932,0.000007950167,0.00011499083,0.000010534389,0.0000064587634,0.000010612092,0.000012588274,0.9945984,0.0003951721,0.0009890654,0.000046754878,0.0037938114],"study_design_scores_gemma":[0.0000022039233,0.000011651062,0.000046123183,0.0000012750733,0.0000022069057,0.0000022025197,0.000004830302,0.9990783,0.00014229586,0.0006254382,0.00008183186,0.000001627885],"about_ca_topic_score_codex":0.00803795,"about_ca_topic_score_gemma":0.006844844,"teacher_disagreement_score":0.00803795,"about_ca_system_score_codex":0.0006083249,"about_ca_system_score_gemma":0.0013581307,"threshold_uncertainty_score":0.01598233},"labels":[],"label_agreement":null}]}