{"meta":{"query_hash":"da50516e2911","filters":{"venue":"International Journal of Communication Systems"},"cohort_total":166,"direct_labels_cover":1,"predictions_cover":166,"exported":166,"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/da50516e2911","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Communication+Systems"},"results":[{"id":"W108571205","doi":"","title":"Split agent-based routing in interconnected networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Network packet; Computer network; Distributed computing; Hierarchical routing; Static routing; Routing (electronic design automation); Policy-based routing; Routing table; Source routing; Quality of service; Routing protocol; Dynamic Source Routing","score_opus":0.06524714825460248,"score_gpt":0.35041425723549785,"score_spread":0.28516710898089537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108571205","genre_codex":"review","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.015902461,0.61546075,0.27313137,0.008230505,0.005236794,0.00023860313,0.000086784756,0.00036472085,0.08134808],"genre_scores_gemma":[0.17627984,0.6518745,0.11974225,0.0012191451,0.009725946,0.00025975076,0.0003284948,0.00020542118,0.040364563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949455,0.000118281016,0.000036100035,0.00011066834,0.00019340978,0.000047048306],"domain_scores_gemma":[0.9986802,0.0007159116,0.00006287696,0.00007661638,0.00037501322,0.00008935988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407256,0.0007375941,0.0006692663,0.0011747769,0.000575625,0.00256695,0.00082603085,0.0015868585,0.003305802],"category_scores_gemma":[0.0023396816,0.0006381937,0.0004707037,0.003251672,0.0014476101,0.0023730902,0.00077955326,0.0018200376,0.0009571175],"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.00012551394,0.00035580446,0.0012042772,0.002108684,0.0001189434,0.0005312963,0.0006658298,0.06934699,0.0030502244,0.34585494,0.03245746,0.54418004],"study_design_scores_gemma":[0.00007498435,0.00044578296,0.0016877886,0.0013158402,0.0001067309,0.0011973522,0.0005491796,0.17671946,0.0025212476,0.24572606,0.5695579,0.00009781856],"about_ca_topic_score_codex":0.0020644846,"about_ca_topic_score_gemma":0.0010616194,"teacher_disagreement_score":0.003305802,"about_ca_system_score_codex":0.001136104,"about_ca_system_score_gemma":0.0010667238,"threshold_uncertainty_score":0.011058986},"labels":[],"label_agreement":null},{"id":"W1481187517","doi":"10.1002/dac.2789","title":"Advanced communication systems for enhanced big data technology and applications","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Big data; Data science; Data mining","score_opus":0.03351878799679666,"score_gpt":0.3026030449892825,"score_spread":0.26908425699248584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481187517","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004785562,0.04173983,0.18877552,0.06677869,0.20965105,0.0021983006,0.0045738267,0.01169015,0.46980706],"genre_scores_gemma":[0.055590298,0.04115296,0.07576378,0.015665555,0.13224556,0.0020276755,0.007988069,0.00346613,0.6660999],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.993838,0.0016615399,0.00071628555,0.0006614742,0.0027081014,0.00041459582],"domain_scores_gemma":[0.98491967,0.0029286123,0.001058121,0.0025881047,0.006999802,0.0015056124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059604044,0.001192133,0.0010164459,0.0023025014,0.0016479456,0.007908036,0.0018006586,0.0031868627,0.18384154],"category_scores_gemma":[0.016855532,0.00053133944,0.0007233491,0.0023158928,0.0009838903,0.0063212374,0.004780371,0.0033167987,0.10291198],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00015111903,0.000043324333,0.00023531108,0.0006324443,0.000027318427,0.00014849122,0.00020002117,0.00038455095,0.0028263235,0.04426712,0.7678482,0.1832358],"study_design_scores_gemma":[0.000014820206,0.00004250349,0.00019480284,0.000099047844,0.000007561066,0.00012624956,0.000038650996,0.0007765178,0.00068560237,0.006161622,0.9918389,0.000013683307],"about_ca_topic_score_codex":0.0002970245,"about_ca_topic_score_gemma":0.00026490228,"teacher_disagreement_score":0.18384154,"about_ca_system_score_codex":0.0013769481,"about_ca_system_score_gemma":0.0023601267,"threshold_uncertainty_score":0.6150112},"labels":[],"label_agreement":null},{"id":"W1481821562","doi":"10.1002/dac.2359","title":"Performance of transmitted reference pulse cluster ultra‐wideband systems with forward error correction","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":12,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Forward error correction; Convolutional code; Bit error rate; Ultra-wideband; TRPC; Electronic engineering; Error detection and correction; Wireless; Coding (social sciences); Interleaving; Computer network; Real-time computing; Algorithm; Telecommunications; Decoding methods","score_opus":0.016700675738934842,"score_gpt":0.24924706020670215,"score_spread":0.23254638446776732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481821562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8738173,0.00090116786,0.11506412,0.0002704793,0.00013167458,0.00006040702,0.00012988757,0.0009377046,0.008687187],"genre_scores_gemma":[0.99315804,0.00007452766,0.0058544427,0.00004392459,0.0000135771825,0.000014017844,0.000068793706,0.000010963399,0.0007616882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917406,0.00021030818,0.00003569493,0.00013128307,0.0002744176,0.00017414622],"domain_scores_gemma":[0.99736905,0.0010200646,0.00022441997,0.00029183365,0.0010017582,0.00009271718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012661832,0.00051608804,0.00066520483,0.00042132562,0.00056045427,0.00067373866,0.00063761225,0.0011669352,0.0013950153],"category_scores_gemma":[0.0023809806,0.00015468783,0.00025788345,0.00045398172,0.00047367119,0.000539025,0.0006934488,0.0007324116,0.00039043484],"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.006329678,0.00041630512,0.01017256,0.0005354024,0.0004827819,0.00083518686,0.0008522875,0.48216864,0.2810177,0.011278141,0.0029198965,0.20299155],"study_design_scores_gemma":[0.00014712948,0.0016837075,0.0031820016,0.000040648923,0.00014149534,0.00065057754,0.000111641835,0.8896478,0.10121202,0.0015069565,0.0015981215,0.00007787401],"about_ca_topic_score_codex":0.0022830453,"about_ca_topic_score_gemma":0.0011144871,"teacher_disagreement_score":0.0022830453,"about_ca_system_score_codex":0.0005923186,"about_ca_system_score_gemma":0.00078799104,"threshold_uncertainty_score":0.006696284},"labels":[],"label_agreement":null},{"id":"W1484239453","doi":"10.1002/dac.2777","title":"Dynamic intelligence towards smart and green world","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Ubiquitous computing; Energy consumption; Cloud computing; Efficient energy use; Green computing; Wireless sensor network; Context (archaeology); Variety (cybernetics); Wireless; Field (mathematics); Telecommunications; Computer security; Computer network; Human–computer interaction; Artificial intelligence; Engineering","score_opus":0.02478163070342392,"score_gpt":0.2888689877850755,"score_spread":0.2640873570816516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484239453","genre_codex":"other","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.01862571,0.22581133,0.1679815,0.14885777,0.08221992,0.00018717487,0.00047798373,0.0029682382,0.35287032],"genre_scores_gemma":[0.2789035,0.26674798,0.06102919,0.0314929,0.060296733,0.0003170283,0.00078181777,0.0014515077,0.29897934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990396,0.00019612467,0.00004150374,0.00019843198,0.00039993372,0.00012446249],"domain_scores_gemma":[0.99884665,0.00039395905,0.00012081871,0.0001718448,0.0002537525,0.00021291964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725819,0.0005649057,0.0005636087,0.0014733543,0.0012880334,0.006684921,0.000905818,0.0023060257,0.009015004],"category_scores_gemma":[0.00227042,0.0003306668,0.00048576458,0.0015348303,0.0022796916,0.009894588,0.002848728,0.003439756,0.003382161],"study_design_candidate":"not_applicable","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.000062585576,0.000034865294,0.00039671437,0.0009264686,0.000035308654,0.0003534688,0.0011104011,0.0015582059,0.0050420775,0.5473659,0.26745895,0.17565505],"study_design_scores_gemma":[0.000003507892,0.000018729637,0.00018595892,0.00014439577,0.00000937358,0.00022192168,0.0003589195,0.0015668649,0.0011775085,0.09170066,0.904594,0.000018220213],"about_ca_topic_score_codex":0.00031463045,"about_ca_topic_score_gemma":0.00042191404,"teacher_disagreement_score":0.009015004,"about_ca_system_score_codex":0.0010448248,"about_ca_system_score_gemma":0.0010340711,"threshold_uncertainty_score":0.030158162},"labels":[],"label_agreement":null},{"id":"W1485150649","doi":"10.1002/dac.2997","title":"Localization in terrestrial and underwater sensor‐based m2m communication networks: architecture,classification and challenges","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":27,"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; Ontario Tech University; Seneca Polytechnic","funders":"","keywords":"Computer science; Underwater; Architecture; Wireless sensor network; Underwater acoustic communication; Artificial intelligence; Telecommunications; Computer network; Geology; Oceanography","score_opus":0.07475452456771559,"score_gpt":0.268197250278016,"score_spread":0.1934427257103004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485150649","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08220935,0.2058473,0.6506377,0.012378847,0.00079207355,0.00025264,0.00020060476,0.00091151294,0.04676994],"genre_scores_gemma":[0.7520062,0.10609001,0.12590615,0.0010187967,0.0011342489,0.00025068515,0.00040747225,0.00006269174,0.013123688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996698,0.00008494861,0.000026147643,0.00006495638,0.000109550834,0.000044744243],"domain_scores_gemma":[0.9992889,0.00025724564,0.00010875299,0.000059068512,0.000249163,0.00003680373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061065983,0.00031331342,0.0003845416,0.0011325112,0.00043099053,0.0010666014,0.0007399314,0.0011382082,0.0012337804],"category_scores_gemma":[0.0012887291,0.00027449313,0.00028635212,0.001815033,0.00067709066,0.002127865,0.0009530485,0.0005277238,0.00044531116],"study_design_candidate":"theoretical_or_conceptual","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.00008383318,0.00006557721,0.01036485,0.0013012285,0.000048578833,0.00036641074,0.00035606735,0.106032714,0.008245429,0.07806005,0.013941059,0.7811342],"study_design_scores_gemma":[0.000011767022,0.00029198348,0.010265108,0.0005568238,0.000056017958,0.0015977211,0.0011004276,0.7361275,0.008111297,0.07980953,0.16197757,0.000094212664],"about_ca_topic_score_codex":0.0022759843,"about_ca_topic_score_gemma":0.00210495,"teacher_disagreement_score":0.0022759843,"about_ca_system_score_codex":0.00074071944,"about_ca_system_score_gemma":0.00051651837,"threshold_uncertainty_score":0.0053743124},"labels":[],"label_agreement":null},{"id":"W1497574042","doi":"10.1002/dac.2428","title":"Cryptanalysis of a dynamic ID‐based remote user authentication with key agreement scheme","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Computer science; Forward secrecy; Spoofing attack; Anonymity; Password; Computer security; Scheme (mathematics); Cryptanalysis; Key (lock); Authentication (law); Secrecy; Computer network; Cryptography; Public-key cryptography; Encryption","score_opus":0.019075528368263994,"score_gpt":0.3180970421640217,"score_spread":0.2990215137957577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497574042","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.18356456,0.00096613966,0.75957066,0.002579313,0.00035001407,0.00055962504,0.0003237916,0.001272444,0.05081336],"genre_scores_gemma":[0.9538641,0.0002256133,0.037731998,0.00014657114,0.000050352992,0.00011374633,0.00009739052,0.000042673386,0.0077274586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657863,0.0008259869,0.00015320332,0.00028723868,0.0016135212,0.0005413234],"domain_scores_gemma":[0.997421,0.0010419484,0.0002736124,0.00081981893,0.00032897203,0.00011461012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019235847,0.00041838785,0.0007018985,0.0009859444,0.001333309,0.0015994384,0.0012546924,0.0011720301,0.004580262],"category_scores_gemma":[0.0041291416,0.00034967586,0.00085474056,0.0010482016,0.002195462,0.0028793775,0.0028966789,0.002022395,0.0010936627],"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.0009848931,0.00013091139,0.0014593026,0.00020458162,0.0001098758,0.0013430853,0.0006437152,0.04822354,0.026044566,0.86689955,0.0051066107,0.048849393],"study_design_scores_gemma":[0.0004075717,0.0003176523,0.001051791,0.00010832692,0.00013032199,0.002419221,0.00014892338,0.60411936,0.047734313,0.30702764,0.03636487,0.00017003092],"about_ca_topic_score_codex":0.00072914327,"about_ca_topic_score_gemma":0.000298386,"teacher_disagreement_score":0.004580262,"about_ca_system_score_codex":0.0022794476,"about_ca_system_score_gemma":0.0014547277,"threshold_uncertainty_score":0.01653862},"labels":[],"label_agreement":null},{"id":"W1498617973","doi":"10.1002/dac.2785","title":"An efficient distributed routing protocol for wireless sensor networks with mobile sinks","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Routing protocol; Zone Routing Protocol; Wireless Routing Protocol; Dynamic Source Routing; Enhanced Interior Gateway Routing Protocol; Network packet; Distributed computing; Overhead (engineering)","score_opus":0.01458987321632121,"score_gpt":0.2971124017599049,"score_spread":0.2825225285435837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498617973","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.01391482,0.0008189921,0.98276204,0.00025708132,0.00014231159,0.0001241953,0.000054296976,0.00049816933,0.0014282004],"genre_scores_gemma":[0.45007628,0.0011569845,0.5426779,0.00015354893,0.00009142195,0.00047830737,0.00029702776,0.00007715074,0.00499154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994067,0.00020769873,0.00006733222,0.000059980717,0.0002322407,0.000026175361],"domain_scores_gemma":[0.99946195,0.00019846515,0.00006838466,0.000080991995,0.00016440226,0.000025845551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012131706,0.0003909628,0.00046183955,0.000643673,0.00036996015,0.000675202,0.0010168349,0.0005242609,0.00055692374],"category_scores_gemma":[0.0021699115,0.00025513725,0.00033000764,0.0005476429,0.00036455772,0.0012726439,0.0011875841,0.00062689674,0.0002227056],"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.0002920089,0.00012304279,0.0008315252,0.00048431254,0.00018196854,0.0006859115,0.00034690625,0.40327662,0.10545751,0.089912616,0.007175373,0.39123222],"study_design_scores_gemma":[0.000082960054,0.00022182109,0.00026933712,0.00003944676,0.00006918225,0.00037301864,0.000043400752,0.9337117,0.017148798,0.020841016,0.027150681,0.00004859671],"about_ca_topic_score_codex":0.00040699443,"about_ca_topic_score_gemma":0.0006726271,"teacher_disagreement_score":0.0012131706,"about_ca_system_score_codex":0.00033862932,"about_ca_system_score_gemma":0.00055959733,"threshold_uncertainty_score":0.006415963},"labels":[],"label_agreement":null},{"id":"W1512221035","doi":"10.1002/dac.2779","title":"A nodes scheduling model based on Markov chain prediction for big streaming data analysis","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Streaming data; Big data; Markov chain; Scheduling (production processes); Distributed computing; Real Time Streaming Protocol; Construct (python library); Data stream mining; Data mining; Computer network; The Internet; Mathematical optimization; Machine learning","score_opus":0.044810124346788466,"score_gpt":0.2989505884247519,"score_spread":0.2541404640779634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512221035","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.036907036,0.0001549506,0.9601663,0.0003221573,0.00006737982,0.00006454038,0.0001483525,0.00043249008,0.001736747],"genre_scores_gemma":[0.91932994,0.0003289624,0.076716356,0.000086317006,0.000072655996,0.00017714834,0.00037381306,0.000096073345,0.0028187295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928445,0.00018689147,0.00003521748,0.00020035177,0.0001737971,0.00011932865],"domain_scores_gemma":[0.99790263,0.0013317057,0.00020549142,0.00012398197,0.0002839584,0.00015226414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015161826,0.00067319756,0.000864161,0.00058054196,0.00069930684,0.0009813228,0.0016208212,0.00056531123,0.002319954],"category_scores_gemma":[0.0033051355,0.0005054337,0.0007956412,0.00085847965,0.0006851188,0.0013749191,0.0006859328,0.0012281758,0.0003587043],"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.000044710072,0.00002012406,0.0006884732,0.000017077586,0.000013230395,0.00003494879,0.000029978812,0.98606795,0.00055609323,0.00679559,0.00054407766,0.0051878095],"study_design_scores_gemma":[0.0000015999896,0.0000027718227,0.000036706522,5.564106e-7,0.0000018154236,0.000001527762,0.0000019518043,0.9984895,0.000057458346,0.0013617587,0.000042746644,0.0000015620124],"about_ca_topic_score_codex":0.021640856,"about_ca_topic_score_gemma":0.01727321,"teacher_disagreement_score":0.021640856,"about_ca_system_score_codex":0.0016224989,"about_ca_system_score_gemma":0.002469816,"threshold_uncertainty_score":0.043029785},"labels":[],"label_agreement":null},{"id":"W1526373655","doi":"10.1002/dac.2338","title":"Dynamic channel selection with reinforcement learning for cognitive WLAN over fiber","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":38,"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 British Columbia","funders":"","keywords":"Computer science; Cognitive radio; Reinforcement learning; Computer network; Throughput; Cognitive network; Wireless; Radio resource management; Wireless network; Channel (broadcasting); Wi-Fi; Telecommunications; Artificial intelligence","score_opus":0.012597686340594973,"score_gpt":0.2761848124745014,"score_spread":0.2635871261339064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526373655","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.16544694,0.00028867522,0.8291447,0.0003155073,0.000044516553,0.00009351458,0.000017231214,0.0002601872,0.004388741],"genre_scores_gemma":[0.98921305,0.000041974516,0.010018331,0.00003643521,0.00001042726,0.00003589357,0.00000584875,0.000004665076,0.00063340965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.00014567455,0.000013178099,0.000056554145,0.00010624218,0.00010575958],"domain_scores_gemma":[0.9985329,0.0008679031,0.00022628173,0.0000551134,0.0002180031,0.00009983918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011784879,0.00048555303,0.00054945506,0.00035148783,0.0003364317,0.0004667684,0.00080546323,0.0006217382,0.00090825855],"category_scores_gemma":[0.0023349258,0.00021410098,0.00027950658,0.0002085581,0.00089653686,0.0003716826,0.0005890642,0.0006492563,0.000106880325],"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.00007142746,0.00007188312,0.0005468116,0.000013545524,0.000018175626,0.000049401864,0.000022216085,0.984368,0.0009397966,0.0016724465,0.0001666043,0.0120597035],"study_design_scores_gemma":[0.000008105074,0.000022539767,0.000058413272,8.924449e-7,0.0000026435364,0.000004580026,0.0000022282898,0.9993082,0.00011790637,0.00043545224,0.000037092395,0.000002002146],"about_ca_topic_score_codex":0.008550614,"about_ca_topic_score_gemma":0.004643382,"teacher_disagreement_score":0.008550614,"about_ca_system_score_codex":0.00092665723,"about_ca_system_score_gemma":0.00083479146,"threshold_uncertainty_score":0.017001688},"labels":[],"label_agreement":null},{"id":"W1558590994","doi":"10.1002/dac.2597","title":"A novel MAC protocol for IDMA‐based multi‐beam satellite communication systems","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","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 British Columbia","funders":"","keywords":"Computer science; Aloha; Network packet; Throughput; Power control; Computer network; Time division multiple access; Interference (communication); Random access; Real-time computing; Protocol (science); Channel (broadcasting); Power (physics); Wireless; Telecommunications","score_opus":0.09637306775004643,"score_gpt":0.39018022436834726,"score_spread":0.2938071566183008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558590994","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.0075202673,0.0016857232,0.9827436,0.00041702396,0.0006760158,0.00031534972,0.00005974578,0.0006231682,0.005959123],"genre_scores_gemma":[0.46949977,0.0021417637,0.51104414,0.0010346058,0.0006453629,0.0016699736,0.0003273773,0.00009114699,0.013545812],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999,0.00025054565,0.00012310898,0.00014843802,0.00040133856,0.00007659699],"domain_scores_gemma":[0.9989317,0.00024700438,0.00012203964,0.00015618326,0.0004860962,0.000056912733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010022097,0.000611054,0.00048067028,0.00073218934,0.0006656798,0.0012473232,0.0013514683,0.000849607,0.0019442156],"category_scores_gemma":[0.00190172,0.0002887088,0.00037508065,0.00045295144,0.0005563643,0.0012484232,0.0010409326,0.0015133792,0.0007193225],"study_design_candidate":"not_applicable","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.0005363283,0.00034123266,0.0017892363,0.0012336032,0.00027371736,0.0013713867,0.0006987945,0.08919517,0.21802029,0.28537524,0.024770701,0.3763943],"study_design_scores_gemma":[0.00011766365,0.0003493414,0.0005725752,0.000098526034,0.0001337953,0.0013672822,0.00007660098,0.8303264,0.044615198,0.016583811,0.10563275,0.00012605109],"about_ca_topic_score_codex":0.0006123593,"about_ca_topic_score_gemma":0.0006215122,"teacher_disagreement_score":0.0019442156,"about_ca_system_score_codex":0.0007342432,"about_ca_system_score_gemma":0.0010275308,"threshold_uncertainty_score":0.006504059},"labels":[],"label_agreement":null},{"id":"W1567505954","doi":"10.1002/dac.2458","title":"On the Chandra–Poram–Bose symbol error probability expression for coherent orthogonal <i>M</i>‐ary frequency shift keying","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Symbol (formal); Keying; Expression (computer science); Computer science; Telecommunications; Physics","score_opus":0.047678161382621057,"score_gpt":0.3075981607489489,"score_spread":0.25991999936632787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567505954","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.08020055,0.0032376114,0.8821375,0.0019586897,0.00025542607,0.00005170711,0.00015679031,0.0002496179,0.031752102],"genre_scores_gemma":[0.89441544,0.0029803354,0.09352708,0.00054974994,0.00044752588,0.00016963406,0.0001171035,0.00016448759,0.0076286215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990414,0.00029218002,0.000054291133,0.00009721697,0.0004097514,0.00010505949],"domain_scores_gemma":[0.9972568,0.0019035926,0.0002285697,0.00026212743,0.00030423442,0.00004465762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002857443,0.0007171975,0.000675183,0.001022931,0.00041477216,0.0012661526,0.0010817337,0.0010083022,0.0023370874],"category_scores_gemma":[0.01097979,0.00031805868,0.0004597023,0.00093107997,0.0019930871,0.0021377576,0.0015061508,0.0015174118,0.00071405695],"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.00012440408,0.000045711004,0.00083365646,0.00021110485,0.00003376196,0.00046412874,0.00031220884,0.25770065,0.010792742,0.70022637,0.002909099,0.02634623],"study_design_scores_gemma":[0.000012499999,0.00002529885,0.00041629229,0.000057342826,0.0000150562355,0.00020785682,0.00002848066,0.86487967,0.0034223825,0.128942,0.001958665,0.000034388493],"about_ca_topic_score_codex":0.0008797093,"about_ca_topic_score_gemma":0.000511694,"teacher_disagreement_score":0.002857443,"about_ca_system_score_codex":0.00097625924,"about_ca_system_score_gemma":0.0005571513,"threshold_uncertainty_score":0.015111804},"labels":[],"label_agreement":null},{"id":"W1569021749","doi":"10.1002/dac.2544","title":"Adaptive modulation and decision feedback equalization for frequency‐selective MIMO channels","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; MIMO; Rayleigh fading; Fading; Transmitter; Probability density function; Algorithm; Control theory (sociology); Channel (broadcasting); Mean squared error; Telecommunications; Mathematics; Statistics","score_opus":0.02559718649467071,"score_gpt":0.29355845273681586,"score_spread":0.26796126624214517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569021749","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.096249364,0.0010052229,0.8934954,0.00018293266,0.00011003015,0.000052368614,0.000054206663,0.00018157158,0.008668978],"genre_scores_gemma":[0.96097374,0.0003225691,0.03604828,0.00005291737,0.000037753947,0.000027774766,0.000022563805,0.00000637519,0.0025080044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973255,0.00007735455,0.000008937367,0.00003309147,0.00010155494,0.0000465515],"domain_scores_gemma":[0.99958104,0.00022922394,0.000047479247,0.00003215994,0.00010181251,0.000008413538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003288124,0.00025877307,0.0002212598,0.00022887955,0.0002206678,0.00024296214,0.00032810346,0.00034786342,0.0012658245],"category_scores_gemma":[0.0010051611,0.00010512288,0.00019096406,0.0002529776,0.00028978902,0.00026423758,0.00023702274,0.00023398898,0.00018596492],"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.00023808608,0.00006230387,0.0013098213,0.00014263444,0.00006614066,0.0003678892,0.00012136889,0.78434783,0.04495348,0.03798903,0.001390336,0.12901103],"study_design_scores_gemma":[0.0000118851,0.000059303216,0.00045533816,0.000008662929,0.000012030773,0.00009094274,0.000010831088,0.98966473,0.004682644,0.0038601672,0.0011338966,0.000009598814],"about_ca_topic_score_codex":0.0014310695,"about_ca_topic_score_gemma":0.0020467492,"teacher_disagreement_score":0.0014310695,"about_ca_system_score_codex":0.00034207097,"about_ca_system_score_gemma":0.00032912195,"threshold_uncertainty_score":0.004234612},"labels":[],"label_agreement":null},{"id":"W1573373051","doi":"10.1002/dac.2451","title":"Cellular IP address provisioning in a heterogeneous wireless network","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":6,"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 Ottawa","funders":"","keywords":"Computer network; Computer science; Node (physics); Blocking (statistics); Traffic intensity; IP tunnel; Wireless network; Internet Protocol; Wireless; The Internet; Telecommunications","score_opus":0.015621517598421723,"score_gpt":0.25397781486931725,"score_spread":0.23835629727089552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573373051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5283553,0.00056468253,0.4627859,0.00025223102,0.00009159071,0.00009056405,0.00006400962,0.0007893584,0.007006418],"genre_scores_gemma":[0.98466563,0.00009716589,0.014315401,0.00003150627,0.000020775537,0.00001829695,0.000048844802,0.000008522669,0.00079373876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955255,0.00011605907,0.000024794344,0.000071950715,0.00011419285,0.00012049282],"domain_scores_gemma":[0.9992231,0.00019166818,0.00009812222,0.00018696074,0.00020353842,0.000096472824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000630515,0.00031219644,0.0003828857,0.0006323954,0.00081770134,0.0012153579,0.0008583982,0.00039521902,0.00068944466],"category_scores_gemma":[0.001330508,0.00015298145,0.00016286728,0.00069510756,0.00037526595,0.0012018633,0.0011614951,0.0003730267,0.00022344959],"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.000673849,0.00029228197,0.011192849,0.00010374542,0.00010100186,0.0018433336,0.00035142308,0.6039236,0.08092169,0.046872027,0.0042622904,0.24946184],"study_design_scores_gemma":[0.000018498373,0.000115036666,0.0017190637,0.000007662681,0.000046509653,0.00023233634,0.00014058489,0.97502804,0.0099324975,0.007332427,0.005407361,0.000020006186],"about_ca_topic_score_codex":0.0025902328,"about_ca_topic_score_gemma":0.0023583432,"teacher_disagreement_score":0.0025902328,"about_ca_system_score_codex":0.000793006,"about_ca_system_score_gemma":0.00034469872,"threshold_uncertainty_score":0.005753696},"labels":[],"label_agreement":null},{"id":"W1582930193","doi":"10.1002/dac.2902","title":"Energy efficiency and traffic offloading in wireless mesh networks with delay bounds","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Computer science; Quality of service; Efficient energy use; Wireless mesh network; Computer network; Wireless; Wireless network; Integer programming; Bounded function; Bandwidth (computing); Mathematical optimization; Telecommunications; Algorithm","score_opus":0.01017368377834638,"score_gpt":0.2284265357600941,"score_spread":0.21825285198174774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582930193","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.39219648,0.0033520798,0.586936,0.0016537802,0.00012494315,0.000056901776,0.00013031083,0.00010925781,0.015440224],"genre_scores_gemma":[0.9909911,0.0005573519,0.006329384,0.000036882528,0.000044300712,0.000020409962,0.000019419605,0.000020491289,0.0019806959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954176,0.00021165138,0.0000144122905,0.000044995933,0.000082193226,0.00010496405],"domain_scores_gemma":[0.9972307,0.002307946,0.00019587582,0.00006681809,0.00014216565,0.00005645384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012471641,0.0005023887,0.0005538487,0.0005973433,0.00039585205,0.0010843968,0.0006558807,0.0006827107,0.0010370481],"category_scores_gemma":[0.00465055,0.0002462319,0.00039189061,0.0006767455,0.00068884564,0.0013953083,0.0006566563,0.00059451506,0.000078517216],"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.000079169826,0.00003341033,0.00090495223,0.000056204848,0.000024823785,0.00010629585,0.000039340342,0.9471875,0.00288692,0.04191704,0.00038548192,0.0063788462],"study_design_scores_gemma":[0.0000029990251,0.000016324018,0.00017231055,0.0000045440056,0.0000066551197,0.000018274242,0.000014886296,0.9915359,0.00030811416,0.007746946,0.00017041598,0.0000025413296],"about_ca_topic_score_codex":0.0023433997,"about_ca_topic_score_gemma":0.001707304,"teacher_disagreement_score":0.0023433997,"about_ca_system_score_codex":0.0015422726,"about_ca_system_score_gemma":0.0004911674,"threshold_uncertainty_score":0.011189997},"labels":[],"label_agreement":null},{"id":"W1607776211","doi":"10.1002/dac.2595","title":"A partial transmit sequence technique with error correction capability and low computation","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Arctic Goose Joint Venture; National Science Council","keywords":"Computer science; Orthogonal frequency-division multiplexing; Transmission (telecommunications); Algorithm; Modulation (music); Phase-shift keying; Scrambling; Bit error rate; Channel (broadcasting); Electronic engineering; Telecommunications","score_opus":0.019163502968532652,"score_gpt":0.2758266147475451,"score_spread":0.25666311177901246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607776211","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.06392069,0.000687161,0.92801,0.00018106878,0.00009865677,0.000045123285,0.000031906606,0.0009133736,0.006112153],"genre_scores_gemma":[0.65219474,0.00050263084,0.33964145,0.00010284414,0.00007796143,0.000060767572,0.00011209199,0.000069114605,0.0072383606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997254,0.000044307908,0.000014525863,0.000033901655,0.00016772946,0.000014099481],"domain_scores_gemma":[0.9996495,0.00008476449,0.000058063648,0.000073572286,0.00012227664,0.0000118238495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017809834,0.00033310786,0.00032522183,0.0004881209,0.00023411683,0.0002989632,0.0003676989,0.00030834365,0.0016750977],"category_scores_gemma":[0.00069934916,0.00012952964,0.0003154017,0.0004485678,0.0002460925,0.0004101672,0.0002700795,0.00034271154,0.00052404986],"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.00017369175,0.000059114074,0.0010065117,0.00032498484,0.00006379825,0.00026261035,0.00014810696,0.071894646,0.34413528,0.019365786,0.0022249618,0.5603405],"study_design_scores_gemma":[0.000051845378,0.0006180962,0.0016815942,0.000035142686,0.00008642845,0.001951007,0.000032423344,0.7287244,0.24406444,0.0036359034,0.01906982,0.000048828395],"about_ca_topic_score_codex":0.0006582779,"about_ca_topic_score_gemma":0.0006536573,"teacher_disagreement_score":0.0016750977,"about_ca_system_score_codex":0.00020286758,"about_ca_system_score_gemma":0.00045768707,"threshold_uncertainty_score":0.0056037903},"labels":[],"label_agreement":null},{"id":"W1742573363","doi":"10.1002/dac.2576","title":"Optimal power‐aware relay placement for cooperative wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"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 Calgary","funders":"","keywords":"Relay; Computer science; Cooperative diversity; Computer network; Wireless sensor network; Wireless; Wireless network; Power (physics); Hop (telecommunications); Telecommunications","score_opus":0.030317963598766602,"score_gpt":0.3023736404099393,"score_spread":0.2720556768111727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1742573363","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.04656237,0.0004828947,0.9497705,0.0001987561,0.000019977953,0.000036311998,0.000033046188,0.000083230996,0.002812853],"genre_scores_gemma":[0.9507027,0.000553917,0.046978503,0.0000462445,0.000027464781,0.000082117316,0.000032937405,0.000034539706,0.0015416312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945647,0.00028358045,0.00001932395,0.000083124396,0.00010926798,0.00004830188],"domain_scores_gemma":[0.9990062,0.000630186,0.00013901367,0.00007079744,0.00012488564,0.000028977953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012099186,0.00089916063,0.00078875804,0.00040218642,0.0003092861,0.0006986274,0.0006488916,0.0007434602,0.0006336666],"category_scores_gemma":[0.00308511,0.00039448933,0.00037059694,0.00060460187,0.00082783104,0.0009083326,0.0009107743,0.00044678702,0.00019187976],"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.000021318961,0.000011494708,0.00015038846,0.000031559353,0.000013663224,0.000054398777,0.000035798996,0.9838162,0.002340391,0.0072827353,0.00023627137,0.006005771],"study_design_scores_gemma":[0.000005003418,0.000024189472,0.000055301276,0.0000036455774,0.0000054278453,0.000017955339,0.0000124511735,0.99162185,0.0006633312,0.0074098217,0.00017730717,0.0000037080124],"about_ca_topic_score_codex":0.0008840005,"about_ca_topic_score_gemma":0.0008171448,"teacher_disagreement_score":0.0012099186,"about_ca_system_score_codex":0.0008357287,"about_ca_system_score_gemma":0.00051999214,"threshold_uncertainty_score":0.0063987374},"labels":[],"label_agreement":null},{"id":"W1761004645","doi":"10.1002/dac.2568","title":"Hybrid MUSIC Dolph–Chebyshev algorithm for a smart antenna system","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Smart antenna; Computer science; Chebyshev filter; Antenna array; Antenna (radio); Sensor array; Gate array; Beamforming; Field-programmable gate array; Electronic engineering; Algorithm; Computer hardware; Telecommunications; Directional antenna; Engineering","score_opus":0.024975566529892634,"score_gpt":0.2838749265330155,"score_spread":0.25889936000312286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1761004645","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.0041672545,0.00009160662,0.9939427,0.0000483001,0.000018639968,0.000015835958,0.000014234316,0.00018573701,0.0015156515],"genre_scores_gemma":[0.16660249,0.0002559173,0.82769364,0.00011413078,0.000046513866,0.00009629977,0.00011072331,0.000043978554,0.005036308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997017,0.000085929016,0.000013662754,0.00004859274,0.00012297499,0.000027084316],"domain_scores_gemma":[0.9997707,0.00008795975,0.000020501822,0.00003495582,0.000069835514,0.000016059654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035549284,0.0005188949,0.0004256699,0.00032049074,0.0002474791,0.00059825496,0.00051869,0.0006897115,0.00371378],"category_scores_gemma":[0.00086930656,0.00020361131,0.0003169263,0.0003825892,0.0003453449,0.0004885058,0.0005371783,0.0005311683,0.001404088],"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.00029225904,0.000058173744,0.00062953355,0.00013230558,0.00006823132,0.00010781817,0.000111911046,0.36369357,0.061712805,0.0396263,0.0035878003,0.5299792],"study_design_scores_gemma":[0.000017156925,0.000043763845,0.00010823302,0.0000060156667,0.0000048258107,0.000054951084,0.000009512572,0.98992467,0.004119514,0.00267521,0.0030271516,0.000009005198],"about_ca_topic_score_codex":0.0016126788,"about_ca_topic_score_gemma":0.001920949,"teacher_disagreement_score":0.00371378,"about_ca_system_score_codex":0.000403652,"about_ca_system_score_gemma":0.00064937817,"threshold_uncertainty_score":0.012423873},"labels":[],"label_agreement":null},{"id":"W1776285172","doi":"10.1002/dac.2625","title":"Phased arrays in communication system based on Taguchi‐neural networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Taguchi methods; Computer science; Artificial neural network; Antenna (radio); Antenna array; Perceptron; Phased array; Radiation pattern; Multilayer perceptron; Artificial intelligence; Electronic engineering; Machine learning; Telecommunications; Engineering","score_opus":0.012372027108494143,"score_gpt":0.22969508571941963,"score_spread":0.2173230586109255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1776285172","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.039867867,0.00035021055,0.9552784,0.00012012537,0.0000448299,0.000033079305,0.000010854301,0.00028505936,0.0040096585],"genre_scores_gemma":[0.8055663,0.00036431316,0.1901666,0.00006436839,0.000025771737,0.000090617505,0.000020265908,0.000024543415,0.0036772212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974483,0.000095703384,0.000010196936,0.000036074136,0.00009396659,0.000019274286],"domain_scores_gemma":[0.9997832,0.000109818924,0.000027484806,0.000017769013,0.000056234414,0.000005365831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038808,0.00029732933,0.0002991277,0.00015346814,0.00016188998,0.00044889736,0.00036763074,0.00037757237,0.0008001095],"category_scores_gemma":[0.00068198633,0.0002543787,0.00028009934,0.00024025289,0.00029255726,0.00040292687,0.00023165195,0.0003950133,0.00018995345],"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.00006766549,0.00003202867,0.00054288807,0.00006598037,0.000032837088,0.00002895965,0.000057142977,0.8889781,0.02187174,0.006897665,0.00032533842,0.08109968],"study_design_scores_gemma":[0.0000027886833,0.000023529437,0.00009272435,0.0000032522082,0.000005196157,0.000006929111,0.0000030030487,0.9959331,0.0028207095,0.000735505,0.00037018378,0.0000030671538],"about_ca_topic_score_codex":0.0012960389,"about_ca_topic_score_gemma":0.0014257147,"teacher_disagreement_score":0.0012960389,"about_ca_system_score_codex":0.00047943,"about_ca_system_score_gemma":0.00026437468,"threshold_uncertainty_score":0.003478527},"labels":[],"label_agreement":null},{"id":"W1781193354","doi":"10.1002/dac.2732","title":"Performance of fiber delay‐line buffers in asynchronous packet‐based optical switching networks with wavelength conversion","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Computer science; Asynchronous communication; Transmission delay; Processing delay; Network packet; Wavelength; Optical burst switching; Optical fiber; Computer network; Optical switch; Packet switching; Line (geometry); Fast packet switching; Wavelength-division multiplexing; Telecommunications; Optoelectronics; Optical performance monitoring; Materials science","score_opus":0.008417629619209258,"score_gpt":0.22758368944856783,"score_spread":0.21916605982935858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781193354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809443,0.000699397,0.01602361,0.00016132642,0.00006467797,0.000031714535,0.00010835851,0.00026246716,0.0017041238],"genre_scores_gemma":[0.9985386,0.00006979583,0.0010758678,0.000016393591,0.0000061842484,0.000007857401,0.000028040873,0.000006022686,0.0002511058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988519,0.00033081448,0.00006821497,0.00018766605,0.00027462727,0.00028675483],"domain_scores_gemma":[0.9905433,0.0065914523,0.0010171612,0.00030406594,0.0011840622,0.00036001153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023619249,0.0007520574,0.00051473774,0.0009649723,0.0008992433,0.0016888364,0.0013219859,0.000710753,0.0013356718],"category_scores_gemma":[0.0054746876,0.00031223428,0.0002484882,0.00079350034,0.0007214824,0.0018031072,0.0005309871,0.0004939039,0.00013481731],"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.0037427638,0.0007236468,0.010058824,0.00017386397,0.00012932603,0.0002308848,0.00023231604,0.9114963,0.032205187,0.009884223,0.0013694972,0.02975314],"study_design_scores_gemma":[0.00003313852,0.0003489605,0.00051890407,0.0000098177525,0.000025292937,0.000022269547,0.000035173918,0.9868535,0.011316715,0.0007135664,0.00010880054,0.000013793719],"about_ca_topic_score_codex":0.006346922,"about_ca_topic_score_gemma":0.0033158707,"teacher_disagreement_score":0.006346922,"about_ca_system_score_codex":0.003771672,"about_ca_system_score_gemma":0.0009818512,"threshold_uncertainty_score":0.027365565},"labels":[],"label_agreement":null},{"id":"W1797213545","doi":"","title":"Adaptive AQM controllers for IP routers with a heuristic monitor on TCP flows: Research Articles","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"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 Ottawa","funders":"","keywords":"Active queue management; Computer science; Queue; Control theory (sociology); Phase margin; Robustness (evolution); Network packet; PID controller; Network congestion; Heuristic; Random early detection; Transmission Control Protocol; Controller (irrigation); Adaptive control; Real-time computing; Computer network; Bandwidth (computing); Control engineering; Control (management); Amplifier","score_opus":0.04531718324307592,"score_gpt":0.3152158434198172,"score_spread":0.26989866017674125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797213545","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.06322492,0.0021691232,0.9290387,0.000349135,0.00018287878,0.0000823329,0.000017531775,0.0006620965,0.0042733755],"genre_scores_gemma":[0.92026323,0.0006589638,0.07691609,0.00010424853,0.00016061324,0.00005387397,0.00002090392,0.000018700966,0.001803365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997967,0.000048893577,0.0000127227,0.000045332166,0.00007253364,0.000023717103],"domain_scores_gemma":[0.99951124,0.00020494558,0.00006678554,0.00003559264,0.00016140963,0.000019927522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005478755,0.0004155102,0.00031082792,0.0003793983,0.00023970653,0.00058713014,0.000922635,0.00043246243,0.0007916937],"category_scores_gemma":[0.0014369662,0.00013888396,0.00021934144,0.00026026857,0.00055769854,0.0005208466,0.00025471288,0.00053675735,0.00013818305],"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.00030705018,0.0002826092,0.0024098903,0.00031838578,0.000088223955,0.00024233294,0.0001897437,0.45811576,0.040655497,0.029665234,0.0031048628,0.46462044],"study_design_scores_gemma":[0.00003953896,0.000110626424,0.00028823878,0.0000073277897,0.000019222342,0.00003249286,0.000008076388,0.9914449,0.0038564855,0.0028210185,0.0013628792,0.000009222488],"about_ca_topic_score_codex":0.0020226797,"about_ca_topic_score_gemma":0.0012837675,"teacher_disagreement_score":0.0020226797,"about_ca_system_score_codex":0.0003877052,"about_ca_system_score_gemma":0.00042233613,"threshold_uncertainty_score":0.0040218234},"labels":[],"label_agreement":null},{"id":"W1811925492","doi":"10.1002/dac.2587","title":"Design and performance of an efficient rectenna incorporating a fractal structure","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rectenna; Fractal antenna; HFSS; Fractal; Antenna (radio); Rectifier (neural networks); Energy harvesting; Computer science; Return loss; Patch antenna; Topology (electrical circuits); Electrical engineering; Electronic engineering; Telecommunications; Power (physics); Microstrip antenna; Physics; Antenna efficiency; Mathematics; Engineering; Mathematical analysis","score_opus":0.01265279160354151,"score_gpt":0.22957427867210425,"score_spread":0.21692148706856273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1811925492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74884987,0.0011020713,0.2327795,0.00028553634,0.00014511889,0.0000773105,0.00020434172,0.00075404026,0.015802091],"genre_scores_gemma":[0.9453037,0.00018526686,0.052103058,0.000045187775,0.000017322649,0.000031566735,0.000077775,0.000022903021,0.002213188],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998723,0.000018031826,0.000010160599,0.00003742711,0.000044292534,0.000017752707],"domain_scores_gemma":[0.99978477,0.000035491426,0.0000643248,0.00005374487,0.000046531117,0.000015220945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016214086,0.00023273987,0.00028502836,0.00013365455,0.000122157,0.00029259073,0.00038497022,0.00048193883,0.00065568887],"category_scores_gemma":[0.00024591587,0.00015468635,0.00026012168,0.0001523414,0.00018189823,0.00029442948,0.00018641267,0.00015806833,0.00046284552],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00023727544,0.000037967653,0.0007318062,0.0001651736,0.00005300383,0.00025040735,0.00010159178,0.03079701,0.94189423,0.0036858814,0.0006036276,0.021442113],"study_design_scores_gemma":[0.000098285105,0.001551135,0.0044391328,0.000047516245,0.00010240445,0.0013179567,0.000046958725,0.33090353,0.6354243,0.0015393179,0.024440028,0.00008935401],"about_ca_topic_score_codex":0.00014635507,"about_ca_topic_score_gemma":0.00014290922,"teacher_disagreement_score":0.00065568887,"about_ca_system_score_codex":0.00027583528,"about_ca_system_score_gemma":0.0001354855,"threshold_uncertainty_score":0.002193451},"labels":[],"label_agreement":null},{"id":"W1894410978","doi":"10.1002/dac.2931","title":"QoS‐aware energy‐efficient resource allocation in OFDM‐based heterogenous cellular networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":21,"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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Fractional programming; Quality of service; Telecommunications link; Scheduling (production processes); Subgradient method; Efficient energy use; Iterative method; Nonlinear programming; Computer network; Nonlinear system; Algorithm; Mathematics","score_opus":0.01921073358640745,"score_gpt":0.24242436289719974,"score_spread":0.22321362931079228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894410978","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.20609088,0.0008230631,0.78387475,0.0002775423,0.000045463243,0.000023278446,0.000050085553,0.00010601899,0.008708937],"genre_scores_gemma":[0.98034465,0.00020296613,0.018641321,0.00003217178,0.00001722092,0.000013472057,0.000015796506,0.0000065672966,0.0007260045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998254,0.00006455369,0.0000041099142,0.000027427834,0.000041800726,0.00003675697],"domain_scores_gemma":[0.99975234,0.00014393177,0.000036614758,0.000018166913,0.00003435881,0.000014604402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036389715,0.00026531858,0.00030195634,0.00024446577,0.0003478223,0.0004531248,0.00042308966,0.00032614835,0.00045521758],"category_scores_gemma":[0.0006985332,0.00013107003,0.00014937876,0.0004522749,0.0004614156,0.00035158405,0.00040383096,0.0002862315,0.00008184553],"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.000026072945,0.000017236385,0.00049731793,0.00001597124,0.000012707944,0.00008035705,0.000023748426,0.97552687,0.003344158,0.005847539,0.0003920653,0.014215952],"study_design_scores_gemma":[0.0000018306738,0.000005408163,0.00011015246,9.831514e-7,0.0000020073946,0.000010524217,0.000007347578,0.99784374,0.0003175271,0.0015318671,0.00016690778,0.0000016509387],"about_ca_topic_score_codex":0.0031732873,"about_ca_topic_score_gemma":0.003672179,"teacher_disagreement_score":0.0031732873,"about_ca_system_score_codex":0.00048637588,"about_ca_system_score_gemma":0.00042526223,"threshold_uncertainty_score":0.0063096285},"labels":[],"label_agreement":null},{"id":"W1914281590","doi":"10.1002/dac.2940","title":"A novel energy‐efficient cross‐application‐layer platform with QoS‐security support","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quality of service; Layer (electronics); Computer network; Energy (signal processing); Efficient energy use; Chemistry","score_opus":0.03488672699328982,"score_gpt":0.2949185769487648,"score_spread":0.26003184995547496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914281590","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.22677173,0.0010106867,0.74427176,0.00092239166,0.0006085332,0.00031497527,0.00010707438,0.005075567,0.020917226],"genre_scores_gemma":[0.8555707,0.00024031091,0.13395585,0.00033868948,0.00008720509,0.000112987655,0.00009823899,0.00009036358,0.009505642],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995129,0.000054947595,0.00003609047,0.00009747922,0.00018427506,0.000114188],"domain_scores_gemma":[0.9996207,0.000040572577,0.000060687897,0.00009540819,0.00010925301,0.00007343558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000449911,0.00039031668,0.00038417027,0.00038403773,0.00044574798,0.0010161893,0.0017255988,0.00059399736,0.0027475515],"category_scores_gemma":[0.00053977384,0.00023196844,0.00028483142,0.0002566438,0.0003002695,0.0013385721,0.0016862506,0.00090018765,0.0010301743],"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.000713989,0.0006594194,0.001996194,0.00029822218,0.00013910253,0.0014199462,0.00022230002,0.04719589,0.7286607,0.06346605,0.009491009,0.14573722],"study_design_scores_gemma":[0.00011352966,0.0007706078,0.0010931632,0.00003192122,0.0000833381,0.0010410813,0.00006773078,0.77161354,0.17916122,0.008157529,0.037782073,0.00008421398],"about_ca_topic_score_codex":0.000349946,"about_ca_topic_score_gemma":0.00043040505,"teacher_disagreement_score":0.0027475515,"about_ca_system_score_codex":0.0003241134,"about_ca_system_score_gemma":0.00058235414,"threshold_uncertainty_score":0.009191513},"labels":[],"label_agreement":null},{"id":"W1917825521","doi":"10.1002/dac.2524","title":"Green cell association for multimedia transmission in cognitive heterogeneous networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"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 British Columbia","funders":"","keywords":"Computer science; Energy consumption; Heterogeneous network; Throughput; Computer network; Transmission (telecommunications); Macro; Efficient energy use; Cognitive radio; Wireless network; Wireless; Multimedia; Telecommunications","score_opus":0.01270208515496697,"score_gpt":0.25900864935488555,"score_spread":0.2463065641999186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917825521","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.058528215,0.00086069305,0.9344251,0.00015408061,0.000089454654,0.000021901473,0.000018827495,0.00022841369,0.005673325],"genre_scores_gemma":[0.96463656,0.00034778065,0.03247125,0.0000935681,0.000046024154,0.000019929343,0.000025522686,0.00001866886,0.002340689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969566,0.00006961297,0.0000076034503,0.000042187345,0.000114342925,0.00007060687],"domain_scores_gemma":[0.99965,0.00013063729,0.00005194733,0.000053546602,0.000083905084,0.000029927323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051982515,0.0003725196,0.00036989877,0.000400411,0.00040833672,0.0005911624,0.0008238523,0.00034591823,0.00082280766],"category_scores_gemma":[0.00086654397,0.00011948106,0.00029255808,0.00040408896,0.00043413258,0.00048612797,0.0008843758,0.0004996739,0.00018364478],"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.00021196295,0.00014361976,0.0013650716,0.00010452717,0.00007481513,0.00045349615,0.00021692207,0.68488264,0.04409871,0.07091591,0.0036221354,0.1939102],"study_design_scores_gemma":[0.0000026678647,0.000022504477,0.00013686133,0.0000032476225,0.00000917268,0.00004834887,0.000018528739,0.9889685,0.002923792,0.0070607574,0.0007987015,0.0000069239354],"about_ca_topic_score_codex":0.002713509,"about_ca_topic_score_gemma":0.0026345493,"teacher_disagreement_score":0.002713509,"about_ca_system_score_codex":0.00067933346,"about_ca_system_score_gemma":0.00052234257,"threshold_uncertainty_score":0.0053954124},"labels":[],"label_agreement":null},{"id":"W1942242957","doi":"10.1002/dac.2329","title":"Performance analysis of decision directed maximum likelihood MIMO channel tracking algorithm","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":14,"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 Saskatchewan","funders":"","keywords":"Channel (broadcasting); Computer science; Algorithm; MIMO; Tracking (education); Mode (computer interface); Doppler effect; Bit error rate; Word error rate; Telecommunications; Speech recognition","score_opus":0.015813951116228624,"score_gpt":0.2699696193771431,"score_spread":0.25415566826091446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942242957","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.034025658,0.0005387303,0.9598794,0.00023191725,0.000039290782,0.000043519394,0.000068312474,0.0005765188,0.0045965496],"genre_scores_gemma":[0.8443541,0.00045803894,0.1516746,0.00021908477,0.000041203064,0.00010266064,0.00028148218,0.000107785854,0.0027610299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739563,0.0010384163,0.00011536143,0.0002725595,0.0009445028,0.00023357404],"domain_scores_gemma":[0.9924906,0.004949677,0.00046794,0.0005702255,0.001381528,0.00013995705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026126103,0.00070979726,0.0006902086,0.0006633824,0.00051663385,0.0014869884,0.0007402368,0.0009593839,0.0027141708],"category_scores_gemma":[0.013209508,0.00030323866,0.00036609278,0.0007078821,0.00070579455,0.0011984999,0.0013483693,0.0007779533,0.00085676555],"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.00063028175,0.00006124793,0.00251046,0.00013147095,0.000079375925,0.00009411616,0.0001274185,0.8683174,0.008361132,0.015614351,0.0015247307,0.10254804],"study_design_scores_gemma":[0.000011989856,0.000048446283,0.00029290724,0.000009258364,0.00000833316,0.000055900087,0.000012029174,0.9940269,0.0032693073,0.0019882221,0.00026470647,0.0000121211615],"about_ca_topic_score_codex":0.0019228598,"about_ca_topic_score_gemma":0.0010884259,"teacher_disagreement_score":0.0027141708,"about_ca_system_score_codex":0.0009099919,"about_ca_system_score_gemma":0.0016770773,"threshold_uncertainty_score":0.013816953},"labels":[],"label_agreement":null},{"id":"W1957547884","doi":"10.1002/dac.2534","title":"Weakness of remote authentication scheme of Chen <i>et al</i>.","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Computer science; Replay attack; Computer security; Denial-of-service attack; Password; Chen; Challenge–response authentication; Scheme (mathematics); Authentication (law); Mobile device; Computer network; Authentication protocol; World Wide Web; The Internet","score_opus":0.0225915485572116,"score_gpt":0.29938441359695456,"score_spread":0.276792865039743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957547884","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.23219115,0.024410466,0.5382169,0.028965091,0.007814696,0.0022522332,0.0013997616,0.0071351766,0.15761453],"genre_scores_gemma":[0.88436246,0.0035126365,0.072747916,0.0031607305,0.00070084125,0.00042059156,0.0013331643,0.00017949706,0.03358217],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957547,0.0009358491,0.000549879,0.00055630086,0.0018005756,0.0004026561],"domain_scores_gemma":[0.9927649,0.0010092028,0.00071539887,0.002494888,0.0027551916,0.0002603698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00211813,0.00059093034,0.0007593373,0.0010660934,0.0013815699,0.0010146657,0.0020543076,0.0020945708,0.0070674517],"category_scores_gemma":[0.006179637,0.00031984085,0.0009853195,0.0009792807,0.0008971927,0.0031982681,0.0021300602,0.0017536466,0.0052868603],"study_design_candidate":"theoretical_or_conceptual","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.0022617772,0.00030360307,0.010809211,0.0039762924,0.00063810864,0.0021678887,0.002219614,0.008874639,0.13882597,0.15613557,0.10354599,0.5702413],"study_design_scores_gemma":[0.00067232316,0.0019807876,0.010623329,0.0008970851,0.0010881871,0.020937493,0.000982573,0.123653665,0.35884622,0.05463984,0.42480186,0.0008766531],"about_ca_topic_score_codex":0.0015421506,"about_ca_topic_score_gemma":0.0005303662,"teacher_disagreement_score":0.0070674517,"about_ca_system_score_codex":0.0008769267,"about_ca_system_score_gemma":0.001452584,"threshold_uncertainty_score":0.023642957},"labels":[],"label_agreement":null},{"id":"W1968098382","doi":"10.1002/dac.1386","title":"Ubiquitous computing for communications and broadcasting","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"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; Ubiquitous computing; Broadcasting (networking); Presentation (obstetrics); Focus (optics); Wireless sensor network; Quality (philosophy); Data science; Multimedia; Telecommunications; Human–computer interaction; Computer security; Computer network","score_opus":0.02736784115071575,"score_gpt":0.30153684783958573,"score_spread":0.27416900668887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968098382","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.004221194,0.21902043,0.39874706,0.04252321,0.045738406,0.00041500095,0.0011768315,0.0030181524,0.28513965],"genre_scores_gemma":[0.16781,0.25667343,0.19590208,0.018383065,0.04078449,0.00089915236,0.0030005036,0.0014765756,0.31507075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965904,0.0010209254,0.0002591314,0.00048095192,0.0013712998,0.0002772864],"domain_scores_gemma":[0.9967982,0.0013314047,0.00020743813,0.00050339056,0.000943121,0.00021645614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014358521,0.0009896462,0.0009795214,0.0015675722,0.0012191869,0.0066608684,0.0014610738,0.0029294214,0.022970516],"category_scores_gemma":[0.007815737,0.00033383272,0.000653217,0.0022568668,0.0021366247,0.0045057572,0.003125716,0.0033335069,0.007951137],"study_design_candidate":"not_applicable","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.00006708747,0.000016106767,0.00024728908,0.000866026,0.000043600812,0.00023993236,0.0004118041,0.0012673353,0.0017713897,0.5207736,0.19847956,0.27581626],"study_design_scores_gemma":[0.000007545795,0.000033917,0.00020967069,0.00038222744,0.000016531447,0.00043955466,0.00014315832,0.0033642177,0.000605772,0.08090791,0.91386074,0.000028748604],"about_ca_topic_score_codex":0.0015415678,"about_ca_topic_score_gemma":0.0010031755,"teacher_disagreement_score":0.022970516,"about_ca_system_score_codex":0.001669502,"about_ca_system_score_gemma":0.0017126447,"threshold_uncertainty_score":0.076844096},"labels":[],"label_agreement":null},{"id":"W1978258815","doi":"10.1002/dac.684","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Mathematical optimization; Path (computing); Average path length; Convergence (economics); Routing (electronic design automation); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","score_opus":0.026305594186888707,"score_gpt":0.273776655301145,"score_spread":0.24747106111425626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978258815","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.0060485816,0.00011768236,0.9928088,0.00009074608,0.000035024183,0.000029206145,0.000021753149,0.0003270785,0.0005210947],"genre_scores_gemma":[0.23049861,0.00031337005,0.7658866,0.00017883995,0.00009290145,0.00023217424,0.00021992906,0.00012964387,0.002447947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943966,0.000158546,0.00002943931,0.0001140275,0.0002015795,0.000056682533],"domain_scores_gemma":[0.9993266,0.0003204353,0.00008598611,0.00007800253,0.00014077139,0.000048118884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095565314,0.0006432373,0.00087002164,0.00072498916,0.00047890877,0.0009321443,0.0016186436,0.0013087335,0.0014227418],"category_scores_gemma":[0.0028952758,0.0003545124,0.0005115043,0.0009647309,0.00086141395,0.0014585146,0.0015812335,0.0012256154,0.0004832324],"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.00012964898,0.00004318442,0.00045447296,0.00007740388,0.000056031065,0.0000716058,0.000096121454,0.75510746,0.0056623924,0.023808833,0.003448136,0.21104468],"study_design_scores_gemma":[0.000014738596,0.000024935496,0.00003581423,0.0000028833292,0.0000035822818,0.000018436464,0.000005211886,0.9938698,0.0004174968,0.0046413206,0.0009619869,0.0000039288702],"about_ca_topic_score_codex":0.0031574504,"about_ca_topic_score_gemma":0.0022884726,"teacher_disagreement_score":0.0031574504,"about_ca_system_score_codex":0.0005803704,"about_ca_system_score_gemma":0.0011979418,"threshold_uncertainty_score":0.0062780976},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W1978464445","doi":"10.1002/dac.780","title":"QoS‐aware call admission control in wideband CDMA wireless networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","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":"University of Alberta; University of Guelph; Queen's University","funders":"","keywords":"UMTS frequency bands; Computer science; Quality of service; Computer network; Call Admission Control; Throughput; Telecommunications link; Power control; Radio resource management; Air interface; Wideband; Wireless; Cellular network; Admission control; Wireless network; Code division multiple access; Power (physics); Telecommunications; Base station; Engineering; Electronic engineering","score_opus":0.014655357905685765,"score_gpt":0.2895514103984769,"score_spread":0.27489605249279114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978464445","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.20026563,0.001567795,0.79081625,0.00050186977,0.00017433638,0.00009295068,0.000038609578,0.0017392181,0.004803212],"genre_scores_gemma":[0.9691245,0.00018441997,0.02952553,0.000068864356,0.000075374344,0.000033185446,0.00001783112,0.00001682703,0.0009535564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998958,0.00029633616,0.00004317873,0.00014633473,0.00037240962,0.00018365953],"domain_scores_gemma":[0.9983462,0.00084088807,0.00018072952,0.00013387558,0.0003641549,0.00013405904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541626,0.00047839116,0.0004979999,0.00058556674,0.0007560163,0.0012371012,0.0008003959,0.0005679119,0.0007030757],"category_scores_gemma":[0.0036447207,0.0002157967,0.00014441524,0.0005201939,0.00084516365,0.00079311855,0.00081031007,0.00096142356,0.00015082721],"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.00079673267,0.00029642292,0.0038720283,0.00013598315,0.000077186814,0.00039405708,0.00046721683,0.59470874,0.073140666,0.038225353,0.0031467061,0.2847389],"study_design_scores_gemma":[0.000019252058,0.000029540255,0.0003582932,0.0000054575335,0.000013212517,0.000045801866,0.000022901402,0.9886198,0.0053829164,0.0045393417,0.00094937714,0.000014097391],"about_ca_topic_score_codex":0.0064465967,"about_ca_topic_score_gemma":0.004187078,"teacher_disagreement_score":0.0064465967,"about_ca_system_score_codex":0.001220326,"about_ca_system_score_gemma":0.0009662948,"threshold_uncertainty_score":0.012818158},"labels":[],"label_agreement":null},{"id":"W1985796607","doi":"10.1002/dac.1177","title":"Some analysis of call blocking probabilities in hierarchical WDM networks offering multiclass service","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Blocking (statistics); Traverse; Call blocking; Computer network; Hierarchy; Node (physics); Wavelength-division multiplexing; Distributed computing; Routing (electronic design automation); Service (business); Telecommunications network; Hierarchical routing; Hierarchical network model; Network topology; Quality of service; Routing protocol; Static routing; Wavelength","score_opus":0.012559981146186706,"score_gpt":0.2610185668456628,"score_spread":0.24845858569947613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985796607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6235432,0.0005143917,0.36995283,0.00029148455,0.00001896284,0.000056668163,0.00012285689,0.00029005815,0.0052094753],"genre_scores_gemma":[0.9860277,0.00015077008,0.013170871,0.00002109215,0.000011283981,0.00002960394,0.000055706358,0.000023406898,0.00050958863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991598,0.00031987624,0.000022734368,0.00007117678,0.00026484477,0.000161539],"domain_scores_gemma":[0.9886573,0.009220019,0.0009554074,0.0003510595,0.0006065409,0.00020975589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034372546,0.00044865353,0.00041498514,0.00084488554,0.0006121566,0.00081884407,0.0011622062,0.00064528047,0.0012979568],"category_scores_gemma":[0.013952399,0.0005206815,0.0003527475,0.0007642384,0.000991683,0.0010191683,0.00060905557,0.0008116238,0.00013249856],"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.000069797105,0.000023910503,0.0017672989,0.000021123233,0.000011493377,0.000035293717,0.000048624617,0.9766485,0.00097000867,0.016479151,0.00021757881,0.003707176],"study_design_scores_gemma":[0.0000016712344,0.0000044454055,0.00021900667,0.0000014609401,0.0000020216924,0.000005797548,0.000005463048,0.9982768,0.00018208486,0.0012698158,0.000029407864,0.000002063008],"about_ca_topic_score_codex":0.0110813845,"about_ca_topic_score_gemma":0.0048266193,"teacher_disagreement_score":0.0110813845,"about_ca_system_score_codex":0.0028115446,"about_ca_system_score_gemma":0.0009690943,"threshold_uncertainty_score":0.02203381},"labels":[],"label_agreement":null},{"id":"W1991640524","doi":"10.1002/dac.1209","title":"On the design of algorithms for mobile multimedia systems: A survey","year":2011,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Computer network; Wireless broadband; WiMAX; Multimedia; Quality of service; The Internet; Wireless; Multicast; Bandwidth (computing); IMT Advanced; Mobile broadband; IP Multimedia Subsystem; Mobile QoS; Telecommunications; Multimedia Broadcast Multicast Service; Broadband networks; Wireless network; Internet access; Broadband; Service provider; Service (business); Mobile computing; Mobile technology; Mobile Web; World Wide Web","score_opus":0.08563129976662025,"score_gpt":0.29289976787738947,"score_spread":0.2072684681107692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991640524","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002000916,0.08821484,0.89176077,0.0012698672,0.00065699173,0.00011343028,0.0000868028,0.0005000046,0.015396337],"genre_scores_gemma":[0.13197674,0.23423798,0.6085951,0.0013305283,0.0041504353,0.0009666912,0.0007667725,0.0007361384,0.01723961],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977622,0.0008893253,0.00019121064,0.0002375297,0.0008015863,0.00011814765],"domain_scores_gemma":[0.9967866,0.002136829,0.00013593254,0.0003195078,0.000554797,0.000066341425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025942766,0.0018670266,0.0017262626,0.0018518833,0.0006421091,0.0029699549,0.0023504829,0.0023706001,0.006720907],"category_scores_gemma":[0.008247994,0.0010016904,0.0010044996,0.0035768661,0.0013448372,0.0040710773,0.001861396,0.002372035,0.0035389522],"study_design_candidate":"not_applicable","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.00014657437,0.00016876963,0.0010419459,0.0021369567,0.00011956847,0.0001467138,0.00020837726,0.11942577,0.0020289542,0.1858807,0.023914915,0.66478086],"study_design_scores_gemma":[0.0000874183,0.00021031687,0.00044536864,0.0008877839,0.00007169018,0.0005119661,0.00011602932,0.5939688,0.0018397485,0.22411604,0.17768764,0.00005713073],"about_ca_topic_score_codex":0.0009605121,"about_ca_topic_score_gemma":0.00061275694,"teacher_disagreement_score":0.006720907,"about_ca_system_score_codex":0.0010560186,"about_ca_system_score_gemma":0.0010838546,"threshold_uncertainty_score":0.022483647},"labels":[],"label_agreement":null},{"id":"W1993274576","doi":"10.1002/dac.496","title":"A simple, scalable and provably stable explicit rate computation scheme for flow control in communication networks","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Scalability; Computation; Controller (irrigation); Simple (philosophy); Flow control (data); Process (computing); Scheme (mathematics); Control (management); Algorithm; Control theory (sociology); Computer network; Mathematics","score_opus":0.016489986643166404,"score_gpt":0.2715358232506895,"score_spread":0.25504583660752306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993274576","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.023534924,0.00025259852,0.9735144,0.000088006724,0.000080018704,0.00011487385,0.000015949148,0.0011482923,0.0012510063],"genre_scores_gemma":[0.67570096,0.00019581086,0.32101452,0.000099066165,0.00009864071,0.0001689153,0.000053372256,0.00009511205,0.0025734545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.00021528204,0.00006155869,0.00013293837,0.0004162218,0.000086106615],"domain_scores_gemma":[0.9981184,0.0008030583,0.00021890907,0.00046465857,0.0003225033,0.00007252156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015265028,0.00052083516,0.0005444833,0.0005173553,0.000537738,0.0010713908,0.0013295619,0.0006545241,0.0013994958],"category_scores_gemma":[0.004731606,0.0002581565,0.00028501643,0.00031920846,0.00108657,0.0013719127,0.0009736935,0.0010305037,0.0002820615],"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.0005875383,0.0002649642,0.0008730742,0.00023145195,0.00006064458,0.00025681165,0.00031541547,0.36633638,0.12723842,0.1575145,0.0036010244,0.3427197],"study_design_scores_gemma":[0.00007968268,0.00013341602,0.000120918165,0.000012024516,0.000012414559,0.000074158255,0.000007200567,0.97043633,0.016639654,0.009908096,0.0025539598,0.000022182712],"about_ca_topic_score_codex":0.0011194673,"about_ca_topic_score_gemma":0.0009777388,"teacher_disagreement_score":0.0015265028,"about_ca_system_score_codex":0.00066398043,"about_ca_system_score_gemma":0.00093879516,"threshold_uncertainty_score":0.008073032},"labels":[],"label_agreement":null},{"id":"W1995096481","doi":"10.1002/dac.765","title":"Performance analysis of hierarchical cellular networks with queueing and user retrials","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":19,"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 Calgary","funders":"","keywords":"Macrocell; Computer science; Computer network; Queueing theory; Handover; Call blocking; Cellular network; Blocking (statistics); Layered queueing network; Wireless network; Wireless; Distributed computing; Telecommunications; Base station","score_opus":0.020661872383966773,"score_gpt":0.28864006047571217,"score_spread":0.2679781880917454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995096481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8268839,0.00058758917,0.1666466,0.00026325067,0.00003055924,0.00006318763,0.00013491434,0.00035382214,0.005036215],"genre_scores_gemma":[0.9972036,0.000055312707,0.002378984,0.000013681902,0.000005568524,0.000008938511,0.000023605626,0.000004562994,0.00030576473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894553,0.0003646151,0.000030586227,0.00010710835,0.00026559777,0.00028665428],"domain_scores_gemma":[0.9948114,0.0030934713,0.0006334514,0.00033026087,0.0008657643,0.00026578386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017416544,0.000629356,0.00043516347,0.0006313373,0.0005440338,0.0007415017,0.0008133868,0.00059993623,0.001056407],"category_scores_gemma":[0.005867864,0.00027283476,0.00030637917,0.0006368752,0.0009489517,0.00059909973,0.00082216854,0.00047885173,0.00014000619],"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.00009382161,0.000025075457,0.0017665063,0.000018226263,0.000014577688,0.000051767034,0.000042793443,0.98696727,0.00277089,0.004582834,0.00017441393,0.003491865],"study_design_scores_gemma":[0.000002536562,0.0000230401,0.00027756373,0.0000011632891,0.000004041171,0.000006844806,0.00000933616,0.99877423,0.0002707549,0.00059948047,0.000028050084,0.0000028778175],"about_ca_topic_score_codex":0.024372052,"about_ca_topic_score_gemma":0.009865634,"teacher_disagreement_score":0.024372052,"about_ca_system_score_codex":0.0029152927,"about_ca_system_score_gemma":0.0011556393,"threshold_uncertainty_score":0.048460364},"labels":[],"label_agreement":null},{"id":"W1999918378","doi":"10.1002/dac.1193","title":"Efficient temporal error concealment algorithm for H.264/AVC inter frame decoding","year":2011,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Macroblock; Decoding methods; Video quality; Algorithm; Computer vision; Artificial intelligence; Motion vector; Scalable Video Coding; Real-time computing; Motion compensation; Metric (unit)","score_opus":0.08468943353476521,"score_gpt":0.33109809838306625,"score_spread":0.24640866484830104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999918378","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.010565588,0.00029212804,0.9878925,0.000059251353,0.00004534492,0.00004636556,0.00003888805,0.00035893492,0.0007010211],"genre_scores_gemma":[0.21910408,0.00061407976,0.7751486,0.00005543351,0.000057952824,0.00011681966,0.00040776806,0.000067826244,0.004427425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994671,0.000078036115,0.000051067735,0.00006078444,0.00030308167,0.00003991758],"domain_scores_gemma":[0.99940455,0.00010160744,0.00006347901,0.00006360548,0.00035316838,0.000013629183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251882,0.00055790454,0.0003833033,0.0008344658,0.00033098317,0.0004912005,0.0006045463,0.00053888373,0.0016858395],"category_scores_gemma":[0.0016393876,0.0001868702,0.00038033805,0.00058905885,0.00021055376,0.000713863,0.00044761656,0.0006579354,0.00077059784],"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.0007566018,0.000115724426,0.0012309013,0.00017791917,0.000056076817,0.00019120864,0.00014742225,0.18325324,0.1259853,0.014259933,0.003918207,0.6699074],"study_design_scores_gemma":[0.000034439585,0.000081272075,0.0005219241,0.00001636015,0.000018405934,0.00016632999,0.000013865228,0.95046335,0.044526257,0.0011468137,0.0029948654,0.00001599306],"about_ca_topic_score_codex":0.0044298917,"about_ca_topic_score_gemma":0.0037156225,"teacher_disagreement_score":0.0044298917,"about_ca_system_score_codex":0.0004715702,"about_ca_system_score_gemma":0.0010517793,"threshold_uncertainty_score":0.008808196},"labels":[],"label_agreement":null},{"id":"W2003408990","doi":"10.1002/dac.573","title":"Using TCP rate control for queue input‐output rate matching","year":2002,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; TCP global synchronization; TCP Friendly Rate Control; Computer network; TCP Westwood plus; TCP acceleration; TCP tuning; CUBIC TCP; Network packet; Zeta-TCP; TCP delayed acknowledgment; Compound TCP; Network congestion; Window (computing); Real-time computing; Operating system","score_opus":0.053926145972896015,"score_gpt":0.2961115202070626,"score_spread":0.24218537423416658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003408990","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.1141295,0.0015267788,0.87252855,0.0004306759,0.00043410916,0.00025654992,0.000058911395,0.004791427,0.005843614],"genre_scores_gemma":[0.9480204,0.0002311172,0.05026141,0.00009252339,0.00010515797,0.00006494152,0.000038002425,0.00008246847,0.0011040142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968827,0.0010372326,0.00022363066,0.00032867942,0.0012729417,0.00025484143],"domain_scores_gemma":[0.9933335,0.002860422,0.00096677773,0.0009671184,0.0016740966,0.0001980463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004761765,0.0008508506,0.0007589245,0.0012008167,0.0005419855,0.0026847827,0.0022180565,0.0009343637,0.0012197695],"category_scores_gemma":[0.016490703,0.00035263825,0.0003729076,0.0008299011,0.00082043884,0.0019191405,0.0010107476,0.0011515921,0.0003583063],"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.0014666351,0.000793984,0.0075272573,0.00026307433,0.00024232377,0.00031559364,0.00030457904,0.47749987,0.06263848,0.037466373,0.0038194116,0.40766242],"study_design_scores_gemma":[0.00006107877,0.00013615415,0.00039874535,0.0000131654315,0.000049491922,0.00005974125,0.0000072353446,0.9775704,0.015478586,0.0046046586,0.0015915399,0.000029194638],"about_ca_topic_score_codex":0.0026467799,"about_ca_topic_score_gemma":0.0011937955,"teacher_disagreement_score":0.004761765,"about_ca_system_score_codex":0.0012511428,"about_ca_system_score_gemma":0.0008870748,"threshold_uncertainty_score":0.025182962},"labels":[],"label_agreement":null},{"id":"W2006885019","doi":"10.1002/dac.1166","title":"Distributed BLAST with relay selection for multi‐antenna AF relaying","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Relay; Computer science; Transmission (telecommunications); Selection (genetic algorithm); Antenna (radio); Outage probability; Computer network; Multiplexing; Scheme (mathematics); Telecommunications; Electronic engineering; Fading; Mathematics; Channel (broadcasting); Engineering; Power (physics)","score_opus":0.04487768823135036,"score_gpt":0.32018601430935484,"score_spread":0.2753083260780045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006885019","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.09359843,0.0007699182,0.90029013,0.00026732314,0.000044352782,0.0000518634,0.00004027467,0.00015737388,0.004780419],"genre_scores_gemma":[0.8959026,0.00028725364,0.10202598,0.000049508526,0.000035756093,0.000046869885,0.000025349886,0.000007016018,0.0016196417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994997,0.0002458385,0.000014274842,0.00005530372,0.00015560152,0.0000292693],"domain_scores_gemma":[0.999203,0.00050429674,0.000083306935,0.000087722045,0.00009843751,0.00002328343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071329146,0.00045222166,0.00043286767,0.00028676493,0.0002967253,0.0004593046,0.0004912475,0.0005409528,0.0009542125],"category_scores_gemma":[0.0016251798,0.00016462596,0.00018640164,0.0004456137,0.00043985256,0.00059516256,0.00052201777,0.00036990634,0.00024866738],"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.0010411267,0.00012077598,0.0015440802,0.00023132774,0.00008012551,0.0008656051,0.00020843574,0.63034993,0.08943426,0.06293352,0.0019326957,0.21125814],"study_design_scores_gemma":[0.000091251124,0.00027622256,0.0002980566,0.000013197008,0.000024268058,0.00037724595,0.000022402734,0.96733654,0.01211114,0.018023433,0.0014126487,0.00001370523],"about_ca_topic_score_codex":0.00032446894,"about_ca_topic_score_gemma":0.0007364349,"teacher_disagreement_score":0.0009542125,"about_ca_system_score_codex":0.00043596022,"about_ca_system_score_gemma":0.0004502737,"threshold_uncertainty_score":0.0037722588},"labels":[],"label_agreement":null},{"id":"W2006990595","doi":"10.1002/dac.1183","title":"Analytical modeling of bidirectional multi‐channel IEEE 802.11 MAC protocols","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":18,"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 Calgary; Mount Royal University","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Distributed coordination function; Computer network; IEEE 802.11; Network allocation vector; Queue; Channel (broadcasting); Media access control; Scheduling (production processes); Wireless ad hoc network; Inter-Access Point Protocol; Throughput; Wireless network; Distributed computing; Wireless; Wi-Fi; Mathematical optimization; Telecommunications","score_opus":0.07426398559003639,"score_gpt":0.36924076733414735,"score_spread":0.29497678174411096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006990595","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.04552817,0.001191176,0.9192332,0.00071044307,0.00014205257,0.0001206469,0.00014272257,0.00035491594,0.032576755],"genre_scores_gemma":[0.89972496,0.001779717,0.08427879,0.00017653579,0.00011790362,0.00035845538,0.0001176113,0.00008817959,0.013357882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918205,0.0002473588,0.000026474925,0.000060540475,0.00036963014,0.00011395322],"domain_scores_gemma":[0.9988134,0.00053810753,0.00016704814,0.00008524258,0.00035344332,0.000042812168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011504836,0.0005642411,0.0003322157,0.0007279553,0.000540182,0.0010675311,0.0012614843,0.00081176264,0.0019569574],"category_scores_gemma":[0.0029731719,0.000361152,0.0003662743,0.0006412037,0.00065146625,0.0011765531,0.0007538103,0.00070767873,0.00052965566],"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.000019235149,0.00004072539,0.00041776602,0.000038350314,0.000010296108,0.00007925572,0.0000777396,0.88676333,0.0015532826,0.103363924,0.0009145937,0.0067214947],"study_design_scores_gemma":[0.000001584248,0.000005013484,0.0000395457,0.0000034554416,0.0000016851225,0.000009022672,0.0000063859197,0.9952519,0.00011461014,0.0039188517,0.00064572407,0.000002196381],"about_ca_topic_score_codex":0.0065966863,"about_ca_topic_score_gemma":0.0035542191,"teacher_disagreement_score":0.0065966863,"about_ca_system_score_codex":0.0015609508,"about_ca_system_score_gemma":0.0016516494,"threshold_uncertainty_score":0.013116598},"labels":[],"label_agreement":null},{"id":"W2008050824","doi":"10.1002/dac.776","title":"MAC‐assisted topology control for<i>ad hoc</i>wireless networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"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":"Computer science; Wireless ad hoc network; Computer network; Topology control; Power control; Reachability; Node (physics); Topology (electrical circuits); Wireless network; Wireless; Network topology; Transmission (telecommunications); Mobile ad hoc network; Graph; Distributed computing; Power (physics); Algorithm; Theoretical computer science; Telecommunications; Key distribution in wireless sensor networks; Mathematics; Network packet","score_opus":0.013953122403790954,"score_gpt":0.2731992003979177,"score_spread":0.25924607799412674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008050824","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.038257375,0.00066999893,0.9548793,0.0003361455,0.00010759168,0.000056774858,0.00004956749,0.0006991434,0.004944118],"genre_scores_gemma":[0.8894396,0.00047747054,0.106764674,0.00011795435,0.0000907534,0.00009898426,0.000101999234,0.0000615074,0.0028471535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966776,0.00014317773,0.0000169119,0.000047706733,0.00009225165,0.000032211534],"domain_scores_gemma":[0.99914896,0.0003770081,0.0001421894,0.00012540694,0.0001548179,0.000051593102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705968,0.00047786068,0.00037879948,0.00045087136,0.0003798239,0.0006829004,0.000869637,0.0002832715,0.0010504839],"category_scores_gemma":[0.001696358,0.00016113013,0.00021798293,0.00043984147,0.0005987407,0.0009865481,0.0005220561,0.00053932564,0.00019502595],"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.00028418854,0.00010252754,0.0011818627,0.00021849318,0.00006738043,0.00018713235,0.00019442139,0.6776335,0.029167717,0.04885455,0.0041804714,0.23792769],"study_design_scores_gemma":[0.000021523214,0.00009629868,0.00025641813,0.000011970783,0.000016061877,0.00006814502,0.000026928765,0.9737346,0.0053891498,0.016371557,0.003997599,0.000009618463],"about_ca_topic_score_codex":0.00086272374,"about_ca_topic_score_gemma":0.00084697845,"teacher_disagreement_score":0.0010504839,"about_ca_system_score_codex":0.00035592282,"about_ca_system_score_gemma":0.00030707923,"threshold_uncertainty_score":0.0035141706},"labels":[],"label_agreement":null},{"id":"W2008071991","doi":"10.1002/dac.829","title":"An analytical approach to the performance evaluation of the balanced gamma switch under multicast traffic","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; Source-specific multicast; Unicast; Protocol Independent Multicast; Pragmatic General Multicast; Distributed computing; Traffic model","score_opus":0.048140879205084135,"score_gpt":0.3161792377733918,"score_spread":0.26803835856830766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008071991","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.41958627,0.0009784556,0.5580778,0.0002885064,0.000058152338,0.000082750346,0.00010496059,0.00065835466,0.020164685],"genre_scores_gemma":[0.9842876,0.00022505438,0.014583017,0.00002807424,0.000015219325,0.00002427747,0.00002934343,0.000022889502,0.0007844782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945766,0.00013056558,0.000011267092,0.00004038054,0.00026131014,0.00009874263],"domain_scores_gemma":[0.9993513,0.00036872164,0.000068651774,0.00004308021,0.00014945089,0.00001890313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008364676,0.0006330729,0.0003184683,0.000663054,0.00027416906,0.00079299125,0.00057522074,0.0004834542,0.0011686538],"category_scores_gemma":[0.002667042,0.00018837147,0.00021279562,0.00046904557,0.0004713538,0.0006010489,0.00045394906,0.00034463694,0.00019093274],"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.000257523,0.0000836744,0.001814896,0.00007831622,0.00002772832,0.0001862878,0.00013900157,0.8766913,0.063095644,0.032762587,0.00069727434,0.024165818],"study_design_scores_gemma":[0.000004489454,0.000055495468,0.00014239571,0.0000042094553,0.0000046962828,0.000032129556,0.000012206419,0.9924039,0.005338693,0.0016801499,0.0003177782,0.0000036970544],"about_ca_topic_score_codex":0.0015477717,"about_ca_topic_score_gemma":0.0005167811,"teacher_disagreement_score":0.0015477717,"about_ca_system_score_codex":0.0013832742,"about_ca_system_score_gemma":0.00068930304,"threshold_uncertainty_score":0.010036409},"labels":[],"label_agreement":null},{"id":"W2009134105","doi":"10.1002/dac.506","title":"Virtual base stations for wireless mobile<i>ad hoc</i>communications: an infrastructure for the infrastructure‐less","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Base station; Wireless ad hoc network; Quality of service; Wireless Routing Protocol; Mobile ad hoc network; Routing protocol; Ad hoc wireless distribution service; Wireless network; Distributed computing; Protocol (science); Node (physics); Mobile IP; Correctness; Optimized Link State Routing Protocol; Wireless; Mobile computing; Routing (electronic design automation); Telecommunications; Network packet","score_opus":0.025998352027882265,"score_gpt":0.3130457417607179,"score_spread":0.28704738973283567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009134105","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.040918246,0.00371678,0.9380861,0.0010620436,0.00068843074,0.0001369089,0.00005616684,0.00082400703,0.0145113645],"genre_scores_gemma":[0.7886713,0.004576812,0.19777426,0.00038580134,0.00050357205,0.00024013953,0.00020664002,0.00009036711,0.007551024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996146,0.00014500387,0.000019731462,0.000036622987,0.00012482854,0.000059119106],"domain_scores_gemma":[0.9992712,0.00023443277,0.00010739257,0.00015513379,0.00014718872,0.00008451781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401162,0.00038737786,0.0002892709,0.00039551524,0.0006370668,0.0017848051,0.0013820273,0.0006245497,0.002286664],"category_scores_gemma":[0.001742374,0.00028627925,0.00028414954,0.00039649033,0.0010221082,0.0020231188,0.0010375516,0.0011122253,0.00060627674],"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.0003101418,0.00011898846,0.0016353917,0.00041732745,0.000080597434,0.0004349118,0.00040853166,0.090679854,0.049212273,0.6328302,0.010983633,0.21288821],"study_design_scores_gemma":[0.00019198889,0.000913331,0.0011700145,0.00019719268,0.00022943308,0.0009348679,0.0003480301,0.58593476,0.033123836,0.14741519,0.22943652,0.00010486396],"about_ca_topic_score_codex":0.0009277455,"about_ca_topic_score_gemma":0.00080593233,"teacher_disagreement_score":0.002286664,"about_ca_system_score_codex":0.000546151,"about_ca_system_score_gemma":0.00059214554,"threshold_uncertainty_score":0.00764966},"labels":[],"label_agreement":null},{"id":"W2010653505","doi":"10.1002/dac.552","title":"Recovery from control plane failures in GMPLS‐controlled optical networks","year":2002,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Nortel (Canada); Communications Research Centre Canada","funders":"","keywords":"Computer network; Computer science; Forwarding plane; Node (physics); Routing and wavelength assignment; Initialization; Routing protocol; Routing control plane; Protocol (science); Routing (electronic design automation); Wavelength-division multiplexing; Network packet; Wavelength; Optics; Medicine; Physics","score_opus":0.01169081982356397,"score_gpt":0.22792543684974292,"score_spread":0.21623461702617897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010653505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6478399,0.00078574056,0.34192517,0.0007435585,0.000118642536,0.00019228386,0.0001217202,0.0021756298,0.006097426],"genre_scores_gemma":[0.9827681,0.00008436892,0.015677182,0.00003331197,0.000018829072,0.000028374468,0.000079044476,0.000016949212,0.0012938294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959713,0.00010809416,0.000025870453,0.000050948627,0.0001393261,0.00007869201],"domain_scores_gemma":[0.9994388,0.00014789944,0.0001420012,0.0001369351,0.00010936133,0.00002493393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007219404,0.00023451094,0.00024318624,0.00039330384,0.0005254045,0.0006185801,0.000657381,0.0003878895,0.00055177766],"category_scores_gemma":[0.0017265322,0.00014380884,0.00014215533,0.0002321344,0.00046632302,0.0007146131,0.00068696414,0.00037245956,0.00021822458],"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.0034125198,0.00042512044,0.0071965926,0.00035006457,0.00007722956,0.0026326077,0.0011550407,0.34557822,0.18208462,0.04477385,0.007653723,0.4046604],"study_design_scores_gemma":[0.00017261553,0.00044948258,0.0018383305,0.000030192046,0.000046221656,0.0004236117,0.00025382134,0.8889074,0.08339652,0.017915675,0.0065311515,0.000035071414],"about_ca_topic_score_codex":0.0018426235,"about_ca_topic_score_gemma":0.00090423867,"teacher_disagreement_score":0.0018426235,"about_ca_system_score_codex":0.0003767117,"about_ca_system_score_gemma":0.0005059538,"threshold_uncertainty_score":0.0038180351},"labels":[],"label_agreement":null},{"id":"W2017280665","doi":"10.1002/dac.853","title":"Integration of mobility and intrusion detection for wireless<i>ad hoc</i>networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"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":"Computer science; Mobility model; Metric (unit); Mobile ad hoc network; Wireless ad hoc network; Waypoint; Intrusion detection system; Obstacle; Markov chain; Scheme (mathematics); Vehicular ad hoc network; Computer network; Wireless; Distributed computing; Network packet; Real-time computing; Data mining; Machine learning; Telecommunications","score_opus":0.013001155011868945,"score_gpt":0.26343356268355594,"score_spread":0.250432407671687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017280665","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.18775713,0.00079967483,0.80716103,0.00053225644,0.00010912359,0.000074166644,0.00002427978,0.001059731,0.002482615],"genre_scores_gemma":[0.9601816,0.00023460513,0.039030366,0.00004652921,0.000043366108,0.000021106069,0.00002411635,0.00002042715,0.00039788452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892896,0.00044286062,0.00007390237,0.00015621829,0.00029766385,0.00010032087],"domain_scores_gemma":[0.9960802,0.002143991,0.0005492303,0.00047194105,0.0005978761,0.00015682289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013683204,0.00047924105,0.0005712425,0.0007558218,0.00032348244,0.00071865035,0.00071462506,0.0004056579,0.0003618409],"category_scores_gemma":[0.006174856,0.00026478257,0.00042437718,0.00050806545,0.00089767284,0.0015259947,0.0009506041,0.0005802889,0.0001011201],"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.0006290759,0.00022964428,0.042783305,0.00018516586,0.00032324417,0.0005895003,0.00028972837,0.49090263,0.042400584,0.030754635,0.0017681755,0.3891442],"study_design_scores_gemma":[0.000008909922,0.00018699277,0.0022811424,0.000012144982,0.000051815696,0.00026864652,0.00003300747,0.98226124,0.008717486,0.00531659,0.0008433164,0.000018800923],"about_ca_topic_score_codex":0.0015745005,"about_ca_topic_score_gemma":0.001075902,"teacher_disagreement_score":0.0015745005,"about_ca_system_score_codex":0.0005516108,"about_ca_system_score_gemma":0.00043690833,"threshold_uncertainty_score":0.007236421},"labels":[],"label_agreement":null},{"id":"W2018278884","doi":"10.1002/dac.1051","title":"An application of univariate marginal distribution algorithm in MIMO communication systems","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"MIMO; Computer science; Algorithm; Detector; Computational complexity theory; Bit error rate; Transmitter power output; Optimization problem; Mathematical optimization; Mathematics; Channel (broadcasting); Decoding methods; Telecommunications","score_opus":0.008874788257901774,"score_gpt":0.28578193063957286,"score_spread":0.2769071423816711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018278884","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.007800597,0.00016504157,0.9910484,0.000083057625,0.000013100107,0.000008909367,0.000013325859,0.00017020715,0.00069740287],"genre_scores_gemma":[0.6137036,0.00039058228,0.38302565,0.00010528623,0.00007044128,0.000050168568,0.000074506686,0.000056506397,0.002523176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992625,0.0003934409,0.000022727925,0.00008479246,0.00018932273,0.00004724576],"domain_scores_gemma":[0.9982362,0.0012518314,0.00008999898,0.00013971364,0.00023750795,0.00004477648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014639406,0.00038456952,0.0005924016,0.00043670743,0.00022690553,0.0005905013,0.0005073347,0.0004991619,0.0014121204],"category_scores_gemma":[0.003921471,0.00020844041,0.00034370756,0.00050948956,0.0007367841,0.0006748697,0.0006905958,0.00067852146,0.0003451183],"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.00035959313,0.000067142115,0.0031998875,0.00011304292,0.00009017012,0.000195384,0.00013281999,0.56270707,0.013463479,0.1380175,0.0018693317,0.2797846],"study_design_scores_gemma":[0.0000063678217,0.000029946437,0.0001858081,0.0000029968678,0.0000040738437,0.000072653944,0.00000483435,0.9879288,0.0023018327,0.008824938,0.0006306014,0.000007083361],"about_ca_topic_score_codex":0.0012838263,"about_ca_topic_score_gemma":0.0010068057,"teacher_disagreement_score":0.0014639406,"about_ca_system_score_codex":0.00058555225,"about_ca_system_score_gemma":0.0009514065,"threshold_uncertainty_score":0.007742107},"labels":[],"label_agreement":null},{"id":"W2021482093","doi":"10.1002/dac.859","title":"A scalable multicast routing protocol for building shortest path trees","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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 Ottawa","funders":"","keywords":"Computer science; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Computer network; Distributed computing; Xcast; Pragmatic General Multicast; Source-specific multicast; IP multicast; Open Shortest Path First; Scalability; Routing protocol; Routing (electronic design automation); Link-state routing protocol; Database","score_opus":0.025600276469011033,"score_gpt":0.31685523675666966,"score_spread":0.2912549602876586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021482093","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.018299907,0.0008419907,0.9721168,0.00044950945,0.00018265539,0.0003239854,0.00019199784,0.0016657496,0.0059273997],"genre_scores_gemma":[0.37714604,0.000982412,0.6160899,0.00017738249,0.00019161886,0.00073551614,0.00092012936,0.00015700237,0.0036001015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927026,0.00019256586,0.00004780123,0.000056469904,0.00037775247,0.000055239376],"domain_scores_gemma":[0.9994313,0.00018236446,0.00008023061,0.00009615194,0.00016151619,0.000048460126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093017967,0.00043968784,0.00046085665,0.0008434794,0.00073021214,0.00059580815,0.0008920208,0.00054058165,0.0018004255],"category_scores_gemma":[0.0020236906,0.00022302772,0.00043809254,0.0008497593,0.0004123527,0.001064196,0.0013728883,0.0006337016,0.00046302026],"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.00031343655,0.00014562343,0.00084448163,0.000650932,0.0001519143,0.001374518,0.00050544407,0.25171578,0.08830074,0.24767087,0.029003318,0.3793229],"study_design_scores_gemma":[0.00014894472,0.00024997815,0.00040742624,0.00007759279,0.00008401872,0.00065224915,0.00009446073,0.8153338,0.017646138,0.10947286,0.05577628,0.000056336856],"about_ca_topic_score_codex":0.000541319,"about_ca_topic_score_gemma":0.0006822554,"teacher_disagreement_score":0.0018004255,"about_ca_system_score_codex":0.00043036218,"about_ca_system_score_gemma":0.0006711966,"threshold_uncertainty_score":0.0060229897},"labels":[],"label_agreement":null},{"id":"W2021763947","doi":"10.1002/dac.670","title":"Token bank fair queuing: a new scheduling algorithm for wireless multimedia services","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":26,"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 British Columbia; Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Fair queuing; Quality of service; Scheduling (production processes); Token bucket; Proportionally fair; Wireless network; Wireless; Network packet; Algorithm; Distributed computing; Round-robin scheduling; Dynamic priority scheduling; Telecommunications","score_opus":0.011750038440506988,"score_gpt":0.26368610992910474,"score_spread":0.25193607148859776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021763947","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.006665917,0.00021743352,0.991193,0.00013650663,0.0001296949,0.000065028136,0.000031607215,0.0006109789,0.0009498338],"genre_scores_gemma":[0.37615353,0.00042466403,0.61935073,0.00020865779,0.00023796347,0.00024594725,0.00011905574,0.00014761493,0.0031117895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990689,0.00026665468,0.000059484413,0.00012503457,0.00034008155,0.0001399337],"domain_scores_gemma":[0.9989812,0.0004477118,0.00012346126,0.00010726806,0.00025881958,0.000081599326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025575492,0.0006152804,0.00080687634,0.0008568595,0.0008756142,0.0013884406,0.0020897158,0.0009289648,0.001975541],"category_scores_gemma":[0.0040478026,0.00028227322,0.0003647088,0.0009509026,0.0009343369,0.0018033896,0.0008641445,0.0009540001,0.00040167093],"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.0004478166,0.0001597446,0.0008018919,0.00012731821,0.00006197933,0.00012172655,0.00014520933,0.60830766,0.011479258,0.12754992,0.008031582,0.24276587],"study_design_scores_gemma":[0.00003229821,0.000027576216,0.000039353825,0.000003882079,0.000008319283,0.00002046279,0.00000522225,0.9882962,0.0010544992,0.008373561,0.0021309087,0.000007672975],"about_ca_topic_score_codex":0.004443131,"about_ca_topic_score_gemma":0.0032232897,"teacher_disagreement_score":0.004443131,"about_ca_system_score_codex":0.0019497538,"about_ca_system_score_gemma":0.0023041582,"threshold_uncertainty_score":0.014146566},"labels":[],"label_agreement":null},{"id":"W2028848110","doi":"10.1002/dac.871","title":"An extended core‐based framework for delay‐constrained group communication","year":2007,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Quality of service; Core (optical fiber); Modular design; Set (abstract data type); Span (engineering); Communication in small groups; Domain (mathematical analysis); Transmission (telecommunications); Software deployment; Routing (electronic design automation); Tree (set theory); Space (punctuation); Computer network; Telecommunications; Mathematics","score_opus":0.03197030761918498,"score_gpt":0.3356395474473564,"score_spread":0.30366923982817146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028848110","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.012404292,0.00011623218,0.9854673,0.00006827811,0.000014163988,0.000031669406,0.000013536075,0.00006398836,0.00182051],"genre_scores_gemma":[0.48975566,0.00030594508,0.5063391,0.00006462699,0.00004597159,0.00022532805,0.000082406834,0.000056705056,0.0031243034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994629,0.0002256482,0.000019271898,0.00005959766,0.00016858126,0.00006399581],"domain_scores_gemma":[0.99960166,0.00017603431,0.000035609777,0.00005598541,0.00008069613,0.000049998067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012461507,0.00049002876,0.0005676053,0.00043856978,0.0004610735,0.00087997795,0.0013187062,0.0007511886,0.0017292573],"category_scores_gemma":[0.0013423503,0.00025656013,0.0005012316,0.0005238116,0.00076373975,0.001162013,0.0012946997,0.00079411076,0.0002316524],"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.00006400043,0.00006702788,0.00023345329,0.00007708832,0.000025233738,0.0001181992,0.000172831,0.7502131,0.005140322,0.20312905,0.0012073623,0.03955238],"study_design_scores_gemma":[0.000011291894,0.000035164103,0.000029324274,0.0000054028233,0.0000049374594,0.000019368064,0.00001698237,0.97520876,0.00043986915,0.022374496,0.0018501574,0.00000435962],"about_ca_topic_score_codex":0.0018612213,"about_ca_topic_score_gemma":0.001816094,"teacher_disagreement_score":0.0018612213,"about_ca_system_score_codex":0.00068873336,"about_ca_system_score_gemma":0.001145951,"threshold_uncertainty_score":0.0065903664},"labels":[],"label_agreement":null},{"id":"W2030287458","doi":"10.1002/dac.619","title":"Traffic locality characteristics in a parallel forwarding system","year":2003,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"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":"Computer science; Locality; Locality of reference; Workload; Cache; Scheduling (production processes); Distributed computing; Network packet; Hash function; Computer network; Operating system; Computer security","score_opus":0.01592788469930162,"score_gpt":0.25577128645719216,"score_spread":0.23984340175789054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030287458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98904127,0.000042854586,0.00969761,0.000091168185,0.000005491459,0.000020909652,0.000035510526,0.00019404283,0.0008710711],"genre_scores_gemma":[0.9988154,0.000013336868,0.00091351534,0.000008782765,0.000003523126,0.000008997158,0.000034087916,0.00000738028,0.00019507665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993019,0.00016527002,0.000031753425,0.00012043859,0.00022017464,0.00016045444],"domain_scores_gemma":[0.9953687,0.0025869417,0.00052752346,0.00031305445,0.0009887832,0.000215024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114691,0.00028696787,0.00041669825,0.0009286776,0.0009646192,0.000697442,0.0007174955,0.0006939165,0.0009284366],"category_scores_gemma":[0.006189332,0.00024453943,0.00018271437,0.00083584414,0.0006618993,0.0010359628,0.00036352267,0.0003761246,0.00015105058],"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.0006199388,0.0004226857,0.032176934,0.00006196819,0.00004870191,0.0007394308,0.00058947166,0.9086525,0.028562771,0.00850727,0.0013866675,0.018231574],"study_design_scores_gemma":[0.00001324915,0.00008297707,0.0016359317,0.000001850894,0.0000073108076,0.000103825754,0.000052981995,0.99382013,0.0025993374,0.001471412,0.00020132888,0.000009690088],"about_ca_topic_score_codex":0.0072437967,"about_ca_topic_score_gemma":0.0038375075,"teacher_disagreement_score":0.0072437967,"about_ca_system_score_codex":0.0020238294,"about_ca_system_score_gemma":0.0009689517,"threshold_uncertainty_score":0.014683962},"labels":[],"label_agreement":null},{"id":"W2032737081","doi":"10.1002/dac.852","title":"Clock synchronization for packet networks using a weighted least‐squares error filtering technique and enabling circuit emulation service","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Time Synchronization Technologies","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Self-clocking signal; Clock recovery; Clock domain crossing; Clock synchronization; Jitter; Digital clock manager; Synchronization (alternating current); Network packet; Clock drift; Real-time computing; Clock skew; Emulation; Synchronous circuit; Transmitter; Electronic engineering; Computer network; Clock signal; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.02899828105782238,"score_gpt":0.2790887219150646,"score_spread":0.25009044085724225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032737081","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.008961837,0.000040305484,0.9903437,0.000035771158,0.00001815003,0.000012332836,0.000007014692,0.00030316506,0.0002778014],"genre_scores_gemma":[0.43797863,0.00026379628,0.55556625,0.00007076071,0.000062440275,0.00009564505,0.00011801356,0.000116251766,0.005728154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950683,0.00014512934,0.00002958489,0.000081727645,0.00019752557,0.000039232655],"domain_scores_gemma":[0.99945194,0.00024498516,0.00007905711,0.00007259672,0.00013853166,0.000012793542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009174507,0.0004992785,0.00032309932,0.00036101538,0.00034218252,0.00066409406,0.000562719,0.00059339165,0.0013637604],"category_scores_gemma":[0.0026183035,0.00021963505,0.00033980695,0.0004384769,0.00033510724,0.00083807326,0.0004400321,0.00065408973,0.00049275905],"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.00044434058,0.00013629934,0.0014162613,0.000111093934,0.00008671614,0.00015239723,0.00018863962,0.39894307,0.06670923,0.06600842,0.0023531003,0.4634505],"study_design_scores_gemma":[0.000015005311,0.000042642,0.000094523704,0.000003491494,0.000009054777,0.000020259227,0.0000047488434,0.98874086,0.008006548,0.0018532012,0.001204249,0.0000054733446],"about_ca_topic_score_codex":0.0032599058,"about_ca_topic_score_gemma":0.0027137655,"teacher_disagreement_score":0.0032599058,"about_ca_system_score_codex":0.0005905514,"about_ca_system_score_gemma":0.0006644394,"threshold_uncertainty_score":0.0064818263},"labels":[],"label_agreement":null},{"id":"W2033383294","doi":"10.1002/dac.644","title":"Split agent‐based routing in interconnected networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Network packet; Computer network; Static routing; Distributed computing; Hierarchical routing; Routing (electronic design automation); Routing table; Policy-based routing; Source routing; Quality of service; Dynamic Source Routing; Routing protocol","score_opus":0.02140463948165193,"score_gpt":0.2799678843567213,"score_spread":0.2585632448750694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033383294","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.09645929,0.0006456394,0.8970398,0.0002829421,0.00006713751,0.000118028605,0.000042712247,0.00034851496,0.004996083],"genre_scores_gemma":[0.8676008,0.00047629105,0.12768468,0.00006677625,0.000029169492,0.00016403718,0.00009564618,0.000037961086,0.0038446602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965835,0.00015381063,0.000018269724,0.000058528494,0.0000772778,0.000033829918],"domain_scores_gemma":[0.9994437,0.00025818413,0.000097176206,0.00006113835,0.00008921277,0.000050541345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007035777,0.00034586052,0.00054465875,0.0005556645,0.00043327367,0.0009310237,0.00075024465,0.00059991167,0.0011755096],"category_scores_gemma":[0.0015539727,0.0002869851,0.00024138004,0.00045198956,0.00075169664,0.00085676886,0.0010426437,0.00042104156,0.00018260202],"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.000096119074,0.000027636157,0.00055022555,0.00005002811,0.000042230466,0.00012644437,0.00015354599,0.92501116,0.0047785733,0.039573044,0.0008341136,0.028756874],"study_design_scores_gemma":[0.000007553725,0.000023683448,0.00007714556,0.0000038081062,0.0000051211327,0.00001690547,0.000018323468,0.98825336,0.00036498532,0.010341447,0.0008846107,0.000003015242],"about_ca_topic_score_codex":0.0014333035,"about_ca_topic_score_gemma":0.001351276,"teacher_disagreement_score":0.0014333035,"about_ca_system_score_codex":0.0006212001,"about_ca_system_score_gemma":0.0004022261,"threshold_uncertainty_score":0.0045071244},"labels":[],"label_agreement":null},{"id":"W2045220515","doi":"10.1002/dac.611","title":"Roaming times of multi‐wireless systems for software defined radio","year":2003,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Roaming; Computer science; Base station; Wireless; Computer network; Software-defined radio; Reconfigurability; Channel (broadcasting); Telecommunications","score_opus":0.027513044543179075,"score_gpt":0.27885723165008547,"score_spread":0.25134418710690637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045220515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97238165,0.0003227462,0.025155418,0.000076456265,0.00003116323,0.000034051798,0.000020106567,0.000119377386,0.0018590989],"genre_scores_gemma":[0.9969518,0.000039424427,0.0026439086,0.000019950938,0.0000047903627,0.000014672201,0.000021828475,0.000013099427,0.0002906095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854577,0.00049993815,0.00006938095,0.00012666959,0.00048226063,0.0002759835],"domain_scores_gemma":[0.99147356,0.0055378154,0.00087273,0.0007242355,0.0010196078,0.0003720375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024907438,0.00059832854,0.00050717493,0.00052449934,0.00050290226,0.0009925384,0.0004549335,0.0005899146,0.0015343276],"category_scores_gemma":[0.010600113,0.00017488685,0.00032730398,0.0002969302,0.00061329943,0.0015009601,0.00080675865,0.0007884943,0.00014311774],"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.0030982997,0.000384352,0.016861826,0.00018927464,0.00022801546,0.00062773965,0.000372885,0.8664469,0.04995831,0.013417384,0.00053007604,0.047884934],"study_design_scores_gemma":[0.000039375816,0.0011654042,0.0035325738,0.00001498462,0.00006192346,0.00025321034,0.00008796333,0.97296745,0.01935617,0.0019837262,0.00050843135,0.000028799805],"about_ca_topic_score_codex":0.0009661991,"about_ca_topic_score_gemma":0.00066908926,"teacher_disagreement_score":0.0024907438,"about_ca_system_score_codex":0.0007871643,"about_ca_system_score_gemma":0.0003709603,"threshold_uncertainty_score":0.013172448},"labels":[],"label_agreement":null},{"id":"W2045365184","doi":"10.1002/dac.700","title":"On the design of bandwidth efficient signalling for indoor wireless optical channels","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Optical wireless; Computer science; Bandwidth (computing); Multipath propagation; Wireless; Optical wireless communications; Electronic engineering; Channel (broadcasting); Telecommunications; Computer network; Engineering","score_opus":0.03486985614496433,"score_gpt":0.2702440108190248,"score_spread":0.2353741546740605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045365184","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.017136993,0.00055203895,0.9752584,0.00021271878,0.00004265458,0.00005082714,0.000028001528,0.00009815153,0.006620217],"genre_scores_gemma":[0.7239783,0.00226515,0.26760808,0.0001938198,0.00013251766,0.00026230217,0.00008459336,0.00006954705,0.0054058232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987275,0.0005640149,0.000055443114,0.00011915801,0.00036878293,0.00016503442],"domain_scores_gemma":[0.99735767,0.0018028208,0.00031197115,0.00013922638,0.00031813333,0.00007008545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014967467,0.00066410383,0.0007023812,0.000497068,0.00048132706,0.0012314833,0.00094709464,0.0007837054,0.0022161915],"category_scores_gemma":[0.0049349237,0.00044053674,0.00029493688,0.00075182813,0.0010598677,0.0011064163,0.0011320254,0.00089405023,0.000523465],"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.00022408422,0.00006479335,0.00033524598,0.0003498329,0.000033180902,0.00016345596,0.00020507388,0.6588725,0.026393333,0.2051813,0.0017466333,0.10643059],"study_design_scores_gemma":[0.000028540166,0.00011123276,0.00007133391,0.000038373688,0.000012360951,0.000117496405,0.000043140913,0.9542504,0.0061406894,0.035481665,0.0036850742,0.00001970544],"about_ca_topic_score_codex":0.00065354706,"about_ca_topic_score_gemma":0.0007137355,"teacher_disagreement_score":0.0022161915,"about_ca_system_score_codex":0.00095131755,"about_ca_system_score_gemma":0.000808503,"threshold_uncertainty_score":0.007915676},"labels":[],"label_agreement":null},{"id":"W2046472986","doi":"10.1002/dac.623","title":"On the effectiveness of alternative paths in QoS routing","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"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":"Computer science; Computer network; Equal-cost multi-path routing; Link-state routing protocol; Policy-based routing; Static routing; Multipath routing; Dynamic Source Routing; Routing (electronic design automation); Distributed computing; Bandwidth (computing); Routing protocol","score_opus":0.016316727683619588,"score_gpt":0.27163455531461234,"score_spread":0.25531782763099276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046472986","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.47973472,0.004415949,0.50004035,0.0020158736,0.00012705785,0.00011806072,0.00010776197,0.000419096,0.013021156],"genre_scores_gemma":[0.9602504,0.00064969534,0.03841517,0.00006202692,0.000044220036,0.00003366773,0.000027607508,0.000028178394,0.000489076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532866,0.002745962,0.00015917853,0.00027157582,0.0012170144,0.00027750482],"domain_scores_gemma":[0.95459634,0.038856193,0.0020371855,0.0022774083,0.0016513215,0.0005815529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056208973,0.00061064877,0.00057386054,0.0014791369,0.0009668243,0.0018757106,0.0010320895,0.0011109092,0.0017278484],"category_scores_gemma":[0.030388955,0.00035836504,0.0003240343,0.0010626576,0.0023173841,0.0045728306,0.0018264035,0.0010525003,0.00024180919],"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.0016384192,0.00016235751,0.0041249017,0.00031125452,0.00009512891,0.00030119467,0.00081728416,0.57182753,0.015350462,0.18268235,0.001435762,0.22125335],"study_design_scores_gemma":[0.00009343203,0.00034975164,0.0006512006,0.00005861208,0.000053235657,0.00032281684,0.00018044496,0.908772,0.0054724324,0.08076081,0.0032483905,0.000036869777],"about_ca_topic_score_codex":0.0012141983,"about_ca_topic_score_gemma":0.0009404209,"teacher_disagreement_score":0.0056208973,"about_ca_system_score_codex":0.0011258327,"about_ca_system_score_gemma":0.0005972602,"threshold_uncertainty_score":0.029726505},"labels":[],"label_agreement":null},{"id":"W2048767501","doi":"10.1002/dac.505","title":"IP router architectures: an overview","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Router; Terabit; Computer network; Next-generation network; Throughput; The Internet; Core router; Interconnection; IP forwarding; Telecommunications; Routing (electronic design automation); Routing protocol; World Wide Web; Wireless; Wavelength-division multiplexing","score_opus":0.06361439239088819,"score_gpt":0.33882874125252754,"score_spread":0.27521434886163937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048767501","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016135639,0.6937252,0.20381531,0.002485989,0.0012517676,0.00020718787,0.00019620231,0.002090407,0.08009231],"genre_scores_gemma":[0.10572751,0.6865731,0.16664927,0.0012306,0.002458554,0.000323183,0.0009024568,0.00021977836,0.035915595],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993648,0.0001016986,0.00007010819,0.00012233535,0.00026637525,0.00007474024],"domain_scores_gemma":[0.99944013,0.00013197554,0.000038375547,0.000031175572,0.00030278115,0.000055559292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096211216,0.00084945036,0.00048258217,0.0025904002,0.00045661657,0.002830109,0.0011326094,0.0019433082,0.0034489513],"category_scores_gemma":[0.00083831965,0.00084683957,0.00031249394,0.002796905,0.00034552568,0.004492859,0.0007831664,0.0012323017,0.002953239],"study_design_candidate":"not_applicable","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.00016078564,0.000177571,0.0022062776,0.002822892,0.00006838429,0.00037055416,0.00019726226,0.014263911,0.008197174,0.082199074,0.03181081,0.85752517],"study_design_scores_gemma":[0.000053245385,0.0006169659,0.0020055398,0.0016158666,0.00016216432,0.0026520572,0.00020699357,0.054384246,0.006150965,0.041135434,0.8909412,0.00007538637],"about_ca_topic_score_codex":0.00063850975,"about_ca_topic_score_gemma":0.00051952444,"teacher_disagreement_score":0.0034489513,"about_ca_system_score_codex":0.00053958636,"about_ca_system_score_gemma":0.0004941169,"threshold_uncertainty_score":0.0115379095},"labels":[],"label_agreement":null},{"id":"W2050346351","doi":"10.1002/dac.591","title":"Explicit TCP window adaptation in a shared memory architecture","year":2003,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Network packet; Queue; TCP global synchronization; Queueing theory; Priority queue; Window (computing); TCP acceleration; Network congestion; TCP Friendly Rate Control; Sliding window protocol; Real-time computing; Operating system","score_opus":0.01999292443033555,"score_gpt":0.25273370311992915,"score_spread":0.2327407786895936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050346351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6515638,0.0021257952,0.33078292,0.00045839953,0.0005313708,0.00015870572,0.00006478072,0.0069359685,0.0073782993],"genre_scores_gemma":[0.98382217,0.00010327341,0.014010895,0.00006452295,0.000055782693,0.000035689893,0.000030902527,0.000038471877,0.0018382738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933237,0.00013811751,0.00005717039,0.00015187392,0.00016956402,0.00015089322],"domain_scores_gemma":[0.99822456,0.00040884965,0.00015538582,0.00058759446,0.00043611962,0.00018741106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011489191,0.00052941486,0.0005829642,0.0006519979,0.00083083916,0.0019549143,0.0032428273,0.00085815456,0.0018306978],"category_scores_gemma":[0.002752258,0.00045389845,0.00028637287,0.0006415546,0.0007469983,0.0023335235,0.0018744568,0.0012375654,0.0003693966],"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.0065302695,0.0015665174,0.021104852,0.00051261927,0.0006480053,0.0028127967,0.0015201463,0.29648176,0.16691378,0.0666856,0.016164541,0.4190592],"study_design_scores_gemma":[0.00022400795,0.0003765255,0.0014698671,0.000031602103,0.00024236541,0.000279663,0.000089227,0.93851465,0.041617744,0.011117954,0.005973104,0.00006338785],"about_ca_topic_score_codex":0.0026320997,"about_ca_topic_score_gemma":0.0024448272,"teacher_disagreement_score":0.0032428273,"about_ca_system_score_codex":0.0010077817,"about_ca_system_score_gemma":0.00076324283,"threshold_uncertainty_score":0.007312},"labels":[],"label_agreement":null},{"id":"W2053761086","doi":"10.1002/dac.1262","title":"UARA in edge routers: an effective approach to user fairness and traffic shaping","year":2011,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Concordia University; Polytechnique Montréal","keywords":"Computer science; Computer network; Provisioning; Network congestion; Quality of experience; Enhanced Data Rates for GSM Evolution; Quality of service; Traffic shaping; The Internet; Bandwidth (computing); Network traffic control; Peer-to-peer; Traffic congestion; Network packet; Telecommunications; World Wide Web","score_opus":0.06499478482198469,"score_gpt":0.28241033123697984,"score_spread":0.21741554641499516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053761086","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.041583464,0.00030963577,0.95128155,0.0002660127,0.00008908263,0.00010366279,0.000012908789,0.00072805816,0.005625676],"genre_scores_gemma":[0.8523455,0.000106880034,0.14405975,0.00028764163,0.0001097864,0.00007664852,0.000014840497,0.00006442952,0.002934591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967775,0.001723943,0.00011566127,0.00045317566,0.00051535945,0.00041450874],"domain_scores_gemma":[0.99389416,0.0024719378,0.00040391606,0.0014916409,0.0012994959,0.00043888093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037173072,0.0006514032,0.0010216006,0.0008106155,0.0013389286,0.002177008,0.002365074,0.0014128105,0.0021472506],"category_scores_gemma":[0.006376331,0.00033929548,0.00044808787,0.0005365213,0.0012206377,0.002060253,0.0025983378,0.0017028627,0.0005721574],"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.0012848134,0.0010064717,0.004451065,0.00013957194,0.00014171204,0.00065894704,0.0008393266,0.34753048,0.07371771,0.25752443,0.005598796,0.30710667],"study_design_scores_gemma":[0.000020906375,0.00012361654,0.00019914607,0.000008211757,0.000022182234,0.00010972403,0.00004351503,0.9713867,0.007903324,0.017357228,0.0028041974,0.000021229223],"about_ca_topic_score_codex":0.0009070475,"about_ca_topic_score_gemma":0.0010225836,"teacher_disagreement_score":0.0037173072,"about_ca_system_score_codex":0.0010059121,"about_ca_system_score_gemma":0.0011321773,"threshold_uncertainty_score":0.019659221},"labels":[],"label_agreement":null},{"id":"W2054816762","doi":"10.1002/dac.856","title":"Design and implementation of a scalable switch architecture for efficient high‐speed data multicasting","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Multicast; Computer science; Computer network; Scalability; Distributed computing; Crossover switch; Unicast; Modular design; Xcast; Protocol Independent Multicast; Computer architecture; Telecommunications; Crossbar switch; Operating system","score_opus":0.04456907255686074,"score_gpt":0.3276142108132741,"score_spread":0.2830451382564133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054816762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49565408,0.00049050373,0.48095068,0.0004885257,0.00020039604,0.00021540085,0.00018241917,0.0031446402,0.018673336],"genre_scores_gemma":[0.90943784,0.00013076907,0.087151244,0.00010087796,0.000041777614,0.000084418454,0.00014442357,0.00003806087,0.0028706642],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998796,0.000016481474,0.0000052991063,0.00001912935,0.000053312353,0.000026220334],"domain_scores_gemma":[0.9998801,0.000021688025,0.000016147385,0.000015774025,0.00004675722,0.000019611294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020250175,0.00018978672,0.00013338542,0.00028860397,0.00027685837,0.00039868313,0.0006078647,0.0002148781,0.0016189003],"category_scores_gemma":[0.00019198626,0.000114020135,0.00016081423,0.00020550811,0.000201778,0.0003191771,0.00023584781,0.00023706318,0.00027175766],"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.00035271328,0.00018354312,0.0019398988,0.0001912199,0.00008911195,0.00044762884,0.00017018388,0.061321292,0.7342023,0.020652536,0.0063153026,0.17413431],"study_design_scores_gemma":[0.00035089097,0.0011951867,0.0037697651,0.000033907974,0.000109515175,0.00041323027,0.00010035043,0.69217414,0.26721463,0.007509631,0.027085034,0.000043720866],"about_ca_topic_score_codex":0.0009376907,"about_ca_topic_score_gemma":0.0013840754,"teacher_disagreement_score":0.0016189003,"about_ca_system_score_codex":0.0004843486,"about_ca_system_score_gemma":0.00051479955,"threshold_uncertainty_score":0.0054157376},"labels":[],"label_agreement":null},{"id":"W2062371900","doi":"10.1002/dac.640","title":"QoS routing through alternate paths in wireless<i>ad hoc</i>networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"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 Ottawa","funders":"","keywords":"Computer science; Computer network; Quality of service; Distributed computing; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Routing protocol; Overhead (engineering); Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.020080440558387855,"score_gpt":0.28359445233368485,"score_spread":0.263514011775297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062371900","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.27370656,0.0056355214,0.7107013,0.0009869268,0.00020867761,0.00010380221,0.000107015985,0.0007184573,0.007831705],"genre_scores_gemma":[0.8906305,0.0019945644,0.10521347,0.00010353427,0.000067053625,0.00005713847,0.000096065916,0.000030363266,0.0018072749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964976,0.00013201982,0.000029973933,0.000042203235,0.00010606686,0.000039958326],"domain_scores_gemma":[0.99904937,0.0004943608,0.00017220898,0.00006911808,0.00015990481,0.000054928187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073964626,0.00034874005,0.00029818836,0.00072603073,0.00047192394,0.0008835151,0.000544981,0.0004472547,0.000658229],"category_scores_gemma":[0.0017378003,0.00020880144,0.00016922847,0.0005438513,0.0005610315,0.00096259394,0.00056788157,0.00031236585,0.0001624798],"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.00066026737,0.00016602295,0.005393344,0.0005600478,0.00009197146,0.000989761,0.00074224325,0.4322291,0.10285987,0.11469738,0.0052998075,0.3363103],"study_design_scores_gemma":[0.00005678834,0.00034260162,0.0006905448,0.00004618603,0.000056998208,0.00092233514,0.00016118742,0.9215101,0.017015181,0.04446451,0.014700206,0.00003333791],"about_ca_topic_score_codex":0.0006621062,"about_ca_topic_score_gemma":0.00065948954,"teacher_disagreement_score":0.0008835151,"about_ca_system_score_codex":0.00037118688,"about_ca_system_score_gemma":0.00033347585,"threshold_uncertainty_score":0.003911674},"labels":[],"label_agreement":null},{"id":"W2073895554","doi":"10.1002/dac.797","title":"Improving broadcast performance by traffic isolation in wireless<i>ad hoc</i>networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Computer network; Broadcasting (networking); Broadcast radiation; Flooding (psychology); Node (physics); Overhead (engineering); Default gateway; Wireless ad hoc network; Cluster analysis; Mobile ad hoc network; Network packet; Wireless; Distributed computing; Telecommunications","score_opus":0.007231837939788494,"score_gpt":0.22662799347500628,"score_spread":0.2193961555352178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073895554","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.45213425,0.001695893,0.5333183,0.00034589932,0.00016719659,0.00006725988,0.00004247768,0.0022099838,0.010018813],"genre_scores_gemma":[0.951599,0.0004325548,0.04610603,0.000055848323,0.00010794654,0.000029342531,0.00009580878,0.00008510316,0.0014883011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996137,0.000103269296,0.000016849795,0.00004770806,0.00014062569,0.00007788354],"domain_scores_gemma":[0.99852777,0.0007747024,0.00017590057,0.000121439516,0.00030482005,0.00009531997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062785554,0.00045430986,0.00051202334,0.00065708195,0.00059381453,0.0007301491,0.00081702607,0.00036711083,0.0009020925],"category_scores_gemma":[0.002345462,0.00022097497,0.00017407713,0.0004347749,0.00040251343,0.0009730412,0.0005918914,0.00045901374,0.00042851816],"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.0016458256,0.00061226456,0.0069241244,0.0004349874,0.00014328022,0.00042970362,0.0006307855,0.2848708,0.22938322,0.010738048,0.004929765,0.4592572],"study_design_scores_gemma":[0.000116145915,0.00080049294,0.0018885885,0.00002776608,0.00013300241,0.0003993476,0.00016575021,0.91200346,0.0754624,0.004227387,0.0047428813,0.000032680888],"about_ca_topic_score_codex":0.0008863056,"about_ca_topic_score_gemma":0.00074623054,"teacher_disagreement_score":0.0009020925,"about_ca_system_score_codex":0.00048190737,"about_ca_system_score_gemma":0.00040313782,"threshold_uncertainty_score":0.003496468},"labels":[],"label_agreement":null},{"id":"W2084093893","doi":"10.1002/dac.657","title":"A hop‐by‐hop delay‐constrained routing algorithm with explicit loop avoidance and backup routing information","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Static routing; Dynamic Source Routing; Link-state routing protocol; Distributed computing; Equal-cost multi-path routing; Routing Information Protocol; Destination-Sequenced Distance Vector routing; Policy-based routing; Geographic routing; Path vector protocol; Routing table; Multipath routing; Backup; Routing protocol; Zone Routing Protocol; Routing (electronic design automation)","score_opus":0.008363068624608528,"score_gpt":0.22901055243114413,"score_spread":0.2206474838065356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084093893","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.035283398,0.00023859806,0.9611337,0.00015738397,0.00006294461,0.00014315195,0.00006489619,0.0008172424,0.0020987752],"genre_scores_gemma":[0.40701577,0.00013205016,0.58918786,0.00009929415,0.000029913646,0.00020438485,0.00022625024,0.000060133523,0.0030443193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996841,0.00007970478,0.000024639781,0.00008312264,0.000089977424,0.000038509355],"domain_scores_gemma":[0.99959224,0.00014601639,0.000058455844,0.00007344904,0.00009967239,0.000030184332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038620806,0.00055264455,0.0005915896,0.0006072642,0.0005435997,0.0006347398,0.0013692029,0.00084151054,0.0017141055],"category_scores_gemma":[0.0010105087,0.0002450557,0.00031124012,0.0006803682,0.00034806944,0.00071145134,0.0006713748,0.00040210402,0.00033831227],"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.00040606625,0.00022866378,0.0010342174,0.00016827454,0.00009405486,0.00015535225,0.00012897124,0.68559444,0.02711233,0.015490702,0.0040323753,0.26555455],"study_design_scores_gemma":[0.00003101993,0.00004555461,0.00008875071,0.0000052996556,0.0000089290115,0.000053147673,0.000008874763,0.9943461,0.0026265997,0.0017632499,0.0010147074,0.000007720174],"about_ca_topic_score_codex":0.0027896452,"about_ca_topic_score_gemma":0.0025121528,"teacher_disagreement_score":0.0027896452,"about_ca_system_score_codex":0.000599118,"about_ca_system_score_gemma":0.0011299293,"threshold_uncertainty_score":0.005734265},"labels":[],"label_agreement":null},{"id":"W2085753475","doi":"10.1002/dac.754","title":"Managing QoS requirements for video streaming: from intra‐node to inter‐node","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Image and Video Quality Assessment","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":"University of British Columbia","funders":"","keywords":"Computer science; Quality of service; Computer network; Network packet; Scheduling (production processes); Mobile QoS; Node (physics); Distributed computing; End-to-end delay; Service provider; Service (business)","score_opus":0.06747430186992791,"score_gpt":0.3834201855370558,"score_spread":0.3159458836671279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085753475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5296489,0.001729716,0.4548261,0.0008882684,0.00015658725,0.00013560573,0.00008169859,0.0010889765,0.011444195],"genre_scores_gemma":[0.97614133,0.00033880348,0.022275552,0.00006488786,0.000045841785,0.000019451125,0.00004787516,0.000036087546,0.0010302337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971086,0.000087090266,0.000016200454,0.000039981504,0.00010978155,0.000036122587],"domain_scores_gemma":[0.9989039,0.00042060707,0.00013354397,0.0001131564,0.0003093918,0.000119534416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078271976,0.00031326982,0.00025228845,0.00025643417,0.00038073616,0.0009544497,0.0006422119,0.00042442494,0.0005952411],"category_scores_gemma":[0.0021342814,0.00016338617,0.00009470162,0.0002370962,0.0003167448,0.00090187456,0.0004527701,0.0005962316,0.00016827704],"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.0009043391,0.0003185237,0.005898888,0.00027440803,0.00006182712,0.0008941942,0.0006251945,0.33403948,0.3153356,0.02405885,0.0056664604,0.31192222],"study_design_scores_gemma":[0.000023299144,0.00015271771,0.002155975,0.000016843505,0.000026173857,0.00018151771,0.00011836547,0.9626719,0.023544323,0.006548081,0.0045396504,0.000021114887],"about_ca_topic_score_codex":0.0025536972,"about_ca_topic_score_gemma":0.0012862398,"teacher_disagreement_score":0.0025536972,"about_ca_system_score_codex":0.00066685356,"about_ca_system_score_gemma":0.00050060754,"threshold_uncertainty_score":0.00507766},"labels":[],"label_agreement":null},{"id":"W2097866586","doi":"10.1002/dac.567","title":"A novel delineation mechanism for the ATM adaptation layer 2 over wireless ATM networks","year":2002,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network 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":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"ATM adaptation layer; Computer science; Computer network; Asynchronous Transfer Mode; Network packet; Payload (computing)","score_opus":0.03892732726751925,"score_gpt":0.26447745864563077,"score_spread":0.22555013137811153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097866586","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.097012125,0.0015762659,0.89139557,0.00043294518,0.0004495066,0.00035717993,0.0001539735,0.004817979,0.003804412],"genre_scores_gemma":[0.7542256,0.00045630036,0.24059094,0.00034086,0.00037232845,0.00024832692,0.00019709297,0.0001708765,0.0033976727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846125,0.0003721639,0.00021713016,0.00033865232,0.00042219544,0.00018863748],"domain_scores_gemma":[0.9955135,0.001233589,0.0010395721,0.0011428848,0.00081805204,0.0002524537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025962007,0.00068944826,0.0006723644,0.00094301254,0.0010369859,0.0019056585,0.002957637,0.001380905,0.0026243113],"category_scores_gemma":[0.005163394,0.00044732165,0.0002955105,0.0008022613,0.0008601008,0.0031312914,0.003232466,0.0015575961,0.0007127064],"study_design_candidate":"theoretical_or_conceptual","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.0017592703,0.00054268126,0.0028355096,0.000478542,0.00009868033,0.0010722012,0.0010943181,0.030385183,0.375008,0.12090539,0.01361179,0.4522084],"study_design_scores_gemma":[0.00048340266,0.0010809888,0.0027951864,0.00011595529,0.00017491603,0.0018174979,0.00018838284,0.6174295,0.2646572,0.02832485,0.08263935,0.00029283317],"about_ca_topic_score_codex":0.00038182043,"about_ca_topic_score_gemma":0.00029545953,"teacher_disagreement_score":0.002957637,"about_ca_system_score_codex":0.0007467481,"about_ca_system_score_gemma":0.0006108144,"threshold_uncertainty_score":0.013730168},"labels":[],"label_agreement":null},{"id":"W2107572007","doi":"10.1002/dac.2952","title":"Exploring the accuracy of capturing snapshots in large‐scale P2P IPTV systems","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Peer-to-Peer Network Technologies","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":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Web crawler; Computer science; IPTV; Focused crawler; Crawling; Overlay network; Peer-to-peer; Server; The Internet; Computer network; World Wide Web; Web server","score_opus":0.13945193238444195,"score_gpt":0.32284527230853616,"score_spread":0.1833933399240942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107572007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9190145,0.00064756605,0.07622242,0.0001635847,0.000072663344,0.000055031767,0.00031632738,0.0013792599,0.002128652],"genre_scores_gemma":[0.99151057,0.000077397766,0.00795688,0.000011565952,0.000007957848,0.0000084663525,0.00024498798,0.000026478492,0.00015583109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986393,0.00024607987,0.000099563214,0.00031092938,0.0005644418,0.00013978059],"domain_scores_gemma":[0.99351126,0.0027928445,0.0006236965,0.0011726528,0.0016673387,0.00023223874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012250801,0.00045905026,0.00046705702,0.0014168122,0.0005096863,0.0010963901,0.0008295189,0.0006129158,0.00034365954],"category_scores_gemma":[0.011009224,0.00026536867,0.00023485172,0.0012906595,0.00037888522,0.0016456518,0.0008073955,0.00063974026,0.00020717648],"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.0008904203,0.0003540539,0.18375821,0.000662273,0.00033015,0.0014523859,0.002100317,0.3799408,0.07991724,0.0039835544,0.004854398,0.34175625],"study_design_scores_gemma":[0.00001262731,0.00018740741,0.04435317,0.000020626861,0.00004324229,0.00032537655,0.0005445691,0.92816687,0.023628008,0.0012231102,0.0014548597,0.000040075272],"about_ca_topic_score_codex":0.0068079676,"about_ca_topic_score_gemma":0.004045216,"teacher_disagreement_score":0.0068079676,"about_ca_system_score_codex":0.00066903955,"about_ca_system_score_gemma":0.00043185084,"threshold_uncertainty_score":0.013536632},"labels":[],"label_agreement":null},{"id":"W2107812461","doi":"10.1002/dac.843","title":"An energy‐efficient multipath routing protocol for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":191,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Multipath routing; Wireless Routing Protocol; Dynamic Source Routing; Routing protocol; Link-state routing protocol; Distributed computing; Zone Routing Protocol; Static routing; Geographic routing; Routing (electronic design automation)","score_opus":0.019162174132068232,"score_gpt":0.3030994055959982,"score_spread":0.28393723146392996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107812461","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.04410677,0.0050741457,0.9437925,0.0007073098,0.00041734226,0.00019331575,0.00018772183,0.0016561623,0.0038647281],"genre_scores_gemma":[0.6637773,0.0031636187,0.32667112,0.00019484393,0.00020749854,0.00036307925,0.0003115323,0.000074140706,0.005236977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997687,0.000055501812,0.000018335348,0.000030155416,0.00010594844,0.00002138288],"domain_scores_gemma":[0.99974066,0.00008184287,0.000055099714,0.000036201225,0.000067883906,0.000018272445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045846406,0.0003533296,0.00033989977,0.00047212883,0.00037975438,0.0004515208,0.000631933,0.00038076847,0.00066298735],"category_scores_gemma":[0.0010152686,0.00014939002,0.00025150622,0.00071660685,0.00025511853,0.00084350276,0.00076013146,0.00041193605,0.00018074419],"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.00036841148,0.000087730004,0.0010711774,0.0006449232,0.00022085207,0.0006914963,0.0002251437,0.25188062,0.110882826,0.06779519,0.01197992,0.5541518],"study_design_scores_gemma":[0.00013230533,0.0005672126,0.00095247856,0.00008557604,0.00020081863,0.001270288,0.00009066404,0.7909783,0.042630944,0.068962745,0.09401857,0.00011004467],"about_ca_topic_score_codex":0.00035463288,"about_ca_topic_score_gemma":0.0006214349,"teacher_disagreement_score":0.00066298735,"about_ca_system_score_codex":0.00027497773,"about_ca_system_score_gemma":0.00039764083,"threshold_uncertainty_score":0.0024245977},"labels":[],"label_agreement":null},{"id":"W2109348731","doi":"10.1002/dac.801","title":"VoIP over WLAN: voice capacity, admission control, QoS, and MAC","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":69,"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; University of Waterloo","funders":"","keywords":"Voice over IP; Computer science; Computer network; Quality of service; Telecommunications; Wireless Multimedia Extensions; The Internet; Wireless; Telephony; Call Admission Control; Wi-Fi; Wireless network; Wi-Fi array; World Wide Web","score_opus":0.01709050806673384,"score_gpt":0.27989059333854804,"score_spread":0.2628000852718142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109348731","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.14103438,0.10256041,0.71823746,0.00372703,0.00077828387,0.00014305898,0.00009425775,0.0011932541,0.032231815],"genre_scores_gemma":[0.9632054,0.012054904,0.020697344,0.00020263226,0.0011887767,0.000057080542,0.00004692309,0.00005034564,0.0024965527],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850804,0.00049510115,0.00006868557,0.00016315194,0.0005720416,0.00019298849],"domain_scores_gemma":[0.9952531,0.0029231347,0.00047267613,0.00025696945,0.00091887405,0.00017521388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028229256,0.00076659,0.00087181665,0.0017900756,0.00070259045,0.0029204616,0.0010847852,0.001066799,0.00095010607],"category_scores_gemma":[0.0080918735,0.00050016824,0.0003111505,0.0018259855,0.0013917688,0.003299581,0.0012198439,0.0018877005,0.00033615116],"study_design_candidate":"not_applicable","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.0007091783,0.0003563285,0.010281701,0.0005359012,0.00021955777,0.00059693964,0.00046239863,0.22893533,0.0284964,0.14244427,0.0055719353,0.5813901],"study_design_scores_gemma":[0.000015302992,0.00012229038,0.0019658718,0.00008544926,0.00009269434,0.00039205092,0.00014246305,0.9604352,0.006201434,0.025150012,0.0053295996,0.00006761392],"about_ca_topic_score_codex":0.0034206128,"about_ca_topic_score_gemma":0.0014901458,"teacher_disagreement_score":0.0034206128,"about_ca_system_score_codex":0.0020303975,"about_ca_system_score_gemma":0.00088092766,"threshold_uncertainty_score":0.014929235},"labels":[],"label_agreement":null},{"id":"W2111771483","doi":"10.1002/dac.547","title":"A slotted multicode CDMA protocol for efficient integration of voice and data in cellular networks","year":2002,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","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":"University of Alberta","funders":"","keywords":"Computer science; Code division multiple access; Computer network; Bandwidth (computing); Quality of service; Cellular network; Cellular communication; Channel (broadcasting); Base station","score_opus":0.11902447512541806,"score_gpt":0.39095970765413673,"score_spread":0.27193523252871865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111771483","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.079289936,0.0034266892,0.91067636,0.00033711334,0.0004873376,0.00026990447,0.000049063336,0.001227749,0.0042358274],"genre_scores_gemma":[0.6586073,0.0011835945,0.33403832,0.00019678943,0.00030981578,0.00038272963,0.00012069842,0.0000739868,0.0050867796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994331,0.00021948693,0.000035316094,0.00004800264,0.00020874634,0.000055390297],"domain_scores_gemma":[0.99920446,0.0003319693,0.000060686813,0.00015022939,0.00019457542,0.00005809805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011776581,0.0002599759,0.00028798744,0.0005552944,0.00052889384,0.00094424386,0.00078902533,0.00053468545,0.0010187096],"category_scores_gemma":[0.0019917246,0.00024180548,0.00018297466,0.00042477893,0.0006728073,0.0009582366,0.0009088945,0.00069197005,0.00024314172],"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.0010804593,0.0002917752,0.0012966383,0.0004293082,0.00012879024,0.00088202977,0.0005251728,0.06593549,0.21564914,0.14247428,0.009161085,0.5621458],"study_design_scores_gemma":[0.0002927382,0.00074570504,0.0006308099,0.000060161397,0.00011853789,0.00086640066,0.000082847066,0.86330247,0.061464727,0.02154611,0.050812494,0.00007699797],"about_ca_topic_score_codex":0.00041585395,"about_ca_topic_score_gemma":0.0007198722,"teacher_disagreement_score":0.0011776581,"about_ca_system_score_codex":0.0003818705,"about_ca_system_score_gemma":0.0005944615,"threshold_uncertainty_score":0.0062280893},"labels":[],"label_agreement":null},{"id":"W2116019326","doi":"10.1002/dac.660","title":"Asymptotic performance comparison of concatenated (turbo) codes over<i>GF</i>(4)","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Turbo code; Concatenated error correction code; Serial concatenated convolutional codes; Computer science; Convolutional code; Linear code; Encoder; Additive white Gaussian noise; Algorithm; Block code; Reed–Solomon error correction; Theoretical computer science; Decoding methods; Telecommunications; White noise","score_opus":0.018660386960062766,"score_gpt":0.30341600115085254,"score_spread":0.28475561419078976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116019326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88595957,0.00090374873,0.107326165,0.00013598845,0.000036678088,0.00002912565,0.00009684349,0.00038117668,0.005130656],"genre_scores_gemma":[0.9886318,0.00017437432,0.010591439,0.000014381945,0.000008619869,0.000011580975,0.00007258724,0.000014573988,0.0004805508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866307,0.00032841688,0.0000728329,0.00010886329,0.00063717784,0.00018968884],"domain_scores_gemma":[0.9916045,0.0043133325,0.0010898275,0.0006794968,0.0020722733,0.00024052238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016970793,0.0005797838,0.000517653,0.00076426397,0.00043388226,0.0007446901,0.0006474831,0.0007672851,0.0009109301],"category_scores_gemma":[0.011456483,0.0002074825,0.00033791063,0.00077654346,0.0009679875,0.000959117,0.00094097614,0.00043108317,0.0002606142],"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.0010200449,0.000060475326,0.009157817,0.00010932833,0.00013278631,0.00023213447,0.00012226538,0.91734,0.029215842,0.010485805,0.00027275982,0.03185077],"study_design_scores_gemma":[0.000014638827,0.00040889034,0.0019026985,0.000028399767,0.000048276885,0.00023799298,0.000034838857,0.9571277,0.03711998,0.0027288294,0.00032095838,0.000026809264],"about_ca_topic_score_codex":0.0031936592,"about_ca_topic_score_gemma":0.0027307787,"teacher_disagreement_score":0.0031936592,"about_ca_system_score_codex":0.0012293672,"about_ca_system_score_gemma":0.0015320772,"threshold_uncertainty_score":0.008975089},"labels":[],"label_agreement":null},{"id":"W2119264949","doi":"10.1002/dac.2922","title":"Analysis of priority arbitration in low‐rate CSMA/CA‐based differentiated access with throughput optimization","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Networks and Protocols","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 Calgary","funders":"","keywords":"Computer science; Throughput; Network packet; Computer network; Random access; Exponential backoff; Access control; Carrier sense multiple access with collision avoidance; Distributed computing; Wireless","score_opus":0.023486432191724943,"score_gpt":0.31483530625229444,"score_spread":0.29134887406056953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119264949","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.1826329,0.0013699556,0.79619986,0.0007769192,0.00010759203,0.00016516326,0.000094655705,0.00028177488,0.018371228],"genre_scores_gemma":[0.9838689,0.00023687334,0.013449398,0.000048885915,0.000021140617,0.000040078037,0.00001861173,0.000026976904,0.0022891976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842525,0.00052318716,0.00003561753,0.00012041789,0.00051152246,0.0003840433],"domain_scores_gemma":[0.99340147,0.0049052313,0.00048844464,0.0001554803,0.0008727699,0.00017657671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036873291,0.00088083785,0.000832014,0.0010024828,0.00063503266,0.0016542367,0.0012638728,0.0007470246,0.0021711797],"category_scores_gemma":[0.008361051,0.0004652512,0.0005350949,0.00081913907,0.0015934933,0.00094500167,0.0008314597,0.0011399993,0.00019790945],"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.00013353878,0.000050616185,0.00056532846,0.00005651972,0.000024052077,0.00007579442,0.00007170537,0.94909626,0.00308955,0.041211702,0.00044921594,0.005175639],"study_design_scores_gemma":[0.000003027074,0.00001120333,0.000051579816,0.000002567942,0.0000043703494,0.0000054754555,0.000006529687,0.9983004,0.00024940525,0.0013091365,0.000053745327,0.0000025547074],"about_ca_topic_score_codex":0.01018438,"about_ca_topic_score_gemma":0.0044930982,"teacher_disagreement_score":0.01018438,"about_ca_system_score_codex":0.0044882866,"about_ca_system_score_gemma":0.0025758112,"threshold_uncertainty_score":0.032564998},"labels":[],"label_agreement":null},{"id":"W2121612881","doi":"10.1002/dac.1180","title":"Downlink multiple access schemes for transmitted reference pulse cluster UWB systems","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":9,"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":"Time division multiple access; Code division multiple access; Computer science; Telecommunications link; Throughput; Computer network; Bit error rate; Electronic engineering; Telecommunications; Wireless; Engineering","score_opus":0.02743012257431803,"score_gpt":0.30316882548329954,"score_spread":0.2757387029089815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121612881","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.2658949,0.0012565092,0.7186083,0.0004693468,0.00010854717,0.00016879299,0.0001111921,0.0006989653,0.012683482],"genre_scores_gemma":[0.9553326,0.00023562067,0.04166986,0.00012007525,0.00006019807,0.00006798475,0.000072428214,0.000010706651,0.002430484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954504,0.00014105834,0.00002029529,0.000059359714,0.00015079239,0.00008342149],"domain_scores_gemma":[0.99898905,0.00027591514,0.00012130748,0.00016806545,0.0003932571,0.00005240208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067118375,0.00035929898,0.0003608925,0.00047610517,0.00061147724,0.0007686796,0.0008215573,0.0005533398,0.0016431357],"category_scores_gemma":[0.0015406338,0.00015221462,0.00017479966,0.000471782,0.0003403221,0.00039375536,0.000815406,0.0005671708,0.0004050794],"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.0014320151,0.0002747681,0.0028919831,0.00044215578,0.00013491203,0.0008667853,0.0009199007,0.1579301,0.2390001,0.12536366,0.00563248,0.4651111],"study_design_scores_gemma":[0.00012475233,0.00049736584,0.00077408383,0.00003086241,0.00006908775,0.0007071753,0.00012457163,0.93788904,0.042997032,0.008893741,0.007837965,0.00005430559],"about_ca_topic_score_codex":0.0011868554,"about_ca_topic_score_gemma":0.001241435,"teacher_disagreement_score":0.0016431357,"about_ca_system_score_codex":0.0006840191,"about_ca_system_score_gemma":0.0006095826,"threshold_uncertainty_score":0.0054968},"labels":[],"label_agreement":null},{"id":"W2128124921","doi":"10.1002/dac.596","title":"In‐building power lines as high‐speed communication channels: channel characterization and a test channel ensemble","year":2003,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":208,"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 Toronto","funders":"","keywords":"Power-line communication; Channel (broadcasting); Computer science; Power (physics); Line (geometry); Telecommunications; Measure (data warehouse); Noise (video); Electric power transmission; Electronic engineering; Electrical engineering; Physics; Engineering","score_opus":0.017186808450176283,"score_gpt":0.26758372757317717,"score_spread":0.2503969191230009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128124921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6949713,0.000072316034,0.30138806,0.00013189318,0.00001667366,0.000044911383,0.00013387567,0.00033928434,0.0029018163],"genre_scores_gemma":[0.9941614,0.000042534004,0.005187448,0.000012737258,0.000010116373,0.000023288181,0.00007557787,0.000014300576,0.0004724698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999353,0.00029948135,0.00001447339,0.00007550866,0.00017321514,0.00008434831],"domain_scores_gemma":[0.9968792,0.0014786737,0.0004537915,0.0005975909,0.00046029896,0.00013040086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007440669,0.0006364129,0.00043046847,0.00036636318,0.000440554,0.0007828574,0.0006811452,0.00065702526,0.00093929743],"category_scores_gemma":[0.0026145445,0.00016261124,0.00026385847,0.00037842177,0.00089600735,0.0011555398,0.00039765393,0.0005459561,0.00015290183],"study_design_candidate":"bench_or_experimental","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.00025584438,0.00015977355,0.006023785,0.00003344041,0.000034845292,0.00018990433,0.000079605656,0.9488841,0.019711554,0.01496904,0.00059763546,0.009060547],"study_design_scores_gemma":[0.000006535963,0.000045208602,0.00037121872,0.0000012946263,0.00000550587,0.00003597805,0.0000118065345,0.9928954,0.0045234696,0.0019800144,0.000117748314,0.0000057639536],"about_ca_topic_score_codex":0.0022764024,"about_ca_topic_score_gemma":0.0013406223,"teacher_disagreement_score":0.0022764024,"about_ca_system_score_codex":0.0004316202,"about_ca_system_score_gemma":0.00039112402,"threshold_uncertainty_score":0.004526317},"labels":[],"label_agreement":null},{"id":"W2130163719","doi":"10.1002/dac.778","title":"Layered view of QoS issues in IP‐based mobile wireless networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer network; Computer science; Wireless network; Quality of service; Wireless WAN; Internet Protocol; Mobile QoS; Protocol stack; IP tunnel; Mobile IP; Wireless; Municipal wireless network; Wi-Fi array; The Internet; Telecommunications; Service provider; Mobile computing; Service (business); Wireless sensor network","score_opus":0.009446503300772034,"score_gpt":0.26236667705775313,"score_spread":0.2529201737569811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130163719","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.036864895,0.04030725,0.8505382,0.009195777,0.0012463403,0.00007762819,0.00008300767,0.0003900616,0.061296865],"genre_scores_gemma":[0.8365667,0.024039965,0.12552558,0.0009094793,0.0020820193,0.00014350898,0.00006958402,0.00009014095,0.0105730295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853444,0.00052745594,0.00010198787,0.00010158484,0.000534204,0.00020021782],"domain_scores_gemma":[0.99767846,0.0011073897,0.00025341078,0.00021210188,0.0005743652,0.00017425041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019837779,0.00069743895,0.000514695,0.0008064532,0.0008440977,0.0045731175,0.0012115776,0.0012088289,0.0014761104],"category_scores_gemma":[0.004214315,0.0005937803,0.0004242795,0.0009257707,0.0022812039,0.0052083274,0.0017374603,0.0028738969,0.00037395227],"study_design_candidate":"not_applicable","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.00003457541,0.00002497406,0.0005159349,0.00021048056,0.000031717136,0.00066442735,0.00083272916,0.026152758,0.0044747493,0.9354693,0.0026827557,0.028905526],"study_design_scores_gemma":[0.000013382917,0.000053767893,0.00051901175,0.00028310352,0.00008718049,0.00088982884,0.0005367345,0.20841672,0.0030763468,0.71963954,0.06641444,0.000069914066],"about_ca_topic_score_codex":0.0016577471,"about_ca_topic_score_gemma":0.0011130102,"teacher_disagreement_score":0.0045731175,"about_ca_system_score_codex":0.0016263864,"about_ca_system_score_gemma":0.0006016326,"threshold_uncertainty_score":0.011800349},"labels":[],"label_agreement":null},{"id":"W2138374511","doi":"10.1002/dac.1384","title":"Energy‐efficient and localized lossy data aggregation in asynchronous sensor networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":10,"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 Ottawa","funders":"","keywords":"Computer science; Data aggregator; Wireless sensor network; Lossy compression; Asynchronous communication; Greedy algorithm; Redundancy (engineering); Scheduling (production processes); Algorithm; Mathematical optimization; Computer network; Mathematics; Artificial intelligence","score_opus":0.02573609463186236,"score_gpt":0.27848137480385937,"score_spread":0.252745280171997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138374511","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.16476077,0.00031898185,0.8334042,0.0001532812,0.00003644006,0.000029720584,0.00003273545,0.00034239108,0.00092157314],"genre_scores_gemma":[0.9370579,0.000102787264,0.062159855,0.000031800762,0.00002502313,0.000035596357,0.00003198118,0.000022238188,0.0005327442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993863,0.00018448083,0.000035148896,0.00010873569,0.00022790684,0.00005737667],"domain_scores_gemma":[0.9982626,0.00083708245,0.00031053624,0.00028525747,0.00023603544,0.000068536254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012338861,0.00038121286,0.00042772765,0.000412246,0.00046830735,0.00050847826,0.00084655965,0.00024361999,0.00033862834],"category_scores_gemma":[0.0027897193,0.00018478862,0.00018676296,0.0004803432,0.00044838357,0.000884442,0.0006882331,0.00033959467,0.00010689072],"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.00067478843,0.00016537553,0.0050484836,0.00012445661,0.00004921713,0.00021943494,0.0002227762,0.7816275,0.060250293,0.010795261,0.0014977476,0.13932475],"study_design_scores_gemma":[0.000014230404,0.000078472985,0.0006882401,0.0000032304865,0.0000080376485,0.000040232957,0.000019029496,0.9881441,0.0073831333,0.0031595977,0.00045656398,0.0000052692635],"about_ca_topic_score_codex":0.0008109412,"about_ca_topic_score_gemma":0.0010617771,"teacher_disagreement_score":0.0012338861,"about_ca_system_score_codex":0.00044978427,"about_ca_system_score_gemma":0.00040400884,"threshold_uncertainty_score":0.0065255165},"labels":[],"label_agreement":null},{"id":"W2143583144","doi":"10.1002/dac.497","title":"The distributed robust traffic controller for ATM networks","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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":"Queen's University; University of Ottawa","funders":"","keywords":"Computer science; Bottleneck; Controller (irrigation); Computer network; Service (business); Simple (philosophy); Distributed computing; Real-time computing; Embedded system","score_opus":0.01999383123973367,"score_gpt":0.2597530269638197,"score_spread":0.23975919572408602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143583144","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.008593988,0.00035691867,0.9877698,0.00012701744,0.0001359946,0.00004079184,0.000028510447,0.0008778905,0.0020691562],"genre_scores_gemma":[0.841969,0.00027082913,0.15354216,0.00018345377,0.00021811368,0.00019344343,0.00008584703,0.00008117702,0.0034559767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928445,0.00013219415,0.000029660223,0.00019137474,0.00030694174,0.00005536014],"domain_scores_gemma":[0.9995691,0.00011143406,0.0000643184,0.000070553906,0.00015880082,0.000025675237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075306353,0.0005294916,0.00056271796,0.0003293495,0.0003232161,0.00077796105,0.0012748969,0.00071397156,0.0018381455],"category_scores_gemma":[0.0012702389,0.00018319322,0.0003696985,0.00026562813,0.00062547304,0.00055740436,0.00058155734,0.0009844182,0.00048456702],"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.00021372663,0.00012240022,0.00031659583,0.00015248389,0.00009354316,0.00018374571,0.00006267829,0.6986738,0.061163753,0.06454036,0.0036028335,0.17087412],"study_design_scores_gemma":[0.000045264325,0.000071479124,0.000051330935,0.0000042558754,0.000012476641,0.00003170591,0.0000023208606,0.9872177,0.004663288,0.0057348427,0.0021578686,0.000007540745],"about_ca_topic_score_codex":0.00082752743,"about_ca_topic_score_gemma":0.0005793748,"teacher_disagreement_score":0.0018381455,"about_ca_system_score_codex":0.0005850959,"about_ca_system_score_gemma":0.0006223269,"threshold_uncertainty_score":0.0061492324},"labels":[],"label_agreement":null},{"id":"W2153965103","doi":"10.1002/dac.2315","title":"DDRP: An efficient data‐driven routing protocol for wireless sensor networks with mobile sinks","year":2012,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":71,"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 Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Network packet; Wireless Routing Protocol; Wireless sensor network; Source routing; Distributed computing; Triangular routing; Sink (geography); Packet forwarding","score_opus":0.050967564739665065,"score_gpt":0.34430685813587275,"score_spread":0.2933392933962077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153965103","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.013008538,0.0012344711,0.9808121,0.0003427249,0.00024420614,0.0001972998,0.000107667496,0.0021017613,0.0019511643],"genre_scores_gemma":[0.44937482,0.002608471,0.5367816,0.0005123959,0.00019037626,0.0008772789,0.0010091093,0.0003190257,0.008326796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994236,0.00017827441,0.000069238406,0.00006509689,0.00022772068,0.000036155383],"domain_scores_gemma":[0.9994748,0.00016614431,0.00007985471,0.00009057107,0.00015105843,0.000037557584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010797353,0.0004374295,0.0006641001,0.0007684409,0.00038912336,0.00070544024,0.0012816088,0.0006621144,0.0007367883],"category_scores_gemma":[0.0016767954,0.00035568676,0.00040045625,0.0005301499,0.00048627137,0.0012062042,0.0011664946,0.0007211074,0.00041481724],"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.00069058966,0.00020614428,0.0013934672,0.0011435135,0.00025768796,0.00083164446,0.00050584425,0.19713108,0.12522653,0.06103051,0.021450358,0.59013253],"study_design_scores_gemma":[0.00022690897,0.0005660784,0.00063512265,0.00008076689,0.00012016937,0.0009302859,0.00006688177,0.84302866,0.051190488,0.020549236,0.08246926,0.00013617752],"about_ca_topic_score_codex":0.00035736326,"about_ca_topic_score_gemma":0.00050520996,"teacher_disagreement_score":0.0012816088,"about_ca_system_score_codex":0.00032874657,"about_ca_system_score_gemma":0.00053504563,"threshold_uncertainty_score":0.005710244},"labels":[],"label_agreement":null},{"id":"W2159329951","doi":"10.1002/dac.678","title":"Effects of control loop delay on the stability of a rate control algorithm","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Stability (learning theory); Control theory (sociology); Loop (graph theory); Computer science; Upper and lower bounds; Control (management); Control system; Domain (mathematical analysis); Process (computing); Mathematics; Mathematical analysis; Engineering","score_opus":0.0106927413827747,"score_gpt":0.24106763613643384,"score_spread":0.23037489475365913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159329951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54253334,0.0009674297,0.44514155,0.0004104313,0.00008520672,0.00007656097,0.00003573397,0.0003570418,0.010392754],"genre_scores_gemma":[0.9957419,0.000086239364,0.003779411,0.000016724453,0.0000072898906,0.000011702884,0.00000510174,0.000013197568,0.0003383745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990476,0.00028221394,0.000040084666,0.00013423986,0.0003372129,0.00015863004],"domain_scores_gemma":[0.98952544,0.0085197985,0.0006498454,0.00042427104,0.0007783274,0.000102298276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020572464,0.0004938622,0.0006553286,0.000493075,0.00046037498,0.0011680033,0.00041139722,0.00070278096,0.0016782449],"category_scores_gemma":[0.013406995,0.00022873098,0.00034306786,0.00016878419,0.0011794706,0.0008985607,0.0008628194,0.0007875027,0.00013791096],"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.000630842,0.000056206816,0.0012861912,0.00012538955,0.00003520702,0.00023452967,0.00021523498,0.9280931,0.029204123,0.022226613,0.00015644707,0.017736156],"study_design_scores_gemma":[0.000018612194,0.0001104765,0.00020322239,0.000008659743,0.000007759546,0.000038004124,0.000014909407,0.99205106,0.005501807,0.00189241,0.00014435769,0.000008821669],"about_ca_topic_score_codex":0.0017676557,"about_ca_topic_score_gemma":0.0006189918,"teacher_disagreement_score":0.0020572464,"about_ca_system_score_codex":0.00084850146,"about_ca_system_score_gemma":0.0006830765,"threshold_uncertainty_score":0.010879874},"labels":[],"label_agreement":null},{"id":"W2159834749","doi":"10.1002/dac.2719","title":"Performance analysis of multi‐input multi‐output systems with maximum likelihood detection over shadowed fading channels","year":2013,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Telus (Canada); McGill University","funders":"","keywords":"Fading; MIMO; Pairwise error probability; Rayleigh fading; Computer science; Spatial correlation; Log-normal distribution; Bit error rate; Algorithm; Channel (broadcasting); Channel state information; Weibull fading; Maximal-ratio combining; Statistics; Mathematics; Telecommunications; Wireless","score_opus":0.015332061759389969,"score_gpt":0.24685940336146922,"score_spread":0.23152734160207925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159834749","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.27381104,0.0015292712,0.7170201,0.00038303112,0.000038174527,0.000043894088,0.000115244446,0.0002964034,0.006762862],"genre_scores_gemma":[0.98868424,0.0002550014,0.010329053,0.0000316993,0.000022204982,0.000021576676,0.000030901385,0.000012339242,0.00061315007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980026,0.00084181206,0.00006932621,0.00018662555,0.00061637815,0.000283216],"domain_scores_gemma":[0.9918794,0.0058790892,0.0008419097,0.00036662226,0.00090662896,0.00012632579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023959933,0.00091259246,0.0007793991,0.00060167414,0.00039241178,0.0011730621,0.00052799174,0.00082538335,0.0009884994],"category_scores_gemma":[0.009177098,0.00035007313,0.00039858793,0.000636911,0.0009615398,0.0010904092,0.0013449808,0.0006165842,0.00022936802],"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.0002053392,0.000025737836,0.0018713106,0.000095005984,0.00006126845,0.00014182607,0.00011987433,0.97239536,0.004316099,0.008087775,0.00018887784,0.012491387],"study_design_scores_gemma":[0.000005403729,0.00005847772,0.00059532875,0.000009398413,0.000013249778,0.000062315434,0.000021077893,0.99573153,0.0015749695,0.0018399016,0.00007805649,0.000010307519],"about_ca_topic_score_codex":0.0020834713,"about_ca_topic_score_gemma":0.0010967321,"teacher_disagreement_score":0.0023959933,"about_ca_system_score_codex":0.0011532892,"about_ca_system_score_gemma":0.0009019266,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2170740812","doi":"10.1002/dac.536","title":"DRED: a random early detection algorithm for TCP/IP networks","year":2002,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Random early detection; Queue; Computer network; Router; Network packet; TCP Friendly Rate Control; Active queue management; TCP global synchronization; Network congestion","score_opus":0.016738966176609523,"score_gpt":0.24251978321629125,"score_spread":0.22578081703968172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170740812","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.00856091,0.0004193054,0.9846972,0.00015977616,0.000098725555,0.00010305983,0.000065318425,0.005363527,0.000532211],"genre_scores_gemma":[0.2114199,0.00026078892,0.783824,0.00026927417,0.00009500129,0.0003694781,0.00032411152,0.00027568598,0.0031617023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989279,0.00031256664,0.00009135659,0.00021103118,0.00033758435,0.00011952977],"domain_scores_gemma":[0.9970682,0.0015899739,0.0003189851,0.0003398371,0.00052696426,0.0001560999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028341182,0.00086952525,0.0011738228,0.0020154112,0.00060514844,0.0011127848,0.0033046706,0.0012514163,0.0025275538],"category_scores_gemma":[0.0076966956,0.00062253245,0.0004194577,0.0008441407,0.0006772998,0.0017428393,0.0016426469,0.0016448817,0.0010301915],"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.0012736348,0.00028017856,0.0022014834,0.00027778273,0.00011160006,0.00019015845,0.00015236314,0.23159087,0.012773321,0.01625494,0.010954391,0.7239393],"study_design_scores_gemma":[0.00013181065,0.00007294572,0.00013150366,0.000010399628,0.000013025533,0.000052600793,0.0000073114998,0.9890324,0.0037543743,0.004512863,0.0022631283,0.00001762842],"about_ca_topic_score_codex":0.001768451,"about_ca_topic_score_gemma":0.0015207488,"teacher_disagreement_score":0.0033046706,"about_ca_system_score_codex":0.0009983401,"about_ca_system_score_gemma":0.0011535293,"threshold_uncertainty_score":0.014988422},"labels":[],"label_agreement":null},{"id":"W2171555797","doi":"10.1002/dac.2989","title":"An energy‐efficient history‐based routing scheme for opportunistic networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":29,"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; Energy consumption; Computer network; Overhead (engineering); Routing protocol; Routing (electronic design automation); Network packet; Energy (signal processing); Efficient energy use; Bandwidth (computing); Electrical engineering; Mathematics; Statistics","score_opus":0.09001436105111163,"score_gpt":0.3074328118247264,"score_spread":0.2174184507736148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171555797","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.12283391,0.0016152443,0.8619597,0.0006389106,0.00028037865,0.00023979676,0.00023521094,0.0013714153,0.010825441],"genre_scores_gemma":[0.94328904,0.0004057896,0.052215546,0.00010942551,0.000058943886,0.00009032906,0.00019504415,0.00003118689,0.003604785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970406,0.000067059875,0.000023468097,0.00005347336,0.0001058717,0.00004603115],"domain_scores_gemma":[0.99941635,0.00019947009,0.00008932917,0.00012596294,0.00011376286,0.000055119886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055829075,0.00038216854,0.00044323454,0.0007901163,0.000735847,0.00048168923,0.0015273091,0.00045211735,0.0012879419],"category_scores_gemma":[0.0014094226,0.0002001325,0.00029465498,0.00052332657,0.00039947708,0.0011383661,0.0012411707,0.0004187466,0.00020998878],"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.0008346321,0.00028117906,0.004044315,0.00042249,0.00014758133,0.0008889045,0.00060115097,0.33792627,0.05945435,0.08438591,0.010795222,0.50021803],"study_design_scores_gemma":[0.000054062606,0.00021139476,0.0010425308,0.000032128264,0.000052904717,0.0003572051,0.00009520851,0.9630519,0.009011274,0.01747119,0.008554678,0.00006544072],"about_ca_topic_score_codex":0.0025330228,"about_ca_topic_score_gemma":0.0035078295,"teacher_disagreement_score":0.0025330228,"about_ca_system_score_codex":0.0005134022,"about_ca_system_score_gemma":0.00080925913,"threshold_uncertainty_score":0.005036533},"labels":[],"label_agreement":null},{"id":"W2251202461","doi":"","title":"QoS routing through alternate paths in wireless ad hoc networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","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":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Quality of service; Adaptive quality of service multi-hop routing; Distributed computing; Wireless ad hoc network; Routing protocol; Overhead (engineering); Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.0642016965399944,"score_gpt":0.3572156189492834,"score_spread":0.293013922409289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251202461","genre_codex":"review","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.025537783,0.56259066,0.3416385,0.010269302,0.0071332008,0.00021105839,0.000120715864,0.0006225475,0.051876206],"genre_scores_gemma":[0.16238958,0.61576337,0.1655884,0.0011931454,0.009412871,0.00019143605,0.0003971303,0.0002681522,0.044796035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938846,0.0001408005,0.000046903187,0.00007814444,0.000303885,0.000041687923],"domain_scores_gemma":[0.99818546,0.00091555226,0.00007767457,0.0000816224,0.0006236778,0.00011600439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013760875,0.0006451027,0.00060158444,0.0014123854,0.00062372204,0.0023821385,0.0007446379,0.0012778151,0.0033655935],"category_scores_gemma":[0.0023131103,0.00037196846,0.00024406498,0.0037118718,0.0009656823,0.002744188,0.00052904105,0.000919212,0.0010785408],"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.00013797972,0.00015733122,0.00092069816,0.0018952764,0.00005360057,0.00035815078,0.00039195476,0.016620137,0.006875856,0.10758269,0.028551012,0.8364554],"study_design_scores_gemma":[0.00007439793,0.00048014466,0.0013314388,0.0010600664,0.00014836645,0.0025911387,0.0006278104,0.10100108,0.0064518047,0.14901438,0.7371409,0.000078573205],"about_ca_topic_score_codex":0.00093088445,"about_ca_topic_score_gemma":0.00076649437,"teacher_disagreement_score":0.0033655935,"about_ca_system_score_codex":0.0007677166,"about_ca_system_score_gemma":0.0009095654,"threshold_uncertainty_score":0.011259079},"labels":[],"label_agreement":null},{"id":"W2255026155","doi":"10.1002/dac.3119","title":"Topology evolution model for ad hoc‐cellular hybrid networks based on complex network theory","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","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":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Computer network; Network topology; Distributed computing; Network formation; Robustness (evolution); Optimized Link State Routing Protocol; Topology (electrical circuits); Network simulation; Vehicular ad hoc network; Average path length; Network performance; Routing protocol; Routing (electronic design automation); Shortest path problem; Wireless; Telecommunications; Network packet; Theoretical computer science","score_opus":0.055293824034620825,"score_gpt":0.306596300359632,"score_spread":0.2513024763250111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255026155","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.06037322,0.00074330467,0.923646,0.0007356081,0.00012155112,0.000074751835,0.00015334527,0.00013444248,0.014017862],"genre_scores_gemma":[0.9669971,0.0010840397,0.02216468,0.00011222411,0.00006942814,0.00021036161,0.00017194154,0.00003488068,0.009155373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997204,0.00007462685,0.0000115036855,0.00006434998,0.00009359296,0.00003545808],"domain_scores_gemma":[0.9996381,0.00014878418,0.00007005209,0.000023651319,0.00008689213,0.00003248018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003695523,0.00044643792,0.00045907652,0.0006462883,0.0005704951,0.0009336504,0.0009916074,0.00074342225,0.001298512],"category_scores_gemma":[0.0011114003,0.00024535615,0.00058214046,0.00058540795,0.00065895426,0.0013215377,0.0006116524,0.00084058294,0.00019605998],"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.000013950218,0.000015647809,0.00059810677,0.000023907094,0.000023391602,0.00013706915,0.00006698494,0.93007463,0.0010829761,0.06287694,0.0007148965,0.0043715257],"study_design_scores_gemma":[0.000002396011,0.000006459255,0.0000913249,0.0000015327026,0.0000038494054,0.00001677608,0.000007838234,0.9933356,0.000046136272,0.0061342004,0.0003503592,0.000003392135],"about_ca_topic_score_codex":0.007236682,"about_ca_topic_score_gemma":0.0031983424,"teacher_disagreement_score":0.007236682,"about_ca_system_score_codex":0.001191881,"about_ca_system_score_gemma":0.00056788424,"threshold_uncertainty_score":0.014389157},"labels":[],"label_agreement":null},{"id":"W2263788477","doi":"","title":"Relative loss rate differentiation: performance of short-lived TCP flows: Research Articles","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Random early detection; Active queue management; Computer science; TCP global synchronization; Quality of service; Queue; Computer network; FIFO (computing and electronics); Network congestion; TCP Friendly Rate Control; Packet loss; Service (business); Network packet; Business","score_opus":0.06447415236854175,"score_gpt":0.3341904322481575,"score_spread":0.2697162798796157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263788477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7064816,0.06412198,0.21574216,0.0012380448,0.0004733027,0.00009696229,0.0001645086,0.0013458383,0.010335629],"genre_scores_gemma":[0.9763224,0.006740033,0.014613346,0.00006323154,0.00015299502,0.000011803775,0.00009684787,0.0000647724,0.0019344284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890804,0.00026050975,0.00006503806,0.00016962527,0.00047932466,0.00011745499],"domain_scores_gemma":[0.99189126,0.0040979125,0.00075992383,0.0008350597,0.0019989198,0.00041686682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030695377,0.00063773256,0.0007557311,0.0007662497,0.00036518683,0.0014649754,0.0010127622,0.0009469394,0.001566683],"category_scores_gemma":[0.008073775,0.0003124162,0.00021620572,0.0015009729,0.0009097609,0.0027710802,0.00061940664,0.0011173397,0.0004442565],"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.002644422,0.0007721863,0.015782043,0.00092653086,0.00020868455,0.0005076868,0.0008958432,0.38839155,0.08633454,0.025546553,0.0040201396,0.47396982],"study_design_scores_gemma":[0.00008926191,0.0013747098,0.0056081847,0.0001274599,0.00009919707,0.0006114966,0.0001378274,0.93385965,0.03742553,0.014622899,0.005957077,0.00008674959],"about_ca_topic_score_codex":0.001865384,"about_ca_topic_score_gemma":0.0006199329,"teacher_disagreement_score":0.0030695377,"about_ca_system_score_codex":0.00080315245,"about_ca_system_score_gemma":0.00054302724,"threshold_uncertainty_score":0.016233444},"labels":[],"label_agreement":null},{"id":"W2280239358","doi":"10.1002/dac.3092","title":"Mobile internet: content, security and terminal","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Terminal (telecommunication); Mobile internet; Computer network; Computer security; The Internet; Internet privacy; Telecommunications; World Wide Web","score_opus":0.06405320741582149,"score_gpt":0.2985422041771983,"score_spread":0.2344889967613768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280239358","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022126902,0.15600292,0.41485655,0.041469976,0.013090543,0.00080417236,0.00085897936,0.0025183635,0.34827155],"genre_scores_gemma":[0.4259124,0.1520608,0.22417012,0.009158441,0.019263176,0.0009042984,0.0016105695,0.0010066386,0.1659135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833906,0.00044040626,0.00008748202,0.00017158377,0.00084527646,0.000116227784],"domain_scores_gemma":[0.99845505,0.0004651186,0.00014309245,0.00020026816,0.0005302347,0.00020628217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010270787,0.00092198554,0.00077171414,0.0029031343,0.001382505,0.008131087,0.0010598126,0.003025691,0.0062368717],"category_scores_gemma":[0.0042288518,0.0005666785,0.00041322192,0.0039713,0.002526529,0.010135988,0.003027832,0.0023919835,0.0029603213],"study_design_candidate":"not_applicable","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.00005221978,0.00005016547,0.0008335423,0.0006427527,0.000026648473,0.000321023,0.00059848634,0.0038539593,0.0031193336,0.52521455,0.08235316,0.38293424],"study_design_scores_gemma":[0.000013761227,0.0001227221,0.001545656,0.00073031813,0.000042762607,0.0023289504,0.0007587885,0.022025917,0.0017220401,0.17764026,0.79296434,0.00010454777],"about_ca_topic_score_codex":0.0015941801,"about_ca_topic_score_gemma":0.0011849891,"teacher_disagreement_score":0.008131087,"about_ca_system_score_codex":0.0017213844,"about_ca_system_score_gemma":0.0013436998,"threshold_uncertainty_score":0.020864427},"labels":[],"label_agreement":null},{"id":"W2290326887","doi":"10.1002/dac.3088","title":"Adaptive video protection in large scale peer‐to‐peer video streaming over mobile wireless mesh networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"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; Scalability; Wireless mesh network; Computer network; Wireless network; Video quality; Overhead (engineering); Wireless; Peer-to-peer; Mobile device; Real-time computing; Telecommunications","score_opus":0.04656327868252468,"score_gpt":0.3165459383941295,"score_spread":0.2699826597116048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290326887","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.23443948,0.000925336,0.76208436,0.00014691183,0.00006408598,0.000069475165,0.00002818647,0.00046493867,0.0017773035],"genre_scores_gemma":[0.95939857,0.00014553226,0.03995389,0.00002537306,0.000021015816,0.000016853734,0.000021585238,0.000016277441,0.0004009142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997069,0.000101874575,0.000015066707,0.000045287437,0.0000995064,0.00003131072],"domain_scores_gemma":[0.9992217,0.00044550654,0.00008665142,0.00010067973,0.00011914695,0.00002635332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103718,0.0002555246,0.0002836231,0.00033164237,0.00027988042,0.00025229086,0.00056930335,0.00035557844,0.0004155316],"category_scores_gemma":[0.0018135468,0.00008945633,0.00017082455,0.00022907976,0.00029344528,0.0005555252,0.00042909576,0.00030731384,0.00009077236],"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.0007236463,0.00015899325,0.0036763973,0.00025151984,0.00012339946,0.00077788957,0.00031915543,0.37848404,0.26216945,0.010360358,0.0015642183,0.341391],"study_design_scores_gemma":[0.000025069476,0.00017937282,0.0009102894,0.000009352978,0.00002429569,0.00022875455,0.000044935758,0.9558062,0.03768009,0.0034504838,0.0016280678,0.000013055718],"about_ca_topic_score_codex":0.00058791274,"about_ca_topic_score_gemma":0.00037004089,"teacher_disagreement_score":0.0006103718,"about_ca_system_score_codex":0.00030891184,"about_ca_system_score_gemma":0.00014993244,"threshold_uncertainty_score":0.0032279491},"labels":[],"label_agreement":null},{"id":"W2291245833","doi":"","title":"Improving node behaviour in a QoS control environment by means of load-dependent resource redistributions in LANs: Research Articles","year":2005,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Reservation; Quality of service; Shared resource; Computer network; Bandwidth (computing); Resource (disambiguation); Control (management); Node (physics); Distributed computing; Operations research","score_opus":0.015745331435022537,"score_gpt":0.2784099662658823,"score_spread":0.2626646348308598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291245833","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.28280067,0.0015625381,0.7082683,0.0005147571,0.000097632466,0.00008569645,0.00003156224,0.0010357712,0.005602967],"genre_scores_gemma":[0.9159956,0.0009617963,0.07930107,0.000042229418,0.000108708286,0.000033400487,0.00004396545,0.00010713035,0.0034059773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996346,0.00013768538,0.000018770683,0.000051270043,0.00009844115,0.00005916665],"domain_scores_gemma":[0.99867177,0.0007281545,0.00014823125,0.00015289478,0.00023681483,0.000062218984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012877574,0.00041968573,0.0004698376,0.00048758052,0.00041395272,0.00073702954,0.0006922127,0.00037408384,0.0018438762],"category_scores_gemma":[0.002749585,0.00020235969,0.00018380999,0.00052680686,0.00062190497,0.0009939768,0.00037148249,0.00037735506,0.0003485617],"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.00036028263,0.00036706077,0.004157208,0.00021238823,0.000044719713,0.00012014076,0.00024748407,0.6559834,0.055536095,0.010208392,0.0019393112,0.2708235],"study_design_scores_gemma":[0.000012423809,0.00012856718,0.0006753813,0.0000054596067,0.000010678896,0.000034632438,0.00003177194,0.9890293,0.0069808434,0.0019094903,0.0011729307,0.000008598929],"about_ca_topic_score_codex":0.0012924493,"about_ca_topic_score_gemma":0.0012183998,"teacher_disagreement_score":0.0018438762,"about_ca_system_score_codex":0.0005780818,"about_ca_system_score_gemma":0.0002935712,"threshold_uncertainty_score":0.0068104267},"labels":[],"label_agreement":null},{"id":"W2299602071","doi":"10.1002/dac.3099","title":"Novel noncoherent detection for multi‐hop amplify‐and‐forward relaying systems","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Detector; Computer science; Bit error rate; Hop (telecommunications); Algorithm; Fading; Gaussian; Gaussian noise; Energy (signal processing); Word error rate; Noise (video); Telecommunications; Speech recognition; Statistics; Mathematics; Physics; Artificial intelligence; Decoding methods","score_opus":0.1570804721355105,"score_gpt":0.3643644036024294,"score_spread":0.2072839314669189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299602071","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.046737526,0.0007612587,0.9510542,0.00017310858,0.000039032515,0.000025138734,0.000036310073,0.00010355957,0.0010698715],"genre_scores_gemma":[0.86637694,0.0006082166,0.13064606,0.00014248735,0.00005353875,0.000053612745,0.00007525834,0.000015062507,0.0020288238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952316,0.00017028615,0.000025730853,0.00006502259,0.00019246437,0.000023391638],"domain_scores_gemma":[0.9990544,0.00053868955,0.0001290529,0.00008849433,0.00016686693,0.00002242982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011123116,0.00037002505,0.00043035377,0.00042500635,0.00020264197,0.0005339821,0.00060068234,0.00047900947,0.0006984327],"category_scores_gemma":[0.0021842124,0.0002376729,0.00024387165,0.0003940135,0.0003296671,0.0009480584,0.00070366863,0.00052163407,0.00018541518],"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.00038034,0.00016001554,0.006169705,0.0004765549,0.00019032504,0.00070607086,0.00033457697,0.40245658,0.08819217,0.1658327,0.003075875,0.33202502],"study_design_scores_gemma":[0.00001345682,0.000057236524,0.00050334557,0.000009020956,0.000009114705,0.00016052963,0.000013197146,0.9823262,0.005085494,0.010950663,0.000854615,0.000017114833],"about_ca_topic_score_codex":0.0002569812,"about_ca_topic_score_gemma":0.00039743638,"teacher_disagreement_score":0.0011123116,"about_ca_system_score_codex":0.0003595633,"about_ca_system_score_gemma":0.00032224564,"threshold_uncertainty_score":0.005882561},"labels":[],"label_agreement":null},{"id":"W2363038353","doi":"","title":"QoS-aware call admission control in wideband CDMA wireless networks: Research Articles","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","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":"University of Alberta; University of Guelph; Queen's University","funders":"","keywords":"UMTS frequency bands; Computer science; Quality of service; Computer network; Call Admission Control; Throughput; Power control; Telecommunications link; Radio resource management; Admission control; Wireless; Air interface; Wideband; Cellular network; Wireless network; Telecommunications; Power (physics); Base station; Engineering","score_opus":0.044100565171063796,"score_gpt":0.3529908868728505,"score_spread":0.3088903217017867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2363038353","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.07191819,0.1401259,0.749955,0.0031243395,0.001674675,0.00018703376,0.00006657863,0.001185683,0.031762544],"genre_scores_gemma":[0.7352981,0.07224024,0.16695137,0.0005317685,0.004305863,0.000116728734,0.00016422925,0.00015613908,0.020235617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928313,0.00015594644,0.00004124433,0.00010906322,0.00032896476,0.0000816753],"domain_scores_gemma":[0.9985606,0.00085696724,0.00008356057,0.00008771532,0.00033334043,0.00007784357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678916,0.0005104379,0.00063808187,0.0007006169,0.0006605463,0.00207818,0.0007099525,0.0011555116,0.0019216365],"category_scores_gemma":[0.0025689453,0.000255385,0.0002196853,0.0018998213,0.00082558085,0.001333615,0.00042891665,0.0010327051,0.0004969818],"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.00025456684,0.00027761157,0.0018395146,0.00059436716,0.000063206695,0.00032453015,0.00035373354,0.086452514,0.020590566,0.062960796,0.007996746,0.8182919],"study_design_scores_gemma":[0.00007938191,0.0002466184,0.0022178083,0.00022533738,0.00012192544,0.00074305874,0.00034235918,0.841762,0.019358972,0.05179702,0.08299998,0.000105485786],"about_ca_topic_score_codex":0.0035478536,"about_ca_topic_score_gemma":0.0015854026,"teacher_disagreement_score":0.0035478536,"about_ca_system_score_codex":0.00089159346,"about_ca_system_score_gemma":0.0009018011,"threshold_uncertainty_score":0.0070543885},"labels":[],"label_agreement":null},{"id":"W2393582145","doi":"10.1002/dac.3146","title":"The offloading model for green base stations in hybrid energy networks with multiple objectives","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Base station; Base (topology); Computer network; Energy consumption; Distributed computing; Telecommunications; Electrical engineering","score_opus":0.014638460477889042,"score_gpt":0.23497445165337724,"score_spread":0.2203359911754882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393582145","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.11565103,0.00038636115,0.86905706,0.00052013685,0.00005652629,0.000073451956,0.00014830758,0.00016069629,0.013946459],"genre_scores_gemma":[0.98052716,0.00020860095,0.012508725,0.000057996982,0.00001849891,0.00010830634,0.00006441304,0.000027408378,0.0064788545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972695,0.00006854097,0.000009016077,0.000058628266,0.000057498404,0.000079384205],"domain_scores_gemma":[0.99969685,0.00015395496,0.000041842846,0.00001409026,0.00006880749,0.00002448694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006678346,0.0009212392,0.0007005649,0.00046468122,0.000561767,0.001149352,0.0012364108,0.0010563326,0.002279566],"category_scores_gemma":[0.00096615165,0.0003904298,0.0008164809,0.00045406198,0.0007675351,0.001120094,0.0009677689,0.00087121374,0.00021518073],"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.000018087883,0.000008592182,0.00021921466,0.000014642861,0.0000070344568,0.000041649946,0.00002303898,0.992215,0.0004559126,0.004729998,0.00016525743,0.00210162],"study_design_scores_gemma":[0.0000014607227,0.0000047094286,0.000035273217,0.0000013919185,0.0000022038234,0.0000029097298,0.0000066789726,0.99881774,0.000053805397,0.0010147939,0.000057519625,0.0000014284454],"about_ca_topic_score_codex":0.009570548,"about_ca_topic_score_gemma":0.006433416,"teacher_disagreement_score":0.009570548,"about_ca_system_score_codex":0.001326724,"about_ca_system_score_gemma":0.0007150856,"threshold_uncertainty_score":0.019029677},"labels":[],"label_agreement":null},{"id":"W2414516218","doi":"","title":"Effects of control loop delay on the stability of a rate control algorithm: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Iterative Learning Control Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Stability (learning theory); Control theory (sociology); Computer science; Loop (graph theory); Control (management); Upper and lower bounds; Domain (mathematical analysis); Process (computing); Control system; Mathematics; Mathematical analysis; Engineering","score_opus":0.02690155759633895,"score_gpt":0.30348372330563395,"score_spread":0.276582165709295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414516218","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.31736395,0.0077100894,0.65897256,0.0006403609,0.00019460722,0.000069717484,0.000047172718,0.00038566606,0.014615806],"genre_scores_gemma":[0.9802579,0.0018523335,0.016166357,0.00004200348,0.00006547272,0.00001504886,0.000018163924,0.0000525331,0.0015302446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991066,0.0002171868,0.000048560112,0.00016496549,0.00035334486,0.000109273176],"domain_scores_gemma":[0.99082994,0.007258543,0.0006117583,0.00033696226,0.0008800684,0.00008278171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014141237,0.00049834466,0.00060764607,0.00045970056,0.00036444378,0.0011515307,0.00041038194,0.0007342978,0.0032355634],"category_scores_gemma":[0.012076491,0.00023615721,0.00039518994,0.000308913,0.00080247654,0.0014216887,0.0006043216,0.0006427948,0.00033201152],"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.0012531225,0.00016009691,0.0039314865,0.0008611155,0.00011909642,0.00047744607,0.00054284534,0.70913845,0.064761735,0.0495461,0.0007372117,0.1684713],"study_design_scores_gemma":[0.000033170352,0.0003031491,0.0008377291,0.000051476967,0.00004069795,0.00025226964,0.000051760515,0.9574064,0.030856764,0.008161246,0.0019703736,0.000034968183],"about_ca_topic_score_codex":0.0013169942,"about_ca_topic_score_gemma":0.0006344011,"teacher_disagreement_score":0.0032355634,"about_ca_system_score_codex":0.0005768036,"about_ca_system_score_gemma":0.0005996633,"threshold_uncertainty_score":0.010823965},"labels":[],"label_agreement":null},{"id":"W2510377198","doi":"","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Path (computing); Mathematical optimization; Average path length; Routing (electronic design automation); Convergence (economics); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","score_opus":0.06935098984981178,"score_gpt":0.37244072958290686,"score_spread":0.30308973973309505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510377198","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.0034806249,0.0003862823,0.99494886,0.00012552668,0.00006309242,0.000025462341,0.000023045335,0.00026857053,0.00067856465],"genre_scores_gemma":[0.13507596,0.0012846343,0.8587724,0.00022602557,0.00021051914,0.00019630982,0.00027118516,0.00017395156,0.0037890463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946576,0.0001294577,0.000031646283,0.000115154675,0.00021132552,0.000046619032],"domain_scores_gemma":[0.99942976,0.00027725394,0.00006117821,0.00006875093,0.00012372348,0.000039390306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088210776,0.000759549,0.00092560315,0.00073109916,0.00048338345,0.0009894571,0.0014288572,0.0013367083,0.0016006794],"category_scores_gemma":[0.0025963108,0.00037518743,0.00060151506,0.0012336627,0.00084782706,0.0017398454,0.0014001669,0.0015372612,0.00070992444],"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.000119346376,0.000058750815,0.00054007204,0.00015454911,0.00008185645,0.00007511391,0.00010361134,0.5706481,0.007117783,0.034045722,0.0056477888,0.38140732],"study_design_scores_gemma":[0.000016664539,0.00004099138,0.00007489448,0.000007567761,0.000007650259,0.00004238841,0.000008017105,0.98561096,0.0008440605,0.00918368,0.0041540978,0.000008949981],"about_ca_topic_score_codex":0.002973733,"about_ca_topic_score_gemma":0.0021229016,"teacher_disagreement_score":0.002973733,"about_ca_system_score_codex":0.00057439983,"about_ca_system_score_gemma":0.0011087065,"threshold_uncertainty_score":0.0059128404},"labels":[],"label_agreement":null},{"id":"W2513021552","doi":"10.1002/dac.3180","title":"An efficient network‐coding based back‐pressure scheduling algorithm for wireless multi‐hop networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Linear network coding; Computer network; Hop (telecommunications); Wireless network; Coding (social sciences); Wireless; Scheduling (production processes); Maximum throughput scheduling; Distributed computing; Algorithm; Round-robin scheduling; Fair-share scheduling; Telecommunications; Quality of service; Mathematical optimization; Network packet","score_opus":0.01701329410286068,"score_gpt":0.2750245534377791,"score_spread":0.2580112593349184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513021552","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.018528242,0.00010871599,0.9792418,0.00013583423,0.00005081401,0.000058042162,0.000025139027,0.00016980396,0.0016817118],"genre_scores_gemma":[0.65074056,0.00021695507,0.34619763,0.00012105992,0.00007074345,0.0002231088,0.00011874706,0.000061084786,0.0022500842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995844,0.000109673805,0.000017434628,0.00005233719,0.0001635329,0.00007278305],"domain_scores_gemma":[0.99934477,0.00031764313,0.00006506693,0.000048103975,0.00017583491,0.000048547514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007002832,0.00051677495,0.0005149792,0.00060894905,0.0004920273,0.00055072,0.0009914624,0.0005860114,0.0011537969],"category_scores_gemma":[0.0020246347,0.00023543282,0.00029910775,0.0006510371,0.00051464693,0.00075605017,0.0009305705,0.0008404243,0.00019446146],"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.00011104901,0.00007964095,0.00044428458,0.000053189193,0.000019802563,0.0000568399,0.00007896671,0.8672608,0.006530704,0.017927336,0.0023500165,0.105087295],"study_design_scores_gemma":[0.000006091509,0.000010965825,0.000030752803,0.0000016213016,0.0000015129121,0.0000073138062,0.000003564274,0.9975938,0.0005126062,0.001665685,0.00016390275,0.0000022287265],"about_ca_topic_score_codex":0.0045070876,"about_ca_topic_score_gemma":0.0031976982,"teacher_disagreement_score":0.0045070876,"about_ca_system_score_codex":0.000874306,"about_ca_system_score_gemma":0.001669847,"threshold_uncertainty_score":0.008961737},"labels":[],"label_agreement":null},{"id":"W2529424943","doi":"10.1002/dac.3196","title":"Co‐tier downlink interference management in dense femtocell networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"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":"Femtocell; Computer science; Telecommunications link; Interference (communication); Computer network; Base station; Power control; Software deployment; Wireless; Transmitter power output; Power (physics); Transmitter; Telecommunications","score_opus":0.01587718021225674,"score_gpt":0.2692692264080288,"score_spread":0.25339204619577205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529424943","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.16102093,0.00092040084,0.8315475,0.00016327335,0.000065181186,0.000039956412,0.0000489404,0.00042919233,0.0057645924],"genre_scores_gemma":[0.97612506,0.00015670552,0.023077756,0.000039558232,0.000026904532,0.000013499889,0.000021535043,0.000008518814,0.0005304986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949,0.00012852797,0.000016368993,0.00006660489,0.00014822134,0.00015033239],"domain_scores_gemma":[0.99932814,0.00028782195,0.00009470392,0.000074317875,0.00016505981,0.000049958177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049705687,0.00049954647,0.0005782744,0.0003935636,0.00057668483,0.0005462476,0.0005402891,0.00033473587,0.0005336587],"category_scores_gemma":[0.0010611871,0.00018477664,0.00022945812,0.0005032768,0.00037767913,0.00043748037,0.000687879,0.00039367747,0.0001189741],"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.00020552639,0.00009404741,0.0027151965,0.000069048256,0.00007963498,0.00031979883,0.000109740424,0.8703334,0.022926979,0.0057682795,0.0014111141,0.09596729],"study_design_scores_gemma":[0.0000047835256,0.000040330237,0.0005048051,0.0000033764195,0.000013256699,0.000072928815,0.000027383307,0.9945135,0.0030450672,0.0013951242,0.0003719297,0.000007488743],"about_ca_topic_score_codex":0.0048399083,"about_ca_topic_score_gemma":0.0057999333,"teacher_disagreement_score":0.0048399083,"about_ca_system_score_codex":0.0006956954,"about_ca_system_score_gemma":0.0005303771,"threshold_uncertainty_score":0.009623468},"labels":[],"label_agreement":null},{"id":"W2550569116","doi":"10.1002/dac.3477","title":"Cryptanalysis of an identity‐based authenticated key exchange protocol","year":2017,"lang":"en","type":"preprint","venue":"International Journal of Communication Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"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":"Agence Nationale de la Recherche","keywords":"Computer security; Computer science; Authenticated Key Exchange; Key exchange; Oakley protocol; Adversary; Session key; Protocol (science); Key (lock); Cryptanalysis; Shared secret; Security association; Key distribution; Cryptography; Computer network; Public-key cryptography; Encryption; Cloud computing security; Network Access Control","score_opus":0.056177434084342066,"score_gpt":0.3834484004843725,"score_spread":0.32727096640003045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550569116","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.17945507,0.0006718208,0.7694576,0.0044275606,0.0005321823,0.00039775163,0.00023513286,0.0011347301,0.043688186],"genre_scores_gemma":[0.955886,0.00025792676,0.03806618,0.00019949977,0.0000702748,0.00011822732,0.00008288502,0.00005015182,0.005268864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963314,0.0011182594,0.0001838685,0.00033417775,0.0016229535,0.0004093744],"domain_scores_gemma":[0.99591476,0.0022478239,0.00036698408,0.0009624813,0.000413698,0.00009422253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00228551,0.00045811068,0.0006205199,0.0011328403,0.0013753984,0.0022248651,0.0010329954,0.0014748155,0.003812552],"category_scores_gemma":[0.0076583982,0.00038279514,0.0009658442,0.0009448383,0.0026631802,0.0031525416,0.0023414039,0.0026679083,0.00072318746],"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.00045327793,0.0000666493,0.0009653785,0.00010022884,0.00008511911,0.00101833,0.00049987575,0.045335397,0.00914189,0.91631275,0.0032914819,0.022729577],"study_design_scores_gemma":[0.0001427037,0.00012891283,0.0004261825,0.00007864014,0.00008708757,0.00094032194,0.000109297296,0.49201012,0.01881897,0.46758342,0.019604255,0.0000701438],"about_ca_topic_score_codex":0.0008241785,"about_ca_topic_score_gemma":0.00027620344,"teacher_disagreement_score":0.003812552,"about_ca_system_score_codex":0.0018486372,"about_ca_system_score_gemma":0.0014293691,"threshold_uncertainty_score":0.013412893},"labels":[],"label_agreement":null},{"id":"W2555769812","doi":"10.1002/dac.3232","title":"An altruism‐based trust‐dependent message forwarding protocol for opportunistic networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Node (physics); Routing protocol; Overhead (engineering); Routing (electronic design automation); Altruism (biology); Protocol (science); Computer security; Distributed computing","score_opus":0.05598276550066567,"score_gpt":0.3529024678468463,"score_spread":0.29691970234618065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555769812","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.10059299,0.00019429334,0.8921022,0.0003849221,0.00010079748,0.00022431547,0.00010390197,0.00050866156,0.0057879235],"genre_scores_gemma":[0.9190159,0.000094060495,0.07722404,0.00007348599,0.000020065117,0.00016797129,0.000109634035,0.000024476054,0.0032703658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919957,0.00026571876,0.000067392786,0.00008955236,0.00027815052,0.00009968428],"domain_scores_gemma":[0.9979887,0.0008632041,0.00034321746,0.00026589178,0.00036468715,0.00017432221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013597291,0.00033004477,0.000394532,0.00045850847,0.00080816983,0.0006043242,0.0011556438,0.00046336267,0.0006838249],"category_scores_gemma":[0.003763842,0.000171435,0.00033661776,0.0003508583,0.000530534,0.00078754773,0.0016650312,0.00054395763,0.00014175792],"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.0013478773,0.00042596163,0.007208609,0.00046533844,0.00025689913,0.0016153293,0.0027184838,0.40794984,0.06789957,0.22155344,0.01049123,0.2780674],"study_design_scores_gemma":[0.00005714467,0.00018694908,0.0005743645,0.000022400722,0.00005986117,0.00033556842,0.0001527182,0.9528642,0.008663595,0.028051682,0.008983399,0.000048003894],"about_ca_topic_score_codex":0.0020037605,"about_ca_topic_score_gemma":0.0022004836,"teacher_disagreement_score":0.0020037605,"about_ca_system_score_codex":0.0007993212,"about_ca_system_score_gemma":0.0011953771,"threshold_uncertainty_score":0.0071910024},"labels":[],"label_agreement":null},{"id":"W2566309962","doi":"10.1002/dac.3247","title":"Resource allocation in heterogeneous cooperative cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":11,"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 Manitoba","funders":"","keywords":"Computer science; Cognitive radio; Cooperative diversity; Resource allocation; Relay; Computer network; Diversity (politics); Wireless; Channel (broadcasting); Resource (disambiguation); Interference (communication); Wireless network; Constraint (computer-aided design); Harm; Transmission (telecommunications); Telecommunications","score_opus":0.018239331632469862,"score_gpt":0.2698964932296766,"score_spread":0.25165716159720675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566309962","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.121981695,0.0007058099,0.86436224,0.00036117036,0.00006191637,0.000051896677,0.00005313781,0.00014584823,0.01227622],"genre_scores_gemma":[0.9894493,0.00015912065,0.008256544,0.000048660397,0.000018903245,0.00003411393,0.000015445457,0.000009992919,0.00200788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925,0.00027165064,0.00001812996,0.00011696772,0.00017182552,0.00017154227],"domain_scores_gemma":[0.9990079,0.00057328754,0.00012297863,0.00008090658,0.00015665762,0.000058371937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051091,0.00049649173,0.0006450683,0.00045681835,0.00041852248,0.001081858,0.000924782,0.00064853486,0.0011721244],"category_scores_gemma":[0.0023034303,0.0002559254,0.0004081085,0.0005636702,0.00084474747,0.00088390283,0.0008289819,0.00042708797,0.00019524344],"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.000033963268,0.000025589798,0.00022363082,0.000016534168,0.000016621516,0.00007688446,0.00002596087,0.9797084,0.0012538267,0.012861207,0.00033532787,0.005422067],"study_design_scores_gemma":[0.0000031040797,0.0000141967,0.0000679393,0.0000019940858,0.000004274358,0.000009953528,0.000013176942,0.9938368,0.00014227015,0.0057418556,0.0001612876,0.0000030788722],"about_ca_topic_score_codex":0.0064546615,"about_ca_topic_score_gemma":0.0042565223,"teacher_disagreement_score":0.0064546615,"about_ca_system_score_codex":0.0012838196,"about_ca_system_score_gemma":0.0008410709,"threshold_uncertainty_score":0.012834132},"labels":[],"label_agreement":null},{"id":"W2576057564","doi":"10.1002/dac.3259","title":"Authorship verification using deep belief network systems","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":63,"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; University of Victoria","funders":"","keywords":"Computer science; Merge (version control); Bernoulli's principle; Gaussian; Word error rate; Basis (linear algebra); Artificial intelligence; Block (permutation group theory); Natural language processing; Data mining; Theoretical computer science; Algorithm; Information retrieval; Mathematics","score_opus":0.09828633259928508,"score_gpt":0.3644836674045816,"score_spread":0.2661973348052965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576057564","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.10827739,0.00078039273,0.88439757,0.0011641677,0.00009561376,0.00006991197,0.00023444156,0.0014586957,0.0035218343],"genre_scores_gemma":[0.9554681,0.00013704548,0.042457074,0.00009533272,0.000037060712,0.00003253576,0.00015246058,0.000022571925,0.0015977465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841905,0.0006802437,0.00009098513,0.00031750416,0.00031155738,0.0001806998],"domain_scores_gemma":[0.99380785,0.0038233157,0.00065137807,0.0006360002,0.0009458056,0.00013576227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026077975,0.0006136798,0.00085380604,0.0014119484,0.0005266399,0.0017612627,0.0011534095,0.0012975,0.0018986298],"category_scores_gemma":[0.010258096,0.0004407985,0.0006242468,0.00079196726,0.00090871,0.0024951666,0.0013862085,0.0017013459,0.00048974296],"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.0002897356,0.00011235898,0.0036666377,0.00008467699,0.00010339559,0.00009855064,0.00011703725,0.84293807,0.0015680349,0.013461107,0.0012447423,0.13631557],"study_design_scores_gemma":[0.000002524149,0.0000060675584,0.00010586022,0.0000039480396,0.0000030329588,0.000004756045,0.000004199157,0.9949734,0.00036314433,0.0044536334,0.00007667381,0.0000027000945],"about_ca_topic_score_codex":0.007227893,"about_ca_topic_score_gemma":0.005414616,"teacher_disagreement_score":0.007227893,"about_ca_system_score_codex":0.0016668093,"about_ca_system_score_gemma":0.0011215076,"threshold_uncertainty_score":0.0143716335},"labels":[],"label_agreement":null},{"id":"W2612436241","doi":"","title":"A hop-by-hop delay-constrained routing algorithm with explicit loop avoidance and backup routing information: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","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":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Static routing; Distributed computing; Dynamic Source Routing; Link-state routing protocol; Equal-cost multi-path routing; Routing Information Protocol; Policy-based routing; Destination-Sequenced Distance Vector routing; Geographic routing; Path vector protocol; Routing table; Multipath routing; Backup; Source routing; Routing protocol; Routing (electronic design automation)","score_opus":0.02802959245960825,"score_gpt":0.29803457264663563,"score_spread":0.2700049801870274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612436241","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.018643513,0.0016792791,0.9746728,0.00029113365,0.00016803388,0.00015200126,0.00006858633,0.000798148,0.0035265177],"genre_scores_gemma":[0.28867745,0.0016273984,0.7005996,0.00022178076,0.00012932027,0.00023444806,0.00038477598,0.00013899877,0.007986197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968076,0.00006999691,0.000024506591,0.000088607674,0.00010269245,0.000033387496],"domain_scores_gemma":[0.9996517,0.00013022243,0.000042749976,0.0000638167,0.0000875319,0.00002390749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039104462,0.00065142807,0.0007190518,0.0006417594,0.0005768913,0.0008420661,0.0013397984,0.00091699883,0.0026604268],"category_scores_gemma":[0.00095804845,0.00021867781,0.00035755936,0.0012977837,0.00042028783,0.0010747152,0.00057933666,0.0005761937,0.00065931916],"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.00032598444,0.00023239263,0.0008511187,0.00038881286,0.00010891591,0.00013377711,0.00013653445,0.37977293,0.02588275,0.021731162,0.007638465,0.56279725],"study_design_scores_gemma":[0.000039102615,0.00009241666,0.00017128384,0.000019691153,0.000019142612,0.00014243765,0.000019198334,0.98218614,0.0038251376,0.005212119,0.00825528,0.00001809778],"about_ca_topic_score_codex":0.0029365765,"about_ca_topic_score_gemma":0.002263539,"teacher_disagreement_score":0.0029365765,"about_ca_system_score_codex":0.00060358795,"about_ca_system_score_gemma":0.001199634,"threshold_uncertainty_score":0.008899987},"labels":[],"label_agreement":null},{"id":"W2743288534","doi":"10.1002/dac.3392","title":"TDMA‐SDMA‐based RFID algorithm for fast detection and efficient collision avoidance","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"RFID technology advancements","field":"Engineering","cited_by":9,"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 Ottawa","funders":"","keywords":"Computer science; Radio-frequency identification; Identification (biology); Collision; Algorithm; Key (lock); Throughput; Collision avoidance; Time division multiple access; Field-programmable gate array; Software deployment; Real-time computing; Wireless; Embedded system; Computer network; Telecommunications; Computer security; Operating system","score_opus":0.01388367076653268,"score_gpt":0.28658893101936866,"score_spread":0.272705260252836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743288534","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.026179489,0.000409795,0.9662687,0.000116147115,0.00016780848,0.00010584456,0.000043551972,0.0013634168,0.005345213],"genre_scores_gemma":[0.58346504,0.0003942178,0.40567943,0.00011465206,0.00004483887,0.0001898544,0.00013690005,0.000046893678,0.009928127],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979097,0.000029352279,0.00002576621,0.000043919765,0.000087571076,0.000022472681],"domain_scores_gemma":[0.99969316,0.00006244105,0.000028226936,0.000041922376,0.00016330025,0.000011038899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025563885,0.00027051682,0.0002034138,0.00046788878,0.0003353517,0.00051132444,0.000609625,0.00030159554,0.0019795916],"category_scores_gemma":[0.0006884237,0.0001442204,0.00020422533,0.00031646257,0.00020024167,0.00040094365,0.00025535774,0.00035292952,0.0006174646],"study_design_candidate":"bench_or_experimental","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.00048681043,0.00014352851,0.0032816927,0.0003766001,0.00008697494,0.00027279533,0.0003453389,0.087810904,0.22899741,0.03278932,0.0077959187,0.63761264],"study_design_scores_gemma":[0.00012563565,0.00038374035,0.0014759382,0.000049019178,0.000063409396,0.000861064,0.00006910215,0.78802985,0.16577955,0.0038065806,0.0393023,0.000053834774],"about_ca_topic_score_codex":0.0013098364,"about_ca_topic_score_gemma":0.0013750212,"teacher_disagreement_score":0.0019795916,"about_ca_system_score_codex":0.0003553707,"about_ca_system_score_gemma":0.00079513225,"threshold_uncertainty_score":0.006622374},"labels":[],"label_agreement":null},{"id":"W2757060298","doi":"10.1002/dac.3411","title":"Distributed simultaneous wireless information and power transfer in multiuser amplify‐and‐forward ad hoc wireless networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":5,"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 Toronto","funders":"","keywords":"Computer science; Relay; Node (physics); Computer network; Wireless ad hoc network; Wireless; Wireless network; Matching (statistics); Wireless power transfer; Power (physics); Telecommunications; Mathematics","score_opus":0.008821480026647134,"score_gpt":0.2378955043855215,"score_spread":0.2290740243588744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757060298","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.036083944,0.00027116525,0.9614218,0.0001922811,0.000030995598,0.00006517369,0.000020399222,0.000059977927,0.0018542042],"genre_scores_gemma":[0.9174689,0.00034203017,0.07898527,0.00007477885,0.00004714777,0.00012446316,0.000034166842,0.000016282616,0.0029069902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983311,0.00084677845,0.00007747489,0.0002785873,0.000324632,0.0001413822],"domain_scores_gemma":[0.9972344,0.0020972926,0.00019708685,0.0001904071,0.00020706966,0.00007371539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022838558,0.0005267474,0.00078086625,0.0005007822,0.0006116824,0.0012374028,0.0010261021,0.00089554477,0.0012739641],"category_scores_gemma":[0.004607656,0.0003626089,0.0004700753,0.0010976258,0.00095290196,0.0018450577,0.0012478027,0.0007444811,0.00021899205],"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.00020349973,0.000113316295,0.0008853798,0.00018133798,0.0000960603,0.0002092363,0.00020374809,0.8153381,0.006069325,0.101037614,0.0010401638,0.07462227],"study_design_scores_gemma":[0.00001574093,0.00007872396,0.00009042857,0.0000054812067,0.000013342782,0.000051701452,0.000039399067,0.9625541,0.0013514897,0.035170563,0.0006220932,0.000006944129],"about_ca_topic_score_codex":0.00071315246,"about_ca_topic_score_gemma":0.00060841104,"teacher_disagreement_score":0.0022838558,"about_ca_system_score_codex":0.0008172122,"about_ca_system_score_gemma":0.00068904366,"threshold_uncertainty_score":0.012078345},"labels":[],"label_agreement":null},{"id":"W2766207463","doi":"10.1002/dac.3443","title":"A survey of overlay and underlay paradigms in cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":45,"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":"Underlay; Cognitive radio; Computer science; Computer network; Overlay; Throughput; Wireless; Transmission (telecommunications); Overlay network; Software-defined radio; Wireless network; Telecommunications; The Internet; Signal-to-noise ratio (imaging); World Wide Web","score_opus":0.05036733424563223,"score_gpt":0.3269766796008684,"score_spread":0.2766093453552362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766207463","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025751116,0.59546816,0.33004582,0.0021974782,0.00081098924,0.00016901942,0.0001288454,0.0003100531,0.04511853],"genre_scores_gemma":[0.39647102,0.4847606,0.11015641,0.0008688203,0.0018676916,0.000289489,0.00019762419,0.00007178508,0.0053165536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987257,0.000414942,0.000097056305,0.00022324004,0.00041663798,0.00012252884],"domain_scores_gemma":[0.9985447,0.0009229775,0.00011377436,0.00011601892,0.0002359862,0.0000665669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017446447,0.00073745457,0.00090538786,0.0019925968,0.00071994826,0.0023867677,0.0013599796,0.001109595,0.0014094682],"category_scores_gemma":[0.0020780624,0.00053122756,0.0006051176,0.00293631,0.0009535213,0.0035280574,0.0012930029,0.0012218597,0.00039188896],"study_design_candidate":"not_applicable","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.00019359308,0.00017897213,0.0030743757,0.0033995688,0.00016363575,0.00036352003,0.00063143275,0.038538426,0.004209132,0.21536075,0.006266895,0.72761977],"study_design_scores_gemma":[0.000046599558,0.0008857298,0.005306542,0.0029235412,0.000265879,0.0031390348,0.0014125436,0.27095827,0.005079052,0.2767138,0.43303964,0.00022947369],"about_ca_topic_score_codex":0.001987814,"about_ca_topic_score_gemma":0.0013784217,"teacher_disagreement_score":0.0023867677,"about_ca_system_score_codex":0.0011232819,"about_ca_system_score_gemma":0.0009508368,"threshold_uncertainty_score":0.00922668},"labels":[],"label_agreement":null},{"id":"W2775948036","doi":"10.1002/dac.3480","title":"Analysis of instantaneous availability of communication system based on the influence of support equipment","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Queueing theory; Exponential distribution; Exponential function; Markov chain; Communications system; Transmission (telecommunications); Function (biology); Service (business); Process (computing); Reliability engineering; Real-time computing; Distributed computing; Telecommunications; Computer network; Machine learning","score_opus":0.03731038697784972,"score_gpt":0.33542971888903594,"score_spread":0.2981193319111862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775948036","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.37591454,0.0008427187,0.6141804,0.0005985355,0.00010379748,0.000048729507,0.00020159043,0.00041011593,0.0076996502],"genre_scores_gemma":[0.9969643,0.00014237323,0.0022636233,0.00001380099,0.000017602813,0.000014706047,0.000026280248,0.000012241571,0.0005450839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918455,0.00019392095,0.00003089578,0.00014377116,0.00023245871,0.00021437189],"domain_scores_gemma":[0.997311,0.001516968,0.00045157512,0.00013670941,0.0004105667,0.0001733173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001183047,0.00048529528,0.0004833125,0.0009550947,0.0004940383,0.00086727424,0.00086842984,0.0005289493,0.0015155965],"category_scores_gemma":[0.0043305294,0.00035692012,0.0007096934,0.00054515165,0.00081361545,0.0016335726,0.00067404436,0.0008149931,0.00011582808],"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.000056065353,0.000019794235,0.004577521,0.0000603413,0.00003549654,0.0002506524,0.000093605435,0.97027874,0.0029487829,0.017001448,0.00034959306,0.004327999],"study_design_scores_gemma":[0.0000019541526,0.000016846307,0.0009898259,0.0000035323696,0.000011201038,0.000032769167,0.000018538909,0.9967872,0.0002684107,0.0017631003,0.00010048693,0.0000061627834],"about_ca_topic_score_codex":0.008651013,"about_ca_topic_score_gemma":0.0034939095,"teacher_disagreement_score":0.008651013,"about_ca_system_score_codex":0.0012993483,"about_ca_system_score_gemma":0.0010450324,"threshold_uncertainty_score":0.017201304},"labels":[],"label_agreement":null},{"id":"W2777927072","doi":"10.1002/dac.3489","title":"Directional core selection approach and dynamic tree reorganization for delay and delay variation multicast routing","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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":"Concordia University","funders":"","keywords":"Multicast; Computer science; Distance Vector Multicast Routing Protocol; Protocol Independent Multicast; Computer network; Variation (astronomy); Xcast; Source-specific multicast; Tree (set theory); Distributed computing; Session (web analytics); Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.021355099317867086,"score_gpt":0.2843390137482789,"score_spread":0.2629839144304118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777927072","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.10979785,0.0002588497,0.8874892,0.0001425398,0.000035005814,0.00004760672,0.000028551247,0.00025176798,0.0019486812],"genre_scores_gemma":[0.8709809,0.00010731058,0.12775744,0.000042940956,0.000019068497,0.000047850222,0.000057653357,0.00002602038,0.00096076616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996878,0.00010176999,0.000018890569,0.000056887842,0.000075450225,0.00005914678],"domain_scores_gemma":[0.9994222,0.00018447672,0.000092600996,0.00011662584,0.00012558594,0.00005858217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005152897,0.00026198718,0.00033698414,0.0005111283,0.00047164978,0.0004057716,0.00067349983,0.00028872836,0.0005655314],"category_scores_gemma":[0.00094512955,0.00013941695,0.00023969372,0.00039301938,0.00031096456,0.00046351113,0.00054205867,0.00037292982,0.000103010534],"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.00027933318,0.00013541398,0.0028438016,0.00009208111,0.000054475302,0.00019952821,0.0002297916,0.5795754,0.09647596,0.053695146,0.0025558674,0.26386324],"study_design_scores_gemma":[0.00000922251,0.00006057988,0.00040828,0.0000029852322,0.000011538334,0.00007678139,0.000032148,0.98581856,0.0060513774,0.0060010958,0.001517348,0.000010023875],"about_ca_topic_score_codex":0.0010757436,"about_ca_topic_score_gemma":0.0014299327,"teacher_disagreement_score":0.0010757436,"about_ca_system_score_codex":0.000520752,"about_ca_system_score_gemma":0.0005984762,"threshold_uncertainty_score":0.0037783384},"labels":[],"label_agreement":null},{"id":"W2788559596","doi":"10.1002/dac.3479","title":"SDN‐based fault‐tolerant on‐demand and in‐advance bandwidth reservation in data center interconnects","year":2017,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Computer science; Computer network; Provisioning; Data center; Distributed computing; Reservation; Bandwidth (computing); Emulation; Cloud computing; Node (physics); Operating system","score_opus":0.07328879077873765,"score_gpt":0.34711573079289854,"score_spread":0.27382694001416086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788559596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5898444,0.00067275664,0.3941176,0.0003579013,0.00035224116,0.00018613212,0.00032727618,0.0053063314,0.008835417],"genre_scores_gemma":[0.9815538,0.000051073486,0.017157892,0.000034304816,0.000009347253,0.000024073739,0.00016172823,0.00004264949,0.0009650633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995134,0.00009038412,0.000035644996,0.00009269639,0.0001415414,0.00012638538],"domain_scores_gemma":[0.998884,0.00027642472,0.00009268363,0.00022160466,0.00039591637,0.00012938406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010073843,0.00045986866,0.0004747321,0.0004828444,0.0005339302,0.00071707345,0.0014871634,0.0003577919,0.0015943091],"category_scores_gemma":[0.0011729767,0.00018801619,0.00033893404,0.00027300286,0.00040544756,0.0007452069,0.000640403,0.0005746495,0.00018981584],"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.0010820333,0.0003352272,0.0052003614,0.00018299739,0.00008297412,0.00026142388,0.0001689324,0.8623585,0.039108384,0.0072244816,0.003955189,0.08003955],"study_design_scores_gemma":[0.000017502189,0.00006301326,0.00026246713,0.000003652624,0.000007566023,0.000014630336,0.000018355086,0.99135405,0.006807182,0.0006732488,0.0007728849,0.000005449717],"about_ca_topic_score_codex":0.007442632,"about_ca_topic_score_gemma":0.004557911,"teacher_disagreement_score":0.007442632,"about_ca_system_score_codex":0.0010808577,"about_ca_system_score_gemma":0.0009253262,"threshold_uncertainty_score":0.014798582},"labels":[],"label_agreement":null},{"id":"W2810546111","doi":"10.1002/dac.3555","title":"Relax online resource allocation algorithms for D2D communication","year":2018,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Algorithm; Online algorithm; Cellular network; Bipartite graph; Matching (statistics); Blossom algorithm; Scheduling (production processes); Mathematical optimization; Theoretical computer science; Computer network; Mathematics","score_opus":0.02933013232330449,"score_gpt":0.31189542193126446,"score_spread":0.28256528960795996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810546111","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.024513198,0.00030739122,0.968905,0.00032786521,0.00007210912,0.00012666533,0.0001449111,0.000389225,0.005213646],"genre_scores_gemma":[0.66849786,0.00032143111,0.3246718,0.0002720633,0.00008142443,0.00033066302,0.00040481082,0.00017211746,0.0052477075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984138,0.00064985646,0.00008598659,0.00026160595,0.00032884663,0.00025993053],"domain_scores_gemma":[0.99662966,0.0022268062,0.00032408893,0.00038416305,0.00027867642,0.00015657695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020283493,0.001084915,0.001303875,0.0005694895,0.0004909589,0.0014734876,0.001679446,0.0011233027,0.005707915],"category_scores_gemma":[0.005972002,0.00056152156,0.00071410014,0.0011640476,0.00076585513,0.0017835796,0.0018745174,0.0016521842,0.000741123],"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.0002838113,0.00015943618,0.00043419006,0.0001094044,0.00003582157,0.00004556876,0.00005776588,0.92189455,0.0018351072,0.019532833,0.0027363375,0.05287516],"study_design_scores_gemma":[0.000027242035,0.00003107002,0.00004991304,0.000004071816,0.0000037779619,0.000015168521,0.000010973144,0.99412125,0.0004070671,0.0048248717,0.000500835,0.0000037476646],"about_ca_topic_score_codex":0.0032486243,"about_ca_topic_score_gemma":0.002329301,"teacher_disagreement_score":0.005707915,"about_ca_system_score_codex":0.0012230934,"about_ca_system_score_gemma":0.0016588485,"threshold_uncertainty_score":0.019094884},"labels":[],"label_agreement":null},{"id":"W2884096875","doi":"10.1002/dac.3773","title":"On optimizing firewall performance in dynamic networks by invoking a novel<i>swapping window</i>–based paradigm","year":2018,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Firewall (physics); Computer science; Stateful firewall; The Internet; Distributed computing; Application firewall; Computer network; Network packet; Entropy (arrow of time); World Wide Web","score_opus":0.014186334842152565,"score_gpt":0.2638186931382118,"score_spread":0.24963235829605926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884096875","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.069173336,0.00014446364,0.927075,0.00030823378,0.000042085045,0.00005269317,0.000024292372,0.00047694813,0.0027028746],"genre_scores_gemma":[0.83706385,0.000104947765,0.16136512,0.0001437658,0.00004062897,0.000063751904,0.00004403962,0.00009192171,0.0010818441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904996,0.00032763454,0.000045469224,0.00015945538,0.0002783647,0.0001390772],"domain_scores_gemma":[0.99655056,0.0020099613,0.00045313212,0.00043169197,0.00039603893,0.00015855575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028739106,0.0007272239,0.00067945523,0.00045088085,0.00043785712,0.0011575001,0.0016924153,0.0010539829,0.0012871897],"category_scores_gemma":[0.0062543685,0.00030513416,0.000391243,0.00036960831,0.0009200475,0.002115619,0.0009947066,0.001557921,0.00024202414],"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.00020314053,0.00022806403,0.0014325767,0.000041462627,0.000038315186,0.00003530905,0.00003768902,0.90130967,0.01446085,0.023479149,0.000873522,0.057860266],"study_design_scores_gemma":[0.000005479224,0.00004293793,0.000063238964,0.0000019182135,0.0000024549233,0.000006665306,0.0000038802414,0.9958475,0.0016903736,0.002197106,0.00013536408,0.0000031370275],"about_ca_topic_score_codex":0.0019012151,"about_ca_topic_score_gemma":0.0017119332,"teacher_disagreement_score":0.0028739106,"about_ca_system_score_codex":0.0010001032,"about_ca_system_score_gemma":0.0014195957,"threshold_uncertainty_score":0.015198886},"labels":[],"label_agreement":null},{"id":"W2951338582","doi":"10.1002/dac.4011","title":"An online resource allocation algorithm to minimize system interference for inband underlay D2D communications","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Underlay; Exploit; Resource allocation; Scheduling (production processes); Algorithm; Interference (communication); Computer network; Real-time computing; Distributed computing; Mathematical optimization; Telecommunications; Channel (broadcasting); Signal-to-noise ratio (imaging); Mathematics","score_opus":0.03382496607157273,"score_gpt":0.3050460754952459,"score_spread":0.27122110942367317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951338582","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.028278729,0.00019894064,0.9676077,0.00010038954,0.000039613547,0.00005631203,0.00003625484,0.00028779713,0.003394394],"genre_scores_gemma":[0.74519634,0.00013218311,0.25064248,0.00011786325,0.000047357345,0.00016002459,0.00009619672,0.000060042075,0.0035475406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995425,0.00013365688,0.000022585034,0.000101338,0.00009498666,0.00010499076],"domain_scores_gemma":[0.99947256,0.0002793914,0.00007243858,0.000041042054,0.000099095225,0.000035433844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052396394,0.00074517843,0.0010410814,0.0004858625,0.0004320965,0.0007687009,0.00097219326,0.00062374724,0.0025133959],"category_scores_gemma":[0.0011451151,0.00028032213,0.00031507775,0.00055023,0.00035965795,0.00061580923,0.0007210091,0.00053176685,0.00042003574],"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.00016363272,0.00013275909,0.00054511195,0.00006244836,0.000037886526,0.00007458247,0.00005270523,0.87580293,0.0067557404,0.004520816,0.0020323368,0.10981904],"study_design_scores_gemma":[0.000013850947,0.00002619754,0.0000714951,0.0000022122047,0.000004370814,0.000020735248,0.000007742767,0.99807906,0.0006436137,0.00087477796,0.0002529431,0.0000029751554],"about_ca_topic_score_codex":0.0029964794,"about_ca_topic_score_gemma":0.0026583844,"teacher_disagreement_score":0.0029964794,"about_ca_system_score_codex":0.00058922113,"about_ca_system_score_gemma":0.0011134106,"threshold_uncertainty_score":0.008408189},"labels":[],"label_agreement":null},{"id":"W2955555619","doi":"10.1002/dac.4068","title":"Multiobjective virtual machine placement mechanisms using nature‐inspired metaheuristic algorithms in cloud environments: A comprehensive review","year":2019,"lang":"en","type":"review","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":80,"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":"Computer science; Cloud computing; Virtual machine; Distributed computing; Data center; Server; Virtualization; Metaheuristic; Live migration; Algorithm; Operating system","score_opus":0.05492322179682044,"score_gpt":0.3513142969743593,"score_spread":0.2963910751775388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955555619","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013818386,0.98811483,0.007328542,0.00030090692,0.00015965721,0.000023435694,0.000029250787,0.00003131586,0.002630231],"genre_scores_gemma":[0.012911732,0.97812474,0.0077663898,0.00015012284,0.00020616571,0.000031176634,0.00007542922,0.0000142842155,0.0007199772],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963593,0.00007272331,0.00004702289,0.000068734305,0.00014344994,0.000031991007],"domain_scores_gemma":[0.9992718,0.0004461282,0.00008417247,0.0000209889,0.00015405218,0.00002285638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008285843,0.0010452555,0.0012261379,0.0022248493,0.00028343388,0.0012658131,0.0012177025,0.00097320153,0.001606024],"category_scores_gemma":[0.001606827,0.000435195,0.0012541363,0.0038703582,0.00031514413,0.001060751,0.00051086285,0.0008268188,0.00057258067],"study_design_candidate":"not_applicable","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.00006563257,0.00014956728,0.00065365375,0.01737019,0.00027649454,0.00014445467,0.000071637754,0.023117902,0.0015641596,0.010750846,0.008323387,0.937512],"study_design_scores_gemma":[0.00007660284,0.0007777507,0.00448979,0.01741806,0.0013331829,0.002179162,0.00038686255,0.08073094,0.006293356,0.025732206,0.860357,0.000225051],"about_ca_topic_score_codex":0.0019276895,"about_ca_topic_score_gemma":0.0016908854,"teacher_disagreement_score":0.0022248493,"about_ca_system_score_codex":0.00060664525,"about_ca_system_score_gemma":0.0010413403,"threshold_uncertainty_score":0.0053726435},"labels":[],"label_agreement":null},{"id":"W2965941389","doi":"10.1002/dac.4006","title":"Spectral efficiency evaluation of full‐duplex mode of communications based on SLNR approach","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; Precoding; Spectral efficiency; Computer science; Base station; Rician fading; Electronic engineering; Telecommunications; Channel (broadcasting); MIMO; Fading; Engineering","score_opus":0.040351098206608205,"score_gpt":0.3136831533712388,"score_spread":0.2733320551646306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965941389","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.4756463,0.0017327383,0.4900017,0.00029567213,0.000090649875,0.00008447072,0.00019573959,0.0007665909,0.031186147],"genre_scores_gemma":[0.9818881,0.00024027425,0.016749382,0.00003125942,0.000009310343,0.000025252848,0.000058497382,0.000013830704,0.0009839976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991285,0.00028101422,0.000028600702,0.000098459466,0.00034437957,0.00011908484],"domain_scores_gemma":[0.99839705,0.0007248068,0.00012669095,0.00018455324,0.0005271505,0.00003979879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003315,0.0005372208,0.00037067925,0.0006522282,0.00033988585,0.00060135114,0.00043263272,0.0005120836,0.0017732794],"category_scores_gemma":[0.0014735851,0.00012831604,0.00031953029,0.0005608417,0.00048414804,0.0006459151,0.00044691222,0.00030455927,0.00040689667],"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.0013359049,0.00021815173,0.007103035,0.00042522905,0.00018276658,0.00037369053,0.00033464053,0.64024305,0.1233516,0.03397939,0.002391601,0.19006097],"study_design_scores_gemma":[0.000016398992,0.0004669249,0.0017675292,0.00002601036,0.000033884913,0.00022358904,0.000090252026,0.9558834,0.037274156,0.0027134842,0.0014708552,0.000033503944],"about_ca_topic_score_codex":0.001210973,"about_ca_topic_score_gemma":0.0010173024,"teacher_disagreement_score":0.0017732794,"about_ca_system_score_codex":0.00055186264,"about_ca_system_score_gemma":0.00043770706,"threshold_uncertainty_score":0.0059321523},"labels":[],"label_agreement":null},{"id":"W2969471624","doi":"10.1002/dac.4100","title":"Optimal location management in LTE networks using evolutionary techniques","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Paging; Overhead (engineering); Robustness (evolution); Particle swarm optimization; Ant colony optimization algorithms; Computer network; User equipment; Evolutionary algorithm; Distributed computing; Algorithm; Base station; Artificial intelligence","score_opus":0.01205972676826096,"score_gpt":0.2715035538107681,"score_spread":0.2594438270425071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969471624","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.20213942,0.00063899887,0.7886834,0.00035924412,0.00005657015,0.000050094288,0.000044830118,0.00014178641,0.007885622],"genre_scores_gemma":[0.9574374,0.00014322276,0.04115934,0.000042589545,0.000013054387,0.000041817122,0.00002993995,0.000010161842,0.0011225074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998319,0.00006188843,0.000007833992,0.000021403803,0.000042995336,0.000033870143],"domain_scores_gemma":[0.99968016,0.0001692769,0.0000492343,0.00002013631,0.00006559276,0.000015698604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005034558,0.00038556173,0.00045355046,0.00042523022,0.00034098444,0.000655766,0.00042869654,0.0006284842,0.00058451423],"category_scores_gemma":[0.0013375124,0.00024031797,0.0004078483,0.00038071602,0.00033460127,0.00037510804,0.00043526303,0.00029358242,0.00008454796],"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.000018521285,0.000010604289,0.00038180174,0.000008349829,0.0000097862585,0.00001740126,0.000012640348,0.98884493,0.0005423972,0.0014175385,0.00012823819,0.00860779],"study_design_scores_gemma":[0.0000029383946,0.00001109387,0.00011940646,0.0000016746556,0.000002633249,0.0000040485816,0.000005407149,0.9992859,0.00010942117,0.00038290702,0.00007322171,0.000001434254],"about_ca_topic_score_codex":0.0093864035,"about_ca_topic_score_gemma":0.0053856988,"teacher_disagreement_score":0.0093864035,"about_ca_system_score_codex":0.00066768023,"about_ca_system_score_gemma":0.00067135075,"threshold_uncertainty_score":0.018663526},"labels":[],"label_agreement":null},{"id":"W2972481902","doi":"10.1002/dac.4174","title":"Energy consumption optimization for self‐powered IoT networks with non‐orthogonal multiple access","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":22,"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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Time division multiple access; Data transmission; Computer network; Wireless; Transmission (telecommunications); Node (physics); Energy consumption; Energy harvesting; Internet of Things; Software deployment; Wireless network; Noma; Energy (signal processing); Telecommunications; Electrical engineering; Embedded system","score_opus":0.012886799739135238,"score_gpt":0.2472382280049695,"score_spread":0.23435142826583427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972481902","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.19836286,0.0011393863,0.7896535,0.00051765476,0.00007285673,0.00006900148,0.00014097606,0.00010346905,0.009940345],"genre_scores_gemma":[0.978905,0.0002913051,0.018295612,0.00004146343,0.000020565154,0.00005313865,0.00003458009,0.000014688088,0.0023436788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996045,0.00016539654,0.000011994068,0.000056180685,0.000090833084,0.000071098664],"domain_scores_gemma":[0.9992569,0.00047851744,0.00009000264,0.000038585225,0.00010662149,0.000029247292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007954858,0.000529743,0.0006298027,0.00037906622,0.00029358242,0.0007708236,0.0005789989,0.0005159992,0.0011511517],"category_scores_gemma":[0.0010534714,0.00025446652,0.00036385658,0.0006408338,0.0004222053,0.0007221606,0.0006253845,0.0003696187,0.00010354826],"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.000044482684,0.000030853804,0.00043649986,0.000046713714,0.000027383772,0.00006231933,0.00002093153,0.9815902,0.0022823089,0.007146292,0.00037079386,0.007941195],"study_design_scores_gemma":[0.0000026053988,0.000019128878,0.00013184897,0.0000017449701,0.0000036727931,0.000009673642,0.0000098585315,0.9977507,0.00018778947,0.0017639102,0.000117022784,0.0000020252512],"about_ca_topic_score_codex":0.0017152694,"about_ca_topic_score_gemma":0.0017013558,"teacher_disagreement_score":0.0017152694,"about_ca_system_score_codex":0.00077679876,"about_ca_system_score_gemma":0.00053642463,"threshold_uncertainty_score":0.005636096},"labels":[],"label_agreement":null},{"id":"W2992831948","doi":"10.1002/dac.4242","title":"Optimal spectrum utilisation in cognitive radio networks based on processor sharing techniques","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":4,"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 Manitoba","funders":"","keywords":"Cognitive radio; Computer science; Underlay; Queueing theory; Queue; Transmission (telecommunications); Interference (communication); Mathematical optimization; Channel (broadcasting); Cognitive network; Function (biology); Transmitter power output; Computer network; Telecommunications; Transmitter; Signal-to-noise ratio (imaging); Wireless","score_opus":0.021063885600667034,"score_gpt":0.28766866805325925,"score_spread":0.2666047824525922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992831948","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.23584117,0.00085962977,0.7527476,0.00023713338,0.000053371015,0.000058784088,0.000020896961,0.00014747246,0.010033939],"genre_scores_gemma":[0.9758637,0.00012764198,0.02324109,0.000024852086,0.000010798708,0.000029701816,0.000005667074,0.00001147151,0.00068511476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936503,0.0002151831,0.000017575056,0.000076223034,0.00014060225,0.00018538235],"domain_scores_gemma":[0.99888235,0.00082033017,0.000114546434,0.00004380822,0.00010047656,0.000038422073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011605163,0.0005244431,0.000777725,0.0005323851,0.00028177013,0.0008484809,0.0005769724,0.00055635476,0.0006581158],"category_scores_gemma":[0.0024247724,0.00038805557,0.000432395,0.0004966867,0.0010621111,0.0007597057,0.00076867815,0.00053999515,0.00010254266],"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.000063075364,0.000040043884,0.00020543992,0.000026720476,0.000022237014,0.00003991711,0.00003634092,0.97418416,0.003217563,0.007913273,0.00017069926,0.01408055],"study_design_scores_gemma":[0.00000583578,0.000027931184,0.0000762446,0.0000038567405,0.0000053049307,0.000014053096,0.000008735116,0.99439454,0.0006263513,0.004725065,0.00010776224,0.0000042729816],"about_ca_topic_score_codex":0.0022954228,"about_ca_topic_score_gemma":0.0016566293,"teacher_disagreement_score":0.0022954228,"about_ca_system_score_codex":0.0008420355,"about_ca_system_score_gemma":0.0010740049,"threshold_uncertainty_score":0.0061374903},"labels":[],"label_agreement":null},{"id":"W2994431616","doi":"10.1002/dac.4063","title":"Dynamic process location management in 5G","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","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":"Université du Québec à Montréal; Ericsson (Canada)","funders":"","keywords":"Computer science; Latency (audio); Distributed computing; Cloud computing; Mobile edge computing; Wireless network; Radio access network; Computer network; Orchestration; Quality of service; Software-defined networking; Wireless; Virtualization; Operating system; Base station","score_opus":0.011801745855884976,"score_gpt":0.2856843815322308,"score_spread":0.27388263567634585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994431616","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.0572176,0.0009383386,0.9352329,0.00053385133,0.00011526377,0.000061297804,0.000064902255,0.0008125028,0.005023362],"genre_scores_gemma":[0.95641905,0.00028906975,0.041193236,0.000060966348,0.000035139346,0.000028221742,0.000054928063,0.000019126808,0.0019003969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994691,0.00010981835,0.00002995537,0.00013668678,0.00013051105,0.0001240786],"domain_scores_gemma":[0.9996076,0.0001227633,0.000073262614,0.00006925835,0.00009599837,0.000031015603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005537186,0.00058881025,0.0006251253,0.0005031703,0.0009390908,0.0015809513,0.0009204508,0.00074217253,0.0017531685],"category_scores_gemma":[0.0010996803,0.0002274108,0.00040597163,0.00074249436,0.0005497215,0.0013510726,0.0010752933,0.0006024118,0.00032363422],"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.00017296601,0.000057775134,0.001417282,0.000074424046,0.000027178372,0.00020346044,0.00012456777,0.85583586,0.00885246,0.028924467,0.0019441927,0.102365404],"study_design_scores_gemma":[0.000013186674,0.000045821613,0.00021254791,0.000005640056,0.00001515019,0.000044411663,0.000036858542,0.9896348,0.00246715,0.00558633,0.0019267617,0.000011369617],"about_ca_topic_score_codex":0.0071021095,"about_ca_topic_score_gemma":0.0058622668,"teacher_disagreement_score":0.0071021095,"about_ca_system_score_codex":0.0014650912,"about_ca_system_score_gemma":0.0013159084,"threshold_uncertainty_score":0.014121532},"labels":[],"label_agreement":null},{"id":"W2995137043","doi":"10.1002/dac.4277","title":"Stochastic geometry of network of randomly distributed moving vehicles on a highway","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Vehicular Ad Hoc Networks (VANETs)","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":"Western University","funders":"","keywords":"Computer science; Probabilistic logic; Stochastic geometry; Cluster (spacecraft); Wireless ad hoc network; Vehicular ad hoc network; Statistical model; Distribution (mathematics); Rayleigh fading; Fading; Statistical physics; Distributed computing; Topology (electrical circuits); Computer network; Telecommunications; Wireless; Artificial intelligence; Mathematics; Statistics; Mathematical analysis; Physics","score_opus":0.007813242049808893,"score_gpt":0.2259556702916144,"score_spread":0.2181424282418055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995137043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5454212,0.0010739644,0.43735936,0.0013981326,0.00010042032,0.0001371021,0.0015005376,0.00023362145,0.012775776],"genre_scores_gemma":[0.9890409,0.00048266834,0.0069906884,0.000043981687,0.00003992939,0.00006532198,0.0003648243,0.000015428483,0.0029561731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.00028625026,0.000026515347,0.00017540298,0.00017014197,0.000114126226],"domain_scores_gemma":[0.9981719,0.0006879999,0.0005297164,0.000079003,0.00038743907,0.00014383887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007857123,0.00040266293,0.0006061225,0.0013042687,0.0005322684,0.0009333636,0.0011609752,0.0006330687,0.0014263435],"category_scores_gemma":[0.0025527573,0.00037653037,0.0004324585,0.00084870006,0.0011077669,0.000986595,0.00084455905,0.00041087676,0.00028786063],"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.000047366266,0.000010894782,0.0042243656,0.000030097928,0.000021178434,0.00034210263,0.00006353697,0.93195355,0.0010538423,0.059819017,0.00084379443,0.0015902532],"study_design_scores_gemma":[0.000009253111,0.000036272028,0.002349681,0.000007780628,0.000008889452,0.00013739744,0.00006330564,0.98198974,0.0001946499,0.01438506,0.0007989943,0.000019060404],"about_ca_topic_score_codex":0.010275545,"about_ca_topic_score_gemma":0.0047677476,"teacher_disagreement_score":0.010275545,"about_ca_system_score_codex":0.001713612,"about_ca_system_score_gemma":0.0005901916,"threshold_uncertainty_score":0.020431459},"labels":[],"label_agreement":null},{"id":"W2998854585","doi":"10.1002/dac.4309","title":"An SDN approach to route massive data flows of sensor networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":17,"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; Computer network; Distributed computing; Scalability; Routing protocol; Network packet; Network architecture; Software-defined networking; Node (physics)","score_opus":0.07304946422371607,"score_gpt":0.3090730002540853,"score_spread":0.23602353603036924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998854585","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.0050899494,0.00032857855,0.9903746,0.0002623947,0.00018324183,0.00007773879,0.00003995217,0.00037073452,0.0032727912],"genre_scores_gemma":[0.3407798,0.0009097863,0.6493149,0.0002324534,0.00017678135,0.0002790493,0.0003028094,0.00008903989,0.007915363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947757,0.00014369817,0.000055594923,0.00008637588,0.00019865914,0.00003808806],"domain_scores_gemma":[0.9995135,0.0001347966,0.000032484622,0.00007395648,0.0002113086,0.000033980275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012170625,0.00033092668,0.00031607447,0.00078270043,0.00058946013,0.001107875,0.0010868111,0.0005444465,0.0015454581],"category_scores_gemma":[0.0012369197,0.00024048965,0.00043529744,0.00051900075,0.00055544975,0.0011360504,0.00078541663,0.0008980759,0.0002627028],"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.00017380476,0.000116066796,0.0015462636,0.00022148105,0.00014249705,0.00028081593,0.00025352504,0.53358084,0.016419884,0.20335317,0.006675974,0.23723564],"study_design_scores_gemma":[0.000016881597,0.000034585308,0.00009441317,0.00001797237,0.000016115277,0.0000385784,0.000025301153,0.9615081,0.002540575,0.025045015,0.010653773,0.000008753806],"about_ca_topic_score_codex":0.0035633468,"about_ca_topic_score_gemma":0.0047267764,"teacher_disagreement_score":0.0035633468,"about_ca_system_score_codex":0.00083740393,"about_ca_system_score_gemma":0.0009965503,"threshold_uncertainty_score":0.007085204},"labels":[],"label_agreement":null},{"id":"W3001985868","doi":"10.1002/dac.4325","title":"Distributed parallel algorithms for online virtual network embedding applications","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network virtualization; Scalability; Embedding; Distributed computing; Latency (audio); Virtualization; Algorithm; Parallel computing; Cloud computing","score_opus":0.05047591075901323,"score_gpt":0.326580362996954,"score_spread":0.2761044522379407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001985868","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.023259751,0.00024844726,0.97162074,0.00034409182,0.00008436869,0.00007534037,0.000033624452,0.00056674366,0.0037669456],"genre_scores_gemma":[0.50309014,0.00023147395,0.49065623,0.00015344865,0.00007941952,0.00028059707,0.0001430322,0.00016097639,0.00520475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936336,0.000175656,0.000033135824,0.00015234502,0.00016216749,0.00011342307],"domain_scores_gemma":[0.9989531,0.0005329525,0.00009969809,0.000110589084,0.00024131092,0.000062347004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411859,0.0009154301,0.0008102634,0.0005911514,0.00068631826,0.0009221498,0.001194367,0.0009455375,0.0031821115],"category_scores_gemma":[0.002255191,0.00035855302,0.00063653843,0.0007789443,0.0007039097,0.00082799705,0.0010247475,0.0012583091,0.00055886974],"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.00008827032,0.00008921506,0.00040726975,0.000053270152,0.00002029443,0.000052641248,0.000040013943,0.92758733,0.0019121217,0.013183779,0.0013817773,0.05518407],"study_design_scores_gemma":[0.000013097034,0.00000980281,0.00002210773,0.0000015544609,0.0000020148934,0.000007151195,0.000005813969,0.9955461,0.00026991763,0.003818846,0.00030199805,0.0000015586218],"about_ca_topic_score_codex":0.00433824,"about_ca_topic_score_gemma":0.0037994843,"teacher_disagreement_score":0.00433824,"about_ca_system_score_codex":0.0010926208,"about_ca_system_score_gemma":0.0015748708,"threshold_uncertainty_score":0.010645211},"labels":[],"label_agreement":null},{"id":"W3009032439","doi":"10.1002/dac.4364","title":"Message trust‐based secure multipath routing protocol for opportunistic networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":18,"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; Computer network; Communication source; Encryption; Latency (audio); Routing protocol; Multipath propagation; Routing (electronic design automation); Multipath routing; Disjoint sets; Wireless Routing Protocol; Telecommunications; Channel (broadcasting)","score_opus":0.08319818159866635,"score_gpt":0.34025056688206723,"score_spread":0.2570523852834009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009032439","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.0751924,0.0011854575,0.9138253,0.00071602594,0.00028777705,0.00037052916,0.00022713467,0.0017756697,0.006419778],"genre_scores_gemma":[0.9278319,0.00035912526,0.068602085,0.00010814583,0.000047627458,0.00024655354,0.00020893222,0.00003119689,0.0025644323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992637,0.00019079783,0.00007235828,0.0000758155,0.00028776494,0.000109513945],"domain_scores_gemma":[0.998727,0.00043100317,0.00028241248,0.00020901825,0.00028082417,0.00006973494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082767056,0.0003934145,0.00043508358,0.0006263942,0.000601199,0.00067998026,0.0007643951,0.0004984739,0.00075376325],"category_scores_gemma":[0.0027209362,0.00017303225,0.0003400022,0.00052206154,0.0004303587,0.0010854774,0.0014101067,0.00068864645,0.0001985076],"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.0011531112,0.00022345768,0.0035496585,0.00075110194,0.0002953616,0.0016286997,0.0010503428,0.35410252,0.0907475,0.15073599,0.014983741,0.38077852],"study_design_scores_gemma":[0.00010364921,0.0003954353,0.00071444194,0.000045464105,0.00008454771,0.0006382486,0.00014124617,0.91691613,0.020587018,0.031046163,0.0292485,0.00007919823],"about_ca_topic_score_codex":0.00177295,"about_ca_topic_score_gemma":0.0015999883,"teacher_disagreement_score":0.00177295,"about_ca_system_score_codex":0.0007734303,"about_ca_system_score_gemma":0.0012294134,"threshold_uncertainty_score":0.005611658},"labels":[],"label_agreement":null},{"id":"W3013458600","doi":"10.1002/dac.4404","title":"Interference‐aware clustering approach improving QoS for linear WSNs using a token‐based MAC protocol","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","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":"Université du Québec en Abitibi-Témiscamingue","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior; Simons Foundation","keywords":"Computer science; Computer network; Wireless sensor network; Network packet; Quality of service; Key distribution in wireless sensor networks; Wireless; Wireless network; Telecommunications","score_opus":0.08840784577188943,"score_gpt":0.33642699602807974,"score_spread":0.2480191502561903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013458600","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.117175296,0.0005032517,0.87585837,0.00028463427,0.00013484168,0.00012723163,0.0000476893,0.0011666827,0.0047018905],"genre_scores_gemma":[0.9002598,0.00020469022,0.09703671,0.00006111729,0.000033419732,0.00006725191,0.000056233795,0.000050292074,0.0022305707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996729,0.00007939664,0.00002155761,0.0000730385,0.00009687811,0.000056266832],"domain_scores_gemma":[0.99936944,0.00020975014,0.00007634392,0.00007562016,0.00022043976,0.000048404334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056098955,0.00040688636,0.00034464695,0.0005749062,0.00052877486,0.00057465746,0.0010843225,0.0002963883,0.0011328727],"category_scores_gemma":[0.0010017524,0.00013103904,0.00031286987,0.00041336223,0.00033902354,0.00066738634,0.00063808216,0.00033809608,0.0002858241],"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.0005538394,0.00023461595,0.0026177717,0.00027452805,0.000110865476,0.0003245464,0.00026000658,0.67808604,0.112619795,0.014989181,0.0036209342,0.18630785],"study_design_scores_gemma":[0.000009136068,0.00007663927,0.0002638082,0.0000035879345,0.000017757202,0.00005324172,0.00003459193,0.98936206,0.0083195185,0.0009514686,0.00089526677,0.000012905735],"about_ca_topic_score_codex":0.0025997753,"about_ca_topic_score_gemma":0.0022437668,"teacher_disagreement_score":0.0025997753,"about_ca_system_score_codex":0.0008045553,"about_ca_system_score_gemma":0.0008111046,"threshold_uncertainty_score":0.0058375},"labels":[],"label_agreement":null},{"id":"W3017172570","doi":"10.1002/dac.4416","title":"A mathematical framework for effective routing over low power and lossy networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"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 Ottawa","funders":"","keywords":"Lossy compression; Computer science; Network packet; Routing (electronic design automation); Ranking (information retrieval); Field (mathematics); Routing protocol; Range (aeronautics); Duty cycle; Power consumption; Power (physics); The Internet; Computer network; Data mining; Artificial intelligence; World Wide Web","score_opus":0.016370138264266986,"score_gpt":0.29131621846498573,"score_spread":0.27494608020071876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017172570","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.00186508,0.00087809167,0.98959583,0.000686554,0.00012693276,0.000029409903,0.00005874858,0.000058167447,0.006701126],"genre_scores_gemma":[0.45116544,0.007852204,0.5146053,0.001034364,0.0017515116,0.0009322585,0.00031251952,0.0002459358,0.02210054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881554,0.0004260797,0.00006878132,0.00015226715,0.00042689926,0.00011048868],"domain_scores_gemma":[0.9964824,0.0021514338,0.00041753036,0.00018120786,0.0006428363,0.00012458202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032869158,0.0012563481,0.0007689844,0.0021806343,0.00079421065,0.0025793223,0.0018230522,0.0013772662,0.0030415212],"category_scores_gemma":[0.008236771,0.00053949095,0.0011597716,0.0012509736,0.0019568224,0.0033848735,0.0014772726,0.0023891781,0.000896165],"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.000006214335,0.000020958965,0.00014447489,0.00009691236,0.00001763142,0.000088933215,0.00008210182,0.17553976,0.0007977718,0.8136951,0.0026359216,0.006874154],"study_design_scores_gemma":[0.0000041799567,0.000017959685,0.000065523476,0.00003537269,0.000008033094,0.0000617527,0.000027109134,0.79562014,0.00013481818,0.19946834,0.004544875,0.000011918154],"about_ca_topic_score_codex":0.0021302346,"about_ca_topic_score_gemma":0.0016596066,"teacher_disagreement_score":0.0032869158,"about_ca_system_score_codex":0.0024145988,"about_ca_system_score_gemma":0.0013971386,"threshold_uncertainty_score":0.017519236},"labels":[],"label_agreement":null},{"id":"W3026895989","doi":"10.1002/dac.4445","title":"Smart communications for autonomous systems in network technologies","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"IoT and Edge/Fog Computing","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":"Western University","funders":"","keywords":"Computer science; Cloud computing; Scalability; Smart grid; Software portability; Modular design; The Internet; Telecommunications; Distributed computing; Computer security; World Wide Web","score_opus":0.0604182890686264,"score_gpt":0.3082511262007523,"score_spread":0.2478328371321259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026895989","genre_codex":"other","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.004060788,0.1440865,0.14927875,0.075699285,0.037321717,0.0002992997,0.00059403817,0.0012186536,0.58744097],"genre_scores_gemma":[0.17121053,0.22606155,0.09633027,0.039460972,0.03397032,0.0012719413,0.0014297945,0.0007051356,0.4295594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984309,0.0005206537,0.00009323009,0.00025122458,0.00057411456,0.00012983798],"domain_scores_gemma":[0.99868935,0.00050998956,0.00012480984,0.00026179446,0.00030841044,0.00010558243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012875716,0.0009138623,0.0006472869,0.0011114659,0.0012147179,0.0043738275,0.00082345196,0.0035800934,0.019405883],"category_scores_gemma":[0.0028599764,0.00027822985,0.00042845344,0.0014555078,0.0031026807,0.0052391994,0.00254446,0.0048619276,0.00810216],"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.000019938721,0.00002762568,0.0001676408,0.00026951334,0.000012272438,0.00012808556,0.00022993548,0.0007349302,0.0008157994,0.8512314,0.07491459,0.07144828],"study_design_scores_gemma":[0.000009547337,0.000035814894,0.00017618843,0.00032891135,0.0000094740235,0.00023777672,0.00006449411,0.0015417427,0.0003449862,0.24138738,0.75584865,0.000014949545],"about_ca_topic_score_codex":0.0008878371,"about_ca_topic_score_gemma":0.00080923364,"teacher_disagreement_score":0.019405883,"about_ca_system_score_codex":0.0017311564,"about_ca_system_score_gemma":0.0017082252,"threshold_uncertainty_score":0.064919114},"labels":[],"label_agreement":null},{"id":"W3093166033","doi":"10.1002/dac.4646","title":"Random forest classifier‐based safe and reliable routing for opportunistic IoT networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":10,"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; Computer network; Network packet; Routing protocol; Packet forwarding; Latency (audio); Distributed computing","score_opus":0.05667167923689002,"score_gpt":0.2830995292083495,"score_spread":0.2264278499714595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093166033","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.12067368,0.00070081826,0.87064886,0.00073934597,0.00022347497,0.00027189133,0.0005936235,0.0027340844,0.0034142048],"genre_scores_gemma":[0.8213443,0.0002803401,0.17422166,0.00017780178,0.00012375048,0.00019772367,0.001278489,0.000097737044,0.0022781005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.00017900152,0.000053657193,0.00016739266,0.00027908638,0.0001880091],"domain_scores_gemma":[0.9971648,0.0012672557,0.00032972824,0.00036646414,0.00077521586,0.000096584095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002170137,0.00071290135,0.00086687226,0.0015127842,0.00078482454,0.0007139777,0.0012561417,0.0008390245,0.0010785552],"category_scores_gemma":[0.00422548,0.00026349345,0.00068566087,0.00082369766,0.0003493663,0.001001918,0.00049981964,0.00089915894,0.0004986357],"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.00024651297,0.00020976922,0.0067027165,0.00008711637,0.00009450604,0.00022726943,0.000056810335,0.6662052,0.0058671916,0.005256782,0.008380936,0.3066651],"study_design_scores_gemma":[0.0000049478804,0.000028423736,0.0003433323,0.000003769782,0.0000060646234,0.000025919873,0.000008104937,0.9972293,0.00053590955,0.001440276,0.0003692668,0.000004715559],"about_ca_topic_score_codex":0.012995353,"about_ca_topic_score_gemma":0.011915454,"teacher_disagreement_score":0.012995353,"about_ca_system_score_codex":0.0010091696,"about_ca_system_score_gemma":0.0017272317,"threshold_uncertainty_score":0.025839448},"labels":[],"label_agreement":null},{"id":"W3107066755","doi":"10.1002/dac.4658","title":"Modified spider monkey optimization—An enhanced optimization of spectrum sharing in cognitive radio networks","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Cognitive radio; Network packet; Scheduling (production processes); Optimization problem; Throughput; False alarm; Computer network; Handover; Radio spectrum; Real-time computing; Quality of service; Wireless; Algorithm; Mathematical optimization; Telecommunications; Artificial intelligence","score_opus":0.03602974748164497,"score_gpt":0.2872658492612096,"score_spread":0.2512361017795647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107066755","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.11671336,0.00095826684,0.86689115,0.00054871006,0.00010968305,0.000086174005,0.00006518977,0.0002464832,0.014380955],"genre_scores_gemma":[0.92779773,0.00025365458,0.06807386,0.00016663893,0.000042049945,0.00012477406,0.00005677823,0.00004522716,0.0034392544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996855,0.00014318069,0.000008920395,0.000041221887,0.00007260094,0.000048584916],"domain_scores_gemma":[0.99957305,0.00023787843,0.000047498976,0.000021016684,0.000086106134,0.000034409375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194592,0.00051756366,0.0007371598,0.00048533946,0.00030002053,0.00053801277,0.00061445433,0.00072744396,0.0014155188],"category_scores_gemma":[0.0013613546,0.00023647874,0.0005414516,0.00044151949,0.0004835535,0.00043728776,0.00068217446,0.00044795056,0.00013340665],"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.000039878087,0.000028759561,0.00037652344,0.000030600615,0.000030208625,0.00005139753,0.000017157729,0.98333377,0.0010345256,0.004380503,0.00048202145,0.010194575],"study_design_scores_gemma":[0.0000034793422,0.000021216272,0.000054697583,0.000001987194,0.0000023755763,0.000007816188,0.0000032627283,0.9983736,0.00007652466,0.0012692949,0.00018409907,0.0000015786011],"about_ca_topic_score_codex":0.0030153205,"about_ca_topic_score_gemma":0.0015132503,"teacher_disagreement_score":0.0030153205,"about_ca_system_score_codex":0.0005126091,"about_ca_system_score_gemma":0.00075051957,"threshold_uncertainty_score":0.005995512},"labels":[],"label_agreement":null},{"id":"W3113300757","doi":"10.1002/dac.4702","title":"Design of quantum‐dot cellular automata‐based communication system using modular N‐bit binary to gray and gray to binary converters","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Quantum-Dot Cellular Automata","field":"Computer Science","cited_by":20,"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 Saskatchewan","funders":"Cancer Research Society","keywords":"Converters; Computer science; Gray code; Quantum dot cellular automaton; Binary number; Electronic engineering; Modular design; CMOS; Dissipation; Power (physics); Algorithm; Cellular automaton; Arithmetic; Mathematics; Engineering","score_opus":0.05313985511986732,"score_gpt":0.28248245568387975,"score_spread":0.22934260056401243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113300757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67862856,0.0008125749,0.28227732,0.00070107746,0.00030512866,0.000227021,0.00025194333,0.0013761807,0.03542006],"genre_scores_gemma":[0.96584785,0.00008961556,0.03127335,0.00005244566,0.000007389618,0.0000658362,0.00003713964,0.0000078815565,0.0026184123],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999912,0.000012557734,0.000007443647,0.000026095606,0.0000273478,0.000014651743],"domain_scores_gemma":[0.9999186,0.000014581278,0.000015261387,0.000012997359,0.000029618763,0.00000900452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006943306,0.00015258083,0.00022416658,0.00014012425,0.0003648957,0.00042521057,0.000455381,0.00033165974,0.0020064255],"category_scores_gemma":[0.00015160828,0.00011042676,0.00022070504,0.00016964693,0.00019761246,0.00026900016,0.00015616466,0.00015162765,0.0003478034],"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.00029534116,0.00017768503,0.0025868902,0.00036988582,0.00010638914,0.0007189254,0.00029432384,0.1541902,0.7076173,0.056871794,0.0039079953,0.07286344],"study_design_scores_gemma":[0.00005508242,0.00036641906,0.00089179754,0.000025412728,0.0000424587,0.00021252161,0.00004879478,0.82910967,0.15514392,0.0034716437,0.010589879,0.000042483978],"about_ca_topic_score_codex":0.0017684377,"about_ca_topic_score_gemma":0.0019466691,"teacher_disagreement_score":0.0020064255,"about_ca_system_score_codex":0.0004662921,"about_ca_system_score_gemma":0.00037790783,"threshold_uncertainty_score":0.0067121387},"labels":[],"label_agreement":null},{"id":"W3114904922","doi":"10.1002/dac.4691","title":"Distributed parallel genetic algorithm for online virtual network embedding","year":2020,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network virtualization; Distributed computing; Virtual network; Embedding; Node (physics); Virtualization; Computer network; The Internet; Heterogeneous network; Orchestration; Cloud computing; Wireless network; Operating system; Artificial intelligence","score_opus":0.03433580126525338,"score_gpt":0.3005300169221476,"score_spread":0.2661942156568942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114904922","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.0412052,0.00041125383,0.949731,0.0003907949,0.00011210025,0.00011161637,0.000059852282,0.00060643343,0.007371804],"genre_scores_gemma":[0.64895123,0.00022440597,0.34371024,0.00019976198,0.000033518747,0.00033016354,0.00016070397,0.000088819106,0.0063011497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996718,0.0001073543,0.000013365295,0.0000692702,0.00007510666,0.000063184656],"domain_scores_gemma":[0.9993375,0.00039978523,0.00004300351,0.00003387994,0.00015407642,0.000031835152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063008844,0.0007403966,0.0008939238,0.0007923541,0.00054847717,0.0007508883,0.0009140683,0.0011225748,0.0025062715],"category_scores_gemma":[0.001686901,0.0003395639,0.0006657864,0.0006751994,0.00056808593,0.0005267976,0.00067744986,0.00091548945,0.00031164332],"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.000028465905,0.000033486125,0.0003391549,0.000021995027,0.000018060964,0.000035664227,0.000026090263,0.96564716,0.00060337223,0.0041747307,0.0006321421,0.028439589],"study_design_scores_gemma":[0.0000067671576,0.00000733851,0.000028566486,0.0000015534788,0.0000024074109,0.000004357188,0.0000038964054,0.998755,0.000096983655,0.0009113252,0.0001802471,0.0000015332337],"about_ca_topic_score_codex":0.011923113,"about_ca_topic_score_gemma":0.00791621,"teacher_disagreement_score":0.011923113,"about_ca_system_score_codex":0.0010440417,"about_ca_system_score_gemma":0.0017713256,"threshold_uncertainty_score":0.02370739},"labels":[],"label_agreement":null},{"id":"W3120205414","doi":"10.1002/dac.4744","title":"Special issue on “Ubiquitous clouds and communication networks”","year":2021,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"IoT and Edge/Fog Computing","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":"St. Francis Xavier University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Flexibility (engineering); Ubiquitous computing; The Internet; Data science; World Wide Web; Telecommunications; Computer security; Human–computer interaction","score_opus":0.020729097824196966,"score_gpt":0.28839327246230484,"score_spread":0.2676641746381079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120205414","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039115577,0.014775446,0.001033628,0.017517906,0.9409076,0.00012296066,0.00035021885,0.00028331662,0.024617733],"genre_scores_gemma":[0.0019695535,0.015966406,0.00046675673,0.005518695,0.92590016,0.00008944959,0.00052699214,0.00027312463,0.049288902],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99671906,0.00036578125,0.00030556048,0.0006472936,0.0015528655,0.0004093818],"domain_scores_gemma":[0.9900148,0.0019585642,0.0009007521,0.00059497036,0.004408865,0.0021221251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024768584,0.002615726,0.0026956482,0.0051911976,0.0026403277,0.010233908,0.0022888072,0.0044321823,0.08695977],"category_scores_gemma":[0.007577456,0.00066356047,0.001996517,0.0027126032,0.0012098985,0.0061022136,0.0026799391,0.0056314375,0.041944116],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000030447563,0.00002209173,0.00011224168,0.0003168074,0.000014847197,0.000104977255,0.000027657992,0.000058555597,0.0002674488,0.0018823682,0.9815595,0.015603024],"study_design_scores_gemma":[0.000007822922,0.000040485225,0.00034948575,0.00028918797,0.000015968566,0.00026854215,0.000037383343,0.00014811254,0.00015273808,0.001010749,0.9976673,0.000012307583],"about_ca_topic_score_codex":0.00070562685,"about_ca_topic_score_gemma":0.0011920796,"teacher_disagreement_score":0.08695977,"about_ca_system_score_codex":0.002207712,"about_ca_system_score_gemma":0.0024498526,"threshold_uncertainty_score":0.29090947},"labels":[],"label_agreement":null},{"id":"W3183236562","doi":"10.1002/dac.4920","title":"Diagnostic and troubleshooting of OpenFlow‐enabled switches using kernel and userspace traces","year":2021,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":4,"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; Troubleshooting; OpenFlow; Forwarding plane; Software-defined networking; Debugging; Linux kernel; Software; Embedded system; Networking hardware; Operating system; Distributed computing; Computer network; Network packet","score_opus":0.030218860172925174,"score_gpt":0.2869613358329965,"score_spread":0.2567424756600713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183236562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8568244,0.0002166679,0.12101157,0.00016623076,0.00007919297,0.00016258938,0.00035816547,0.019091541,0.002089663],"genre_scores_gemma":[0.97957283,0.000028555838,0.019762265,0.000019908171,0.0000045605543,0.000015482174,0.00014386309,0.00011673276,0.00033584758],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847156,0.00028193396,0.00011809777,0.00028450394,0.0006757609,0.00016815856],"domain_scores_gemma":[0.9943288,0.0024421858,0.0007265196,0.0009943172,0.0009955654,0.00051268336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013313149,0.0008076418,0.00044520423,0.002764008,0.00035151164,0.00088060164,0.0013501297,0.00064136746,0.0012748913],"category_scores_gemma":[0.0061139343,0.00023833597,0.00027210324,0.00074423995,0.00047120175,0.0008247163,0.0008987491,0.0007021142,0.00023280243],"study_design_candidate":"bench_or_experimental","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.002709531,0.0011304365,0.18086562,0.00054494466,0.00024063964,0.0057066297,0.0035156317,0.1711472,0.14688355,0.0062363325,0.0072487476,0.47377083],"study_design_scores_gemma":[0.00005252636,0.00040146374,0.015687302,0.000069429814,0.00004896098,0.0006014466,0.0005333209,0.9038895,0.07397913,0.0020418337,0.002622165,0.00007291603],"about_ca_topic_score_codex":0.0022380394,"about_ca_topic_score_gemma":0.002126283,"teacher_disagreement_score":0.002764008,"about_ca_system_score_codex":0.00070528995,"about_ca_system_score_gemma":0.0007158571,"threshold_uncertainty_score":0.007040739},"labels":[],"label_agreement":null},{"id":"W3206613984","doi":"10.1002/dac.5002","title":"Body sensor network encryption and team user authentication scheme based on electrocardiogram detector","year":2021,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Body Area Networks","field":"Engineering","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Authentication (law); Encryption; Computer security; Fingerprint (computing); Wireless sensor network; Wearable computer; Computer network; Body area network; Mobile phone; Embedded system; Telecommunications","score_opus":0.008375609466958403,"score_gpt":0.23592108136268333,"score_spread":0.22754547189572494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206613984","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.21450832,0.0015870356,0.76242584,0.0010700028,0.000607906,0.0007245534,0.00038796235,0.0019178543,0.016770536],"genre_scores_gemma":[0.938914,0.00028191102,0.053045828,0.00012923777,0.000053690746,0.00016637621,0.0002522226,0.000013734863,0.0071428902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892527,0.00030712475,0.00012336724,0.00017335828,0.00031475665,0.00015609559],"domain_scores_gemma":[0.9991856,0.00011663226,0.00011818933,0.00022761956,0.0003065855,0.000045415934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005241435,0.00035197256,0.00048152782,0.0005071159,0.00052856375,0.00050625746,0.00058518874,0.0006004271,0.001835853],"category_scores_gemma":[0.0010741932,0.00010707477,0.00040316838,0.00034702558,0.00022791658,0.0009431163,0.0007187554,0.00047971,0.0007309208],"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.002559532,0.0004677657,0.0089356005,0.00055886817,0.00024663194,0.0017661916,0.00054653623,0.03746031,0.42022616,0.06670414,0.013862594,0.44666567],"study_design_scores_gemma":[0.00031285346,0.0017126508,0.0074392385,0.00012396513,0.00017474736,0.0059521175,0.00015593528,0.6339756,0.29936913,0.008001074,0.0426027,0.00017994916],"about_ca_topic_score_codex":0.00037854732,"about_ca_topic_score_gemma":0.0003085386,"teacher_disagreement_score":0.001835853,"about_ca_system_score_codex":0.00040138056,"about_ca_system_score_gemma":0.00046506585,"threshold_uncertainty_score":0.0061415434},"labels":[],"label_agreement":null},{"id":"W378615090","doi":"","title":"Token bank fair queuing: a new scheduling algorithm for wireless multimedia services: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"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 British Columbia; Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Fair queuing; Quality of service; Scheduling (production processes); Proportionally fair; Token bucket; Wireless network; Wireless; Network packet; Algorithm; Distributed computing; Round-robin scheduling; Dynamic priority scheduling; Telecommunications","score_opus":0.035061693411313787,"score_gpt":0.3294789878201315,"score_spread":0.29441729440881775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W378615090","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.005007435,0.002169235,0.98867655,0.00038397236,0.00049868616,0.000094065246,0.00004957543,0.00070106814,0.0024193644],"genre_scores_gemma":[0.25142464,0.004666486,0.7317906,0.0004392462,0.0011887929,0.00026430798,0.00023246805,0.00029231864,0.009701178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.00018058182,0.000053999374,0.00012325759,0.00035150113,0.00010666487],"domain_scores_gemma":[0.99923277,0.00029615292,0.00007307586,0.000083384366,0.00025441844,0.000060268645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020208007,0.000687343,0.00078206335,0.0009393163,0.0008138744,0.0018172719,0.0018052652,0.0011626574,0.0027165972],"category_scores_gemma":[0.0033245208,0.00027902494,0.00040931083,0.0016676863,0.0009936151,0.0026684387,0.00067387,0.0012574585,0.00080148614],"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.000407329,0.00020275782,0.0009180623,0.00028877478,0.00008131529,0.00011072334,0.0001460651,0.28248256,0.012968386,0.18927988,0.018325673,0.49478853],"study_design_scores_gemma":[0.000052191088,0.00007158852,0.00012563098,0.000020345598,0.00002554625,0.00007222641,0.000016463458,0.946085,0.0027105734,0.027676871,0.023118084,0.00002553916],"about_ca_topic_score_codex":0.004564608,"about_ca_topic_score_gemma":0.0030458462,"teacher_disagreement_score":0.004564608,"about_ca_system_score_codex":0.0017703224,"about_ca_system_score_gemma":0.0022124103,"threshold_uncertainty_score":0.012844622},"labels":[],"label_agreement":null},{"id":"W4230777068","doi":"10.1002/dac.935","title":"Call for Papers: ‘<i>Security in Mobile Wireless Networks</i>’","year":2008,"lang":"en","type":"paratext","venue":"International Journal of Communication Systems","topic":"IPv6, Mobility, Handover, Networks, Security","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":"Concordia University","funders":"","keywords":"Computer science; Computer network; Roaming; Computer security; Mobile computing; Wireless network; Telecommunications; Wireless","score_opus":0.013237376607070377,"score_gpt":0.2694338898820484,"score_spread":0.25619651327497805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230777068","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043537116,0.012507599,0.0025522746,0.09721957,0.6427608,0.00091783446,0.0020328064,0.0007780843,0.24079564],"genre_scores_gemma":[0.0027365026,0.009151453,0.0018733542,0.01634573,0.113924526,0.0004739925,0.002454774,0.00095519057,0.85208446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99417984,0.00064093975,0.00037448131,0.0006747021,0.003566855,0.00056313747],"domain_scores_gemma":[0.9699425,0.0040219887,0.0013329148,0.0016217714,0.016623909,0.0064568543],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0074237613,0.001992173,0.0018884895,0.0028941804,0.0027389782,0.012381259,0.0039631887,0.009006207,0.3770996],"category_scores_gemma":[0.024216235,0.00067923253,0.0024389522,0.004079031,0.0011806211,0.007591968,0.0027060234,0.0047625666,0.29884103],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000013276146,0.000010733331,0.000033804517,0.000089406516,0.0000030725387,0.000017656805,0.000006506711,0.000020728554,0.00004877172,0.00085369917,0.9907582,0.008144194],"study_design_scores_gemma":[0.0000104430965,0.000018106191,0.00020495954,0.00011717433,0.0000034789362,0.000021581614,0.000028205772,0.000051863564,0.000055020624,0.0006893883,0.99879223,0.000007667412],"about_ca_topic_score_codex":0.0026851213,"about_ca_topic_score_gemma":0.004658452,"teacher_disagreement_score":0.62290037,"about_ca_system_score_codex":0.0041091973,"about_ca_system_score_gemma":0.004501263,"threshold_uncertainty_score":0.8884918},"labels":[],"label_agreement":null},{"id":"W4232091376","doi":"10.1002/dac.877","title":"An adaptive multiuser detector for DS‐CDMA systems in multipath fading channels","year":2007,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Computer science; Code division multiple access; Multiuser detection; Multipath propagation; Detector; Single antenna interference cancellation; Upper and lower bounds; Algorithm; Channel (broadcasting); Interference (communication); Electronic engineering; Telecommunications; Mathematics","score_opus":0.06886006477311706,"score_gpt":0.37132444584626045,"score_spread":0.3024643810731434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232091376","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.34484726,0.00059579604,0.6519102,0.0001289747,0.00003598768,0.000042175176,0.000026002956,0.00023772879,0.0021758724],"genre_scores_gemma":[0.93273044,0.00013733265,0.06611123,0.00003481923,0.000011391569,0.00002077102,0.000016012042,0.000007452792,0.0009306636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957305,0.00013525819,0.0000096293825,0.000053012544,0.00017874457,0.0000503296],"domain_scores_gemma":[0.9987979,0.0008055397,0.00009337097,0.000056202363,0.0002152013,0.000031866002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007774949,0.0003203572,0.0003543573,0.00024399703,0.00021547553,0.00047749234,0.00036064847,0.00050502917,0.0005305083],"category_scores_gemma":[0.0024417369,0.0001997017,0.00018868533,0.00023163606,0.000350531,0.00041867053,0.0003592719,0.0004211447,0.00013827544],"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.0007765245,0.00014520418,0.0078931395,0.00013486946,0.00016777798,0.00023407595,0.00018256856,0.72589195,0.13241072,0.01605305,0.00054168596,0.1155684],"study_design_scores_gemma":[0.000013045819,0.000118902135,0.0005041665,0.000003317516,0.000010991979,0.000058638063,0.0000075160715,0.9858671,0.012343768,0.00082541246,0.00023804538,0.000009098837],"about_ca_topic_score_codex":0.0011076201,"about_ca_topic_score_gemma":0.001139693,"teacher_disagreement_score":0.0011076201,"about_ca_system_score_codex":0.0004019672,"about_ca_system_score_gemma":0.0006024546,"threshold_uncertainty_score":0.0041118264},"labels":[],"label_agreement":null},{"id":"W4232286640","doi":"10.1002/dac.943","title":"An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto de Sistemas Complejos de Ingeniería","keywords":"Computer science; Decoding methods; Huffman coding; Binary tree; Fano plane; Algorithm; Binary number; Coding (social sciences); Encoding (memory); Theoretical computer science; Data compression; Tree (set theory); Adaptive coding; Lossless compression; Tree structure; Artificial intelligence; Mathematics; Arithmetic","score_opus":0.11674254211507488,"score_gpt":0.36150142307126976,"score_spread":0.24475888095619486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232286640","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.074743286,0.000679881,0.91946566,0.0002380608,0.000101573285,0.00013899583,0.00020781108,0.000967166,0.0034575104],"genre_scores_gemma":[0.48591977,0.00047871447,0.5097822,0.00018527606,0.00007458441,0.00019413914,0.0004980051,0.000112495116,0.0027547234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971455,0.00006138947,0.000023448989,0.000039884162,0.00013241361,0.000028302233],"domain_scores_gemma":[0.99903417,0.00035719492,0.00007863104,0.0002482476,0.00024522163,0.00003659132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004579738,0.0002616901,0.00028787932,0.0010858203,0.000426495,0.0005616969,0.0007245091,0.00038607555,0.001205089],"category_scores_gemma":[0.0021089972,0.00012724247,0.00020595556,0.0014812646,0.00048355607,0.0013822359,0.0005210787,0.0004634733,0.00035034088],"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.0003322446,0.00013430574,0.0014678547,0.00022768244,0.000041790292,0.00023815969,0.00036293242,0.10098875,0.0751057,0.08999019,0.007998921,0.72311157],"study_design_scores_gemma":[0.00005725001,0.00021551497,0.0009319938,0.000041692754,0.000029671015,0.00046231408,0.000093257084,0.8952178,0.051433757,0.03612883,0.015341843,0.000046035377],"about_ca_topic_score_codex":0.0011701554,"about_ca_topic_score_gemma":0.0013793258,"teacher_disagreement_score":0.001205089,"about_ca_system_score_codex":0.0004368078,"about_ca_system_score_gemma":0.000535202,"threshold_uncertainty_score":0.0040314198},"labels":[],"label_agreement":null},{"id":"W4235181959","doi":"10.1002/dac.1124","title":"Performance analysis of a cell‐based call admission control scheme for QoS support in multimedia wireless networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"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 Guelph","funders":"","keywords":"Computer science; Computer network; Call Admission Control; Handover; Quality of service; Bandwidth (computing); Queueing theory; Admission control; Bandwidth allocation; Wireless; Call blocking; Provisioning; Wireless network; Blocking (statistics); Telecommunications","score_opus":0.020031371796830073,"score_gpt":0.31434784320381837,"score_spread":0.2943164714069883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235181959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75917387,0.0009957419,0.23476999,0.00034024956,0.0001297025,0.000116236624,0.000041849813,0.00068653264,0.0037457985],"genre_scores_gemma":[0.9966654,0.000037075322,0.0030797787,0.000015525078,0.000008880461,0.000008882536,0.0000062637087,0.000003173857,0.0001749599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986994,0.0003740935,0.000037583533,0.00010151426,0.00054997805,0.00023728212],"domain_scores_gemma":[0.9962368,0.0022683453,0.00029329848,0.00021117016,0.00074640475,0.00024394802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022859701,0.00063572236,0.00051709916,0.00071234757,0.0008369062,0.0010336742,0.0010755827,0.0008236109,0.0008432407],"category_scores_gemma":[0.0050846324,0.00020577027,0.00024535076,0.00053553976,0.00092748133,0.00053721084,0.0005699785,0.000772214,0.00010486268],"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.0021845864,0.0005516387,0.0082220975,0.00010957874,0.00015833075,0.00035462665,0.00034207597,0.79362655,0.082567565,0.021598045,0.0014888877,0.088796],"study_design_scores_gemma":[0.000009102828,0.00007674306,0.0002927019,0.0000015625006,0.000010831257,0.00001790882,0.000008534696,0.9970619,0.002182256,0.00027332062,0.000058460715,0.000006641986],"about_ca_topic_score_codex":0.009574667,"about_ca_topic_score_gemma":0.0036655872,"teacher_disagreement_score":0.009574667,"about_ca_system_score_codex":0.002170368,"about_ca_system_score_gemma":0.0011946406,"threshold_uncertainty_score":0.019037843},"labels":[],"label_agreement":null},{"id":"W4235707930","doi":"10.1002/dac.1012","title":"A novel service evolution approach for active services in ubiquitous computing","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Service (business); Reuse; Mobile QoS; Differentiated service; Quality of service; Service design; Service delivery framework; Personalization; Service discovery; Ubiquitous computing; Service provider; Data as a service; Process (computing); Computer network; Web service; World Wide Web; Human–computer interaction; Operating system; Engineering","score_opus":0.01750700130518141,"score_gpt":0.28409638950314176,"score_spread":0.26658938819796035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235707930","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.02105791,0.0002189317,0.97607285,0.00013245667,0.000025950862,0.00008885556,0.000014169704,0.0006299436,0.0017589938],"genre_scores_gemma":[0.4337945,0.0002561142,0.562078,0.00014632984,0.00004830972,0.00017605157,0.00011395746,0.00010563876,0.0032811677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883205,0.00037124872,0.00007032285,0.00015599308,0.0005030882,0.00006728606],"domain_scores_gemma":[0.99901855,0.00032234009,0.000091944574,0.00020983073,0.00027304856,0.00008423014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012173901,0.00039582714,0.00047869157,0.00087164267,0.0004956451,0.00086284283,0.0013237711,0.00083594496,0.0009588306],"category_scores_gemma":[0.00264664,0.0002241136,0.0006781381,0.00093335554,0.00058575906,0.0013508018,0.0011477197,0.0008725521,0.0003311397],"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.00023264822,0.0004394116,0.0025308637,0.00023796916,0.0001321771,0.0004729816,0.00094991823,0.097469136,0.05262083,0.09474053,0.0033357448,0.7468378],"study_design_scores_gemma":[0.00003361528,0.000106680716,0.0004502993,0.000015639598,0.000037816673,0.00037250697,0.000068144385,0.95918906,0.011597021,0.017699894,0.010404101,0.000025178726],"about_ca_topic_score_codex":0.0024653065,"about_ca_topic_score_gemma":0.0015938317,"teacher_disagreement_score":0.0024653065,"about_ca_system_score_codex":0.0006918431,"about_ca_system_score_gemma":0.00062105415,"threshold_uncertainty_score":0.0064382553},"labels":[],"label_agreement":null},{"id":"W4237498632","doi":"10.1002/dac.949","title":"Symbol detection in spatial multiplexing system using particle swarm optimization meta‐heuristics","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; MIMO; Particle swarm optimization; Detector; Spatial multiplexing; Algorithm; Bit error rate; Reduction (mathematics); Computational complexity theory; Heuristics; Convergence (economics); Multiplexing; Swarm intelligence; Communications system; Channel (broadcasting); Mathematics; Telecommunications; Decoding methods","score_opus":0.05320433408325118,"score_gpt":0.28888406828221935,"score_spread":0.23567973419896818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237498632","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.11741673,0.0008700002,0.8768594,0.00034924253,0.00006701905,0.000070145055,0.00003467012,0.00026110935,0.004071631],"genre_scores_gemma":[0.9010901,0.00020304475,0.09690132,0.00012892434,0.000028058965,0.00008941765,0.000037664962,0.00002014192,0.0015014127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995914,0.0001869141,0.00002008512,0.000045468012,0.00009003767,0.00006594531],"domain_scores_gemma":[0.9977342,0.0017255113,0.0001931054,0.000059311027,0.00021983363,0.00006805421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013544892,0.0007252386,0.001075984,0.0007610828,0.0003483604,0.0009812715,0.00062847487,0.00096196367,0.0006366097],"category_scores_gemma":[0.002893279,0.0004367037,0.0004818251,0.00055935705,0.00065174414,0.00059507065,0.00062988675,0.0005956364,0.00012195937],"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.000045764762,0.000020708509,0.00030884278,0.00002053525,0.00004111366,0.000017285753,0.000020108566,0.9842897,0.0004328066,0.002430093,0.00019005671,0.012183087],"study_design_scores_gemma":[0.0000059814884,0.000014124339,0.000029917854,0.0000016432818,0.0000033791123,0.0000027969402,0.0000022908853,0.9993699,0.00011026572,0.00042480565,0.000033209755,0.0000016548424],"about_ca_topic_score_codex":0.004290872,"about_ca_topic_score_gemma":0.0029105172,"teacher_disagreement_score":0.004290872,"about_ca_system_score_codex":0.00095940137,"about_ca_system_score_gemma":0.0009595836,"threshold_uncertainty_score":0.008531809},"labels":[],"label_agreement":null},{"id":"W4237504221","doi":"10.1002/dac.1095","title":"An energy‐efficient scheme in next‐generation sensor networks","year":2010,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Wireless sensor network; Energy consumption; Computer network; Node (physics); Quality of service; Next-generation network; Efficient energy use; Scheme (mathematics); Broadband; Exploit; Wireless; Key distribution in wireless sensor networks; Wireless network; Telecommunications; Electrical engineering; Computer security; The Internet","score_opus":0.026499590640428835,"score_gpt":0.2793116255992595,"score_spread":0.25281203495883064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237504221","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.0954737,0.0011757046,0.89806724,0.00038281092,0.00011923193,0.00007748248,0.000029668,0.00031714808,0.0043570246],"genre_scores_gemma":[0.9041807,0.00032238246,0.09384209,0.00010468292,0.000023966968,0.00004054403,0.000032468368,0.000012563452,0.0014405664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962187,0.0001500886,0.000019788818,0.000063125124,0.0001004618,0.00004468172],"domain_scores_gemma":[0.99955946,0.0001618876,0.000062481246,0.000090313326,0.0001002861,0.000025571551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072538963,0.00032817447,0.00030878757,0.00036874728,0.00039192764,0.0003417585,0.0009855818,0.0005542936,0.00085791334],"category_scores_gemma":[0.0013514489,0.00015224729,0.00019657024,0.0005637699,0.0004654899,0.0009273805,0.000771958,0.00036132333,0.0001557655],"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.00032946377,0.0001333534,0.0009140337,0.0001901261,0.000060279297,0.00024258156,0.00017368594,0.6765103,0.05127279,0.064198405,0.0022519876,0.20372306],"study_design_scores_gemma":[0.000019189236,0.00011822896,0.00023223508,0.000010333302,0.000010434112,0.00012762706,0.000034854616,0.97646743,0.009136009,0.011462019,0.002370019,0.0000115829425],"about_ca_topic_score_codex":0.00056097616,"about_ca_topic_score_gemma":0.00084313424,"teacher_disagreement_score":0.0009855818,"about_ca_system_score_codex":0.00045157527,"about_ca_system_score_gemma":0.00035423925,"threshold_uncertainty_score":0.0038362741},"labels":[],"label_agreement":null},{"id":"W4242545016","doi":"10.1002/dac.1030","title":"Special issue on ubiquitous wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"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; University of Guelph","funders":"","keywords":"Computer science; Computer network; Municipal wireless network; Wireless network; Wireless WAN; Wireless mesh network; Wireless broadband; Wi-Fi array; Heterogeneous network; Wireless; Fixed wireless; Telecommunications","score_opus":0.015583226395364096,"score_gpt":0.2813549329301287,"score_spread":0.2657717065347646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242545016","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058381737,0.0343752,0.0023675123,0.023586247,0.89430493,0.00023213342,0.00034266384,0.00030913996,0.043898363],"genre_scores_gemma":[0.0032224432,0.0357172,0.0013443741,0.007045743,0.8300198,0.00017988314,0.0007559977,0.0003236714,0.121390946],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966953,0.00043519822,0.00034425646,0.0006316961,0.0014945316,0.00039901884],"domain_scores_gemma":[0.9918783,0.0014687156,0.00060303905,0.00051470246,0.003585489,0.0019498112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029629173,0.0021314532,0.002775993,0.0037086215,0.0023523867,0.0071454304,0.0025329082,0.0041418336,0.08037007],"category_scores_gemma":[0.0067279586,0.00063422037,0.0018730058,0.0025222301,0.0010360028,0.005316326,0.0028384419,0.0049143326,0.038500138],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003112884,0.00003665573,0.00016898211,0.000336476,0.000017217066,0.0001271885,0.000026649483,0.00009811397,0.00028476637,0.002108523,0.96664935,0.030115033],"study_design_scores_gemma":[0.000007594982,0.000038263956,0.0003187719,0.00022531245,0.000015659512,0.00020564256,0.000034641802,0.00020257024,0.000104742656,0.0009952408,0.99784064,0.0000109101375],"about_ca_topic_score_codex":0.00077773316,"about_ca_topic_score_gemma":0.0014182458,"teacher_disagreement_score":0.08037007,"about_ca_system_score_codex":0.0019526297,"about_ca_system_score_gemma":0.0021945073,"threshold_uncertainty_score":0.2688647},"labels":[],"label_agreement":null},{"id":"W4244373021","doi":"10.1002/dac.933","title":"Survivable traffic grooming with non‐service‐interruptive wavelength retuning in a WDM mesh network","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Nortel (Canada)","funders":"","keywords":"Traffic grooming; Computer science; Computer network; Backup; Wavelength-division multiplexing; Bandwidth (computing); Blocking (statistics); Path (computing); Optical mesh network; Wavelength; Mesh networking; Distributed computing; Telecommunications; Optics; Physics","score_opus":0.02165613066145683,"score_gpt":0.24553795876712528,"score_spread":0.22388182810566845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244373021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6453202,0.00046586964,0.3505262,0.00023289707,0.00005081286,0.00005384898,0.00003554414,0.0005279785,0.0027865998],"genre_scores_gemma":[0.96064204,0.000090408306,0.03860805,0.00002535468,0.000015125755,0.000017162938,0.000021160135,0.000007975032,0.0005726848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998074,0.000067648405,0.00000950378,0.00002911048,0.000050938255,0.00003542865],"domain_scores_gemma":[0.9996439,0.00014087197,0.00006971208,0.00007124808,0.000052356732,0.000021896103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038199264,0.00022930045,0.0002125766,0.0003422021,0.0003643684,0.00028400193,0.0006417157,0.00031587988,0.00044761016],"category_scores_gemma":[0.00067712774,0.00011121349,0.00021810664,0.00027479898,0.00041553358,0.000658399,0.0004166146,0.00023354965,0.000058343594],"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.0010600786,0.0002567783,0.0060792435,0.00023380645,0.000118914504,0.00084829587,0.00045421833,0.55547124,0.17480864,0.026635904,0.0015485211,0.2324844],"study_design_scores_gemma":[0.000034680597,0.00017430827,0.0006257421,0.000007234384,0.000022218368,0.0001662728,0.000033371572,0.97987384,0.012964095,0.004802998,0.0012858117,0.000009311467],"about_ca_topic_score_codex":0.0012007527,"about_ca_topic_score_gemma":0.0010484238,"teacher_disagreement_score":0.0012007527,"about_ca_system_score_codex":0.00033360047,"about_ca_system_score_gemma":0.00016433849,"threshold_uncertainty_score":0.002420485},"labels":[],"label_agreement":null},{"id":"W4245964686","doi":"10.1002/dac.947","title":"An energy‐efficient localized topology control algorithm for wireless<i>ad hoc</i>and sensor networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"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 Ottawa","funders":"","keywords":"Topology control; Computer science; Wireless sensor network; Wireless ad hoc network; Computer network; Topology (electrical circuits); Network topology; Mobile wireless sensor network; Wireless network; Distributed computing; Optimized Link State Routing Protocol; Logical topology; Overhead (engineering); Mobile ad hoc network; Algorithm; Routing protocol; Key distribution in wireless sensor networks; Wireless; Routing (electronic design automation); Network packet; Mathematics; Telecommunications","score_opus":0.013511404362145237,"score_gpt":0.2666373892939119,"score_spread":0.25312598493176663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245964686","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.04674507,0.00026244458,0.9509132,0.00015171133,0.000029828068,0.000054215398,0.000011993533,0.00050615415,0.0013254309],"genre_scores_gemma":[0.8214117,0.00019184369,0.17653736,0.00007795956,0.000031696847,0.000120325974,0.000052322455,0.00004178135,0.0015350094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984944,0.00004412978,0.0000100845,0.00003595481,0.000042729083,0.000017594039],"domain_scores_gemma":[0.99958366,0.00016937811,0.000100342484,0.000041993488,0.000074582145,0.000030066796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003827295,0.00035378363,0.00037170778,0.000590407,0.0004349613,0.0004925963,0.00066559,0.0003919153,0.0006610712],"category_scores_gemma":[0.0011264258,0.00014107909,0.00021979699,0.00034304368,0.00047401537,0.0008018559,0.00049426104,0.0004002774,0.0001137326],"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.00024048534,0.00013730841,0.0012696293,0.00012535955,0.00005096678,0.00021091948,0.00026231562,0.59702766,0.048296254,0.032324385,0.0033563396,0.3166984],"study_design_scores_gemma":[0.0000362616,0.00012430389,0.00014323057,0.0000066480616,0.00001287807,0.0000773139,0.0000223608,0.9877121,0.0064171134,0.0041094343,0.0013292618,0.000009077676],"about_ca_topic_score_codex":0.0009987744,"about_ca_topic_score_gemma":0.0009145801,"teacher_disagreement_score":0.0009987744,"about_ca_system_score_codex":0.00039953974,"about_ca_system_score_gemma":0.00045325895,"threshold_uncertainty_score":0.0028989315},"labels":[],"label_agreement":null},{"id":"W4247013557","doi":"10.1002/dac.995","title":"Wavelength retuning without service interruption in an all‐optical survivable network","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Backup; Computer science; Blocking (statistics); Computer network; Path (computing); Heuristic; Scheme (mathematics); Call blocking; Path protection; Real-time computing; Distributed computing; Quality of service; Wavelength; Wavelength-division multiplexing; Mathematics","score_opus":0.04154448108416619,"score_gpt":0.31817426732691995,"score_spread":0.27662978624275375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247013557","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.45230895,0.0007215496,0.54334617,0.00026127836,0.00006357638,0.0000795108,0.000041914554,0.00063728954,0.0025397798],"genre_scores_gemma":[0.9192855,0.00011210872,0.07985435,0.000041474177,0.000015644544,0.000026350828,0.000025487809,0.00001541281,0.00062349957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995901,0.00015184819,0.000021421289,0.00006371912,0.00010791057,0.00006488941],"domain_scores_gemma":[0.99934775,0.00021272438,0.00013603794,0.00017152159,0.000086695574,0.00004525537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005000748,0.0002836618,0.00039583188,0.00037809936,0.00050461915,0.0003477807,0.0009895015,0.00038870386,0.0005172927],"category_scores_gemma":[0.0011635898,0.00020371891,0.00020707597,0.0003821986,0.00046992875,0.000768476,0.00046577482,0.00038258103,0.000094229144],"study_design_candidate":"bench_or_experimental","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.0010755438,0.0002659649,0.002697637,0.00035803128,0.00009819754,0.00048146932,0.0004518293,0.54382676,0.09249706,0.017682182,0.00186165,0.3387036],"study_design_scores_gemma":[0.000072907336,0.00028120846,0.00057009404,0.000016825652,0.00003398039,0.00031468543,0.000064371496,0.9742666,0.01602377,0.0065629915,0.0017738852,0.000018680243],"about_ca_topic_score_codex":0.0012375194,"about_ca_topic_score_gemma":0.0016689991,"teacher_disagreement_score":0.0012375194,"about_ca_system_score_codex":0.00045132893,"about_ca_system_score_gemma":0.00048546094,"threshold_uncertainty_score":0.0032746196},"labels":[],"label_agreement":null},{"id":"W4249406078","doi":"10.1002/dac.1035","title":"On convexity of MQAM's and MPAM's bit error probability functions","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Convexity; Computer science; Probability of error; Term (time); Taylor series; Algorithm; Series (stratigraphy); Regular polygon; Applied mathematics; Mathematics","score_opus":0.02508906894029776,"score_gpt":0.2928679921282597,"score_spread":0.2677789231879619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249406078","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.050407708,0.0013561875,0.9102162,0.0017933254,0.00009867646,0.000057927744,0.0003024315,0.0001619321,0.035605658],"genre_scores_gemma":[0.91100353,0.0026643742,0.07438319,0.0006459084,0.0003768724,0.0003414681,0.00026383618,0.00042951814,0.009891259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978193,0.00089567143,0.000076279015,0.00021275197,0.0007154071,0.0002806278],"domain_scores_gemma":[0.9798147,0.015421557,0.0010274686,0.0011602752,0.002269264,0.00030671153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049268263,0.0015499583,0.0012152652,0.0016949082,0.0010635488,0.0034424525,0.0015252257,0.0011524782,0.0051626205],"category_scores_gemma":[0.024898434,0.0007838267,0.001044259,0.0011607308,0.005064665,0.0046115373,0.0029004745,0.0032123087,0.0011998022],"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.000092125716,0.000020428199,0.00048511324,0.00009708762,0.000023376213,0.00024829342,0.00017475805,0.1648454,0.0024820073,0.8189833,0.0026588337,0.009889266],"study_design_scores_gemma":[0.000009553613,0.000030078712,0.0005220286,0.00006234249,0.0000122291785,0.00027107706,0.000056981356,0.6825542,0.0022344354,0.3118497,0.0023634182,0.00003399165],"about_ca_topic_score_codex":0.0020788675,"about_ca_topic_score_gemma":0.0008033538,"teacher_disagreement_score":0.0051626205,"about_ca_system_score_codex":0.0024830857,"about_ca_system_score_gemma":0.0014574954,"threshold_uncertainty_score":0.026055872},"labels":[],"label_agreement":null},{"id":"W4249440023","doi":"10.1002/dac.886","title":"Analysis of a clock‐recovery technique for circuit emulation services over packet networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Synchronous optical networking; Clock synchronization; Computer network; End-to-end delay; Network packet; Clock drift; Processing delay; Emulation; Real-time computing; Timing failure; Transmission delay; Clock skew; Network delay; Synchronization (alternating current); Clock signal; Telecommunications; Channel (broadcasting); Jitter","score_opus":0.014175317387845466,"score_gpt":0.2853929809202363,"score_spread":0.27121766353239085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249440023","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.12839253,0.00027326023,0.86897486,0.00010121425,0.000016092208,0.000055478133,0.00001717004,0.00030944927,0.0018599328],"genre_scores_gemma":[0.96580815,0.00010778189,0.03338073,0.000014753569,0.000010214638,0.00001970202,0.000017624232,0.000028384628,0.00061266555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993618,0.00015676994,0.000014668616,0.000057097863,0.00034828295,0.00006148486],"domain_scores_gemma":[0.9984091,0.0009926083,0.00023276127,0.000113662296,0.00022229688,0.000029499965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008868225,0.00037341524,0.0002688976,0.00042737246,0.00024490835,0.00043026783,0.0004941595,0.00038622943,0.00092611875],"category_scores_gemma":[0.004018348,0.0001606573,0.00033588335,0.00039380472,0.0004152932,0.00039007288,0.000333687,0.0004532611,0.00012856723],"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.00021889551,0.00008361218,0.001641346,0.00009663811,0.00004876846,0.00016698668,0.00006466578,0.8468336,0.06451901,0.023673944,0.00045768515,0.06219493],"study_design_scores_gemma":[0.0000022484815,0.00002497286,0.00012681297,0.0000016582362,0.00000437439,0.000021967946,0.00000267013,0.9949083,0.004407968,0.00036702913,0.00013014751,0.0000019169986],"about_ca_topic_score_codex":0.0011630069,"about_ca_topic_score_gemma":0.00042907282,"teacher_disagreement_score":0.0011630069,"about_ca_system_score_codex":0.00093183754,"about_ca_system_score_gemma":0.0005775771,"threshold_uncertainty_score":0.0067610145},"labels":[],"label_agreement":null},{"id":"W4250203847","doi":"10.1002/dac.976","title":"An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Shortest Path Faster Algorithm; Algorithm; Floyd–Warshall algorithm; Graph; K shortest path routing; Theoretical computer science","score_opus":0.04909891223916364,"score_gpt":0.3075747939105659,"score_spread":0.2584758816714023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250203847","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.012467423,0.000078155186,0.9865621,0.0001022938,0.000018360848,0.000026476133,0.000031120348,0.00018946838,0.00052462734],"genre_scores_gemma":[0.6420262,0.000213672,0.35438555,0.00015966735,0.0000639331,0.00030300583,0.00026539213,0.00010425446,0.0024783348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991054,0.0002863788,0.000064841115,0.00024449185,0.00021082786,0.00008810936],"domain_scores_gemma":[0.9956142,0.003096272,0.00026220726,0.0002774206,0.0005961829,0.00015375993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017216261,0.00077710825,0.0014297339,0.0012581048,0.0005532222,0.0013603838,0.0019367335,0.0013093606,0.0018954219],"category_scores_gemma":[0.008936211,0.0006174036,0.0008902929,0.00095892843,0.0011641347,0.0018920602,0.0020602616,0.0016160004,0.00035462936],"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.00006204416,0.000032300417,0.00084455806,0.000045618443,0.000037317543,0.00003235224,0.000058725025,0.9407874,0.00088015205,0.012613177,0.00039301038,0.04421343],"study_design_scores_gemma":[0.0000019298568,0.0000075485505,0.000022430851,0.0000016523494,0.000001309669,0.0000029750345,0.0000032906141,0.9972907,0.00011321752,0.0024919307,0.00006124676,0.0000017892773],"about_ca_topic_score_codex":0.005692359,"about_ca_topic_score_gemma":0.0035157541,"teacher_disagreement_score":0.005692359,"about_ca_system_score_codex":0.0010736969,"about_ca_system_score_gemma":0.0014775151,"threshold_uncertainty_score":0.011318445},"labels":[],"label_agreement":null},{"id":"W4253687311","doi":"10.1002/dac.982","title":"Call for Papers: ‘<i>Ubiquitous Wireless Mesh Networks</i>’","year":2008,"lang":"en","type":"paratext","venue":"International Journal of Communication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Citation; Library science; Computer science","score_opus":0.03266889711511964,"score_gpt":0.2930557389204899,"score_spread":0.2603868418053703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253687311","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024837867,0.004157355,0.0023915644,0.2449655,0.6879156,0.00018825413,0.0007576498,0.00083092914,0.058544826],"genre_scores_gemma":[0.0042231213,0.005195994,0.0023458786,0.112035416,0.254141,0.00031995217,0.0017596615,0.0011996261,0.61877924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955237,0.0005739582,0.00031621926,0.0006195271,0.0024239833,0.0005425987],"domain_scores_gemma":[0.96978563,0.006928801,0.0016839886,0.0018150429,0.014407373,0.0053792745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004994665,0.0017822353,0.0022635993,0.0028298616,0.0031783641,0.00858458,0.0035478636,0.01700729,0.22894232],"category_scores_gemma":[0.031295504,0.00069188664,0.0020110311,0.002826657,0.0015533831,0.005541197,0.0031974732,0.007014718,0.17026521],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000010387309,0.0000053223303,0.000023237319,0.00003403682,0.0000028149445,0.0000146073,0.0000028029435,0.00001599292,0.00003862,0.0003661523,0.9941703,0.0053157867],"study_design_scores_gemma":[0.000016581984,0.000018221092,0.00019758251,0.000056193257,0.000008993673,0.000033979206,0.000022446895,0.0001313163,0.00010789316,0.0010193982,0.9983752,0.000012260416],"about_ca_topic_score_codex":0.0017761346,"about_ca_topic_score_gemma":0.0047975117,"teacher_disagreement_score":0.22894232,"about_ca_system_score_codex":0.0024362933,"about_ca_system_score_gemma":0.0029536546,"threshold_uncertainty_score":0.76588833},"labels":[],"label_agreement":null},{"id":"W4253726060","doi":"10.1002/dac.3427","title":"Issue Information","year":2018,"lang":"en","type":"paratext","venue":"International Journal of Communication Systems","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"St. Francis Xavier University; University of Victoria; Université de Sherbrooke; Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.04506577400359713,"score_gpt":0.26842110478538095,"score_spread":0.22335533078178382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253726060","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052771636,0.0012476533,0.0012406458,0.0075089573,0.02981656,0.0008195903,0.06550394,0.0031534787,0.8901815],"genre_scores_gemma":[0.0017142334,0.00066745153,0.00039677336,0.0017644658,0.0022407572,0.0002014669,0.015346788,0.00074307644,0.9769249],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858356,0.00018753424,0.00012821525,0.0002214252,0.0006841999,0.00019510447],"domain_scores_gemma":[0.9927504,0.0011857745,0.00025800275,0.0008686617,0.0033275778,0.0016095105],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015740223,0.0011992897,0.0016848552,0.0030519788,0.0014941102,0.0057615577,0.0021146254,0.0023601556,0.9578045],"category_scores_gemma":[0.013276712,0.0005102341,0.00096002175,0.0028552345,0.00039545452,0.0031321414,0.0020986812,0.0018471911,0.89493775],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00004368179,0.00002661928,0.000047057412,0.00017561474,0.0000025229597,0.00001657242,0.000009339712,0.000023285758,0.000072938674,0.0007224525,0.97569805,0.023161842],"study_design_scores_gemma":[0.000021925927,0.000023362274,0.00018405211,0.0001404698,0.0000027105482,0.00003069876,0.000022707265,0.00004655364,0.00009467227,0.0006008661,0.9988274,0.0000045421284],"about_ca_topic_score_codex":0.0014955022,"about_ca_topic_score_gemma":0.002907834,"teacher_disagreement_score":0.0421955,"about_ca_system_score_codex":0.001212407,"about_ca_system_score_gemma":0.0021774874,"threshold_uncertainty_score":0.060186744},"labels":[],"label_agreement":null},{"id":"W4254474339","doi":"10.1002/dac.887","title":"Joint packet scheduling and dynamic base station assignment for CDMA data networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Network 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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Base station; Network packet; Computer network; Scheduling (production processes); Code division multiple access; Wireless; Queue; Real-time computing; Distributed computing; Telecommunications; Mathematical optimization","score_opus":0.03509135446373817,"score_gpt":0.30691584901180013,"score_spread":0.27182449454806196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254474339","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.08331594,0.0006017374,0.91350245,0.00016628094,0.0000891618,0.000059129554,0.00003568314,0.00024522195,0.001984414],"genre_scores_gemma":[0.9301358,0.00018530725,0.068193786,0.00004101116,0.000048099595,0.000051489777,0.000031338666,0.00001896287,0.0012943449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992305,0.0002930883,0.000028354405,0.00010491376,0.00019248933,0.00015068386],"domain_scores_gemma":[0.99857855,0.0007430332,0.00018409612,0.00017670447,0.00021769332,0.00009989021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013473115,0.00054146553,0.00054620695,0.0006225404,0.00066743727,0.0008294378,0.0009064846,0.0004731928,0.0010515933],"category_scores_gemma":[0.003994934,0.00028950596,0.00024685013,0.0008980558,0.0006898146,0.0008082349,0.0010309569,0.0005651868,0.00020685061],"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.0003064291,0.00008746306,0.0009010177,0.00004839963,0.00003388067,0.000070895636,0.00006224072,0.89867073,0.004750924,0.013848562,0.0008165444,0.08040295],"study_design_scores_gemma":[0.000014801311,0.000032860702,0.000088256114,0.0000015028872,0.000005762705,0.00001419742,0.000006873246,0.9954619,0.0010573694,0.002980821,0.0003327208,0.0000029935406],"about_ca_topic_score_codex":0.0037982212,"about_ca_topic_score_gemma":0.002986094,"teacher_disagreement_score":0.0037982212,"about_ca_system_score_codex":0.0009654035,"about_ca_system_score_gemma":0.0010887386,"threshold_uncertainty_score":0.0075522065},"labels":[],"label_agreement":null},{"id":"W4254900933","doi":"10.1002/dac.966","title":"Architecture design, performance analysis and VLSI implementation of a reconfigurable shared buffer for high‐speed switch/router","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and Systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Dram; Router; Network packet; Static random-access memory; Buffer (optical fiber); Computer network; Embedded system; Computer hardware","score_opus":0.03466270430056799,"score_gpt":0.28923128202543363,"score_spread":0.25456857772486563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254900933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83823514,0.0009865455,0.15187024,0.00022650935,0.000106103595,0.00008693452,0.00015878229,0.0013608318,0.006968903],"genre_scores_gemma":[0.98694927,0.00006895707,0.0123320585,0.000015713547,0.000005228613,0.00001290759,0.000028100214,0.000008133094,0.0005796436],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998753,0.00002122771,0.0000066824173,0.00002379954,0.000040222076,0.00003281215],"domain_scores_gemma":[0.99982256,0.000038355392,0.000043576485,0.000027016771,0.000053783813,0.000014699457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013406007,0.00028336066,0.00016233485,0.00027318252,0.00019669115,0.00042256186,0.0008719487,0.00026785338,0.0017996647],"category_scores_gemma":[0.00027931237,0.00011623669,0.00023097178,0.00020863269,0.00013996493,0.0004362847,0.00016014355,0.00015280316,0.0001698175],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0007222495,0.00023232232,0.0073980927,0.00038301834,0.00027351113,0.0005541589,0.00013642373,0.44182676,0.454067,0.009016319,0.0026349092,0.08275517],"study_design_scores_gemma":[0.00006554612,0.0008718854,0.0023196028,0.000013952155,0.00010700411,0.00019766127,0.000039337297,0.8734023,0.119687006,0.00058000995,0.0026948014,0.000020909818],"about_ca_topic_score_codex":0.0018780186,"about_ca_topic_score_gemma":0.0017220458,"teacher_disagreement_score":0.0018780186,"about_ca_system_score_codex":0.0006681246,"about_ca_system_score_gemma":0.0005218357,"threshold_uncertainty_score":0.0060204864},"labels":[],"label_agreement":null},{"id":"W4287958894","doi":"10.1002/dac.5305","title":"Numerical investigation of elliptical core few‐mode fiber for next generation data transmission","year":2022,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Optical Network Technologies","field":"Engineering","cited_by":4,"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 Saskatchewan","funders":"","keywords":"Computer science; Multiplexing; Optical fiber; Crosstalk; Sensitivity (control systems); Optical communication; Wavelength-division multiplexing; Core (optical fiber); Transmission (telecommunications); Optics; Wavelength; Telecommunications; Electronic engineering; Physics; Engineering","score_opus":0.14671232142605875,"score_gpt":0.3268260873244594,"score_spread":0.18011376589840064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287958894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85815907,0.00060267816,0.106725335,0.0005740776,0.00007711128,0.00006681583,0.00014365674,0.00016988371,0.033481333],"genre_scores_gemma":[0.9794875,0.000112990274,0.018004155,0.000021316202,0.000005981849,0.000028538214,0.00003129913,0.000012808219,0.002295469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990594,0.00002593693,0.000002825092,0.000011287185,0.00003321616,0.000020656904],"domain_scores_gemma":[0.9996575,0.00016137182,0.000051660827,0.00001825978,0.000093399474,0.000017698087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003117016,0.00022452809,0.00023261252,0.0003395694,0.0004546716,0.00039618165,0.00040471638,0.00069331995,0.0017820573],"category_scores_gemma":[0.00074287836,0.00014257018,0.00031073458,0.00024797083,0.00035397848,0.0003946166,0.00024078424,0.00023646768,0.00012278119],"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.000059566933,0.000044583965,0.0025179663,0.0000777975,0.000015257431,0.00030815878,0.000098027165,0.9732762,0.010502098,0.007765275,0.0005488633,0.004786187],"study_design_scores_gemma":[0.0000023736359,0.000012368502,0.00017385447,0.0000028292793,0.000001479055,0.000012394114,0.000015176522,0.9990958,0.0003689652,0.00017651464,0.00013594491,0.0000023116606],"about_ca_topic_score_codex":0.00872361,"about_ca_topic_score_gemma":0.006524743,"teacher_disagreement_score":0.00872361,"about_ca_system_score_codex":0.00055992143,"about_ca_system_score_gemma":0.0005017156,"threshold_uncertainty_score":0.017345667},"labels":[],"label_agreement":null},{"id":"W4311508997","doi":"10.1002/dac.5412","title":"A hybrid technique for the PAPR reduction of NOMA waveform","year":2022,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Companding; Computer science; Waveform; Reduction (mathematics); Transmission (telecommunications); Transmitter; Algorithm; Noma; Orthogonal frequency-division multiplexing; Real-time computing; Electronic engineering; Telecommunications; Mathematics; Channel (broadcasting); Telecommunications link","score_opus":0.019770691092042426,"score_gpt":0.272631272604304,"score_spread":0.25286058151226154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311508997","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.07008486,0.0005864586,0.9239116,0.0001329817,0.00009740337,0.000057027028,0.000036259094,0.0009832046,0.004110205],"genre_scores_gemma":[0.48829383,0.00033799262,0.5062365,0.0000993502,0.00006332356,0.00006793821,0.00010394718,0.000055433156,0.0047417204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997601,0.000038608778,0.000014712212,0.000041745367,0.00012866672,0.000016125137],"domain_scores_gemma":[0.99964964,0.0001125076,0.000055123706,0.00006823866,0.00009514383,0.000019287969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031395062,0.00038287672,0.00026954905,0.00059595035,0.0002449256,0.00041983934,0.0004568937,0.00037049715,0.0014977205],"category_scores_gemma":[0.00084344967,0.00013107003,0.00033092857,0.00047446875,0.00026987074,0.00043398672,0.0003367044,0.0003839563,0.00050068053],"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.00033700423,0.000103903796,0.0016205446,0.00019118725,0.000073609925,0.00022071197,0.00016782813,0.06360838,0.18595116,0.008197262,0.0020237798,0.7375047],"study_design_scores_gemma":[0.000054579068,0.0006368662,0.002142216,0.000023005188,0.00004583128,0.0009817546,0.00007026689,0.89356714,0.09076895,0.0022688068,0.0094062835,0.00003433312],"about_ca_topic_score_codex":0.0005840679,"about_ca_topic_score_gemma":0.00086565723,"teacher_disagreement_score":0.0014977205,"about_ca_system_score_codex":0.00017105226,"about_ca_system_score_gemma":0.0003807899,"threshold_uncertainty_score":0.0050103664},"labels":[],"label_agreement":null},{"id":"W4311936927","doi":"10.1002/dac.5208","title":"Issue Information","year":2022,"lang":"en","type":"paratext","venue":"International Journal of Communication Systems","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"St. Francis Xavier University; University of Victoria; Université de Sherbrooke; Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.04377104213752776,"score_gpt":0.26213461335981375,"score_spread":0.218363571222286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311936927","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004079786,0.0008422154,0.0010727728,0.0061989566,0.024781346,0.0007138093,0.04964432,0.0027442002,0.9135945],"genre_scores_gemma":[0.0012817007,0.0004608331,0.000328301,0.0014627497,0.0018936945,0.00015676134,0.011144299,0.00061740517,0.9826543],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869835,0.00016293609,0.000112487935,0.0001937569,0.0006564502,0.00017590057],"domain_scores_gemma":[0.993493,0.0010669515,0.00023176543,0.00076937594,0.0029847552,0.0014540731],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014299647,0.0012661386,0.0016428854,0.0030448067,0.0014750944,0.0057214536,0.002044342,0.0024832652,0.95371455],"category_scores_gemma":[0.011504332,0.0005600503,0.0008832946,0.0029316815,0.00040735348,0.0030924706,0.0019756218,0.0018902214,0.89919555],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003767937,0.000024236733,0.000041359213,0.00015395577,0.0000019705142,0.000016226895,0.000008704123,0.000023512743,0.00008178065,0.0007473297,0.9773612,0.021501994],"study_design_scores_gemma":[0.000020921434,0.000022648794,0.00019245471,0.00011608026,0.000002350496,0.00002741121,0.000021834705,0.00005080935,0.00009951546,0.0005717456,0.9988697,0.0000046091814],"about_ca_topic_score_codex":0.0016283572,"about_ca_topic_score_gemma":0.00310105,"teacher_disagreement_score":0.04628545,"about_ca_system_score_codex":0.001179311,"about_ca_system_score_gemma":0.0020780158,"threshold_uncertainty_score":0.06602061},"labels":[],"label_agreement":null},{"id":"W4313321664","doi":"10.1002/dac.5407","title":"Quality of service‐aware coexistence in unlicensed 5G new radio based on time‐domain virtualization","year":2022,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Wireless Networks and Protocols","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":"University of Guelph; Western University","funders":"","keywords":"Computer science; Quality of service; Computer network; Virtualization; Throughput; Scheduling (production processes); Software deployment; Cellular network; Shared resource; Wireless; Telecommunications; Cloud computing; Operating system","score_opus":0.04478463158443309,"score_gpt":0.3301199179652755,"score_spread":0.28533528638084243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313321664","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.17532681,0.00094801275,0.8174593,0.00025225902,0.00013942708,0.00005640836,0.000018997533,0.0005735234,0.005225246],"genre_scores_gemma":[0.97823924,0.00010376027,0.021265464,0.000033101336,0.000016477725,0.000012968654,0.000011266837,0.00000939952,0.00030841233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993573,0.0002097054,0.00002907901,0.00007527101,0.00017586346,0.00015281554],"domain_scores_gemma":[0.9993001,0.00021975324,0.000099519704,0.000113750386,0.0001725488,0.00009435375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007818919,0.00026514963,0.00043628697,0.000360428,0.00039366228,0.00089754764,0.0007086533,0.00027484668,0.00049059634],"category_scores_gemma":[0.0010616584,0.0001405959,0.00029888455,0.00027363765,0.00047127952,0.0009833473,0.00094523304,0.0005171221,0.00010694619],"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.0007099054,0.00034011665,0.005777892,0.0001871479,0.00018988308,0.00088042696,0.00037628307,0.59554815,0.11854739,0.09892716,0.003140951,0.17537472],"study_design_scores_gemma":[0.0000076094607,0.00006103593,0.0003509278,0.0000057260154,0.000014503041,0.00011720177,0.000039308703,0.9879457,0.0058250753,0.004546845,0.0010723419,0.000013796862],"about_ca_topic_score_codex":0.0011974946,"about_ca_topic_score_gemma":0.001184452,"teacher_disagreement_score":0.0011974946,"about_ca_system_score_codex":0.0005089566,"about_ca_system_score_gemma":0.0007367304,"threshold_uncertainty_score":0.004135072},"labels":[],"label_agreement":null},{"id":"W4320730414","doi":"10.1002/dac.5212","title":"Issue Information","year":2023,"lang":"en","type":"paratext","venue":"International Journal of Communication Systems","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"St. Francis Xavier University; University of Victoria; Université de Sherbrooke; Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.058005674077152854,"score_gpt":0.2757635659486068,"score_spread":0.21775789187145395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320730414","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004031842,0.00083555497,0.0010841279,0.0061144326,0.024564844,0.00070490304,0.048452087,0.002733795,0.9151071],"genre_scores_gemma":[0.0012590671,0.00044871398,0.00032036993,0.0014067686,0.0018656448,0.00015327295,0.010855458,0.00060929265,0.9830814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868816,0.00016418415,0.00011294514,0.00019462832,0.00066308025,0.00017694883],"domain_scores_gemma":[0.99345535,0.0010677231,0.00023444783,0.00077543774,0.0030062555,0.0014607602],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014379423,0.0012751186,0.0016528654,0.0030645763,0.0014769778,0.005785784,0.0020631459,0.0024938828,0.95308745],"category_scores_gemma":[0.011543875,0.00055927795,0.0008835463,0.0029605676,0.00041325545,0.003109907,0.0019919379,0.0018938187,0.8989118],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000037491816,0.000023944425,0.000041270112,0.00015304415,0.0000019567722,0.000016155367,0.000008671931,0.000023963636,0.000080568345,0.00075998664,0.97739446,0.021458626],"study_design_scores_gemma":[0.00002074174,0.00002232387,0.00019118568,0.000115654606,0.0000023156313,0.000027065493,0.000021546639,0.000051818737,0.000098571756,0.0005764978,0.99886775,0.0000045793568],"about_ca_topic_score_codex":0.0016493418,"about_ca_topic_score_gemma":0.0031459164,"teacher_disagreement_score":0.04691255,"about_ca_system_score_codex":0.0012087108,"about_ca_system_score_gemma":0.0020935824,"threshold_uncertainty_score":0.066914976},"labels":[],"label_agreement":null},{"id":"W4324373234","doi":"10.1002/dac.5467","title":"DR‐NAP: Data reduction strategy using neural adaptation phenomenon in wireless sensor networks","year":2023,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Wireless sensor network; Energy consumption; Routing (electronic design automation); Computer network; Node (physics); Sensor node; Data transmission; Key distribution in wireless sensor networks; Reduction (mathematics); Real-time computing; Wireless; Wireless network; Telecommunications; Engineering","score_opus":0.11562999705251849,"score_gpt":0.3354237571653605,"score_spread":0.21979376011284202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324373234","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.13655914,0.001007445,0.85321444,0.00048447395,0.00015817527,0.00010376563,0.00004246873,0.00077423366,0.0076559237],"genre_scores_gemma":[0.94055134,0.0003475905,0.056410648,0.000117628326,0.00003944285,0.00007091045,0.00006031842,0.000018620347,0.0023835509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998405,0.000035766225,0.000010338197,0.000032901626,0.000060248793,0.000020305819],"domain_scores_gemma":[0.9998097,0.00005053787,0.000022738222,0.000017608549,0.000088895635,0.0000104746105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027006352,0.000327738,0.00029143813,0.00029351356,0.00025627288,0.00025671427,0.0005958487,0.00030648228,0.0006814237],"category_scores_gemma":[0.00044683064,0.000092186296,0.00034500592,0.00035839755,0.00026492577,0.00045000724,0.00034581582,0.0003409544,0.00010842908],"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.00017643566,0.00017715456,0.0025586365,0.00019562826,0.00009442352,0.00027263138,0.00014858165,0.6032696,0.071179524,0.007951072,0.0028865754,0.31108978],"study_design_scores_gemma":[0.000006058335,0.000101591584,0.00070615247,0.0000045658503,0.000011190544,0.000053368312,0.000019878313,0.9922471,0.004836197,0.0010543583,0.00095183466,0.000007670447],"about_ca_topic_score_codex":0.0021943685,"about_ca_topic_score_gemma":0.0015481499,"teacher_disagreement_score":0.0021943685,"about_ca_system_score_codex":0.00027438794,"about_ca_system_score_gemma":0.00028227727,"threshold_uncertainty_score":0.0043631196},"labels":[],"label_agreement":null},{"id":"W4366285381","doi":"10.1002/dac.5215","title":"Issue Information","year":2023,"lang":"en","type":"paratext","venue":"International Journal of Communication Systems","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"St. Francis Xavier University; University of Victoria; Université de Sherbrooke; Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.058005674077152854,"score_gpt":0.2757635659486068,"score_spread":0.21775789187145395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366285381","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004031842,0.00083555497,0.0010841279,0.0061144326,0.024564844,0.00070490304,0.048452087,0.002733795,0.9151071],"genre_scores_gemma":[0.0012590671,0.00044871398,0.00032036993,0.0014067686,0.0018656448,0.00015327295,0.010855458,0.00060929265,0.9830814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868816,0.00016418415,0.00011294514,0.00019462832,0.00066308025,0.00017694883],"domain_scores_gemma":[0.99345535,0.0010677231,0.00023444783,0.00077543774,0.0030062555,0.0014607602],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014379423,0.0012751186,0.0016528654,0.0030645763,0.0014769778,0.005785784,0.0020631459,0.0024938828,0.95308745],"category_scores_gemma":[0.011543875,0.00055927795,0.0008835463,0.0029605676,0.00041325545,0.003109907,0.0019919379,0.0018938187,0.8989118],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000037491816,0.000023944425,0.000041270112,0.00015304415,0.0000019567722,0.000016155367,0.000008671931,0.000023963636,0.000080568345,0.00075998664,0.97739446,0.021458626],"study_design_scores_gemma":[0.00002074174,0.00002232387,0.00019118568,0.000115654606,0.0000023156313,0.000027065493,0.000021546639,0.000051818737,0.000098571756,0.0005764978,0.99886775,0.0000045793568],"about_ca_topic_score_codex":0.0016493418,"about_ca_topic_score_gemma":0.0031459164,"teacher_disagreement_score":0.04691255,"about_ca_system_score_codex":0.0012087108,"about_ca_system_score_gemma":0.0020935824,"threshold_uncertainty_score":0.066914976},"labels":[],"label_agreement":null},{"id":"W4379801704","doi":"10.1002/dac.5217","title":"Issue Information","year":2023,"lang":"en","type":"paratext","venue":"International Journal of Communication Systems","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"St. Francis Xavier University; University of Victoria; Université de Sherbrooke; Toronto Metropolitan University; Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.058005674077152854,"score_gpt":0.2757635659486068,"score_spread":0.21775789187145395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379801704","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004031842,0.00083555497,0.0010841279,0.0061144326,0.024564844,0.00070490304,0.048452087,0.002733795,0.9151071],"genre_scores_gemma":[0.0012590671,0.00044871398,0.00032036993,0.0014067686,0.0018656448,0.00015327295,0.010855458,0.00060929265,0.9830814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868816,0.00016418415,0.00011294514,0.00019462832,0.00066308025,0.00017694883],"domain_scores_gemma":[0.99345535,0.0010677231,0.00023444783,0.00077543774,0.0030062555,0.0014607602],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014379423,0.0012751186,0.0016528654,0.0030645763,0.0014769778,0.005785784,0.0020631459,0.0024938828,0.95308745],"category_scores_gemma":[0.011543875,0.00055927795,0.0008835463,0.0029605676,0.00041325545,0.003109907,0.0019919379,0.0018938187,0.8989118],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000037491816,0.000023944425,0.000041270112,0.00015304415,0.0000019567722,0.000016155367,0.000008671931,0.000023963636,0.000080568345,0.00075998664,0.97739446,0.021458626],"study_design_scores_gemma":[0.00002074174,0.00002232387,0.00019118568,0.000115654606,0.0000023156313,0.000027065493,0.000021546639,0.000051818737,0.000098571756,0.0005764978,0.99886775,0.0000045793568],"about_ca_topic_score_codex":0.0016493418,"about_ca_topic_score_gemma":0.0031459164,"teacher_disagreement_score":0.04691255,"about_ca_system_score_codex":0.0012087108,"about_ca_system_score_gemma":0.0020935824,"threshold_uncertainty_score":0.066914976},"labels":[],"label_agreement":null},{"id":"W4387178281","doi":"10.1002/dac.5635","title":"TCaS‐VN: A novel V2V communication scheme to improve traffic control and safety in vehicular cloud networks","year":2023,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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 Calgary","funders":"","keywords":"Computer science; Cloud computing; Provisioning; Overhead (engineering); Computer network; Vehicular ad hoc network; Intelligent transportation system; Enhanced Data Rates for GSM Evolution; Vehicular communication systems; Service provider; Service (business); Computer security; Wireless ad hoc network; Telecommunications; Transport engineering","score_opus":0.009516484775183518,"score_gpt":0.24183986643872143,"score_spread":0.23232338166353791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387178281","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.15953411,0.0008519355,0.8212828,0.0007601159,0.0007110304,0.00039993649,0.00031760437,0.0023539637,0.01378853],"genre_scores_gemma":[0.9450096,0.00014398614,0.05208282,0.00012313908,0.000053612795,0.000061585364,0.00019039279,0.000042369164,0.0022925457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995011,0.00008295286,0.000025993346,0.0000764982,0.00013611125,0.00017732999],"domain_scores_gemma":[0.9994166,0.00006904399,0.00005542193,0.000089634705,0.0002683386,0.000101050886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353494,0.00051225815,0.00062648434,0.00084761984,0.0012624388,0.00069899333,0.0018103963,0.00041114513,0.0015305673],"category_scores_gemma":[0.0009399368,0.0001210442,0.0003433247,0.0008825491,0.00044809023,0.0007887137,0.0012481724,0.00045826967,0.000329868],"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.0009345552,0.00040890096,0.004108033,0.00013856105,0.00011031754,0.00041886096,0.00016791042,0.50831103,0.053540263,0.03879471,0.025959836,0.36710706],"study_design_scores_gemma":[0.00002527796,0.000073314535,0.00030994974,0.0000057532093,0.000009921343,0.000094841955,0.000041343028,0.9874069,0.0052916124,0.0029796266,0.0037473051,0.000014213389],"about_ca_topic_score_codex":0.01144858,"about_ca_topic_score_gemma":0.013576192,"teacher_disagreement_score":0.01144858,"about_ca_system_score_codex":0.0014176158,"about_ca_system_score_gemma":0.0022698757,"threshold_uncertainty_score":0.022763908},"labels":[],"label_agreement":null},{"id":"W4387308439","doi":"10.1002/dac.5634","title":"Workload prediction for enhancing power efficiency of cloud data centers using optimized self‐attention‐based progressive generative adversarial network","year":2023,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Cloud computing; Workload; Scalability; Data center; Data mining; Artificial neural network; Deep learning; Efficient energy use; Real-time computing; Machine learning; Artificial intelligence; Distributed computing; Database; Computer network","score_opus":0.040192120184734885,"score_gpt":0.31509798699682834,"score_spread":0.27490586681209345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387308439","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.10278855,0.0005550841,0.889602,0.0005487605,0.00009712524,0.000068687004,0.00012751952,0.0011675438,0.0050447728],"genre_scores_gemma":[0.9704856,0.00016317522,0.026491309,0.00019678897,0.000038519025,0.000052559368,0.00018617786,0.000055900888,0.0023299237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973255,0.00007164635,0.000009647897,0.000066134126,0.00006568383,0.000054319993],"domain_scores_gemma":[0.9993918,0.00034716722,0.000045703582,0.000041405445,0.00013925898,0.000034645793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006681325,0.00076964236,0.00054204854,0.00040560836,0.00030015415,0.00049317774,0.00096575497,0.0004559876,0.001364616],"category_scores_gemma":[0.001699985,0.00025883203,0.0004922663,0.00028969537,0.0004416668,0.0007277168,0.0006689707,0.0007695481,0.00026039017],"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.000060233702,0.00003008598,0.0009527944,0.000019560504,0.000017594677,0.000037608155,0.000022663158,0.96909285,0.001811804,0.0010561772,0.0008770249,0.026021684],"study_design_scores_gemma":[8.759455e-7,0.000005450389,0.00006903431,0.0000010239122,0.0000017601732,0.0000037535965,0.0000019628008,0.99926203,0.00028956792,0.00031850682,0.000044878016,0.0000010984858],"about_ca_topic_score_codex":0.0061999406,"about_ca_topic_score_gemma":0.0057379645,"teacher_disagreement_score":0.0061999406,"about_ca_system_score_codex":0.0007328347,"about_ca_system_score_gemma":0.0005301317,"threshold_uncertainty_score":0.012327671},"labels":[],"label_agreement":null},{"id":"W4390951140","doi":"10.1002/dac.5700","title":"Multi‐objective optimization for optimal energy transporting path and energy distribution in electric vehicles energy internet","year":2024,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Energy (signal processing); Shortest path problem; Energy consumption; Charging station; Electric potential energy; Path (computing); Power (physics); Real-time computing; The Internet; Energy supply; Simulation; Electric vehicle; Automotive engineering; Electrical engineering; Computer network; Engineering; Mathematics; Statistics","score_opus":0.006705052890382768,"score_gpt":0.227075792038766,"score_spread":0.22037073914838323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390951140","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.28866556,0.0015089317,0.68773836,0.0013679728,0.00015666132,0.00015073978,0.0003286201,0.00042659676,0.019656537],"genre_scores_gemma":[0.96170086,0.00019198305,0.032419465,0.000113341535,0.000019010218,0.00008296879,0.00014836616,0.000043001837,0.005280944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975044,0.00010952958,0.0000111292775,0.000044569322,0.000033337674,0.00005096368],"domain_scores_gemma":[0.9992673,0.00051686855,0.00005898325,0.000016422788,0.00009918198,0.000041207346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095825933,0.0008283826,0.00079522055,0.000599683,0.0003006562,0.00076394976,0.00055901863,0.0010026003,0.002577211],"category_scores_gemma":[0.0013737777,0.0005103034,0.00057840446,0.00047713335,0.00045374528,0.0005741324,0.00056642474,0.0008286475,0.00017100449],"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.000014622158,0.000014210882,0.000177524,0.000010809894,0.000008206168,0.000012338494,0.000004381509,0.9966186,0.00007992375,0.0005086184,0.00018484044,0.0023658313],"study_design_scores_gemma":[0.00000215236,0.000008758181,0.000039983872,0.0000013882016,0.0000016161886,0.0000010755833,0.000003641196,0.9996661,0.000025342513,0.00019963985,0.000049551934,7.5972787e-7],"about_ca_topic_score_codex":0.015268847,"about_ca_topic_score_gemma":0.008618395,"teacher_disagreement_score":0.015268847,"about_ca_system_score_codex":0.0010625897,"about_ca_system_score_gemma":0.0010702274,"threshold_uncertainty_score":0.030359983},"labels":[],"label_agreement":null},{"id":"W4391389459","doi":"10.1002/dac.5724","title":"An improved resource scheduling strategy through concatenated deep learning model for edge computing IoT networks","year":2024,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Edge computing; Scheduling (production processes); Edge device; Internet of Things; Enhanced Data Rates for GSM Evolution; Deep learning; Artificial intelligence; Distributed computing; Computer network; Computer security; Cloud computing; Mathematical optimization","score_opus":0.04256423124646693,"score_gpt":0.3330571318357542,"score_spread":0.2904929005892873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391389459","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.11702634,0.00055566983,0.873163,0.0004922338,0.00011537055,0.000057972466,0.00017234251,0.00076887297,0.007648109],"genre_scores_gemma":[0.97094595,0.0001587583,0.025797568,0.00009395726,0.000022852657,0.00004018508,0.00010281828,0.00003491996,0.0028030118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979526,0.000028583727,0.000011707469,0.0000516088,0.00004606807,0.00006670413],"domain_scores_gemma":[0.99979585,0.000055252887,0.00003179822,0.00001986128,0.00007084442,0.000026466898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038975803,0.00058639806,0.0005219225,0.00031949405,0.0003036026,0.00071907334,0.0009903084,0.0004574432,0.0015886206],"category_scores_gemma":[0.00069271197,0.00023277404,0.00035567692,0.0004201617,0.0003438457,0.0010605727,0.00057094387,0.0007576286,0.00021822458],"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.000056268498,0.000043296666,0.0005713983,0.000016528462,0.000013977873,0.00003828628,0.000014474462,0.97291994,0.0023256468,0.0028991043,0.0006987228,0.020402284],"study_design_scores_gemma":[7.0450926e-7,0.000004660629,0.000028043465,6.55141e-7,0.0000016189045,0.0000019880133,0.0000012345198,0.99933976,0.00018437338,0.00038049126,0.00005543691,9.612598e-7],"about_ca_topic_score_codex":0.01178727,"about_ca_topic_score_gemma":0.010430124,"teacher_disagreement_score":0.01178727,"about_ca_system_score_codex":0.00096914324,"about_ca_system_score_gemma":0.0012269159,"threshold_uncertainty_score":0.023437321},"labels":[],"label_agreement":null},{"id":"W4399052664","doi":"10.1002/dac.5827","title":"Silicon‐photonic four‐mode triple‐band multiplexing device for hybrid wavelength/mode division multiplexing networks","year":2024,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":1,"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 Calgary","funders":"Bộ Giáo dục và Ðào tạo","keywords":"Multiplexing; Computer science; Wavelength-division multiplexing; Photonics; Mode (computer interface); Division (mathematics); Time-division multiplexing; Optoelectronics; Telecommunications; Wavelength; Physics","score_opus":0.029864277951199877,"score_gpt":0.30674745749673793,"score_spread":0.27688317954553804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399052664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85270965,0.0017865344,0.12618275,0.00020575253,0.0001832603,0.00006143476,0.00022288923,0.0004722925,0.018175405],"genre_scores_gemma":[0.95866257,0.00025724372,0.039246574,0.000046894314,0.000018937768,0.000044902128,0.000061077546,0.000008966819,0.0016527285],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999429,0.000008047115,0.0000032876374,0.000011591703,0.000023350454,0.000010786092],"domain_scores_gemma":[0.9999448,0.000013901661,0.000016616055,0.0000067315013,0.000011603128,0.0000064480514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011927559,0.00020395876,0.00010687747,0.0002287637,0.00016364639,0.0002134815,0.0002788659,0.0002052653,0.0007107482],"category_scores_gemma":[0.00006332128,0.000105684034,0.0001864587,0.00013668386,0.00013101468,0.00020077277,0.0001683531,0.00017995507,0.00016203005],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000077166515,0.00005235758,0.0007072467,0.000101401165,0.000025864016,0.00010578742,0.000039828963,0.0044666734,0.9628602,0.010709331,0.0009981623,0.01985595],"study_design_scores_gemma":[0.00002249873,0.00030502694,0.0015876371,0.000014922734,0.000031173724,0.0002863832,0.000027691756,0.12910101,0.8514888,0.0016284582,0.015470564,0.000035832963],"about_ca_topic_score_codex":0.00013761106,"about_ca_topic_score_gemma":0.00035809798,"teacher_disagreement_score":0.0007107482,"about_ca_system_score_codex":0.00030457004,"about_ca_system_score_gemma":0.00013541435,"threshold_uncertainty_score":0.002377689},"labels":[],"label_agreement":null},{"id":"W4403341457","doi":"10.1002/dac.6008","title":"Novel High Efficiency V‐Band Pure TEM D‐PRGW Antenna for 5G mmWave Applications","year":2024,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Microwave Engineering and Waveguides","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Bandwidth (computing); Miniaturization; Computer science; Planar; Impedance matching; Wireless; Slot antenna; Antenna (radio); Directional antenna; Optoelectronics; Materials science; Electrical engineering; Electrical impedance; Telecommunications; Optics; Physics; Engineering","score_opus":0.016176815160643544,"score_gpt":0.26198076502251283,"score_spread":0.2458039498618693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403341457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49844298,0.0010201545,0.4759919,0.00053705764,0.00023129246,0.000037469537,0.00015959209,0.0013145396,0.022264842],"genre_scores_gemma":[0.9105037,0.00022451862,0.08342117,0.00011365393,0.000029310866,0.000020412113,0.00008180402,0.00004245775,0.0055628726],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999304,0.000012466609,0.0000029030537,0.000013431268,0.000028369963,0.000012433257],"domain_scores_gemma":[0.9999428,0.000008041398,0.00001715788,0.000013341534,0.000013312213,0.00000530644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000671544,0.00025466675,0.0001682971,0.00012780902,0.00005470027,0.00029919104,0.0003652016,0.00035376844,0.0007943946],"category_scores_gemma":[0.00007777879,0.00012303739,0.00023759133,0.0001929832,0.0001025541,0.00018010303,0.00018348114,0.00016116379,0.00069699646],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00011456193,0.000028120056,0.0009540088,0.00010452253,0.00003275122,0.00022433924,0.000035336372,0.0025913317,0.95168865,0.0040607424,0.0018058884,0.038359806],"study_design_scores_gemma":[0.000059123904,0.00067098957,0.0038355198,0.00002278856,0.000053903517,0.0015524095,0.000064729335,0.1185909,0.83248585,0.0008943243,0.041731834,0.00003762516],"about_ca_topic_score_codex":0.000081421356,"about_ca_topic_score_gemma":0.00014677012,"teacher_disagreement_score":0.0007943946,"about_ca_system_score_codex":0.0001510742,"about_ca_system_score_gemma":0.000078641904,"threshold_uncertainty_score":0.002657473},"labels":[],"label_agreement":null},{"id":"W4406207312","doi":"10.1002/dac.6121","title":"Sparse Code Multiple Access With Time Spreading and Repetitive Transmissions","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Toronto Metropolitan University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Computer science; Code (set theory); Computer network; Parallel computing; Algorithm; Real-time computing; Programming language","score_opus":0.016609001505751095,"score_gpt":0.29007197875935486,"score_spread":0.27346297725360375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406207312","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.091079056,0.00059567584,0.89755017,0.0002826663,0.00008543956,0.000063862884,0.000069793816,0.00036968986,0.0099036805],"genre_scores_gemma":[0.95334226,0.00039465894,0.041823745,0.000095398595,0.000069387344,0.000057920974,0.000069813745,0.000014424381,0.0041323635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994642,0.000160082,0.00001630821,0.00007356637,0.0002226851,0.00006314774],"domain_scores_gemma":[0.9987953,0.00048734146,0.00023788132,0.00013685737,0.00030721808,0.000035391502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039226215,0.00052716804,0.00043971653,0.0005382138,0.00038095584,0.00044782207,0.00066470227,0.0007403056,0.0013443308],"category_scores_gemma":[0.0015966563,0.00020763311,0.00038036142,0.0008490583,0.00059900264,0.00062838173,0.00046338694,0.00052064605,0.00036782652],"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.00020538933,0.00009980384,0.0015376343,0.00014784824,0.00010508103,0.0008519339,0.00016867014,0.8260517,0.03607319,0.075299606,0.0014217029,0.058037437],"study_design_scores_gemma":[0.00000838484,0.000053485866,0.00014318747,0.0000055121172,0.000009686531,0.00018902044,0.000009417067,0.9931844,0.0013944394,0.0043868236,0.0006059477,0.000009735512],"about_ca_topic_score_codex":0.0034423673,"about_ca_topic_score_gemma":0.0035696237,"teacher_disagreement_score":0.0034423673,"about_ca_system_score_codex":0.0004840929,"about_ca_system_score_gemma":0.00067440385,"threshold_uncertainty_score":0.0068446994},"labels":[],"label_agreement":null},{"id":"W4410977851","doi":"10.1002/dac.70137","title":"A Novel Hex‐Penta‐Based Network Topology","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Topology (electrical circuits); Network topology; Computer network; Electrical engineering","score_opus":0.02268641950966897,"score_gpt":0.30708178697521127,"score_spread":0.2843953674655423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410977851","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.2600609,0.0008385444,0.65836734,0.0010413455,0.0005332975,0.00023354994,0.0008971966,0.001645179,0.076382644],"genre_scores_gemma":[0.8612482,0.0003966739,0.126968,0.0001234865,0.000038231647,0.00011456328,0.00057780306,0.00004229856,0.010490819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998228,0.000059297552,0.000014313543,0.000031317843,0.000045594927,0.00002668568],"domain_scores_gemma":[0.99975675,0.000031322135,0.000031424912,0.000046868103,0.000098673416,0.000034912424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011992233,0.00015105489,0.00019495825,0.0004316465,0.00051436917,0.000778096,0.00040179843,0.00022915009,0.002892187],"category_scores_gemma":[0.00023693596,0.00012436142,0.0001475385,0.0006252668,0.00025466166,0.0006934677,0.0005003733,0.00022653607,0.0005224678],"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.00067031296,0.00018441053,0.0047619827,0.0004799212,0.00009945607,0.00239477,0.00039425906,0.42696628,0.14073478,0.16387533,0.027668564,0.23176998],"study_design_scores_gemma":[0.000059549497,0.00036300253,0.0017808307,0.00004664377,0.000042482807,0.0014004775,0.00032493394,0.8700629,0.029682638,0.030046606,0.066129014,0.000060878767],"about_ca_topic_score_codex":0.0017351444,"about_ca_topic_score_gemma":0.0018339517,"teacher_disagreement_score":0.002892187,"about_ca_system_score_codex":0.00041393732,"about_ca_system_score_gemma":0.00042526267,"threshold_uncertainty_score":0.009675384},"labels":[],"label_agreement":null},{"id":"W4412009897","doi":"10.1002/dac.70163","title":"Compact 18‐Element Multiband MIMO Antenna With Metal Frames for 5G Mobile Devices","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Antenna Design and Analysis","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":"Concordia University","funders":"","keywords":"Computer science; Handset; WiMAX; MIMO; Omnidirectional antenna; Bandwidth (computing); Telecommunications; Electronic engineering; Wireless; Acoustics; Antenna (radio); Beamforming; Physics; Engineering","score_opus":0.02039566787394084,"score_gpt":0.29977040355481743,"score_spread":0.2793747356808766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412009897","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.29692653,0.00083289074,0.68530005,0.0004362028,0.00038142467,0.000054476408,0.00017339202,0.0010306272,0.014864439],"genre_scores_gemma":[0.9221921,0.0002292624,0.07257771,0.0001252105,0.00006781308,0.000031708663,0.000079539925,0.000014956942,0.0046816226],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979657,0.000062638246,0.000008719277,0.000032882992,0.00006861009,0.000030537667],"domain_scores_gemma":[0.99981815,0.00002833582,0.000048309044,0.000037788028,0.0000530481,0.000014501825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014650852,0.0004864232,0.0003054345,0.00019616206,0.00012747273,0.00035020598,0.00045935865,0.00042049366,0.0014285117],"category_scores_gemma":[0.00019418445,0.00014382172,0.00029568974,0.00022731716,0.00014252533,0.00027650513,0.00025310737,0.00023161397,0.0009903975],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00097452855,0.00015321744,0.00429329,0.0003362949,0.00020618919,0.0008554018,0.0001693438,0.11235419,0.6687999,0.014423204,0.0059090448,0.19152543],"study_design_scores_gemma":[0.00008985267,0.0033079232,0.006044588,0.0000633397,0.00016727575,0.0019987521,0.00013836444,0.6534834,0.29114753,0.0022446155,0.04121495,0.00009949778],"about_ca_topic_score_codex":0.00031887266,"about_ca_topic_score_gemma":0.00045269373,"teacher_disagreement_score":0.0014285117,"about_ca_system_score_codex":0.00024693887,"about_ca_system_score_gemma":0.00014699086,"threshold_uncertainty_score":0.004778862},"labels":[],"label_agreement":null},{"id":"W4413332007","doi":"10.1002/dac.70225","title":"Deep Reinforcement Learning‐Driven Cooperative Routing for Energy Efficiency in Wireless Multimedia Sensor Networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Reinforcement learning; Multimedia; Routing (electronic design automation); Wireless; Computer network; Wireless sensor network; Efficient energy use; Telecommunications; Artificial intelligence; Electrical engineering","score_opus":0.012369972196161616,"score_gpt":0.2722988282311661,"score_spread":0.2599288560350045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413332007","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.070819005,0.00030660638,0.9260094,0.0003438039,0.000042196647,0.00002527019,0.000019089444,0.00021796746,0.0022167028],"genre_scores_gemma":[0.97167736,0.00008366529,0.027150193,0.0000706,0.000014972233,0.000030135392,0.000016060807,0.000014492113,0.0009425757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981445,0.0000676534,0.000007932004,0.00003770308,0.000039394832,0.00003279423],"domain_scores_gemma":[0.99945956,0.00030059236,0.00007733638,0.000035562538,0.00009703162,0.000029962084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077750266,0.00042272385,0.0004841951,0.00021556638,0.00023244003,0.0003823865,0.00083158485,0.00048271648,0.0006793967],"category_scores_gemma":[0.0017303613,0.00020222177,0.0002321136,0.00021155148,0.00060298655,0.00064457883,0.0007225034,0.000775254,0.000086977896],"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.000025600564,0.000031196003,0.00034370553,0.000018746072,0.000014909909,0.00001863296,0.000017177344,0.9755307,0.002023136,0.0048422175,0.00035054935,0.016783362],"study_design_scores_gemma":[0.000001073907,0.0000052471764,0.000015936743,5.2126546e-7,7.392358e-7,0.0000011190331,8.483322e-7,0.9990662,0.00012698048,0.0007512991,0.000029519379,5.282752e-7],"about_ca_topic_score_codex":0.0030001898,"about_ca_topic_score_gemma":0.003109301,"teacher_disagreement_score":0.0030001898,"about_ca_system_score_codex":0.00064102927,"about_ca_system_score_gemma":0.0006552931,"threshold_uncertainty_score":0.0059654713},"labels":[],"label_agreement":null},{"id":"W4413332108","doi":"10.1002/dac.70207","title":"An Internet of Things‐Based Wireless Sensor Network Secure Routing and Monitoring System Using Deep Learning With Hybrid Optimization","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"IoT-based Smart Home Systems","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":"Horizon College and Seminary","funders":"","keywords":"Computer science; Wireless sensor network; Internet of Things; Computer network; Routing (electronic design automation); The Internet; Wireless; Computer security; Telecommunications; World Wide Web","score_opus":0.008539534810943465,"score_gpt":0.24230455398717077,"score_spread":0.2337650191762273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413332108","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.089934856,0.00040962876,0.90111166,0.00056157203,0.00010802835,0.0000845359,0.000077446326,0.0020281964,0.0056840843],"genre_scores_gemma":[0.94155836,0.0001391266,0.05523387,0.00017167986,0.000018105573,0.000082232946,0.00010093491,0.000035290486,0.0026604906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998006,0.00003602949,0.000010668809,0.000055563698,0.000060249433,0.00003675104],"domain_scores_gemma":[0.9998548,0.00004032149,0.000018311115,0.000017280114,0.000052089,0.00001708365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004104569,0.00057170895,0.00052821246,0.00023868254,0.00036525054,0.0005488461,0.0008442758,0.0004988755,0.0010029394],"category_scores_gemma":[0.000410552,0.00026229784,0.00056337833,0.00025944304,0.00028369855,0.0006792976,0.000751253,0.000764583,0.0001889543],"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.00015237273,0.00016724358,0.0018208051,0.000060479648,0.00008837887,0.00013228717,0.000043439813,0.88150096,0.0110482015,0.0025814718,0.0020650483,0.10033943],"study_design_scores_gemma":[0.000002074809,0.000019218984,0.00007837311,0.0000011093076,0.0000038367466,0.000004937505,0.0000021882126,0.99874145,0.00071929325,0.00031212438,0.000113417365,0.00000215416],"about_ca_topic_score_codex":0.004710165,"about_ca_topic_score_gemma":0.0049373033,"teacher_disagreement_score":0.004710165,"about_ca_system_score_codex":0.0006164778,"about_ca_system_score_gemma":0.00065975985,"threshold_uncertainty_score":0.009365499},"labels":[],"label_agreement":null},{"id":"W4413808937","doi":"10.1002/dac.70239","title":"ReLeC‐MEO: Reinforcement Learning‐Based Clustering With Multi‐Objective Efficient Optimization for Energy‐Efficient IoT Networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient Wireless Sensor Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Reinforcement learning; Cluster analysis; Internet of Things; Artificial intelligence; Efficient energy use; Machine learning; Distributed computing; Computer security","score_opus":0.01156438439684886,"score_gpt":0.26101440517197894,"score_spread":0.24945002077513007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413808937","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.017370602,0.00024740136,0.97869736,0.0002794283,0.00006435541,0.00007701108,0.000028494373,0.00044874137,0.002786608],"genre_scores_gemma":[0.7301641,0.00020065985,0.2650322,0.00036336368,0.000067638444,0.00030358043,0.00013514257,0.0001362719,0.0035970018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995839,0.00015346336,0.000018233412,0.000074005286,0.00012360598,0.000046887402],"domain_scores_gemma":[0.9992648,0.00033387658,0.00011553937,0.00009356824,0.00014089429,0.000051336825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011819437,0.0007333946,0.0006958632,0.0005074951,0.00040970804,0.00050962047,0.001317191,0.00078510237,0.0014373112],"category_scores_gemma":[0.0020259183,0.00027114686,0.0004933228,0.00044682683,0.0006218366,0.0007099194,0.0012267535,0.0013188042,0.00025750705],"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.000035357534,0.00006577005,0.00029786656,0.000031589276,0.00003501593,0.000030029192,0.000018338524,0.958487,0.0026628445,0.0069048377,0.0012994739,0.030131904],"study_design_scores_gemma":[0.000005075827,0.000018823426,0.000039240447,0.0000022784243,0.0000019595968,0.000005414688,0.0000020445393,0.99776804,0.00039251937,0.0014496207,0.00031209234,0.0000030073024],"about_ca_topic_score_codex":0.0019151607,"about_ca_topic_score_gemma":0.00253518,"teacher_disagreement_score":0.0019151607,"about_ca_system_score_codex":0.00064080936,"about_ca_system_score_gemma":0.0008675386,"threshold_uncertainty_score":0.0062507987},"labels":[],"label_agreement":null},{"id":"W4417520253","doi":"10.1002/dac.70362","title":"A Hybrid Neuro‐Fuzzy Optimization Framework for Self‐Healing and Lifetime Enhancement in Wireless Sensor Networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Energy Efficient 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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Wireless sensor network; Energy consumption; Particle swarm optimization; Network packet; Fuzzy logic; Node (physics); Fault (geology); Residual; Network topology; Ant colony optimization algorithms","score_opus":0.010663174651676577,"score_gpt":0.27717471774756863,"score_spread":0.26651154309589203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417520253","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.01373096,0.00045557087,0.983063,0.00013143735,0.000036624184,0.000034630662,0.000023793342,0.00016344311,0.0023606627],"genre_scores_gemma":[0.81223917,0.00040219462,0.18419643,0.00012911813,0.00007221833,0.00019855186,0.00006891693,0.000045629702,0.0026477382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997223,0.00008879146,0.000018075225,0.000054801938,0.00008413801,0.00003177936],"domain_scores_gemma":[0.99974746,0.00010608915,0.000031017396,0.000013694296,0.00008788812,0.000013933198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010168412,0.0007341016,0.00063577725,0.0006089914,0.0003349718,0.0007132874,0.0010357891,0.00083078176,0.000810833],"category_scores_gemma":[0.00092447986,0.0003253217,0.00068311585,0.00044592074,0.0004414029,0.00050662167,0.0006808573,0.00061859284,0.00014006627],"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.000017278315,0.000021796204,0.00016976739,0.000026193811,0.000024848048,0.00002812427,0.000020505791,0.97888523,0.0011287046,0.0033273713,0.00025729946,0.016092855],"study_design_scores_gemma":[8.829747e-7,0.0000055328255,0.000016616492,0.0000015439687,0.0000018358353,0.0000019080458,0.0000014193246,0.99944395,0.00008129079,0.00036771197,0.00007636162,0.0000010130607],"about_ca_topic_score_codex":0.0076350714,"about_ca_topic_score_gemma":0.005634442,"teacher_disagreement_score":0.0076350714,"about_ca_system_score_codex":0.0006455862,"about_ca_system_score_gemma":0.0008814399,"threshold_uncertainty_score":0.015181243},"labels":[],"label_agreement":null},{"id":"W7078370668","doi":"10.1002/dac.70208","title":"A Graph‐Theoretic Hybrid Communication Framework for <i>μ</i>PMU‐Based Smart Grid Applications","year":2025,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Geochemistry and Geologic Mapping","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":"Carleton University","funders":"","keywords":"Smart grid; Scalability; Reliability (semiconductor); Power-line communication; State (computer science); Grid; Function (biology); Transmission (telecommunications); Fault (geology)","score_opus":0.016261436156581936,"score_gpt":0.29464973019324225,"score_spread":0.2783882940366603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7078370668","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.004313463,0.000107305685,0.9919282,0.00018086736,0.000030150595,0.0000308696,0.000055314194,0.00012421836,0.0032294854],"genre_scores_gemma":[0.5784347,0.0005885556,0.4122526,0.00022547672,0.00011587303,0.000284326,0.00021535071,0.00015118746,0.0077319816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994754,0.0002383352,0.000013389124,0.000073168296,0.00014863306,0.000051210864],"domain_scores_gemma":[0.99943835,0.00028968035,0.000055904828,0.000054673365,0.00011018287,0.000051170788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078551203,0.0007026731,0.00041284476,0.0006655647,0.0005723376,0.0012216216,0.0014489002,0.00077452883,0.003261372],"category_scores_gemma":[0.0012120416,0.00028096107,0.00051942543,0.0008841981,0.0009617273,0.0014341213,0.001164184,0.00086546,0.0005243397],"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.00002206834,0.000035098088,0.00013994721,0.000048531576,0.000016516085,0.000077426725,0.000046344147,0.8364245,0.0017424735,0.14098959,0.002007973,0.018449467],"study_design_scores_gemma":[0.000003828686,0.0000189175,0.000031224656,0.0000041802396,0.0000036847412,0.000014683772,0.000015023086,0.9721663,0.00018447012,0.02586766,0.0016854337,0.0000046786154],"about_ca_topic_score_codex":0.0057340516,"about_ca_topic_score_gemma":0.0071046446,"teacher_disagreement_score":0.0057340516,"about_ca_system_score_codex":0.0011183609,"about_ca_system_score_gemma":0.0014155384,"threshold_uncertainty_score":0.011401355},"labels":[],"label_agreement":null},{"id":"W70847832","doi":"","title":"On the effectiveness of alternative paths in QoS routing: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","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":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Policy-based routing; Equal-cost multi-path routing; Static routing; Multipath routing; Dynamic Source Routing; Routing (electronic design automation); Distributed computing; Bandwidth (computing); Routing protocol","score_opus":0.05460799126789965,"score_gpt":0.3443266471273235,"score_spread":0.28971865585942386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70847832","genre_codex":"review","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.06947112,0.4150089,0.4136729,0.018173127,0.001914323,0.00018862517,0.00016838928,0.00039060976,0.08101202],"genre_scores_gemma":[0.63468224,0.22897239,0.12306958,0.00085664034,0.0037830211,0.00010545506,0.0001204214,0.00023875249,0.008171531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654573,0.0013710501,0.00016950292,0.0004308837,0.001243047,0.0002396649],"domain_scores_gemma":[0.95473313,0.039560318,0.0009270358,0.0010825048,0.0032585901,0.00043850753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006885114,0.0010502973,0.000790616,0.002178756,0.00091043767,0.004390598,0.0015101222,0.002302107,0.0048919567],"category_scores_gemma":[0.026265433,0.0006906652,0.0005005374,0.0042265733,0.0037652687,0.008388089,0.0012622867,0.0017377697,0.0009822503],"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.00045844112,0.00021984965,0.0016351189,0.0017144594,0.00009873987,0.00017904084,0.0005380261,0.09761819,0.0030554247,0.27931497,0.0068390705,0.60832864],"study_design_scores_gemma":[0.00015299264,0.00076655817,0.0018563964,0.0015293452,0.00021445098,0.0010876821,0.0009518541,0.3905687,0.0075862273,0.4553363,0.13979875,0.00015078254],"about_ca_topic_score_codex":0.0028941487,"about_ca_topic_score_gemma":0.0010308645,"teacher_disagreement_score":0.006885114,"about_ca_system_score_codex":0.002205732,"about_ca_system_score_gemma":0.00091621897,"threshold_uncertainty_score":0.03641236},"labels":[],"label_agreement":null}]}