{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.166393,0.001965046,0.82467425,0.004597219,0.0012964159,0.00024132132,7.988975e-7,0.000045489385,0.0007864348],"genre_scores_gemma":[0.9918932,0.00014550122,0.0075747734,0.00013027676,0.00020842589,0.000017255657,0.000002959824,0.00001086678,0.00001679171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676174,0.0008398054,0.0010172637,0.00015916234,0.0009688957,0.00025310484],"domain_scores_gemma":[0.99628425,0.00076705543,0.0005802746,0.0007396348,0.0015351502,0.00009361129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004261497,0.00010395302,0.00021073343,0.0005678387,0.00008529014,0.0005142291,0.003824205,0.00007784013,0.0000064877986],"category_scores_gemma":[0.00032986136,0.00009853869,0.00008674286,0.00069741136,0.000076741664,0.00076053664,0.0004200152,0.00066007243,0.000021200436],"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.000056948946,0.00024072269,0.0035624949,0.0000030955212,0.00006799733,0.000077114564,0.0012799038,0.7797158,0.00022607631,0.20232548,0.00026889113,0.012175506],"study_design_scores_gemma":[0.0024036923,0.00013217615,0.0066664754,0.001672276,0.0000042641855,0.00017018786,0.0007199451,0.9794086,0.00040516432,0.0051630195,0.0030630908,0.00019110054],"about_ca_topic_score_codex":0.00028912042,"about_ca_topic_score_gemma":0.000107389584,"teacher_disagreement_score":0.82550013,"about_ca_system_score_codex":0.0006197623,"about_ca_system_score_gemma":0.00021618351,"threshold_uncertainty_score":0.7106388},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009299364,0.0090129655,0.9746796,0.0041808034,0.0008707109,0.0004753023,0.000008335714,0.00008168133,0.0013912721],"genre_scores_gemma":[0.9829114,0.0006207264,0.015813973,0.00007138806,0.00029482742,0.00008663102,0.000020342826,0.000011466088,0.00016926586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982154,0.00025804597,0.0007772009,0.00022272616,0.00039559288,0.00013104026],"domain_scores_gemma":[0.9949074,0.0005981216,0.0011141102,0.0022114213,0.0011078774,0.000061062005],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001828543,0.000120374534,0.00025347568,0.0005132963,0.000211508,0.0003570417,0.006218028,0.00007505712,2.3747504e-7],"category_scores_gemma":[0.00019342748,0.00011005187,0.000045285997,0.00032203324,0.000089324974,0.00011858158,0.0013938384,0.00019490453,0.0000043187288],"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.000028456643,0.00014824876,0.00015700783,0.000030358746,0.00025495962,4.709244e-7,0.00040612527,0.05554817,0.0005390334,0.5566803,0.0010217564,0.38518506],"study_design_scores_gemma":[0.0010583183,0.00008372428,0.00013888004,0.00037390753,0.000022365182,0.00008648475,0.00052559626,0.46415272,0.00009767356,0.004184736,0.5291083,0.00016729442],"about_ca_topic_score_codex":0.00002145912,"about_ca_topic_score_gemma":0.0000036056783,"teacher_disagreement_score":0.973612,"about_ca_system_score_codex":0.000076803924,"about_ca_system_score_gemma":0.00004524942,"threshold_uncertainty_score":0.9991588},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95582706,0.0075338418,0.02518469,0.00028249665,0.0020134838,0.00035573845,0.000018141658,0.00013446591,0.008650114],"genre_scores_gemma":[0.99719894,0.0019666061,0.00050501246,0.000013920067,0.0000907153,0.000041815354,0.000026053925,0.000030906263,0.00012603194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980539,0.00019064099,0.0010006458,0.000071603965,0.0004968054,0.0001864088],"domain_scores_gemma":[0.99725306,0.0003033202,0.00063323946,0.0007138797,0.0010183301,0.00007816542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007338177,0.00016895257,0.00034548977,0.00041259787,0.00006607339,0.00005464984,0.001337474,0.00014470697,0.000012681296],"category_scores_gemma":[0.000052209198,0.00014186764,0.00007195597,0.00025302236,0.000101261176,0.0007652628,0.000032707667,0.0004700154,0.000011909392],"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.0014781714,0.0011044955,0.19482152,0.00040513295,0.0035500622,0.0000047868493,0.00822481,0.7153209,0.03567032,0.008093787,0.0071408018,0.024185214],"study_design_scores_gemma":[0.012050598,0.0018843531,0.07495147,0.010159228,0.00084744353,0.00864297,0.013521084,0.54828537,0.05338564,0.00011527689,0.27363646,0.0025200865],"about_ca_topic_score_codex":0.00008696168,"about_ca_topic_score_gemma":0.00001758152,"teacher_disagreement_score":0.26649567,"about_ca_system_score_codex":0.00020361748,"about_ca_system_score_gemma":0.000044737906,"threshold_uncertainty_score":0.57851946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024893552,0.0013809745,0.9840363,0.003552761,0.0011580408,0.000055893765,0.0000014617849,0.000022564038,0.0073026004],"genre_scores_gemma":[0.9880106,0.0005153862,0.010516444,0.0002591766,0.00010003907,0.0000025123852,0.0000028086222,0.0000058288233,0.00058723346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984551,0.00022612426,0.0006192622,0.00010633609,0.0004941722,0.0000989911],"domain_scores_gemma":[0.9979099,0.0002782866,0.0005778877,0.0004594765,0.00067286816,0.00010158116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011875372,0.00009288511,0.00018950916,0.00024580635,0.0000637533,0.0002868338,0.002008892,0.000039041894,0.0000067674555],"category_scores_gemma":[0.000022154796,0.00008024588,0.000057669335,0.00014558597,0.000066169654,0.0004792247,0.00031601771,0.00021434017,0.00001133812],"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.00002163237,0.000050590323,0.0010058276,0.000004956956,0.00010035394,0.0000111723875,0.000541169,0.0007192267,0.00001865317,0.13511339,0.00056334573,0.86184967],"study_design_scores_gemma":[0.0002125725,0.000051836756,0.0011300126,0.0002116124,0.00000815984,0.00033026809,0.000088447385,0.94133914,0.000011955047,0.009310432,0.047194064,0.00011148375],"about_ca_topic_score_codex":0.00009891155,"about_ca_topic_score_gemma":0.000033272878,"teacher_disagreement_score":0.9855212,"about_ca_system_score_codex":0.000060019167,"about_ca_system_score_gemma":0.00006665272,"threshold_uncertainty_score":0.37330544},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25279275,0.21964118,0.49573913,0.023469662,0.0017548417,0.001432826,0.000016389515,0.00036569816,0.0047875247],"genre_scores_gemma":[0.9824146,0.015599751,0.0017129659,0.00006106927,0.000115910756,0.000022516704,0.000036822155,0.000027777161,0.00000859968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781686,0.0006359087,0.00090766966,0.000115342795,0.000394673,0.00012952383],"domain_scores_gemma":[0.9984594,0.00026538366,0.0004047244,0.00050673215,0.00024495847,0.00011879453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013235951,0.00016417945,0.00027803905,0.000390795,0.000056570632,0.00023459374,0.00068436784,0.00013303864,0.0000010169233],"category_scores_gemma":[0.00003059687,0.0001531341,0.000039607632,0.00013046742,0.00010466244,0.00038720525,0.0001018769,0.0003071857,0.000002261848],"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.00043104586,0.0002701048,0.016913481,0.00007763488,0.00041065825,0.000010378884,0.01039664,0.88247085,0.00066712586,0.003386328,0.0006737688,0.084291965],"study_design_scores_gemma":[0.003187135,0.00008320877,0.0032697646,0.0007435985,0.000028254488,0.00018087587,0.005914576,0.8259311,0.00013679227,0.0010976936,0.15911421,0.00031284158],"about_ca_topic_score_codex":0.00012221726,"about_ca_topic_score_gemma":0.0000884753,"teacher_disagreement_score":0.7296218,"about_ca_system_score_codex":0.0001890299,"about_ca_system_score_gemma":0.000041969637,"threshold_uncertainty_score":0.6244627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01782297,0.0007234777,0.97873455,0.0014393191,0.0002644456,0.0006654667,0.000005271575,0.00002338849,0.00032108335],"genre_scores_gemma":[0.8553343,0.00004303371,0.14440916,0.00005283198,0.000037498558,0.00004343484,0.00001025031,0.000009398625,0.000060138373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716294,0.0003384094,0.0010403625,0.00013106377,0.0011650623,0.00016218449],"domain_scores_gemma":[0.9943375,0.00021032477,0.002201057,0.0010785183,0.002059812,0.00011279186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013899519,0.00013759776,0.0002737969,0.0004096657,0.000065813554,0.00011913835,0.0024367832,0.000053400425,0.000022482258],"category_scores_gemma":[0.00012627004,0.00011462047,0.00011645714,0.0003821563,0.00008614664,0.0012701335,0.00018865235,0.00019329143,0.000019899446],"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.0004450482,0.0025665527,0.022019874,0.0001127599,0.0021617757,0.000008705544,0.010564577,0.01322684,0.021231843,0.89927906,0.0001901192,0.028192844],"study_design_scores_gemma":[0.0046783807,0.00037307,0.031959325,0.0018030627,0.00020778972,0.00024989693,0.0010042707,0.9136615,0.008339819,0.009691171,0.027300715,0.0007310361],"about_ca_topic_score_codex":0.00002611357,"about_ca_topic_score_gemma":0.0000052751666,"teacher_disagreement_score":0.9004346,"about_ca_system_score_codex":0.0002618609,"about_ca_system_score_gemma":0.0001386229,"threshold_uncertainty_score":0.46740872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008822058,0.00002769782,0.97977847,0.0002554533,0.00048376777,0.0103872055,0.000004679524,0.00007719563,0.00016345113],"genre_scores_gemma":[0.9571966,0.0000033124988,0.0332265,0.00006282532,0.00039609303,0.009053406,0.000021741342,0.000023316186,0.000016239144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973252,0.0005328824,0.0008980597,0.00022498619,0.0007715103,0.00024735866],"domain_scores_gemma":[0.99461156,0.00064549485,0.0014738314,0.00091878115,0.002210589,0.00013975523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016240922,0.00018632617,0.00030953853,0.00017408309,0.0001873153,0.0005824771,0.002993821,0.000104517516,0.0000015297205],"category_scores_gemma":[0.000055178643,0.00014704451,0.00010623471,0.00024797235,0.000073163625,0.00038194965,0.00015650626,0.00029990173,0.0000016874786],"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.00011267675,0.00021448189,0.00037735648,0.000004700917,0.000063095475,0.000002694549,0.00019462086,0.9793411,0.00009378311,0.01617026,0.00009157283,0.0033336566],"study_design_scores_gemma":[0.0015975023,0.00034412844,0.00020854182,0.0004199844,0.000008011125,0.00013059823,0.00012986855,0.9846969,0.00019638953,0.00001430627,0.012081679,0.00017204945],"about_ca_topic_score_codex":0.000019716186,"about_ca_topic_score_gemma":0.0000051568345,"teacher_disagreement_score":0.9483745,"about_ca_system_score_codex":0.00017660102,"about_ca_system_score_gemma":0.000078907615,"threshold_uncertainty_score":0.5996302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023096805,0.0001387201,0.9731805,0.0021507996,0.0006609784,0.0001081451,0.000016901122,0.00003801412,0.00060919323],"genre_scores_gemma":[0.9354895,0.000010734784,0.06392156,0.00013672345,0.00032459665,0.0000066270786,0.00003073883,0.0000072481416,0.00007226806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821466,0.00024980828,0.0005620146,0.00020017398,0.00066596345,0.000107400236],"domain_scores_gemma":[0.9966843,0.0005671633,0.0007761241,0.0013167445,0.0006015511,0.000054104377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027966124,0.000101112884,0.00021049878,0.00062936987,0.00013108799,0.0003320608,0.0037629222,0.000040998864,4.2204772e-7],"category_scores_gemma":[0.00024338624,0.000087999724,0.00013806701,0.00028800426,0.0000199555,0.0000704193,0.00042744493,0.00014405964,0.0000012228734],"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.000021401822,0.000084969324,0.0004996062,0.000004898355,0.00030445034,4.0829136e-7,0.00011753355,0.96097845,0.000019735045,0.0053048003,0.00013295116,0.0325308],"study_design_scores_gemma":[0.0005392833,0.000043346492,0.00057286257,0.00019666305,0.00007147759,0.0000040073987,0.00006766416,0.9958803,0.000011262363,0.00021171191,0.0023268915,0.00007450696],"about_ca_topic_score_codex":0.000027012893,"about_ca_topic_score_gemma":0.0000039765846,"teacher_disagreement_score":0.9123927,"about_ca_system_score_codex":0.000105363404,"about_ca_system_score_gemma":0.00005355544,"threshold_uncertainty_score":0.6992508},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01366607,0.001499354,0.9825058,0.00004684606,0.00065090216,0.0003290005,0.000003831865,0.000051585168,0.0012465885],"genre_scores_gemma":[0.9968643,0.00021455147,0.0021664584,0.000010030003,0.00020423671,0.00005386431,0.000049632556,0.000033347373,0.00040358864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989989,0.00006617534,0.00048116987,0.00004834267,0.00027026597,0.00013517767],"domain_scores_gemma":[0.9983567,0.00016853209,0.00044494984,0.00009421796,0.0008786515,0.00005694974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041891928,0.0001095088,0.00016109888,0.00020347466,0.00006411079,0.000057425863,0.00022211169,0.000053623633,0.00002036847],"category_scores_gemma":[0.00005806138,0.00009899501,0.000051151215,0.000095589836,0.000016660615,0.000710405,0.000019743802,0.00018026424,0.00001200367],"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.0000843768,0.00002037962,0.0005744458,0.000014946006,0.00025755318,2.3503151e-7,0.0006453961,0.9969404,0.00037430364,0.00030793418,0.00008702076,0.0006930055],"study_design_scores_gemma":[0.001401213,0.00013656681,0.0007550223,0.00074039015,0.00005667784,0.0001935803,0.0011122386,0.98645735,0.00043585576,0.000030136098,0.008468833,0.00021213164],"about_ca_topic_score_codex":0.000008227948,"about_ca_topic_score_gemma":0.0000039335564,"teacher_disagreement_score":0.9831982,"about_ca_system_score_codex":0.00031252037,"about_ca_system_score_gemma":0.000019565348,"threshold_uncertainty_score":0.40368995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002627334,0.0017987489,0.9420412,0.0053137373,0.00065117195,0.048445094,0.000016182734,0.00013281008,0.0013382823],"genre_scores_gemma":[0.7569914,0.0003006845,0.12816124,0.0002484334,0.00024118104,0.113496095,0.00005201133,0.000057327543,0.00045166892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494016,0.0010038278,0.0019935619,0.00027254244,0.0014340037,0.00035593004],"domain_scores_gemma":[0.9855258,0.001809958,0.002374435,0.0030138744,0.00705122,0.00022475285],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031835134,0.00028125301,0.00048132768,0.0006761342,0.00031903532,0.0018704963,0.011414575,0.00018589669,0.000016947484],"category_scores_gemma":[0.00035721203,0.00025359803,0.00025621447,0.00050347426,0.00016794882,0.0020260515,0.00092396623,0.00064331054,0.00007403513],"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.0008298193,0.006089084,0.0046994328,0.00043389547,0.002098046,0.000010442978,0.0040163645,0.40367413,0.019643437,0.43214658,0.039328698,0.08703008],"study_design_scores_gemma":[0.004014916,0.00011877031,0.002086519,0.0010885925,0.000009461041,0.00010985213,0.0002669958,0.8283223,0.00038727876,0.000274039,0.16301993,0.00030133963],"about_ca_topic_score_codex":0.0003781454,"about_ca_topic_score_gemma":0.00001300777,"teacher_disagreement_score":0.81388,"about_ca_system_score_codex":0.00049974606,"about_ca_system_score_gemma":0.0004191415,"threshold_uncertainty_score":0.9999916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61942244,0.015534589,0.35013816,0.0037880256,0.0033556542,0.0024068558,0.00011418641,0.00047865353,0.004761465],"genre_scores_gemma":[0.99271154,0.0005095674,0.006064501,0.000103202765,0.0002423852,0.0002764807,0.00003412476,0.000039422415,0.000018761357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786955,0.00032933932,0.0009395112,0.00008944687,0.0005708726,0.00020128374],"domain_scores_gemma":[0.99657065,0.0011149867,0.0006687489,0.0008831397,0.00064570067,0.00011675573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015522277,0.00018843105,0.0002620973,0.00016596819,0.00016042963,0.00009654911,0.0017373138,0.00010044345,0.000041270672],"category_scores_gemma":[0.00035056684,0.00013998637,0.00016125859,0.00010517556,0.00007857353,0.00064797717,0.00014051859,0.0004778019,0.000009689501],"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.0008992767,0.002445919,0.015734117,0.00037581936,0.0016684266,0.000005971888,0.017777022,0.13285291,0.083474845,0.69901264,0.022602461,0.023150565],"study_design_scores_gemma":[0.011961925,0.0014163724,0.03344956,0.021352105,0.0004168321,0.0008929961,0.00985997,0.12789391,0.23333405,0.29658926,0.25769526,0.0051377537],"about_ca_topic_score_codex":0.000007089592,"about_ca_topic_score_gemma":0.0000040979253,"teacher_disagreement_score":0.4024234,"about_ca_system_score_codex":0.00030962625,"about_ca_system_score_gemma":0.000048742066,"threshold_uncertainty_score":0.5708478},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054923788,0.0034281379,0.93951505,0.00024095569,0.00059226097,0.0006075362,0.000010137977,0.000110501416,0.0005716433],"genre_scores_gemma":[0.93424124,0.0018666611,0.06354911,0.000025737227,0.00010967631,0.00013220876,0.000027289203,0.000030543484,0.000017553471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862784,0.000097171076,0.00075257634,0.00008909533,0.00032679242,0.00010653632],"domain_scores_gemma":[0.99636126,0.0006514146,0.0004954722,0.00033342917,0.002098121,0.00006032992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041998047,0.00013494858,0.00022163817,0.000311967,0.000079337326,0.00015602206,0.0006811252,0.00009811745,0.0000073313067],"category_scores_gemma":[0.00017726372,0.00013369122,0.00006407566,0.00013676901,0.00004906158,0.0010848546,0.00006738279,0.0001764045,0.000005839933],"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.00016621458,0.00016087122,0.0011455439,0.00004301687,0.0006940947,0.0000010794729,0.0030586983,0.57906884,0.029390713,0.11207004,0.005410352,0.26879057],"study_design_scores_gemma":[0.001338867,0.00016312284,0.0032252558,0.0007003496,0.000023901708,0.00007011299,0.0008767018,0.9049981,0.0042847795,0.07986384,0.0041106115,0.00034433504],"about_ca_topic_score_codex":0.000035384528,"about_ca_topic_score_gemma":0.0000049497376,"teacher_disagreement_score":0.8793174,"about_ca_system_score_codex":0.00024639364,"about_ca_system_score_gemma":0.000023312485,"threshold_uncertainty_score":0.54517704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93381256,0.04732318,0.010678016,0.00010558071,0.0059622247,0.00033910287,0.000007479262,0.000077407414,0.001694444],"genre_scores_gemma":[0.99781996,0.0006278808,0.00031507204,0.000027767655,0.0011190788,0.000021642907,0.00001350487,0.000033262233,0.000021810929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977635,0.00033512086,0.00096600316,0.00008019265,0.0005669603,0.00028820423],"domain_scores_gemma":[0.99842274,0.00024493656,0.00040457956,0.00043270606,0.0003827366,0.000112305475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016240083,0.00015853792,0.0003094662,0.00018607546,0.0000506853,0.00012293275,0.0010455766,0.00011811786,0.000020300964],"category_scores_gemma":[0.000039626608,0.00015833971,0.0001110948,0.00017209371,0.00003871578,0.00054837595,0.0001350968,0.0004876001,0.000015438061],"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.00011069669,0.00022840187,0.03088622,0.000041896637,0.00032199532,0.000026825575,0.0023628855,0.9561595,0.0007556999,0.0022944899,0.001181895,0.0056294994],"study_design_scores_gemma":[0.00538384,0.00016382386,0.020286657,0.0045687365,0.00013063176,0.0012568581,0.0013860579,0.83171314,0.003972468,0.0009795863,0.12880188,0.0013563446],"about_ca_topic_score_codex":0.00004985396,"about_ca_topic_score_gemma":0.00003386045,"teacher_disagreement_score":0.12761998,"about_ca_system_score_codex":0.00036600095,"about_ca_system_score_gemma":0.000029778177,"threshold_uncertainty_score":0.64569056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3506667,0.0011680891,0.64656425,0.0005561252,0.00045065634,0.00002966569,2.7499533e-7,0.000017335762,0.0005469271],"genre_scores_gemma":[0.9989573,0.00041670154,0.0003832153,0.00010443572,0.000088733876,0.000003154641,0.0000013710072,0.000005616424,0.000039516264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867684,0.00027934884,0.00044399773,0.00010379644,0.00039435024,0.00010168834],"domain_scores_gemma":[0.9985895,0.00026853217,0.0004123106,0.00029880082,0.0003762534,0.00005460721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009871048,0.00008384858,0.00017267768,0.00025692553,0.00006450909,0.00033339896,0.0013070499,0.000039936902,5.247473e-7],"category_scores_gemma":[0.0000195732,0.00006832563,0.00003819036,0.00015443977,0.000042931075,0.00044778024,0.00012214255,0.00018622179,5.895812e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018400548,0.00032892905,0.0100704925,0.000009337814,0.00027154988,0.00006192024,0.002409259,0.38491026,0.0005114361,0.46088326,0.00046367993,0.1398959],"study_design_scores_gemma":[0.0006196006,0.00008012279,0.00062690733,0.00031633224,0.0000043423956,0.00039869198,0.000091366106,0.99622875,0.000009112893,0.000065083346,0.0014720393,0.00008762082],"about_ca_topic_score_codex":0.000121285215,"about_ca_topic_score_gemma":0.00005328865,"teacher_disagreement_score":0.6482906,"about_ca_system_score_codex":0.00007756387,"about_ca_system_score_gemma":0.00004469159,"threshold_uncertainty_score":0.32149738},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68222654,0.0007375596,0.31251615,0.00075488316,0.0018671771,0.00053852046,0.0000064612723,0.00012726888,0.0012254309],"genre_scores_gemma":[0.9972813,0.00014454158,0.0023431412,0.000012064024,0.0001028718,0.00007022029,0.0000064846013,0.000014178338,0.000025177715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891835,0.00012809469,0.0004863428,0.00006866269,0.00032322874,0.000075318],"domain_scores_gemma":[0.9986595,0.000110451896,0.00024591837,0.00016213596,0.0007616102,0.00006037221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003515055,0.000095072646,0.00014924908,0.00015341215,0.000043839653,0.00012065348,0.00028841192,0.000056749344,0.000016914595],"category_scores_gemma":[0.000030998373,0.00008353096,0.00003416926,0.000096752185,0.00008608118,0.0005922596,0.000014992654,0.00023204536,0.0000086165],"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.00013860507,0.00018167816,0.008558495,0.000085864485,0.00047390955,0.00000886819,0.0030350087,0.8989513,0.05440881,0.0009095336,0.004145809,0.029102111],"study_design_scores_gemma":[0.0018097527,0.00025700417,0.020887045,0.0014555041,0.00005869713,0.0036715916,0.0021059471,0.9442562,0.014949335,0.0008952756,0.009132171,0.0005214683],"about_ca_topic_score_codex":0.00012858378,"about_ca_topic_score_gemma":0.00000684823,"teacher_disagreement_score":0.31505477,"about_ca_system_score_codex":0.0001859954,"about_ca_system_score_gemma":0.00003495801,"threshold_uncertainty_score":0.3406294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015879007,0.002731307,0.97308606,0.0054835426,0.0013561648,0.00056326564,0.00000478755,0.00004658382,0.0008492638],"genre_scores_gemma":[0.9811314,0.0019081116,0.015865456,0.00036271953,0.00017466038,0.00010387887,0.000016270207,0.00001545133,0.0004220805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976821,0.00050833664,0.0009548135,0.00016492291,0.0005017539,0.00018807036],"domain_scores_gemma":[0.9932378,0.00069498207,0.0009002768,0.0008182473,0.004229363,0.000119335666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010446998,0.00016999438,0.00029348934,0.00020742281,0.0002404291,0.00071981724,0.0033790944,0.000080034144,0.000043644162],"category_scores_gemma":[0.00010660073,0.00014805363,0.00014347282,0.00021745314,0.00006550494,0.0010684698,0.00049002253,0.00032972265,0.00002802469],"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.00011155966,0.00034872358,0.00048918126,0.000005558964,0.0007303693,0.000006360616,0.0037939756,0.8332007,0.0010922505,0.11187486,0.03155557,0.016790885],"study_design_scores_gemma":[0.0012989314,0.00019600551,0.00043759574,0.000299139,0.000010476976,0.000110288616,0.001000981,0.9472106,0.0002120813,0.000041951527,0.04894799,0.00023397226],"about_ca_topic_score_codex":0.000010960768,"about_ca_topic_score_gemma":0.0000036214487,"teacher_disagreement_score":0.96525234,"about_ca_system_score_codex":0.00022145448,"about_ca_system_score_gemma":0.00012686285,"threshold_uncertainty_score":0.6941214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034052483,0.00063834636,0.9914169,0.000774803,0.0018628258,0.00048410599,0.000011238199,0.00012431438,0.0012822631],"genre_scores_gemma":[0.8156779,0.000068097375,0.1838575,0.00005556394,0.00013121848,0.000093523195,0.0000070356796,0.000012671726,0.000096490934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753076,0.00023309301,0.0012312544,0.00014308837,0.0007286245,0.00013320682],"domain_scores_gemma":[0.9929188,0.00044166797,0.0016787578,0.00069633056,0.004178075,0.0000863725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012859125,0.00013746713,0.00033238195,0.00047977758,0.00007972178,0.00036267185,0.0029821452,0.00005542584,0.000009422446],"category_scores_gemma":[0.00016304106,0.00012436183,0.00019534127,0.00018293962,0.000058662754,0.0014392602,0.00022902088,0.00016068344,0.000024062789],"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.00006224732,0.00075646286,0.0008795858,0.00019319887,0.0013122102,0.000019439834,0.002476132,0.0012577279,0.010449696,0.31492355,0.032862037,0.6348077],"study_design_scores_gemma":[0.001078707,0.00020526056,0.0009516814,0.0013381059,0.000026859303,0.0008652852,0.00046658766,0.96429616,0.007922855,0.0049544116,0.017617838,0.0002762739],"about_ca_topic_score_codex":0.00027261896,"about_ca_topic_score_gemma":0.0000013673919,"teacher_disagreement_score":0.9630384,"about_ca_system_score_codex":0.00022704434,"about_ca_system_score_gemma":0.00012778508,"threshold_uncertainty_score":0.5541617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04845339,0.0061303033,0.92606896,0.0014267038,0.0023692388,0.0008569251,0.000010638837,0.00025782676,0.014425991],"genre_scores_gemma":[0.99770766,0.00031369046,0.0016822962,0.00007828861,0.00009017423,0.00003958121,0.000037511938,0.000028596985,0.00002217557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981432,0.0003361951,0.00088564225,0.00007467382,0.0004256221,0.00013467306],"domain_scores_gemma":[0.9980907,0.00028791267,0.00041267075,0.00049894897,0.0006408456,0.00006894335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062194566,0.00014712618,0.0002456238,0.00042178924,0.000051905106,0.00019830432,0.0010517695,0.00009979633,0.000026650867],"category_scores_gemma":[0.000043864282,0.00013807882,0.00008747269,0.00020032805,0.000037056823,0.00047725908,0.000022874741,0.0003821659,0.000023379072],"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.000032431275,0.00005167457,0.00070196344,0.000006887444,0.000038836864,0.000002308387,0.00012434958,0.9958431,0.00021718339,0.0012729344,0.0007716063,0.0009366843],"study_design_scores_gemma":[0.00096390507,0.00003319124,0.0012250647,0.00055931765,0.0000073573738,0.00002819105,0.00048517855,0.99592364,0.00005032082,0.000024941903,0.00057991256,0.00011900026],"about_ca_topic_score_codex":0.000075582735,"about_ca_topic_score_gemma":0.0000060554617,"teacher_disagreement_score":0.9492543,"about_ca_system_score_codex":0.00036657217,"about_ca_system_score_gemma":0.000022977825,"threshold_uncertainty_score":0.56306905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76308835,0.0005605968,0.23488869,0.00020981769,0.00026329656,0.00009811205,0.000001024327,0.000053820368,0.0008363075],"genre_scores_gemma":[0.97895604,0.00048000584,0.020443149,0.000017870652,0.00006888729,0.0000047426415,0.0000057803254,0.000019996052,0.0000035373057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998714,0.00006807006,0.0006494328,0.000069608555,0.00036060865,0.00013822071],"domain_scores_gemma":[0.99860126,0.00037362584,0.00030263973,0.00030207657,0.0003764136,0.000043990323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235581,0.00012168235,0.00027361792,0.00021148086,0.000023795723,0.000026057245,0.00068521214,0.0000990769,0.0000068212803],"category_scores_gemma":[0.000075455464,0.00010101642,0.000046286197,0.00014753675,0.00007515374,0.00025143358,0.000059152895,0.00044261653,0.0000034328116],"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.00009416633,0.000032484295,0.0026557746,0.000016657395,0.000056820045,0.000003392792,0.000035864257,0.9827736,0.00018195009,0.0007042638,0.000018828461,0.013426192],"study_design_scores_gemma":[0.00088468066,0.00017470565,0.001868915,0.00074059697,0.000011204588,0.00004762395,0.000083384184,0.99497986,0.0005558539,0.000028484315,0.0005169406,0.00010777971],"about_ca_topic_score_codex":0.000005841775,"about_ca_topic_score_gemma":0.000004610044,"teacher_disagreement_score":0.2158677,"about_ca_system_score_codex":0.00018896718,"about_ca_system_score_gemma":0.000023048744,"threshold_uncertainty_score":0.411933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038919274,0.0018437549,0.9460779,0.010035695,0.0011665106,0.0005880899,0.000011140133,0.000055296703,0.0013023803],"genre_scores_gemma":[0.99235624,0.000052290532,0.006618576,0.00009787932,0.0005169574,0.000073210394,0.0000030664232,0.000011227399,0.000270566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762565,0.00047958625,0.0005461437,0.00015280691,0.0009987629,0.00019706762],"domain_scores_gemma":[0.9949029,0.0015557026,0.0005125984,0.0004463337,0.0025030093,0.00007945066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015897079,0.00011544928,0.00023172735,0.00033262558,0.00016594774,0.00041309954,0.0018298557,0.00004951312,0.0000018150187],"category_scores_gemma":[0.000098053046,0.00008942536,0.00009961636,0.00020677893,0.00008081747,0.00040540568,0.00007090365,0.00027751797,0.000014325911],"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.0025630437,0.000547059,0.00055789703,0.0000069089365,0.00067143945,0.00005081908,0.00083048677,0.36905235,0.00026645054,0.50720024,0.0143623315,0.103890955],"study_design_scores_gemma":[0.0052840784,0.00090547797,0.0010318791,0.0006037323,0.000025029176,0.00012559062,0.0007498675,0.9625668,0.00010900146,0.004070785,0.024315761,0.0002120172],"about_ca_topic_score_codex":0.00006787777,"about_ca_topic_score_gemma":0.000024936986,"teacher_disagreement_score":0.953437,"about_ca_system_score_codex":0.00020265812,"about_ca_system_score_gemma":0.00014001346,"threshold_uncertainty_score":0.39835283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92129564,0.00093983155,0.077419385,0.000047365356,0.0001407907,0.00007215072,0.0000019291474,0.000012407389,0.000070488095],"genre_scores_gemma":[0.9925638,0.00014447549,0.007209483,0.000007540198,0.000051112278,0.0000023624793,0.0000038879994,0.000008827842,0.000008546057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908704,0.00010829289,0.0004567988,0.000039173745,0.00025750388,0.000051210565],"domain_scores_gemma":[0.9987788,0.000081386774,0.00034782983,0.00015175661,0.0005961563,0.000044031345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003279387,0.0000685296,0.00015439444,0.0001675448,0.00002919375,0.00007053794,0.00037986526,0.000038702812,0.000013851508],"category_scores_gemma":[0.000021663434,0.000056995417,0.00003057435,0.00008187081,0.00003374431,0.00031703184,0.000026786764,0.00014007161,0.000001989111],"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.00007195848,0.00007412999,0.004917809,0.00003745927,0.00044130703,0.000004053918,0.0017748402,0.8026925,0.17712134,0.00054348406,0.00009738188,0.012223736],"study_design_scores_gemma":[0.00019120629,0.00005720974,0.00340538,0.00013700305,0.000011902739,0.0000788997,0.00032846374,0.99474186,0.0009140818,0.00005047682,0.00002586816,0.00005764236],"about_ca_topic_score_codex":0.000026068878,"about_ca_topic_score_gemma":7.3645873e-7,"teacher_disagreement_score":0.19204937,"about_ca_system_score_codex":0.00003738499,"about_ca_system_score_gemma":0.000016596641,"threshold_uncertainty_score":0.23242056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0160203,0.006963656,0.9740006,0.00019288361,0.0015832292,0.00016411088,0.0000050995477,0.000077564066,0.0009926021],"genre_scores_gemma":[0.9980967,0.00014272235,0.0012529225,0.000039339564,0.00030809926,0.000021897593,0.00007080544,0.00004016362,0.000027354126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978791,0.00028333583,0.0010438142,0.000101261845,0.000537632,0.00015486883],"domain_scores_gemma":[0.99786234,0.00012864721,0.00051999657,0.00043826556,0.00093570416,0.00011506093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009010724,0.0001559207,0.00025989953,0.0004386492,0.00003197918,0.00010200062,0.0008457152,0.000114565606,0.000003241998],"category_scores_gemma":[0.000064032654,0.00016227427,0.000075286545,0.00026100443,0.000030653988,0.00024513452,0.000052335192,0.00023706525,0.000005733885],"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.000035588764,0.000057832003,0.00017124119,0.000005389784,0.000048286987,0.000010515705,0.0002966999,0.99753815,0.00033242427,0.0005509643,0.00046036154,0.00049254275],"study_design_scores_gemma":[0.0007731519,0.000031536838,0.00003112136,0.00032037054,0.000008905282,0.00005224347,0.0006159687,0.98523134,0.0008219095,0.000023317847,0.011946889,0.00014326215],"about_ca_topic_score_codex":0.0000670466,"about_ca_topic_score_gemma":0.00002031622,"teacher_disagreement_score":0.9820764,"about_ca_system_score_codex":0.0007233139,"about_ca_system_score_gemma":0.000070843205,"threshold_uncertainty_score":0.6617353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13326004,0.0006682912,0.85177505,0.002381528,0.0013802046,0.00014115602,0.000003917899,0.00007933823,0.010310475],"genre_scores_gemma":[0.99412423,0.00001129502,0.0050282767,0.00021491946,0.00029786618,0.000011984244,0.0000043159075,0.000010595211,0.0002965377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976203,0.00008259132,0.00071987265,0.00017218306,0.001249818,0.00015524204],"domain_scores_gemma":[0.9959944,0.00012026898,0.0009833743,0.0008255928,0.0019129058,0.00016348311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014206008,0.00013651795,0.00020429873,0.0002575455,0.00009914744,0.00048529866,0.0033253296,0.000052027022,0.0000023194325],"category_scores_gemma":[0.000045200144,0.00010523652,0.00008741619,0.00025187826,0.00007052482,0.00010206593,0.00057058956,0.00019962486,0.000018479393],"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.000106087595,0.00057466386,0.0016634563,0.000005698878,0.00031476314,0.000023778117,0.0033198686,0.7778818,0.00011078366,0.2062687,0.0036183624,0.006112023],"study_design_scores_gemma":[0.0021288784,0.00019353117,0.0010070741,0.00016413524,0.000016451877,0.00093289354,0.0005278318,0.7947378,0.00020283365,0.0007849131,0.19905812,0.00024551287],"about_ca_topic_score_codex":0.00019603726,"about_ca_topic_score_gemma":0.000010043919,"teacher_disagreement_score":0.86086416,"about_ca_system_score_codex":0.0002574786,"about_ca_system_score_gemma":0.0001956115,"threshold_uncertainty_score":0.6179345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01903896,0.005912331,0.971735,0.00023936927,0.0012390503,0.0008586511,0.000016137663,0.000056411835,0.00090405776],"genre_scores_gemma":[0.99502426,0.0008603736,0.003571362,0.000018760275,0.00019628015,0.000093019735,0.00004843788,0.000028824481,0.0001586494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985832,0.0001198177,0.00082106516,0.000070729315,0.00027148225,0.00013372028],"domain_scores_gemma":[0.99761814,0.00053823163,0.0005161268,0.00012561672,0.0011430276,0.000058860227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047881968,0.00011350381,0.00021906328,0.0002390288,0.000028358372,0.00008204953,0.00041026445,0.00012406241,0.000014833488],"category_scores_gemma":[0.00007318003,0.00011388767,0.000083953106,0.00010570239,0.0000102401555,0.00050320907,0.000018246274,0.00019622999,0.0000092137425],"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.000025615027,0.00004264115,0.0008879238,0.000010790843,0.000094374846,0.0000012556549,0.0005149957,0.987731,0.00088045734,0.00002277006,0.00035446757,0.00943372],"study_design_scores_gemma":[0.0013308655,0.000036786067,0.00044922752,0.0004002259,0.000018209344,0.000021057946,0.00032390037,0.9946198,0.0008614992,0.00013923284,0.001662378,0.00013682165],"about_ca_topic_score_codex":0.00007794127,"about_ca_topic_score_gemma":0.0000123536065,"teacher_disagreement_score":0.97598535,"about_ca_system_score_codex":0.0004324116,"about_ca_system_score_gemma":0.000019314417,"threshold_uncertainty_score":0.46442044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117605895,0.008016009,0.8710539,0.000029932402,0.002169545,0.0001520152,0.000029547793,0.00008620147,0.00085697],"genre_scores_gemma":[0.98007804,0.0017784062,0.017847743,0.0000053693398,0.0002075504,0.0000082290435,0.000038933886,0.000026360085,0.000009391352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794924,0.00011017403,0.0011679195,0.00006543062,0.0005409137,0.00016629067],"domain_scores_gemma":[0.99719095,0.00024238662,0.00079824915,0.00037240444,0.0013058733,0.0000901504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091063045,0.0001384688,0.00040780078,0.0009313813,0.00004250843,0.000047857633,0.0007214227,0.00008742862,0.000014660842],"category_scores_gemma":[0.000086579355,0.00013319666,0.0001694906,0.0006544019,0.000025546316,0.0009890645,0.000055378296,0.00018866832,0.000006338666],"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.000030067176,0.00010001163,0.0047038365,0.000016745262,0.0017297639,0.0000012555005,0.0012534431,0.92663574,0.0010679857,0.000084258674,0.00011374051,0.06426315],"study_design_scores_gemma":[0.0004415074,0.000027014017,0.009070873,0.0004789391,0.00026931244,0.000075638876,0.00047024756,0.98622334,0.0014821428,0.000053952856,0.0012346809,0.0001723498],"about_ca_topic_score_codex":0.00001715933,"about_ca_topic_score_gemma":0.0000039148845,"teacher_disagreement_score":0.8624721,"about_ca_system_score_codex":0.00022649163,"about_ca_system_score_gemma":0.000019792906,"threshold_uncertainty_score":0.54316026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5093148,0.0055660987,0.44082814,0.036843494,0.0029209817,0.00082531164,0.000016439159,0.00007335117,0.0036113954],"genre_scores_gemma":[0.98644125,0.00040995734,0.012666686,0.0002926896,0.000030138914,0.0000060816506,0.000007242856,0.000008977472,0.00013699952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970082,0.0003880756,0.001436861,0.00011944391,0.0009495096,0.00009787974],"domain_scores_gemma":[0.9932322,0.00023531084,0.002231693,0.00092065765,0.003306139,0.00007403347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014997415,0.00010831112,0.00031576504,0.000359213,0.00003157828,0.00015539644,0.0030957223,0.00005331207,0.000021117827],"category_scores_gemma":[0.00016729863,0.00009715602,0.00014570064,0.00025760956,0.00007933107,0.001047304,0.00024793885,0.00016958902,0.000031877626],"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.00012057847,0.0016413787,0.009194375,0.00017495695,0.0017553576,0.0000050760523,0.10288295,0.00042653023,0.14351639,0.6799482,0.022759257,0.03757492],"study_design_scores_gemma":[0.0043855105,0.0003931803,0.030982303,0.003241983,0.000070618655,0.000529998,0.0038694814,0.6391881,0.018955655,0.01709126,0.28053236,0.0007595257],"about_ca_topic_score_codex":0.00021806118,"about_ca_topic_score_gemma":0.0000031669488,"teacher_disagreement_score":0.66285694,"about_ca_system_score_codex":0.000060816725,"about_ca_system_score_gemma":0.00012907952,"threshold_uncertainty_score":0.5752674},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045813166,0.035886597,0.91434246,0.0003188678,0.0018046221,0.00024482925,0.0000106689695,0.00009071776,0.0014880667],"genre_scores_gemma":[0.95110685,0.0026770425,0.0457288,0.00002188272,0.0004036571,0.00000845224,0.000018593617,0.000023238774,0.0000114716095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999038,0.00007630551,0.0005443932,0.00003688339,0.00017978612,0.00012466658],"domain_scores_gemma":[0.9982135,0.00053025794,0.00034716583,0.00030212852,0.00054147246,0.00006544753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103884,0.00008487849,0.00015484128,0.0001344828,0.00009202701,0.00007594609,0.000640138,0.000046900575,0.0000012613932],"category_scores_gemma":[0.000076136384,0.00008843158,0.000042850428,0.00007676789,0.000045062672,0.00050352834,0.00010930386,0.00015600777,0.0000014892388],"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.000032407817,0.00008401443,0.009937253,0.000034560562,0.00035066484,4.848816e-7,0.0029150445,0.89955324,0.0013327713,0.016683793,0.0012525626,0.06782321],"study_design_scores_gemma":[0.0006389554,0.00002379563,0.0010166306,0.00032554904,0.00002635425,0.00018268067,0.000750745,0.94471645,0.00014953423,0.00015083657,0.0518658,0.00015268254],"about_ca_topic_score_codex":0.000003030931,"about_ca_topic_score_gemma":0.0000010103812,"teacher_disagreement_score":0.9052937,"about_ca_system_score_codex":0.00010460607,"about_ca_system_score_gemma":0.000010938878,"threshold_uncertainty_score":0.36061352},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004859913,0.0019764097,0.99205476,0.00011872488,0.0005320064,0.00016246898,0.0000038685835,0.00006713632,0.00022473108],"genre_scores_gemma":[0.98381495,0.00016705888,0.015585955,0.000024291452,0.0003574638,0.000010943805,0.000008053281,0.000023142142,0.000008141637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895865,0.000046358327,0.00056858285,0.0000672104,0.00022920189,0.00013001161],"domain_scores_gemma":[0.99893403,0.00021745099,0.00027270234,0.00018350445,0.00033989208,0.000052402003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884002,0.000111953996,0.00021501532,0.00020867679,0.000034860623,0.000091345755,0.00054355094,0.00006453912,0.0000011427745],"category_scores_gemma":[0.00004437732,0.000112187576,0.00008020408,0.0000967956,0.000019851133,0.00021212171,0.000046915775,0.00025374527,8.2483086e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016992664,0.00001821931,0.000046512556,3.2960564e-8,0.00008411611,0.000007498493,0.00036394142,0.98859715,0.00009805059,0.0023927775,0.0001419478,0.008232752],"study_design_scores_gemma":[0.00077282725,0.00006143178,0.00031131983,0.0010337585,0.000012568985,0.00011061818,0.0006018739,0.9950489,0.000102042686,0.001512786,0.0003219334,0.00010996157],"about_ca_topic_score_codex":0.00015070257,"about_ca_topic_score_gemma":0.00004736938,"teacher_disagreement_score":0.97895503,"about_ca_system_score_codex":0.00030188606,"about_ca_system_score_gemma":0.00006199635,"threshold_uncertainty_score":0.45748764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022102961,0.008709474,0.95600516,0.008621374,0.0016226675,0.00037452107,0.0000046325554,0.00006648695,0.0024927168],"genre_scores_gemma":[0.9968266,0.0011484502,0.0011810003,0.0001610398,0.00041080738,0.000024684317,0.000015146843,0.00001757473,0.00021468979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958586,0.001143674,0.0013891206,0.00018651708,0.0011553833,0.00026667342],"domain_scores_gemma":[0.9948907,0.0009594341,0.001068881,0.0012399588,0.0017116771,0.00012936161],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0021673294,0.00017228693,0.00037175766,0.0005527526,0.000116886564,0.00053802284,0.006162295,0.00014314023,0.000009301885],"category_scores_gemma":[0.00008629546,0.00015686186,0.00013198296,0.00049255125,0.00008485756,0.0010334407,0.00052271935,0.00071162847,0.000012165279],"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.00024276348,0.00067709404,0.031186178,0.000009757692,0.00019765798,0.00011034719,0.00047463813,0.8640588,0.0009276372,0.059291013,0.021942398,0.020881714],"study_design_scores_gemma":[0.0021811498,0.000050288087,0.01193141,0.00059179513,0.0000053441604,0.00017891957,0.000074201365,0.95561266,0.00006634627,0.00046377827,0.028645126,0.00019898005],"about_ca_topic_score_codex":0.00048801638,"about_ca_topic_score_gemma":0.00014123658,"teacher_disagreement_score":0.97472364,"about_ca_system_score_codex":0.00037825707,"about_ca_system_score_gemma":0.00021312108,"threshold_uncertainty_score":0.9992148},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97639626,0.0018991176,0.020103902,0.0004229661,0.00075902184,0.00011688365,0.000005469117,0.00007521315,0.0002211434],"genre_scores_gemma":[0.9897619,0.00053914194,0.009525943,0.000016598435,0.00012064854,0.000009753502,0.0000064881056,0.000014918462,0.0000046324963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984392,0.00007085043,0.0009254758,0.00007517877,0.00034926028,0.00014006824],"domain_scores_gemma":[0.9981376,0.0005962351,0.00030220713,0.00039744985,0.0005236696,0.00004282516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005505554,0.000111275935,0.0003698593,0.0005881495,0.000020218009,0.000045550274,0.0010963752,0.00013059583,0.0000041574094],"category_scores_gemma":[0.00019632747,0.000105216815,0.00010687806,0.0005171554,0.000089298315,0.00030510576,0.000147525,0.00075863104,7.8505343e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018752124,0.000035573674,0.007648483,0.0000108398435,0.00044430388,0.0000031940472,0.00023319795,0.9788653,0.0019978818,0.009122759,0.000008917772,0.0016107581],"study_design_scores_gemma":[0.00029837305,0.000013179264,0.010950667,0.0001939069,0.000056940917,0.000016103037,0.00021151973,0.986556,0.00018561397,0.0008196814,0.0005935764,0.000104474035],"about_ca_topic_score_codex":0.00004541591,"about_ca_topic_score_gemma":0.00026147836,"teacher_disagreement_score":0.013365592,"about_ca_system_score_codex":0.00011565285,"about_ca_system_score_gemma":0.000017869945,"threshold_uncertainty_score":0.4290617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004159632,0.0025172818,0.990923,0.00001868608,0.0014680669,0.0005748717,0.000043355056,0.000027124768,0.00026801616],"genre_scores_gemma":[0.9835828,0.00082504033,0.015303045,0.0000075303565,0.0000990054,0.00010831932,0.000021638552,0.000027255473,0.000025362073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984595,0.0003387841,0.00072743156,0.000053629785,0.00033374052,0.0000869237],"domain_scores_gemma":[0.99601346,0.0017955253,0.00059152226,0.00032748346,0.0012386275,0.000033399963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478203,0.0001016048,0.00021336829,0.00014370274,0.000035648827,0.00003346354,0.00089331827,0.000058242513,0.000009533444],"category_scores_gemma":[0.00021159307,0.00007603076,0.00006347746,0.00010828532,0.0000429596,0.00017993257,0.000027450513,0.00014250363,0.000003847696],"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.000088838344,0.00004686196,0.000101050035,0.0000075602447,0.00018504856,4.881964e-7,0.000621104,0.9949024,0.000094288305,0.0018068274,0.0009993049,0.0011462349],"study_design_scores_gemma":[0.00045519532,0.000095332696,0.00031019526,0.0003041971,0.000012208169,0.000016574237,0.00035287472,0.9970137,0.00040355005,0.00019400149,0.00076046295,0.00008173016],"about_ca_topic_score_codex":0.000037339596,"about_ca_topic_score_gemma":0.0000024898336,"teacher_disagreement_score":0.97942317,"about_ca_system_score_codex":0.0001040196,"about_ca_system_score_gemma":0.000027951006,"threshold_uncertainty_score":0.31004444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014816217,0.0053354697,0.9748632,0.0037243043,0.0003886387,0.0005395215,0.000004596529,0.00003999172,0.0002880988],"genre_scores_gemma":[0.98421705,0.0014472725,0.013639859,0.00036034596,0.00013497908,0.00008972876,0.000022685843,0.000012573752,0.00007547838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780476,0.0005258927,0.0009577626,0.00016886745,0.00034334493,0.00019934186],"domain_scores_gemma":[0.9962093,0.00096793496,0.000866271,0.00046148317,0.0014069777,0.0000880389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002342059,0.00014453591,0.00032543534,0.000270585,0.00013946588,0.00047948377,0.001475248,0.000087964676,0.0000030338088],"category_scores_gemma":[0.00011448073,0.00014057194,0.000075450764,0.0002734854,0.00004449317,0.0011192847,0.0001351886,0.00026156602,0.0000025039108],"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.00046023983,0.00024998665,0.007813804,0.000009354582,0.000243951,0.000009313281,0.0005818522,0.837966,0.00018275355,0.053842004,0.0033471643,0.09529357],"study_design_scores_gemma":[0.0031967063,0.00007015424,0.0016898009,0.00020296773,0.000010586036,0.00007959398,0.00014722596,0.9783935,0.0000043792566,0.0015280516,0.014549668,0.00012739823],"about_ca_topic_score_codex":0.000063741354,"about_ca_topic_score_gemma":0.00004768657,"teacher_disagreement_score":0.9694009,"about_ca_system_score_codex":0.00014520559,"about_ca_system_score_gemma":0.00010414778,"threshold_uncertainty_score":0.57323575},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41893145,0.004758376,0.5726509,0.002540127,0.00015837805,0.00014105403,0.0000015186907,0.000020522992,0.0007976331],"genre_scores_gemma":[0.9811205,0.003063396,0.015571834,0.000042783257,0.00012403526,0.000005743607,0.000006359412,0.000008182227,0.000057117235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721766,0.000647878,0.000947135,0.00012584068,0.0009258519,0.00013563235],"domain_scores_gemma":[0.99558103,0.0007901608,0.0010681368,0.0009958297,0.0014699259,0.00009492338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022939118,0.000103092,0.00038369242,0.00077333086,0.00008860666,0.00023887181,0.0029734315,0.000069709895,0.0000073614447],"category_scores_gemma":[0.00007846557,0.00008475,0.000098671735,0.00089462165,0.00013436389,0.0008815938,0.00050844636,0.00038936676,0.0000013423305],"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.00013854727,0.00012145079,0.024164138,0.0000056762783,0.001595968,0.0000036643237,0.0007680863,0.926944,0.00049276144,0.024072865,0.00021913332,0.021473685],"study_design_scores_gemma":[0.0005724049,0.000055283905,0.017148802,0.00020543045,0.00006497307,0.000038522045,0.00005472319,0.97694993,0.0003045251,0.000012351331,0.0044969763,0.00009607508],"about_ca_topic_score_codex":0.000034347755,"about_ca_topic_score_gemma":0.000018970037,"teacher_disagreement_score":0.5621891,"about_ca_system_score_codex":0.000101870144,"about_ca_system_score_gemma":0.000096367046,"threshold_uncertainty_score":0.5525425},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066857976,0.0014241086,0.9875483,0.0011811923,0.0021701327,0.00019969529,0.0000059408876,0.00010094784,0.0006838804],"genre_scores_gemma":[0.8478829,0.00006631769,0.15174696,0.00009505251,0.000079339254,0.00003408995,0.0000019325194,0.000007981561,0.00008541344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982583,0.00014318172,0.0008092307,0.00015035192,0.00048825482,0.00015068312],"domain_scores_gemma":[0.99696016,0.00022817877,0.000980978,0.0006296028,0.0011342868,0.00006678043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097077317,0.0001265494,0.00023510198,0.00031959018,0.00010983659,0.00021379527,0.003765218,0.0000817463,0.000008579936],"category_scores_gemma":[0.00011392164,0.00010346042,0.00015604145,0.0001218977,0.0000666988,0.00026219623,0.00049734826,0.00023467891,0.000011145866],"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.00013861104,0.001000827,0.0032223235,0.000023688284,0.00090157567,0.00004592613,0.010734789,0.0052899,0.00083979464,0.22444397,0.011645781,0.7417128],"study_design_scores_gemma":[0.0015982944,0.00034042087,0.0004151285,0.00092572917,0.000020025522,0.0002856165,0.0019491636,0.9310003,0.0037657074,0.005915887,0.053456813,0.0003269286],"about_ca_topic_score_codex":0.0000465097,"about_ca_topic_score_gemma":0.0000013462335,"teacher_disagreement_score":0.9257104,"about_ca_system_score_codex":0.00014528735,"about_ca_system_score_gemma":0.000080951744,"threshold_uncertainty_score":0.6996774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009369557,0.0029834625,0.97925663,0.005366768,0.0021825822,0.00024868318,0.0000069705497,0.000046042678,0.0005393033],"genre_scores_gemma":[0.98999614,0.000273825,0.008237157,0.00065287,0.0005003263,0.000017151062,0.0000020286382,0.000012922924,0.0003076064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781305,0.0006000964,0.0008867777,0.0001393716,0.00039254723,0.00016814237],"domain_scores_gemma":[0.9959269,0.00089490437,0.0011215358,0.00047302258,0.0014884435,0.000095202675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019176726,0.00013673208,0.00029182291,0.00022482344,0.00015603895,0.0005233075,0.002262944,0.0000675751,0.000010230217],"category_scores_gemma":[0.00012630524,0.00012456739,0.00017029334,0.00013516092,0.000037729526,0.0008665192,0.00009840352,0.00022907749,0.000017617214],"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.00021855223,0.00030657696,0.00041814745,0.000016544078,0.0010642994,0.000036595196,0.002478152,0.53476036,0.002087492,0.31285897,0.0071872724,0.13856706],"study_design_scores_gemma":[0.0021793076,0.000047122976,0.00011029511,0.00021952286,0.00002379032,0.00016060293,0.00010743814,0.9617778,0.000030267625,0.0015191465,0.03368332,0.00014136817],"about_ca_topic_score_codex":0.000025576725,"about_ca_topic_score_gemma":0.0000033901601,"teacher_disagreement_score":0.9806266,"about_ca_system_score_codex":0.00016067084,"about_ca_system_score_gemma":0.00006932566,"threshold_uncertainty_score":0.5079711},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028757636,0.000512934,0.96665436,0.0024983129,0.0011472765,0.00016044555,0.0000056114463,0.000045407374,0.00021804024],"genre_scores_gemma":[0.92584336,0.00038393834,0.07341193,0.00007944234,0.00014020066,0.000026565987,0.00001551685,0.000010636177,0.00008842787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998662,0.00018491645,0.00055430626,0.000116418145,0.00036604443,0.000116309435],"domain_scores_gemma":[0.99579966,0.00033960634,0.00077599357,0.00053589937,0.0024766636,0.00007216059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010537619,0.00010303335,0.00015478983,0.00019121266,0.00022669647,0.0003768376,0.0022715158,0.000063550586,0.00000655268],"category_scores_gemma":[0.0002398121,0.00008752888,0.00008251137,0.00025790642,0.000054871078,0.0007503308,0.00019718986,0.00043905183,0.0000053711583],"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.000546467,0.00085386436,0.01639605,0.000021015621,0.0011638202,0.000011743872,0.004438944,0.031121632,0.06871171,0.82613796,0.007021217,0.043575592],"study_design_scores_gemma":[0.0019353145,0.00015778243,0.0030024885,0.00030906478,0.000018926788,0.00044790545,0.00021815678,0.8983424,0.001117968,0.00010499822,0.09412861,0.00021640908],"about_ca_topic_score_codex":0.0000101724845,"about_ca_topic_score_gemma":0.0000948933,"teacher_disagreement_score":0.8970857,"about_ca_system_score_codex":0.0000743113,"about_ca_system_score_gemma":0.00012648654,"threshold_uncertainty_score":0.42210793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014524877,0.00013503413,0.9763789,0.0011706733,0.0018656884,0.005211246,0.000008777325,0.000040235474,0.0006645345],"genre_scores_gemma":[0.98307484,0.000024492014,0.0149687175,0.000042691252,0.00041790394,0.0013855101,0.0000024870149,0.000011131399,0.000072243805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975383,0.0002311074,0.0010920496,0.00013891459,0.00086172705,0.00013785093],"domain_scores_gemma":[0.99590784,0.000231271,0.0009865458,0.0006344416,0.0021335627,0.00010631794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015592366,0.00012669076,0.00029348262,0.00030046207,0.00007574698,0.00023839292,0.0029382568,0.000112883245,0.000012202007],"category_scores_gemma":[0.00010236874,0.00010973909,0.0001740795,0.00021932003,0.00006340323,0.0006676666,0.00020727569,0.00046543937,0.000006942018],"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.00022794274,0.0011181701,0.00887531,0.00004122849,0.00053725607,0.000023283968,0.0012235887,0.8624246,0.0040729498,0.11166661,0.0023742586,0.007414792],"study_design_scores_gemma":[0.00076785503,0.00005130847,0.00037426362,0.0003698069,0.000005753292,0.00016746325,0.000030693704,0.9903693,0.00046501626,0.000780148,0.0065069892,0.000111377536],"about_ca_topic_score_codex":0.000093315175,"about_ca_topic_score_gemma":0.000025366335,"teacher_disagreement_score":0.96854997,"about_ca_system_score_codex":0.00005723868,"about_ca_system_score_gemma":0.00019567998,"threshold_uncertainty_score":0.54600614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00346632,0.008269808,0.9805027,0.0033367486,0.0029859242,0.00028141163,0.0000066412076,0.00004746203,0.0011029631],"genre_scores_gemma":[0.9907623,0.00045032756,0.007508319,0.0003023844,0.00066111865,0.00004789796,0.000016003123,0.000014823168,0.00023683111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976369,0.0003962632,0.0010828443,0.00015931886,0.0005118805,0.00021278772],"domain_scores_gemma":[0.99541855,0.00084270444,0.0013421228,0.00071846024,0.0016063378,0.00007181388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011722997,0.00014515962,0.00034184862,0.00019614836,0.000112749636,0.00034719598,0.0035264958,0.00012701025,0.0000061753944],"category_scores_gemma":[0.000040322244,0.00013431451,0.00019276098,0.00016957504,0.00007604927,0.00052082544,0.00018839534,0.00028270337,0.0000064572723],"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.0003022938,0.00037943252,0.0023206805,0.000007556859,0.0005678286,0.000042007177,0.00022768817,0.27276012,0.00060638844,0.6312625,0.025489379,0.06603414],"study_design_scores_gemma":[0.003145372,0.00015103909,0.0031520405,0.00018969786,0.000029561796,0.00064398773,0.00005719987,0.8358051,0.00005799586,0.0039610476,0.15257078,0.00023612178],"about_ca_topic_score_codex":0.000051105624,"about_ca_topic_score_gemma":0.000039723156,"teacher_disagreement_score":0.987296,"about_ca_system_score_codex":0.00019290284,"about_ca_system_score_gemma":0.00009623867,"threshold_uncertainty_score":0.65531653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74311477,0.000447392,0.24806255,0.0029958142,0.0020717534,0.00043349576,0.0000027450203,0.000017811075,0.0028536664],"genre_scores_gemma":[0.9985993,0.000013887316,0.0008055232,0.00010240242,0.00037372054,0.000020109032,0.0000029759915,0.000006876742,0.00007523679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964795,0.00092582934,0.0008851471,0.0001265906,0.0014675284,0.00011537353],"domain_scores_gemma":[0.9955978,0.00016661835,0.0007704057,0.00090198225,0.0025180152,0.000045222147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038496521,0.000101232545,0.0001885766,0.0001447042,0.00013837384,0.0002642898,0.0033215506,0.00005413004,0.0000031936645],"category_scores_gemma":[0.000056103043,0.000058603488,0.00012391817,0.00033885296,0.00005205596,0.00046885145,0.00013461038,0.00022068465,0.000005736017],"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.000015393938,0.00014380612,0.0007127379,0.0000020222458,0.000057766367,1.0811347e-7,0.00058109435,0.96499693,0.00017118236,0.029473193,0.00077231386,0.0030734474],"study_design_scores_gemma":[0.00043530308,0.00004346792,0.020431751,0.00011750292,0.000018606208,0.0001151649,0.00042831918,0.97586703,0.00009733135,0.00006644447,0.002311439,0.000067632966],"about_ca_topic_score_codex":0.00008184608,"about_ca_topic_score_gemma":0.000029697276,"teacher_disagreement_score":0.2554845,"about_ca_system_score_codex":0.0001962753,"about_ca_system_score_gemma":0.00013119387,"threshold_uncertainty_score":0.61723226},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015735926,0.007664678,0.96960497,0.003417207,0.0020679021,0.0012666523,0.00008489307,0.00005988463,0.00009788147],"genre_scores_gemma":[0.9376379,0.0069077583,0.05362563,0.00046131838,0.00046815904,0.0006651241,0.00010055978,0.00003343978,0.000100108715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970658,0.00048115378,0.0012416554,0.00023489453,0.0007258422,0.0002506907],"domain_scores_gemma":[0.9898596,0.002681192,0.0015455458,0.0024882238,0.0032819977,0.00014344507],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0017574925,0.00022985184,0.00033140503,0.00027224777,0.0005181351,0.0008113077,0.009762011,0.00013487188,0.0000080809],"category_scores_gemma":[0.00019628607,0.00017888189,0.00022286855,0.0003539588,0.00018776064,0.0016364129,0.00055468135,0.0004583124,0.0000027259368],"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.00029386766,0.00027956377,0.0006032841,0.000011584994,0.0005953932,0.0000034950247,0.004556204,0.25239518,0.00044400146,0.22963732,0.008982283,0.5021978],"study_design_scores_gemma":[0.0016515951,0.0003287642,0.001036611,0.00015644943,0.00004932245,0.0002887943,0.0030583576,0.59605765,0.00004832874,0.006546484,0.39053297,0.0002446594],"about_ca_topic_score_codex":0.000017243989,"about_ca_topic_score_gemma":0.00006070766,"teacher_disagreement_score":0.921902,"about_ca_system_score_codex":0.00026830068,"about_ca_system_score_gemma":0.00033288705,"threshold_uncertainty_score":0.99559563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16932559,0.09106059,0.708539,0.0073505407,0.0060747005,0.0010046003,0.00005494702,0.0005862799,0.016003756],"genre_scores_gemma":[0.9906457,0.004177094,0.0047714254,0.00005457212,0.00027586566,0.000020522155,0.000007806425,0.000020054678,0.000026937534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833816,0.00010896956,0.000953489,0.00007960436,0.00035730723,0.00016246951],"domain_scores_gemma":[0.9979297,0.0011793993,0.00027274163,0.00033277238,0.00023136787,0.000054054974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485169,0.00013799613,0.00044352715,0.00023214394,0.000022261012,0.00010431009,0.0010168792,0.00015041453,0.000049707873],"category_scores_gemma":[0.0002635585,0.00012260518,0.000107982,0.000113873466,0.000059539223,0.00033477324,0.000055012733,0.00054670684,0.000021741896],"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.0001676966,0.000046848952,0.000806236,0.0000010567686,0.0002943021,0.000028290078,0.000041768933,0.98755026,0.00010329574,0.0026398704,0.0014845504,0.0068358225],"study_design_scores_gemma":[0.0055284686,0.00005640172,0.0013321396,0.00032868845,0.000027084026,0.00006713368,0.0001859982,0.97865385,0.000020331981,0.0013498742,0.012263903,0.00018611875],"about_ca_topic_score_codex":0.000018952636,"about_ca_topic_score_gemma":0.000022742173,"teacher_disagreement_score":0.8213201,"about_ca_system_score_codex":0.00019377007,"about_ca_system_score_gemma":0.000005964592,"threshold_uncertainty_score":0.49996942},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1162524,0.005043962,0.8770631,0.00030154455,0.000930341,0.0002587296,0.0000029869034,0.000019556735,0.0001273805],"genre_scores_gemma":[0.9895196,0.0011084467,0.009084272,0.000022650911,0.00019561124,0.000026697004,0.000009046531,0.0000080271475,0.000025675381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820113,0.00022724475,0.00093445485,0.00013170813,0.00040964264,0.00009580219],"domain_scores_gemma":[0.99625605,0.00045542303,0.0012614387,0.00044836072,0.0015392109,0.000039499057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013590246,0.00010465251,0.00023385916,0.0001855722,0.00007410463,0.0001643881,0.0011186718,0.00009346463,0.0000012558252],"category_scores_gemma":[0.00006305844,0.00009374323,0.000095090276,0.0001646411,0.000067120716,0.00068166613,0.00017418848,0.00018798995,4.7426016e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051966653,0.0005896257,0.0014474405,0.000036040714,0.00024509343,0.000003631773,0.0010159224,0.10989098,0.041878924,0.12591538,0.0011712586,0.71728605],"study_design_scores_gemma":[0.0010953562,0.00023052235,0.0054977397,0.00037304158,0.00001914062,0.00012717373,0.00013169061,0.9740044,0.0042973775,0.0049173585,0.009157631,0.00014855839],"about_ca_topic_score_codex":0.000058692593,"about_ca_topic_score_gemma":0.00007152739,"teacher_disagreement_score":0.8732672,"about_ca_system_score_codex":0.00012853407,"about_ca_system_score_gemma":0.00004181974,"threshold_uncertainty_score":0.3822738},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03476864,0.009789124,0.9525832,0.00048302813,0.00039350416,0.0005511289,0.00010284611,0.00020483663,0.0011236776],"genre_scores_gemma":[0.9796695,0.0048330543,0.014981654,0.000014524089,0.000072753915,0.000037884503,0.0003551831,0.000025388537,0.00001005422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698806,0.0005236482,0.0016152039,0.0001196151,0.0005949596,0.00015850397],"domain_scores_gemma":[0.995858,0.00020740798,0.0011422925,0.0013548108,0.0013541655,0.00008333909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013692925,0.00019528232,0.00042074922,0.00047370503,0.00006108517,0.00010748775,0.0024850778,0.00015806666,0.0000028329814],"category_scores_gemma":[0.0000523418,0.00021175989,0.00008935833,0.00039653905,0.00008380267,0.0010742662,0.00007040978,0.0004810573,0.000003916603],"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.00015876404,0.0008229425,0.0019845392,0.000040172385,0.00022650244,0.000005988204,0.0012930959,0.6525878,0.018071098,0.14900748,0.00048800296,0.1753136],"study_design_scores_gemma":[0.0013584973,0.00017915232,0.011051943,0.00092643156,0.000031009367,0.00013817035,0.0010752456,0.95776784,0.0034528608,0.00341358,0.02021715,0.0003881029],"about_ca_topic_score_codex":0.00018673996,"about_ca_topic_score_gemma":0.000012718824,"teacher_disagreement_score":0.9449009,"about_ca_system_score_codex":0.0005508845,"about_ca_system_score_gemma":0.000053270818,"threshold_uncertainty_score":0.86353177},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001135028,0.0001466088,0.98507863,0.0017385675,0.0005255254,0.010292726,0.000003383418,0.000056233752,0.0010232748],"genre_scores_gemma":[0.9612879,0.000003721854,0.02929971,0.00005425043,0.0005267606,0.008667605,0.000002456699,0.000009328088,0.0001482778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982761,0.00015357893,0.00082223665,0.00012154976,0.00047980217,0.00014669313],"domain_scores_gemma":[0.9969303,0.00048657987,0.00084621744,0.00036362882,0.0013208488,0.00005240254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010472841,0.00010701609,0.00019615606,0.0001469096,0.00012519398,0.0004896317,0.0018858141,0.000048721144,0.0000031828322],"category_scores_gemma":[0.000090077825,0.000092437804,0.000122065365,0.00012420333,0.000031080548,0.00060801144,0.0001191064,0.00014563563,0.0000038722656],"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.00020081468,0.0005881865,0.006678057,0.000011213615,0.00024962486,0.000018398303,0.00036682712,0.16678725,0.0015733262,0.685596,0.0087453155,0.12918498],"study_design_scores_gemma":[0.0021926183,0.00007861638,0.0011843507,0.00045734967,0.000009360648,0.00013566243,0.000066767476,0.91057056,0.0001170774,0.0011113342,0.083938845,0.00013746969],"about_ca_topic_score_codex":0.000052818817,"about_ca_topic_score_gemma":0.000010939713,"teacher_disagreement_score":0.96015286,"about_ca_system_score_codex":0.00011063801,"about_ca_system_score_gemma":0.00010329274,"threshold_uncertainty_score":0.47215298},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011927,0.00393699,0.9815963,0.0003616308,0.0016349788,0.00023383864,0.00001312413,0.00010137266,0.00019475626],"genre_scores_gemma":[0.77245224,0.0012702196,0.22538048,0.000036818794,0.00071412505,0.000017459837,0.000053721727,0.000040682728,0.0000342611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985758,0.00004002328,0.0007495357,0.00008793879,0.00039925316,0.00014744414],"domain_scores_gemma":[0.9981733,0.00017057273,0.00046636525,0.00026270153,0.0008231994,0.00010387306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003118668,0.00014914921,0.00024561046,0.00021513429,0.000060524562,0.00014233429,0.0009347277,0.00009382527,0.0000051840443],"category_scores_gemma":[0.000023448129,0.00015363433,0.0001031097,0.00013475964,0.000022248407,0.0007041159,0.000053301348,0.00021922484,0.0000076055],"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.000016154765,0.000023044699,0.00004655588,0.000012817125,0.00015844547,0.0000020900152,0.0007367327,0.95431924,0.00042981643,0.0007400188,0.00008093979,0.043434147],"study_design_scores_gemma":[0.0017384511,0.000026803946,0.00005865798,0.00073921756,0.000020421674,0.000065711094,0.00055357796,0.9876612,0.0009305987,0.00057192234,0.00747024,0.00016318662],"about_ca_topic_score_codex":0.000052412448,"about_ca_topic_score_gemma":0.000017388118,"teacher_disagreement_score":0.7605252,"about_ca_system_score_codex":0.0003345092,"about_ca_system_score_gemma":0.00008030467,"threshold_uncertainty_score":0.62650263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055786194,0.00220336,0.9878069,0.0023609176,0.0012105893,0.00029542184,0.00000687684,0.00008332753,0.00045395063],"genre_scores_gemma":[0.7974875,0.00011341075,0.20164299,0.00042330046,0.0002588394,0.000020691457,0.00002672861,0.000011987873,0.000014543402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976082,0.00029603616,0.001078717,0.00016248935,0.000654247,0.00020032539],"domain_scores_gemma":[0.9935975,0.0018136965,0.0012836425,0.0011447055,0.0019997195,0.00016072625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003505746,0.00015081973,0.00026247054,0.00031317657,0.00018496858,0.00037772654,0.004257467,0.0001358214,0.000007718781],"category_scores_gemma":[0.0002098462,0.00014344907,0.00016608655,0.00021677864,0.00010007183,0.0008402422,0.000092597875,0.0003475511,0.0000056157687],"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.00018424823,0.00024606378,0.0002507147,0.0000028543643,0.000120878794,0.0000062200797,0.00033130546,0.0067367614,0.00021080328,0.86561406,0.00027591613,0.12602016],"study_design_scores_gemma":[0.0035053047,0.00048158472,0.0022773212,0.00063410716,0.000047353828,0.0002859023,0.0006801633,0.9121285,0.00013792937,0.036267027,0.043157812,0.00039700506],"about_ca_topic_score_codex":0.000016088876,"about_ca_topic_score_gemma":0.000018750561,"teacher_disagreement_score":0.90539175,"about_ca_system_score_codex":0.00015475429,"about_ca_system_score_gemma":0.00014977367,"threshold_uncertainty_score":0.79115045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065062635,0.0027129184,0.92488366,0.0012576521,0.0028937636,0.00021165154,0.000002322995,0.000067509885,0.002907912],"genre_scores_gemma":[0.9959022,0.00018590577,0.0036746853,0.00006405227,0.00010860436,0.000011922033,0.0000017851569,0.000006481529,0.000044394685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997586,0.00061138574,0.0010130623,0.00011574302,0.0005347452,0.00013906175],"domain_scores_gemma":[0.9976531,0.0002874538,0.00081620767,0.0004470357,0.0007188273,0.00007735942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019986448,0.00010648958,0.00029319947,0.00023618959,0.000053613534,0.00026467277,0.0017251999,0.000063546584,0.0000026432915],"category_scores_gemma":[0.00012540663,0.00009800489,0.00010327526,0.0002017726,0.000028753971,0.0004963532,0.00006532,0.0002547257,0.000014349555],"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.00006562321,0.0002124338,0.005032126,0.00001636909,0.00020769288,0.00008515243,0.001000222,0.107648,0.00002432804,0.80778325,0.00049115974,0.07743367],"study_design_scores_gemma":[0.0027534554,0.00007460691,0.0037085144,0.0010011422,0.00001934004,0.00099616,0.0011875,0.9365033,0.000011657989,0.00034399543,0.053101424,0.00029891552],"about_ca_topic_score_codex":0.000011089611,"about_ca_topic_score_gemma":0.000004750974,"teacher_disagreement_score":0.93083954,"about_ca_system_score_codex":0.0002636617,"about_ca_system_score_gemma":0.00015240106,"threshold_uncertainty_score":0.39965236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012396944,0.003172715,0.9824881,0.0007655506,0.00049871363,0.0004534264,0.000004845768,0.00014094771,0.00007875051],"genre_scores_gemma":[0.9391904,0.0001636846,0.06017932,0.0000484892,0.0003087568,0.00003472645,0.000034112938,0.000021851683,0.000018646077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805677,0.00019334174,0.0009361923,0.00019659846,0.00043711727,0.00017995255],"domain_scores_gemma":[0.9957903,0.0002906562,0.0013042487,0.00048961485,0.0020838305,0.000041331863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008665215,0.0001671004,0.00025263565,0.0004724337,0.00020821854,0.0005330016,0.0014822017,0.0001518348,0.0000033012952],"category_scores_gemma":[0.00008636529,0.00016907834,0.00006584958,0.00050785125,0.000046262136,0.0012285673,0.0003003396,0.00020143823,0.0000010739158],"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.000045576122,0.0001114685,0.0048052664,0.000054974644,0.00018057742,0.000006424685,0.0003624551,0.8750372,0.0040851096,0.096418664,0.00042595313,0.018466365],"study_design_scores_gemma":[0.00055887864,0.000042431177,0.0005361628,0.00051537674,0.000017138975,0.00023326522,0.00012189872,0.98997515,0.00064015185,0.004547795,0.0026327036,0.00017901656],"about_ca_topic_score_codex":0.000113696864,"about_ca_topic_score_gemma":0.000014506639,"teacher_disagreement_score":0.92679346,"about_ca_system_score_codex":0.00030471967,"about_ca_system_score_gemma":0.00010062802,"threshold_uncertainty_score":0.68948144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031209739,0.0013196289,0.9621268,0.0022431638,0.0018484119,0.00015792252,7.766427e-7,0.000042851065,0.0010507286],"genre_scores_gemma":[0.9899119,0.000134071,0.009437274,0.00026769246,0.00020553109,0.000011143936,0.0000051759193,0.000010748544,0.000016444352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775827,0.00032425486,0.0010389121,0.00014106635,0.00056267634,0.00017484472],"domain_scores_gemma":[0.99726695,0.00032087724,0.0009256503,0.00066550856,0.00074256054,0.000078466466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013685942,0.00012252756,0.00023696477,0.00033616627,0.00004772738,0.0003572257,0.0035703634,0.000082269,0.0000063966872],"category_scores_gemma":[0.00012492448,0.00011787879,0.000109361856,0.00036958145,0.00003615155,0.00075583445,0.00030155148,0.00044214856,0.000012352428],"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.000027262633,0.00012331322,0.0020589188,0.0000014472427,0.000058789097,0.00004970615,0.00051546044,0.87286955,0.000057626934,0.11882977,0.0001264535,0.0052817035],"study_design_scores_gemma":[0.0023864051,0.00007798276,0.005843429,0.0012212351,0.0000064407427,0.00023251826,0.0001832636,0.98413205,0.00011172956,0.0017088222,0.0038935156,0.00020258204],"about_ca_topic_score_codex":0.0001474218,"about_ca_topic_score_gemma":0.00005117305,"teacher_disagreement_score":0.9587022,"about_ca_system_score_codex":0.00048363718,"about_ca_system_score_gemma":0.00015553126,"threshold_uncertainty_score":0.66346824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09791424,0.14998563,0.74016356,0.00028368362,0.0059308335,0.0009559495,0.00016857318,0.00018681897,0.004410718],"genre_scores_gemma":[0.98565954,0.0028720265,0.011166997,0.0000059256017,0.00006990811,0.000035843248,0.00002352678,0.000031603817,0.0001346075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982759,0.00019361296,0.001034882,0.00006377822,0.00031436,0.00011749598],"domain_scores_gemma":[0.9968895,0.00058421295,0.00060255686,0.00058744353,0.0012747593,0.00006153229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009603023,0.00012960413,0.00033057504,0.00028300413,0.000060287744,0.00008081805,0.0011713294,0.000078088924,0.000008474744],"category_scores_gemma":[0.0002906467,0.00012481249,0.0001498493,0.00012237388,0.00004101894,0.00026342293,0.000045433626,0.00018066303,0.0000040776704],"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.0001677201,0.0007299171,0.0075051384,0.0003274329,0.002733352,0.000007041707,0.0028133476,0.80986005,0.007883571,0.14705077,0.012844671,0.008076994],"study_design_scores_gemma":[0.006166588,0.00017421215,0.0014195457,0.0028819367,0.00018486664,0.0005416306,0.0028642802,0.583177,0.0054330695,0.0007302275,0.39565057,0.00077610667],"about_ca_topic_score_codex":0.000036271307,"about_ca_topic_score_gemma":0.000004409858,"teacher_disagreement_score":0.8877453,"about_ca_system_score_codex":0.00014384554,"about_ca_system_score_gemma":0.00007177688,"threshold_uncertainty_score":0.50897056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14154947,0.003407358,0.8475499,0.0052070897,0.0006539399,0.00054983544,0.000010134152,0.00010341097,0.0009688385],"genre_scores_gemma":[0.99080527,0.000699832,0.0082708085,0.000036932666,0.00009613084,0.00005116327,0.0000030148399,0.000021412254,0.000015462912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983887,0.00013734846,0.0008258042,0.00006163889,0.00046713054,0.00011937937],"domain_scores_gemma":[0.99553144,0.0027233278,0.00039144245,0.000490008,0.0008263663,0.000037413032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012480706,0.00011856982,0.0002446397,0.00020780081,0.00006227448,0.00008310493,0.0019718732,0.00009041784,0.000007782266],"category_scores_gemma":[0.00032809947,0.00008594859,0.00011058818,0.00011980201,0.000113331604,0.000106798434,0.00009358994,0.00031575328,0.000007650432],"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.00005994933,0.00009021839,0.0000064231044,0.000006551553,0.00015504131,2.8444623e-7,0.00021827943,0.8520138,0.0034881365,0.13744216,0.00036191824,0.006157217],"study_design_scores_gemma":[0.00065121654,0.00010726562,0.000025230574,0.00046550727,0.00001604337,0.000019080282,0.0004233413,0.95093286,0.042461965,0.001031431,0.0037411267,0.000124913],"about_ca_topic_score_codex":0.0000014132185,"about_ca_topic_score_gemma":4.1239713e-7,"teacher_disagreement_score":0.8492558,"about_ca_system_score_codex":0.00015352533,"about_ca_system_score_gemma":0.00003236823,"threshold_uncertainty_score":0.36642638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42447126,0.0010559112,0.5647963,0.003809412,0.0023441184,0.0003335155,0.0000026346706,0.000019002882,0.003167815],"genre_scores_gemma":[0.9993447,0.00008815105,0.00037483402,0.00007811692,0.00009249795,0.00001097013,6.17051e-7,0.0000039277043,0.000006155574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796027,0.00084124785,0.000537684,0.00007680741,0.00050849037,0.00007550174],"domain_scores_gemma":[0.9962749,0.0020199006,0.0006656168,0.00035530564,0.0006588714,0.000025426736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00277982,0.00007303599,0.00017210445,0.00016107794,0.00003649768,0.00008657108,0.0020892923,0.000030222764,0.0000016127552],"category_scores_gemma":[0.00027200766,0.000050693598,0.00007625935,0.00016966059,0.0000417292,0.000277847,0.000108251676,0.00023186422,0.000005255805],"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.00007699595,0.00009181496,0.0004494861,0.0000018049462,0.000068427544,0.000007789136,0.00053803687,0.18855996,0.00013716343,0.8047783,0.0000156816,0.0052745547],"study_design_scores_gemma":[0.02285675,0.0014936514,0.06271468,0.019343952,0.000058849815,0.00079614314,0.0027503464,0.6293054,0.009509683,0.24611263,0.0040236576,0.0010342362],"about_ca_topic_score_codex":0.00007500614,"about_ca_topic_score_gemma":0.0000060550788,"teacher_disagreement_score":0.57487345,"about_ca_system_score_codex":0.00016613305,"about_ca_system_score_gemma":0.00010141746,"threshold_uncertainty_score":0.38824597},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073005386,0.017214173,0.88419855,0.00635623,0.009091821,0.00027362772,0.000004202912,0.00012460824,0.00973141],"genre_scores_gemma":[0.99499744,0.0011884194,0.002350793,0.00042934282,0.000706088,0.000007329706,0.0000033448055,0.000009849135,0.00030740906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99762607,0.0005537179,0.0008654482,0.00013199348,0.0006884758,0.0001343189],"domain_scores_gemma":[0.99697644,0.00016892896,0.00079621235,0.0007848228,0.0011660005,0.00010760965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012730667,0.00011947552,0.00023433361,0.00029673535,0.00008869115,0.00056920527,0.0033901786,0.00006581535,0.000024119434],"category_scores_gemma":[0.000047702782,0.00009730521,0.00014637414,0.00019293184,0.000028244076,0.0008018225,0.0001894149,0.000258291,0.00003045773],"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.00019792168,0.0006310863,0.006793023,0.00001683653,0.00085042923,0.00020143102,0.008528137,0.09356143,0.00045297714,0.7557945,0.010050729,0.122921474],"study_design_scores_gemma":[0.0014236812,0.0003185713,0.005310903,0.0009169529,0.0000168797,0.006340239,0.0006716317,0.21898787,0.00007931488,0.005993942,0.75954497,0.0003950152],"about_ca_topic_score_codex":0.00011183514,"about_ca_topic_score_gemma":0.000029887766,"teacher_disagreement_score":0.92199206,"about_ca_system_score_codex":0.000118477816,"about_ca_system_score_gemma":0.00006625522,"threshold_uncertainty_score":0.62998515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022941798,0.0050709713,0.95961976,0.004306028,0.0018535719,0.0002496798,0.000002536261,0.00004769255,0.0059079463],"genre_scores_gemma":[0.9914228,0.00017892492,0.007903017,0.00020492604,0.0001100586,0.000017466096,0.0000029271264,0.0000069504904,0.00015294552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979271,0.00054527086,0.0007091693,0.000118853284,0.0005795194,0.00012006126],"domain_scores_gemma":[0.9978762,0.00031933712,0.00062450283,0.00043572416,0.0006760554,0.00006817529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010709763,0.000103478356,0.0001982661,0.00034720474,0.00004557913,0.00024002072,0.0017473568,0.000059031936,0.000014425644],"category_scores_gemma":[0.00015994342,0.000095009884,0.000086996966,0.00024239876,0.000020112788,0.00060583296,0.00006428548,0.0002933328,0.000014845553],"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.00010487491,0.00027220318,0.0013351733,0.000005667086,0.00021264052,0.000060901697,0.0069336444,0.45067665,0.00042765337,0.32473376,0.0013412741,0.21389554],"study_design_scores_gemma":[0.010749633,0.00031128115,0.008069294,0.001696011,0.00003804666,0.0020493304,0.0045226607,0.7520828,0.00040201322,0.013463206,0.20571546,0.00090024795],"about_ca_topic_score_codex":0.000027526083,"about_ca_topic_score_gemma":0.000026861255,"teacher_disagreement_score":0.968481,"about_ca_system_score_codex":0.00012515177,"about_ca_system_score_gemma":0.00016072612,"threshold_uncertainty_score":0.38743904},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79792875,0.0008497377,0.19891876,0.00022176535,0.0005746302,0.00018328863,0.0000012110495,0.000023921672,0.0012979287],"genre_scores_gemma":[0.9962032,0.000047462865,0.003536001,0.00010673029,0.00006385141,0.000015807065,0.0000014072835,0.0000057478683,0.000019799743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869794,0.00035332126,0.00041603838,0.00013105024,0.00031214138,0.000089483445],"domain_scores_gemma":[0.9987885,0.0001079414,0.00026625858,0.0003559977,0.00040097802,0.000080347105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010159643,0.00008522959,0.00016942727,0.0003629933,0.000041553383,0.00023912961,0.0016842231,0.000039221235,5.973458e-7],"category_scores_gemma":[0.000039142746,0.00007703814,0.00004554515,0.00013673703,0.000023178533,0.0010650678,0.00020014386,0.00019092603,0.000003628603],"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.000874941,0.0032604893,0.043313265,0.00006492223,0.00096038956,0.00013218763,0.19372149,0.074576095,0.003652416,0.34775114,0.00079092185,0.33090174],"study_design_scores_gemma":[0.004437123,0.00074751413,0.2205272,0.0020046835,0.000034733275,0.001606412,0.00876964,0.756002,0.00031073135,0.001107066,0.0036072368,0.00084561924],"about_ca_topic_score_codex":0.00020945219,"about_ca_topic_score_gemma":0.000016411608,"teacher_disagreement_score":0.6814259,"about_ca_system_score_codex":0.00010323734,"about_ca_system_score_gemma":0.00002698231,"threshold_uncertainty_score":0.3141524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038813148,0.0007843421,0.9582836,0.0009133449,0.00080494484,0.00031760347,0.000013791097,0.000012848851,0.00005636545],"genre_scores_gemma":[0.94261533,0.00002512301,0.057097428,0.000020477853,0.0001865689,0.000006841084,0.000018641078,0.000006929993,0.000022660979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981739,0.0002607648,0.0009063898,0.00013923406,0.00041636967,0.000103335864],"domain_scores_gemma":[0.9965494,0.0006413209,0.0011052879,0.00052087294,0.0011495681,0.0000335018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019819213,0.00008746998,0.00021014514,0.00021244168,0.000080332284,0.00022456123,0.0016561062,0.000040138173,0.0000023289344],"category_scores_gemma":[0.000058815018,0.00007442767,0.000044513414,0.00011716826,0.000029129518,0.00031870007,0.00026288806,0.000100569385,6.700221e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013365442,0.00019274327,0.0010597121,0.000042627176,0.00030249814,0.0000040225536,0.0016212004,0.87665987,0.008468146,0.08697781,0.0033732762,0.021164425],"study_design_scores_gemma":[0.0013361719,0.000099465535,0.0007167969,0.00025651418,0.000016107466,0.00018615412,0.00043907072,0.9911448,0.0011983451,0.00077778444,0.0037310373,0.00009778729],"about_ca_topic_score_codex":0.0004743829,"about_ca_topic_score_gemma":0.00002252651,"teacher_disagreement_score":0.90380216,"about_ca_system_score_codex":0.00006022487,"about_ca_system_score_gemma":0.00006889551,"threshold_uncertainty_score":0.3077485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05743766,0.011084202,0.9210956,0.0027843467,0.0044128275,0.00020438062,0.000002079141,0.00006505236,0.0029138357],"genre_scores_gemma":[0.9852858,0.0049661584,0.0089341095,0.0003037535,0.0004258017,0.000017422662,0.000004934259,0.000017821181,0.000044203105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970422,0.00034608867,0.0012942505,0.0002018775,0.0008631664,0.00025244028],"domain_scores_gemma":[0.9966611,0.00027927104,0.0013513961,0.00085524505,0.00077033666,0.00008263226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447602,0.00017625665,0.0003332812,0.00021191887,0.00008022911,0.0004508565,0.0045427466,0.00010856559,0.000003920276],"category_scores_gemma":[0.000059175716,0.00016739967,0.00013767222,0.00035271194,0.000056324872,0.0015394416,0.00052896986,0.00062003295,0.000018607452],"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.00006325275,0.00028357873,0.0025831596,0.0000042947477,0.00019065481,0.0001882101,0.0034189408,0.69583,0.00024132896,0.26223782,0.0003667969,0.034591995],"study_design_scores_gemma":[0.010686201,0.00042805178,0.005897217,0.0060450668,0.000037171732,0.0032583294,0.0012403101,0.8745635,0.0007013368,0.021929644,0.0739698,0.0012433502],"about_ca_topic_score_codex":0.00012785778,"about_ca_topic_score_gemma":0.000056484725,"teacher_disagreement_score":0.92784816,"about_ca_system_score_codex":0.0004912276,"about_ca_system_score_gemma":0.00015701186,"threshold_uncertainty_score":0.8441629},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3689643,0.016500412,0.61132264,0.00068614254,0.0015406702,0.00022522597,0.0000025501154,0.000054213262,0.00070382305],"genre_scores_gemma":[0.99485743,0.0019499818,0.0027420162,0.000059834023,0.00023323232,0.000015319942,0.000018461351,0.000014081769,0.00010963009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975906,0.00027530245,0.0011147609,0.00016550095,0.00065687235,0.00019698899],"domain_scores_gemma":[0.9973489,0.00022048205,0.0012060415,0.00055034057,0.0006203066,0.00005394268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011757291,0.00014606377,0.00024255695,0.00026850274,0.000078477715,0.00040039213,0.0025509237,0.00010394238,0.000003808766],"category_scores_gemma":[0.000017386948,0.00014443226,0.00008184653,0.00033000318,0.000042958505,0.0014257472,0.00020513937,0.0004345068,0.000007846829],"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.00006412136,0.00023452689,0.0037241664,0.000006758414,0.000048422044,0.000011997046,0.0003606384,0.7526626,0.0010741499,0.0042365994,0.0035401278,0.2340359],"study_design_scores_gemma":[0.0007540461,0.000058341644,0.0020932748,0.00025095834,0.0000039312313,0.0001293177,0.000043136068,0.9842889,0.00006970968,0.00003671869,0.012128358,0.00014336129],"about_ca_topic_score_codex":0.000060437764,"about_ca_topic_score_gemma":0.000031819258,"teacher_disagreement_score":0.6258931,"about_ca_system_score_codex":0.0003059247,"about_ca_system_score_gemma":0.00008054366,"threshold_uncertainty_score":0.58897763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029472822,0.0012472426,0.96479225,0.003254532,0.00040389193,0.00015779058,0.000006428839,0.000052898577,0.0006121379],"genre_scores_gemma":[0.9710533,0.00022894853,0.028222222,0.00030609025,0.00012856629,0.000011521476,0.000009313732,0.000007081765,0.000032928645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981317,0.00014672661,0.0008112291,0.00011728759,0.00063104305,0.00016202159],"domain_scores_gemma":[0.9970831,0.0002209785,0.0011514038,0.0003441385,0.0010967257,0.0001036348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009284555,0.00014563637,0.00022608512,0.00016973862,0.00015827379,0.00064885593,0.0013003717,0.000062703315,0.0000020414877],"category_scores_gemma":[0.00006595751,0.0001250572,0.0000543534,0.00019425048,0.000058118727,0.0022842025,0.00013984572,0.00030089138,0.000009775186],"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.000105343795,0.00014207262,0.0010779148,0.000009971162,0.00047759814,0.000029336512,0.005305814,0.05644685,0.00024683334,0.18001588,0.00045422933,0.7556882],"study_design_scores_gemma":[0.007753461,0.00032757813,0.0005571506,0.0017891836,0.00004632009,0.0029101244,0.003118795,0.9672084,0.00018014833,0.0009300204,0.01461527,0.00056354486],"about_ca_topic_score_codex":0.000075872624,"about_ca_topic_score_gemma":0.000007590803,"teacher_disagreement_score":0.94158053,"about_ca_system_score_codex":0.00015941216,"about_ca_system_score_gemma":0.0001595147,"threshold_uncertainty_score":0.62569326},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007201496,0.0006568524,0.9643902,0.024859771,0.0015088392,0.0002292344,0.000016329157,0.000033470857,0.0011037698],"genre_scores_gemma":[0.867398,0.000082708975,0.1297956,0.0019065964,0.00065512286,0.000026317783,0.000011453224,0.000011405885,0.000112763715],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977108,0.00023322621,0.001022551,0.00017777506,0.0006883461,0.00016726334],"domain_scores_gemma":[0.99693364,0.0003886452,0.00081099186,0.00069217396,0.0010629592,0.000111618036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011744424,0.00013329905,0.00024046525,0.0003019996,0.000094441275,0.00063041144,0.0034732095,0.000037912392,0.000010454248],"category_scores_gemma":[0.00014663709,0.00012772702,0.00012830898,0.000119277094,0.00002106137,0.0013733282,0.0004626236,0.00017327041,0.000036587804],"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.00063384726,0.0017308377,0.00363041,0.000065192165,0.0030406571,0.000063729414,0.024916645,0.06225531,0.035178464,0.13741101,0.12101496,0.6100589],"study_design_scores_gemma":[0.0038475755,0.00028517775,0.0017453589,0.002214617,0.00006826304,0.0001275809,0.00254474,0.2989283,0.016108193,0.0067355963,0.66671693,0.0006776977],"about_ca_topic_score_codex":0.00019262299,"about_ca_topic_score_gemma":0.000028761078,"teacher_disagreement_score":0.86019653,"about_ca_system_score_codex":0.00039121887,"about_ca_system_score_gemma":0.00009266342,"threshold_uncertainty_score":0.64541453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034064634,0.0033766646,0.9902188,0.0005077408,0.0019210898,0.0003308985,0.000012368015,0.000062902975,0.00016308147],"genre_scores_gemma":[0.9848553,0.004649568,0.009415799,0.00009414565,0.00071854284,0.00006817426,0.000036797064,0.00004500118,0.00011668109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847716,0.00006486099,0.0007880751,0.000085113956,0.00044641792,0.00013837394],"domain_scores_gemma":[0.9971493,0.0005400606,0.0005653578,0.0003249647,0.0013745022,0.00004581679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004373273,0.00014758584,0.00019084266,0.00012747299,0.0001219559,0.00014425557,0.00074157614,0.0001021369,0.000019069841],"category_scores_gemma":[0.000070771246,0.00012304746,0.00011579967,0.00016504244,0.000027563869,0.00054192694,0.00003825436,0.00023303456,0.000004724891],"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.000024896104,0.000031059408,0.000030063966,0.000003665062,0.000181583,4.218814e-7,0.00035254538,0.97447354,0.00041084242,0.012940143,0.0011368268,0.010414442],"study_design_scores_gemma":[0.00086083496,0.000022450013,0.00008102424,0.00014367515,0.000036154426,0.000047554422,0.00025591863,0.99027264,0.0000965822,0.0001432063,0.007920406,0.00011956055],"about_ca_topic_score_codex":0.000016979262,"about_ca_topic_score_gemma":0.00001959425,"teacher_disagreement_score":0.9814488,"about_ca_system_score_codex":0.00022703409,"about_ca_system_score_gemma":0.000012037443,"threshold_uncertainty_score":0.501773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.849906,0.009951671,0.11959649,0.011244308,0.0062347827,0.0005116771,0.000009761219,0.00011523922,0.0024300178],"genre_scores_gemma":[0.9955189,0.0003466366,0.0038590862,0.00004711187,0.00014516577,0.000037100686,0.0000018132879,0.000009063323,0.00003509157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724317,0.0003664715,0.0010487651,0.0001275128,0.0010291858,0.00018487012],"domain_scores_gemma":[0.99599105,0.0005583101,0.0009954135,0.0010284734,0.0013452113,0.00008156501],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0029427402,0.00012000603,0.00029219623,0.00050247763,0.000048423644,0.00027902256,0.0059320936,0.00004947491,5.7882914e-7],"category_scores_gemma":[0.00063952303,0.00009095396,0.00007597403,0.00047911785,0.000045210636,0.0012786599,0.0009539571,0.00036554015,0.000010215965],"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.00021927286,0.0007048956,0.039578967,0.000058975525,0.00066978077,0.00011973229,0.06677283,0.5910377,0.0018896188,0.26820615,0.011390945,0.01935111],"study_design_scores_gemma":[0.008883349,0.0007582272,0.08025744,0.010871495,0.000075065385,0.0029509098,0.08807252,0.49138525,0.006435115,0.011447253,0.29706994,0.0017934268],"about_ca_topic_score_codex":0.00028034783,"about_ca_topic_score_gemma":0.00006199549,"teacher_disagreement_score":0.28567898,"about_ca_system_score_codex":0.00029018975,"about_ca_system_score_gemma":0.00013310509,"threshold_uncertainty_score":0.9994463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004313637,0.00009579079,0.9875558,0.00033752125,0.0009995489,0.006107678,0.0000032319451,0.00008379918,0.0005029923],"genre_scores_gemma":[0.9674244,0.0000070136566,0.025371138,0.00007560615,0.0008602189,0.0061357263,0.000014825294,0.000026123185,0.000084980624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699193,0.00045614108,0.0012276846,0.00023587726,0.0008180731,0.00027029894],"domain_scores_gemma":[0.99480945,0.00048691174,0.0016635394,0.0008588015,0.0020779984,0.00010329827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012992509,0.0001961789,0.00029644702,0.00027481155,0.00019222972,0.00061344577,0.0033486313,0.000120499084,0.0000017581515],"category_scores_gemma":[0.00003615443,0.00017560949,0.00017395067,0.00023991092,0.000058930957,0.00048154796,0.0001921751,0.00022787385,0.00000141416],"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.000054285578,0.00028396636,0.0003117936,0.0000021922294,0.000037683145,0.0000067100596,0.00009786388,0.9044658,0.00034329641,0.09087163,0.00036698868,0.0031577805],"study_design_scores_gemma":[0.0013617794,0.00008581766,0.00024742217,0.00026587318,0.000005576622,0.000112388734,0.000075058124,0.9820167,0.0004340694,0.000077373006,0.015138804,0.00017915209],"about_ca_topic_score_codex":0.0001815579,"about_ca_topic_score_gemma":0.000018843382,"teacher_disagreement_score":0.96311074,"about_ca_system_score_codex":0.00022168654,"about_ca_system_score_gemma":0.0000928827,"threshold_uncertainty_score":0.7161147},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07446097,0.009218347,0.89167917,0.012090454,0.0034762155,0.0019108669,0.000021598784,0.000096807096,0.0070455964],"genre_scores_gemma":[0.9963188,0.00016300523,0.0025339664,0.00018527715,0.0005915031,0.000042076113,0.0000027759029,0.000006879839,0.00015569064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982981,0.0003001772,0.0006138631,0.00010408981,0.00057608925,0.000107681175],"domain_scores_gemma":[0.99784005,0.00029879046,0.00074279186,0.00038877578,0.00065113837,0.00007845009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008889364,0.000100765625,0.0001983113,0.00014350019,0.000087351866,0.0004555119,0.0015723528,0.00006613341,0.000007625523],"category_scores_gemma":[0.000034944467,0.000083267594,0.00006743137,0.00009715526,0.0000413952,0.00066936243,0.00018613262,0.00022040035,0.000007710475],"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.0004196656,0.00074282364,0.08539497,0.00005695634,0.0006508614,0.000101828366,0.0013030729,0.028416153,0.0071315076,0.77187294,0.07296902,0.03094021],"study_design_scores_gemma":[0.004313904,0.00018913952,0.061372604,0.0011067167,0.000023255952,0.0008770066,0.000053997373,0.2644605,0.00026349735,0.009798842,0.657157,0.000383569],"about_ca_topic_score_codex":0.0002742007,"about_ca_topic_score_gemma":0.000016918002,"teacher_disagreement_score":0.92185783,"about_ca_system_score_codex":0.00007292313,"about_ca_system_score_gemma":0.000056991226,"threshold_uncertainty_score":0.43925118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041482686,0.0012051933,0.97672343,0.0022317362,0.00023616591,0.015157697,0.0000094574225,0.000019651045,0.00026838682],"genre_scores_gemma":[0.9766201,0.00017826991,0.018921157,0.00002714092,0.00007538142,0.004120101,0.000015425241,0.000010863102,0.000031604537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726164,0.00061818893,0.0011424884,0.00017815182,0.0006571205,0.00014241919],"domain_scores_gemma":[0.99471664,0.0010694588,0.0010757528,0.001637739,0.0014344574,0.000065938904],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0025102852,0.00011113151,0.00025834126,0.00040480262,0.00006325325,0.00023019382,0.0056038094,0.000078965844,0.0000039422516],"category_scores_gemma":[0.0003968804,0.000099074154,0.0000496146,0.0003369944,0.000087848886,0.0006308622,0.0010076418,0.0003269475,0.000001810348],"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.00053518976,0.0025420852,0.004026339,0.00010989415,0.0004274183,0.000015184944,0.0066028195,0.7693309,0.006084513,0.06794339,0.0051635946,0.13721865],"study_design_scores_gemma":[0.0015880227,0.000057575802,0.0007611487,0.0005117219,0.0000034116524,0.000025579728,0.0001061072,0.98880076,0.00017724396,0.00008143709,0.0078060655,0.00008091077],"about_ca_topic_score_codex":0.00007259024,"about_ca_topic_score_gemma":0.000029071867,"teacher_disagreement_score":0.9724718,"about_ca_system_score_codex":0.000115277915,"about_ca_system_score_gemma":0.00005049214,"threshold_uncertainty_score":0.99977636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9391373,0.010931854,0.044184674,0.00029966416,0.00087405805,0.00024685668,0.000019286163,0.00022410217,0.0040822066],"genre_scores_gemma":[0.99144244,0.003726337,0.004689344,0.000018416236,0.000049843864,0.000011356648,0.000021369517,0.000027453721,0.000013462839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979809,0.000099010635,0.001212564,0.000063087464,0.0005337334,0.00011070864],"domain_scores_gemma":[0.99733084,0.00018736663,0.00086713163,0.0005810069,0.0009774547,0.00005618397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042837465,0.00014197914,0.00037971616,0.0003017888,0.00004802078,0.000050738796,0.0016793066,0.0000872111,0.0000113679225],"category_scores_gemma":[0.00006373452,0.00013862466,0.0000925809,0.00018301693,0.00011187276,0.00051019,0.00010712459,0.00036712375,0.0000076069173],"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.00007278889,0.00021554729,0.0072099306,0.000050852697,0.00041553137,0.0000021202093,0.001519274,0.9442794,0.02397527,0.010068565,0.0004012933,0.011789449],"study_design_scores_gemma":[0.0061663785,0.00057136343,0.019206617,0.005878573,0.00013444225,0.00040210958,0.002688714,0.27798626,0.64675003,0.0034346927,0.035640612,0.0011402109],"about_ca_topic_score_codex":0.000034677018,"about_ca_topic_score_gemma":0.000005952495,"teacher_disagreement_score":0.6662931,"about_ca_system_score_codex":0.00034954466,"about_ca_system_score_gemma":0.00005178722,"threshold_uncertainty_score":0.565295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06265671,0.00008016858,0.9357303,0.0004294666,0.00018641465,0.000512506,0.000003285774,0.0000134768525,0.0003877163],"genre_scores_gemma":[0.99347305,0.000053595682,0.006236741,0.00007956221,0.000047054204,0.00006406851,0.0000340549,0.0000062622953,0.000005584796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975542,0.0007260905,0.0009146744,0.0001337874,0.00057431543,0.00009692531],"domain_scores_gemma":[0.9961849,0.00035003317,0.0015697279,0.0005525039,0.0012979556,0.000044872133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013791097,0.00011052962,0.0003603816,0.0006483737,0.00004732288,0.000371976,0.002062718,0.00006618135,0.000010100969],"category_scores_gemma":[0.000059287955,0.00008932026,0.00009904421,0.00096770684,0.000039419887,0.0010311414,0.000119391596,0.00018792044,7.2444493e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000748864,0.00013509333,0.029504238,0.000008908929,0.0002654441,0.0000012038275,0.0001770257,0.96379995,0.000047538666,0.00532477,0.000012868997,0.0006480593],"study_design_scores_gemma":[0.00081983465,0.00007318282,0.046178717,0.00045000899,0.000044729408,0.000003277811,0.000014760964,0.9518599,0.00019492113,0.00013217921,0.00014084594,0.00008765298],"about_ca_topic_score_codex":0.00019621277,"about_ca_topic_score_gemma":0.000121462275,"teacher_disagreement_score":0.93081635,"about_ca_system_score_codex":0.00009611825,"about_ca_system_score_gemma":0.000116270916,"threshold_uncertainty_score":0.38330775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70255977,0.011037036,0.2634461,0.005164412,0.0081226155,0.0016898517,0.00022793701,0.0006629827,0.0070892638],"genre_scores_gemma":[0.9948357,0.0010286623,0.00353979,0.00004408202,0.0001948073,0.00016077739,0.00007392716,0.000038576083,0.00008368532],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812,0.00011959591,0.0010879885,0.000111537294,0.0003812559,0.00017959169],"domain_scores_gemma":[0.996062,0.0007947715,0.0004905213,0.0010364321,0.0015366686,0.000079648926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077309937,0.00018008456,0.00032837893,0.00043623307,0.00010471733,0.00032995266,0.0038519187,0.00024057517,0.000016982638],"category_scores_gemma":[0.0002835673,0.00016782421,0.00012738025,0.0001806543,0.00009535015,0.000675414,0.00012094345,0.0007898511,0.0000146008515],"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.0014072119,0.0019115572,0.03916897,0.0006697078,0.007389458,0.000023720491,0.00470155,0.23697819,0.27511227,0.2559309,0.03967401,0.13703245],"study_design_scores_gemma":[0.0028665774,0.000068060064,0.0016586097,0.0004459416,0.00007010764,0.00040365628,0.0005081842,0.20369571,0.0044754823,0.00077966874,0.784593,0.00043504077],"about_ca_topic_score_codex":0.00007727068,"about_ca_topic_score_gemma":0.00008962563,"teacher_disagreement_score":0.74491894,"about_ca_system_score_codex":0.00011162699,"about_ca_system_score_gemma":0.00006340939,"threshold_uncertainty_score":0.7157887},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.964025,0.015531456,0.011087757,0.0034384914,0.002534002,0.0004784777,0.000033834567,0.0001159071,0.002755076],"genre_scores_gemma":[0.9863335,0.012505728,0.0006735441,0.0001125927,0.000103858874,0.000025968004,0.00004789166,0.000043890803,0.00015302002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979006,0.00032568243,0.0010705112,0.0001254879,0.00038733924,0.00019039348],"domain_scores_gemma":[0.9971919,0.0005383898,0.00055823673,0.0007603568,0.0008440666,0.000107047774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012015009,0.00021766679,0.00035430002,0.000644432,0.00011457308,0.00023241539,0.0011399904,0.00013520176,0.00002190732],"category_scores_gemma":[0.00051704916,0.00022574757,0.00007492219,0.00032403023,0.000069073445,0.0009955332,0.00014161422,0.00043311514,0.000016212038],"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.00053642184,0.0036103947,0.010182372,0.00025968952,0.0022839098,0.00012109715,0.03410025,0.23024762,0.3384786,0.3667446,0.006104048,0.007330982],"study_design_scores_gemma":[0.018835986,0.0010287924,0.045872,0.010000421,0.00029503705,0.0046454943,0.011536821,0.40118048,0.050073437,0.028254995,0.42393073,0.0043458156],"about_ca_topic_score_codex":0.00010115199,"about_ca_topic_score_gemma":0.000013174573,"teacher_disagreement_score":0.41782668,"about_ca_system_score_codex":0.00018963499,"about_ca_system_score_gemma":0.00005492401,"threshold_uncertainty_score":0.92057186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8597972,0.08361165,0.047114268,0.0003406449,0.0049560377,0.00079222076,0.00003588865,0.00011241119,0.003239701],"genre_scores_gemma":[0.9974597,0.0016434947,0.0002924297,0.00001776675,0.00047225118,0.000030357043,0.000028053908,0.000025274023,0.000030633284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976946,0.0002883913,0.0012664478,0.00008531358,0.0005160079,0.00014920601],"domain_scores_gemma":[0.99801034,0.00029408833,0.0005411965,0.0004542775,0.0006598455,0.000040244806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010334959,0.00014749827,0.00041082117,0.00024477646,0.000023169196,0.000071304305,0.0010206942,0.000118813594,0.000024768939],"category_scores_gemma":[0.000019505667,0.00014883032,0.00012741523,0.0002145594,0.000057610236,0.00027792036,0.000064255066,0.00036228713,0.000004125242],"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.000053658747,0.00015789094,0.005428299,0.00003147038,0.00007778065,0.000005894126,0.00015520577,0.98958737,0.00034849008,0.0011122401,0.0010044308,0.0020372798],"study_design_scores_gemma":[0.0021065786,0.00007032589,0.008671413,0.0014944822,0.000025926402,0.000047076363,0.00024617635,0.9422144,0.0012604629,0.0002956239,0.043297406,0.00027012036],"about_ca_topic_score_codex":0.000388539,"about_ca_topic_score_gemma":0.0002067322,"teacher_disagreement_score":0.13766256,"about_ca_system_score_codex":0.00025246083,"about_ca_system_score_gemma":0.000038850812,"threshold_uncertainty_score":0.60691243},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04511307,0.020840105,0.93046504,0.0008035796,0.0021279028,0.000085194435,0.0000032181863,0.0000308642,0.00053101534],"genre_scores_gemma":[0.9872946,0.001951258,0.010210523,0.00010730965,0.00037002628,0.0000039021447,0.000023721854,0.000012274956,0.000026352782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750036,0.00055778585,0.000866286,0.00017645113,0.0006654636,0.00023362807],"domain_scores_gemma":[0.9969686,0.00045746248,0.0008650529,0.0010805381,0.00049956207,0.00012873347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847324,0.00013981815,0.00025291223,0.00034415495,0.000067021945,0.00027691116,0.0028895366,0.00009981972,0.0000028561863],"category_scores_gemma":[0.00009001965,0.00012890456,0.000043206455,0.00029415303,0.000075424745,0.00090586155,0.0007981098,0.00027285996,0.0000031829802],"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.000029062665,0.00020617494,0.004862029,0.0000020448633,0.00007049612,0.000011459651,0.000445219,0.93700737,0.000029885116,0.03431878,0.00027671622,0.02274076],"study_design_scores_gemma":[0.0006414978,0.000018940616,0.001478014,0.0002536927,0.0000070304654,0.0003209127,0.00011111555,0.98186487,0.000037995946,0.000028781775,0.015110334,0.00012680306],"about_ca_topic_score_codex":0.0001422771,"about_ca_topic_score_gemma":0.000019813659,"teacher_disagreement_score":0.9421816,"about_ca_system_score_codex":0.000193154,"about_ca_system_score_gemma":0.000058674814,"threshold_uncertainty_score":0.53695256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013509883,0.0074323867,0.97755724,0.01100714,0.0021280472,0.00025014652,0.0000043319433,0.0000401651,0.00022956781],"genre_scores_gemma":[0.9959735,0.0018002072,0.0011645785,0.00017492202,0.0005890471,0.000041265885,0.000008638841,0.000007688011,0.00024011306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826676,0.00026551777,0.00075199525,0.000101349484,0.00044392588,0.00017043011],"domain_scores_gemma":[0.9956123,0.0014099074,0.00081378146,0.00042660485,0.0016598119,0.000077561934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014684376,0.00010604471,0.0002029078,0.00006924657,0.00026842262,0.0006040929,0.0029988445,0.000060341332,0.0000019907407],"category_scores_gemma":[0.00013865196,0.00007294079,0.00017506562,0.0001586534,0.000057986286,0.0003807415,0.000092148985,0.00020490789,0.0000047781077],"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.00014856,0.000047844864,0.00009240078,3.5714e-7,0.00021382212,0.0000035885057,0.000066503184,0.7764613,0.000002561683,0.0639475,0.0087744575,0.1502411],"study_design_scores_gemma":[0.001247055,0.000041593237,0.00017650066,0.000047146634,0.000010963453,0.00013278589,0.00007349695,0.76797247,4.9358806e-7,0.0002255179,0.2300093,0.00006269534],"about_ca_topic_score_codex":0.000003899867,"about_ca_topic_score_gemma":0.000009500854,"teacher_disagreement_score":0.9946225,"about_ca_system_score_codex":0.0001005591,"about_ca_system_score_gemma":0.00007771941,"threshold_uncertainty_score":0.5825282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014031098,0.00016002874,0.9707166,0.00022298735,0.0010157548,0.013497354,0.000009116507,0.00007632214,0.00027072063],"genre_scores_gemma":[0.93714863,0.000009652507,0.055250075,0.000067975656,0.0008469702,0.006577047,0.00003663799,0.00003003918,0.000032960248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997091,0.00048240798,0.00093739864,0.00024329554,0.0008955165,0.0003503593],"domain_scores_gemma":[0.99447936,0.0005581996,0.0015544744,0.0016526226,0.0015559485,0.000199417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020361238,0.00020143662,0.00031328536,0.00020074249,0.00019327238,0.00048611237,0.0051953155,0.000110616355,0.0000026999044],"category_scores_gemma":[0.00004701253,0.00015987338,0.00007928835,0.0002374364,0.00007666615,0.0012424908,0.00058681506,0.00035404653,0.000003303841],"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.000101897436,0.0003745766,0.0012612052,0.0000059201607,0.000107735075,0.0000031706156,0.00058065477,0.98586965,0.00005703689,0.008312958,0.00023823052,0.0030869478],"study_design_scores_gemma":[0.0012474534,0.00016804544,0.0002702869,0.00041189583,0.00001333819,0.00025049687,0.00029371676,0.9799593,0.00007772497,0.0000029558794,0.017113516,0.00019123341],"about_ca_topic_score_codex":0.000028375742,"about_ca_topic_score_gemma":0.000007227603,"teacher_disagreement_score":0.9231175,"about_ca_system_score_codex":0.00018915988,"about_ca_system_score_gemma":0.000109660235,"threshold_uncertainty_score":0.9654275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060807075,0.002559818,0.9294461,0.0055901012,0.00094275206,0.0004090617,0.000010903988,0.000016857859,0.00021732398],"genre_scores_gemma":[0.99838597,0.00015033668,0.0010222344,0.00030767499,0.000099920064,0.0000188183,7.260811e-7,0.00000581989,0.000008532215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972835,0.0008874084,0.00094348204,0.00010379147,0.00067424163,0.00010756399],"domain_scores_gemma":[0.99367195,0.00261213,0.0014728948,0.0005876733,0.0015977552,0.000057606114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021560849,0.00011513474,0.00035184127,0.0001279423,0.00005485589,0.0000750242,0.0023622988,0.00005415092,0.0000044712333],"category_scores_gemma":[0.00025819842,0.00007811327,0.00018188056,0.00013855737,0.00011947878,0.00026956294,0.00006570794,0.00024940984,0.0000056024023],"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.00084099313,0.0015461175,0.0008744344,0.000043662658,0.0022395707,0.000042015017,0.0023652408,0.17090021,0.0073772203,0.6863623,0.000382336,0.12702587],"study_design_scores_gemma":[0.042477373,0.002236743,0.009696526,0.0034355824,0.00033255553,0.00040680662,0.0008180842,0.89984185,0.020379813,0.013028976,0.006617766,0.0007279183],"about_ca_topic_score_codex":0.000040135263,"about_ca_topic_score_gemma":0.0000032748771,"teacher_disagreement_score":0.93757886,"about_ca_system_score_codex":0.00011672009,"about_ca_system_score_gemma":0.00019423955,"threshold_uncertainty_score":0.4389778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2982725,0.0018999892,0.6976864,0.000023515999,0.0013498864,0.00045753736,0.0000132931455,0.00007967667,0.00021722679],"genre_scores_gemma":[0.9953923,0.00055186334,0.0036970396,0.0000060868942,0.00013095587,0.00006944635,0.000028947048,0.000047576614,0.00007576964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975288,0.00016661496,0.0013636965,0.00013878412,0.00060542685,0.00019669917],"domain_scores_gemma":[0.9960192,0.00014203669,0.0012357883,0.0005013236,0.00200104,0.00010060691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005763142,0.0002272676,0.00056455977,0.0011102192,0.00007209843,0.00017937335,0.0008011462,0.00012637596,0.000012501476],"category_scores_gemma":[0.00005045936,0.00020110149,0.00015925945,0.0006598061,0.00004633484,0.0011834061,0.0000600948,0.00027565108,0.000011900703],"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.000025583751,0.0000574517,0.004439688,0.000046827387,0.0016629758,0.0000013277033,0.0007673989,0.9859557,0.0045917714,0.000025613846,0.000017304063,0.0024083192],"study_design_scores_gemma":[0.0008949579,0.000058481215,0.006183128,0.00059529074,0.0002023823,0.00006084877,0.0007723554,0.9898794,0.00089884945,0.0000031206343,0.0002528105,0.00019837363],"about_ca_topic_score_codex":0.00026854526,"about_ca_topic_score_gemma":0.000033167857,"teacher_disagreement_score":0.69711983,"about_ca_system_score_codex":0.00039862056,"about_ca_system_score_gemma":0.0000317446,"threshold_uncertainty_score":0.82006806},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011837331,0.004984741,0.988881,0.0014377431,0.0027888138,0.0002418732,0.0000026028545,0.000053225274,0.00042624606],"genre_scores_gemma":[0.9877086,0.0006795787,0.010301617,0.00014452242,0.0007875619,0.000043789387,0.0000022414522,0.000010416083,0.00032165728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982448,0.00026141212,0.0007294791,0.00012573581,0.0004910918,0.00014743302],"domain_scores_gemma":[0.9967715,0.00056016614,0.00080789404,0.00042230522,0.0013508846,0.00008722559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009415476,0.00011482181,0.00023489035,0.00020065143,0.00012965912,0.0004233879,0.0019322296,0.00008224709,0.000009086376],"category_scores_gemma":[0.00006378302,0.00010490074,0.00018517078,0.00016572216,0.00003367279,0.0006944305,0.00008640442,0.00022978015,0.000014400625],"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.0000466424,0.00007731977,0.000046246572,8.681627e-7,0.00020403709,0.0000046061564,0.00032136307,0.027522182,0.000020419595,0.0054865703,0.0017173307,0.9645524],"study_design_scores_gemma":[0.0024728407,0.00009762456,0.00013822303,0.0000843504,0.0000157572,0.00015846374,0.000037521924,0.9587254,0.000019896699,0.00025071748,0.037897892,0.00010129811],"about_ca_topic_score_codex":0.000014329196,"about_ca_topic_score_gemma":0.0000039675606,"teacher_disagreement_score":0.9865249,"about_ca_system_score_codex":0.000102195205,"about_ca_system_score_gemma":0.000024311259,"threshold_uncertainty_score":0.42777282},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004206877,0.0016484192,0.99167657,0.00071918766,0.0034599176,0.00010012576,0.0000046386394,0.000046634843,0.0019238045],"genre_scores_gemma":[0.9744884,0.000043934964,0.02431234,0.00043280906,0.00050413515,0.00001497514,0.000041876287,0.00001471747,0.00014683444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771863,0.00028296036,0.0009127078,0.00016214502,0.0007403413,0.00018321174],"domain_scores_gemma":[0.99496377,0.00035079053,0.0012334068,0.00073414005,0.00241118,0.000306703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002133254,0.00013989424,0.00026303157,0.00020905727,0.00007750124,0.00025712364,0.002764777,0.00009020908,0.000004683117],"category_scores_gemma":[0.00005302326,0.00013057067,0.00012226346,0.000099583944,0.00005988102,0.0004150025,0.00013027315,0.00018520672,0.0000020936234],"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.00020262551,0.00049992214,0.00041145209,0.0000043132795,0.00018193678,0.00005349387,0.0007313369,0.45066994,0.00005830611,0.49152032,0.024365429,0.03130091],"study_design_scores_gemma":[0.0008226033,0.00012056714,0.000012600075,0.00011977858,0.000011266989,0.00009338752,0.00011878086,0.9261401,0.000003358593,0.00028995323,0.07214034,0.00012722709],"about_ca_topic_score_codex":0.00004864121,"about_ca_topic_score_gemma":0.0000023727155,"teacher_disagreement_score":0.9740677,"about_ca_system_score_codex":0.0005235172,"about_ca_system_score_gemma":0.0007025266,"threshold_uncertainty_score":0.53245175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30334172,0.016185204,0.66883767,0.005648355,0.0033159994,0.00031964778,0.0000018848817,0.0000660981,0.002283431],"genre_scores_gemma":[0.988912,0.004538895,0.0059145843,0.00012616935,0.00042524983,0.0000237831,0.0000024678297,0.00001585157,0.000040985895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612767,0.0008317595,0.0011738918,0.0002059441,0.001329358,0.0003313544],"domain_scores_gemma":[0.9961443,0.00060459995,0.00079319335,0.00087917905,0.0014870323,0.00009172417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039503006,0.00013574258,0.00027303785,0.00032898202,0.00012751197,0.0006011543,0.0046835355,0.00009419179,0.0000037784087],"category_scores_gemma":[0.00013909269,0.00012691968,0.00009868852,0.00061613816,0.000100845464,0.0015050753,0.0007147636,0.00083853235,0.000024560122],"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.00010653933,0.0004252918,0.004041217,0.00000690433,0.000179744,0.00023787629,0.0069916993,0.5205305,0.00050385855,0.39653727,0.0005461789,0.069892906],"study_design_scores_gemma":[0.0075539607,0.0004897505,0.007206532,0.006022456,0.000016585356,0.0017384038,0.0034439866,0.8923588,0.0011839521,0.0437049,0.035470277,0.00081039453],"about_ca_topic_score_codex":0.00022304441,"about_ca_topic_score_gemma":0.00010713448,"teacher_disagreement_score":0.6855703,"about_ca_system_score_codex":0.0005881342,"about_ca_system_score_gemma":0.00019121583,"threshold_uncertainty_score":0.87032527},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005463497,0.0045038057,0.98487407,0.007911012,0.0011370174,0.00024961543,0.0000064079336,0.000048865364,0.00072287506],"genre_scores_gemma":[0.97872645,0.0014000831,0.018438384,0.0007231225,0.00037027727,0.000038605278,0.000014497069,0.000016132564,0.00027245306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973731,0.00093057205,0.00083873724,0.00018466717,0.0004506928,0.00022219715],"domain_scores_gemma":[0.9946078,0.0016189893,0.00093121146,0.0010956357,0.0016504467,0.00009589853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024175881,0.00016542457,0.00028456378,0.00023116579,0.00024738535,0.00017245243,0.0035529064,0.00007135594,0.000016193993],"category_scores_gemma":[0.00017625057,0.0001236431,0.00018813496,0.0001600892,0.000109581066,0.00046163995,0.0003064851,0.0002101468,0.000009658666],"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.00017637637,0.00008442994,0.00006635275,0.000001443467,0.00008424945,0.0000016410331,0.00008772266,0.47345307,0.0003512791,0.4844216,0.0048980685,0.03637375],"study_design_scores_gemma":[0.0011552174,0.00011811102,0.00016306312,0.00028921146,0.000009918947,0.000023399256,0.000016035705,0.9515433,0.000037275622,0.011042576,0.035459027,0.00014287392],"about_ca_topic_score_codex":0.0000010838089,"about_ca_topic_score_gemma":0.00000410946,"teacher_disagreement_score":0.9781801,"about_ca_system_score_codex":0.00035252963,"about_ca_system_score_gemma":0.00016147202,"threshold_uncertainty_score":0.6602243},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85342187,0.002585085,0.13635626,0.00559603,0.0007032236,0.00016374646,0.000002097525,0.0000271495,0.0011445339],"genre_scores_gemma":[0.9955506,0.0009096831,0.0029816472,0.000041562587,0.00029960135,0.000010782384,0.000002605671,0.0000063566745,0.00019715868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711716,0.0007933121,0.00089386996,0.00011691444,0.0009345728,0.00014418692],"domain_scores_gemma":[0.9951352,0.00070406677,0.000551788,0.0005057124,0.003028196,0.000075054224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025623115,0.000091757065,0.0002141404,0.00032158374,0.00011453901,0.00017441725,0.0021842585,0.00005712018,0.00001668335],"category_scores_gemma":[0.00012444048,0.00007929471,0.00009219797,0.00028428293,0.00009562433,0.0011941356,0.00020770243,0.00036105808,0.000028495519],"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.0005498562,0.00080786075,0.016475145,0.0000223226,0.0010759542,0.000017939554,0.008868724,0.19313894,0.0045915493,0.25065073,0.0024342826,0.5213667],"study_design_scores_gemma":[0.0010261666,0.00016143784,0.011010363,0.00045490148,0.0000147222245,0.00008574631,0.00029790506,0.97293675,0.0012153137,0.0006124199,0.0120514,0.00013288633],"about_ca_topic_score_codex":0.000008717321,"about_ca_topic_score_gemma":0.0000072561593,"teacher_disagreement_score":0.7797978,"about_ca_system_score_codex":0.0001406606,"about_ca_system_score_gemma":0.00012185398,"threshold_uncertainty_score":0.40589324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85572714,0.01836677,0.11561809,0.0015554046,0.0036238877,0.0001937511,0.000006020218,0.000064149695,0.004844762],"genre_scores_gemma":[0.99850833,0.00030066492,0.0006525475,0.000116758434,0.00012251531,0.00000533429,0.0000017908004,0.0000040626,0.00028799483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987004,0.00020828198,0.0004591851,0.00008683784,0.00047284682,0.00007249299],"domain_scores_gemma":[0.997858,0.00009522443,0.00047217796,0.00032589465,0.0011346451,0.000114043694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009391787,0.000075653974,0.00015391414,0.00016248005,0.000025667954,0.00035245155,0.0016338365,0.000035291836,0.0000013530176],"category_scores_gemma":[0.00008423846,0.000064845866,0.000059323753,0.00005781464,0.000044826804,0.00072829326,0.00033534752,0.00018577842,0.000010155179],"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.0011039022,0.001963193,0.094606474,0.00005289581,0.0025638225,0.00089583313,0.100602314,0.004453647,0.0058029704,0.51763004,0.066373214,0.20395169],"study_design_scores_gemma":[0.00946182,0.0018738244,0.004113228,0.0018291498,0.00008048813,0.015637774,0.013926303,0.45980534,0.0010021871,0.01085422,0.4803928,0.0010228377],"about_ca_topic_score_codex":0.0001832734,"about_ca_topic_score_gemma":0.0000047052727,"teacher_disagreement_score":0.50677586,"about_ca_system_score_codex":0.00009227929,"about_ca_system_score_gemma":0.000070538,"threshold_uncertainty_score":0.33986983},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07706255,0.0019102519,0.9116992,0.0049006427,0.0018590549,0.0007006083,0.0000066510747,0.00006906092,0.0017920197],"genre_scores_gemma":[0.9957424,0.00043164106,0.0028197223,0.00023259193,0.0002503346,0.000104337065,0.000010262869,0.000016627568,0.00039213154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630344,0.00091360783,0.0010115195,0.00021514986,0.0013272212,0.00022903807],"domain_scores_gemma":[0.99340737,0.00025089973,0.0007791127,0.00089821074,0.004465899,0.00019852008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00403548,0.0001790473,0.00032839944,0.00051799027,0.00013113447,0.00047692878,0.0031364993,0.00010319379,0.000009689529],"category_scores_gemma":[0.00027239358,0.00017188097,0.00010280562,0.00067014043,0.000038724553,0.0012810046,0.000845098,0.0005905638,0.00002179697],"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.00080208504,0.0017586525,0.016702356,0.000012692287,0.0006510268,0.00006426271,0.050260812,0.5850769,0.0014187888,0.12590647,0.030337708,0.18700819],"study_design_scores_gemma":[0.0017960444,0.00021101911,0.0037370238,0.000675475,0.00000809162,0.00010254167,0.002317585,0.93743956,0.00014972262,0.00026715983,0.053016834,0.00027894776],"about_ca_topic_score_codex":0.00010060734,"about_ca_topic_score_gemma":0.00026834034,"teacher_disagreement_score":0.9186798,"about_ca_system_score_codex":0.00062720425,"about_ca_system_score_gemma":0.0001934605,"threshold_uncertainty_score":0.7009102},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5592894,0.014757918,0.42189565,0.0019900056,0.00035268185,0.0006513937,0.0001613854,0.000046329682,0.00085525494],"genre_scores_gemma":[0.99746764,0.00086535484,0.0014737266,0.000008263582,0.00009430534,0.000027150536,0.000022728553,0.000016704986,0.00002409955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774456,0.00030339617,0.0009491236,0.0000803256,0.00076310575,0.00015949599],"domain_scores_gemma":[0.99875444,0.0002786117,0.00030406652,0.00027924293,0.00033663993,0.000047017395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016651083,0.00008605832,0.00019859214,0.00029787395,0.000028302376,0.000037922608,0.0006066563,0.0000709682,0.000010779527],"category_scores_gemma":[0.00011695721,0.000092357775,0.000040068982,0.00016395556,0.00005309491,0.00030425497,0.000059006525,0.00043039245,0.00000423104],"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.00004778549,0.00012373774,0.006366919,0.000004685355,0.00002852495,0.000003267341,0.0005212051,0.98484176,0.00538268,0.00022406665,0.00036300413,0.002092342],"study_design_scores_gemma":[0.003189819,0.000049326965,0.0039017117,0.00065615727,0.000013766411,0.000042728407,0.0019263121,0.978604,0.0034739233,0.00006689634,0.007898589,0.00017677233],"about_ca_topic_score_codex":0.00014047578,"about_ca_topic_score_gemma":0.00013156932,"teacher_disagreement_score":0.4381783,"about_ca_system_score_codex":0.0011745986,"about_ca_system_score_gemma":0.00004079496,"threshold_uncertainty_score":0.37662408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003758744,0.008038575,0.98381346,0.0011259177,0.0024775774,0.00033511003,0.000005326273,0.000046634083,0.00039866913],"genre_scores_gemma":[0.97239447,0.0014128542,0.025641462,0.00008746955,0.00023193439,0.000056864552,0.0000071616378,0.000013383485,0.00015441526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979927,0.00032501636,0.0008706793,0.00014776591,0.000529779,0.00013408114],"domain_scores_gemma":[0.99497646,0.00039890903,0.0009713288,0.0006309386,0.0028648626,0.00015748924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022252868,0.00013692274,0.00026164207,0.0002778832,0.0001703887,0.0006092573,0.0021044256,0.00008237211,6.9950266e-7],"category_scores_gemma":[0.00037407284,0.00012371998,0.00008554163,0.00017934514,0.000045550234,0.0008559626,0.00041708522,0.00027952265,0.0000064442243],"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.0005696369,0.0013103763,0.0030240105,0.00008577911,0.001840475,0.0000126898685,0.020588355,0.12089526,0.02720187,0.5608921,0.0069638323,0.25661564],"study_design_scores_gemma":[0.0029365886,0.0001640569,0.00044040874,0.00043433037,0.00002101251,0.000467633,0.0013313335,0.83251876,0.0002745996,0.00014748631,0.16102462,0.00023916713],"about_ca_topic_score_codex":0.00004986321,"about_ca_topic_score_gemma":0.000025720201,"teacher_disagreement_score":0.96863574,"about_ca_system_score_codex":0.0003033669,"about_ca_system_score_gemma":0.00013354143,"threshold_uncertainty_score":0.5875082},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1241218,0.016894624,0.83095294,0.022012798,0.0018084473,0.00081697165,0.0000070021983,0.0001062187,0.0032792073],"genre_scores_gemma":[0.99681884,0.0013052182,0.0010566524,0.000091117225,0.00043867403,0.000038425183,0.00000950173,0.000019128109,0.00022245593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99327534,0.0027136593,0.0014343663,0.00022361179,0.0019580044,0.0003950085],"domain_scores_gemma":[0.9921895,0.0021040556,0.0007367442,0.0014146406,0.0033947516,0.00016025167],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.006155901,0.00015901253,0.00035470515,0.00093903195,0.0002039269,0.0007823544,0.0067844335,0.00014527266,0.00001043086],"category_scores_gemma":[0.0002183428,0.00014349395,0.00011384568,0.00095133873,0.00017299964,0.0011425323,0.00076610706,0.0010775512,0.00002149321],"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.0005992484,0.001645693,0.056768127,0.000025430521,0.00029824322,0.0002342921,0.0016142079,0.690963,0.0037982513,0.14096712,0.05234066,0.050745755],"study_design_scores_gemma":[0.0022147945,0.00008316834,0.012366921,0.0008026207,0.0000039162546,0.00015067219,0.00026784165,0.95793235,0.00020182926,0.0015240558,0.024253298,0.00019850775],"about_ca_topic_score_codex":0.00083014823,"about_ca_topic_score_gemma":0.00025153262,"teacher_disagreement_score":0.87269706,"about_ca_system_score_codex":0.000500043,"about_ca_system_score_gemma":0.00029055632,"threshold_uncertainty_score":0.99858934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016441094,0.0018573586,0.9804034,0.00045981412,0.0004364073,0.00008922783,0.000015081868,0.000035587564,0.00026199798],"genre_scores_gemma":[0.99554235,0.0011007177,0.0028675569,0.000015718348,0.00018200195,0.00006314971,0.0000068037375,0.000029965588,0.00019175216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988819,0.000112207184,0.0005437348,0.00006705095,0.00025462755,0.0001404881],"domain_scores_gemma":[0.997003,0.0017912124,0.00030712647,0.0002692589,0.00058430934,0.000045044875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785468,0.00010260281,0.0001442333,0.00014010287,0.00008798789,0.00008327559,0.0007347032,0.000036417503,6.658585e-7],"category_scores_gemma":[0.000120403376,0.000063176725,0.000051924424,0.000082166436,0.000056828834,0.0003410064,0.000037993323,0.00013188797,3.6648964e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005999969,0.000013448031,0.0012166725,0.0000018856289,0.00011325086,0.0000017370397,0.00012168458,0.98453975,0.00015363586,0.005044384,0.00029906599,0.00843448],"study_design_scores_gemma":[0.0007943045,0.000018799532,0.00043255306,0.00049786275,0.000007077735,0.00003482923,0.00008110301,0.9947847,0.000096316035,0.0003791476,0.002786135,0.00008714741],"about_ca_topic_score_codex":0.000070135044,"about_ca_topic_score_gemma":0.0005122692,"teacher_disagreement_score":0.97910124,"about_ca_system_score_codex":0.0002251277,"about_ca_system_score_gemma":0.000046657417,"threshold_uncertainty_score":0.25762722},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89364076,0.0039212354,0.09852717,0.0015474504,0.0007912656,0.00081752567,0.000025165595,0.000027312295,0.00070209993],"genre_scores_gemma":[0.9995583,0.000089887486,0.00012876661,0.000031595817,0.00012627477,0.000035681758,0.0000012554841,0.000018350524,0.000009861805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99590456,0.001930498,0.0010387396,0.00007657218,0.0008982429,0.00015141138],"domain_scores_gemma":[0.9925581,0.0041118194,0.0005904934,0.0004337886,0.0022539976,0.000051775674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00500417,0.00011901275,0.0003943251,0.0002686788,0.000060958497,0.000073231444,0.0010324295,0.0000662238,0.000007726868],"category_scores_gemma":[0.000843265,0.000084209736,0.00013897613,0.00017372737,0.00016600915,0.00018460046,0.00003351949,0.00051408,0.000011736166],"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.001058591,0.0007488879,0.004226143,0.00022178367,0.0032772557,0.00003877896,0.009315988,0.59876007,0.31128985,0.06540557,0.00035799533,0.0052990895],"study_design_scores_gemma":[0.045493256,0.002710531,0.03286809,0.010024003,0.000320632,0.00031222738,0.006332629,0.5879231,0.2968176,0.008795884,0.007487667,0.0009143295],"about_ca_topic_score_codex":0.00009918477,"about_ca_topic_score_gemma":0.000006842758,"teacher_disagreement_score":0.10591756,"about_ca_system_score_codex":0.00029372066,"about_ca_system_score_gemma":0.00008038932,"threshold_uncertainty_score":0.34339732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014289484,0.00071082567,0.983879,0.00043778107,0.00012906721,0.00025583155,0.0000065309873,0.0000142686085,0.00027720036],"genre_scores_gemma":[0.9868474,0.000024412133,0.012198442,0.000011958116,0.0008121062,0.00003784666,0.00001845896,0.000017289327,0.000032114065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980688,0.00026025207,0.00081540184,0.00012393104,0.00050809095,0.00022354374],"domain_scores_gemma":[0.99730253,0.00073890283,0.00056192046,0.00027556182,0.0010387443,0.00008236809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021472254,0.000112756905,0.0002740853,0.00038225442,0.00011371826,0.00019720898,0.0009034882,0.000036598718,0.000010869773],"category_scores_gemma":[0.000052460684,0.000108266606,0.0001424126,0.00032288622,0.000056787612,0.00027399402,0.00015304962,0.00040924607,0.0000020184898],"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.000040118863,0.00010926512,0.0018209709,3.7511615e-8,0.0001784542,0.0000022486897,0.0006954986,0.92507696,0.000032666994,0.043990582,0.00019002303,0.027863164],"study_design_scores_gemma":[0.0012303728,0.00012747443,0.0010603332,0.0008218573,0.000024735404,0.000013758287,0.004791431,0.9614957,0.000040451956,0.029827788,0.0004336775,0.0001324336],"about_ca_topic_score_codex":0.0013537676,"about_ca_topic_score_gemma":0.00012794968,"teacher_disagreement_score":0.9725579,"about_ca_system_score_codex":0.0003174233,"about_ca_system_score_gemma":0.00019999396,"threshold_uncertainty_score":0.4414984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019451972,0.0031529134,0.99203485,0.00014464282,0.0022647409,0.00028829506,0.000023784445,0.00008887736,0.000056706624],"genre_scores_gemma":[0.84263307,0.0007017225,0.1555853,0.00003005542,0.00090198324,0.000029822368,0.000032990054,0.00005731766,0.000027731116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981351,0.00018135278,0.0008895668,0.0001378076,0.00040207946,0.00025409818],"domain_scores_gemma":[0.99704504,0.0005468858,0.0006030847,0.00044361866,0.0012417287,0.00011963132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086927885,0.00019391112,0.0003050341,0.00018069192,0.00010830897,0.00013952787,0.0010459487,0.00013596003,0.000014547812],"category_scores_gemma":[0.000042025895,0.00016110223,0.00012645822,0.00015587501,0.000047226582,0.00045688648,0.00004547351,0.00020935088,0.000004779613],"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.000035440156,0.000047011665,0.00017869215,0.000006445058,0.0001605702,0.0000012674925,0.000052137813,0.9664105,0.00041100007,0.0005671295,0.000186139,0.031943634],"study_design_scores_gemma":[0.0015888754,0.000032362615,0.00007569268,0.0008875496,0.000028611248,0.000019298186,0.00006249869,0.9927774,0.00019314348,0.000018190896,0.0041259616,0.00019042767],"about_ca_topic_score_codex":0.00000310651,"about_ca_topic_score_gemma":0.0000028243367,"teacher_disagreement_score":0.8406879,"about_ca_system_score_codex":0.00021123062,"about_ca_system_score_gemma":0.0000391989,"threshold_uncertainty_score":0.65695584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010562182,0.0029967881,0.9771202,0.0002860982,0.00166658,0.00025138637,0.000006765732,0.00005978087,0.0070502157],"genre_scores_gemma":[0.99384415,0.003657853,0.0020732635,0.00001855876,0.0001416793,0.000020908648,0.000006141573,0.000023189807,0.00021426298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984885,0.0001297797,0.00089979393,0.00008154351,0.0002710751,0.00012930106],"domain_scores_gemma":[0.9986858,0.00016372882,0.00035898548,0.00034711903,0.0003910608,0.000053328997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052646594,0.00012299816,0.00020247637,0.00036148966,0.000019903258,0.00006799957,0.00087509624,0.00007001169,0.00002133316],"category_scores_gemma":[0.000030069601,0.000096321586,0.00005662445,0.00012647483,0.000032887903,0.00045553572,0.000050636885,0.00016717639,0.000030331083],"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.00006978779,0.000046645397,0.0018926793,0.000010942541,0.00022736643,0.000027822074,0.00027432645,0.9713626,0.0009131449,0.0043224734,0.001181758,0.019670442],"study_design_scores_gemma":[0.010537938,0.00023361262,0.0071007805,0.011240915,0.00010398077,0.0010406738,0.003069515,0.87050223,0.003686457,0.0030661835,0.087791465,0.0016262511],"about_ca_topic_score_codex":0.000006694075,"about_ca_topic_score_gemma":0.0000082104525,"teacher_disagreement_score":0.98328197,"about_ca_system_score_codex":0.00041086253,"about_ca_system_score_gemma":0.000012540993,"threshold_uncertainty_score":0.39278805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060990728,0.00084834656,0.97949815,0.0013385261,0.0019168179,0.008732201,0.0001819119,0.00006049583,0.0013244748],"genre_scores_gemma":[0.96428186,0.000120252946,0.032904953,0.000036476817,0.00022442159,0.002297762,0.00010960866,0.000015577501,0.00000906213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995684,0.00079278316,0.0015265874,0.00026419916,0.0015974672,0.00013492821],"domain_scores_gemma":[0.9872641,0.00016598382,0.005633601,0.003252717,0.0035511516,0.00013246942],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002740479,0.00022176211,0.0005779156,0.0009812976,0.00013454459,0.0013587325,0.0137751065,0.00021060431,0.00002809388],"category_scores_gemma":[0.00023145464,0.00020637507,0.00045492145,0.00019792856,0.00014653867,0.0020059212,0.0019795035,0.00063081156,0.0000058697287],"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.001312856,0.008267588,0.008927489,0.0016328659,0.008527945,0.0002812668,0.016844084,0.029061714,0.002123197,0.8616302,0.005727172,0.05566362],"study_design_scores_gemma":[0.0064500365,0.0005165195,0.012082551,0.0076601095,0.0005084717,0.00024780474,0.0004555575,0.7337733,0.002435894,0.13617922,0.098253936,0.0014365762],"about_ca_topic_score_codex":0.00046216912,"about_ca_topic_score_gemma":0.00007733975,"teacher_disagreement_score":0.9581828,"about_ca_system_score_codex":0.00012460515,"about_ca_system_score_gemma":0.00038354727,"threshold_uncertainty_score":0.99967796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007497123,0.000044153385,0.9866742,0.0016812673,0.001039236,0.009234244,0.000014993766,0.00004925122,0.0011877209],"genre_scores_gemma":[0.97942644,0.000025200241,0.010657175,0.00024270444,0.0005076643,0.008859648,0.000010632004,0.000020225078,0.00025028776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973203,0.0003485477,0.0011311654,0.00020307967,0.00076909404,0.00022782889],"domain_scores_gemma":[0.99516976,0.0007330419,0.0014462367,0.0009056439,0.0015187225,0.00022659436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002177338,0.0001742684,0.00031661702,0.00018736982,0.0001476699,0.00043686214,0.0033886828,0.00011013764,0.00002275639],"category_scores_gemma":[0.00004574834,0.00012179665,0.00017170233,0.00010095708,0.00006254713,0.0009942015,0.00015035381,0.0001722892,0.000004445027],"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.0013897993,0.001240827,0.004502466,0.000050484417,0.0008244933,0.00018007847,0.0005515442,0.037847087,0.00094981474,0.43724325,0.018893497,0.49632666],"study_design_scores_gemma":[0.0028074172,0.00023574279,0.000096739546,0.0006049756,0.000016640011,0.00015280253,0.00005523361,0.9467423,0.00005222985,0.0017634089,0.04727636,0.00019615373],"about_ca_topic_score_codex":0.000009032113,"about_ca_topic_score_gemma":0.0000018083558,"teacher_disagreement_score":0.9793515,"about_ca_system_score_codex":0.0001900956,"about_ca_system_score_gemma":0.00031883747,"threshold_uncertainty_score":0.6297072},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041691944,0.003908414,0.94744545,0.004298497,0.00077205244,0.00018157484,0.0000028992586,0.000027408529,0.0016717524],"genre_scores_gemma":[0.9977845,0.0011062806,0.00057068595,0.0001656404,0.00026736478,0.0000056433537,0.000003649045,0.000010049974,0.00008619083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978782,0.0006137264,0.00072965946,0.00015672146,0.0004638435,0.00015786712],"domain_scores_gemma":[0.9968788,0.00091999903,0.00064782944,0.0003099886,0.0011707767,0.00007261426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009870583,0.00012214504,0.00023206265,0.00030467004,0.00006441738,0.0002304024,0.0012529487,0.00006533528,0.0000068239983],"category_scores_gemma":[0.00018701817,0.00009021473,0.00008358683,0.00024594713,0.000070579394,0.000686764,0.00016332757,0.00020008405,0.000008209283],"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.00083101424,0.0007338077,0.01100973,0.0000054397856,0.0012573932,0.0005562738,0.005950464,0.27729422,0.0024439078,0.15833262,0.00296687,0.53861827],"study_design_scores_gemma":[0.010617206,0.00069237716,0.018378846,0.0074978983,0.000055544926,0.004559237,0.0012747509,0.9001686,0.0028440785,0.002271679,0.050517734,0.0011220285],"about_ca_topic_score_codex":0.00002399205,"about_ca_topic_score_gemma":0.000030830062,"teacher_disagreement_score":0.95609254,"about_ca_system_score_codex":0.00027678642,"about_ca_system_score_gemma":0.000085207554,"threshold_uncertainty_score":0.367885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131281465,0.005524485,0.9681215,0.0026119265,0.008133923,0.00019549837,0.0000040269015,0.00005364825,0.0022268167],"genre_scores_gemma":[0.9870492,0.0002792901,0.011643618,0.000053950793,0.0007929284,0.0000066040016,0.000007278164,0.00001178836,0.00015530168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711585,0.00066647975,0.0010003394,0.00016406692,0.0008511263,0.00020214976],"domain_scores_gemma":[0.9934529,0.00022441492,0.0028527486,0.0014780492,0.0018533,0.00013858848],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0038710695,0.00014035597,0.0002740407,0.00018718779,0.00067931035,0.0019343182,0.005737888,0.00013538302,0.00000564303],"category_scores_gemma":[0.00044593803,0.00013265571,0.00012771657,0.00011685815,0.000080666156,0.0016937911,0.00043431352,0.00039000183,0.000029303528],"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.000067618275,0.00010533173,0.012112217,0.000015678519,0.0003394105,0.000026630998,0.0016105417,0.13111553,0.000690338,0.8454764,0.0010857268,0.0073545994],"study_design_scores_gemma":[0.000931877,0.00006312626,0.011535224,0.000867132,0.00003511418,0.0006194124,0.000314118,0.91710836,0.0002333189,0.0056281453,0.06230814,0.00035605783],"about_ca_topic_score_codex":0.00013230955,"about_ca_topic_score_gemma":0.000004244558,"teacher_disagreement_score":0.9739211,"about_ca_system_score_codex":0.00025158667,"about_ca_system_score_gemma":0.0001603071,"threshold_uncertainty_score":0.99964154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076338515,0.001533345,0.91725194,0.0033662857,0.0002923471,0.00024553243,0.0000060442167,0.000044266446,0.00092169864],"genre_scores_gemma":[0.9544927,0.00025100887,0.04489468,0.00014510447,0.00014407367,0.000020906833,0.000005436169,0.000009500709,0.000036620273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703795,0.00036543395,0.00095382234,0.0001490863,0.001232897,0.00026082038],"domain_scores_gemma":[0.9956918,0.00051701505,0.00089916296,0.0005748932,0.002178708,0.00013843388],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002945126,0.0001404131,0.00022850253,0.0002790606,0.00026470682,0.0010491076,0.0020889202,0.00007253978,0.0000038604167],"category_scores_gemma":[0.00016285255,0.00012155799,0.00004839472,0.0004455845,0.00013605546,0.00282987,0.00042012671,0.0005834169,0.000016575694],"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.00022095011,0.00043291823,0.004735062,0.00003841629,0.0008135719,0.0001267716,0.024839437,0.08359061,0.0014111119,0.41884255,0.0021089083,0.4628397],"study_design_scores_gemma":[0.007967478,0.0006953453,0.0014423986,0.003898633,0.000028111961,0.0055649495,0.01129075,0.93843925,0.0017753479,0.0052944543,0.022795323,0.000807939],"about_ca_topic_score_codex":0.00020215243,"about_ca_topic_score_gemma":0.000016579235,"teacher_disagreement_score":0.87815416,"about_ca_system_score_codex":0.00028594537,"about_ca_system_score_gemma":0.00021083896,"threshold_uncertainty_score":0.9999879},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17550854,0.0021314446,0.8192415,0.00036401668,0.0021008519,0.00026346336,0.000028573377,0.000056910045,0.00030466396],"genre_scores_gemma":[0.9891717,0.0003535343,0.010277088,0.000011849853,0.00010147626,0.0000316532,0.0000042774664,0.000016198463,0.000032229327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910814,0.00003619586,0.00042466397,0.000072218194,0.0002701596,0.000088607805],"domain_scores_gemma":[0.9983005,0.00012188202,0.0005212767,0.00043285923,0.0005863617,0.000037135327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046846663,0.0000922837,0.00015692953,0.00018345223,0.00020473156,0.00016206599,0.00085529144,0.00007558479,0.000001451891],"category_scores_gemma":[0.00012122368,0.00009152266,0.00004876101,0.000030916788,0.00007304621,0.00025453867,0.00006755515,0.00017386272,0.000003020362],"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.0001504524,0.00016444428,0.0018951063,0.000048737806,0.00050573394,0.000010360781,0.00030578926,0.5679907,0.025495134,0.0015775673,0.00040315677,0.40145278],"study_design_scores_gemma":[0.0015678841,0.000060863815,0.0030699915,0.0003190021,0.00001591401,0.000059517228,0.000109795306,0.96184057,0.013937133,0.00016402971,0.018738996,0.000116320276],"about_ca_topic_score_codex":0.00000933972,"about_ca_topic_score_gemma":0.0000072264843,"teacher_disagreement_score":0.8136631,"about_ca_system_score_codex":0.00017206155,"about_ca_system_score_gemma":0.000016860868,"threshold_uncertainty_score":0.3732186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91051537,0.0033475864,0.08421868,0.00028768214,0.0010920197,0.00015631031,0.00003440445,0.00005594458,0.00029202455],"genre_scores_gemma":[0.99248046,0.007097095,0.00021542725,0.000026465144,0.00008018662,0.000011331762,0.000056693323,0.000022285363,0.000010083413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846405,0.0001007009,0.0008524121,0.000078398756,0.0003423621,0.00016205713],"domain_scores_gemma":[0.9982493,0.0004259215,0.00035878806,0.0004216095,0.0004472582,0.00009715103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005278273,0.0001681661,0.0002958212,0.0001775356,0.00012783492,0.00054536207,0.00089188264,0.000173603,0.0000036524068],"category_scores_gemma":[0.00012505766,0.00016464618,0.000044596636,0.000054472246,0.0001119082,0.0011736727,0.000107233966,0.0005061636,0.0000029115615],"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.00009442373,0.00002945565,0.006802414,0.000018609162,0.00017470634,0.000019034314,0.0009069863,0.9653026,0.00010516021,0.0017017926,0.00014221626,0.024702625],"study_design_scores_gemma":[0.00146553,0.000032534677,0.011266333,0.00087911746,0.000016198359,0.0001570368,0.00033063968,0.97037005,0.000042798354,0.000030405405,0.015184325,0.00022500203],"about_ca_topic_score_codex":0.00006556242,"about_ca_topic_score_gemma":0.00010460125,"teacher_disagreement_score":0.084003255,"about_ca_system_score_codex":0.00013761707,"about_ca_system_score_gemma":0.000021032693,"threshold_uncertainty_score":0.67140764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48944327,0.012849528,0.488197,0.0017916681,0.0018602404,0.00026065053,0.000011972811,0.000014392323,0.0055712755],"genre_scores_gemma":[0.99766296,0.0018190535,0.0003742323,0.00002942588,0.000085575186,0.0000011765492,0.0000031850227,0.0000055684654,0.00001879505],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983945,0.00041890083,0.00061778113,0.000109567256,0.00035318016,0.00010608309],"domain_scores_gemma":[0.9963662,0.00093773036,0.0013122249,0.00042634603,0.0009029821,0.00005451917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018242358,0.00008998818,0.00028290393,0.00019108165,0.00011190845,0.00042134814,0.0014713559,0.000046937897,0.0000013984939],"category_scores_gemma":[0.00036824562,0.0000831605,0.00005151819,0.00008828237,0.00012638335,0.0007052526,0.0002582919,0.00023319067,4.6053705e-7],"study_design_candidate":"observational","study_design_consensus":"observational","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.00052020734,0.00050036795,0.6615021,0.000012508547,0.0011231602,0.00019851443,0.004227867,0.026973274,0.0001390495,0.100643456,0.0008657771,0.20329371],"study_design_scores_gemma":[0.0009847202,0.00005296582,0.7413832,0.00066195667,0.0000065738236,0.00017420831,0.00007984077,0.25590748,0.000020693416,0.0003974612,0.0002385645,0.00009233507],"about_ca_topic_score_codex":0.00087256805,"about_ca_topic_score_gemma":0.0003558674,"teacher_disagreement_score":0.5082197,"about_ca_system_score_codex":0.00006789155,"about_ca_system_score_gemma":0.00007681386,"threshold_uncertainty_score":0.40630698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96781486,0.00035012772,0.027688991,0.0020936383,0.00013332239,0.0002475729,0.000040471714,0.000012307589,0.0016187058],"genre_scores_gemma":[0.99873054,0.00022055006,0.0009844932,0.000021419706,0.000009060267,0.000008105185,0.0000068611444,0.000004086407,0.0000148640365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539924,0.0010441259,0.0016581755,0.00013516944,0.0016628212,0.000100451056],"domain_scores_gemma":[0.9861024,0.002107534,0.0040110117,0.0035474973,0.0041769785,0.00005456794],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.005907154,0.00010607203,0.0005435089,0.00056882104,0.0001688731,0.00015909939,0.008181123,0.000064085114,0.000014245998],"category_scores_gemma":[0.00135042,0.000076174096,0.00036212528,0.0004445539,0.00039372305,0.00042734278,0.0005924685,0.00024830585,0.0000025264064],"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.0003709533,0.0012606407,0.21336196,0.00017839938,0.004449501,0.000010313804,0.0026070606,0.6771285,0.0029879466,0.09201719,0.00012216697,0.0055053886],"study_design_scores_gemma":[0.0010103646,0.000405485,0.22930111,0.0018918291,0.0004189579,0.00003174995,0.0011143694,0.7602311,0.0039966353,0.00042556427,0.0009554828,0.00021734863],"about_ca_topic_score_codex":0.0006180122,"about_ca_topic_score_gemma":0.000033317505,"teacher_disagreement_score":0.09159163,"about_ca_system_score_codex":0.00022732653,"about_ca_system_score_gemma":0.00028726883,"threshold_uncertainty_score":0.9971851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03472558,0.00062947674,0.96186334,0.0014371733,0.0007742599,0.00021696271,0.000004065208,0.000032277472,0.00031684144],"genre_scores_gemma":[0.9653174,0.00027246503,0.034030117,0.000037436035,0.00020827852,0.00001739682,0.000010616796,0.000009680333,0.00009656309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988007,0.00012076416,0.00049591664,0.00016219274,0.00032404816,0.000096394266],"domain_scores_gemma":[0.9969102,0.00029799403,0.0010931176,0.00029333943,0.0013418562,0.00006349717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178246,0.00010417559,0.00017354405,0.00014652341,0.0004949032,0.0007665121,0.0008513663,0.000076080076,8.752827e-7],"category_scores_gemma":[0.00030685266,0.00009867439,0.00004335413,0.000062063766,0.000056781075,0.0010225136,0.00013714889,0.00015005868,7.09243e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003669307,0.0003728286,0.028137514,0.000032829153,0.000950752,0.000006026461,0.003953449,0.028960437,0.0031725487,0.44838542,0.00051931676,0.48514196],"study_design_scores_gemma":[0.0011296776,0.000052763018,0.027214423,0.00008119717,0.000025868556,0.00043856396,0.00007358567,0.96904683,0.000011639012,0.00065313873,0.0011729621,0.00009936093],"about_ca_topic_score_codex":0.000041831052,"about_ca_topic_score_gemma":0.000025253545,"teacher_disagreement_score":0.94008636,"about_ca_system_score_codex":0.00010974637,"about_ca_system_score_gemma":0.000067716406,"threshold_uncertainty_score":0.73914945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7432613,0.0044044545,0.22164492,0.024962913,0.0033750664,0.0004570025,0.000034870336,0.00004026594,0.0018192624],"genre_scores_gemma":[0.9959005,0.00056448305,0.0030564603,0.00033134143,0.00009754188,0.0000057964826,0.000015579752,0.0000069744706,0.00002131773],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983336,0.00024130625,0.00066150824,0.00019459164,0.00044825647,0.00012075266],"domain_scores_gemma":[0.9968055,0.00043668365,0.0008282635,0.0015400092,0.00033824553,0.000051335926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015000923,0.00010609648,0.0002217649,0.00029941328,0.00009513918,0.0005936457,0.004539041,0.00005539641,0.0000020411176],"category_scores_gemma":[0.0004258797,0.00009273448,0.000030295272,0.0000835369,0.00005248557,0.0017399859,0.0006581182,0.00029347648,0.0000031889572],"study_design_candidate":"observational","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.00084641966,0.00091760774,0.8405219,0.000041188567,0.0001704233,0.00021034069,0.0019009719,0.07915759,0.00021374835,0.03061908,0.004075224,0.04132551],"study_design_scores_gemma":[0.0042247707,0.00009210417,0.31563845,0.002793601,0.0000041750045,0.00009772334,0.00007363329,0.65020066,0.000069811555,0.0014956167,0.025087265,0.00022221505],"about_ca_topic_score_codex":0.00014127765,"about_ca_topic_score_gemma":0.00033882444,"teacher_disagreement_score":0.5710431,"about_ca_system_score_codex":0.00009684823,"about_ca_system_score_gemma":0.000059361715,"threshold_uncertainty_score":0.84347427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00608634,0.005861613,0.98140216,0.0013478354,0.001738259,0.0005461126,0.00006442081,0.00017227627,0.0027810002],"genre_scores_gemma":[0.9492831,0.0011314518,0.048151944,0.00006360823,0.000809014,0.000042227082,0.00026048147,0.000056972003,0.00020120395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979437,0.00019385178,0.0011950735,0.000108570544,0.00041036497,0.00014841373],"domain_scores_gemma":[0.9954235,0.00035627285,0.0007902545,0.0007182763,0.002635557,0.000076140255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010022611,0.00016381427,0.00027002825,0.00033767824,0.00013073932,0.00013380875,0.0013809777,0.00012726069,0.000010564146],"category_scores_gemma":[0.00019350556,0.00016898166,0.000107723776,0.0002037561,0.000100254954,0.00066907966,0.00008165875,0.00023881863,0.000017097811],"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.0003624043,0.0003921719,0.00035420826,0.00008218695,0.0011867154,0.0000031366606,0.0048139775,0.85449845,0.007983371,0.030697819,0.030864144,0.068761446],"study_design_scores_gemma":[0.0016008837,0.00017761247,0.00020322223,0.00090047595,0.000058570866,0.0001918757,0.0021251554,0.6752178,0.0020817309,0.0014235564,0.31566194,0.0003571753],"about_ca_topic_score_codex":0.000020469166,"about_ca_topic_score_gemma":0.00002263614,"teacher_disagreement_score":0.9431968,"about_ca_system_score_codex":0.00038349957,"about_ca_system_score_gemma":0.000048774335,"threshold_uncertainty_score":0.6890872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041323274,0.0014209034,0.9537057,0.001263955,0.0011600829,0.00010734526,0.0000011526614,0.000040940606,0.0009766367],"genre_scores_gemma":[0.98650247,0.00029677266,0.012586949,0.00040814234,0.00014052575,0.000007509424,0.000010515267,0.000013167688,0.00003393464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998159,0.00017941937,0.00076225994,0.00016591103,0.00054722634,0.00018618401],"domain_scores_gemma":[0.9976944,0.00029558022,0.0009439614,0.000445515,0.00055888854,0.000061667066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969779,0.00013949293,0.00021194527,0.00034262254,0.00014600207,0.00044772468,0.0020522657,0.00008115568,0.0000029166788],"category_scores_gemma":[0.00006048536,0.0001340481,0.000057611087,0.00040732144,0.0000648158,0.0009042651,0.00012519729,0.00034453557,0.000005701899],"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.00008545409,0.00016122124,0.0011942567,0.000006745837,0.00005249729,0.000003821876,0.0011830679,0.98779255,0.00018358357,0.0022981192,0.00047300366,0.006565678],"study_design_scores_gemma":[0.00087344536,0.000101104575,0.000447599,0.0012953997,0.0000036117265,0.000041809733,0.000030503745,0.99477935,0.00009010269,0.00011444414,0.0020907996,0.00013182877],"about_ca_topic_score_codex":0.000014897388,"about_ca_topic_score_gemma":0.000008111446,"teacher_disagreement_score":0.9451792,"about_ca_system_score_codex":0.00028410158,"about_ca_system_score_gemma":0.00011304046,"threshold_uncertainty_score":0.5466323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006625424,0.0014855078,0.9878485,0.0006255555,0.0014058127,0.0008253709,0.00012626423,0.00015309735,0.00090442697],"genre_scores_gemma":[0.88963544,0.00020313195,0.10934438,0.00005564584,0.00024865931,0.000074125244,0.00028089946,0.00005681713,0.000100882164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768984,0.00027572174,0.0013021011,0.00016204949,0.0003974244,0.00017283691],"domain_scores_gemma":[0.99563533,0.0004260589,0.0006547991,0.0013594341,0.0017783305,0.00014606566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009116743,0.00020441611,0.00039177024,0.00046649174,0.00008164925,0.00021075695,0.0025060624,0.00012191455,0.0000058873807],"category_scores_gemma":[0.000056068173,0.00021029689,0.000104765306,0.00023906946,0.000036815036,0.00072345696,0.00012831931,0.00025852863,0.000026836839],"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.00013076136,0.00021624482,0.00029743282,0.00009019253,0.00040076318,0.0000013473482,0.0020551644,0.9471139,0.006908597,0.009201282,0.0010159677,0.032568384],"study_design_scores_gemma":[0.0010121653,0.00015249256,0.00013875865,0.0011211098,0.000034567893,0.000109845976,0.0062970105,0.96602434,0.00049125095,0.00008259007,0.024257768,0.00027811865],"about_ca_topic_score_codex":0.000030092202,"about_ca_topic_score_gemma":0.000017801067,"teacher_disagreement_score":0.88301,"about_ca_system_score_codex":0.0006299044,"about_ca_system_score_gemma":0.00006497296,"threshold_uncertainty_score":0.8575658},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000072246253,0.8713046,0.12422726,0.0001478862,0.0031549167,0.0010147031,0.000019772151,0.000019919602,0.00010373417],"genre_scores_gemma":[0.0011014512,0.9925228,0.005650994,0.00024788093,0.00021736973,0.00003492522,0.000034613386,0.00003887888,0.00015109405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99350715,0.0018823846,0.0024112018,0.0004271949,0.0015212396,0.00025085805],"domain_scores_gemma":[0.99346393,0.0007450527,0.003972369,0.0012821232,0.00043832767,0.00009821397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019271302,0.00048144715,0.0019204284,0.0008306637,0.00008865714,0.00023947479,0.005084751,0.00024998325,0.0000064345086],"category_scores_gemma":[0.0001259161,0.00039460635,0.0006221176,0.00044088642,0.000049432587,0.000092590446,0.0015284611,0.0013363383,0.000041782656],"study_design_candidate":"design_other","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.00004040282,0.0009228739,0.0000038775283,0.0063992226,0.0046771066,0.00025323586,0.00071726047,0.122364424,0.0000057601314,0.017794034,0.0007036327,0.84611815],"study_design_scores_gemma":[0.0008048217,0.0001137293,0.0000030751178,0.069245204,0.00040460835,0.00047619,0.000092720955,0.10345288,7.520686e-7,0.000067905785,0.8249461,0.00039201387],"about_ca_topic_score_codex":0.00006872902,"about_ca_topic_score_gemma":0.0000014235453,"teacher_disagreement_score":0.84572613,"about_ca_system_score_codex":0.0012945809,"about_ca_system_score_gemma":0.00023156004,"threshold_uncertainty_score":0.9998506},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95227313,0.004036003,0.023772746,0.00055961724,0.0008362248,0.00080447696,0.00008413472,0.00006738638,0.01756629],"genre_scores_gemma":[0.99078506,0.00053358194,0.008427603,0.000014291768,0.000044505938,0.00003626075,0.000102582686,0.00003617289,0.000019917867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959768,0.00067284727,0.0015169731,0.00011224972,0.0015777166,0.00014338933],"domain_scores_gemma":[0.99292046,0.00068916014,0.0011638136,0.002451508,0.0027098646,0.00006518742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020059713,0.00018540086,0.00044681682,0.00066691666,0.000054588865,0.00004927389,0.0037698357,0.0001136185,0.00005110714],"category_scores_gemma":[0.00020328502,0.00018540017,0.00021929176,0.00038737865,0.00015644025,0.0003076053,0.00016943224,0.00045495338,0.000018493103],"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.00005014114,0.00036952022,0.0007240077,0.000031858977,0.00017361125,9.995941e-8,0.00057976146,0.9777676,0.00996891,0.009388639,0.00012312827,0.00082276],"study_design_scores_gemma":[0.0012866305,0.00009818976,0.0015016657,0.0004386179,0.000063024956,0.000021612901,0.0005528069,0.99366635,0.0013571008,0.00004135687,0.00083053473,0.00014209589],"about_ca_topic_score_codex":0.000065264285,"about_ca_topic_score_gemma":0.000011810342,"teacher_disagreement_score":0.03851196,"about_ca_system_score_codex":0.00039340838,"about_ca_system_score_gemma":0.00022057955,"threshold_uncertainty_score":0.75604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039728105,0.005882892,0.9487312,0.00006701316,0.0016438304,0.0004805849,0.0000025942502,0.00009283411,0.0033709786],"genre_scores_gemma":[0.96602404,0.0011115234,0.03260363,0.000011016385,0.00013578935,0.000014976954,0.000016625663,0.000026288166,0.000056103512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855715,0.00010749985,0.0008241733,0.00008022173,0.00031833374,0.0001126108],"domain_scores_gemma":[0.99864405,0.00006121636,0.00037737898,0.00031029826,0.00057418435,0.000032839103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049751496,0.00011415284,0.0001935783,0.00047702435,0.000022042417,0.00006181115,0.0006139352,0.00007876259,0.000009807315],"category_scores_gemma":[0.000012347216,0.00012312192,0.000048242375,0.00026547431,0.00001806525,0.00066427095,0.00006936874,0.00021148734,0.000010696626],"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.000020536212,0.000024193325,0.00093188236,0.000014592994,0.00008608651,0.0000040987934,0.00009362457,0.99473554,0.00028167752,0.0021950635,0.00009083378,0.0015218816],"study_design_scores_gemma":[0.00035422124,0.00001675413,0.00061501405,0.0007463834,0.000010149679,0.00011132782,0.00044834585,0.99472266,0.000120624165,0.00007928569,0.0026465328,0.00012869369],"about_ca_topic_score_codex":0.000019827045,"about_ca_topic_score_gemma":0.0000020146288,"teacher_disagreement_score":0.92629594,"about_ca_system_score_codex":0.0006516636,"about_ca_system_score_gemma":0.00002217599,"threshold_uncertainty_score":0.5020766},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103187144,0.0016338347,0.89210075,0.000081706254,0.0018954382,0.00023616818,0.000008375707,0.00011695093,0.00073962315],"genre_scores_gemma":[0.9850581,0.001209345,0.013062895,0.00004866462,0.0003734036,0.000043752254,0.000097831195,0.00005291626,0.000053037973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985206,0.000096417956,0.00069897954,0.00011070502,0.00041489158,0.00015837696],"domain_scores_gemma":[0.99738914,0.0005271634,0.0005979173,0.0003471606,0.0010655345,0.000073102674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043436658,0.0001658297,0.0002662904,0.00021420403,0.00005499521,0.0002543711,0.0010380971,0.00012436265,0.000027828353],"category_scores_gemma":[0.00002425977,0.00015379408,0.00008564672,0.000107680375,0.000028738472,0.0004829469,0.00006267421,0.00021900843,0.0000029799965],"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.00010594005,0.00003773705,0.009448166,0.000017108427,0.00032198115,0.0000015166407,0.000059514303,0.98757625,0.00006800466,0.00096099224,0.0004592066,0.0009435569],"study_design_scores_gemma":[0.0014736379,0.00005399914,0.0015796713,0.00052776653,0.00002667485,0.00007939064,0.00002462894,0.98888737,0.000091374415,0.000012233108,0.0070758807,0.00016736433],"about_ca_topic_score_codex":0.000017328959,"about_ca_topic_score_gemma":0.000017636945,"teacher_disagreement_score":0.881871,"about_ca_system_score_codex":0.00019999445,"about_ca_system_score_gemma":0.000047555463,"threshold_uncertainty_score":0.62715405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16665156,0.0009581489,0.81998456,0.0027292648,0.0011779923,0.0004988833,0.0000022484594,0.00007385083,0.007923486],"genre_scores_gemma":[0.9965559,0.00015986162,0.0027564464,0.00023033256,0.00022250834,0.0000075152498,0.000007738386,0.000012074178,0.00004762028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981661,0.00020890852,0.00067151524,0.00019775389,0.0005897751,0.0001659517],"domain_scores_gemma":[0.99762744,0.0004737136,0.0007155365,0.00036151928,0.0007687812,0.000053039617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012497557,0.00013585495,0.0002527557,0.0005203561,0.0000494339,0.00037692365,0.00141415,0.00007446111,0.000012761209],"category_scores_gemma":[0.0000991256,0.00012852307,0.00009315071,0.00032247714,0.000030224997,0.0007143525,0.00013402328,0.00042770605,0.000006994328],"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.0006661577,0.0005612771,0.04955698,0.000016616026,0.000233034,0.0001066512,0.0017021775,0.8589003,0.00022683023,0.04079155,0.00027249192,0.046965912],"study_design_scores_gemma":[0.00083477487,0.00015289012,0.0066640833,0.0013659678,0.00000533333,0.000094702824,0.00017499267,0.98919094,0.00041373278,0.00026619068,0.00069346995,0.00014289867],"about_ca_topic_score_codex":0.000033183904,"about_ca_topic_score_gemma":0.000010766807,"teacher_disagreement_score":0.8299043,"about_ca_system_score_codex":0.00028414297,"about_ca_system_score_gemma":0.000093896546,"threshold_uncertainty_score":0.52410185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7748072,0.005101075,0.19174804,0.0046267645,0.0042008604,0.0004888801,0.0000016323092,0.00006383095,0.018961716],"genre_scores_gemma":[0.99854964,0.0002849028,0.00064260245,0.000084130814,0.000017733606,0.00000621139,0.00000255135,0.0000040899736,0.00040815814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873376,0.00012269335,0.0004801883,0.00008843235,0.0005043413,0.00007059976],"domain_scores_gemma":[0.9984355,0.000065663946,0.00042872824,0.0004103162,0.0006340781,0.00002573183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006923392,0.0000612849,0.00011635942,0.00034475976,0.000018799783,0.00017549546,0.0020606045,0.000026766564,0.0000030390154],"category_scores_gemma":[0.000015957059,0.000057145713,0.000043132062,0.00020315568,0.00000990223,0.000681671,0.000101416204,0.00014977026,0.00004712756],"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.00022050347,0.00085211266,0.03096594,0.00010311161,0.00074830774,0.00010404456,0.0056492854,0.4254535,0.0015807546,0.4208725,0.0007047573,0.11274515],"study_design_scores_gemma":[0.0024707953,0.000097859986,0.032765754,0.0015377441,0.000012463979,0.0003207781,0.0019804845,0.9480723,0.00006996528,0.003049857,0.009338953,0.0002830186],"about_ca_topic_score_codex":0.000047074613,"about_ca_topic_score_gemma":0.0000075325747,"teacher_disagreement_score":0.52261883,"about_ca_system_score_codex":0.00017185898,"about_ca_system_score_gemma":0.000045342647,"threshold_uncertainty_score":0.38291502},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9238126,0.006262215,0.06674872,0.00016194071,0.0018530531,0.00027288104,0.00004772372,0.00003852547,0.00080228876],"genre_scores_gemma":[0.9992584,0.00021114742,0.00025483884,0.000009807138,0.00018748404,0.0000039065003,0.000029304283,0.00002208486,0.000023049455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998041,0.00015797492,0.0009822287,0.00006331347,0.00062578294,0.00012972965],"domain_scores_gemma":[0.9973691,0.00065235124,0.00077630667,0.0004106739,0.00073906826,0.000052512798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088197156,0.000119068514,0.0004121712,0.00018149639,0.000018244147,0.000033186832,0.00090121705,0.00007832003,0.000019069468],"category_scores_gemma":[0.0000994609,0.00011018806,0.0001498544,0.00020771775,0.000036835703,0.00016772578,0.00007128385,0.0002872062,0.000011595525],"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.00014826289,0.000038260292,0.0009558594,0.000023010763,0.00038388665,0.0000017856752,0.00008991529,0.9929979,0.0013725392,0.0027065896,0.00079668977,0.00048530367],"study_design_scores_gemma":[0.0035755623,0.00015573938,0.0073201624,0.0029201002,0.00005964758,0.00009976659,0.00020167709,0.9801023,0.00087507133,0.0003673534,0.0041070296,0.00021559121],"about_ca_topic_score_codex":0.000017820747,"about_ca_topic_score_gemma":0.0000023481964,"teacher_disagreement_score":0.07544573,"about_ca_system_score_codex":0.00015205775,"about_ca_system_score_gemma":0.00003864291,"threshold_uncertainty_score":0.44933388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036213277,0.0012413003,0.9898989,0.00363913,0.0007291763,0.00014522475,0.000024550678,0.000034777382,0.0006655931],"genre_scores_gemma":[0.9069397,0.00017590469,0.09177889,0.0005390046,0.000494788,0.0000037854124,0.000047295016,0.000010516509,0.0000101444175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978542,0.00033348866,0.0008207452,0.00019992885,0.00067211076,0.00011954453],"domain_scores_gemma":[0.99635726,0.00023850026,0.00084192737,0.0013494374,0.0010201524,0.00019269256],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000834623,0.00011310292,0.00028487074,0.00012781641,0.000049067694,0.0002626447,0.0075637456,0.0000621537,0.0000029232608],"category_scores_gemma":[0.00014396365,0.000099323544,0.00006999776,0.0003099624,0.000024559286,0.0009363887,0.0008264601,0.000253891,0.0000069564576],"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.00007982338,0.00016644955,0.0016593634,0.000005410041,0.00022760817,0.00000869617,0.0016423259,0.9670082,0.00019705974,0.0139158005,0.0060989484,0.008990312],"study_design_scores_gemma":[0.00037795695,0.00009611448,0.0008336274,0.00010364105,0.000011052555,0.00006088438,0.00023080318,0.98025656,0.000020319412,0.0000576172,0.01784777,0.00010362567],"about_ca_topic_score_codex":0.00004879366,"about_ca_topic_score_gemma":0.000002436069,"teacher_disagreement_score":0.90331835,"about_ca_system_score_codex":0.000051039668,"about_ca_system_score_gemma":0.00009156134,"threshold_uncertainty_score":0.99780583},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002854137,0.0034439687,0.98630816,0.008794256,0.00071024493,0.0002741286,0.00006701421,0.00007153907,0.000045259007],"genre_scores_gemma":[0.7561863,0.00070551125,0.23955105,0.00089937233,0.0022930754,0.00008523027,0.00021890335,0.000020316644,0.000040228533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825346,0.00012547997,0.0008263558,0.00015564532,0.00047665663,0.00016239559],"domain_scores_gemma":[0.9967824,0.00057952304,0.0008816812,0.0004184756,0.0011916404,0.00014623682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052204914,0.00012323953,0.00025472802,0.00007209632,0.00013449008,0.00030613758,0.00293408,0.00006721835,0.0000032917053],"category_scores_gemma":[0.00013390688,0.0001138357,0.00015720664,0.00029392965,0.000033270673,0.00047758847,0.0002876455,0.00023051117,0.000008228442],"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.00008838875,0.00016881178,0.00054221816,0.0000067373744,0.00035006079,0.00000530127,0.00047139585,0.74782324,0.000030678584,0.1795028,0.021131232,0.04987916],"study_design_scores_gemma":[0.000825069,0.00010709813,0.00028369433,0.00009382518,0.000014380592,0.0000522165,0.00011733021,0.64544314,0.000004454953,0.0016038559,0.35132706,0.00012788214],"about_ca_topic_score_codex":0.000007263685,"about_ca_topic_score_gemma":0.0000013402972,"teacher_disagreement_score":0.7559009,"about_ca_system_score_codex":0.00008286299,"about_ca_system_score_gemma":0.000096487696,"threshold_uncertainty_score":0.54523},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030546187,0.000066642286,0.9835097,0.0039011699,0.00055852864,0.010347215,0.000012229176,0.00005532014,0.0015186422],"genre_scores_gemma":[0.9748431,0.0000117441905,0.017775217,0.0010463916,0.0006353718,0.005576255,0.000021759079,0.000019084167,0.00007106551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976066,0.00026950188,0.0011144053,0.00018291178,0.0006371501,0.00018943881],"domain_scores_gemma":[0.99589026,0.0005554186,0.0015140022,0.00047386705,0.001331189,0.00023526403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011379478,0.00016773198,0.00032504334,0.00009940438,0.00013678402,0.00044506576,0.0028365056,0.000103773404,0.000014350615],"category_scores_gemma":[0.00008985509,0.00014754929,0.00018567141,0.00015038984,0.00004583117,0.00039726624,0.0002195087,0.00034062733,0.0000040658947],"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.002078014,0.0010662207,0.0045795436,0.00017089913,0.0010917368,0.00040998752,0.004590807,0.34926742,0.00025527654,0.40774384,0.08053259,0.14821365],"study_design_scores_gemma":[0.0018225176,0.0001295965,0.00003009813,0.00029698835,0.000012425273,0.000053464664,0.00009835427,0.9272273,0.000009165706,0.00018584986,0.06999667,0.0001375771],"about_ca_topic_score_codex":0.000007736793,"about_ca_topic_score_gemma":7.795259e-7,"teacher_disagreement_score":0.97481257,"about_ca_system_score_codex":0.00008648418,"about_ca_system_score_gemma":0.00029409924,"threshold_uncertainty_score":0.6016885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011602296,0.00006855488,0.9916519,0.0009845068,0.00068223494,0.0051249345,0.0000057535367,0.00006097924,0.000260891],"genre_scores_gemma":[0.82741547,0.0000035827925,0.1703231,0.00026823004,0.00058269716,0.0013668247,0.0000070400993,0.000020701136,0.000012335126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977413,0.00027101906,0.00097368413,0.00021856274,0.00060501596,0.00019041525],"domain_scores_gemma":[0.9964823,0.0002257159,0.0012642733,0.0005059898,0.0013860815,0.00013564083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006914111,0.00017110807,0.0002883413,0.00021034792,0.00012257772,0.00042654603,0.003380206,0.00008701809,0.0000028381514],"category_scores_gemma":[0.00012456375,0.00015773285,0.00017362517,0.00023416417,0.000039872524,0.0006033708,0.00046819748,0.00032488827,0.0000021282426],"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.00013484455,0.00009354842,0.00014172021,0.000052340743,0.00006626066,0.0000036945278,0.00065588474,0.99222404,0.0016384419,0.0015134574,0.0001232659,0.0033524898],"study_design_scores_gemma":[0.0011781682,0.00010739548,0.0000120152645,0.0003358941,0.000007533411,0.00007155717,0.00017434725,0.9916052,0.000724003,0.000009125005,0.0056251045,0.00014962074],"about_ca_topic_score_codex":0.000035005723,"about_ca_topic_score_gemma":0.0000024348872,"teacher_disagreement_score":0.82625526,"about_ca_system_score_codex":0.00020311557,"about_ca_system_score_gemma":0.00019459869,"threshold_uncertainty_score":0.6432159},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007632052,0.0020700416,0.98574626,0.0035787777,0.0005635155,0.00022476335,0.0000022750226,0.000032552958,0.00014976015],"genre_scores_gemma":[0.96510136,0.00012166043,0.0336991,0.00068508135,0.00035878184,0.000016803542,0.0000014984013,0.000010694638,0.000005045184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987097,0.00015599119,0.0005335376,0.00012390877,0.0003578828,0.00011899119],"domain_scores_gemma":[0.9965904,0.001899644,0.000587513,0.00027346457,0.00053884013,0.000110181456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006840034,0.00010375085,0.00023916483,0.000062127816,0.00007518124,0.0003789134,0.0012555405,0.000086084496,0.00000543751],"category_scores_gemma":[0.00055263104,0.000087622495,0.00010707272,0.00012936052,0.00003766876,0.0003964195,0.00026986373,0.0002895916,0.0000037489758],"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.000155495,0.000109307584,0.0031054446,0.0000189329,0.00040816917,0.000013230592,0.0034303083,0.024848137,0.000029526787,0.9508025,0.0019659605,0.015112962],"study_design_scores_gemma":[0.0010662833,0.00021795575,0.0027985873,0.0010002505,0.00001944911,0.00015598876,0.00016830106,0.96469176,0.000025208717,0.02411225,0.005555249,0.00018873348],"about_ca_topic_score_codex":0.0000025989868,"about_ca_topic_score_gemma":2.0238782e-7,"teacher_disagreement_score":0.9574693,"about_ca_system_score_codex":0.000050173097,"about_ca_system_score_gemma":0.000029863975,"threshold_uncertainty_score":0.36538705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038021596,0.029666064,0.89744574,0.051409565,0.014159862,0.00074299396,0.0000030536094,0.00032582716,0.0024447332],"genre_scores_gemma":[0.97284126,0.0005582117,0.02554193,0.00019598557,0.00078599335,0.00003554178,0.000007721362,0.000011673641,0.000021670287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799174,0.0002649974,0.0010567416,0.0001388048,0.00036047972,0.00018721659],"domain_scores_gemma":[0.99647826,0.0006874107,0.0009504226,0.000907069,0.00091874006,0.00005809674],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0012906182,0.00012125583,0.00030698348,0.00022211739,0.00013008183,0.0004383186,0.0066810735,0.00009098199,2.1411053e-7],"category_scores_gemma":[0.00029012837,0.00011635076,0.000110527944,0.00037636724,0.000065445405,0.0005817157,0.000900077,0.00034743597,0.000009775089],"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.00020132297,0.00051571586,0.01966381,0.00010404447,0.00085818325,0.000043777934,0.010976185,0.17768386,0.00062609673,0.58953923,0.09774882,0.10203898],"study_design_scores_gemma":[0.00068489934,0.00008430347,0.00046722792,0.0003511397,0.000007236399,0.00008589415,0.0004747425,0.5808638,0.000026816228,0.0013837744,0.41541827,0.00015191568],"about_ca_topic_score_codex":0.000057902354,"about_ca_topic_score_gemma":0.0000033885724,"teacher_disagreement_score":0.96903914,"about_ca_system_score_codex":0.00017222852,"about_ca_system_score_gemma":0.00015105924,"threshold_uncertainty_score":0.9986932},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005337273,0.0011453422,0.987471,0.008472612,0.0008304969,0.00021998245,0.0000064061073,0.000030297997,0.0012901422],"genre_scores_gemma":[0.9797502,0.0002819988,0.018153155,0.001289071,0.00040147488,0.000012897327,0.000021009664,0.000012691941,0.00007749607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981728,0.0001570769,0.0009109754,0.00015849451,0.00043852095,0.00016211081],"domain_scores_gemma":[0.9965938,0.00090909447,0.001015571,0.0003464696,0.00091571576,0.00021938489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011692086,0.00013189427,0.00032272856,0.000094738265,0.00014603605,0.00042142082,0.0015609292,0.00008575246,0.0000044175713],"category_scores_gemma":[0.00009318709,0.0001181563,0.00011500875,0.00012167713,0.000059787282,0.00028829457,0.00017491891,0.00025589496,0.0000021295634],"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.002089967,0.0003250386,0.012493319,0.00007169708,0.00091325754,0.00016209125,0.0017186921,0.4038888,0.00014859658,0.43502077,0.046558518,0.09660927],"study_design_scores_gemma":[0.0020055291,0.0001044588,0.000111605645,0.00021386385,0.000021578004,0.000072488874,0.00008498305,0.95779043,0.0000026335265,0.000443872,0.039035622,0.00011294965],"about_ca_topic_score_codex":0.000017022416,"about_ca_topic_score_gemma":0.0000023442692,"teacher_disagreement_score":0.97921646,"about_ca_system_score_codex":0.000056343066,"about_ca_system_score_gemma":0.0001993157,"threshold_uncertainty_score":0.4818274},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01496971,0.0012204682,0.9803995,0.0015018745,0.00045628357,0.00019330392,0.000002379777,0.000027927612,0.00122857],"genre_scores_gemma":[0.9810287,0.0010231257,0.017442543,0.00017218653,0.00028926285,0.0000038484372,0.00001631152,0.000015749369,0.000008278978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763936,0.00031103607,0.0011219053,0.00022410369,0.0005408316,0.00016274415],"domain_scores_gemma":[0.99703085,0.00028527842,0.0011944354,0.00032279416,0.0010444111,0.0001222294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006791275,0.00015099971,0.00036882327,0.0003008842,0.000060812617,0.00026802605,0.001616985,0.00008047117,0.000015788743],"category_scores_gemma":[0.00018607426,0.00015513807,0.00010239794,0.0005062076,0.000051240946,0.0012651178,0.00022846833,0.00033077798,8.843467e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093835675,0.00009414663,0.00036332593,0.0000023253572,0.000087343775,0.000010602714,0.0012955157,0.99178654,0.000055495177,0.004388257,0.000013839854,0.0018087656],"study_design_scores_gemma":[0.0011222428,0.00012637477,0.00042681984,0.0004661271,0.0000127329495,0.000046117722,0.00030485875,0.9969098,0.0002602799,0.00016635694,0.000019304023,0.0001389934],"about_ca_topic_score_codex":0.000063060776,"about_ca_topic_score_gemma":0.000012975189,"teacher_disagreement_score":0.96605897,"about_ca_system_score_codex":0.00013568772,"about_ca_system_score_gemma":0.0000867407,"threshold_uncertainty_score":0.6326347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18575549,0.0019688688,0.8066394,0.00435923,0.0005367585,0.0005841299,0.000013783847,0.000111828085,0.000030557603],"genre_scores_gemma":[0.9433432,0.00007906113,0.056037582,0.0004150727,0.000054440665,0.000017215392,0.000016040716,0.000033116452,0.0000042723423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951066,0.0015336769,0.001586073,0.0003164141,0.0012280456,0.00022918778],"domain_scores_gemma":[0.9946122,0.0005078884,0.0014880887,0.0015659038,0.001467228,0.0003586877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021723006,0.00027701978,0.0006093402,0.0006833835,0.00016797542,0.0003518524,0.005168786,0.00010789362,0.0000035161145],"category_scores_gemma":[0.00017234805,0.0002731223,0.0001433968,0.00066275464,0.000099920326,0.0009099291,0.00097650266,0.00030951062,0.00002916239],"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.00033888724,0.00030546423,0.00062842853,0.00019976776,0.00045756632,0.00011599264,0.0061504175,0.55753165,0.4009582,0.03151732,0.0009383142,0.0008580045],"study_design_scores_gemma":[0.0009340519,0.00035950035,0.00033121626,0.0012155011,0.000036322832,0.0001407797,0.0006693899,0.98698336,0.00793743,0.0000742749,0.0010604326,0.00025773255],"about_ca_topic_score_codex":0.00017896666,"about_ca_topic_score_gemma":9.56595e-7,"teacher_disagreement_score":0.75758773,"about_ca_system_score_codex":0.00032501752,"about_ca_system_score_gemma":0.00026077326,"threshold_uncertainty_score":0.9999721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010459393,0.0032650006,0.9891634,0.004979871,0.0012720057,0.00015232916,0.000046475143,0.000052232488,0.000022741098],"genre_scores_gemma":[0.53358907,0.0006160182,0.46313193,0.0008299854,0.0017011426,0.000014620994,0.000081399136,0.000015561502,0.000020264912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823964,0.0001628908,0.0008009035,0.00013898955,0.0004940679,0.00016351294],"domain_scores_gemma":[0.9971922,0.0005229444,0.0008044424,0.00034776155,0.0009955518,0.00013708849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042262155,0.000120558325,0.0002547034,0.0000651802,0.000096828575,0.0002994345,0.002679262,0.00006285911,0.0000037228274],"category_scores_gemma":[0.00013842936,0.000109868364,0.00015104904,0.00021412873,0.000027896775,0.00037641698,0.00029131593,0.0002132386,0.0000060304387],"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.000056197936,0.00010560787,0.000517971,0.0000036697875,0.0003141593,0.000016478843,0.0004379606,0.8184555,0.000014741485,0.015362898,0.020116232,0.14459854],"study_design_scores_gemma":[0.0008502363,0.00014406546,0.00077092455,0.00012016975,0.000012152693,0.00008471322,0.00007504252,0.9119932,0.000003736691,0.0007090958,0.085123256,0.0001134127],"about_ca_topic_score_codex":0.000009173447,"about_ca_topic_score_gemma":0.0000011128758,"teacher_disagreement_score":0.5325431,"about_ca_system_score_codex":0.000075145515,"about_ca_system_score_gemma":0.000089355635,"threshold_uncertainty_score":0.49787804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093011774,0.0401688,0.45643044,0.05702741,0.17090656,0.00069381937,0.0000038388143,0.00030392178,0.18145345],"genre_scores_gemma":[0.96110946,0.0027682711,0.008042234,0.00062813016,0.026871214,0.000003689914,0.00001312769,0.00001539255,0.0005484914],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979981,0.00051733444,0.00068025984,0.00013449605,0.0005396258,0.00013019044],"domain_scores_gemma":[0.99667305,0.0005060813,0.000678905,0.0007956799,0.0012648978,0.00008141075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010382556,0.00011499103,0.0002210316,0.00015778177,0.00017339521,0.00060810056,0.0021549773,0.000073645555,0.000007170012],"category_scores_gemma":[0.00013747394,0.00011146039,0.000081857506,0.0001992298,0.00005313946,0.0004971254,0.00062337494,0.00036527673,0.00002093848],"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.00017256998,0.00069414155,0.003512783,0.000017754326,0.00073898566,0.00020150666,0.008367343,0.034758497,0.00029787252,0.17009713,0.36930144,0.41184],"study_design_scores_gemma":[0.00079303386,0.00008146822,0.0024410277,0.00051296526,0.000012077249,0.0007637029,0.00024565696,0.07233314,0.00021746385,0.001327221,0.9210813,0.00019093389],"about_ca_topic_score_codex":0.000019914465,"about_ca_topic_score_gemma":0.0000030363128,"teacher_disagreement_score":0.86809766,"about_ca_system_score_codex":0.00012239747,"about_ca_system_score_gemma":0.000102437276,"threshold_uncertainty_score":0.58639276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7719012,0.027321521,0.19846264,0.0015963,0.00046615416,0.000078680234,0.0000023109271,0.0000134662205,0.00015773528],"genre_scores_gemma":[0.97700393,0.0021293492,0.020709803,0.000043660893,0.00007872419,0.0000015143426,0.0000012606471,0.000006091227,0.000025638212],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998796,0.00017029299,0.00050406007,0.00010504847,0.00034274804,0.000081876555],"domain_scores_gemma":[0.99704945,0.0010953209,0.0006639318,0.00027973572,0.0008534565,0.00005807833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140072,0.000080211255,0.00022539798,0.00011140192,0.00006660902,0.000314907,0.000745734,0.00004233317,0.000001999625],"category_scores_gemma":[0.00042846415,0.00007275201,0.000043569675,0.00014135003,0.00004349346,0.0006307402,0.00032259754,0.00013922514,2.7658015e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020263533,0.0007501537,0.610348,0.00021291921,0.00201505,0.00027600199,0.015957879,0.15508616,0.023256829,0.13675508,0.0012013426,0.05393797],"study_design_scores_gemma":[0.0067260438,0.00029718608,0.11149844,0.0068225716,0.00020470346,0.0061793905,0.008104936,0.83553886,0.008911986,0.005331394,0.009489189,0.00089531613],"about_ca_topic_score_codex":0.00009607342,"about_ca_topic_score_gemma":0.000011054058,"teacher_disagreement_score":0.6804527,"about_ca_system_score_codex":0.000038980943,"about_ca_system_score_gemma":0.000099029035,"threshold_uncertainty_score":0.30366555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74530625,0.015073605,0.22349837,0.0016869941,0.0047872574,0.00055585656,0.000022431443,0.00036075505,0.008708495],"genre_scores_gemma":[0.9943683,0.00095707807,0.003925876,0.000061374594,0.00054935826,0.000014863299,0.00003556688,0.000029896162,0.000057687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984703,0.00022039471,0.00056213886,0.00010179763,0.0004978811,0.00014749695],"domain_scores_gemma":[0.99825656,0.000254689,0.0002736531,0.0003953789,0.0007425162,0.000077185585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539307,0.00013338677,0.0002191993,0.0001663255,0.000067807385,0.00019142129,0.00038627288,0.000100826386,0.000017092701],"category_scores_gemma":[0.00008614107,0.00013632042,0.00010094602,0.00019121036,0.00003104839,0.00022102662,0.000040410203,0.00033720426,0.0000138293435],"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.00017825715,0.00017644583,0.010036889,0.000038048656,0.0010024908,0.00003338379,0.00034889605,0.9411654,0.027779378,0.005594005,0.0080190515,0.0056277676],"study_design_scores_gemma":[0.0011008456,0.00008003812,0.014891374,0.00076967315,0.000058010413,0.0002565608,0.00016638677,0.9296119,0.0026097542,0.00018445146,0.05000333,0.00026762893],"about_ca_topic_score_codex":0.0000044954463,"about_ca_topic_score_gemma":0.0000033992214,"teacher_disagreement_score":0.24906206,"about_ca_system_score_codex":0.00019751124,"about_ca_system_score_gemma":0.000050450817,"threshold_uncertainty_score":0.55589855},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03209643,0.00383774,0.9620469,0.00044021403,0.0009948708,0.00030853474,0.00001044829,0.00008882759,0.00017601578],"genre_scores_gemma":[0.8371157,0.0012059622,0.1608626,0.000021977592,0.00065946043,0.000025891219,0.000031379666,0.00004087376,0.000036157802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812055,0.00010459046,0.00077031436,0.00010365132,0.0006835217,0.00021735516],"domain_scores_gemma":[0.9971953,0.00038246214,0.0003094134,0.00032184864,0.0016612062,0.0001297858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092656555,0.00013119617,0.00022744591,0.0003595592,0.00010247032,0.00020022907,0.0010723784,0.00009891167,0.000005759971],"category_scores_gemma":[0.000049407543,0.00013369082,0.00008722619,0.00026700372,0.000044774453,0.0007064877,0.00008253036,0.00036432888,0.000012812087],"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.000024910789,0.00003566456,0.000054650256,0.000013490518,0.00013245596,0.0000030116605,0.0016520725,0.93583137,0.00094272837,0.0010818788,0.000099484634,0.060128313],"study_design_scores_gemma":[0.0016308952,0.000038560585,0.00005724498,0.00089567824,0.000011878485,0.000050569084,0.0017717641,0.9869596,0.0023897714,0.0013893067,0.004664976,0.00013980152],"about_ca_topic_score_codex":0.00009442367,"about_ca_topic_score_gemma":0.000030350348,"teacher_disagreement_score":0.80501926,"about_ca_system_score_codex":0.00046484167,"about_ca_system_score_gemma":0.00011432956,"threshold_uncertainty_score":0.5451753},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054412395,0.6747058,0.043842047,0.00053021824,0.09969179,0.0069443523,0.0014290998,0.00033392617,0.118110366],"genre_scores_gemma":[0.9340191,0.061048247,0.00013247153,0.000058309313,0.0022507012,0.00028400525,0.00042608124,0.00010437847,0.0016767151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961671,0.00039509943,0.0020373438,0.00023327651,0.00080524804,0.0003618986],"domain_scores_gemma":[0.99588084,0.0007751643,0.0011234725,0.00082579814,0.0012607004,0.00013402506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001239656,0.0004292822,0.0009851407,0.0004584016,0.00007631067,0.00019578749,0.0024754554,0.0005926027,0.00008390359],"category_scores_gemma":[0.000051994102,0.00045057328,0.0004059729,0.0002222656,0.00011427808,0.00037015995,0.00018534317,0.0014198322,0.00006275252],"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.00019070726,0.00021852033,0.00014070234,0.00012185934,0.0006027107,0.000018257771,0.001233607,0.8150642,0.00003401028,0.00019759152,0.18003748,0.0021403262],"study_design_scores_gemma":[0.0018607733,0.00008617771,0.00007127385,0.0016611152,0.000047030542,0.00020786558,0.00024317107,0.15423915,0.000033744353,0.00006324203,0.8410016,0.00048489717],"about_ca_topic_score_codex":0.000146317,"about_ca_topic_score_gemma":0.00020804386,"teacher_disagreement_score":0.8796067,"about_ca_system_score_codex":0.0010521229,"about_ca_system_score_gemma":0.00016674711,"threshold_uncertainty_score":0.9997946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06475051,0.0037833233,0.92778975,0.00054519647,0.002098567,0.00070480094,0.000007003201,0.00005440851,0.00026646166],"genre_scores_gemma":[0.978033,0.0003174885,0.021068357,0.000041786203,0.0003754321,0.000072093484,0.000009634758,0.000024836372,0.000057361165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616414,0.00077875226,0.0014508717,0.00022535231,0.0010398257,0.00034105926],"domain_scores_gemma":[0.9927757,0.0017544641,0.001189889,0.0013014823,0.0027897137,0.00018874598],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0060985396,0.00018011365,0.00036667858,0.00094872183,0.00014327468,0.0005935255,0.0066169086,0.0001397841,0.0000016568713],"category_scores_gemma":[0.00028474728,0.0001718697,0.00012876558,0.0004526832,0.00006936956,0.0016534906,0.00040008256,0.0005081812,0.0000072274343],"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.0009019464,0.0011162298,0.006665496,0.000037208814,0.00047493482,0.0000671603,0.01119781,0.78012836,0.007597013,0.1285156,0.0005762563,0.062722],"study_design_scores_gemma":[0.0017092443,0.00021644276,0.0030436423,0.00057492853,0.00000446459,0.00011664961,0.001277087,0.9831823,0.00055522623,0.00020766082,0.008896851,0.00021548761],"about_ca_topic_score_codex":0.0002957698,"about_ca_topic_score_gemma":0.00011216071,"teacher_disagreement_score":0.9132825,"about_ca_system_score_codex":0.0005668248,"about_ca_system_score_gemma":0.00015693776,"threshold_uncertainty_score":0.9987578},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24288402,0.006428878,0.7485113,0.0009829511,0.00060953933,0.00033201877,0.00006151108,0.00006772515,0.00012205711],"genre_scores_gemma":[0.7825682,0.001279862,0.21580486,0.000032204167,0.00011995338,0.0000038958115,0.0001621031,0.000013068984,0.00001586027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970122,0.00051747396,0.0010417046,0.00023159041,0.0010468701,0.0001501839],"domain_scores_gemma":[0.9929163,0.00058156997,0.0011103274,0.0026940047,0.0025586768,0.00013916467],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0015719881,0.00014779807,0.00032268968,0.00034312738,0.0002784139,0.00021173555,0.009374331,0.00008355498,0.000003240215],"category_scores_gemma":[0.00013984733,0.0001274171,0.00006784726,0.00033964438,0.00006479067,0.001746409,0.001653103,0.0002710315,0.000003833911],"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.0015587127,0.010114733,0.033716206,0.00021311242,0.0023454803,0.000056617646,0.04359258,0.4262764,0.24646237,0.09848167,0.084842145,0.052339964],"study_design_scores_gemma":[0.001280564,0.00017883761,0.007347121,0.00066278956,0.000014156815,0.00016949259,0.00050234917,0.9772295,0.0011214194,0.000081699,0.01125219,0.00015991401],"about_ca_topic_score_codex":0.00040927756,"about_ca_topic_score_gemma":0.000010310686,"teacher_disagreement_score":0.5509531,"about_ca_system_score_codex":0.00010252927,"about_ca_system_score_gemma":0.00045873955,"threshold_uncertainty_score":0.99598545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29168954,0.00045940498,0.70426226,0.001576259,0.0010636686,0.0005207435,0.00001701296,0.000025718675,0.00038536548],"genre_scores_gemma":[0.97848827,0.00029163566,0.020885536,0.00006865116,0.000112935784,0.000057036556,0.00003773802,0.00001272175,0.00004545428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969277,0.00041290862,0.0013730658,0.0001660627,0.0009060687,0.000214188],"domain_scores_gemma":[0.9929394,0.0015662805,0.0014933712,0.0012796549,0.0025773009,0.00014399135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030380092,0.00014224983,0.0004916227,0.0011373266,0.000074611824,0.00015132691,0.005212637,0.0001449952,0.000014744085],"category_scores_gemma":[0.00018925633,0.00013075207,0.00024424572,0.0008856869,0.00009681587,0.00058471004,0.00027088315,0.0006637358,0.000001965782],"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.00052142836,0.0009788041,0.09845677,0.000033588796,0.0009744892,0.0000072239013,0.0009627249,0.8570596,0.017431952,0.0033052901,0.0010394462,0.019228665],"study_design_scores_gemma":[0.0018837402,0.00007374269,0.0144726625,0.0001202056,0.000031186988,0.0000071355707,0.000031815784,0.97985786,0.000723878,0.0000060407024,0.0026806649,0.00011107428],"about_ca_topic_score_codex":0.000060587197,"about_ca_topic_score_gemma":0.000082470295,"teacher_disagreement_score":0.68679875,"about_ca_system_score_codex":0.00012035865,"about_ca_system_score_gemma":0.00036682168,"threshold_uncertainty_score":0.9686463},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05625199,0.0011493191,0.93654,0.0036575554,0.0007105974,0.0003386545,0.000008637835,0.000047277368,0.0012959536],"genre_scores_gemma":[0.94331515,0.000031031697,0.055278346,0.0010705661,0.0002613106,0.000007773148,0.0000227451,0.0000075099915,0.000005582291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980974,0.00015430535,0.00079031184,0.00019244554,0.00058054965,0.00018497111],"domain_scores_gemma":[0.9965864,0.00025519566,0.0009854616,0.0004930738,0.0016110141,0.000068864785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082208606,0.00015118383,0.00026975744,0.0004813424,0.00009589109,0.00027224567,0.003577608,0.00008412605,4.8990086e-7],"category_scores_gemma":[0.00001273207,0.00013787641,0.000099818615,0.00049307256,0.000011824973,0.0009944486,0.0002113772,0.00026103502,0.0000020096106],"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.0008958719,0.00248157,0.001998383,0.00020222936,0.00063996937,0.000015094975,0.06274897,0.52666676,0.0211476,0.30498272,0.00012185892,0.07809898],"study_design_scores_gemma":[0.002928989,0.00020663343,0.015999986,0.00078510994,0.000020693862,0.00041476983,0.0044972594,0.96613234,0.0006111492,0.0035841665,0.00451305,0.00030586604],"about_ca_topic_score_codex":0.0004204927,"about_ca_topic_score_gemma":0.00010506253,"teacher_disagreement_score":0.88706315,"about_ca_system_score_codex":0.00021038212,"about_ca_system_score_gemma":0.000104503866,"threshold_uncertainty_score":0.66481453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10630141,0.0031046518,0.8893882,0.00003577873,0.00057673035,0.00019467068,0.000007621019,0.00017769034,0.0002132394],"genre_scores_gemma":[0.9781043,0.0015963663,0.020104533,0.0000075158646,0.00010778975,0.000028143215,0.000009244505,0.000037105117,0.0000049863465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978848,0.00028490674,0.0011371014,0.00008689552,0.00047131345,0.00013496581],"domain_scores_gemma":[0.99787915,0.00022101028,0.0005830573,0.0004714505,0.00078595604,0.000059352813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005834338,0.00015949855,0.00035930442,0.00035219773,0.000101059515,0.00006087593,0.000836117,0.000093488896,0.0000044725457],"category_scores_gemma":[0.000113713766,0.00015947664,0.00011930837,0.00023593684,0.000057459296,0.00058881805,0.00008718292,0.00033542034,0.0000031740321],"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.000023282228,0.000037557176,0.0004909445,0.000013961481,0.00019727186,0.000010571338,0.00040169724,0.9947573,0.0030061633,0.00030642084,0.0000069782254,0.00074785005],"study_design_scores_gemma":[0.00048768,0.000017463391,0.00027746812,0.00021093426,0.000047709138,0.00034238526,0.00045247164,0.9826204,0.015067329,0.000018230969,0.00031669735,0.00014118291],"about_ca_topic_score_codex":0.00019575037,"about_ca_topic_score_gemma":0.000028667075,"teacher_disagreement_score":0.8718029,"about_ca_system_score_codex":0.00065358874,"about_ca_system_score_gemma":0.000038319613,"threshold_uncertainty_score":0.65032685},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39854488,0.00089027226,0.5943033,0.00090778497,0.004610345,0.000073426985,9.549542e-7,0.00004792505,0.0006211081],"genre_scores_gemma":[0.9700909,0.00023470433,0.028671896,0.000151641,0.0007748459,0.00000797444,0.000015262243,0.000015335892,0.000037404294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973745,0.0004426466,0.0009777762,0.00020723998,0.00079575775,0.00020212495],"domain_scores_gemma":[0.9965804,0.00020883864,0.0008681751,0.0010128615,0.0011980118,0.00013166372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013872011,0.00015489313,0.00023503526,0.00047954315,0.00008884226,0.00065329834,0.0032636093,0.00015149236,0.0000076234915],"category_scores_gemma":[0.000075510776,0.00014661763,0.00009197718,0.00037201552,0.000062166655,0.0008630588,0.0001918908,0.0005609804,0.0000044844874],"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.000011333566,0.00018737778,0.0006378963,3.8370962e-7,0.000024450224,0.00001513114,0.00019986666,0.8772984,0.010834567,0.107229166,0.00012964559,0.0034317658],"study_design_scores_gemma":[0.00045507844,0.000037546037,0.0005805232,0.000067469045,0.00000258379,0.00017862457,0.00007511468,0.99199,0.00047437075,0.000034028362,0.0059635816,0.00014108488],"about_ca_topic_score_codex":0.00013219875,"about_ca_topic_score_gemma":0.00013400047,"teacher_disagreement_score":0.5715461,"about_ca_system_score_codex":0.00012533576,"about_ca_system_score_gemma":0.000096346404,"threshold_uncertainty_score":0.62997705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008007178,0.0021144117,0.82824045,0.018959224,0.028796691,0.0006139095,0.0000045605448,0.00018965962,0.113073915],"genre_scores_gemma":[0.9815137,0.0007614684,0.0013441353,0.0008363327,0.015179616,0.000004504537,0.000004028261,0.0000091279735,0.0003471022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99753857,0.00034597277,0.0008543873,0.00015198527,0.00093266874,0.0001764048],"domain_scores_gemma":[0.9968057,0.0002941735,0.0009796286,0.0008627973,0.0009454084,0.000112273236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009728098,0.0001468408,0.00027367639,0.00022407447,0.000090511756,0.0004770109,0.004497953,0.00009947441,0.000030686453],"category_scores_gemma":[0.000043322212,0.00013288147,0.00013533651,0.00022291715,0.000035845034,0.0006607296,0.00017815984,0.00045651986,0.000053776243],"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.00012270223,0.00033186958,0.00014091589,0.0000012202677,0.00016941105,0.00008399459,0.00077739544,0.09613597,0.000052567473,0.4282741,0.14569268,0.32821718],"study_design_scores_gemma":[0.0013289666,0.00050672475,0.0020474687,0.00061719684,0.000014505774,0.00059049216,0.00012441387,0.41229865,0.00014191966,0.0020015289,0.57999027,0.0003378729],"about_ca_topic_score_codex":0.000010323471,"about_ca_topic_score_gemma":0.0000032809003,"teacher_disagreement_score":0.9735065,"about_ca_system_score_codex":0.00020684439,"about_ca_system_score_gemma":0.00007501638,"threshold_uncertainty_score":0.83583915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96404165,0.0028029606,0.027899262,0.00052658096,0.00067275396,0.0002166224,0.000002959788,0.00017735794,0.0036598651],"genre_scores_gemma":[0.9812957,0.0017108934,0.016712176,0.000031054882,0.00016182463,0.000015184504,0.000005985085,0.000033498265,0.000033692664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842644,0.000086600434,0.00074430805,0.000097633914,0.00042118935,0.0002238176],"domain_scores_gemma":[0.99840415,0.00033908756,0.00032712432,0.00035104918,0.00052477093,0.000053817424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048407642,0.00016313346,0.00034041778,0.00025492467,0.00006489187,0.00004974894,0.0011040431,0.000100307414,0.000007111515],"category_scores_gemma":[0.000058350717,0.00014467628,0.000054573848,0.00040038314,0.00007249435,0.0004907113,0.00010466617,0.0005971666,0.000006653112],"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.00007879964,0.00002990248,0.001894731,0.000007662171,0.00015467909,0.000059691523,0.0008081009,0.99361616,0.00006590854,0.00074385956,0.00032525478,0.0022152662],"study_design_scores_gemma":[0.001665254,0.000121478515,0.0040934496,0.0021084172,0.00001864436,0.0009033717,0.003066496,0.98065954,0.00007480924,0.00023785539,0.006695957,0.000354731],"about_ca_topic_score_codex":0.000032724016,"about_ca_topic_score_gemma":0.00012333338,"teacher_disagreement_score":0.017254055,"about_ca_system_score_codex":0.0003071715,"about_ca_system_score_gemma":0.000040419658,"threshold_uncertainty_score":0.58997273},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006478888,0.0072134854,0.98350745,0.0009836141,0.0015037226,0.0001927826,0.000007263455,0.000037287602,0.00007547926],"genre_scores_gemma":[0.96052027,0.0022880537,0.036259465,0.00042681335,0.0003814131,0.0000391555,0.000009490499,0.000014925565,0.00006043636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777997,0.0005073252,0.0008393349,0.00019213412,0.0004817069,0.0001995443],"domain_scores_gemma":[0.9963141,0.00065263605,0.00089331344,0.00065850734,0.001330464,0.00015097373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355082,0.00015011728,0.00035879004,0.00017725052,0.00017824529,0.00017593116,0.0021077448,0.000118231896,0.0000030563065],"category_scores_gemma":[0.000028722414,0.00013564924,0.00011632613,0.0001232616,0.00015177215,0.00036511628,0.00014351399,0.00021486216,0.0000013866802],"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.00025177267,0.00047322357,0.00042209058,0.000003861125,0.00054922694,0.000081414015,0.0012413309,0.67999107,0.00029870792,0.07664095,0.002114741,0.23793162],"study_design_scores_gemma":[0.0019378216,0.00017799526,0.00013411026,0.000060506496,0.000011778681,0.0010743911,0.00007099873,0.963018,0.000035474888,0.00017521369,0.03317745,0.00012625688],"about_ca_topic_score_codex":0.000035815545,"about_ca_topic_score_gemma":0.0000063135385,"teacher_disagreement_score":0.95404136,"about_ca_system_score_codex":0.00011254975,"about_ca_system_score_gemma":0.00010109266,"threshold_uncertainty_score":0.55316156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9257334,0.002529047,0.061899964,0.0024354765,0.0013647603,0.0002457537,0.000002655664,0.00036369893,0.005425269],"genre_scores_gemma":[0.97687036,0.0008174509,0.021892669,0.00013077183,0.00024187544,0.0000044600984,0.000013572093,0.000018758272,0.000010100091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984161,0.00011647596,0.00079314195,0.0000908026,0.00038065616,0.00020278814],"domain_scores_gemma":[0.9986273,0.00016008448,0.00023504796,0.000395822,0.0005120218,0.000069696645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007521833,0.00013663867,0.00027007514,0.00020785135,0.0000283865,0.00011824259,0.0011549791,0.00012887559,0.000005799414],"category_scores_gemma":[0.00008574277,0.00013318764,0.000045222085,0.00024272945,0.000030404317,0.00077386224,0.00006903563,0.0005687954,0.000008766938],"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.00009214816,0.00007764584,0.002858114,0.000005517191,0.00008156424,0.0000151925815,0.00033959554,0.9436071,0.0008919885,0.015956072,0.00021184757,0.035863206],"study_design_scores_gemma":[0.00089792477,0.00016985735,0.009689117,0.0008950174,0.000016792348,0.00016630873,0.0008603635,0.973565,0.000105528205,0.005516626,0.00782454,0.00029295054],"about_ca_topic_score_codex":0.000009382542,"about_ca_topic_score_gemma":0.00005377368,"teacher_disagreement_score":0.051136967,"about_ca_system_score_codex":0.00027090116,"about_ca_system_score_gemma":0.000017228995,"threshold_uncertainty_score":0.5431234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7768247,0.009125981,0.18786234,0.0040916065,0.0012129997,0.00076865364,0.00011116977,0.00041712145,0.01958541],"genre_scores_gemma":[0.99536115,0.0008233196,0.003686578,0.000039548104,0.0000350613,0.000008159317,0.000008444279,0.000010497179,0.00002724337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986419,0.0001434206,0.00073589175,0.00006407403,0.00034285107,0.00007184951],"domain_scores_gemma":[0.9978739,0.00028159562,0.00044802728,0.00057368015,0.00076966285,0.000053109645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261134,0.00010529926,0.00023457054,0.00023237432,0.000042154887,0.000030623414,0.00077266974,0.00006601102,0.000011631832],"category_scores_gemma":[0.000140396,0.00009995348,0.0000680214,0.000113610426,0.00009016888,0.00031457495,0.00004943594,0.00029160685,0.0000032215912],"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.00060077437,0.0014090448,0.004751829,0.0001265601,0.0010037787,0.000009383649,0.00263207,0.30296528,0.027054265,0.5575082,0.010572516,0.09136631],"study_design_scores_gemma":[0.009592299,0.003072857,0.119127646,0.007666343,0.000270843,0.0012048295,0.0043599633,0.28118274,0.06522072,0.32203728,0.18372798,0.0025364894],"about_ca_topic_score_codex":0.000009824645,"about_ca_topic_score_gemma":0.0000033799029,"teacher_disagreement_score":0.23547089,"about_ca_system_score_codex":0.00013546325,"about_ca_system_score_gemma":0.000025439887,"threshold_uncertainty_score":0.40759847},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05821355,0.0027591987,0.93779933,0.000032645417,0.00042547853,0.00021263896,0.000017211187,0.000065371736,0.00047454445],"genre_scores_gemma":[0.9897928,0.0007670376,0.009229063,0.000015093209,0.00011452848,0.000016058122,0.00003937656,0.000017709564,0.000008307125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985202,0.000034156277,0.0009324702,0.00006708393,0.000320945,0.00012513086],"domain_scores_gemma":[0.9976211,0.0006194934,0.0006060763,0.00034311143,0.00077483064,0.000035366003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009330793,0.00010568832,0.00032366381,0.0006614891,0.000027260621,0.00004007795,0.00078780565,0.00014222266,0.0000059204845],"category_scores_gemma":[0.00006056825,0.000102866325,0.00019921812,0.00047205595,0.000039407823,0.00031239426,0.000056799552,0.00019698059,4.44339e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054353244,0.000025116773,0.0039104763,0.000012561485,0.0011487756,0.0000010864513,0.0000642023,0.98324156,0.0013325015,0.006119334,0.000049027032,0.0040410026],"study_design_scores_gemma":[0.00058827404,0.000085700616,0.01695957,0.00046016308,0.0003565901,0.000020061947,0.0004138297,0.9713776,0.001236919,0.0026124732,0.0056642904,0.00022448749],"about_ca_topic_score_codex":0.000010415688,"about_ca_topic_score_gemma":0.00002813887,"teacher_disagreement_score":0.9315793,"about_ca_system_score_codex":0.000178508,"about_ca_system_score_gemma":0.000009809782,"threshold_uncertainty_score":0.4194767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035969287,0.00039787908,0.9944612,0.0003350502,0.0005065465,0.00039247956,0.0000054571087,0.000030161178,0.00027434636],"genre_scores_gemma":[0.7209191,0.000058230555,0.27874956,0.000059294525,0.00009756746,0.00004007892,0.000030244926,0.000010165538,0.00003581284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756235,0.0003175209,0.00085004466,0.00017555848,0.0008730817,0.00022141909],"domain_scores_gemma":[0.99803644,0.00027655586,0.0006487228,0.0005878529,0.00033099824,0.000119436074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020615482,0.000120607314,0.00022658019,0.00023527491,0.00014779805,0.0002692618,0.0028052852,0.000055940847,0.0000033576532],"category_scores_gemma":[0.00011151165,0.000114599155,0.000067595174,0.00020178684,0.000054726625,0.0006919833,0.00022474823,0.00021330125,0.0000036839701],"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.000016089214,0.00030609738,0.00037925056,0.0000024851788,0.000039529066,0.000003828539,0.00096306344,0.99285305,0.000043556363,0.0040885154,0.000277231,0.00102733],"study_design_scores_gemma":[0.00080333254,0.00009082265,0.0006649487,0.00010418596,0.0000038024784,0.00013244718,0.00012535261,0.9969619,0.0000051984616,0.0001401595,0.00086187467,0.00010599464],"about_ca_topic_score_codex":0.000027467479,"about_ca_topic_score_gemma":0.000001805833,"teacher_disagreement_score":0.7173221,"about_ca_system_score_codex":0.00022734728,"about_ca_system_score_gemma":0.0001234335,"threshold_uncertainty_score":0.52129644},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003653051,0.013153852,0.92908216,0.0012126378,0.017547458,0.00041717762,0.000066293105,0.00003436217,0.038449503],"genre_scores_gemma":[0.8916263,0.054410115,0.005993984,0.00096842577,0.00566831,0.00009784923,0.0004240119,0.00008410796,0.04072688],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99601537,0.0003956723,0.0018166405,0.00030229441,0.0011512826,0.00031872428],"domain_scores_gemma":[0.99169445,0.00097588444,0.0030697118,0.0011824443,0.0028648148,0.00021267936],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010651292,0.00036436392,0.000829909,0.0003625782,0.00020386894,0.00060623523,0.0067009483,0.00043827496,0.000039012157],"category_scores_gemma":[0.000020556645,0.0003310078,0.00046344468,0.000186454,0.000115457035,0.000516476,0.00049668935,0.0008030716,0.00010460064],"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.00011214744,0.00015071065,0.000010620404,0.00001920176,0.000743512,0.00006028623,0.00041808558,0.011847598,0.000011557498,0.01068844,0.94367135,0.032266468],"study_design_scores_gemma":[0.000741865,0.00009988382,0.000003920255,0.0008125023,0.000030975185,0.000793601,0.000042473133,0.3426506,0.0000049059176,0.000064331245,0.6544744,0.00028054597],"about_ca_topic_score_codex":0.000051617975,"about_ca_topic_score_gemma":0.000005230892,"teacher_disagreement_score":0.9230882,"about_ca_system_score_codex":0.0002985739,"about_ca_system_score_gemma":0.00064503896,"threshold_uncertainty_score":0.99991417},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009563044,0.0149161825,0.0015431073,0.0007597831,0.06328614,0.00012556202,0.0009992478,0.0000067525607,0.9182676],"genre_scores_gemma":[0.046437178,0.014335402,0.0004655238,0.00039192542,0.002803012,0.000014947481,0.00032194782,0.00002415249,0.93520594],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978122,0.000039724517,0.0017711086,0.000115714436,0.00013932766,0.00012189693],"domain_scores_gemma":[0.994461,0.000069529975,0.003967975,0.00046315358,0.0009825645,0.00005578408],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012884758,0.00015019065,0.0005252873,0.0007038978,0.00008451037,0.0005024579,0.0017551108,0.00015931464,0.015766503],"category_scores_gemma":[0.00014261766,0.00015997952,0.00019687986,0.00009534287,0.00011470996,0.0010528704,0.00023578134,0.00024729583,0.24581721],"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.000017078666,0.000021600332,0.000042689873,0.000007987415,0.00038757976,3.7319896e-7,0.0008218149,0.00040225798,1.892797e-7,0.010125549,0.9879348,0.00023805494],"study_design_scores_gemma":[0.00037291145,0.000024955429,0.000031114116,0.00018026501,0.0000075421312,0.000016862581,0.0006552502,0.0003162529,0.0000031695263,0.00032004944,0.997928,0.00014363303],"about_ca_topic_score_codex":0.0001611825,"about_ca_topic_score_gemma":0.0000013911532,"teacher_disagreement_score":0.23005071,"about_ca_system_score_codex":0.0003109225,"about_ca_system_score_gemma":0.00006391947,"threshold_uncertainty_score":0.98513323},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013900666,0.004863533,0.9796697,0.00019525243,0.0009977488,0.00021000873,0.000031155392,0.00003790212,0.00009403088],"genre_scores_gemma":[0.94607234,0.0026603485,0.050694678,0.000024457113,0.00021756832,0.0000068961463,0.0002846806,0.000027706867,0.000011310608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864805,0.00005877586,0.0007649588,0.000094306095,0.00030712463,0.000126759],"domain_scores_gemma":[0.9981951,0.0003521603,0.0004665659,0.00039423455,0.0005234811,0.0000684735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015287207,0.000106735664,0.00017359962,0.00018018701,0.00005961548,0.000108742985,0.00057123334,0.00006437408,0.0000027636247],"category_scores_gemma":[0.00010124546,0.000108830594,0.000032123196,0.000084774336,0.000028135351,0.00061235967,0.000095921016,0.0001812686,7.831095e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040792987,0.000017298104,0.00016008965,0.000007877118,0.00010986993,0.0000018094564,0.00011461174,0.983582,0.00039411848,0.0007953979,0.0002657707,0.014510341],"study_design_scores_gemma":[0.0006268115,0.00002234892,0.0005278853,0.00025124167,0.000018569748,0.000043043416,0.00037748084,0.9950028,0.00008002014,0.00015965913,0.002789604,0.00010050586],"about_ca_topic_score_codex":0.000004119648,"about_ca_topic_score_gemma":0.000014799379,"teacher_disagreement_score":0.9321717,"about_ca_system_score_codex":0.00023173532,"about_ca_system_score_gemma":0.000020216508,"threshold_uncertainty_score":0.44379827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2165625,0.0005305823,0.78111947,0.0007623891,0.000628431,0.00025641956,0.000011951144,0.000013376208,0.00011490608],"genre_scores_gemma":[0.9880678,0.00034629932,0.011222381,0.000064397405,0.00013047246,0.000018111996,0.00001456879,0.000007501767,0.00012848739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806434,0.00025927564,0.0009898203,0.00013737312,0.00043366995,0.00011554104],"domain_scores_gemma":[0.9964347,0.00033401838,0.0012165975,0.00038187322,0.0015778025,0.00005500269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010954901,0.000114037306,0.00035037438,0.00053676206,0.000118324344,0.0001488206,0.0010917708,0.00005824774,0.000017084183],"category_scores_gemma":[0.00003104672,0.000096046024,0.00014862232,0.00030583044,0.000037055182,0.00063388306,0.00006448792,0.00012889708,0.0000013749291],"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.001985339,0.0008886472,0.13888039,0.000332361,0.021737259,0.000039351264,0.05977943,0.5117979,0.03169788,0.07474467,0.019947965,0.13816878],"study_design_scores_gemma":[0.009821107,0.0018849502,0.14621995,0.001177875,0.0006659652,0.0020851858,0.002905858,0.78266114,0.028748408,0.0022223552,0.020498395,0.001108803],"about_ca_topic_score_codex":0.00024647726,"about_ca_topic_score_gemma":0.000026944637,"teacher_disagreement_score":0.7715053,"about_ca_system_score_codex":0.00008089126,"about_ca_system_score_gemma":0.00008083569,"threshold_uncertainty_score":0.39166433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5229098,0.013932929,0.45174876,0.005226584,0.0032301522,0.0011087909,0.00033106556,0.00031351138,0.001198365],"genre_scores_gemma":[0.9695913,0.0003952364,0.029453224,0.000022888167,0.00019204835,0.0000267884,0.00027062526,0.000020661957,0.000027212003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838114,0.00010633437,0.0007832095,0.00009235263,0.0005430736,0.00009386863],"domain_scores_gemma":[0.99843985,0.00030781556,0.00031306958,0.0004896458,0.0004017102,0.000047920443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066562067,0.00009276314,0.00021018877,0.00016780927,0.00007413464,0.000054437147,0.0016034849,0.000064343345,0.000040952138],"category_scores_gemma":[0.00008150936,0.00009063483,0.00006713811,0.00014710579,0.000056745277,0.00038487112,0.00016318806,0.00029798207,0.0000025786958],"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.000104348714,0.00008115229,0.00031626108,0.00003230282,0.0002594411,0.000002365666,0.00035466117,0.921098,0.020037543,0.014700796,0.018050922,0.02496219],"study_design_scores_gemma":[0.0004047125,0.00008385136,0.00008547208,0.00007002469,0.000024551337,0.000052960557,0.00016958038,0.93321884,0.0009279891,0.0007291566,0.06414287,0.000089969166],"about_ca_topic_score_codex":0.000010162654,"about_ca_topic_score_gemma":7.073616e-7,"teacher_disagreement_score":0.44668147,"about_ca_system_score_codex":0.0001590779,"about_ca_system_score_gemma":0.000049216233,"threshold_uncertainty_score":0.3695981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023163054,0.019122474,0.9489532,0.003400644,0.002389779,0.0011502216,0.000118043456,0.00020624684,0.0014963337],"genre_scores_gemma":[0.9932278,0.0018414942,0.004448307,0.00000854579,0.000054637425,0.00034775276,0.000014720794,0.000019135383,0.000037608654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874586,0.000086576154,0.0006851365,0.000044876873,0.00036534373,0.00007221027],"domain_scores_gemma":[0.99777997,0.00033595762,0.000635253,0.00063503964,0.0005992333,0.000014526193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082961255,0.000078016616,0.00016166645,0.0002351414,0.00013875554,0.000025558036,0.0021318835,0.000026142867,0.000010883871],"category_scores_gemma":[0.00008882917,0.00006512851,0.00010612695,0.00012327111,0.00007501236,0.00020445639,0.00023791638,0.00033216574,6.225065e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001018257,0.000088845954,0.000051291277,0.000020662732,0.0004012672,0.0000010708054,0.0005605702,0.8972451,0.03784815,0.034987748,0.0032345327,0.025458949],"study_design_scores_gemma":[0.002147064,0.00039545985,0.00039084387,0.00040796102,0.00007417916,0.002295329,0.013988198,0.17431897,0.19988605,0.018027205,0.58757895,0.00048974616],"about_ca_topic_score_codex":0.000012613126,"about_ca_topic_score_gemma":6.867686e-7,"teacher_disagreement_score":0.97006476,"about_ca_system_score_codex":0.00027941636,"about_ca_system_score_gemma":0.00003468059,"threshold_uncertainty_score":0.39616057},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005717491,0.023409754,0.00063688157,0.0009257415,0.061941333,0.00013629242,0.001679566,0.0000066058137,0.91120666],"genre_scores_gemma":[0.032893132,0.01793942,0.00021202401,0.00041840065,0.0010683534,0.00003337585,0.00055251,0.000023392913,0.9468594],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99780035,0.000057935988,0.001737543,0.00011374731,0.00017510878,0.000115321585],"domain_scores_gemma":[0.99495304,0.00008702999,0.004010296,0.0004412534,0.000459915,0.00004846293],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014210162,0.00014041139,0.0005162252,0.0007845331,0.00012614533,0.000400651,0.0019154723,0.000098633835,0.05862881],"category_scores_gemma":[0.00011198325,0.00016012561,0.00021787999,0.00011409852,0.0000594583,0.00092177244,0.00038371712,0.00038795735,0.104574114],"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.00001774586,0.00002870933,0.000043299802,0.000007592755,0.0003903013,7.5429955e-7,0.00088796316,0.0039241416,1.3483098e-7,0.017311431,0.9770541,0.00033380534],"study_design_scores_gemma":[0.0003844881,0.000021680342,0.000024617262,0.00006547293,0.0000072265916,0.000021810316,0.0014115424,0.0003051181,8.5905583e-7,0.00021970547,0.997396,0.00014148725],"about_ca_topic_score_codex":0.0002253238,"about_ca_topic_score_gemma":7.786656e-7,"teacher_disagreement_score":0.06087298,"about_ca_system_score_codex":0.0005077275,"about_ca_system_score_gemma":0.0000723321,"threshold_uncertainty_score":0.9422317},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049679637,0.0010452202,0.9156891,0.022863237,0.0020234939,0.0036255126,0.00006107058,0.00008650113,0.00492619],"genre_scores_gemma":[0.99661136,0.000015876281,0.0024680581,0.00062060147,0.00008021902,0.00010024729,0.000019885008,0.000008699124,0.000075062046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598706,0.0015015454,0.0011204913,0.00013114327,0.0011567055,0.00010308381],"domain_scores_gemma":[0.99640965,0.0006113811,0.0015620089,0.0006599714,0.000692064,0.00006492944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002631323,0.000103286635,0.00028989234,0.00033706703,0.00008364675,0.00010904006,0.002951081,0.000042314816,0.00003775917],"category_scores_gemma":[0.000062105384,0.000103346676,0.00009157695,0.00054703024,0.000021481921,0.0002880154,0.00021446485,0.00028792775,0.000004997566],"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.00041532627,0.00037869375,0.0026554458,0.000018709965,0.000064282125,0.000010918378,0.0023983887,0.92940414,0.0008685254,0.057704717,0.0016563138,0.0044245254],"study_design_scores_gemma":[0.0036690417,0.00033485546,0.008352033,0.0006892953,0.0000042028278,0.000058232807,0.00055557734,0.9568829,0.00021026368,0.002021025,0.026969787,0.00025276857],"about_ca_topic_score_codex":0.0003338781,"about_ca_topic_score_gemma":0.000032154127,"teacher_disagreement_score":0.9469317,"about_ca_system_score_codex":0.00029704103,"about_ca_system_score_gemma":0.0003293837,"threshold_uncertainty_score":0.54838914},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064117885,0.012500886,0.00095770403,0.0012593189,0.08015593,0.00014287578,0.0014512782,0.000015353862,0.9034525],"genre_scores_gemma":[0.019641666,0.019266123,0.00015259213,0.00020720999,0.0012902846,0.000017166352,0.00034946812,0.000026309546,0.95904917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977888,0.000037157788,0.0017872724,0.00011292288,0.00014759928,0.00012623433],"domain_scores_gemma":[0.99521303,0.000114295224,0.003535381,0.0004248817,0.0006592866,0.000053147334],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013747558,0.00014478968,0.00053515285,0.00090082607,0.00007646604,0.00047870885,0.0016336462,0.00015208399,0.0063464586],"category_scores_gemma":[0.00018214314,0.00015750376,0.0002116043,0.00014304656,0.0000671857,0.00090616173,0.00025106285,0.00028958372,0.37271315],"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.000011590219,0.000015860807,0.000029458319,0.000010389133,0.00041212206,7.9422506e-7,0.00073548977,0.0022468125,1.5367601e-7,0.012912611,0.98333216,0.00029256212],"study_design_scores_gemma":[0.0003459445,0.000014060831,0.00005271389,0.00019351346,0.0000069602434,0.000010892685,0.00096993963,0.00047134951,0.0000013394695,0.00036717294,0.997428,0.00013814145],"about_ca_topic_score_codex":0.0002456977,"about_ca_topic_score_gemma":0.0000019553704,"teacher_disagreement_score":0.3663667,"about_ca_system_score_codex":0.0003022176,"about_ca_system_score_gemma":0.000059284754,"threshold_uncertainty_score":0.99456185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47701806,0.0014433567,0.514803,0.0014532914,0.0045820954,0.00022306586,0.000008070883,0.00012966288,0.00033937235],"genre_scores_gemma":[0.9954041,0.0007669869,0.0031539467,0.00002394973,0.00047119317,0.0000038884314,0.000090553986,0.00001958253,0.000065765766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693686,0.0006494772,0.0010880404,0.00026274592,0.00082557346,0.00023731228],"domain_scores_gemma":[0.99658823,0.00027965286,0.0011264606,0.0011492872,0.00077922165,0.00007716681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017700797,0.00015553516,0.00026627915,0.00067081366,0.000102518345,0.00044319892,0.003938637,0.00010372649,0.0000021339192],"category_scores_gemma":[0.000052196283,0.00015783477,0.000060144845,0.00092980935,0.00005467907,0.001616646,0.00059987896,0.0004192597,0.0000073494293],"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.000026345331,0.000054624285,0.00023376409,0.000001995227,0.000050883013,0.000026030997,0.0004377308,0.9860761,0.00051668944,0.004512647,0.00021132981,0.007851836],"study_design_scores_gemma":[0.0004965899,0.000029685802,0.0007334684,0.0002257118,0.000007065596,0.00023817274,0.0008795743,0.9966558,0.00002617654,0.00006918378,0.00050259905,0.00013594487],"about_ca_topic_score_codex":0.0002482539,"about_ca_topic_score_gemma":0.00003345852,"teacher_disagreement_score":0.51838607,"about_ca_system_score_codex":0.00027761207,"about_ca_system_score_gemma":0.000117857075,"threshold_uncertainty_score":0.7319034},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064117885,0.012500886,0.00095770403,0.0012593189,0.08015593,0.00014287578,0.0014512782,0.000015353862,0.9034525],"genre_scores_gemma":[0.019641666,0.019266123,0.00015259213,0.00020720999,0.0012902846,0.000017166352,0.00034946812,0.000026309546,0.95904917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977888,0.000037157788,0.0017872724,0.00011292288,0.00014759928,0.00012623433],"domain_scores_gemma":[0.99521303,0.000114295224,0.003535381,0.0004248817,0.0006592866,0.000053147334],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013747558,0.00014478968,0.00053515285,0.00090082607,0.00007646604,0.00047870885,0.0016336462,0.00015208399,0.0063464586],"category_scores_gemma":[0.00018214314,0.00015750376,0.0002116043,0.00014304656,0.0000671857,0.00090616173,0.00025106285,0.00028958372,0.37271315],"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.000011590219,0.000015860807,0.000029458319,0.000010389133,0.00041212206,7.9422506e-7,0.00073548977,0.0022468125,1.5367601e-7,0.012912611,0.98333216,0.00029256212],"study_design_scores_gemma":[0.0003459445,0.000014060831,0.00005271389,0.00019351346,0.0000069602434,0.000010892685,0.00096993963,0.00047134951,0.0000013394695,0.00036717294,0.997428,0.00013814145],"about_ca_topic_score_codex":0.0002456977,"about_ca_topic_score_gemma":0.0000019553704,"teacher_disagreement_score":0.3663667,"about_ca_system_score_codex":0.0003022176,"about_ca_system_score_gemma":0.000059284754,"threshold_uncertainty_score":0.99456185},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064117885,0.012500886,0.00095770403,0.0012593189,0.08015593,0.00014287578,0.0014512782,0.000015353862,0.9034525],"genre_scores_gemma":[0.019641666,0.019266123,0.00015259213,0.00020720999,0.0012902846,0.000017166352,0.00034946812,0.000026309546,0.95904917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977888,0.000037157788,0.0017872724,0.00011292288,0.00014759928,0.00012623433],"domain_scores_gemma":[0.99521303,0.000114295224,0.003535381,0.0004248817,0.0006592866,0.000053147334],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013747558,0.00014478968,0.00053515285,0.00090082607,0.00007646604,0.00047870885,0.0016336462,0.00015208399,0.0063464586],"category_scores_gemma":[0.00018214314,0.00015750376,0.0002116043,0.00014304656,0.0000671857,0.00090616173,0.00025106285,0.00028958372,0.37271315],"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.000011590219,0.000015860807,0.000029458319,0.000010389133,0.00041212206,7.9422506e-7,0.00073548977,0.0022468125,1.5367601e-7,0.012912611,0.98333216,0.00029256212],"study_design_scores_gemma":[0.0003459445,0.000014060831,0.00005271389,0.00019351346,0.0000069602434,0.000010892685,0.00096993963,0.00047134951,0.0000013394695,0.00036717294,0.997428,0.00013814145],"about_ca_topic_score_codex":0.0002456977,"about_ca_topic_score_gemma":0.0000019553704,"teacher_disagreement_score":0.3663667,"about_ca_system_score_codex":0.0003022176,"about_ca_system_score_gemma":0.000059284754,"threshold_uncertainty_score":0.99456185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9225088,0.014053231,0.055747494,0.0036247422,0.002300012,0.00093924796,0.000042039403,0.00024924535,0.0005352077],"genre_scores_gemma":[0.99555826,0.0029285308,0.0009205118,0.00011778436,0.0003045612,0.000043211367,0.000047561665,0.000045344357,0.00003422142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774027,0.00025489845,0.0011043443,0.00013456117,0.0005107765,0.00025512176],"domain_scores_gemma":[0.99790287,0.00046327882,0.00034383137,0.00064320915,0.0004981462,0.00014867687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053855,0.00019261515,0.00039192126,0.00044468578,0.00007420653,0.00018212531,0.0012039334,0.00015347751,0.0000045271486],"category_scores_gemma":[0.00012164249,0.00019988956,0.00010240923,0.0004301065,0.000050816416,0.00033663234,0.00017227327,0.0006232791,0.000021777485],"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.000082751016,0.000035566263,0.0003873822,0.000007973325,0.00020812196,0.000010399967,0.00044107967,0.99356884,0.0010955011,0.00089098566,0.0010547332,0.0022166618],"study_design_scores_gemma":[0.002001367,0.000034421737,0.0036533277,0.0005265883,0.00001739556,0.000118242446,0.0003152155,0.970145,0.000015210548,0.000027312031,0.022965116,0.0001808401],"about_ca_topic_score_codex":0.000042428113,"about_ca_topic_score_gemma":0.00007391184,"teacher_disagreement_score":0.07304949,"about_ca_system_score_codex":0.0003399631,"about_ca_system_score_gemma":0.000041296775,"threshold_uncertainty_score":0.81512594},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08873531,0.0008907739,0.90413344,0.00074883556,0.0048456197,0.00043450695,0.000022857555,0.00008397145,0.000104689425],"genre_scores_gemma":[0.9408722,0.000030066722,0.058375552,0.000040264393,0.00060153194,0.000009815758,0.000032341613,0.000011217916,0.00002703147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974803,0.0003953509,0.0009814525,0.00021002519,0.00075189275,0.0001809968],"domain_scores_gemma":[0.9959913,0.00043651168,0.0015856737,0.00080850517,0.0011233641,0.00005465935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024374833,0.00012308534,0.00025872566,0.00032116947,0.00019148893,0.00020296696,0.003052419,0.000055090117,0.000002067867],"category_scores_gemma":[0.00014111155,0.00011099901,0.00014358282,0.00046526786,0.00004550618,0.0001326366,0.0007625632,0.0001498782,0.0000019280894],"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.000094815645,0.00012627731,0.000278206,0.0000118005455,0.00034484567,0.0000045785573,0.0006515938,0.9948108,0.00032697385,0.0011393158,0.0015151021,0.00069568254],"study_design_scores_gemma":[0.001610288,0.000091841335,0.00021877617,0.0008862228,0.000038855876,0.000018823646,0.00034920653,0.9950439,0.00010371298,0.0000734135,0.0014749282,0.00009007899],"about_ca_topic_score_codex":0.00001517272,"about_ca_topic_score_gemma":0.0000010138781,"teacher_disagreement_score":0.85213685,"about_ca_system_score_codex":0.00016593495,"about_ca_system_score_gemma":0.000154096,"threshold_uncertainty_score":0.56722045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043493222,0.021037892,0.93461984,0.00012840921,0.0004960348,0.000042667754,0.000034463712,0.000052501444,0.000094976036],"genre_scores_gemma":[0.9926627,0.004585186,0.0023174735,0.000021325639,0.00017846508,0.000024443167,0.00013601396,0.000026594767,0.000047785074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877423,0.00007589352,0.00068567455,0.00010894528,0.00021822755,0.00013700897],"domain_scores_gemma":[0.9991609,0.00016604118,0.00019331051,0.00010403355,0.00032916624,0.000046592388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029976093,0.00013374767,0.00020178263,0.0003076135,0.000030038864,0.00016718515,0.00032530975,0.00010604343,0.0000040627515],"category_scores_gemma":[0.000027329885,0.00012703237,0.0000796555,0.00023292501,0.000017820017,0.0004004934,0.00002105582,0.00017296671,1.2117887e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008655041,0.000041286046,0.00043781416,0.000030499934,0.00029864503,0.000013292951,0.0005518404,0.9001212,0.0038977694,0.025021622,0.00074120576,0.06875829],"study_design_scores_gemma":[0.00046216403,0.000061033963,0.00053612434,0.0003299686,0.000018398825,0.00010919101,0.00010985214,0.98098695,0.0019680888,0.00017900216,0.015119123,0.00012009523],"about_ca_topic_score_codex":0.00022107284,"about_ca_topic_score_gemma":0.000039205897,"teacher_disagreement_score":0.9491695,"about_ca_system_score_codex":0.00029863988,"about_ca_system_score_gemma":0.000046808167,"threshold_uncertainty_score":0.51802295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013820606,0.006569862,0.9738342,0.0006248279,0.004418246,0.00017325337,3.912229e-7,0.00017119737,0.000387421],"genre_scores_gemma":[0.9519153,0.00009011611,0.04573046,0.00011501311,0.002032918,0.000004767181,0.000019167648,0.000027166847,0.000065083565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774694,0.0003304984,0.0010081488,0.00024154696,0.00041211225,0.00026074256],"domain_scores_gemma":[0.9969562,0.0006641903,0.00071344327,0.00042792485,0.001145265,0.000092926144],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020441173,0.00017709968,0.00027945175,0.00023385235,0.00028953783,0.0015050528,0.0026997463,0.00011843098,5.1735964e-7],"category_scores_gemma":[0.000091647315,0.00016481953,0.0001634173,0.00026211183,0.000045166926,0.0009377567,0.0002660081,0.0006568584,0.0000031968982],"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.00002271655,0.000034670684,0.000042596683,0.000011106052,0.00014575056,0.0000058427877,0.003059272,0.9612884,0.00048843096,0.007857433,0.00026458607,0.026779197],"study_design_scores_gemma":[0.0004289147,0.00009788409,0.000025482896,0.0004854549,0.000015013108,0.00013435214,0.00036693722,0.98958963,0.000059694194,0.0007383117,0.007889344,0.00016895456],"about_ca_topic_score_codex":0.000028958648,"about_ca_topic_score_gemma":0.0000012950563,"teacher_disagreement_score":0.9380947,"about_ca_system_score_codex":0.00019707852,"about_ca_system_score_gemma":0.00015116918,"threshold_uncertainty_score":0.9995315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3491229,0.04664265,0.58581334,0.0009536502,0.011277148,0.0012484437,0.00026308655,0.00049048435,0.0041883136],"genre_scores_gemma":[0.9953504,0.0020557928,0.0017564759,0.00007053501,0.00051043596,0.000058621536,0.00006793861,0.00005983128,0.00006994671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784553,0.000118307296,0.0011008169,0.00016842251,0.0005046372,0.0002622713],"domain_scores_gemma":[0.9971551,0.0013564675,0.0002673959,0.00036439247,0.000725206,0.00013149767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090931304,0.00022725621,0.00037648177,0.00029508272,0.000113232505,0.00045288348,0.0010932389,0.00010958839,0.000014332314],"category_scores_gemma":[0.00023440713,0.00020489753,0.00027254742,0.00012378387,0.00004538408,0.00066947745,0.00008620088,0.0005129323,0.000012321376],"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.0001036261,0.000058106216,0.00015080468,0.0001238261,0.00080984423,0.00002808724,0.00069576123,0.9703534,0.006869447,0.005014546,0.0014322409,0.014360299],"study_design_scores_gemma":[0.00079272577,0.000034129713,0.00014062635,0.0012840615,0.00003068537,0.0001240599,0.00014254574,0.94341105,0.002084215,0.00030238146,0.051453408,0.00020013272],"about_ca_topic_score_codex":0.00006524057,"about_ca_topic_score_gemma":0.000033965192,"teacher_disagreement_score":0.64622754,"about_ca_system_score_codex":0.00038260221,"about_ca_system_score_gemma":0.00008119344,"threshold_uncertainty_score":0.8355479},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049812146,0.019023791,0.9712964,0.0005353245,0.0023032895,0.00027891615,0.00009110049,0.00016162524,0.0013283083],"genre_scores_gemma":[0.99603534,0.0008336801,0.002134121,0.000014749825,0.000608012,0.00005949161,0.00003843106,0.00003773077,0.00023845471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883664,0.000020300156,0.0006383312,0.00009265551,0.00028933075,0.00012273637],"domain_scores_gemma":[0.99869114,0.00027891394,0.00012426435,0.000293547,0.0005516485,0.00006046067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051705254,0.00012985014,0.00018706564,0.0003067606,0.000051323335,0.00025054425,0.0007555539,0.000073226634,0.0000071026766],"category_scores_gemma":[0.00004221027,0.00011863855,0.0001292424,0.00016034681,0.000029019016,0.00021369489,0.000017765,0.00022909616,0.000017688242],"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.000048123187,0.00022911161,0.000081922946,0.0004878378,0.0017625712,0.000018369512,0.0016396028,0.59060013,0.25713953,0.12028966,0.016757641,0.010945475],"study_design_scores_gemma":[0.00080700754,0.000058864473,0.00017297613,0.0014006,0.00006640257,0.0007650079,0.00030699346,0.59054077,0.004354551,0.0007852923,0.40040207,0.00033943908],"about_ca_topic_score_codex":0.0000118262615,"about_ca_topic_score_gemma":0.0000017376193,"teacher_disagreement_score":0.9910541,"about_ca_system_score_codex":0.00016306744,"about_ca_system_score_gemma":0.00004509128,"threshold_uncertainty_score":0.48379397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24960963,0.02171971,0.7005166,0.004969204,0.00073615566,0.0005941078,0.00006307914,0.00064240285,0.02114914],"genre_scores_gemma":[0.99146366,0.0041700974,0.0041520298,0.00002478344,0.000015568356,0.000017101696,0.000007801436,0.000013898185,0.00013506897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991152,0.00007452072,0.00045676847,0.00006817968,0.00020661576,0.00007865896],"domain_scores_gemma":[0.99833494,0.0004593412,0.0002313959,0.00044026892,0.0004992135,0.000034826364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002423072,0.00010225541,0.00019633958,0.0003334564,0.00007207332,0.00013014153,0.0012808748,0.000060208073,0.000007049593],"category_scores_gemma":[0.00012157002,0.00008817206,0.000033459557,0.00017457214,0.000102067235,0.0005168186,0.00014337972,0.0002796346,0.0000029432942],"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.00031945438,0.00021216225,0.02122347,0.000086535794,0.0017892049,0.000028041504,0.0018725012,0.8482607,0.018946959,0.037709072,0.0036934202,0.065858476],"study_design_scores_gemma":[0.0070459596,0.0001776007,0.021215213,0.010734563,0.00016127827,0.0006609188,0.0058705932,0.58980995,0.04444622,0.005243657,0.313572,0.0010620435],"about_ca_topic_score_codex":0.000013806701,"about_ca_topic_score_gemma":0.000013721474,"teacher_disagreement_score":0.741854,"about_ca_system_score_codex":0.00011675699,"about_ca_system_score_gemma":0.000034377703,"threshold_uncertainty_score":0.35955524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011790646,0.0024115958,0.9700229,0.007048804,0.009043184,0.00012152443,0.0000017342611,0.000037561833,0.010133603],"genre_scores_gemma":[0.9895906,0.00009283591,0.008197478,0.0010350134,0.00043339783,0.000012344154,0.0000033908277,0.000005661594,0.000629312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800646,0.00033413057,0.0009543925,0.00012860025,0.0004246864,0.00015169926],"domain_scores_gemma":[0.99668866,0.00044451875,0.0008090934,0.00063479546,0.0013703819,0.000052551422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948958,0.000110947956,0.0002674624,0.00032522928,0.00011940504,0.00036285966,0.003028292,0.000087835375,0.000012355525],"category_scores_gemma":[0.00008362589,0.00009852158,0.00015679581,0.00032685173,0.000047037713,0.0004210037,0.0002508349,0.00026168287,0.000012922906],"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.00007046973,0.00018460174,0.0020686197,0.0000073498445,0.00040671477,0.000011759007,0.00027215824,0.13690715,0.00039856014,0.8225834,0.032743756,0.0043454976],"study_design_scores_gemma":[0.002148314,0.00012014156,0.0016975065,0.0011230231,0.000022508904,0.00048334769,0.000297969,0.44433188,0.00022056817,0.0037300687,0.5455891,0.00023557685],"about_ca_topic_score_codex":0.000118585755,"about_ca_topic_score_gemma":0.000027051525,"teacher_disagreement_score":0.9884115,"about_ca_system_score_codex":0.00018871391,"about_ca_system_score_gemma":0.00020106028,"threshold_uncertainty_score":0.56273705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10777276,0.031107103,0.85408884,0.0011871615,0.0012557652,0.0006493678,0.000060551018,0.000105042745,0.0037734245],"genre_scores_gemma":[0.99784213,0.00067105656,0.0010278955,0.000055129844,0.0000768281,0.000019656642,0.000018157423,0.00001219522,0.00027693805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893594,0.00006531269,0.0005544823,0.000062897765,0.0002861172,0.00009527208],"domain_scores_gemma":[0.99847037,0.00022557355,0.00027378244,0.00021945563,0.00077055645,0.000040294617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040077395,0.0001119394,0.00027084505,0.0002884701,0.00005666706,0.00013713192,0.00065876433,0.000038738424,0.000018906927],"category_scores_gemma":[0.000023292685,0.00008557932,0.00013443259,0.00013057244,0.000035364792,0.00023147279,0.000013906265,0.00013560912,0.0000032626676],"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.001598735,0.0013573698,0.087577075,0.0006044542,0.03440379,0.00005344548,0.0048187603,0.71764463,0.09096489,0.017075839,0.026930619,0.01697041],"study_design_scores_gemma":[0.0029093777,0.00019897948,0.0042293663,0.0018816845,0.0003419256,0.000076010845,0.004373892,0.8453779,0.0019310808,0.0001871505,0.13815196,0.00034065582],"about_ca_topic_score_codex":0.000046222172,"about_ca_topic_score_gemma":0.000021675505,"teacher_disagreement_score":0.89006937,"about_ca_system_score_codex":0.000103331346,"about_ca_system_score_gemma":0.00003706478,"threshold_uncertainty_score":0.34898233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004729853,0.0011068216,0.9902099,0.0007783127,0.001733287,0.00018621527,3.5272913e-7,0.0000361018,0.0012191952],"genre_scores_gemma":[0.9917887,0.00054764183,0.0069044167,0.0001534121,0.00015484716,0.00003423474,0.000015873324,0.00001180339,0.0003891137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735093,0.0004945279,0.0011767739,0.00020717908,0.0005206634,0.00024989835],"domain_scores_gemma":[0.9956274,0.0012244886,0.0009815585,0.00045363564,0.0016486745,0.0000642575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010679623,0.00017171302,0.0003418181,0.00050897984,0.00015589588,0.00030348808,0.0024544634,0.00011707342,0.0000019234442],"category_scores_gemma":[0.00023497522,0.00016271054,0.00012856437,0.0004896617,0.000065166976,0.00038413098,0.00034697604,0.00038277477,0.000001303555],"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.000043648157,0.000077146105,0.00077031297,0.0000021767562,0.0000877113,0.0000058614355,0.0005446333,0.91933054,0.00011443222,0.07447787,0.00009688369,0.004448816],"study_design_scores_gemma":[0.0012151514,0.00006736798,0.00018183092,0.00052089716,0.000007618934,0.000020209478,0.00032399278,0.99427336,0.0002064056,0.000027113541,0.0030217604,0.00013427492],"about_ca_topic_score_codex":0.00010195243,"about_ca_topic_score_gemma":0.000047141708,"teacher_disagreement_score":0.9870588,"about_ca_system_score_codex":0.00037385634,"about_ca_system_score_gemma":0.00013962974,"threshold_uncertainty_score":0.6635143},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.416501,0.0015134452,0.5803488,0.000017007807,0.0010811238,0.00014083995,0.0000016246272,0.0000738091,0.0003223716],"genre_scores_gemma":[0.987113,0.00005269136,0.012523622,0.0000050724843,0.00023992226,0.0000057559555,0.000012160759,0.00003738329,0.000010379653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787503,0.00040952093,0.0009771727,0.00011634693,0.00046697588,0.00015492133],"domain_scores_gemma":[0.99753094,0.00024611357,0.00083898095,0.000295014,0.0010264643,0.0000624992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006842,0.00017937485,0.0003953135,0.00037241098,0.00009637934,0.00021133946,0.00059001264,0.00008121428,0.000001215749],"category_scores_gemma":[0.000034352845,0.0001702522,0.00006077771,0.00022412601,0.000045386354,0.0005580351,0.000051926818,0.00038529956,3.4930406e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006585456,0.0000163216,0.019637091,0.00012618696,0.0002708333,0.000008234988,0.00068071776,0.977168,0.0008399157,0.00055912015,0.000005439136,0.0006222394],"study_design_scores_gemma":[0.00065975613,0.0000493712,0.00032618458,0.0050918185,0.000051520416,0.00014215158,0.0027468984,0.98898023,0.0017237139,0.0000021895871,0.00009497279,0.00013117102],"about_ca_topic_score_codex":0.00012656908,"about_ca_topic_score_gemma":0.000002857674,"teacher_disagreement_score":0.570612,"about_ca_system_score_codex":0.0003845519,"about_ca_system_score_gemma":0.00006384086,"threshold_uncertainty_score":0.69426835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013918144,0.001154627,0.9943772,0.0008350536,0.0013361437,0.00030160515,8.2164746e-7,0.00007713381,0.0005256216],"genre_scores_gemma":[0.93625665,0.00010408329,0.06293207,0.00021296128,0.00010834042,0.000058435206,0.000020812542,0.000020345638,0.00028628655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732286,0.00038267567,0.0010030144,0.00026870795,0.0007601142,0.00026260127],"domain_scores_gemma":[0.99463457,0.0006758894,0.0013420638,0.00064087793,0.0026211797,0.000085411084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010977318,0.00022210812,0.00032415875,0.0005946227,0.00027409496,0.00040717688,0.002102556,0.00011547917,0.0000026002983],"category_scores_gemma":[0.00012384949,0.00019458843,0.00015659057,0.0005472564,0.00007288316,0.00013563591,0.0002682007,0.00032956037,6.8338994e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019143974,0.00016486374,0.00007739541,0.000006272259,0.00017734944,0.000003417575,0.00021566635,0.98585397,0.00002192349,0.011863977,0.00010449803,0.0013192211],"study_design_scores_gemma":[0.0019806472,0.00015317409,0.000055131284,0.00080948736,0.000025277583,0.000023586808,0.00013569868,0.9926716,0.00020919506,0.0000039747383,0.0037538134,0.00017838202],"about_ca_topic_score_codex":0.00006007502,"about_ca_topic_score_gemma":0.0000149283915,"teacher_disagreement_score":0.9348649,"about_ca_system_score_codex":0.0005584812,"about_ca_system_score_gemma":0.00022974091,"threshold_uncertainty_score":0.7935086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016308118,0.0020803572,0.9768765,0.0025274898,0.0016806937,0.00026233803,0.0000014393293,0.00003600869,0.00022705986],"genre_scores_gemma":[0.84511876,0.0016963425,0.15267217,0.000297292,0.00014239385,0.00002429487,0.0000068796417,0.000010269862,0.000031605778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796396,0.0003346063,0.0009364225,0.00019824416,0.00038856213,0.00017819987],"domain_scores_gemma":[0.9965154,0.0013423582,0.00076185184,0.0004685152,0.00085207,0.000059840768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010628954,0.00013992783,0.0002792821,0.000421251,0.000098674325,0.0003665446,0.0014890741,0.00008826585,0.0000010450291],"category_scores_gemma":[0.00016380486,0.00014149486,0.00007347819,0.00027504118,0.00003490045,0.00036906672,0.00026264685,0.00032027165,5.09821e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003936357,0.00009906658,0.00042839113,0.000006644809,0.000072218805,0.000005834767,0.00017926197,0.906075,0.000027515505,0.09084074,0.00014863518,0.0020773136],"study_design_scores_gemma":[0.0006702655,0.000042199004,0.00015646979,0.0008853862,0.000010421776,0.00005331021,0.000053690237,0.9959268,0.000119126285,0.0006130899,0.0013609283,0.000108285814],"about_ca_topic_score_codex":0.000025092831,"about_ca_topic_score_gemma":0.000002468241,"teacher_disagreement_score":0.82881063,"about_ca_system_score_codex":0.00018808947,"about_ca_system_score_gemma":0.00008641033,"threshold_uncertainty_score":0.57699937},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026714924,0.0031881004,0.967094,0.022051819,0.00075851317,0.00039111168,0.000014919301,0.000056320954,0.0061780475],"genre_scores_gemma":[0.917665,0.0003758385,0.08073244,0.00063775684,0.000082221224,0.00021909084,0.000045989073,0.000004424195,0.00023721252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981078,0.00029488205,0.00088105403,0.0001730493,0.00039230875,0.00015088773],"domain_scores_gemma":[0.9937029,0.0014934775,0.0009813537,0.0013807174,0.0023774887,0.00006408262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015135129,0.00014088133,0.00024986488,0.0003153535,0.00024216138,0.00033165782,0.0046976595,0.00009075883,0.000007773475],"category_scores_gemma":[0.00049057585,0.00013601988,0.000198802,0.00034962557,0.00012603037,0.0003388459,0.00030664538,0.00033757734,0.000006768544],"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.000038996757,0.00015383081,0.00047404223,0.00003060571,0.00014980475,0.0000011717891,0.0001399733,0.005837204,0.00015487136,0.9855831,0.004239101,0.003197283],"study_design_scores_gemma":[0.0009345901,0.000045030545,0.00028368126,0.00087207544,0.00003802633,0.00006890427,0.00020265425,0.045759074,0.0021312053,0.37909132,0.5703703,0.0002031066],"about_ca_topic_score_codex":0.000015125326,"about_ca_topic_score_gemma":0.0000016374754,"teacher_disagreement_score":0.91739786,"about_ca_system_score_codex":0.00011178778,"about_ca_system_score_gemma":0.00020820314,"threshold_uncertainty_score":0.8729498},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8075151,0.0010384498,0.18126835,0.0061558145,0.0012584636,0.0003697134,0.0000019469542,0.000015171535,0.002377012],"genre_scores_gemma":[0.99946016,0.000104795596,0.00026656853,0.000044368302,0.00009354451,0.000016948348,4.284233e-7,0.0000041850053,0.000009028387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99642164,0.0019605688,0.0005352763,0.00009083286,0.0008808697,0.000110812965],"domain_scores_gemma":[0.99383974,0.003913024,0.000423344,0.00043055136,0.0013591984,0.00003411608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072322446,0.00006582485,0.00016011004,0.0002760589,0.00006025176,0.00012691275,0.0024122111,0.0000332138,0.0000020415298],"category_scores_gemma":[0.00059319416,0.000045385183,0.00006457179,0.00032028294,0.00009079356,0.00027862602,0.00016132217,0.00036939842,0.000009470514],"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.00012564445,0.0001525062,0.0005498797,0.0000020855894,0.000060199145,0.000010055564,0.0009373106,0.094799705,0.00032271838,0.89676356,0.000037610826,0.006238748],"study_design_scores_gemma":[0.01562034,0.0017276417,0.054862905,0.013290085,0.00002724891,0.00043818017,0.0048699104,0.4051043,0.018311907,0.48162907,0.0034480742,0.0006703268],"about_ca_topic_score_codex":0.00012619709,"about_ca_topic_score_gemma":0.000011251506,"teacher_disagreement_score":0.41513446,"about_ca_system_score_codex":0.00020827299,"about_ca_system_score_gemma":0.00014192646,"threshold_uncertainty_score":0.4482529},"labels":[],"label_agreement":null}]}