{"meta":{"query_hash":"d0474043af5f","filters":{"venue":"Wireless Networks"},"cohort_total":146,"direct_labels_cover":0,"predictions_cover":146,"exported":146,"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/d0474043af5f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Wireless+Networks"},"results":[{"id":"W1191960083","doi":"10.1007/s11276-015-1028-7","title":"QoE in video streaming over wireless networks: perspectives and research challenges","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"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; Quality of experience; Service provider; Multimedia; Wireless network; Wireless; Quality of service; Real Time Streaming Protocol; Mobile device; Computer network; Service (business); Video quality; Software deployment; Metric (unit); Telecommunications; The Internet; World Wide Web","score_opus":0.08883615033826404,"score_gpt":0.36138246402786645,"score_spread":0.2725463136896024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1191960083","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022804862,0.78552085,0.0989978,0.06730534,0.0018362554,0.000066640845,0.00018654505,0.00013335283,0.023148384],"genre_scores_gemma":[0.40871903,0.5315338,0.03550361,0.003451523,0.016260209,0.0001289213,0.00015487458,0.000070334885,0.0041775825],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972892,0.0010382124,0.0001705447,0.0003851683,0.0008810534,0.00023577783],"domain_scores_gemma":[0.9762575,0.017381128,0.0008646014,0.00047681978,0.0044099404,0.00060995866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0080554355,0.0009256106,0.0021955215,0.0017990652,0.00073930976,0.007617154,0.0022834484,0.0032037592,0.0025724582],"category_scores_gemma":[0.012692144,0.000439639,0.0004216796,0.0031167532,0.0029687777,0.009445378,0.00157342,0.0032076414,0.00064766174],"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.00028250384,0.00040447016,0.0075799506,0.0033303613,0.00015440185,0.0002719335,0.0009035007,0.015282379,0.0038387044,0.22023371,0.016586134,0.73113185],"study_design_scores_gemma":[0.00006941145,0.0007601124,0.007484075,0.0043109218,0.00021813775,0.0012102057,0.008029088,0.23985872,0.0045298915,0.5842234,0.14908336,0.00022267825],"about_ca_topic_score_codex":0.0022037704,"about_ca_topic_score_gemma":0.0017943914,"teacher_disagreement_score":0.0080554355,"about_ca_system_score_codex":0.0017748096,"about_ca_system_score_gemma":0.0015766593,"threshold_uncertainty_score":0.042601705},"labels":[],"label_agreement":null},{"id":"W1481274137","doi":"10.1023/a:1019130823870","title":"Scheduling of real‐time traffic in IEEE 802.11 wireless LANs","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"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 science; Computer network; Asynchronous communication; Distributed coordination function; Access control; Network packet; Wireless network; Wireless; Protocol (science); Network allocation vector; IEEE 802.11; Distributed computing; Telecommunications","score_opus":0.011181004358788006,"score_gpt":0.2389932913511009,"score_spread":0.2278122869923129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481274137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4917767,0.002611312,0.4927793,0.0009396801,0.0008366432,0.00014179926,0.00014962483,0.0017589043,0.009006127],"genre_scores_gemma":[0.97534096,0.00040128027,0.021182619,0.00007164438,0.0001697762,0.000043102827,0.00009911141,0.00009178132,0.0025996664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998665,0.0004659917,0.000114813694,0.00017019188,0.0003262109,0.00025791532],"domain_scores_gemma":[0.9957677,0.002139106,0.00041355193,0.0005392322,0.0008204435,0.0003199473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027022543,0.0005396,0.00050805265,0.00071502564,0.0010002409,0.0016799403,0.0012922364,0.0005504726,0.0017148628],"category_scores_gemma":[0.006457261,0.00048377019,0.00019571705,0.00060775666,0.0007693824,0.001657983,0.00056479394,0.00085214555,0.00036880933],"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.0033463107,0.00063010043,0.0050626374,0.00036203695,0.0001327738,0.0004662515,0.0011354795,0.57350415,0.0631673,0.060767487,0.011300491,0.280125],"study_design_scores_gemma":[0.000057984744,0.00023054899,0.0007853975,0.000015267122,0.000028560547,0.00010812984,0.0001507672,0.97096014,0.011056873,0.011536078,0.0050417073,0.000028642895],"about_ca_topic_score_codex":0.0023291404,"about_ca_topic_score_gemma":0.002777485,"teacher_disagreement_score":0.0027022543,"about_ca_system_score_codex":0.0012389666,"about_ca_system_score_gemma":0.0010896153,"threshold_uncertainty_score":0.014291048},"labels":[],"label_agreement":null},{"id":"W1502585607","doi":"10.1023/a:1019166304306","title":"User mobility profile prediction: An adaptive fuzzy inference approach","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Base station; Code division multiple access; Quality of service; Channel (broadcasting); Wireless; Computer network; Wireless network; Cellular network; Real-time computing; Telecommunications","score_opus":0.030715485955684137,"score_gpt":0.2781505992398886,"score_spread":0.24743511328420448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502585607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03295218,0.00028575942,0.96479756,0.0002246188,0.00006426973,0.00004315787,0.000067623005,0.0002871631,0.001277617],"genre_scores_gemma":[0.8817691,0.00024664018,0.11585569,0.00013574417,0.00008946286,0.00009773183,0.00014215478,0.000028103477,0.0016353889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994159,0.00012303707,0.000054959866,0.00017807016,0.00015796525,0.000070151495],"domain_scores_gemma":[0.9977187,0.0015647986,0.00010572696,0.00009577101,0.00046979927,0.000045259785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018220857,0.00066523015,0.0011749717,0.0010011833,0.0005659625,0.0010006374,0.0018385515,0.0013268908,0.0013412934],"category_scores_gemma":[0.004789502,0.0004948787,0.00090837065,0.0007549533,0.00041880287,0.0012712738,0.0005224322,0.0013292657,0.0002865523],"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.00035049545,0.0002772815,0.0036584602,0.0000901775,0.00017998034,0.0001436444,0.00014004363,0.76860493,0.0028523696,0.003979015,0.001339926,0.21838368],"study_design_scores_gemma":[0.0000035917649,0.000008245132,0.00016783783,0.0000029052344,0.000010741903,0.000005539153,0.000003970712,0.99894994,0.00017350033,0.00064189587,0.000028487475,0.0000034406146],"about_ca_topic_score_codex":0.022516077,"about_ca_topic_score_gemma":0.014328873,"teacher_disagreement_score":0.022516077,"about_ca_system_score_codex":0.0010350612,"about_ca_system_score_gemma":0.000721129,"threshold_uncertainty_score":0.044770002},"labels":[],"label_agreement":null},{"id":"W1516570183","doi":"10.1023/a:1019137530714","title":"LMDS/LMCS hub interconnection alternatives and multiple access issues","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","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":"Nortel (Canada); Carleton University","funders":"","keywords":"Computer science; Computer network; Local Multipoint Distribution Service; Polling; Network packet; Constant bitrate; Quality of service; Dynamic bandwidth allocation; Scheduling (production processes); Wireless broadband; Wireless; Variable bitrate; Wireless network; Telecommunications","score_opus":0.027081189004874114,"score_gpt":0.3147278274153444,"score_spread":0.2876466384104703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516570183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26379904,0.0050163763,0.43544194,0.00855909,0.0012862654,0.00012458125,0.00027534002,0.000742803,0.28475457],"genre_scores_gemma":[0.95433974,0.0007054769,0.01607013,0.00017406761,0.00034000876,0.000040635623,0.000059643182,0.000042747633,0.028227504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955755,0.00014471365,0.000014884407,0.000058386122,0.00013840961,0.00008598696],"domain_scores_gemma":[0.9986105,0.00060957525,0.0001417181,0.00015274809,0.00042860923,0.000056975005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075953227,0.0003880171,0.00034595665,0.0004747918,0.0009074001,0.0018320959,0.0011111674,0.0011360656,0.022337226],"category_scores_gemma":[0.0021813367,0.00019439026,0.0002827241,0.0007906216,0.00054970157,0.0025616505,0.0005668919,0.0006860897,0.0011583549],"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.0006878479,0.00018143585,0.0022159852,0.0004205239,0.00005051436,0.0005740474,0.00024387856,0.07083851,0.030943925,0.64149374,0.01702851,0.23532097],"study_design_scores_gemma":[0.00015126605,0.00066970283,0.0048724315,0.00018335706,0.00021728905,0.0013375267,0.0013582691,0.4836991,0.06155474,0.3277078,0.11816062,0.00008796351],"about_ca_topic_score_codex":0.0013496232,"about_ca_topic_score_gemma":0.003179529,"teacher_disagreement_score":0.022337226,"about_ca_system_score_codex":0.001229828,"about_ca_system_score_gemma":0.00038489813,"threshold_uncertainty_score":0.07472545},"labels":[],"label_agreement":null},{"id":"W1536706045","doi":"10.1023/a:1019174606123","title":"Design and evaluation of multicast GFR for supporting TCP/IP over hybrid wired/wireless ATM","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Multicast; Unicast; Xcast; Source-specific multicast; Pragmatic General Multicast; Frame (networking); Distributed computing; IP multicast","score_opus":0.023078047763722957,"score_gpt":0.27270110147815857,"score_spread":0.2496230537144356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536706045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5441427,0.00052198826,0.446488,0.00015204493,0.000103231076,0.0005023527,0.00014865502,0.003161995,0.0047790254],"genre_scores_gemma":[0.92155105,0.000080145255,0.07693466,0.000039844534,0.000018184039,0.00009390925,0.000057063233,0.000053123083,0.0011720128],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992192,0.00023297744,0.00004602256,0.00010431973,0.00029239594,0.00010514564],"domain_scores_gemma":[0.9979886,0.00064566947,0.0002230857,0.00017766448,0.00082184677,0.00014321558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300945,0.00042200997,0.00044475668,0.00050239416,0.00043059938,0.0006703214,0.0018205399,0.00050750934,0.0015425069],"category_scores_gemma":[0.0024484128,0.00026946398,0.00019195276,0.0002541319,0.00027045413,0.00050446193,0.0003000989,0.0003052389,0.0001954336],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003287724,0.0011037599,0.013562505,0.00069345307,0.00027989992,0.00034735948,0.00030126466,0.21756786,0.44059843,0.006903456,0.0024487048,0.3129056],"study_design_scores_gemma":[0.00021600696,0.002496514,0.0026954703,0.00001446505,0.00020113507,0.00013873736,0.00006911223,0.85323846,0.13746442,0.00048774248,0.0029549848,0.000022853785],"about_ca_topic_score_codex":0.0028518655,"about_ca_topic_score_gemma":0.0029010093,"teacher_disagreement_score":0.0028518655,"about_ca_system_score_codex":0.0009497427,"about_ca_system_score_gemma":0.00066730904,"threshold_uncertainty_score":0.0070343018},"labels":[],"label_agreement":null},{"id":"W1544319190","doi":"10.1023/a:1020329719692","title":"A Homogeneous PCS network with Markov Call Arrival Process and Phase Type Cell Residence Time","year":2002,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"University of New South Wales; University of Windsor","keywords":"Handover; Computer science; Call duration; Call blocking; Markov process; Computer network; Residence time (fluid dynamics); Channel (broadcasting); Blocking (statistics); Call management; Markov chain; Phase-type distribution; Distribution (mathematics); Call control; Real-time computing; Mathematics; Statistics","score_opus":0.014937328179997046,"score_gpt":0.2537436457440505,"score_spread":0.23880631756405346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544319190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6569,0.0010185821,0.32045802,0.0011775752,0.00019016331,0.00023270774,0.0016907727,0.0011867731,0.017145453],"genre_scores_gemma":[0.9848734,0.00047724225,0.008263025,0.000049070695,0.00007053045,0.000040063325,0.00014924319,0.000028739532,0.0060486486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929357,0.00017202912,0.000018997458,0.00020113566,0.00011328024,0.00020098245],"domain_scores_gemma":[0.9985788,0.0006092345,0.00020410653,0.00016627912,0.00028934068,0.00015211584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005410322,0.0006804581,0.0010540582,0.0009229053,0.0011964496,0.0021370954,0.0018078551,0.001195803,0.002996589],"category_scores_gemma":[0.0020146756,0.0006645471,0.00044575622,0.0019333077,0.0015357352,0.0016693345,0.00096585345,0.00069000013,0.0006178519],"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.0009786852,0.0001488562,0.0030236987,0.00012119248,0.0000598738,0.00096474466,0.00017737788,0.89778775,0.0076733315,0.06852797,0.0040561487,0.016480405],"study_design_scores_gemma":[0.00004291906,0.00007251732,0.0005802943,0.0000057622387,0.00004896712,0.00013978173,0.00006444886,0.98868036,0.000966492,0.008612824,0.00076670945,0.000018869327],"about_ca_topic_score_codex":0.034474414,"about_ca_topic_score_gemma":0.021750007,"teacher_disagreement_score":0.034474414,"about_ca_system_score_codex":0.0024706703,"about_ca_system_score_gemma":0.001483834,"threshold_uncertainty_score":0.06854749},"labels":[],"label_agreement":null},{"id":"W1551967728","doi":"10.1023/a:1025956401962","title":"Non-Uniform Traffic Issues in DCA Wireless Multimedia Networks","year":2003,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Handover; Computer network; Quality of service; Call Admission Control; Channel (broadcasting); Hot spot (computer programming); Channel allocation schemes; Call blocking; Cellular network; Wireless network; Population; Wireless; Telecommunications","score_opus":0.01692419323507835,"score_gpt":0.2747202746073654,"score_spread":0.25779608137228704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551967728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2745476,0.008742644,0.6692906,0.0053445646,0.0011521563,0.00022551393,0.0002500486,0.0005220546,0.03992484],"genre_scores_gemma":[0.9717557,0.0021872,0.017817536,0.00038619037,0.00074887444,0.00010821607,0.00010800347,0.00016094587,0.006727268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774134,0.0006570848,0.00014909958,0.00026377937,0.0008162768,0.00037242656],"domain_scores_gemma":[0.97334224,0.018250419,0.0016647943,0.0020359345,0.0041371575,0.0005694478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046087517,0.0006676332,0.0011738094,0.0014706329,0.002874043,0.0037454383,0.002438007,0.0020065927,0.0034432164],"category_scores_gemma":[0.033615224,0.0011677936,0.0004089676,0.002615619,0.0021984691,0.0071276287,0.002488695,0.0021411486,0.00049490103],"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.0007159103,0.00029054208,0.009248073,0.00059578056,0.00010116429,0.0018577651,0.0011221111,0.20822977,0.017240798,0.6019622,0.011282012,0.14735386],"study_design_scores_gemma":[0.000027222166,0.00009858035,0.0019140275,0.000062178835,0.00008207677,0.0011162296,0.00057082344,0.861304,0.0069920714,0.12169715,0.0060823383,0.0000533627],"about_ca_topic_score_codex":0.0024172843,"about_ca_topic_score_gemma":0.0033567445,"teacher_disagreement_score":0.0046087517,"about_ca_system_score_codex":0.0031129895,"about_ca_system_score_gemma":0.0010442581,"threshold_uncertainty_score":0.02437371},"labels":[],"label_agreement":null},{"id":"W1593326840","doi":"10.1023/a:1009095931769","title":"A Pseudo-Bayesian ALOHA Algorithm with Mixed Priorities","year":2001,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"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; Computer network; Channel (broadcasting); Base station; Transmission (telecommunications); Protocol (science); Wireless; Real-time computing; Throughput; Telecommunications","score_opus":0.013716247002410947,"score_gpt":0.24524214150645274,"score_spread":0.2315258945040418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593326840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004705486,0.00031399805,0.99016225,0.00037630694,0.00017947977,0.00018192823,0.000108144864,0.0005532235,0.003419219],"genre_scores_gemma":[0.1080729,0.00023116304,0.8847432,0.00039652336,0.00017632305,0.00045695264,0.00021672453,0.00012059697,0.0055856085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657494,0.001486939,0.00019481567,0.0004650315,0.00089027995,0.00038788232],"domain_scores_gemma":[0.994044,0.0038911614,0.00017172327,0.00041364017,0.0011828481,0.00029660767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038400257,0.0011748385,0.0020295533,0.0018332099,0.0022425468,0.0027283824,0.0051190034,0.0028122906,0.009304564],"category_scores_gemma":[0.011330867,0.0010457155,0.0012134451,0.0023283416,0.0011130463,0.0027797709,0.002987812,0.0023143245,0.002790575],"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.0014205391,0.00044560645,0.0012451403,0.00037667292,0.00022874492,0.00016567043,0.00038810537,0.37816572,0.0039002532,0.1005961,0.013924286,0.4991432],"study_design_scores_gemma":[0.00022376952,0.000114616865,0.000074075215,0.000032601787,0.000050232866,0.000115329676,0.00006092454,0.9514796,0.0012202001,0.043545883,0.0030473385,0.000035460052],"about_ca_topic_score_codex":0.005012158,"about_ca_topic_score_gemma":0.007492621,"teacher_disagreement_score":0.009304564,"about_ca_system_score_codex":0.0016323801,"about_ca_system_score_gemma":0.004883677,"threshold_uncertainty_score":0.031126857},"labels":[],"label_agreement":null},{"id":"W1717826710","doi":"10.1007/s11276-015-1055-4","title":"Performance analysis of threshold digital relaying M2M cooperative networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Phase-shift keying; Computer science; Fading; Keying; Nakagami distribution; Binary number; Modulation (music); Algorithm; Bit error rate; Power (physics); Telecommunications; Mathematics; Arithmetic; Decoding methods; Physics","score_opus":0.039983502921819375,"score_gpt":0.2633315330109311,"score_spread":0.22334803008911172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717826710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.522936,0.0032503784,0.43831357,0.0015550671,0.00010129095,0.00013943334,0.0003485403,0.0003773962,0.032978337],"genre_scores_gemma":[0.99274904,0.0004010691,0.0048832064,0.000055520482,0.000029550272,0.000027078064,0.000042044852,0.00001620179,0.001796223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987086,0.00045721172,0.00003835327,0.00013684458,0.00038936915,0.00026971273],"domain_scores_gemma":[0.9910615,0.0068490854,0.00047243072,0.00033686426,0.0011187444,0.00016141991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023155767,0.00073515135,0.0007492133,0.0010072198,0.0006179181,0.0014612213,0.0009942416,0.0009773034,0.0021547743],"category_scores_gemma":[0.010670199,0.00029154093,0.0002966065,0.0012829694,0.0011574869,0.0011463375,0.0014447331,0.00050339865,0.00030660388],"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.00049411296,0.00006950776,0.0019885341,0.00017808417,0.00005292241,0.00022006422,0.00029318166,0.88325626,0.012103258,0.08063612,0.001268984,0.01943889],"study_design_scores_gemma":[0.000011999295,0.000118418066,0.0004288074,0.000015534373,0.00002214368,0.00010522662,0.00006623787,0.9877439,0.001887028,0.009253261,0.00033436887,0.0000130889775],"about_ca_topic_score_codex":0.003736918,"about_ca_topic_score_gemma":0.002711044,"teacher_disagreement_score":0.003736918,"about_ca_system_score_codex":0.0027000706,"about_ca_system_score_gemma":0.0012919854,"threshold_uncertainty_score":0.019590497},"labels":[],"label_agreement":null},{"id":"W1810698100","doi":"10.1007/s11276-015-1099-5","title":"Truthful budget constrained auction for device-to-device relaying packet allocation","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Network packet; Auction algorithm; Computer network; Resource allocation; Probabilistic logic; Quality of service; Auction theory; Bidding; Microeconomics; Revenue equivalence","score_opus":0.06392773536777661,"score_gpt":0.3051142505420399,"score_spread":0.24118651517426326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810698100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01716902,0.0005220723,0.972926,0.00089771533,0.00015509903,0.00022611453,0.0002810897,0.00034646914,0.007476443],"genre_scores_gemma":[0.89769644,0.0006283432,0.091267064,0.0003392057,0.00018675369,0.00034392547,0.00022499228,0.00014935138,0.00916391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99298966,0.0037101945,0.00032995173,0.0008340517,0.0010987394,0.0010373974],"domain_scores_gemma":[0.9841595,0.011855581,0.0007709135,0.0015837115,0.0009520346,0.0006781581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010761278,0.0025553883,0.0044436264,0.0012463994,0.001330735,0.005623211,0.0058339313,0.004385781,0.0084738815],"category_scores_gemma":[0.026098661,0.0017107982,0.001365301,0.0026089028,0.0032650137,0.006442337,0.0037542845,0.0036046582,0.0012492958],"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.0013125931,0.00024519858,0.0004320245,0.0005517952,0.00018254659,0.00052013446,0.00030387737,0.68496716,0.003071285,0.2661916,0.008512769,0.03370896],"study_design_scores_gemma":[0.00010172337,0.00006706419,0.0000802276,0.000026573252,0.000031857115,0.0001268236,0.000029182196,0.89351124,0.0004670205,0.10488199,0.00064839807,0.000027883103],"about_ca_topic_score_codex":0.0020304953,"about_ca_topic_score_gemma":0.0018265445,"teacher_disagreement_score":0.010761278,"about_ca_system_score_codex":0.0034451233,"about_ca_system_score_gemma":0.0036041643,"threshold_uncertainty_score":0.056911767},"labels":[],"label_agreement":null},{"id":"W1965604350","doi":"10.1007/s11276-006-0799-2","title":"A rendezvous reservation protocol for energy constrained wireless infrastructure networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Rendezvous; Computer network; Quality of service; Network packet; Energy consumption; Reservation; Packet forwarding; Latency (audio); Wireless; Wireless sensor network; Distributed computing; Telecommunications","score_opus":0.01045419804266753,"score_gpt":0.24405300938538096,"score_spread":0.23359881134271343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965604350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091790214,0.0025125751,0.87961143,0.0013926593,0.000978171,0.00048192998,0.00029905484,0.0034382846,0.019495679],"genre_scores_gemma":[0.82513404,0.0009518328,0.1600307,0.00028723472,0.0002685659,0.00038636493,0.0003818387,0.00021198133,0.01234747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996569,0.00007153687,0.000028042146,0.00004407629,0.00012922056,0.00007026578],"domain_scores_gemma":[0.99921143,0.00033381482,0.000049090937,0.00018348395,0.00013864327,0.00008348292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008908202,0.00046708665,0.00068875344,0.0005915217,0.0012537284,0.0009138197,0.0016825381,0.00054702885,0.0029522101],"category_scores_gemma":[0.0018182192,0.00030252544,0.00030145238,0.0005497047,0.0008301099,0.0014105438,0.0015596814,0.0013241823,0.0005977523],"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.002323069,0.0003786029,0.001105372,0.00047028155,0.00019251491,0.0013909546,0.0011585823,0.16612805,0.10024853,0.22735086,0.028401963,0.47085133],"study_design_scores_gemma":[0.00039726731,0.00046150354,0.0005269448,0.00004503859,0.00017321989,0.00089160295,0.00031585922,0.88702464,0.021733532,0.044987906,0.043295167,0.00014730409],"about_ca_topic_score_codex":0.0024575023,"about_ca_topic_score_gemma":0.0039264527,"teacher_disagreement_score":0.0029522101,"about_ca_system_score_codex":0.0004909697,"about_ca_system_score_gemma":0.00076215045,"threshold_uncertainty_score":0.009876132},"labels":[],"label_agreement":null},{"id":"W1968335870","doi":"10.1007/s11276-011-0391-2","title":"Intelligent wireless mesh path selection algorithm using fuzzy decision making","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Concordia University","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Order One Network Protocol; Selection algorithm; Path (computing); Fuzzy logic; Channel (broadcasting); Algorithm; Wireless network; Routing (electronic design automation); Distributed computing; Wireless; Selection (genetic algorithm); Telecommunications; Machine learning; Artificial intelligence","score_opus":0.026751715617471184,"score_gpt":0.2583315686383826,"score_spread":0.23157985302091139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968335870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039313044,0.00014442991,0.9582173,0.000108318665,0.00006765369,0.00006684924,0.000031148833,0.00019544459,0.0018557712],"genre_scores_gemma":[0.7189504,0.00011551261,0.2789722,0.00007289862,0.000039682778,0.00014220411,0.000064538726,0.000022318178,0.0016202411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996044,0.00008248587,0.00003134398,0.000086879256,0.00013956093,0.00005539699],"domain_scores_gemma":[0.9992473,0.00041811887,0.00006133668,0.000031441385,0.00021040524,0.000031429066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012243213,0.0005623552,0.0008250323,0.0009831716,0.00067407714,0.0007867808,0.0010622744,0.00076116004,0.001541998],"category_scores_gemma":[0.0016653389,0.000313519,0.00056412735,0.00065281714,0.00037509034,0.0007558708,0.00045503082,0.00047999423,0.00013041105],"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.00036340643,0.00019608904,0.0022985819,0.00011727317,0.00013099748,0.00016755183,0.0001253415,0.7077657,0.009616432,0.009160495,0.0018097565,0.2682484],"study_design_scores_gemma":[0.00001818455,0.000044883403,0.00015049084,0.0000043793884,0.000020660793,0.000021372533,0.000010323143,0.99693656,0.0010978621,0.0015072488,0.00018217713,0.0000058206456],"about_ca_topic_score_codex":0.0034562815,"about_ca_topic_score_gemma":0.0032414987,"teacher_disagreement_score":0.0034562815,"about_ca_system_score_codex":0.0008435944,"about_ca_system_score_gemma":0.00077374757,"threshold_uncertainty_score":0.006872356},"labels":[],"label_agreement":null},{"id":"W1971493099","doi":"10.1007/s11276-013-0626-5","title":"Efficient and practical resource block allocation for LTE-based D2D network via graph coloring","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"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; Graph coloring; Reuse; Graph; Distributed computing; Scheduling (production processes); Computer network; Throughput; Mathematical optimization; Theoretical computer science; Wireless; Mathematics; Telecommunications","score_opus":0.0072538837413604,"score_gpt":0.21328063409371859,"score_spread":0.20602675035235818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971493099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05497241,0.00047214943,0.93535763,0.0004258105,0.00011841358,0.00010710414,0.0002837789,0.00047760384,0.0077851545],"genre_scores_gemma":[0.8802085,0.00034606457,0.11599406,0.0001304939,0.000040093862,0.00011205122,0.00014734671,0.00005195176,0.0029694242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994804,0.00018394565,0.000012843098,0.00006527279,0.00010866848,0.0001488365],"domain_scores_gemma":[0.999416,0.00031684403,0.000036953246,0.00008674491,0.00009286424,0.000050727784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048546135,0.0006993875,0.0008839428,0.00040985338,0.0006270533,0.0007958839,0.00087408494,0.00042853082,0.0022216209],"category_scores_gemma":[0.0013218436,0.0002635703,0.0003099727,0.0010408241,0.00044606059,0.0007385014,0.0007962548,0.00044480353,0.00027240202],"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.00031784218,0.0000887618,0.0005158726,0.00010078396,0.000039397728,0.00008968511,0.000056435616,0.9009464,0.007521254,0.027915757,0.0075741624,0.054833636],"study_design_scores_gemma":[0.000019482331,0.000023554388,0.000105256535,0.0000029906203,0.0000069669745,0.000026336653,0.000014986336,0.9902103,0.0005714461,0.008425253,0.00058787107,0.000005484234],"about_ca_topic_score_codex":0.008036969,"about_ca_topic_score_gemma":0.015514146,"teacher_disagreement_score":0.008036969,"about_ca_system_score_codex":0.0013057148,"about_ca_system_score_gemma":0.0021787954,"threshold_uncertainty_score":0.015980363},"labels":[],"label_agreement":null},{"id":"W1972421518","doi":"10.1007/s11276-014-0774-2","title":"Bandwidth-aware routing and admission control for efficient video streaming over MANETs","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"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; Computer network; Bandwidth (computing); Quality of service; Admission control; Backup; Multipath routing; Handover; Video quality; Real-time computing; Distributed computing; Routing (electronic design automation); Routing protocol; Dynamic Source Routing","score_opus":0.00611654782247942,"score_gpt":0.22078866884170673,"score_spread":0.2146721210192273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972421518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07560525,0.0010756372,0.918958,0.00045702024,0.00026105277,0.00008789721,0.00005363465,0.00061420316,0.0028871999],"genre_scores_gemma":[0.9479708,0.00041905677,0.04910333,0.000069258254,0.0001507924,0.0000495708,0.00005203742,0.00004409154,0.0021409758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940324,0.00015299932,0.000038350492,0.00008980934,0.00019718743,0.00011847024],"domain_scores_gemma":[0.99857926,0.0008773407,0.00012464965,0.00010901945,0.00021890992,0.000090872076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100754,0.0005756242,0.0008192694,0.0008023057,0.00085079344,0.0010882242,0.0012851929,0.000612088,0.00089115516],"category_scores_gemma":[0.004292755,0.00037375538,0.00027903155,0.00076724193,0.0007419102,0.0012401732,0.0009890449,0.0011579087,0.0001474949],"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.0004310427,0.00023445222,0.0008479203,0.00010459024,0.00006970908,0.00017015249,0.00021553398,0.7866314,0.02575356,0.037098017,0.0025685474,0.14587502],"study_design_scores_gemma":[0.0000062724894,0.000021715887,0.000065854685,0.0000021785822,0.0000069560956,0.00001956443,0.000016113288,0.9941393,0.0010876423,0.0043928362,0.00023619212,0.000005366321],"about_ca_topic_score_codex":0.00389567,"about_ca_topic_score_gemma":0.005049001,"teacher_disagreement_score":0.00389567,"about_ca_system_score_codex":0.0010775088,"about_ca_system_score_gemma":0.00081444194,"threshold_uncertainty_score":0.007817864},"labels":[],"label_agreement":null},{"id":"W1972456124","doi":"10.1007/s11276-007-0077-y","title":"An efficient delay constrained scheduling scheme for IEEE 802.16 networks","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Adaptability; Queue; Scheme (mathematics); Simple (philosophy); Distributed computing; Real-time computing; Computer network; Mathematical optimization; Mathematics","score_opus":0.00811876012927952,"score_gpt":0.23958730119923183,"score_spread":0.2314685410699523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972456124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10857963,0.0011756344,0.8791001,0.0005600023,0.00060827535,0.00020506498,0.0002337997,0.00091202767,0.008625366],"genre_scores_gemma":[0.82279724,0.00040960673,0.17000249,0.000121488614,0.00015115451,0.00013251964,0.00015711095,0.00008472348,0.0061437525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993537,0.00017274462,0.000043899672,0.000067681314,0.00023150221,0.0001305194],"domain_scores_gemma":[0.99909866,0.0002816594,0.00010640704,0.00017598383,0.00025967736,0.00007774652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018165283,0.00062042585,0.0006945375,0.000518982,0.0007243766,0.0008970637,0.0011385438,0.00037156127,0.002565523],"category_scores_gemma":[0.0027710882,0.00027829298,0.00020601173,0.00073715806,0.0004478701,0.0010007531,0.00088699785,0.00070476654,0.00043569805],"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.0015164788,0.00033849367,0.0007455509,0.00016396005,0.00006728214,0.00014251863,0.00021659133,0.532848,0.03158771,0.05911927,0.01393413,0.35932],"study_design_scores_gemma":[0.000072963456,0.00014546636,0.00015754215,0.00001012451,0.000017046352,0.00006225119,0.000031490887,0.9776775,0.0045955903,0.012663251,0.0045484784,0.000018143464],"about_ca_topic_score_codex":0.002547062,"about_ca_topic_score_gemma":0.004936036,"teacher_disagreement_score":0.002565523,"about_ca_system_score_codex":0.0013053475,"about_ca_system_score_gemma":0.0023441748,"threshold_uncertainty_score":0.009606838},"labels":[],"label_agreement":null},{"id":"W1976204635","doi":"10.1007/s11276-012-0491-7","title":"Performance of energy detector in the presence of noise uncertainty in cognitive radio networks","year":2012,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Detector; Computer science; Noise (video); Gaussian noise; Energy (signal processing); Cognitive radio; Noise power; Detection theory; Signal-to-noise ratio (imaging); Decision rule; SIGNAL (programming language); Algorithm; Electronic engineering; Power (physics); Telecommunications; Artificial intelligence; Statistics; Physics; Mathematics; Engineering; Wireless","score_opus":0.012623745541037916,"score_gpt":0.22659557564672073,"score_spread":0.2139718301056828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976204635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7412294,0.0025121444,0.24389896,0.0015728628,0.00018702226,0.00005266519,0.00018035514,0.00047040937,0.0098962],"genre_scores_gemma":[0.99518424,0.00015445791,0.004062439,0.000060318725,0.000020418962,0.0000070366395,0.000034698005,0.000010878602,0.0004655246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713886,0.0011444621,0.000104470935,0.00043836105,0.00053069746,0.00064311235],"domain_scores_gemma":[0.9803688,0.016929053,0.0006233864,0.00041951565,0.001343998,0.00031523907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052460604,0.000936311,0.0015268786,0.00076783844,0.0008041043,0.0023359358,0.0013380628,0.002230922,0.0009652725],"category_scores_gemma":[0.02103394,0.0004757296,0.00035594983,0.0006309761,0.0016926659,0.001818112,0.0019099296,0.0009882903,0.0001532669],"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.003202016,0.00024871284,0.005756578,0.0002286629,0.00021549773,0.00041784288,0.00020032268,0.93109685,0.011709299,0.014559711,0.00076429726,0.031600226],"study_design_scores_gemma":[0.000040193852,0.00020080546,0.0010713531,0.000015910711,0.000054875276,0.00016756337,0.000068368325,0.9876658,0.0053443694,0.0052212267,0.00011980092,0.000029778548],"about_ca_topic_score_codex":0.0043757986,"about_ca_topic_score_gemma":0.0024531004,"teacher_disagreement_score":0.0052460604,"about_ca_system_score_codex":0.0013044359,"about_ca_system_score_gemma":0.0021466347,"threshold_uncertainty_score":0.027744114},"labels":[],"label_agreement":null},{"id":"W1976414427","doi":"10.1007/s11276-012-0413-8","title":"Joint power allocation and beamforming with users selection for cognitive radio networks via discrete stochastic optimization","year":2012,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cognitive radio; Beamforming; Optimization problem; Underlay; Power control; Transmitter power output; Mathematical optimization; Base station; Resource allocation; Interference (communication); Channel (broadcasting); Power (physics); Signal-to-noise ratio (imaging); Computer network; Algorithm; Wireless; Telecommunications; Transmitter; Mathematics","score_opus":0.009167856449451993,"score_gpt":0.21660604752253693,"score_spread":0.20743819107308492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976414427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010853272,0.0003338321,0.9864006,0.00037383824,0.000044029905,0.00004706111,0.000046136785,0.00009579339,0.001805461],"genre_scores_gemma":[0.8460216,0.00085131824,0.14693937,0.00027361026,0.00022774843,0.00038084856,0.00015351585,0.00008567324,0.005066263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979175,0.0010451988,0.00007096636,0.00022200697,0.00045302723,0.00029134576],"domain_scores_gemma":[0.99616677,0.003116404,0.00023877544,0.00010278491,0.00026203177,0.000113087335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981074,0.0015540487,0.0020704505,0.0007839134,0.0006588735,0.0018923421,0.001545646,0.0017996304,0.0016589194],"category_scores_gemma":[0.007499861,0.0013734931,0.001076888,0.0015199902,0.0020212606,0.0017909193,0.0018216982,0.0014517183,0.00032895693],"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.00008833693,0.000050606155,0.00018771437,0.000041256655,0.00005080248,0.000035995196,0.00002883947,0.97258353,0.00050780026,0.016283015,0.0006078536,0.009534363],"study_design_scores_gemma":[0.000015956213,0.000010847757,0.000034168785,0.000002510587,0.000006305279,0.0000059553604,0.000003699284,0.993749,0.00009266141,0.006005488,0.00006899165,0.000004507413],"about_ca_topic_score_codex":0.006416586,"about_ca_topic_score_gemma":0.0070472825,"teacher_disagreement_score":0.006416586,"about_ca_system_score_codex":0.001997587,"about_ca_system_score_gemma":0.002556372,"threshold_uncertainty_score":0.015765548},"labels":[],"label_agreement":null},{"id":"W1976430322","doi":"10.1007/s11276-006-9854-2","title":"Multi-radio diversity in wireless networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Computer network; Retransmission; Frame (networking); Link layer; Wireless network; Overhead (engineering); Wireless; Diversity combining; Physical layer; Resilience (materials science); Throughput; Telecommunications; Channel (broadcasting); Fading; Network packet","score_opus":0.018855037761211578,"score_gpt":0.23499614776316652,"score_spread":0.21614111000195493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976430322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028197052,0.053222287,0.878193,0.0027881057,0.001705273,0.00003496316,0.000086268505,0.00027467104,0.035498347],"genre_scores_gemma":[0.8449534,0.04155264,0.08073518,0.00091143715,0.006024367,0.00015203387,0.0001565464,0.00009641914,0.02541813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993088,0.00026372581,0.000022037142,0.00009354176,0.00023966774,0.00007219466],"domain_scores_gemma":[0.9974585,0.0017925533,0.00014674348,0.00023373583,0.00028934178,0.00007916564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00098942,0.0005065652,0.0008380717,0.00086418114,0.00060892035,0.0017822227,0.0006714202,0.0014160034,0.002008635],"category_scores_gemma":[0.0034752337,0.00048101426,0.00026464806,0.0016801745,0.0014116666,0.0023524226,0.00096861715,0.0015148087,0.0008226838],"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.00014404554,0.00007644519,0.0007515032,0.000468719,0.00006993556,0.0003282024,0.00026345096,0.13164513,0.008681947,0.60790527,0.009885312,0.23978],"study_design_scores_gemma":[0.000029017032,0.00006865767,0.0006703288,0.00007947842,0.000042549807,0.0005840657,0.00008522092,0.27843013,0.0020693333,0.68739843,0.030502157,0.00004068426],"about_ca_topic_score_codex":0.00025329014,"about_ca_topic_score_gemma":0.00032187445,"teacher_disagreement_score":0.002008635,"about_ca_system_score_codex":0.0005966449,"about_ca_system_score_gemma":0.00026082402,"threshold_uncertainty_score":0.0067195892},"labels":[],"label_agreement":null},{"id":"W1979724779","doi":"10.1007/s11276-013-0545-5","title":"A token circulation scheme for code assignment and cooperative transmission scheduling in CDMA-based UAV ad hoc networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Security token; Code division multiple access; Network packet; Scheduling (production processes); Schedule; Token passing; Real-time computing; Wireless; Telecommunications","score_opus":0.013939458214739981,"score_gpt":0.2369988082996166,"score_spread":0.2230593500848766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979724779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1002736,0.00042839514,0.8951176,0.00021696421,0.00021204032,0.0001719595,0.00007930271,0.0009458644,0.0025542201],"genre_scores_gemma":[0.8905792,0.00014499098,0.10593731,0.00005823257,0.00006238179,0.000103987855,0.000067256624,0.00004674734,0.0029998226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949396,0.00015779134,0.000031986558,0.00006897463,0.00012274664,0.00012456517],"domain_scores_gemma":[0.9984084,0.0006716526,0.00012419396,0.0002994872,0.0003270768,0.00016925966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095258,0.00024869465,0.0005931428,0.0006262169,0.0011401756,0.00092635566,0.0013019411,0.00042249056,0.0017644076],"category_scores_gemma":[0.0027362888,0.00021296043,0.0001875156,0.00089246756,0.00073880376,0.0010599394,0.0009803015,0.0006697314,0.0002973577],"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.0027328664,0.00050426985,0.0021957462,0.00018349093,0.000080790196,0.00040810698,0.00055242365,0.21468316,0.116823316,0.13916521,0.009094781,0.513576],"study_design_scores_gemma":[0.00012168298,0.0002786839,0.00028350236,0.000011466494,0.000037277357,0.00013973431,0.00004375009,0.97220963,0.013992915,0.008319429,0.004522414,0.000039465067],"about_ca_topic_score_codex":0.003826279,"about_ca_topic_score_gemma":0.0052548596,"teacher_disagreement_score":0.003826279,"about_ca_system_score_codex":0.0012922684,"about_ca_system_score_gemma":0.0018904868,"threshold_uncertainty_score":0.009376168},"labels":[],"label_agreement":null},{"id":"W1981179989","doi":"10.1007/s11276-012-0421-8","title":"Optimal reliable relay selection in multiuser cooperative relaying networks","year":2012,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Relay; Computer science; Computer network; Node (physics); Network packet; Relay channel; Throughput; Wireless; Telecommunications","score_opus":0.023530745394003693,"score_gpt":0.2655602054773028,"score_spread":0.24202946008329912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981179989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07232412,0.001563881,0.9216596,0.00046073567,0.000058432797,0.00005444126,0.00010974021,0.00019260394,0.003576488],"genre_scores_gemma":[0.93699634,0.0009775632,0.058747545,0.00009377095,0.00011339968,0.00014456135,0.000091377835,0.000051910632,0.0027835676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880254,0.00053272326,0.000059714857,0.00017653589,0.0002936063,0.00013480766],"domain_scores_gemma":[0.9951839,0.0037486989,0.00035552162,0.00024705185,0.0003821363,0.00008264963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020452247,0.00101373,0.0015416611,0.0009332956,0.00070174795,0.0012631094,0.0012015377,0.0011895433,0.0010115635],"category_scores_gemma":[0.00829283,0.0008900727,0.0003421504,0.0013402496,0.0013071477,0.0015058775,0.0011737853,0.0005714241,0.00028629124],"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.0003004758,0.00005007075,0.0007720416,0.00013510854,0.00005142197,0.00027032132,0.0002845686,0.90298665,0.005438043,0.048598625,0.0017700233,0.039342575],"study_design_scores_gemma":[0.000031129093,0.00005465734,0.00018114901,0.000009806429,0.00001878785,0.000055688015,0.000032257918,0.9671358,0.0010415278,0.031120913,0.00030546502,0.000012907666],"about_ca_topic_score_codex":0.0017995285,"about_ca_topic_score_gemma":0.002874874,"teacher_disagreement_score":0.0020452247,"about_ca_system_score_codex":0.0008732662,"about_ca_system_score_gemma":0.0009674408,"threshold_uncertainty_score":0.010816336},"labels":[],"label_agreement":null},{"id":"W1986392608","doi":"10.1007/s11276-009-0195-9","title":"Mobile sensor network programming system","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor 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":"Université de Montréal","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Default gateway; Mobile wireless sensor network; Sensor web; Process (computing); Key distribution in wireless sensor networks; Embedded system; Real-time computing; Distributed computing; Telecommunications; Wireless network; Operating system; Wireless","score_opus":0.0065721562107513955,"score_gpt":0.21199731573011782,"score_spread":0.20542515951936643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986392608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014504733,0.00038680062,0.8466962,0.0006867715,0.00047555147,0.0006387203,0.00332829,0.043403488,0.08987937],"genre_scores_gemma":[0.31476584,0.0011321058,0.4689917,0.0010782066,0.00029159145,0.0020428253,0.0080537405,0.005330337,0.1983137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998118,0.00003956219,0.000013775554,0.000044544693,0.00006501569,0.000025248646],"domain_scores_gemma":[0.9997003,0.00006278245,0.000022588965,0.00008223936,0.000097956785,0.00003406002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003166986,0.00043580894,0.00032244573,0.00036280914,0.00033722213,0.00071509613,0.00072466966,0.000281707,0.030272134],"category_scores_gemma":[0.0009908708,0.00020718617,0.00025419204,0.00034924326,0.0001331111,0.0006350511,0.00075070624,0.0006080333,0.01203903],"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.0009395945,0.00027793454,0.0019746597,0.000471453,0.00008590654,0.00035394245,0.00024177857,0.04130818,0.04015487,0.09320727,0.19550125,0.62548316],"study_design_scores_gemma":[0.00020420684,0.000223795,0.0009341191,0.00006130898,0.000067081186,0.00050297414,0.000070732494,0.3514731,0.039344937,0.024957912,0.5821061,0.000053695097],"about_ca_topic_score_codex":0.0006449869,"about_ca_topic_score_gemma":0.0010447477,"teacher_disagreement_score":0.030272134,"about_ca_system_score_codex":0.0002888465,"about_ca_system_score_gemma":0.00056330796,"threshold_uncertainty_score":0.10127038},"labels":[],"label_agreement":null},{"id":"W1989582478","doi":"10.1007/s11276-013-0592-y","title":"Reinforcement learning based routing in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Indian Institute of Management Ahmedabad","keywords":"Computer science; Reinforcement learning; Wireless mesh network; Computer network; Routing (electronic design automation); Wireless; Distributed computing; Wireless network; Artificial intelligence; Telecommunications","score_opus":0.009361942659421276,"score_gpt":0.2149593549571089,"score_spread":0.20559741229768763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989582478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04397024,0.00062185514,0.951767,0.0004575948,0.000117610936,0.000038756792,0.000025491752,0.0002411662,0.002760221],"genre_scores_gemma":[0.9483945,0.0003745467,0.04808644,0.00007693203,0.00007084067,0.00006438108,0.000037302976,0.00003279511,0.0028622863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995365,0.0002242585,0.000020065696,0.00006320406,0.00008900393,0.000067000816],"domain_scores_gemma":[0.99752873,0.001831926,0.00017251223,0.000106774714,0.0002601143,0.00009997837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013374125,0.0003385906,0.0006854427,0.00034844893,0.0003423512,0.00057895464,0.0010696612,0.00071765593,0.0013573298],"category_scores_gemma":[0.0049407813,0.00023640072,0.00022032301,0.00035296738,0.00082160934,0.0009886958,0.00074102305,0.00084713707,0.00015131035],"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.00007497143,0.000044940854,0.00048405633,0.00003443964,0.000021911741,0.000025965384,0.000028656079,0.95197535,0.00078236987,0.013976858,0.0007347204,0.03181576],"study_design_scores_gemma":[0.000005987827,0.000015146827,0.000039530707,0.0000016454234,0.000002902242,0.000004846654,0.0000031811849,0.9945634,0.000104998224,0.0051192115,0.00013757865,0.0000017066674],"about_ca_topic_score_codex":0.003265954,"about_ca_topic_score_gemma":0.00217343,"teacher_disagreement_score":0.003265954,"about_ca_system_score_codex":0.0007349538,"about_ca_system_score_gemma":0.0006319399,"threshold_uncertainty_score":0.007072985},"labels":[],"label_agreement":null},{"id":"W1990241714","doi":"10.1007/s11276-010-0255-1","title":"RADAR: A reputation-driven anomaly detection system for wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intrusion detection system; Wireless mesh network; Anomaly detection; Backup; Computer network; Constant false alarm rate; Radar; Wireless network; Wireless; Node (physics); Real-time computing; Telecommunications; Data mining; Artificial intelligence","score_opus":0.007287493965365962,"score_gpt":0.21761641567659964,"score_spread":0.21032892171123369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990241714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03328407,0.0006545068,0.8818712,0.00045644442,0.00044634164,0.0003147362,0.00072151574,0.07987327,0.0023778828],"genre_scores_gemma":[0.5885479,0.00041175907,0.40079823,0.00044489026,0.0003979749,0.0003164712,0.0020035678,0.0014405389,0.005638733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827516,0.0003653886,0.00015160318,0.00037794985,0.0007113604,0.00011854446],"domain_scores_gemma":[0.9941195,0.0019905153,0.00074663054,0.0014041775,0.0013532825,0.00038599348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029179356,0.0009888159,0.0016064714,0.0024021594,0.0005711934,0.0013211268,0.0032724396,0.0013692492,0.002763214],"category_scores_gemma":[0.010297351,0.0004954847,0.0003975351,0.001101439,0.00042835236,0.0031836622,0.0019701885,0.0013553585,0.0016830099],"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.0024242674,0.00075817446,0.010727707,0.00036065475,0.00052440393,0.00045642973,0.00019217592,0.05246728,0.049010456,0.0077567273,0.054847,0.8204748],"study_design_scores_gemma":[0.00012925222,0.00032523053,0.0016870399,0.000013258115,0.00007796464,0.0003278411,0.00002449007,0.9684369,0.017955722,0.0046618655,0.006287958,0.00007254155],"about_ca_topic_score_codex":0.0014036737,"about_ca_topic_score_gemma":0.0015625309,"teacher_disagreement_score":0.0032724396,"about_ca_system_score_codex":0.00058115675,"about_ca_system_score_gemma":0.0006846824,"threshold_uncertainty_score":0.015431702},"labels":[],"label_agreement":null},{"id":"W1990243878","doi":"10.1007/s11276-010-0285-8","title":"Application layer QoS optimization for multimedia transmission over cognitive radio networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Cognitive radio; Quality of service; Partially observable Markov decision process; Channel (broadcasting); Markov decision process; Transmission (telecommunications); Computer network; Wireless; Multimedia; Markov process; Markov model; Markov chain; Telecommunications; Machine learning","score_opus":0.008221511219649393,"score_gpt":0.23855397007973664,"score_spread":0.23033245886008724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990243878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16743593,0.0025928817,0.8186761,0.0007348897,0.00020507255,0.0000517485,0.000078791614,0.0003127463,0.009911939],"genre_scores_gemma":[0.96844137,0.0004763726,0.028736236,0.00007881491,0.00009845891,0.00003417752,0.000034263383,0.000056304198,0.0020440063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995289,0.00012147853,0.000019770549,0.000044717162,0.0001677184,0.000117393334],"domain_scores_gemma":[0.999057,0.0005887014,0.00007116823,0.000036457735,0.00020624007,0.00004040313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011047013,0.00076071813,0.00059880945,0.00043677905,0.0005149068,0.0012442523,0.000701324,0.0005466497,0.0014474549],"category_scores_gemma":[0.002957228,0.0002925843,0.00021104477,0.00064497365,0.0003988339,0.0006741941,0.00064275967,0.00065141846,0.00014493588],"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.00026266498,0.00012573201,0.00061170006,0.0000949113,0.000051772236,0.00008776571,0.00007108961,0.88468426,0.0248232,0.015471542,0.0017764983,0.07193891],"study_design_scores_gemma":[0.000004186868,0.000015866248,0.000087832945,0.0000016318792,0.0000063127463,0.000008853268,0.000008119335,0.99650687,0.001187795,0.0020190226,0.00015010455,0.000003318573],"about_ca_topic_score_codex":0.00429313,"about_ca_topic_score_gemma":0.0050177374,"teacher_disagreement_score":0.00429313,"about_ca_system_score_codex":0.0011028727,"about_ca_system_score_gemma":0.0010135836,"threshold_uncertainty_score":0.008536339},"labels":[],"label_agreement":null},{"id":"W1991031228","doi":"10.1007/s11276-013-0663-0","title":"Cooperative network solution and implementation for emergency applications with enhanced position estimation capability","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Innovates - Technology Futures","keywords":"Computer science; Interoperability; Position (finance); Base station; Multipath propagation; Network topology; Protocol (science); Real-time computing; Computer network; Topology (electrical circuits); Distributed computing","score_opus":0.004464104463036264,"score_gpt":0.22838775706803982,"score_spread":0.22392365260500355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991031228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079967976,0.000111923015,0.9103132,0.00021415678,0.000072355055,0.00009318445,0.00004113818,0.0012516466,0.007934408],"genre_scores_gemma":[0.8831668,0.000076441036,0.10646884,0.0000769639,0.000031590676,0.00012868835,0.000089307956,0.000037892154,0.009923575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997085,0.00006376374,0.000010126106,0.000048654376,0.00009641655,0.00007257872],"domain_scores_gemma":[0.99959713,0.000061122664,0.000031770986,0.00007240244,0.0002084106,0.000029096725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042499762,0.0003736784,0.00022819836,0.00037215702,0.00043091472,0.00048928894,0.0008729563,0.00057513604,0.002491534],"category_scores_gemma":[0.0007875721,0.00017667084,0.00020078504,0.00029666675,0.0001747355,0.00080576184,0.0007413575,0.0003974881,0.0007675604],"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.0007107558,0.0006421168,0.005651849,0.00014286929,0.00009556109,0.0006158763,0.00065782893,0.20465113,0.2262491,0.022705898,0.010405143,0.5274719],"study_design_scores_gemma":[0.000049936065,0.000499439,0.0016149773,0.000011980678,0.000049592512,0.00026807387,0.00022682048,0.92512673,0.058005773,0.0025859738,0.01153435,0.000026322563],"about_ca_topic_score_codex":0.0026571152,"about_ca_topic_score_gemma":0.0046337675,"teacher_disagreement_score":0.0026571152,"about_ca_system_score_codex":0.0003511263,"about_ca_system_score_gemma":0.0006337862,"threshold_uncertainty_score":0.008334994},"labels":[],"label_agreement":null},{"id":"W1993079450","doi":"10.1007/s11276-014-0803-1","title":"Low-cost authentication protocol for passive, computation capable RFID tags","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"RFID technology advancements","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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; CMC Microsystems","keywords":"Computer science; Authentication protocol; Lightweight Extensible Authentication Protocol; Authentication (law); Challenge-Handshake Authentication Protocol; Denial-of-service attack; Radio-frequency identification; Computer security; Computer network; Protocol (science); Data Authentication Algorithm; Cryptographic protocol; Cryptography; Mutual authentication; Challenge–response authentication; Identification (biology); The Internet; World Wide Web","score_opus":0.009063230996631899,"score_gpt":0.25888684299885495,"score_spread":0.24982361200222306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993079450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07791622,0.0014310575,0.90594417,0.00070006493,0.0005396921,0.0002948737,0.0001574743,0.0017985029,0.011218005],"genre_scores_gemma":[0.87420225,0.00059080776,0.092617005,0.00026866555,0.000226112,0.00028696968,0.00029124622,0.00009176993,0.031425126],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993455,0.0001113607,0.000058319765,0.00009007125,0.00029065594,0.00010406641],"domain_scores_gemma":[0.998623,0.00037310043,0.00016261442,0.00041281935,0.00036233023,0.00006603479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006758045,0.0005118357,0.0004808206,0.00048608164,0.00096708635,0.0013117734,0.0015412817,0.00090295105,0.003999448],"category_scores_gemma":[0.0018588789,0.0003085954,0.00024727744,0.00046202142,0.0006259537,0.0030207986,0.0018308852,0.0011366335,0.001873784],"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.0025864164,0.0002805695,0.0015062931,0.0007697337,0.00006628546,0.0009519978,0.00048086586,0.011937424,0.52467585,0.22444808,0.012154928,0.22014154],"study_design_scores_gemma":[0.00033977174,0.0015289481,0.0017644315,0.000135293,0.00026412288,0.0033109637,0.00027667804,0.2988086,0.55365205,0.05641197,0.08330105,0.0002060526],"about_ca_topic_score_codex":0.00026391383,"about_ca_topic_score_gemma":0.00041035513,"teacher_disagreement_score":0.003999448,"about_ca_system_score_codex":0.00053780875,"about_ca_system_score_gemma":0.00084590487,"threshold_uncertainty_score":0.013379455},"labels":[],"label_agreement":null},{"id":"W1994688078","doi":"10.1007/s11276-014-0703-4","title":"Multi-hop routing with cooperative transmission: a cross-layer approach","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"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","funders":"","keywords":"Computer science; Computer network; Cooperative diversity; Antenna diversity; Wireless ad hoc network; Geographic routing; Static routing; Distributed computing; Wireless; Fading; Routing protocol; Routing (electronic design automation); Channel (broadcasting); Telecommunications","score_opus":0.035280303532826816,"score_gpt":0.2807114819705152,"score_spread":0.24543117843768839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994688078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056225946,0.0005582157,0.9905413,0.00017489068,0.000075609205,0.0000492236,0.00001237563,0.0000906672,0.0028751246],"genre_scores_gemma":[0.6233633,0.0021209342,0.36639038,0.00037684175,0.00033163116,0.00025256685,0.00006258638,0.00012827167,0.006973372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987318,0.0005414943,0.000057174246,0.00014156633,0.00039556014,0.0001324618],"domain_scores_gemma":[0.99803334,0.001036907,0.00016410465,0.00027472453,0.00041870438,0.00007227821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002766175,0.0010125875,0.0011642965,0.0010303819,0.00084742124,0.001784242,0.0024641883,0.0014161047,0.0017297422],"category_scores_gemma":[0.0034787713,0.00067972793,0.0011553509,0.0012170769,0.0011822714,0.0023162332,0.002214623,0.0012369645,0.00034741865],"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.000112691756,0.00016027685,0.00047714508,0.00019089259,0.00018502353,0.00020345504,0.00023651106,0.7702903,0.012299955,0.16249466,0.002328233,0.051020756],"study_design_scores_gemma":[0.000006377428,0.000042969485,0.000056802757,0.0000092141045,0.000035180143,0.000051134306,0.000018674307,0.98769104,0.0011507464,0.010263849,0.0006598246,0.000014195531],"about_ca_topic_score_codex":0.0016874694,"about_ca_topic_score_gemma":0.0024149928,"teacher_disagreement_score":0.002766175,"about_ca_system_score_codex":0.0011050613,"about_ca_system_score_gemma":0.0010214209,"threshold_uncertainty_score":0.014629126},"labels":[],"label_agreement":null},{"id":"W1994817274","doi":"10.1007/s11276-015-0910-7","title":"A MAC transmission strategy in sparse Vehicular Delay-Tolerant Sensor Networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Wireless sensor network; Computer network; Energy consumption; Transmission (telecommunications); Efficient energy use; Throughput; Data transmission; Transmission delay; Latency (audio); Real-time computing; Wireless; Network packet; Telecommunications","score_opus":0.021567148146413057,"score_gpt":0.23283723311852614,"score_spread":0.21127008497211308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994817274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045935187,0.00058993284,0.94822156,0.00040984948,0.00014397048,0.00008966662,0.000057234465,0.00025873448,0.0042938483],"genre_scores_gemma":[0.93458575,0.0003571556,0.061872113,0.00014235025,0.00008441361,0.000087045686,0.000048988048,0.000034914556,0.0027872385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995859,0.00012876287,0.00002773685,0.000059191985,0.00014399966,0.00005437261],"domain_scores_gemma":[0.99901867,0.00046902004,0.00009489553,0.00010799019,0.00025248752,0.00005691595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007281042,0.00044165674,0.0006337376,0.00063517946,0.0005858034,0.00077330164,0.0011273588,0.00052439515,0.0009857434],"category_scores_gemma":[0.0029006675,0.0002855242,0.00022647432,0.0007611724,0.00052846555,0.0009510906,0.0009664632,0.00042491034,0.00017266636],"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.00034374915,0.00015154677,0.00088842056,0.00026653367,0.00007922892,0.00019999387,0.0003623974,0.70467544,0.027606012,0.08671105,0.004388086,0.17432748],"study_design_scores_gemma":[0.000010644052,0.00007810758,0.000107381544,0.0000065822214,0.000016309994,0.000053939555,0.000038093174,0.9900844,0.0016136813,0.0072598597,0.0007242496,0.000006759064],"about_ca_topic_score_codex":0.001673056,"about_ca_topic_score_gemma":0.0022277578,"teacher_disagreement_score":0.001673056,"about_ca_system_score_codex":0.0006134029,"about_ca_system_score_gemma":0.0007249681,"threshold_uncertainty_score":0.004450619},"labels":[],"label_agreement":null},{"id":"W1995584062","doi":"10.1007/s11276-007-0041-x","title":"A framework for the multicast lifetime maximization problem in energy-constrained wireless ad-hoc networks","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Northern British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Maximization; Source-specific multicast; Heuristic; Wireless ad hoc network; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Distributed computing; Wireless; Mathematical optimization; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.01113469682837929,"score_gpt":0.24339754883967532,"score_spread":0.23226285201129604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995584062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014286248,0.0008419809,0.99342585,0.00046010813,0.00008176919,0.00003804006,0.00005968503,0.00007028405,0.0035936371],"genre_scores_gemma":[0.28687707,0.006632301,0.68863326,0.0005966791,0.0011735115,0.0007448407,0.0003566332,0.00033212538,0.014653627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848783,0.00071466883,0.0000618251,0.00019943401,0.00039486017,0.00014144917],"domain_scores_gemma":[0.99851376,0.0009733823,0.00009800282,0.000114594615,0.00020259595,0.00009767457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025261838,0.0015369429,0.0015535066,0.0011147158,0.0011989025,0.0024138016,0.0038589528,0.0025302798,0.003647196],"category_scores_gemma":[0.0053947745,0.0007956086,0.001244135,0.0024252683,0.0016665283,0.004272417,0.0026686483,0.0028754673,0.00083466584],"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.00003982108,0.0000717544,0.00016188389,0.00026523924,0.000047907575,0.00015010055,0.00018391002,0.3480598,0.0011661544,0.60662025,0.00742525,0.035807915],"study_design_scores_gemma":[0.000018411265,0.000031059164,0.00006159658,0.000039004204,0.000023377213,0.00007608446,0.000041788975,0.76157516,0.00024291645,0.22988892,0.007984218,0.000017430553],"about_ca_topic_score_codex":0.002604062,"about_ca_topic_score_gemma":0.0029829084,"teacher_disagreement_score":0.0038589528,"about_ca_system_score_codex":0.0017732135,"about_ca_system_score_gemma":0.0015110989,"threshold_uncertainty_score":0.013359845},"labels":[],"label_agreement":null},{"id":"W1997006092","doi":"10.1007/s11276-006-6533-2","title":"Distributed self-tuning of sensor networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bottleneck; Wireless sensor network; Nash equilibrium; Computation; Mathematical optimization; Throughput; Scheme (mathematics); Distributed computing; Distributed algorithm; Channel (broadcasting); Task (project management); Algorithm; Computer network; Wireless; Telecommunications","score_opus":0.005304450039550306,"score_gpt":0.1923824179493933,"score_spread":0.187077967909843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997006092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07311524,0.0011131525,0.9181847,0.00031239164,0.0001847905,0.000044184733,0.000029740793,0.00080792495,0.006207846],"genre_scores_gemma":[0.9629901,0.00034216658,0.03293538,0.000070823684,0.00007128794,0.000055745277,0.000030209374,0.00007881297,0.0034254077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961555,0.00010926495,0.000018112738,0.00010000187,0.000122437,0.00003463244],"domain_scores_gemma":[0.9989121,0.0005676826,0.00008089127,0.00023942273,0.0001532136,0.000046732497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074955256,0.00025039006,0.00045223004,0.00031519734,0.00032500827,0.000612058,0.0007803589,0.00039244228,0.001354419],"category_scores_gemma":[0.0027726516,0.00019929805,0.00016183226,0.00032123836,0.0005262448,0.0009561523,0.0006670951,0.00049452943,0.00020345025],"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.0004083109,0.00020345207,0.001844859,0.00020432191,0.00009953021,0.00009341122,0.00019818597,0.6048351,0.0706882,0.046393365,0.0031260564,0.27190524],"study_design_scores_gemma":[0.00002554948,0.000053350886,0.00039377573,0.000006550363,0.000013131967,0.000051851974,0.000021838667,0.9673701,0.006727438,0.022510936,0.002817298,0.000008170069],"about_ca_topic_score_codex":0.00025976036,"about_ca_topic_score_gemma":0.0003662675,"teacher_disagreement_score":0.001354419,"about_ca_system_score_codex":0.0003389395,"about_ca_system_score_gemma":0.00025339882,"threshold_uncertainty_score":0.004531026},"labels":[],"label_agreement":null},{"id":"W1998640339","doi":"10.1007/s11276-005-5278-7","title":"An Efficient Adaptive Cell Sectoring Technique for Non-Uniform Traffic in DS-CDMA Systems","year":2005,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Code division multiple access; Algorithm; Spread spectrum; Computational complexity theory; Distributed computing; Mathematical optimization; Computer network; Mathematics","score_opus":0.02007061940067955,"score_gpt":0.27343729560299834,"score_spread":0.2533666762023188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998640339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063670434,0.00055942737,0.932871,0.00009235637,0.00009826598,0.000031527852,0.000031983385,0.0004056852,0.0022392445],"genre_scores_gemma":[0.71996427,0.000418626,0.27640143,0.00009094518,0.00010435601,0.000040501265,0.0000687296,0.000041220203,0.0028699848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997111,0.00008479461,0.000013934711,0.00002865285,0.00011900018,0.00004241989],"domain_scores_gemma":[0.99939406,0.0002423094,0.000037720918,0.00015033198,0.00014825871,0.000027351105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003677841,0.0002802965,0.00033430662,0.00032600877,0.00040115413,0.0003845893,0.0005279044,0.0002986541,0.001680332],"category_scores_gemma":[0.0011173333,0.00016763453,0.00019576239,0.0004732905,0.00026921337,0.00041425432,0.00045436228,0.00039691673,0.0004009639],"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.0007953057,0.00014124475,0.0014196825,0.00008930046,0.00004732578,0.000116255476,0.00012474427,0.0517472,0.25081232,0.01562797,0.0017896547,0.67728895],"study_design_scores_gemma":[0.000035510715,0.00018337028,0.00104766,0.000010708227,0.00004749788,0.00040199384,0.000028855582,0.9341635,0.056444846,0.003480336,0.0041357097,0.000020009838],"about_ca_topic_score_codex":0.00070876844,"about_ca_topic_score_gemma":0.0019757196,"teacher_disagreement_score":0.001680332,"about_ca_system_score_codex":0.0003020839,"about_ca_system_score_gemma":0.00034358617,"threshold_uncertainty_score":0.005621314},"labels":[],"label_agreement":null},{"id":"W2000351350","doi":"10.1007/s11276-007-0025-x","title":"Real-time CBR traffic scheduling in IEEE 802.16-based wireless mesh networks","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Fair-share scheduling; Round-robin scheduling; Computer network; Dynamic priority scheduling; Scheduling (production processes); Rate-monotonic scheduling; Earliest deadline first scheduling; Bottleneck; Network packet; IEEE 802; Distributed computing; Real-time computing; Mathematical optimization; Embedded system; Quality of service","score_opus":0.0066404526489133725,"score_gpt":0.2173382701217506,"score_spread":0.21069781747283722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000351350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28993207,0.0024032206,0.6984854,0.00070281944,0.00042164745,0.000085103835,0.000118871525,0.0007490759,0.00710176],"genre_scores_gemma":[0.98349714,0.00022719373,0.015103085,0.00004063779,0.00007093922,0.000022950566,0.000036172274,0.000037928974,0.0009639902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886644,0.0004541795,0.0000550107,0.00012111158,0.00028284412,0.00022052831],"domain_scores_gemma":[0.99709666,0.0016944853,0.0002970397,0.00023279183,0.0005559703,0.00012309375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029991898,0.00051569735,0.00058113015,0.00069112936,0.00040963016,0.00085656723,0.0013650728,0.0004948381,0.0010990676],"category_scores_gemma":[0.007573871,0.00036182918,0.00017768769,0.0007527457,0.00059215265,0.0013791294,0.00054267247,0.0005899098,0.00021548665],"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.0008185149,0.00017812733,0.0014122411,0.00008042852,0.00004286315,0.00007171316,0.00009534506,0.8912856,0.006177912,0.009282945,0.0022748357,0.08827943],"study_design_scores_gemma":[0.000014497026,0.000057620302,0.00019764385,0.000002768923,0.000008576893,0.000019747022,0.000018176375,0.99673647,0.0007718578,0.0018993026,0.00026852274,0.0000048491947],"about_ca_topic_score_codex":0.0036742403,"about_ca_topic_score_gemma":0.003563254,"teacher_disagreement_score":0.0036742403,"about_ca_system_score_codex":0.0010863695,"about_ca_system_score_gemma":0.00081987114,"threshold_uncertainty_score":0.015861392},"labels":[],"label_agreement":null},{"id":"W2001909640","doi":"10.1007/s11276-008-0146-x","title":"Hierarchical geographic multicast routing for wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; National Science Foundation","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Xcast; Distributed computing; Pragmatic General Multicast; IP multicast","score_opus":0.016770784871156675,"score_gpt":0.23571847125484421,"score_spread":0.21894768638368753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001909640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06398117,0.003851369,0.9206149,0.0012113925,0.0003498172,0.0001387778,0.00026328367,0.0017114992,0.007877838],"genre_scores_gemma":[0.7573344,0.0017919658,0.23273715,0.00020273906,0.00024642923,0.00012701783,0.0005851051,0.000102606966,0.006872445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.00012588529,0.000025502786,0.000050317318,0.0001662231,0.00005697965],"domain_scores_gemma":[0.99945956,0.00018824964,0.00006848272,0.00014548012,0.000104892584,0.000033369764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665617,0.00029397005,0.00041619444,0.0005925173,0.00062696426,0.0005288631,0.0007885589,0.0005455101,0.0016218317],"category_scores_gemma":[0.0017412206,0.00023208348,0.00021277086,0.00083147036,0.0004197233,0.0012781571,0.0009808779,0.00049322494,0.00030705464],"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.0003696022,0.00012642804,0.0020053065,0.00053943455,0.00009198819,0.00029902084,0.00043064464,0.3432666,0.033801474,0.11402145,0.020294022,0.48475397],"study_design_scores_gemma":[0.000049246148,0.00016104913,0.0012604687,0.000037345242,0.000067221954,0.00022471516,0.00019101672,0.8657902,0.008111849,0.098655805,0.025423978,0.000027141274],"about_ca_topic_score_codex":0.00179758,"about_ca_topic_score_gemma":0.00279957,"teacher_disagreement_score":0.00179758,"about_ca_system_score_codex":0.00055472413,"about_ca_system_score_gemma":0.0005305859,"threshold_uncertainty_score":0.005425632},"labels":[],"label_agreement":null},{"id":"W2005031132","doi":"10.1007/s11276-005-1770-3","title":"On the Design Problem of Cellular Wireless Networks","year":2005,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Computer science; Base station; Mathematical optimization; Cellular network; Network planning and design; Service (business); Computer network; Network topology; Distributed computing; Wireless network; Wireless; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics","score_opus":0.009483817083448868,"score_gpt":0.18863315818514936,"score_spread":0.1791493411017005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005031132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02100711,0.004937592,0.94293946,0.0040602647,0.00037051435,0.00008090903,0.00017162123,0.00006453638,0.026367947],"genre_scores_gemma":[0.7992657,0.013901816,0.15375665,0.0012130068,0.001498152,0.0004823867,0.0003277601,0.00013796682,0.029416554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986313,0.0008521716,0.000036246678,0.00013851853,0.00023909604,0.00010272307],"domain_scores_gemma":[0.9953949,0.0038114246,0.00016620831,0.0001248457,0.000357647,0.00014492689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020653186,0.0012911655,0.0013457072,0.0006337004,0.0005924722,0.002141619,0.0010142105,0.0025202527,0.003297888],"category_scores_gemma":[0.010134544,0.0007219913,0.00052832806,0.001411789,0.0017915529,0.0019351976,0.0013313605,0.0016222193,0.0004637732],"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.0001042375,0.000055325076,0.00044358728,0.0002678698,0.000057177713,0.00010495851,0.00012312309,0.5242367,0.0009179661,0.43670538,0.0072401487,0.02974353],"study_design_scores_gemma":[0.000047139583,0.000054521704,0.00012489501,0.000047049263,0.000023044104,0.000041267074,0.000047808095,0.69247246,0.00026432684,0.2993484,0.0075146663,0.0000143279385],"about_ca_topic_score_codex":0.002639001,"about_ca_topic_score_gemma":0.0020196664,"teacher_disagreement_score":0.003297888,"about_ca_system_score_codex":0.0017926915,"about_ca_system_score_gemma":0.0010955897,"threshold_uncertainty_score":0.013006866},"labels":[],"label_agreement":null},{"id":"W2005590005","doi":"10.1007/s11276-011-0335-x","title":"A constrained MDP-based vertical handoff decision algorithm for 4G heterogeneous wireless networks","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"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; Handover; Markov decision process; Roaming; Wireless; Wireless network; Computer network; Optimal decision; Constraint (computer-aided design); Bandwidth (computing); Mathematical optimization; Algorithm; Markov process; Telecommunications; Artificial intelligence","score_opus":0.013721159776838776,"score_gpt":0.21475215972846062,"score_spread":0.20103099995162185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005590005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038847502,0.00024523895,0.95860374,0.0002076934,0.00007132506,0.00010031086,0.000097405784,0.00045455917,0.0013722976],"genre_scores_gemma":[0.699547,0.0001333258,0.29791766,0.0001528659,0.000043931264,0.00020687628,0.00026885085,0.000046307916,0.0016831737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995197,0.00012099886,0.00003845543,0.00007405687,0.00014749881,0.000099239776],"domain_scores_gemma":[0.99893385,0.0006913069,0.00006872888,0.000051674902,0.00018628396,0.00006817738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012070317,0.0005022113,0.0011430292,0.0005233702,0.00060382247,0.00070055085,0.0014652823,0.0008227242,0.0024952912],"category_scores_gemma":[0.0022897534,0.00040991371,0.00033387475,0.00061479677,0.00034449354,0.0008910308,0.0012063696,0.0008656931,0.00022120666],"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.0007000631,0.00018141455,0.00081670895,0.000049491275,0.000055145418,0.00006084136,0.000044898366,0.7948791,0.0025601198,0.004718601,0.0023257008,0.19360803],"study_design_scores_gemma":[0.000014986029,0.000017344504,0.000040757743,0.0000012617378,0.0000029128091,0.0000043079,0.0000034971044,0.99908555,0.00021015563,0.00052624353,0.000090982416,0.0000020550692],"about_ca_topic_score_codex":0.008362284,"about_ca_topic_score_gemma":0.0063606226,"teacher_disagreement_score":0.008362284,"about_ca_system_score_codex":0.00083074335,"about_ca_system_score_gemma":0.001591604,"threshold_uncertainty_score":0.016627252},"labels":[],"label_agreement":null},{"id":"W2009080156","doi":"10.1007/s11276-007-0062-5","title":"Supporting voice and video applications over IEEE 802.11n WLANs","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"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":"Computer science; Computer network; Bottleneck; Network allocation vector; IEEE 802.1X; IEEE 802; Inter-Access Point Protocol; Frame (networking); IEEE 802.11e-2005; IEEE 802.11; Throughput; Protocol (science); IEEE 802.11u; Access control; Wi-Fi; Wireless Multimedia Extensions; Local area network; Transmission (telecommunications); IEEE 802.11s; Wireless; Wireless network; Quality of service; Telecommunications; Embedded system; Wi-Fi array","score_opus":0.0109424668334721,"score_gpt":0.28738950531598184,"score_spread":0.27644703848250973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009080156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58647346,0.0038966173,0.3473357,0.0017824274,0.000623995,0.00015684501,0.00019145875,0.0061087892,0.053430773],"genre_scores_gemma":[0.97469056,0.0007400737,0.015194742,0.0001819557,0.0002467796,0.000033267843,0.00017962519,0.00005585509,0.008677268],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995478,0.00007235787,0.000038172126,0.000049342463,0.00015938183,0.0001329041],"domain_scores_gemma":[0.9986393,0.0003936765,0.00012527747,0.00016693017,0.0005587212,0.00011614948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013344784,0.00037048882,0.00035973045,0.00048223336,0.0006203549,0.0017229534,0.00082124694,0.000630199,0.0026193473],"category_scores_gemma":[0.0026009083,0.00021123783,0.00012575148,0.00046516006,0.0003953661,0.001720213,0.00096722407,0.00079612806,0.0009704531],"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.0019748048,0.00070317666,0.013274778,0.0005429279,0.00008584224,0.0011587737,0.0012198171,0.024806486,0.21054828,0.029070288,0.017903823,0.6987111],"study_design_scores_gemma":[0.0002758918,0.0009336148,0.0074869287,0.00017510478,0.00028130697,0.0021040698,0.001503285,0.7050337,0.16719998,0.027016837,0.087834425,0.00015482798],"about_ca_topic_score_codex":0.0018439798,"about_ca_topic_score_gemma":0.002970548,"teacher_disagreement_score":0.0026193473,"about_ca_system_score_codex":0.0004470239,"about_ca_system_score_gemma":0.0005235798,"threshold_uncertainty_score":0.008762598},"labels":[],"label_agreement":null},{"id":"W2009802555","doi":"10.1007/s11276-013-0588-7","title":"Contention aware mobility prediction routing for intermittently connected mobile networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Routing protocol; Node (physics); Routing (electronic design automation); Protocol (science); Distributed computing; Mobility model; Delay-tolerant networking; Link-state routing protocol; Wireless Routing Protocol","score_opus":0.01445690682555665,"score_gpt":0.22618303775367848,"score_spread":0.21172613092812184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009802555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20134568,0.0026638652,0.7905527,0.0011937824,0.00031472783,0.00007495358,0.00016331323,0.0006688234,0.003022249],"genre_scores_gemma":[0.9768549,0.0003181566,0.021833396,0.000034872173,0.000070819995,0.000023222103,0.00006171225,0.000018384795,0.00078457943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.000084725514,0.000024925152,0.00007518559,0.00013376004,0.000084470084],"domain_scores_gemma":[0.9976071,0.0014780615,0.00030649843,0.00023805967,0.00027376783,0.00009657084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124631,0.00042168083,0.00064605277,0.0008625305,0.0010202398,0.00088634394,0.001434907,0.00050459726,0.00068027456],"category_scores_gemma":[0.0046919077,0.0004020839,0.0002029461,0.00090960914,0.00056860654,0.0014588062,0.00090283493,0.0007742926,0.00008356287],"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.00029859898,0.0001458266,0.005423246,0.000089056186,0.0000733588,0.00024402524,0.00030615882,0.85275966,0.0062909224,0.017577112,0.003895979,0.11289611],"study_design_scores_gemma":[0.000004381196,0.000015567242,0.00024112039,0.0000035215248,0.000010289828,0.00002342612,0.000019925243,0.99590707,0.000414588,0.0031144328,0.00024166508,0.0000039430297],"about_ca_topic_score_codex":0.0062612244,"about_ca_topic_score_gemma":0.012987302,"teacher_disagreement_score":0.0062612244,"about_ca_system_score_codex":0.0009195011,"about_ca_system_score_gemma":0.0009018346,"threshold_uncertainty_score":0.012449563},"labels":[],"label_agreement":null},{"id":"W2013913408","doi":"10.1007/s11276-012-0473-9","title":"Efficient reporting node selection-based MAC protocol for wireless sensor networks","year":2012,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Latency (audio); Protocol (science); Node (physics); Key distribution in wireless sensor networks; Access control; Sensor node; Task (project management); Real-time computing; Distributed computing; Wireless; Wireless network; Telecommunications","score_opus":0.027161599706731446,"score_gpt":0.28946645024810724,"score_spread":0.2623048505413758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013913408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017401751,0.0034209476,0.9754877,0.00037926665,0.00029730707,0.000120651384,0.00007104738,0.0010784434,0.001742878],"genre_scores_gemma":[0.6179896,0.0030104676,0.36900574,0.0003810332,0.0004884638,0.0003949025,0.00038240672,0.00013564045,0.0082118735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998665,0.00046898588,0.00009913014,0.00013077442,0.0005572549,0.00007882132],"domain_scores_gemma":[0.9980248,0.000976194,0.00024836982,0.0002852216,0.00042066438,0.000044716136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022909031,0.0006712324,0.00076360547,0.0008651736,0.00047206468,0.0007256001,0.0014361865,0.000555981,0.0008702803],"category_scores_gemma":[0.00366149,0.00031175686,0.00027513507,0.0008316637,0.00041747914,0.0011815773,0.0007498504,0.0008532648,0.00031057614],"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.000907779,0.00034260377,0.001757368,0.0005253987,0.00027338133,0.00034968602,0.00042450606,0.19525643,0.1266307,0.049801566,0.015446816,0.60828376],"study_design_scores_gemma":[0.00008743274,0.00044022864,0.0011513089,0.000038723185,0.00016252648,0.00042474119,0.00006363949,0.9404053,0.030964741,0.012618165,0.013575409,0.000067817055],"about_ca_topic_score_codex":0.00069808133,"about_ca_topic_score_gemma":0.0010080376,"teacher_disagreement_score":0.0022909031,"about_ca_system_score_codex":0.00038876763,"about_ca_system_score_gemma":0.00062368665,"threshold_uncertainty_score":0.012115598},"labels":[],"label_agreement":null},{"id":"W2014692197","doi":"10.1007/s11276-006-6147-8","title":"A Constraint Formulation for Minimum-Energy Multicast Routing in Wireless Multihop Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Wireless ad hoc network; Computer network; Multicast; Distributed computing; Integer programming; Heuristic; Ad hoc wireless distribution service; Energy consumption; Relay; Routing (electronic design automation); Wireless; Optimized Link State Routing Protocol; Routing protocol; Algorithm; Telecommunications","score_opus":0.011000723514552542,"score_gpt":0.2308510834784031,"score_spread":0.21985035996385058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014692197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041584503,0.00084748253,0.98310316,0.00080598256,0.00018147037,0.00015116677,0.000575391,0.00010069158,0.010076172],"genre_scores_gemma":[0.26015225,0.0027136547,0.7175054,0.0005959539,0.00047114483,0.0010107133,0.0012742621,0.0002586354,0.016018014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987232,0.0005210522,0.0000632168,0.00016833862,0.00039776784,0.00012642499],"domain_scores_gemma":[0.99738926,0.0019616021,0.00015286205,0.00007492138,0.00034800248,0.000073342126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020709706,0.0015105047,0.0015496056,0.00088748947,0.0008350959,0.0022845643,0.0029650046,0.0025501566,0.007860093],"category_scores_gemma":[0.0069059245,0.0010230229,0.0009379109,0.0029205075,0.00075576745,0.0026639833,0.001378618,0.0021956468,0.00085452956],"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.000053937365,0.00007470208,0.00021000145,0.0003841648,0.000044105724,0.00028705577,0.000085198466,0.87475306,0.0007780506,0.08645543,0.0071776197,0.029696746],"study_design_scores_gemma":[0.00002962219,0.00002595018,0.00009142508,0.000049113936,0.000015319443,0.000058655463,0.00003564596,0.96955496,0.00027426964,0.02554077,0.004312002,0.000012292556],"about_ca_topic_score_codex":0.009522413,"about_ca_topic_score_gemma":0.009707619,"teacher_disagreement_score":0.009522413,"about_ca_system_score_codex":0.0015168765,"about_ca_system_score_gemma":0.0016026701,"threshold_uncertainty_score":0.026294649},"labels":[],"label_agreement":null},{"id":"W2015077134","doi":"10.1007/s11276-006-6539-9","title":"Utility based service differentiation in CDMA data networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","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":"Nortel (Canada)","funders":"University of Calcutta; University of North Texas; University of Central Florida; Indian Institute of Science; National Science Foundation","keywords":"Computer science; Churning; Service provider; Quality of service; Computer network; Revenue; Resource allocation; Overhead (engineering); Heuristics; Resource management (computing); Power control; Service (business); Power (physics)","score_opus":0.04158904641416368,"score_gpt":0.28005970837953725,"score_spread":0.2384706619653736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015077134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14166729,0.004689779,0.83986425,0.00085386855,0.00031043947,0.00008376467,0.000073301766,0.00056207535,0.011895187],"genre_scores_gemma":[0.9487156,0.0007878749,0.044370558,0.000107063795,0.00010748816,0.00004389751,0.000043846467,0.00004261865,0.0057810927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992581,0.00025914575,0.000029506362,0.00007704453,0.00022900109,0.00014718848],"domain_scores_gemma":[0.9974146,0.0014848263,0.00012522278,0.00028236376,0.0005581741,0.00013492236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017897366,0.00032408128,0.00057724054,0.00057049835,0.0008010887,0.001624547,0.00095643604,0.0006783902,0.0016945282],"category_scores_gemma":[0.0060894294,0.00033293897,0.00014879151,0.0012041723,0.0010922072,0.0014739977,0.0008659183,0.0011411487,0.00045636072],"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.0011360445,0.00027059895,0.0019974075,0.00018367065,0.0000329538,0.00027843285,0.0006437901,0.2548692,0.022061381,0.4321175,0.005008939,0.28140008],"study_design_scores_gemma":[0.000031525036,0.00008583698,0.00039664362,0.000016916045,0.000018798695,0.00016929721,0.000095840034,0.89367,0.0052827215,0.0960961,0.004116609,0.000019663476],"about_ca_topic_score_codex":0.0023258675,"about_ca_topic_score_gemma":0.0024257782,"teacher_disagreement_score":0.0023258675,"about_ca_system_score_codex":0.0017218138,"about_ca_system_score_gemma":0.0008971646,"threshold_uncertainty_score":0.012492716},"labels":[],"label_agreement":null},{"id":"W2017314049","doi":"10.1007/s11276-006-0004-7","title":"Transmission costs, selfish nodes, and protocol design","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Aloha; Computer science; Nash equilibrium; Computer network; Network packet; Throughput; Transmission (telecommunications); Intuition; Game theory; Channel (broadcasting); Fairness measure; Wireless; Mathematical optimization; Telecommunications; Mathematical economics","score_opus":0.010050236091073554,"score_gpt":0.23424172144076513,"score_spread":0.22419148534969158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017314049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21155676,0.0037645595,0.75734127,0.004313871,0.00031112102,0.00023811427,0.00016011503,0.00025347303,0.022060718],"genre_scores_gemma":[0.95493335,0.0015758089,0.03664765,0.0001556511,0.00019931956,0.00026526858,0.0000525672,0.00009466745,0.0060756556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959771,0.0021221628,0.00018956713,0.00042484255,0.0009264638,0.00035991264],"domain_scores_gemma":[0.95107347,0.040263005,0.0030342026,0.0026935926,0.0021216455,0.0008140878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007873544,0.00088398746,0.0011496121,0.0015612169,0.0010972855,0.004057075,0.0024551607,0.0020830592,0.003268131],"category_scores_gemma":[0.04419321,0.0010970002,0.0004748914,0.0015291942,0.0027359284,0.0077804807,0.0016901409,0.0021786285,0.0003086004],"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.00038480078,0.00022515979,0.0025479347,0.00026753818,0.00010174805,0.00016473608,0.00033038965,0.296538,0.00249412,0.6435017,0.0032023794,0.05024155],"study_design_scores_gemma":[0.00006441187,0.00010793277,0.00065019395,0.000040663672,0.00008255856,0.00020241835,0.00010347889,0.6287192,0.0011247143,0.36721006,0.0016551198,0.000039277355],"about_ca_topic_score_codex":0.0009939322,"about_ca_topic_score_gemma":0.0011606656,"teacher_disagreement_score":0.007873544,"about_ca_system_score_codex":0.0029218337,"about_ca_system_score_gemma":0.0017805233,"threshold_uncertainty_score":0.041639805},"labels":[],"label_agreement":null},{"id":"W2020816751","doi":"10.1007/s11276-006-6155-8","title":"Performance Study of Proactive Flow Handoff for Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Victoria","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Optimized Link State Routing Protocol; Handover; Routing (electronic design automation); Overhead (engineering); Distributed computing; Wireless Routing Protocol; Routing protocol; Vehicular ad hoc network; Path (computing); Destination-Sequenced Distance Vector routing; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Wireless; Dynamic Source Routing; Telecommunications","score_opus":0.008472984832178853,"score_gpt":0.21948248017522862,"score_spread":0.21100949534304977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020816751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90245783,0.0040985,0.08330934,0.0006068393,0.0002554057,0.00016307956,0.00026137172,0.0005391661,0.008308515],"genre_scores_gemma":[0.99539715,0.00026603093,0.003463084,0.000026634429,0.00006257239,0.000010942284,0.000063409796,0.00001910628,0.0006911359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734783,0.0008598203,0.00008948244,0.0002277793,0.0009823618,0.0004926536],"domain_scores_gemma":[0.9867026,0.009976948,0.0005188218,0.00059471873,0.0018000187,0.00040692996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039244057,0.0010618217,0.0008773266,0.0012765712,0.00080524565,0.001150042,0.0010457569,0.0005600212,0.0021970712],"category_scores_gemma":[0.011265027,0.00024075004,0.00026127,0.0012463268,0.0006447229,0.0011916386,0.0006350508,0.0006379125,0.0002011098],"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.0041390858,0.001201908,0.013599791,0.0004232871,0.00023784596,0.00046586484,0.0003680954,0.81634915,0.039220516,0.012465661,0.003983792,0.107544936],"study_design_scores_gemma":[0.000038583865,0.000767518,0.0026350343,0.000008480504,0.000065545544,0.00015096905,0.00010327035,0.9918542,0.0030980352,0.0010404343,0.000223168,0.00001472427],"about_ca_topic_score_codex":0.005480517,"about_ca_topic_score_gemma":0.0037101756,"teacher_disagreement_score":0.005480517,"about_ca_system_score_codex":0.0017260992,"about_ca_system_score_gemma":0.0011721981,"threshold_uncertainty_score":0.020754457},"labels":[],"label_agreement":null},{"id":"W2020968881","doi":"10.1007/s11276-009-0193-y","title":"Cross-layer quality-driven adaptation for scheduling heterogeneous multimedia over 3G satellite networks","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Quality of service; Computer network; Scheduling (production processes); Network packet; Distributed computing; Queueing theory; Scalability; Wireless network; Wireless; Real-time computing; Telecommunications","score_opus":0.0585601299457215,"score_gpt":0.35628326575937175,"score_spread":0.29772313581365023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020968881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29409242,0.0012822098,0.7000218,0.00041403304,0.00041226667,0.00012109313,0.00008009303,0.0009970244,0.0025790443],"genre_scores_gemma":[0.9826643,0.00009404561,0.016636513,0.00008757542,0.00005630773,0.000025291016,0.000034946195,0.00003763211,0.00036325422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994067,0.00014467952,0.000038224433,0.000093331524,0.00017442963,0.00014269343],"domain_scores_gemma":[0.9982439,0.0008804905,0.00019073313,0.00014134127,0.00040661066,0.00013686129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020188736,0.0006736221,0.0007941153,0.00039948645,0.0006453866,0.0008582445,0.0011811132,0.00039873997,0.0010152817],"category_scores_gemma":[0.0040152236,0.00030290466,0.00024324121,0.00045891927,0.00044836878,0.0006149178,0.0009981494,0.0011144149,0.00013489909],"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.0013703279,0.00031781537,0.0042082104,0.000089338624,0.00016961173,0.0002272647,0.0002891629,0.8011251,0.047305226,0.0037616682,0.0028629845,0.13827327],"study_design_scores_gemma":[0.000013380209,0.000061328006,0.00046769867,0.0000020979926,0.000014331819,0.000019787927,0.000015878288,0.9972051,0.0015409436,0.0004999428,0.00015312107,0.0000064006617],"about_ca_topic_score_codex":0.005303786,"about_ca_topic_score_gemma":0.009997496,"teacher_disagreement_score":0.005303786,"about_ca_system_score_codex":0.00091047015,"about_ca_system_score_gemma":0.0008283668,"threshold_uncertainty_score":0.01067692},"labels":[],"label_agreement":null},{"id":"W2021620205","doi":"10.1007/s11276-010-0236-4","title":"Enhancing the performance of secured handover protocols in UMTS-WiMAX interworking","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Handover; Computer network; Computer science; WiMAX; UMTS frequency bands; Roaming; Cellular network; Vertical handover; Soft handover; Base station; Authentication (law); Wireless; Wireless network; Heterogeneous network; Telecommunications; Computer security","score_opus":0.00568591985311215,"score_gpt":0.21825321391905358,"score_spread":0.21256729406594144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021620205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9027615,0.0019330683,0.0881947,0.00035964558,0.00014240078,0.00006312492,0.000053374024,0.0007211186,0.005770979],"genre_scores_gemma":[0.9924601,0.00025013596,0.006622535,0.000021410868,0.00004359943,0.0000092089895,0.00004254232,0.000026515756,0.0005239953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854773,0.0004394246,0.00008320039,0.00007259968,0.00056239666,0.0002946235],"domain_scores_gemma":[0.9955776,0.002909391,0.0002910762,0.00047379802,0.00063844415,0.00010978959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026626266,0.000867945,0.0005313197,0.00060841773,0.00054251344,0.0014048571,0.00060542877,0.0005995536,0.0010023963],"category_scores_gemma":[0.0084451,0.0002673347,0.00014129125,0.000488561,0.0005397028,0.001992098,0.0010845374,0.0008137077,0.0002658004],"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.006331601,0.0010939706,0.018601753,0.00033036296,0.00021095888,0.00060484983,0.00064467615,0.38340932,0.23497044,0.01888964,0.0028499025,0.33206248],"study_design_scores_gemma":[0.00005662033,0.0010525477,0.0034548808,0.00002118384,0.00011685988,0.00024047226,0.00012856636,0.8850086,0.10403542,0.0041107405,0.0017457838,0.000028328059],"about_ca_topic_score_codex":0.0009055557,"about_ca_topic_score_gemma":0.001263235,"teacher_disagreement_score":0.0026626266,"about_ca_system_score_codex":0.0006718945,"about_ca_system_score_gemma":0.00073270826,"threshold_uncertainty_score":0.014081478},"labels":[],"label_agreement":null},{"id":"W2022750604","doi":"10.1007/s11276-009-0196-8","title":"Packet data messaging over TETRA: network performance analysis","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Transportation of Ontario","funders":"","keywords":"Computer science; Computer network; Network packet; Packet loss; Transmission delay; Radio Link Protocol; Packet analyzer; Quality of service; Dimensioning; End-to-end delay; Tetra; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.013291433368058398,"score_gpt":0.23771762824288895,"score_spread":0.22442619487483054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022750604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87351805,0.001552355,0.10843887,0.00077856693,0.00012900576,0.00015810548,0.00043513047,0.000944358,0.014045454],"genre_scores_gemma":[0.9911171,0.00030129202,0.006909046,0.00003422185,0.000050485243,0.000034316367,0.0001455599,0.000048648053,0.0013592833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985447,0.00047130647,0.000056205154,0.00015114182,0.0004270512,0.00034958217],"domain_scores_gemma":[0.9899039,0.0065133236,0.0007739699,0.00083983404,0.0017149204,0.00025390933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036828332,0.00068187,0.00075875066,0.0014961517,0.00070326333,0.0011821549,0.0010007675,0.00057892845,0.002863189],"category_scores_gemma":[0.01081947,0.00022176585,0.0002406518,0.0021938747,0.0005509363,0.0016979018,0.0006059016,0.00061837357,0.00026779616],"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.0021131414,0.0006556612,0.0101100635,0.00018749849,0.0000868446,0.0001583605,0.00015036429,0.84407896,0.007736987,0.028278291,0.007752357,0.09869133],"study_design_scores_gemma":[0.0000055385744,0.00012823632,0.00075119775,0.0000034385532,0.000016345934,0.000021404947,0.000032002474,0.9967284,0.0010424361,0.0010823237,0.00018455571,0.0000041160606],"about_ca_topic_score_codex":0.0045604757,"about_ca_topic_score_gemma":0.0044809887,"teacher_disagreement_score":0.0045604757,"about_ca_system_score_codex":0.0022660508,"about_ca_system_score_gemma":0.001109556,"threshold_uncertainty_score":0.01947695},"labels":[],"label_agreement":null},{"id":"W2023661106","doi":"10.1007/s11276-013-0654-1","title":"A QoS aware joint design for wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Wireless mesh network; Computer network; Quality of service; Distributed computing; Throughput; Packet loss; Scheduling (production processes); Network packet; Wireless network; Wireless; Telecommunications","score_opus":0.023224002942422096,"score_gpt":0.22952242140121365,"score_spread":0.20629841845879154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023661106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009547691,0.00022917865,0.98773384,0.00012121081,0.00007258241,0.00004929363,0.000023039103,0.00030802438,0.0019151598],"genre_scores_gemma":[0.61919135,0.00041180153,0.3750856,0.00013999862,0.00014428212,0.00020560162,0.00008113803,0.00019247149,0.004547698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988689,0.0003605881,0.00007178393,0.00017156468,0.00038768887,0.00013943695],"domain_scores_gemma":[0.9987581,0.0004355972,0.00010394198,0.00021348958,0.00041211516,0.00007686218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015793263,0.0006743923,0.0006769,0.00049190706,0.00063251954,0.001078641,0.0017176454,0.0006732255,0.002818513],"category_scores_gemma":[0.0035204114,0.00052752945,0.00045770928,0.000459763,0.00042184204,0.0015151225,0.0015963165,0.0009163347,0.0005006803],"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.00042800556,0.00025743854,0.001267991,0.00027065116,0.00012440547,0.00019141263,0.00023599794,0.56212896,0.06352599,0.0652657,0.004855029,0.30144846],"study_design_scores_gemma":[0.000017959213,0.00012410402,0.00008677881,0.000009740631,0.000034230503,0.00005993728,0.000022868522,0.9861334,0.0046903035,0.0066539785,0.0021564113,0.000010192675],"about_ca_topic_score_codex":0.00086624094,"about_ca_topic_score_gemma":0.0025089323,"teacher_disagreement_score":0.002818513,"about_ca_system_score_codex":0.0006854688,"about_ca_system_score_gemma":0.00097268895,"threshold_uncertainty_score":0.009428918},"labels":[],"label_agreement":null},{"id":"W2024953999","doi":"10.1007/s11276-006-7530-1","title":"Admission control with load balancing in IEEE 802.11-based ESS mesh networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Blocking (statistics); Computer network; Admission control; Wireless mesh network; IEEE 802.11s; Connection (principal bundle); Mesh networking; Scheme (mathematics); IEEE 802; Load balancing (electrical power); Path (computing); IEEE 802.11; Switched mesh; Distributed computing; Wireless lan; Wireless network; Telecommunications; Wireless; Grid; Quality of service","score_opus":0.0057093400213924835,"score_gpt":0.21396315604382973,"score_spread":0.20825381602243725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024953999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25016582,0.0013445229,0.7357286,0.0012278594,0.0003750187,0.000110835805,0.00008014272,0.0011220045,0.0098451255],"genre_scores_gemma":[0.98713595,0.00012192058,0.010894176,0.00006716983,0.00010962073,0.000029281817,0.000025050507,0.000020451245,0.0015962224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888283,0.00034134768,0.00008849981,0.00013343246,0.0003647494,0.00018922787],"domain_scores_gemma":[0.997799,0.0011894675,0.00019502519,0.00025718394,0.00044271923,0.000116529074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979942,0.0003626573,0.0005435308,0.0006653601,0.0007723538,0.0014800774,0.0014568974,0.0006224117,0.0014427946],"category_scores_gemma":[0.005987086,0.0002640953,0.00017891175,0.00057560473,0.00084554387,0.0017463522,0.0014045688,0.00096672616,0.00023648796],"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.0014150428,0.00047118124,0.0034284657,0.00012713386,0.000082936596,0.00023656222,0.0007770685,0.5831153,0.029364536,0.06851457,0.004489147,0.307978],"study_design_scores_gemma":[0.000022284825,0.00005592032,0.000335597,0.0000052476626,0.000014189513,0.000034525485,0.000057774494,0.9830671,0.0027803164,0.012679016,0.0009363941,0.000011625406],"about_ca_topic_score_codex":0.0023004233,"about_ca_topic_score_gemma":0.0024190869,"teacher_disagreement_score":0.0023004233,"about_ca_system_score_codex":0.0008980536,"about_ca_system_score_gemma":0.0007174077,"threshold_uncertainty_score":0.010471106},"labels":[],"label_agreement":null},{"id":"W2025510467","doi":"10.1007/s11276-010-0292-9","title":"Optimal channel access for TCP performance improvement in cognitive radio networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Computer science; Computer network; Cognitive radio; Throughput; TCP tuning; Transport layer; Channel (broadcasting); TCP acceleration; TCP global synchronization; TCP Friendly Rate Control; Transmission Control Protocol; Zeta-TCP; Frame (networking); CUBIC TCP; Layer (electronics); Network packet; Telecommunications; Wireless","score_opus":0.015908261345249856,"score_gpt":0.25795456169294695,"score_spread":0.24204630034769709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025510467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17611773,0.003614061,0.80856043,0.0009187352,0.00035796402,0.00007019703,0.00008752774,0.0006331177,0.009640299],"genre_scores_gemma":[0.98701036,0.0003069531,0.0120169595,0.00005459799,0.000104322346,0.000020070216,0.000011186632,0.000027924776,0.00044754785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853575,0.00046794597,0.000056013836,0.00018509041,0.00036269095,0.00039241678],"domain_scores_gemma":[0.99344605,0.0052244463,0.00025098954,0.0002794802,0.0006355704,0.00016341769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024570124,0.0006436924,0.0010333133,0.00089486496,0.0008130222,0.001837235,0.0007793906,0.00076869427,0.002000304],"category_scores_gemma":[0.012545624,0.000513765,0.00029335747,0.00076998165,0.0014247586,0.0014807831,0.0011732671,0.0011835379,0.00017546696],"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.0007929133,0.00036330184,0.0011880039,0.00017777464,0.00008788355,0.0001546881,0.00022550236,0.8037975,0.017482206,0.05923875,0.0032607934,0.11323068],"study_design_scores_gemma":[0.00002333275,0.000048482416,0.00022152175,0.00000808401,0.000022631599,0.000029678398,0.00002098249,0.98204124,0.0014489762,0.015924267,0.00019891634,0.000011947005],"about_ca_topic_score_codex":0.0025568083,"about_ca_topic_score_gemma":0.0034604936,"teacher_disagreement_score":0.0025568083,"about_ca_system_score_codex":0.0012170683,"about_ca_system_score_gemma":0.002008333,"threshold_uncertainty_score":0.012994051},"labels":[],"label_agreement":null},{"id":"W2025661434","doi":"10.1023/a:1019197816601","title":"Performance evaluation of path optimization schemes for inter‐switch handoff in wireless ATM networks","year":2000,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Handover; Computer science; Path (computing); Computer network; Base station; Protocol (science); Optimization problem; Wireless; Real-time computing; Algorithm; Telecommunications","score_opus":0.012990159347597226,"score_gpt":0.23569048852139526,"score_spread":0.22270032917379803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025661434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.880668,0.0017532823,0.113181256,0.00024077187,0.00008362394,0.000116007606,0.00009506665,0.00047115178,0.0033908421],"genre_scores_gemma":[0.9867046,0.00015365354,0.012638835,0.000019460775,0.000015093899,0.000013625957,0.000035133144,0.0000144073965,0.00040520306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844426,0.0007388381,0.00006264176,0.000113505324,0.00036854655,0.00027236954],"domain_scores_gemma":[0.994955,0.003774158,0.00030084,0.00028136495,0.0005522024,0.00013640751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003241429,0.0007853815,0.00073519227,0.0007720157,0.000604542,0.0007129578,0.0009013033,0.00074561813,0.0013630398],"category_scores_gemma":[0.005904183,0.00020973786,0.00024205554,0.0008593349,0.000595264,0.00088701525,0.0005732641,0.0005399431,0.00008756994],"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.0023079903,0.0005570469,0.002039222,0.00010588958,0.00010485573,0.00004217069,0.000068604735,0.8742756,0.011247153,0.0026529173,0.0007965928,0.105802],"study_design_scores_gemma":[0.000034184675,0.0002901198,0.00061984576,0.0000026305518,0.000024181896,0.00001516136,0.000017341274,0.9964191,0.0022077004,0.0002914773,0.00007218037,0.0000062095296],"about_ca_topic_score_codex":0.0039287903,"about_ca_topic_score_gemma":0.0044005183,"teacher_disagreement_score":0.0039287903,"about_ca_system_score_codex":0.0015255488,"about_ca_system_score_gemma":0.0009822835,"threshold_uncertainty_score":0.017142534},"labels":[],"label_agreement":null},{"id":"W2025837956","doi":"10.1007/s11276-007-0026-9","title":"Statistical multiplexing, admission region, and contention window optimization in multiclass wireless LANs","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Statistical time division multiplexing; Computer network; Quality of service; Admission control; Window (computing); Multiplexing; Wireless network; Hurst exponent; Throughput; Wireless; Telecommunications","score_opus":0.01720286982917025,"score_gpt":0.2640553686870476,"score_spread":0.24685249885787736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025837956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18915024,0.00647707,0.79837847,0.0013614264,0.00020544774,0.000051966632,0.00008469856,0.0004676386,0.003823099],"genre_scores_gemma":[0.9708345,0.0010831229,0.025949178,0.00009857513,0.0003162808,0.000043654312,0.000027430739,0.000079864745,0.0015674039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734974,0.0012727786,0.00008591092,0.00027494197,0.0005742104,0.0004423022],"domain_scores_gemma":[0.98408073,0.013128371,0.0011450485,0.0004808278,0.00071198103,0.00045306984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071627917,0.00096877635,0.0024256501,0.001291353,0.0011609138,0.0023490665,0.0022849587,0.0009715414,0.0010552241],"category_scores_gemma":[0.016492506,0.0010468798,0.00044838936,0.002056701,0.0021866404,0.0030206093,0.0017509876,0.0019279234,0.00014650518],"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.00046189854,0.00014014149,0.0011860636,0.00006705313,0.000070665956,0.00009110149,0.0001485206,0.89742416,0.0027444903,0.061100677,0.001244599,0.03532055],"study_design_scores_gemma":[0.0000090062185,0.000017022867,0.00010645759,0.0000019662357,0.000012163225,0.00001352486,0.000010430392,0.9883406,0.00023975768,0.011134858,0.0001076178,0.0000065778886],"about_ca_topic_score_codex":0.0061864844,"about_ca_topic_score_gemma":0.004504647,"teacher_disagreement_score":0.0071627917,"about_ca_system_score_codex":0.0031908294,"about_ca_system_score_gemma":0.0022389318,"threshold_uncertainty_score":0.037880957},"labels":[],"label_agreement":null},{"id":"W2026540849","doi":"10.1007/s11276-013-0546-4","title":"Fair resource allocation and DF relay selection for multiuser OFDMA-based cooperative networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Relay; Mathematical optimization; Subcarrier; Resource allocation; Selection (genetic algorithm); Optimization problem; Joint (building); Iterative method; Simple (philosophy); Power (physics); Algorithm; Orthogonal frequency-division multiplexing; Computer network; Mathematics","score_opus":0.017391700644767995,"score_gpt":0.2446251056722959,"score_spread":0.2272334050275279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026540849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054720555,0.00065633823,0.9413954,0.00020075725,0.0000879272,0.000072115974,0.000065148495,0.00011984813,0.0026818134],"genre_scores_gemma":[0.94710153,0.0002115381,0.05052967,0.00005354594,0.000083467334,0.000096187476,0.000030703162,0.000018352765,0.0018751419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892455,0.00042700447,0.00004254933,0.00016495572,0.0002348517,0.00020606432],"domain_scores_gemma":[0.99628,0.0029175936,0.00016109184,0.00024181139,0.0003010166,0.00009845038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028762154,0.00062924204,0.0011932526,0.0007256109,0.0011880368,0.0012950974,0.0015133078,0.00080401695,0.0015257115],"category_scores_gemma":[0.0075534903,0.00043278225,0.00035778407,0.0009767383,0.0011779272,0.0012567719,0.0011930004,0.00057784683,0.00023496058],"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.0007971814,0.00019999106,0.0013339804,0.00010409185,0.000108071516,0.000260337,0.00044334363,0.7889735,0.010857711,0.09291007,0.0030809166,0.10093073],"study_design_scores_gemma":[0.000029723682,0.00004609871,0.00012749803,0.0000033490462,0.000015652842,0.00003934092,0.00002274562,0.9812144,0.0008092023,0.017350657,0.00033136387,0.00000999811],"about_ca_topic_score_codex":0.004848188,"about_ca_topic_score_gemma":0.009002893,"teacher_disagreement_score":0.004848188,"about_ca_system_score_codex":0.0013442156,"about_ca_system_score_gemma":0.0016243437,"threshold_uncertainty_score":0.015211105},"labels":[],"label_agreement":null},{"id":"W2029320761","doi":"10.1007/s11276-011-0333-z","title":"Use of flip ambiguity probabilities in robust sensor network localization","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ambiguity; Computer science; Wireless sensor network; Set (abstract data type); Algorithm; Expression (computer science); Graph; Data mining; Theoretical computer science; Computer network","score_opus":0.04435432677390935,"score_gpt":0.19279704349912277,"score_spread":0.14844271672521342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029320761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010408189,0.00025208705,0.988,0.000102813545,0.00004029005,0.000013068807,0.000023533748,0.00014290209,0.0010170637],"genre_scores_gemma":[0.7863943,0.0007444454,0.2106322,0.0001506605,0.00015622829,0.000077459066,0.00012260019,0.00016088065,0.0015611717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984212,0.000658471,0.000074682066,0.000245741,0.00047600485,0.00012402346],"domain_scores_gemma":[0.9881175,0.00856286,0.0008331044,0.0014313783,0.00086914195,0.0001858411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032328963,0.0009424377,0.0010387577,0.0014233042,0.00074759685,0.0014573379,0.0009202176,0.0012812958,0.0016447745],"category_scores_gemma":[0.02782808,0.0007432796,0.00057760545,0.0013539257,0.0019241129,0.0041869255,0.0027681473,0.0013262661,0.00030167235],"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.00045081694,0.000053293683,0.0027297207,0.00012481505,0.00008300182,0.00021532134,0.000107652,0.72491384,0.0058574113,0.10913746,0.000933106,0.15539353],"study_design_scores_gemma":[0.000020490468,0.00006334072,0.0005550755,0.000022773756,0.000034357283,0.00017250632,0.000022052334,0.93391913,0.0049002827,0.059430648,0.00082638586,0.000033026554],"about_ca_topic_score_codex":0.0007410252,"about_ca_topic_score_gemma":0.0007778273,"teacher_disagreement_score":0.0032328963,"about_ca_system_score_codex":0.00057403115,"about_ca_system_score_gemma":0.0006480993,"threshold_uncertainty_score":0.017097414},"labels":[],"label_agreement":null},{"id":"W2030941986","doi":"10.1007/s11276-006-8970-3","title":"Cross-layer radio resource allocation in packet CDMA wireless mobile networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","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":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Quality of service; Radio resource management; Wireless network; Network packet; Physical layer; Cellular network; Network layer; Wireless; Layer (electronics); Telecommunications","score_opus":0.016043594028759423,"score_gpt":0.2792422118734477,"score_spread":0.2631986178446883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030941986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051745534,0.0037894647,0.93840945,0.00028573463,0.0003213879,0.00006933241,0.000037323247,0.0005682972,0.0047734706],"genre_scores_gemma":[0.8765367,0.0014495186,0.11585709,0.00028007256,0.00028794192,0.000118243486,0.0000793004,0.00010689706,0.0052842186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892116,0.00039957635,0.00005095055,0.00012141451,0.00031286245,0.00019410219],"domain_scores_gemma":[0.99783605,0.0013941764,0.00012668704,0.00023359564,0.0003388976,0.00007065628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026332552,0.00046728193,0.0006023992,0.0005316455,0.0005817453,0.0014782068,0.001038727,0.00060123537,0.0020873465],"category_scores_gemma":[0.0058199046,0.00045536712,0.00020050151,0.0008158121,0.0005896748,0.0013942091,0.0010711913,0.0008789795,0.00036955686],"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.00069702393,0.00037472302,0.002299507,0.00021670423,0.00013187672,0.00017146034,0.0001602529,0.47200197,0.026419032,0.04393595,0.0051305266,0.4484609],"study_design_scores_gemma":[0.000022897037,0.00010908417,0.0006472544,0.000009859254,0.000042109677,0.00013905241,0.000031724452,0.9812444,0.0061207316,0.008884506,0.0027325468,0.000015761532],"about_ca_topic_score_codex":0.001414127,"about_ca_topic_score_gemma":0.0017970994,"teacher_disagreement_score":0.0026332552,"about_ca_system_score_codex":0.0006062366,"about_ca_system_score_gemma":0.0007243,"threshold_uncertainty_score":0.013926148},"labels":[],"label_agreement":null},{"id":"W2030959711","doi":"10.1007/s11276-015-0914-3","title":"A prediction-based clustering algorithm for tracking targets in quantized areas for wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Wireless sensor network; Cluster analysis; Context (archaeology); Event (particle physics); Overhead (engineering); Tracking (education); Kalman filter; Node (physics); Set (abstract data type); Data mining; Real-time computing; Task (project management); Algorithm; Field (mathematics); Distributed computing; Machine learning; Artificial intelligence; Computer network","score_opus":0.03490619296519645,"score_gpt":0.25493059487199604,"score_spread":0.2200244019067996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030959711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008203373,0.0002134258,0.990274,0.00008255257,0.00005942558,0.000040073533,0.00004329496,0.0005689493,0.00051492086],"genre_scores_gemma":[0.31807294,0.0003992708,0.67776626,0.00013425466,0.000080552905,0.00021906139,0.0003964008,0.00013496958,0.0027962804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950063,0.00007225985,0.000029995967,0.00013600712,0.00020861479,0.000052402072],"domain_scores_gemma":[0.9989396,0.0003769309,0.000084819236,0.0001512691,0.0004067613,0.000040709954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074937247,0.0007458342,0.0011874434,0.000853769,0.0010566108,0.00054075354,0.0023506125,0.0009853814,0.001279494],"category_scores_gemma":[0.0030358168,0.00047147446,0.0004828304,0.0016537957,0.00047994484,0.0014606029,0.0011412329,0.0011441594,0.00059713045],"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.00021262624,0.000114489376,0.0010387946,0.000075674296,0.00005614339,0.00005380624,0.00012005778,0.59312093,0.009253785,0.0056277383,0.0054408624,0.38488516],"study_design_scores_gemma":[0.0000074027457,0.000022261429,0.00015539998,0.0000029399143,0.0000065987538,0.000023605075,0.000010242694,0.99675435,0.0013089797,0.0013337034,0.00036749232,0.000007030529],"about_ca_topic_score_codex":0.01342921,"about_ca_topic_score_gemma":0.018586628,"teacher_disagreement_score":0.01342921,"about_ca_system_score_codex":0.0009696504,"about_ca_system_score_gemma":0.0013970342,"threshold_uncertainty_score":0.026702106},"labels":[],"label_agreement":null},{"id":"W2036198192","doi":"10.1007/s11276-009-0220-z","title":"A sustainable heuristic QoS routing algorithm for pervasive multi-layered satellite wireless networks","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Satellite Communication Systems","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"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; Quality of service; Computer network; Heuristic; Distributed computing; Packet loss; Routing (electronic design automation); Algorithm; Network packet","score_opus":0.018034602558021147,"score_gpt":0.24619216457856102,"score_spread":0.22815756202053988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036198192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062946804,0.0003498389,0.9321173,0.00023697756,0.000110002045,0.0000866073,0.00007413265,0.0006718178,0.003406546],"genre_scores_gemma":[0.529985,0.00022763693,0.4663531,0.00015642698,0.000051870757,0.00014917146,0.00023960606,0.000119517455,0.0027176652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973816,0.00006415974,0.000011924099,0.000036791636,0.00008725784,0.0000617176],"domain_scores_gemma":[0.9994392,0.00026805513,0.000054556484,0.00006248129,0.00011695662,0.000058731017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078112894,0.0006594459,0.00079841906,0.0008584645,0.000630409,0.0006873243,0.0015164628,0.00082630175,0.001736263],"category_scores_gemma":[0.0016898699,0.00039055993,0.00040543173,0.000886545,0.00052997126,0.0006850763,0.0009385447,0.00069885113,0.00024262577],"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.00015935898,0.00009428094,0.0007358945,0.00004709264,0.00005216434,0.00006595417,0.000055998928,0.8676694,0.003446794,0.009380664,0.0025799864,0.11571242],"study_design_scores_gemma":[0.000020402224,0.000025840856,0.000070677146,0.0000032604944,0.000008987502,0.000017889472,0.000014195045,0.99665546,0.0003995596,0.0024117588,0.00036826977,0.0000037099019],"about_ca_topic_score_codex":0.005492084,"about_ca_topic_score_gemma":0.008101743,"teacher_disagreement_score":0.005492084,"about_ca_system_score_codex":0.0010077304,"about_ca_system_score_gemma":0.0014030935,"threshold_uncertainty_score":0.010920227},"labels":[],"label_agreement":null},{"id":"W2036298617","doi":"10.1007/s11276-014-0733-y","title":"Efficient MAC protocol design and performance analysis for dense WLANs","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Computer network; Throughput; Bandwidth (computing); Quality of service; Overhead (engineering); Bandwidth allocation; Wireless network; Network allocation vector; Channel (broadcasting); Wireless; IEEE 802.11; Telecommunications","score_opus":0.01748092224161262,"score_gpt":0.25553524195110683,"score_spread":0.2380543197094942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036298617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029291468,0.0007365827,0.9667486,0.00015206666,0.000036076617,0.00010584352,0.00006170155,0.0003897115,0.0024779944],"genre_scores_gemma":[0.7694242,0.0013753017,0.22484237,0.000111093104,0.0001938607,0.00028606935,0.00020211513,0.00015144191,0.003413499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690104,0.0009658356,0.00014058744,0.00019094923,0.0014514929,0.0003501072],"domain_scores_gemma":[0.9936313,0.0039494457,0.0004790727,0.00079064566,0.0010599581,0.00008951747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045854,0.0013280198,0.0010618338,0.0020662851,0.00082168996,0.001970224,0.0014879708,0.00062599307,0.0020626434],"category_scores_gemma":[0.011550798,0.0011475082,0.00059072423,0.00140933,0.0010131308,0.0025557678,0.0018008933,0.0014133132,0.00045947233],"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.00022951383,0.00020060789,0.001763083,0.00024458917,0.00010464327,0.00013173398,0.00019660247,0.816117,0.021673463,0.058578826,0.0017618737,0.09899809],"study_design_scores_gemma":[0.000006633911,0.000064036496,0.00023395961,0.000008161375,0.00002309997,0.000051437153,0.000023524439,0.9904869,0.0022127014,0.0064430693,0.00043810694,0.000008401435],"about_ca_topic_score_codex":0.002267487,"about_ca_topic_score_gemma":0.003381721,"teacher_disagreement_score":0.0045854,"about_ca_system_score_codex":0.0019592629,"about_ca_system_score_gemma":0.0018934375,"threshold_uncertainty_score":0.02425021},"labels":[],"label_agreement":null},{"id":"W2037380211","doi":"10.1007/s11276-008-0149-7","title":"Impact of traffic localization on communication rates in ad-hoc networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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; Constant (computer programming); Upper and lower bounds; Domain (mathematical analysis); Vehicular ad hoc network; Telecommunications; Wireless; Mathematics","score_opus":0.015403779114658612,"score_gpt":0.25959970086556006,"score_spread":0.24419592175090143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037380211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9033269,0.0030815913,0.082607485,0.0013854656,0.00026075833,0.00006408228,0.00029438094,0.00129093,0.0076884143],"genre_scores_gemma":[0.9952844,0.0005536082,0.0030475946,0.00004524241,0.00005783172,0.000019211619,0.00008590685,0.000121799836,0.0007845374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955895,0.0023601023,0.00015662027,0.00034172199,0.00083131663,0.00072082086],"domain_scores_gemma":[0.8524284,0.12873717,0.005496491,0.0051582316,0.0070745084,0.00110518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076519074,0.00086852006,0.001049519,0.0016744885,0.0011793358,0.0017405536,0.0010628343,0.0014459471,0.0021173158],"category_scores_gemma":[0.065912485,0.0008237204,0.00043926243,0.0014886091,0.0012594591,0.0039312057,0.0015666105,0.0012366405,0.00072944246],"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.002739159,0.00050587,0.014935709,0.0002559386,0.0000825547,0.00045058833,0.000321896,0.8394174,0.02475862,0.00946652,0.0026720637,0.104393624],"study_design_scores_gemma":[0.0001463528,0.0013775465,0.008310633,0.00009567445,0.00023697592,0.000843095,0.0005457785,0.9307872,0.049395867,0.0067136674,0.0014131605,0.00013411912],"about_ca_topic_score_codex":0.0020921025,"about_ca_topic_score_gemma":0.001839834,"teacher_disagreement_score":0.0076519074,"about_ca_system_score_codex":0.0015267229,"about_ca_system_score_gemma":0.00080567086,"threshold_uncertainty_score":0.04046768},"labels":[],"label_agreement":null},{"id":"W2040183047","doi":"10.1007/s11276-006-0009-2","title":"Guest editorial on selected papers from WiOpt’05","year":2007,"lang":"en","type":"editorial","venue":"Wireless Networks","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval; Data science","score_opus":0.03017029306893062,"score_gpt":0.32730356083499956,"score_spread":0.29713326776606896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040183047","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055849316,0.00510949,0.00032447372,0.024044937,0.967107,0.000029655692,0.000105277315,0.000061443156,0.0031618942],"genre_scores_gemma":[0.000816782,0.0052183312,0.0002681718,0.011012397,0.9520035,0.000040599632,0.00012067491,0.000112430644,0.030407224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99618715,0.00051918544,0.00040488708,0.0004000561,0.0021282109,0.00036053977],"domain_scores_gemma":[0.9857949,0.0031429804,0.0011180929,0.00034476593,0.0075038373,0.002095419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056965114,0.003538031,0.002952085,0.004863825,0.0024685278,0.0084820865,0.0024972456,0.008687209,0.028415615],"category_scores_gemma":[0.015512122,0.0009471159,0.0023604264,0.0020144389,0.0013543261,0.0026557609,0.0018580272,0.009718576,0.015991887],"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.000041349133,0.000008293109,0.000015891737,0.00009278046,0.000014152734,0.00008599058,0.0000040656723,0.000023753008,0.000062752304,0.00014018573,0.99552214,0.0039887032],"study_design_scores_gemma":[0.00006402392,0.000026160948,0.00027564942,0.00022067144,0.000071878036,0.00019079172,0.000018006462,0.00017236958,0.0002360252,0.00063929876,0.9980679,0.000017283006],"about_ca_topic_score_codex":0.001939941,"about_ca_topic_score_gemma":0.0061882176,"teacher_disagreement_score":0.028415615,"about_ca_system_score_codex":0.0029901536,"about_ca_system_score_gemma":0.0024060626,"threshold_uncertainty_score":0.09505969},"labels":[],"label_agreement":null},{"id":"W2043998197","doi":"10.1007/s11276-009-0175-0","title":"Dynamically optimized spatiotemporal prioritization for spectrum sensing in cooperative cognitive radio","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Information Industry, Ministry of Science and Technology, Taiwan; Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Overhead (engineering); Spectrum (functional analysis); Prioritization; Computer network; Cognition; Telecommunications; Algorithm; Wireless","score_opus":0.009295608154966408,"score_gpt":0.24105201546571053,"score_spread":0.23175640731074412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043998197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18002225,0.0008405336,0.8141245,0.00044440376,0.00013839017,0.00006144548,0.00006344417,0.00029474217,0.0040102364],"genre_scores_gemma":[0.9763116,0.0001054449,0.022933815,0.00004304614,0.000032051837,0.000022639246,0.000016825405,0.000016485063,0.0005181777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996445,0.000073338226,0.000019631745,0.00008455471,0.00010138441,0.000076543416],"domain_scores_gemma":[0.9984648,0.00088635593,0.00016571103,0.00012334285,0.00023771169,0.00012207175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007708663,0.00047353844,0.0006838034,0.0004728966,0.0006137339,0.00095299276,0.0011354424,0.00052763254,0.0009337252],"category_scores_gemma":[0.004004405,0.00035522555,0.00017198708,0.00048039522,0.00045995918,0.0011608397,0.00091114925,0.0004897987,0.00017716883],"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.0010951847,0.00034584172,0.0033759007,0.00013862552,0.00008256594,0.00039890243,0.0003879545,0.72579163,0.07212157,0.029562904,0.0022385318,0.16446039],"study_design_scores_gemma":[0.000025318992,0.00005837338,0.00038324628,0.000003474567,0.0000126196865,0.000058907168,0.00004584922,0.9901101,0.0027695603,0.0062175966,0.0003063857,0.000008419104],"about_ca_topic_score_codex":0.0021993218,"about_ca_topic_score_gemma":0.0044857627,"teacher_disagreement_score":0.0021993218,"about_ca_system_score_codex":0.00069279684,"about_ca_system_score_gemma":0.0012163502,"threshold_uncertainty_score":0.0050266385},"labels":[],"label_agreement":null},{"id":"W2046169472","doi":"10.1007/s11276-007-0028-7","title":"Quality of service in heterogeneous wired/wireless networks","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Heterogeneous network; Wireless network; Wireless; Quality of service; Service quality; Telecommunications; Service (business)","score_opus":0.01649609967849788,"score_gpt":0.2563925517968861,"score_spread":0.2398964521183882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046169472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32066742,0.008972582,0.65496933,0.0028589237,0.00046989458,0.00010396601,0.00020879511,0.0003855442,0.01136358],"genre_scores_gemma":[0.9876588,0.00091229577,0.009729879,0.00007094651,0.00021437644,0.000029414994,0.00005861681,0.000028650386,0.0012970264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978788,0.00073246507,0.000093361945,0.00020279543,0.000775339,0.00031721892],"domain_scores_gemma":[0.9941532,0.003883603,0.0005361287,0.00030830468,0.0008362459,0.0002825496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004174958,0.00050140626,0.0012007979,0.0010717125,0.0008358434,0.0030713067,0.0014392616,0.0010756114,0.0013684389],"category_scores_gemma":[0.011528595,0.00046216632,0.00028602825,0.001713062,0.0013369501,0.0029650496,0.001100191,0.0010026237,0.0001517655],"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.0005639715,0.00016719432,0.006439768,0.00018553395,0.00010191846,0.00041259857,0.00032162224,0.6048291,0.0062169596,0.28715098,0.004058272,0.08955207],"study_design_scores_gemma":[0.00002418626,0.000040230112,0.0013418001,0.00001234861,0.000033899385,0.00007568042,0.00008011402,0.9255341,0.000533027,0.071133345,0.0011744265,0.00001681018],"about_ca_topic_score_codex":0.003987738,"about_ca_topic_score_gemma":0.0024347955,"teacher_disagreement_score":0.004174958,"about_ca_system_score_codex":0.0027126858,"about_ca_system_score_gemma":0.0008357041,"threshold_uncertainty_score":0.022079587},"labels":[],"label_agreement":null},{"id":"W2048194897","doi":"10.1007/s11276-008-0132-3","title":"A new bandwidth allocation mechanism for next generation wireless cellular networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Quality of service; Time division multiple access; Bandwidth (computing); Throughput; Wireless; Multiplexing; Wireless network; Cellular traffic; Cellular network; Channel (broadcasting); Scheme (mathematics); Channel allocation schemes; Telecommunications","score_opus":0.021891743707991462,"score_gpt":0.20572599616569864,"score_spread":0.18383425245770718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048194897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016990636,0.0011022233,0.97508234,0.0004653301,0.0006407384,0.00011770848,0.000077804994,0.0010032327,0.0045200633],"genre_scores_gemma":[0.6104416,0.0009739503,0.37239766,0.00066098105,0.0009852981,0.00046060816,0.00020994728,0.00027079743,0.013599153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985892,0.00036589068,0.00009214368,0.00019366665,0.00050284783,0.00025619037],"domain_scores_gemma":[0.9981653,0.0005363343,0.00014513038,0.0004969174,0.000527762,0.00012857091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025417723,0.00072845403,0.0012447846,0.0012815411,0.0012152727,0.0021747923,0.003367896,0.0014446636,0.004494892],"category_scores_gemma":[0.004969417,0.00047465108,0.0005603304,0.0014245387,0.000849187,0.0033386233,0.0020271635,0.0020401361,0.0009336229],"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.0008212633,0.0004977645,0.0006847115,0.00026961364,0.00018532004,0.00016411104,0.00020944451,0.14861384,0.041003384,0.253532,0.021067759,0.5329507],"study_design_scores_gemma":[0.0001203142,0.00016016465,0.00032397342,0.00003484205,0.000103105485,0.0003368312,0.000044600354,0.9111212,0.007124609,0.058326986,0.022228004,0.00007541409],"about_ca_topic_score_codex":0.0011434947,"about_ca_topic_score_gemma":0.0016950897,"teacher_disagreement_score":0.004494892,"about_ca_system_score_codex":0.0010597666,"about_ca_system_score_gemma":0.0013986017,"threshold_uncertainty_score":0.015036941},"labels":[],"label_agreement":null},{"id":"W2048246470","doi":"10.1007/s11276-014-0697-y","title":"Bee colony optimization aided adaptive resource allocation in OFDMA systems with proportional rate constraints","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":11,"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","funders":"","keywords":"Computer science; Resource allocation; Mathematical optimization; Orthogonal frequency-division multiple access; Orthogonal frequency-division multiplexing; Telecommunications; Computer network; Mathematics","score_opus":0.005567075929725015,"score_gpt":0.18282231882482336,"score_spread":0.17725524289509834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048246470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15150888,0.00090087886,0.833659,0.00036877746,0.0001159836,0.000057482237,0.000058172463,0.00017070108,0.013160136],"genre_scores_gemma":[0.9451549,0.00019159647,0.050749496,0.00005170088,0.000025931815,0.000050420895,0.000021630793,0.000021051455,0.0037332305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998258,0.000071412964,0.000005850132,0.000017925577,0.00004811552,0.000030898333],"domain_scores_gemma":[0.9995486,0.00031813027,0.00003745612,0.000020860001,0.00006274072,0.000012152965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036573346,0.00035374754,0.00047109154,0.00019779833,0.00021898473,0.0005285421,0.0005312987,0.0004944826,0.0014967787],"category_scores_gemma":[0.0014947889,0.00018760539,0.00015998987,0.00042445064,0.0002781646,0.00039451223,0.00036866748,0.00039627778,0.00013252458],"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.00005881304,0.000039125654,0.00023288642,0.000029231413,0.000020811487,0.000047622027,0.00002290893,0.96574104,0.0021872844,0.004657375,0.0007139586,0.026249086],"study_design_scores_gemma":[0.0000034655432,0.0000067796673,0.00003769294,7.872352e-7,0.0000017403758,0.0000039488696,0.0000018125785,0.99939585,0.000107648695,0.00037256323,0.000066924986,7.3216705e-7],"about_ca_topic_score_codex":0.0035021456,"about_ca_topic_score_gemma":0.00425796,"teacher_disagreement_score":0.0035021456,"about_ca_system_score_codex":0.0003250442,"about_ca_system_score_gemma":0.00048279727,"threshold_uncertainty_score":0.006963551},"labels":[],"label_agreement":null},{"id":"W2050014989","doi":"10.1007/s11276-008-0123-4","title":"TCP CERL: congestion control enhancement over wireless networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"TCP global synchronization; Zeta-TCP; TCP Friendly Rate Control; TCP Westwood; TCP Westwood plus; TCP Vegas; TCP acceleration; Compound TCP; Computer science; H-TCP; CUBIC TCP; Computer network; TCP tuning; Network congestion; Network packet","score_opus":0.00892784627774226,"score_gpt":0.20611534362937542,"score_spread":0.19718749735163316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050014989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03192658,0.003105287,0.85169345,0.0014133453,0.0021458124,0.00058135076,0.0005633342,0.085501865,0.02306908],"genre_scores_gemma":[0.6392388,0.0019236158,0.3201084,0.0014128834,0.0018236996,0.00060990156,0.0017734232,0.0050600646,0.02804917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986707,0.00032397002,0.00005228925,0.00018358589,0.00057439186,0.0001950389],"domain_scores_gemma":[0.997654,0.00066955487,0.00014788445,0.0006059464,0.0006253774,0.00029730095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027557334,0.0011007142,0.00095194636,0.0014784505,0.0007330487,0.0014907193,0.0022456697,0.00079270604,0.0071269465],"category_scores_gemma":[0.0055771745,0.0005162093,0.00031130927,0.00077006273,0.00092397875,0.0018069398,0.0015960785,0.002624742,0.0018590832],"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.0019470691,0.00090521266,0.0021029578,0.0006734743,0.00013768859,0.00063717336,0.00019011808,0.0503214,0.058646258,0.037880402,0.1226117,0.7239465],"study_design_scores_gemma":[0.0006019068,0.00064805197,0.001227233,0.00007370233,0.00014785696,0.0006775253,0.00002869084,0.837157,0.074712016,0.012321345,0.07230308,0.0001015099],"about_ca_topic_score_codex":0.0014183937,"about_ca_topic_score_gemma":0.001650113,"teacher_disagreement_score":0.0071269465,"about_ca_system_score_codex":0.00086376665,"about_ca_system_score_gemma":0.0009551115,"threshold_uncertainty_score":0.023842037},"labels":[],"label_agreement":null},{"id":"W2055928849","doi":"10.1007/s11276-014-0698-x","title":"Path diversified multi-QoS optimization in multi-channel wireless mesh networks","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Wireless mesh network; Computer network; Distributed computing; Quality of service; Throughput; Path (computing); Channel (broadcasting); Node (physics); Bandwidth (computing); Wireless network; Wireless; Telecommunications","score_opus":0.018196145939821835,"score_gpt":0.22713272892009756,"score_spread":0.20893658298027573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055928849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07804414,0.0014430281,0.9162073,0.0004273054,0.000116734045,0.00004072793,0.00006735809,0.00017804655,0.0034753901],"genre_scores_gemma":[0.9409475,0.00048339996,0.05602441,0.000077823366,0.000089743524,0.000050790175,0.00005430817,0.00004940809,0.002222622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995783,0.00017282974,0.000014037518,0.000058824735,0.00008433755,0.00009158335],"domain_scores_gemma":[0.99894816,0.0007047139,0.00010179114,0.00005805302,0.00013503422,0.000052274605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456694,0.00062148937,0.0007120123,0.00063233543,0.00048611683,0.0006915847,0.0010439666,0.00065440993,0.0016263307],"category_scores_gemma":[0.0023215008,0.00037438975,0.00031897906,0.0008203643,0.00048737304,0.0010522156,0.0010881289,0.00070916605,0.0001415302],"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.000086228734,0.000038193146,0.0003617488,0.00005033982,0.00003358376,0.000044162705,0.000035937323,0.9592816,0.0023721973,0.006260541,0.00076028943,0.030675042],"study_design_scores_gemma":[0.0000042818533,0.000025124984,0.00006592349,0.0000027872036,0.000005694285,0.000012582318,0.000009283124,0.9969989,0.00021068775,0.0025000481,0.0001620664,0.0000026872076],"about_ca_topic_score_codex":0.0015969161,"about_ca_topic_score_gemma":0.002282676,"teacher_disagreement_score":0.0016263307,"about_ca_system_score_codex":0.00083336217,"about_ca_system_score_gemma":0.00056044763,"threshold_uncertainty_score":0.006058991},"labels":[],"label_agreement":null},{"id":"W2058242263","doi":"10.1007/s11276-011-0383-2","title":"On batch verification with group testing for vehicular communications","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheme (mathematics); Group signature; Identity (music); Overhead (engineering); Tracing; Signature (topology); Transmission (telecommunications); Public-key cryptography; Distributed computing; Computer network; Encryption; Telecommunications; Operating system; Mathematics","score_opus":0.05280334535817559,"score_gpt":0.24091671440773416,"score_spread":0.18811336904955855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058242263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023263235,0.0005195083,0.9692556,0.0012386453,0.00032322414,0.0002779344,0.0002077749,0.0017345027,0.0031795609],"genre_scores_gemma":[0.74691933,0.0005254519,0.24170418,0.0010579216,0.0010209127,0.0006405702,0.00071452797,0.0007157525,0.0067011984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97705084,0.009960467,0.0012003593,0.0029725363,0.0056579025,0.0031578362],"domain_scores_gemma":[0.86802506,0.101251625,0.0037175613,0.018826343,0.0065352246,0.001644148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017284585,0.0031785695,0.0049079666,0.0021332258,0.0024038304,0.0035703327,0.006634988,0.0042473087,0.008128271],"category_scores_gemma":[0.06913907,0.0014738819,0.003101818,0.0021663473,0.008101114,0.013056535,0.008336547,0.0062052044,0.0015649273],"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.0049882256,0.0005926261,0.0040065465,0.00071458245,0.00045735695,0.00094419654,0.00065251003,0.4564285,0.0105576515,0.35350117,0.01597882,0.1511778],"study_design_scores_gemma":[0.00018505019,0.00022570328,0.00030187046,0.000042196632,0.00006677269,0.0000924536,0.000050678183,0.7117713,0.0038418586,0.28238794,0.0009803997,0.00005373253],"about_ca_topic_score_codex":0.00580226,"about_ca_topic_score_gemma":0.0046898574,"teacher_disagreement_score":0.017284585,"about_ca_system_score_codex":0.0036160683,"about_ca_system_score_gemma":0.005266987,"threshold_uncertainty_score":0.0914107},"labels":[],"label_agreement":null},{"id":"W2062674546","doi":"10.1007/s11276-010-0287-6","title":"Novel algorithms for the network lifetime problem in wireless settings","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"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; Wireless network; Wireless ad hoc network; Algorithm; Wireless; Transmission (telecommunications); Wireless sensor network; Energy (signal processing); Computer network; Telecommunications; Mathematics","score_opus":0.010037146703040626,"score_gpt":0.23348208840782542,"score_spread":0.2234449417047848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062674546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030283586,0.0007590594,0.99277085,0.0005056124,0.00018241083,0.00012201485,0.00008914921,0.00034424916,0.0021983034],"genre_scores_gemma":[0.105980724,0.0018160287,0.88211894,0.0005370168,0.00088113296,0.00084876514,0.00057926786,0.00042902672,0.0068090265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969902,0.0010563651,0.00017509604,0.00066994294,0.0008073498,0.00030106577],"domain_scores_gemma":[0.9844059,0.011301696,0.0010322117,0.0014606455,0.0012799772,0.0005196185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059587494,0.0024454123,0.0026464474,0.0028662616,0.0017597543,0.0034449366,0.0070293206,0.0038678825,0.007576786],"category_scores_gemma":[0.027418852,0.0013453703,0.0015125767,0.0037555548,0.0020521132,0.011419928,0.005528308,0.0054952833,0.001591798],"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.00035739725,0.0004884949,0.0010484613,0.0005319281,0.00012948671,0.00014116509,0.00039548124,0.3844007,0.0020170324,0.28164226,0.027316738,0.30153078],"study_design_scores_gemma":[0.00009305319,0.000049229617,0.00010355935,0.00004211274,0.0000297417,0.00012123561,0.000060072893,0.88234615,0.00037885222,0.11296695,0.0037847343,0.000024274445],"about_ca_topic_score_codex":0.0020874368,"about_ca_topic_score_gemma":0.0034181287,"teacher_disagreement_score":0.007576786,"about_ca_system_score_codex":0.003150867,"about_ca_system_score_gemma":0.002553786,"threshold_uncertainty_score":0.031513274},"labels":[],"label_agreement":null},{"id":"W2063443738","doi":"10.1007/s11276-006-7529-7","title":"QoS Mechanisms for the MAC Protocol of IEEE 802.11 WLANs","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Distributed coordination function; Quality of service; Network allocation vector; IEEE 802.11; Inter-Access Point Protocol; IEEE 802.11e-2005; IEEE 802; IEEE 802.11s; Scheduling (production processes); Media access control; IEEE 802.1X; Service set; Wi-Fi; Wireless network; Wireless; Telecommunications; Wi-Fi array","score_opus":0.013288943994382931,"score_gpt":0.2571937997791612,"score_spread":0.24390485578477825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063443738","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051084273,0.010101598,0.8998358,0.0031187523,0.002281542,0.0005436828,0.00029952874,0.0045905383,0.028144287],"genre_scores_gemma":[0.8069444,0.0049346522,0.1626703,0.0012076687,0.0024358532,0.0009369505,0.0003995414,0.00044894428,0.020021733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976616,0.00056665036,0.0003109854,0.00016536894,0.0009218464,0.00037361495],"domain_scores_gemma":[0.99362236,0.0021295552,0.00075432577,0.001089376,0.0021021187,0.00030236488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058388645,0.001151308,0.00067857193,0.0018216644,0.0015903853,0.0044652945,0.0026825876,0.0014276175,0.0045859814],"category_scores_gemma":[0.01225055,0.0007478152,0.00045818466,0.0009015459,0.0016027794,0.0035190934,0.0023001025,0.0031789609,0.0015395647],"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.0010859143,0.00038515218,0.001645236,0.0008115411,0.00016582354,0.0004248365,0.0012564367,0.023346476,0.0654582,0.6356446,0.019800182,0.24997555],"study_design_scores_gemma":[0.0004717965,0.001079053,0.002489066,0.00066620635,0.00053793413,0.0012253749,0.00066542346,0.40811223,0.06922055,0.32504517,0.19012366,0.0003635248],"about_ca_topic_score_codex":0.00094231433,"about_ca_topic_score_gemma":0.0007228584,"teacher_disagreement_score":0.0058388645,"about_ca_system_score_codex":0.0012603243,"about_ca_system_score_gemma":0.001047657,"threshold_uncertainty_score":0.03087926},"labels":[],"label_agreement":null},{"id":"W2068173146","doi":"10.1007/s11276-005-3517-6","title":"A Performance Evaluation of a Novel Energy-Aware Data-Centric Routing Algorithm in Wireless Sensor Networks","year":2005,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"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; Wireless Routing Protocol; Wireless sensor network; Dynamic Source Routing; Distance-vector routing protocol; Distributed computing; Hierarchical routing; Ad hoc On-Demand Distance Vector Routing; Zone Routing Protocol; Algorithm; Routing (electronic design automation)","score_opus":0.03208166225354081,"score_gpt":0.26122222243089704,"score_spread":0.22914056017735623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068173146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6920636,0.004485915,0.28921607,0.0008577831,0.00046310434,0.00044387946,0.0003293455,0.0023186884,0.009821565],"genre_scores_gemma":[0.91165745,0.0006691167,0.08571702,0.00008731343,0.000049843056,0.000077921824,0.00027188056,0.00007563629,0.0013937871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836403,0.00051412807,0.00010244985,0.00019542074,0.0006902297,0.00013362183],"domain_scores_gemma":[0.99603707,0.002193485,0.0002487181,0.0004024731,0.0009830821,0.0001351258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023680415,0.00083294534,0.0007891249,0.0008327176,0.00053402333,0.00089033914,0.0014339179,0.0009483977,0.001010543],"category_scores_gemma":[0.0059230174,0.00024111713,0.00025426084,0.0011522351,0.00044376805,0.0020097299,0.0005991734,0.00045620193,0.00019550014],"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.0035515851,0.00090346305,0.0042264624,0.0005105735,0.00022303688,0.00013529212,0.00010047846,0.70639163,0.04908323,0.006015349,0.0031507688,0.22570813],"study_design_scores_gemma":[0.000063653075,0.0005682878,0.0005619448,0.000005822105,0.00003414959,0.00008929348,0.000024903138,0.98673415,0.011084694,0.0003228161,0.00050041644,0.000009864841],"about_ca_topic_score_codex":0.0023264007,"about_ca_topic_score_gemma":0.0027958783,"teacher_disagreement_score":0.0023680415,"about_ca_system_score_codex":0.0013986928,"about_ca_system_score_gemma":0.0009855034,"threshold_uncertainty_score":0.0125235915},"labels":[],"label_agreement":null},{"id":"W2068835433","doi":"10.1007/s11276-007-0059-0","title":"Selected papers from Chinacom’06","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Global Financial Crisis and Policies","field":"Economics, Econometrics and Finance","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":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.010668108418050517,"score_gpt":0.20252392359609775,"score_spread":0.19185581517804723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068835433","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01343842,0.14262047,0.01745803,0.07717146,0.18375483,0.0008130259,0.03547905,0.0024072537,0.5268575],"genre_scores_gemma":[0.035235457,0.10743445,0.0037664496,0.0048647835,0.035617605,0.0003154828,0.024069877,0.0009933509,0.7877025],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999315,0.00007159293,0.000043165746,0.000078693214,0.00040310083,0.0000884829],"domain_scores_gemma":[0.9959971,0.0003842555,0.00016344093,0.00028525598,0.0025285007,0.0006413671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014016265,0.0012893743,0.0011678699,0.0068026073,0.0012096784,0.0036628072,0.0008624442,0.0008728448,0.09961135],"category_scores_gemma":[0.0032048512,0.0002937025,0.00049571355,0.012204896,0.0003180823,0.0017627565,0.0010618545,0.0009791772,0.034634717],"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.000038251605,0.000024209572,0.00037741265,0.0002341006,0.000012048898,0.00003373794,0.000022605542,0.00037852916,0.00016229413,0.0010862489,0.9425367,0.055093892],"study_design_scores_gemma":[0.000022958455,0.000027348526,0.0031103075,0.0003478831,0.000039263523,0.00003850858,0.000070877846,0.0009241156,0.00048562998,0.0020817006,0.99283844,0.000013004165],"about_ca_topic_score_codex":0.015968366,"about_ca_topic_score_gemma":0.03365798,"teacher_disagreement_score":0.09961135,"about_ca_system_score_codex":0.00287236,"about_ca_system_score_gemma":0.002973835,"threshold_uncertainty_score":0.33323312},"labels":[],"label_agreement":null},{"id":"W2070488564","doi":"10.1007/s11276-006-6547-9","title":"Energy-aware on-demand routing protocols for wireless ad hoc networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"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; Overhead (engineering); Distributed computing; Wireless Routing Protocol; Routing (electronic design automation); Wireless ad hoc network; Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.012573994560372382,"score_gpt":0.24523919266797836,"score_spread":0.23266519810760597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070488564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04770923,0.0060072127,0.9200639,0.0017565629,0.0011062729,0.00022776399,0.0002526379,0.0017567631,0.021119718],"genre_scores_gemma":[0.8340581,0.005207663,0.13618949,0.0004972569,0.0004558188,0.00020028284,0.00067843916,0.00039713152,0.022315782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993548,0.00016019779,0.000036126152,0.0000572982,0.00030915413,0.00008248202],"domain_scores_gemma":[0.99891365,0.00042874017,0.00008193801,0.00026151986,0.00026633043,0.00004776048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008053934,0.00088566606,0.00081722037,0.0006593126,0.0007335047,0.0012969873,0.002008769,0.0008781876,0.002078619],"category_scores_gemma":[0.0019072244,0.00048235478,0.00031716147,0.0010110876,0.00047300183,0.0023573753,0.0012954392,0.0010873998,0.0004996422],"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.00079693465,0.00046420083,0.0011140831,0.0008742133,0.00020574896,0.0003962414,0.00036794366,0.3385275,0.05136773,0.103758454,0.031188745,0.4709383],"study_design_scores_gemma":[0.0000592131,0.00021576231,0.00065072667,0.000058310157,0.000094303,0.00045675316,0.00023424643,0.8712044,0.018611023,0.0770417,0.031310286,0.00006335625],"about_ca_topic_score_codex":0.0008145502,"about_ca_topic_score_gemma":0.0024631289,"teacher_disagreement_score":0.002078619,"about_ca_system_score_codex":0.0005888644,"about_ca_system_score_gemma":0.0005062155,"threshold_uncertainty_score":0.0069536567},"labels":[],"label_agreement":null},{"id":"W2072306584","doi":"10.1007/s11276-009-0208-8","title":"Control of wireless networks with flow level dynamics under constant time scheduling","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Round-robin scheduling; Scheduling (production processes); Network congestion; Maximum throughput scheduling; Wireless network; Dynamic priority scheduling; Fair-share scheduling; Rate-monotonic scheduling; Earliest deadline first scheduling; Queue; Queuing delay; Mathematical optimization; Distributed computing; Computer network; Wireless; Network packet; Mathematics; Quality of service","score_opus":0.005701554008814687,"score_gpt":0.18879754590655903,"score_spread":0.18309599189774434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072306584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09498118,0.00037842672,0.89537233,0.0009431854,0.00022251756,0.000086275024,0.00015794428,0.00024470984,0.0076134796],"genre_scores_gemma":[0.9786846,0.0002555856,0.01635262,0.00009748224,0.000105606676,0.00008185157,0.000058602433,0.000043268206,0.004320364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992106,0.0002602618,0.000021338177,0.00017114155,0.00013628534,0.00020034079],"domain_scores_gemma":[0.99742436,0.0015868064,0.00035707993,0.00009574194,0.0003201946,0.00021586893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019345749,0.0011483409,0.0011376229,0.00068257283,0.00046194435,0.0019827075,0.0017433862,0.0010283916,0.0023131554],"category_scores_gemma":[0.005940557,0.00047610817,0.0004048493,0.0008721357,0.0015811966,0.0018642481,0.0013392799,0.0012986987,0.00017153409],"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.00013631632,0.000058939324,0.00019032997,0.000044996228,0.000022639619,0.000034223296,0.00004177838,0.9498326,0.0014895148,0.04100948,0.00080097956,0.0063382066],"study_design_scores_gemma":[0.00001193281,0.000015477692,0.000032922104,0.0000012773603,0.000002629162,0.000002723762,0.0000037583436,0.99558395,0.000072656694,0.0041952655,0.00007500726,0.0000023969908],"about_ca_topic_score_codex":0.007675377,"about_ca_topic_score_gemma":0.0032018593,"teacher_disagreement_score":0.007675377,"about_ca_system_score_codex":0.001918358,"about_ca_system_score_gemma":0.001378901,"threshold_uncertainty_score":0.015261412},"labels":[],"label_agreement":null},{"id":"W2076154834","doi":"10.1007/s11276-012-0443-2","title":"Behavior modeling for spectrum sharing in wireless cognitive networks","year":2012,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cognitive radio; Bidding; Wireless network; Cognitive network; Computer network; Nash equilibrium; Wireless; Mathematical optimization; Telecommunications","score_opus":0.026283828069930983,"score_gpt":0.2634806218870058,"score_spread":0.23719679381707479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076154834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056760136,0.0005428306,0.93153805,0.0010195537,0.00013737674,0.00007580373,0.0001515948,0.00018306465,0.009591527],"genre_scores_gemma":[0.9485501,0.0007219818,0.040991087,0.0001656367,0.000123921,0.00019735494,0.00011881585,0.000067283814,0.009063833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921083,0.00036188166,0.000028161916,0.000110790235,0.00015914178,0.00012915822],"domain_scores_gemma":[0.99870944,0.00087019586,0.00012061666,0.000074167816,0.00015225128,0.000073368225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012566318,0.00088965055,0.0010773292,0.00069481414,0.0006334963,0.001207597,0.0018761094,0.0012808638,0.0025467786],"category_scores_gemma":[0.004587057,0.00048261782,0.00096756977,0.0007091623,0.0010628874,0.0015504712,0.0010475612,0.0012631821,0.0003406941],"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.000028086151,0.00006900141,0.00053564395,0.000028956902,0.000030386678,0.00005358897,0.00009904095,0.93317544,0.00045429764,0.05955955,0.00047641093,0.005489628],"study_design_scores_gemma":[0.000003225212,0.00000484606,0.00005295242,0.0000019158342,0.0000038448775,0.000005113425,0.00000887957,0.98971575,0.00002950134,0.010040424,0.00013081312,0.0000026333005],"about_ca_topic_score_codex":0.018710637,"about_ca_topic_score_gemma":0.008681417,"teacher_disagreement_score":0.018710637,"about_ca_system_score_codex":0.0015299801,"about_ca_system_score_gemma":0.0014722885,"threshold_uncertainty_score":0.03720349},"labels":[],"label_agreement":null},{"id":"W2076225277","doi":"10.1007/s11276-010-0282-y","title":"Aggregation convergecast scheduling in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Computer science; Scheduling (production processes); Wireless sensor network; Bipartite graph; Schedule; Distributed computing; Graph; Computer network; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.007999662009683224,"score_gpt":0.21735291262432602,"score_spread":0.2093532506146428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076225277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06657413,0.0018810635,0.92624265,0.00060808484,0.0004344481,0.00006619847,0.000067220164,0.0003741628,0.003752073],"genre_scores_gemma":[0.92053336,0.0010989662,0.074067295,0.000112176574,0.0002877979,0.00010266332,0.00009188246,0.000092872324,0.0036129532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923456,0.00027113507,0.00004366281,0.00012438423,0.0002443759,0.00008178396],"domain_scores_gemma":[0.9975097,0.0015504527,0.00015155847,0.0002617587,0.00041068843,0.00011573299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022456814,0.0005262292,0.0012032109,0.0008072374,0.0011668074,0.0012249005,0.0011669947,0.00068571646,0.0010503143],"category_scores_gemma":[0.00568753,0.00043666852,0.00026467833,0.001282488,0.0006818492,0.001497155,0.0009919051,0.0010903832,0.00017840495],"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.0005234732,0.00014351444,0.0009491165,0.00015282644,0.00007406834,0.00010579589,0.00025473683,0.82751614,0.005819416,0.060918666,0.004933204,0.09860912],"study_design_scores_gemma":[0.000017635404,0.000036572263,0.00014654177,0.000006123005,0.000013273086,0.000023423909,0.000037157188,0.98337275,0.0012834265,0.014044231,0.0010138231,0.000005093257],"about_ca_topic_score_codex":0.0026289646,"about_ca_topic_score_gemma":0.003562421,"teacher_disagreement_score":0.0026289646,"about_ca_system_score_codex":0.001169766,"about_ca_system_score_gemma":0.0011032305,"threshold_uncertainty_score":0.011876404},"labels":[],"label_agreement":null},{"id":"W2079943270","doi":"10.1007/s11276-006-7527-9","title":"End-to-end delay margin balancing approach for routing in multi-class networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Static routing; Routing (electronic design automation); Heuristic; Equal-cost multi-path routing; Mathematical optimization; Elmore delay; Computer network; Routing protocol; Mathematics; Propagation delay","score_opus":0.011667508316347443,"score_gpt":0.22030231917419368,"score_spread":0.20863481085784624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079943270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023380455,0.00026724397,0.974006,0.0002020388,0.000075037715,0.0000357827,0.00003058025,0.00019905638,0.0018038615],"genre_scores_gemma":[0.8442818,0.00025862898,0.15017428,0.0001452617,0.0001746893,0.00007000729,0.000062895044,0.00009061587,0.004741871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.000121832214,0.000019395893,0.000075820695,0.00016962172,0.00006759],"domain_scores_gemma":[0.9993838,0.00025031084,0.00005434223,0.00008090052,0.00018579858,0.000044765413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010884892,0.0005849523,0.00064336485,0.0004910642,0.00074136705,0.00092340977,0.0016695824,0.00057174225,0.002388702],"category_scores_gemma":[0.001562458,0.00018726726,0.00025009518,0.000451768,0.00038191382,0.0014253272,0.0007855724,0.00089635147,0.0002709422],"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.0006010157,0.0002935659,0.00086498325,0.0001352219,0.000071003975,0.000106404244,0.00019559948,0.6548853,0.025422301,0.043327786,0.003990249,0.27010658],"study_design_scores_gemma":[0.00000936103,0.00003320831,0.0001155734,0.000002778213,0.000010313083,0.000021557911,0.000014452469,0.9918268,0.0018127373,0.005573579,0.0005749708,0.0000046815167],"about_ca_topic_score_codex":0.0010686987,"about_ca_topic_score_gemma":0.0029106901,"teacher_disagreement_score":0.002388702,"about_ca_system_score_codex":0.001003045,"about_ca_system_score_gemma":0.0005474738,"threshold_uncertainty_score":0.0079910755},"labels":[],"label_agreement":null},{"id":"W2080294240","doi":"10.1007/s11276-008-0142-1","title":"Analysis of the Bluetooth device discovery protocol","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bluetooth; Exponential backoff; Limit (mathematics); Neighbor Discovery Protocol; Network packet; Protocol (science); Computer network; Train; Throughput; Wireless; Telecommunications; Internet Protocol; Operating system","score_opus":0.02168873109121416,"score_gpt":0.2528424534039493,"score_spread":0.23115372231273512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080294240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20791127,0.0063582654,0.6979461,0.002044329,0.0006027341,0.0008119097,0.0010764502,0.0020163779,0.081232645],"genre_scores_gemma":[0.9121576,0.0029717132,0.0637133,0.00023275145,0.00025439615,0.0003856175,0.0012443541,0.00031511564,0.018725052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964785,0.0005150683,0.000124525,0.00024226053,0.0022024356,0.0004372216],"domain_scores_gemma":[0.99295807,0.0042366283,0.00038799222,0.00089165213,0.0014461685,0.000079508856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018706109,0.0007523284,0.0006357645,0.0025400936,0.0010740447,0.0020994362,0.001465087,0.0007075024,0.004913263],"category_scores_gemma":[0.010815203,0.0005353887,0.00088561035,0.0018563902,0.0007204878,0.0026729945,0.0009002909,0.0015311394,0.0010664668],"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.0010100697,0.0005273521,0.013534053,0.00083325786,0.00024038527,0.0011019709,0.00057630526,0.18616438,0.040935468,0.43612823,0.014659693,0.30428883],"study_design_scores_gemma":[0.000055069188,0.00034853377,0.00596645,0.0001065137,0.00028554877,0.0017352286,0.00024840585,0.86913407,0.02504041,0.06542667,0.03157726,0.00007594643],"about_ca_topic_score_codex":0.0030921912,"about_ca_topic_score_gemma":0.002646454,"teacher_disagreement_score":0.004913263,"about_ca_system_score_codex":0.0017204023,"about_ca_system_score_gemma":0.0022582235,"threshold_uncertainty_score":0.016436517},"labels":[],"label_agreement":null},{"id":"W2085616583","doi":"10.1007/s11276-015-0927-y","title":"QoE-based optimal resource allocation in wireless healthcare networks: opportunities and challenges","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Resource allocation; Wireless; Quality of service; Quality of experience; Health care; Resource (disambiguation); Computer network; Telecommunications","score_opus":0.12418766365062961,"score_gpt":0.3013489691148165,"score_spread":0.1771613054641869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085616583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047240544,0.020622747,0.90926105,0.014413259,0.00044577377,0.0001296165,0.00013085367,0.00024406407,0.007512087],"genre_scores_gemma":[0.9335895,0.0051465593,0.058212277,0.00059432373,0.000816785,0.000076520526,0.000074605494,0.00005834369,0.0014309917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792385,0.0010435061,0.0001068431,0.0002750824,0.00039052335,0.0002601573],"domain_scores_gemma":[0.9940352,0.004448263,0.00026219973,0.00018338177,0.00083795073,0.00023302718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042402665,0.0006986414,0.0022166872,0.00050912204,0.00046569775,0.0028422584,0.002019502,0.0014655545,0.0014023373],"category_scores_gemma":[0.010236962,0.00041920968,0.00028793036,0.0007864712,0.0010935939,0.0033702801,0.0014166954,0.0013029813,0.00020318117],"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.0004536498,0.00062026834,0.004669837,0.0004893891,0.00017662032,0.00018733008,0.0002593655,0.5063261,0.0060233474,0.07253861,0.011127692,0.39712787],"study_design_scores_gemma":[0.000024650652,0.0000727777,0.0005653767,0.000035927835,0.000017390921,0.000065187334,0.00017252583,0.9558344,0.00064623775,0.04090204,0.0016447676,0.000018761133],"about_ca_topic_score_codex":0.00349958,"about_ca_topic_score_gemma":0.0028113255,"teacher_disagreement_score":0.0042402665,"about_ca_system_score_codex":0.0010767381,"about_ca_system_score_gemma":0.0017216654,"threshold_uncertainty_score":0.022424877},"labels":[],"label_agreement":null},{"id":"W2086291905","doi":"10.1007/s11276-013-0664-z","title":"Bluetooth scatternet formation from a time-efficiency perspective","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bluetooth; Computer science; Scatternet; Key (lock); Computer network; Baseband; Distributed computing; Wireless; Bandwidth (computing); Telecommunications; Computer security","score_opus":0.007354035741077079,"score_gpt":0.20384922539776837,"score_spread":0.1964951896566913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086291905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007354569,0.00029139276,0.97922677,0.00029427873,0.000048040507,0.000030869498,0.000021172535,0.00005835775,0.012674557],"genre_scores_gemma":[0.7808346,0.0018764331,0.176483,0.00021815811,0.00036964932,0.00019897668,0.00015410298,0.0002072296,0.039657883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992046,0.00023454727,0.000023217788,0.00008791095,0.00037394112,0.000075911],"domain_scores_gemma":[0.9988317,0.00061487325,0.0001171927,0.00015525836,0.00021973382,0.00006131461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009632867,0.0006980235,0.0007474672,0.00079665094,0.0008525569,0.0018205479,0.0014330674,0.0010427053,0.004132794],"category_scores_gemma":[0.002850228,0.0005264665,0.00042739225,0.0009431824,0.0011877448,0.0022056145,0.0018554281,0.0008145494,0.0008526735],"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.0000763075,0.000066573666,0.0008022319,0.00009723507,0.00004235358,0.00015008876,0.00021530798,0.47700733,0.019145966,0.4614488,0.0016126948,0.039335072],"study_design_scores_gemma":[0.00001717881,0.00010339904,0.0004560757,0.000026284146,0.000022979371,0.00023467164,0.0001569394,0.8951542,0.009827875,0.085662544,0.0083157625,0.000022144131],"about_ca_topic_score_codex":0.0006335721,"about_ca_topic_score_gemma":0.0009378386,"teacher_disagreement_score":0.004132794,"about_ca_system_score_codex":0.00091897865,"about_ca_system_score_gemma":0.0005997196,"threshold_uncertainty_score":0.013825595},"labels":[],"label_agreement":null},{"id":"W2087189120","doi":"10.1007/s11276-015-0932-1","title":"Cooperative and cognitive wireless networks for train control systems","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Train; Handover; Wireless; Reinforcement learning; Computer network; Communications system; Cognitive network; Control (management); Wireless network; Cognitive radio; Telecommunications; Artificial intelligence","score_opus":0.0128795535240293,"score_gpt":0.2111480412233194,"score_spread":0.1982684876992901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087189120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020116044,0.0071918266,0.9399971,0.0017401682,0.0008184678,0.000037220005,0.00007900129,0.00017550102,0.029844765],"genre_scores_gemma":[0.92470485,0.0050789984,0.042149596,0.00047852893,0.00088497985,0.000088005334,0.000077820645,0.000030591418,0.026506573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977225,0.000050616527,0.00000794942,0.00004912795,0.00007459899,0.00004544498],"domain_scores_gemma":[0.9994802,0.00026935566,0.00003896894,0.000052965977,0.00013905669,0.00001950588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004973021,0.0005016584,0.0004023412,0.0003529564,0.000533703,0.0012947503,0.00084613066,0.0009961809,0.003640974],"category_scores_gemma":[0.0016679523,0.00019848868,0.0002539551,0.00070559146,0.0007320672,0.0013358359,0.00077481376,0.0010371242,0.0005037572],"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.00018464967,0.00013771266,0.00054716,0.00027028754,0.00006541915,0.00024601087,0.00020483592,0.3038445,0.010209977,0.49097353,0.012380266,0.18093562],"study_design_scores_gemma":[0.000015699068,0.00008566534,0.00043435715,0.0000337601,0.000035125213,0.00011935677,0.00007052999,0.8049834,0.0014912145,0.17448469,0.018220061,0.000026259093],"about_ca_topic_score_codex":0.0030344175,"about_ca_topic_score_gemma":0.0054100733,"teacher_disagreement_score":0.003640974,"about_ca_system_score_codex":0.0007470079,"about_ca_system_score_gemma":0.0006334819,"threshold_uncertainty_score":0.012180269},"labels":[],"label_agreement":null},{"id":"W2091726102","doi":"10.1007/s11276-012-0459-7","title":"Design and analysis of an IEEE 802.21-based mobility management architecture: a context-aware approach","year":2012,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Handover; Mobility management; Computer network; Architecture; Simple (philosophy); Wireless broadband; Software deployment; Context (archaeology); Heterogeneous network; Wireless; Mobile IP; Context management; Wireless network; Telecommunications; Ubiquitous computing; Software engineering","score_opus":0.012580804073344833,"score_gpt":0.2135455523435651,"score_spread":0.20096474827022026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091726102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042700205,0.0011500295,0.9408432,0.0006441834,0.00015800017,0.0005027944,0.00006654261,0.0010580356,0.012877025],"genre_scores_gemma":[0.65470195,0.0013054506,0.3367226,0.00025687917,0.000096669195,0.0004068198,0.0001803323,0.00012667445,0.0062025604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991466,0.00020448529,0.00006300281,0.00008789026,0.00038842644,0.00010956306],"domain_scores_gemma":[0.9993284,0.00014121078,0.000075671305,0.00007430719,0.00033992418,0.00004062618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012533492,0.0005253672,0.00034029357,0.0004959227,0.0004414534,0.0016512916,0.0015221164,0.0007119878,0.0011591282],"category_scores_gemma":[0.0016502882,0.00042625458,0.00044523645,0.00026932068,0.0004642321,0.0011482101,0.00046328714,0.00083865726,0.00034378734],"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.00027530812,0.00038526466,0.0050478913,0.00076503254,0.00026143683,0.0006944062,0.0006811645,0.4675149,0.13961995,0.14209206,0.006426803,0.23623575],"study_design_scores_gemma":[0.000032662407,0.0003352889,0.0010269771,0.000065847795,0.00016306754,0.00028630602,0.00009878405,0.9347159,0.032944005,0.006764043,0.023533115,0.000034013996],"about_ca_topic_score_codex":0.0031273717,"about_ca_topic_score_gemma":0.003174146,"teacher_disagreement_score":0.0031273717,"about_ca_system_score_codex":0.0009083322,"about_ca_system_score_gemma":0.0017221777,"threshold_uncertainty_score":0.0066284537},"labels":[],"label_agreement":null},{"id":"W2092946865","doi":"10.1007/s11276-007-0034-9","title":"Graphical properties of easily localizable sensor networks","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Wireless sensor network; Social connectedness; Euclidean geometry; Graphical model; Euclidean distance; RADIUS; Theoretical computer science; Topology (electrical circuits); Distributed computing; Artificial intelligence; Computer network; Mathematics","score_opus":0.00847854785588914,"score_gpt":0.1892899982370753,"score_spread":0.18081145038118615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092946865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074579105,0.0002649205,0.9100819,0.0004221476,0.00006392572,0.00010599281,0.0006499637,0.0014742032,0.012357868],"genre_scores_gemma":[0.8983812,0.00058907265,0.08594901,0.00028447915,0.00019654715,0.00039482614,0.0013158756,0.00058686227,0.012302258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981881,0.0004978242,0.0001125942,0.0004669253,0.0005174643,0.00021709516],"domain_scores_gemma":[0.9899951,0.0054219863,0.001990211,0.0010456211,0.0010278461,0.00051915593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010241605,0.0011757419,0.00076725037,0.002081637,0.0006889274,0.0029239794,0.0012638314,0.0010517526,0.0089909285],"category_scores_gemma":[0.009114736,0.0006696143,0.000863942,0.0015885003,0.0013831839,0.0041831653,0.0014912006,0.0012952709,0.0012163856],"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.00033658033,0.00010520514,0.0025221268,0.00030204532,0.00008282015,0.0007881022,0.0009259982,0.04901252,0.016688116,0.87737876,0.0040374757,0.047820225],"study_design_scores_gemma":[0.00010489262,0.00012296495,0.0012943785,0.000054161137,0.000083641164,0.00062244956,0.00018557401,0.14202088,0.0060579176,0.83895946,0.010448328,0.000045273657],"about_ca_topic_score_codex":0.0009579623,"about_ca_topic_score_gemma":0.000907257,"teacher_disagreement_score":0.0089909285,"about_ca_system_score_codex":0.00065304706,"about_ca_system_score_gemma":0.00031663757,"threshold_uncertainty_score":0.030077577},"labels":[],"label_agreement":null},{"id":"W2104897980","doi":"10.1007/s11276-007-0016-y","title":"Dynamically anchored conferencing handoff for dual-mode cellular/WLAN handsets","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); McMaster University","funders":"","keywords":"Handover; Computer science; Handset; Computer network; Bridging (networking); Default gateway; Testbed; Scalability; Gateway (web page); Telecommunications; Operating system","score_opus":0.006810861669800544,"score_gpt":0.22374244485606504,"score_spread":0.2169315831862645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104897980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7170095,0.000767554,0.2671124,0.00016406216,0.00024098517,0.00013211965,0.00013570809,0.0016492355,0.012788517],"genre_scores_gemma":[0.9799493,0.000074646494,0.017850922,0.000022310813,0.000032493357,0.000014379812,0.00006803943,0.000020093323,0.0019677773],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995202,0.00009540916,0.00002664023,0.00004677317,0.00015969816,0.000151299],"domain_scores_gemma":[0.9992481,0.00023576381,0.00004523247,0.00018267756,0.0001870421,0.000101107675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691591,0.00039221652,0.00036218172,0.0006301539,0.0007189,0.000981781,0.00073123747,0.00047875842,0.002850133],"category_scores_gemma":[0.0017728085,0.0002924432,0.00018058812,0.0002849292,0.00030105692,0.000671035,0.001360479,0.0007720679,0.0006797846],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00447187,0.0008553958,0.008247324,0.00012598619,0.00009314336,0.0015627799,0.000634414,0.053632557,0.3994274,0.019903561,0.0044748317,0.5065707],"study_design_scores_gemma":[0.00016138217,0.001188445,0.008496907,0.000032821437,0.00016741893,0.0019584377,0.0003668434,0.8546783,0.11599077,0.007865529,0.008988723,0.000104525585],"about_ca_topic_score_codex":0.0009380896,"about_ca_topic_score_gemma":0.0018819179,"teacher_disagreement_score":0.002850133,"about_ca_system_score_codex":0.00029911942,"about_ca_system_score_gemma":0.00037780806,"threshold_uncertainty_score":0.009534657},"labels":[],"label_agreement":null},{"id":"W2112400795","doi":"10.1007/s11276-013-0594-9","title":"Base station selection and resource allocation in macro–femtocell networks under noisy scenario","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; École de Technologie Supérieure; Université du Québec; Université du Québec à Montréal","funders":"","keywords":"Femtocell; Computer science; Base station; Bandwidth (computing); Computer network; Telecommunications link; Macro; Transmitter power output; Signal-to-interference-plus-noise ratio; Software deployment; Resource allocation; Femto-; Power (physics); Transmitter","score_opus":0.005667651175277208,"score_gpt":0.1897405805757168,"score_spread":0.1840729294004396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112400795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40969586,0.0015584655,0.5781842,0.0010261321,0.00014433147,0.00007725146,0.00029442555,0.00016362591,0.008855678],"genre_scores_gemma":[0.98817307,0.00021620351,0.010202655,0.000048096266,0.000060124064,0.000018515902,0.000047505022,0.000010242865,0.0012235687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991285,0.0003499407,0.000019209809,0.00013563091,0.00014618407,0.00022058026],"domain_scores_gemma":[0.99837106,0.0011467051,0.00016519986,0.000059808153,0.00017234252,0.000084910534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010448312,0.0006702927,0.001060105,0.00046056573,0.0006281401,0.0011162019,0.00077139505,0.0007819955,0.0008130644],"category_scores_gemma":[0.0041959076,0.00056641496,0.00025209802,0.0010470424,0.0008784107,0.0009725508,0.0007579416,0.0004469461,0.00012936904],"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.00034894075,0.000053616925,0.0018903106,0.00004934178,0.000068809066,0.00028939132,0.00005186279,0.9739014,0.0026982059,0.007066199,0.00090810214,0.012673704],"study_design_scores_gemma":[0.000008464867,0.000018134955,0.0005139017,0.0000026667758,0.000014617081,0.00003146943,0.000021258928,0.9969303,0.00037726777,0.0019795347,0.000096171076,0.000006277293],"about_ca_topic_score_codex":0.0070610363,"about_ca_topic_score_gemma":0.00787999,"teacher_disagreement_score":0.0070610363,"about_ca_system_score_codex":0.0010221145,"about_ca_system_score_gemma":0.0008305479,"threshold_uncertainty_score":0.014039874},"labels":[],"label_agreement":null},{"id":"W2113103425","doi":"10.1007/s11276-013-0647-0","title":"Optimized BS assignment and resource allocation in cooperative OFDM networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","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":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Computer science; Resource allocation; Computer network; Orthogonal frequency-division multiplexing; Wireless broadband; Bandwidth allocation; Max-min fairness; Base station; Bandwidth (computing); Throughput; Wireless network; Transmission (telecommunications); Wireless; Distributed computing; Channel (broadcasting); Telecommunications","score_opus":0.01709600577990329,"score_gpt":0.23895907610102754,"score_spread":0.22186307032112426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113103425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08151203,0.00043536522,0.91252613,0.00026095496,0.000052071668,0.000037875147,0.00008224321,0.00018649467,0.004906812],"genre_scores_gemma":[0.9083992,0.00020351181,0.08852295,0.000055912406,0.000049696282,0.000076587574,0.000054314678,0.00003377087,0.002604032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924785,0.0003153132,0.000023935469,0.00008918007,0.00015889305,0.00016478075],"domain_scores_gemma":[0.9986821,0.0008661003,0.00010151259,0.00014063902,0.00015605909,0.000053497915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094399654,0.00040919223,0.00068820495,0.0005075173,0.00049352547,0.00085261214,0.0009914162,0.00067288615,0.0013349367],"category_scores_gemma":[0.004386808,0.00039660846,0.00017739752,0.001298773,0.00054483686,0.00079882285,0.0009136848,0.00047708536,0.00031393234],"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.00018630413,0.00007284156,0.0006552479,0.000038262337,0.000023807386,0.00006552063,0.00012513546,0.9132575,0.0050937547,0.01680332,0.0014958868,0.062182464],"study_design_scores_gemma":[0.000013315554,0.000015494441,0.000116820556,0.0000018532809,0.000005713033,0.000014547034,0.000017025899,0.9939446,0.0006040962,0.0049861413,0.00027676657,0.0000037425164],"about_ca_topic_score_codex":0.0036985944,"about_ca_topic_score_gemma":0.0073202243,"teacher_disagreement_score":0.0036985944,"about_ca_system_score_codex":0.00070237153,"about_ca_system_score_gemma":0.0012459708,"threshold_uncertainty_score":0.0073541403},"labels":[],"label_agreement":null},{"id":"W2116000736","doi":"10.1007/s11276-008-0126-1","title":"On routing with guaranteed delivery in three-dimensional ad hoc wireless networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of British Columbia; University of Waterloo","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Routing (electronic design automation); Combinatorics; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Node (physics); Wireless; Mathematics; Routing protocol; Telecommunications; Physics","score_opus":0.011467449497757633,"score_gpt":0.20282117368624228,"score_spread":0.19135372418848465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116000736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045477375,0.0058205454,0.98186606,0.0013274747,0.00072110875,0.00007718176,0.000060106,0.00032902992,0.005250705],"genre_scores_gemma":[0.4151984,0.03263389,0.53175014,0.0016314662,0.0031001654,0.0006912603,0.0005686057,0.00061571004,0.013810407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962999,0.0017748409,0.00021603004,0.00031915845,0.0010320714,0.00035793136],"domain_scores_gemma":[0.9896456,0.008428013,0.00031811645,0.00078797416,0.00058447133,0.00023588048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004765386,0.0021119567,0.0025745095,0.0023009179,0.0016294128,0.0029234637,0.0046426696,0.002375938,0.004089229],"category_scores_gemma":[0.015101955,0.00090257224,0.0012443033,0.0040027257,0.0034558005,0.006732724,0.004379331,0.0035940106,0.00096245226],"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.00052392524,0.00012434434,0.00059733057,0.00069594005,0.00017529994,0.0003346775,0.00054264104,0.44617864,0.002108125,0.3576606,0.020586798,0.17047168],"study_design_scores_gemma":[0.000052271982,0.00013392109,0.00018112973,0.00010473662,0.00005573639,0.0001726097,0.0001055298,0.7552067,0.0008345714,0.23149887,0.01160405,0.00004996764],"about_ca_topic_score_codex":0.0033016405,"about_ca_topic_score_gemma":0.0024020418,"teacher_disagreement_score":0.004765386,"about_ca_system_score_codex":0.0021597492,"about_ca_system_score_gemma":0.0010931597,"threshold_uncertainty_score":0.025202096},"labels":[],"label_agreement":null},{"id":"W2117632372","doi":"10.1007/s11276-009-0182-1","title":"A cluster-based trust-aware routing protocol for mobile ad hoc networks","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Polytechnique Montréal","keywords":"Computer science; Computer network; Wireless Routing Protocol; Routing protocol; Optimized Link State Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Zone Routing Protocol; Dynamic Source Routing; Ad hoc wireless distribution service; Network packet; Wireless; Telecommunications","score_opus":0.014849707975981771,"score_gpt":0.2775410418727535,"score_spread":0.26269133389677174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117632372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01768686,0.0011119208,0.97187954,0.0004800498,0.00046433695,0.00045250906,0.00021654881,0.0036655003,0.0040427693],"genre_scores_gemma":[0.49471948,0.0014130098,0.49023268,0.0002916998,0.00026153913,0.00071339397,0.0010571263,0.00045280243,0.010858238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999008,0.00022234625,0.000098621145,0.00010465379,0.00046787405,0.00009850478],"domain_scores_gemma":[0.998211,0.00043165023,0.00015507314,0.0004047665,0.0006404003,0.0001571041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013945888,0.0006025238,0.0009677841,0.0009046346,0.0017354096,0.001168612,0.0023213285,0.0009810129,0.0016647046],"category_scores_gemma":[0.003326482,0.00041572732,0.0005435966,0.001281048,0.00063659484,0.0022985723,0.0020112416,0.0014134976,0.00080093753],"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.0014430641,0.00039872515,0.0017228427,0.0006506577,0.00034165254,0.0007567654,0.00086707127,0.22896262,0.04956912,0.08240318,0.052095946,0.5807884],"study_design_scores_gemma":[0.00021270757,0.0005174997,0.0009785865,0.00006253305,0.00030577386,0.00061865733,0.00021078154,0.89466995,0.024283625,0.028839989,0.049130876,0.00016909497],"about_ca_topic_score_codex":0.0043450217,"about_ca_topic_score_gemma":0.0051062703,"teacher_disagreement_score":0.0043450217,"about_ca_system_score_codex":0.000941873,"about_ca_system_score_gemma":0.0015621003,"threshold_uncertainty_score":0.008639455},"labels":[],"label_agreement":null},{"id":"W2118327872","doi":"10.1007/s11276-015-1071-4","title":"Beacon deployment strategy for guaranteed localization in wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"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; University of Missouri","keywords":"Beacon; Computer science; Wireless sensor network; Topology (electrical circuits); Multidimensional scaling; Network topology; Software deployment; Multilateration; Computer network; Algorithm; Real-time computing; Distributed computing; Mathematics; Azimuth; Machine learning","score_opus":0.023207881394890304,"score_gpt":0.24003954063183425,"score_spread":0.21683165923694395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118327872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012739854,0.0004699347,0.98506784,0.00015588851,0.000084936764,0.000022977707,0.00003409423,0.00027583627,0.0011487019],"genre_scores_gemma":[0.8865834,0.00069626817,0.10930735,0.0001088601,0.00012551379,0.00011590825,0.00014833265,0.00010255261,0.0028117562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993069,0.00023097073,0.0000409373,0.000107776854,0.00017883524,0.00013451195],"domain_scores_gemma":[0.99881244,0.0006185839,0.000097305805,0.00013004326,0.00027337915,0.000068271635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092415314,0.00071085326,0.00093332,0.00075625844,0.0005365226,0.000632857,0.0015780104,0.00076541957,0.0015911622],"category_scores_gemma":[0.0040471894,0.00038945957,0.00035070497,0.0010231535,0.00050310005,0.0012447662,0.0012450715,0.00081419596,0.0004719927],"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.0014370588,0.00015342051,0.0014673193,0.00052368705,0.00009567339,0.00043401623,0.0004760344,0.54688025,0.044687394,0.09021232,0.01363851,0.29999426],"study_design_scores_gemma":[0.00004461333,0.00015232802,0.00025192872,0.000015318044,0.000020542191,0.00011897137,0.000048691185,0.9869587,0.0028014313,0.008288668,0.0012849037,0.000013922586],"about_ca_topic_score_codex":0.0014789018,"about_ca_topic_score_gemma":0.0013592474,"teacher_disagreement_score":0.0015911622,"about_ca_system_score_codex":0.0005734193,"about_ca_system_score_gemma":0.00083045725,"threshold_uncertainty_score":0.005322993},"labels":[],"label_agreement":null},{"id":"W2127783162","doi":"10.1007/s11276-013-0559-z","title":"A ring-based multicast routing topology with QoS support in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"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 network; Multicast; Computer science; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Xcast; Source-specific multicast; Wireless mesh network; Inter-domain; Pragmatic General Multicast; Topology (electrical circuits); Wireless network; Wireless; Telecommunications; Engineering","score_opus":0.009230560273041116,"score_gpt":0.2235935872610726,"score_spread":0.21436302698803147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127783162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24943654,0.0013979734,0.7350911,0.00082447083,0.00031959012,0.000175548,0.0002722716,0.0010800032,0.011402502],"genre_scores_gemma":[0.81551623,0.0005702558,0.17982331,0.000083057355,0.00014084164,0.00009055471,0.0001909646,0.000059340746,0.0035254091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970835,0.000114180926,0.000028119593,0.000039917017,0.0000805953,0.000028823324],"domain_scores_gemma":[0.9993048,0.00023843863,0.00007617171,0.00014385484,0.00017574558,0.00006107019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007273455,0.00014718047,0.00028911978,0.0004824851,0.0004851378,0.0005767225,0.0010952668,0.00045088923,0.00136298],"category_scores_gemma":[0.0015834107,0.00019552009,0.00023554936,0.00040268153,0.00027837683,0.00095505826,0.00065989315,0.0003435374,0.00031498913],"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.0015263932,0.00041579566,0.003488382,0.0005140216,0.00009837059,0.00062341517,0.00036255378,0.22394451,0.18539844,0.15891074,0.009410427,0.4153069],"study_design_scores_gemma":[0.00009899814,0.0007239955,0.0009807965,0.00003266923,0.00009062255,0.00056100416,0.0000918012,0.93379474,0.02598215,0.02289618,0.014697833,0.000049096092],"about_ca_topic_score_codex":0.00039222796,"about_ca_topic_score_gemma":0.00051590824,"teacher_disagreement_score":0.00136298,"about_ca_system_score_codex":0.0002535269,"about_ca_system_score_gemma":0.00024840506,"threshold_uncertainty_score":0.004559636},"labels":[],"label_agreement":null},{"id":"W2128813719","doi":"10.1023/a:1012375503129","title":"The Peril of Evaluating Location Management Proposals through Simulations","year":2001,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Paging; Mobility model; Mobility management; Computer network; Overhead (engineering); Cellular network; Telecommunications","score_opus":0.047500863168162225,"score_gpt":0.34851622059112697,"score_spread":0.30101535742296476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128813719","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2784955,0.003512322,0.6549341,0.019021597,0.0010942692,0.0007007087,0.0008119927,0.002491626,0.038937896],"genre_scores_gemma":[0.88753,0.0009500998,0.10701122,0.0010453854,0.00021209894,0.0004218769,0.000273386,0.00019067136,0.0023652052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9790121,0.016866783,0.0005610688,0.00054724026,0.0025925308,0.00042038987],"domain_scores_gemma":[0.73078763,0.24751578,0.003216928,0.011728322,0.004868677,0.001882624],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.027406484,0.0012156055,0.001422518,0.0017194368,0.0011833248,0.004537219,0.0027048127,0.0038155108,0.0046567917],"category_scores_gemma":[0.15595193,0.0010526994,0.00083162374,0.0013607687,0.0041854903,0.008333883,0.0022231298,0.0037351134,0.0006407339],"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.0007986712,0.00047860944,0.0045446483,0.00019539849,0.00020766245,0.000057925612,0.00022632556,0.8936156,0.00082234613,0.048382685,0.0033374748,0.04733267],"study_design_scores_gemma":[0.00011819643,0.0002607077,0.00024013646,0.00005275943,0.000029938737,0.000026713476,0.00013336971,0.95052624,0.000648962,0.04584509,0.002096969,0.000020843578],"about_ca_topic_score_codex":0.008128091,"about_ca_topic_score_gemma":0.0068960357,"teacher_disagreement_score":0.97259355,"about_ca_system_score_codex":0.0031974656,"about_ca_system_score_gemma":0.0034953742,"threshold_uncertainty_score":0.14494109},"labels":[],"label_agreement":null},{"id":"W2133264706","doi":"10.1023/a:1012775610087","title":"QoS Performance Bounds and Efficient Connection Admission Control for Heterogeneous Services in Wireless Cellular Networks","year":2002,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.014444991645093223,"score_gpt":0.2324110799266472,"score_spread":0.21796608828155398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133264706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05000987,0.004238771,0.93185014,0.0017428044,0.00049176154,0.0000991238,0.0001475918,0.0006931524,0.010726792],"genre_scores_gemma":[0.9519559,0.0019597835,0.041641187,0.00034012142,0.00077216927,0.00019861512,0.00015401833,0.00025133227,0.002726892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945787,0.0015580268,0.00024147028,0.0005073494,0.0020107094,0.0011037159],"domain_scores_gemma":[0.9658955,0.027009957,0.0015444519,0.0017963132,0.0028488191,0.000905055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007781181,0.0021372337,0.002254095,0.0016651588,0.0016384592,0.005242113,0.0030358224,0.001737414,0.0030145552],"category_scores_gemma":[0.040326465,0.0011403777,0.00055697554,0.0019157223,0.0029626696,0.005203305,0.0036533768,0.005159966,0.0004952642],"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.00077422324,0.00017927091,0.0006251288,0.00015260911,0.00007495928,0.00008786139,0.0003393623,0.77149737,0.0076318416,0.14998923,0.004301037,0.064347185],"study_design_scores_gemma":[0.000020419098,0.000022586151,0.00013521175,0.000015139871,0.000014786603,0.000013491581,0.000023231887,0.96175027,0.00089179736,0.036669098,0.00042792535,0.000015993404],"about_ca_topic_score_codex":0.0064247623,"about_ca_topic_score_gemma":0.0038079275,"teacher_disagreement_score":0.007781181,"about_ca_system_score_codex":0.0040679793,"about_ca_system_score_gemma":0.0025946186,"threshold_uncertainty_score":0.041151285},"labels":[],"label_agreement":null},{"id":"W2141895717","doi":"10.1007/s11276-014-0802-2","title":"An energy efficient joint localization and synchronization solution for wireless sensor networks using unmanned aerial vehicle","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Joint (building); Synchronization (alternating current); Wireless sensor network; Energy (signal processing); Wireless; Time synchronization; Real-time computing; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.011469491255771416,"score_gpt":0.21991163024466195,"score_spread":0.20844213898889052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141895717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02490956,0.0002674203,0.97170943,0.00014003653,0.000078457764,0.000025143754,0.000018867162,0.00038024512,0.002470849],"genre_scores_gemma":[0.7735432,0.00022460979,0.2193163,0.0000918295,0.000052247076,0.00007062749,0.000083470295,0.000037342867,0.0065803938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981517,0.000033371576,0.000009149351,0.000042562824,0.00007346948,0.000026348938],"domain_scores_gemma":[0.9999099,0.00001838513,0.000016200684,0.000014927118,0.000033540276,0.0000071547706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018812146,0.00039082213,0.00039595872,0.0002619854,0.00036109917,0.00037529995,0.00069422275,0.00042760902,0.0012230759],"category_scores_gemma":[0.00041271394,0.0001601173,0.00023083686,0.00040116216,0.00017795626,0.0008227477,0.0008473909,0.0003495397,0.0002528592],"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.00023100984,0.00011439121,0.00076555595,0.00013109403,0.00010099948,0.00018910422,0.00020235441,0.43697444,0.055374634,0.021051245,0.005395014,0.4794702],"study_design_scores_gemma":[0.000019712448,0.00011433715,0.00026697599,0.000005007404,0.00001819815,0.00005820405,0.000057112964,0.987852,0.0064030807,0.002468318,0.002728626,0.000008425898],"about_ca_topic_score_codex":0.0021191814,"about_ca_topic_score_gemma":0.004758091,"teacher_disagreement_score":0.0021191814,"about_ca_system_score_codex":0.00022953867,"about_ca_system_score_gemma":0.0004735195,"threshold_uncertainty_score":0.0042136908},"labels":[],"label_agreement":null},{"id":"W2142573375","doi":"10.1007/s11276-005-5265-z","title":"Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks","year":2005,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"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; Topology control; Topology (electrical circuits); Algorithm; Hop (telecommunications); Node (physics); Wireless network; Fault tolerance; Computer network; Network topology; Wireless; Distributed algorithm; Power control; Distributed computing; Power (physics); Key distribution in wireless sensor networks; Mathematics; Telecommunications","score_opus":0.009062143242365433,"score_gpt":0.233984949971443,"score_spread":0.22492280672907758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142573375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027508367,0.0010993114,0.96910065,0.00034839605,0.00012880818,0.0000365358,0.000030781488,0.00038916292,0.0013580834],"genre_scores_gemma":[0.8011959,0.00091928005,0.19438536,0.00020098175,0.00017083767,0.00023170194,0.00012516679,0.00009099766,0.002679739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850744,0.00061590946,0.00013446844,0.0001918296,0.0004338977,0.00011643556],"domain_scores_gemma":[0.994965,0.0032625087,0.00058420806,0.0004966178,0.00053412246,0.00015759883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027591728,0.00062699267,0.0012588653,0.0010432632,0.00090670394,0.0015707614,0.0020075678,0.0014284995,0.0013033269],"category_scores_gemma":[0.011190392,0.0005054874,0.00052237767,0.0014456166,0.0016101634,0.0034832805,0.0018833238,0.0011344688,0.00023382885],"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.00026912196,0.00006225361,0.000627492,0.00007383737,0.000038043072,0.00005187642,0.00023337099,0.8758921,0.0018149086,0.028959949,0.0013674756,0.090609506],"study_design_scores_gemma":[0.000021177273,0.000042778494,0.00014432924,0.000005047746,0.0000073139745,0.0000312595,0.000023727309,0.97791994,0.000673256,0.020606097,0.0005146583,0.000010448785],"about_ca_topic_score_codex":0.0020101422,"about_ca_topic_score_gemma":0.0014544721,"teacher_disagreement_score":0.0027591728,"about_ca_system_score_codex":0.0009878597,"about_ca_system_score_gemma":0.0005548825,"threshold_uncertainty_score":0.0145920515},"labels":[],"label_agreement":null},{"id":"W2156689181","doi":"10.1023/a:1012319418150","title":"Routing with Guaranteed Delivery in Ad Hoc Wireless Networks","year":2001,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1203,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Computer science; Network packet; Computer network; Routing protocol; Wireless ad hoc network; Distributed computing; Wireless; Telecommunications","score_opus":0.009027105612704069,"score_gpt":0.2084926108908004,"score_spread":0.19946550527809634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156689181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057475856,0.0054945857,0.9810963,0.0011858575,0.0006511275,0.00008554261,0.000070549344,0.0012134502,0.0044550262],"genre_scores_gemma":[0.5064427,0.01020058,0.45995525,0.0007134337,0.0018508487,0.0005714041,0.00047157746,0.0005847398,0.01920949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650925,0.001464367,0.00018859953,0.00040330223,0.0011308021,0.0003036048],"domain_scores_gemma":[0.9937668,0.0042539937,0.00033871864,0.00097649347,0.0004971776,0.00016688596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039838967,0.0011811069,0.0018058881,0.001352282,0.0013182203,0.0031406614,0.003031211,0.0022055442,0.004205835],"category_scores_gemma":[0.014566101,0.00093987526,0.00064867985,0.0021207146,0.002080135,0.005926028,0.0026822889,0.0027032245,0.0013416256],"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.0007086205,0.00014566492,0.000597756,0.0009234546,0.00015281647,0.00028412626,0.00042129328,0.27972794,0.0030018261,0.4081822,0.028260484,0.27759385],"study_design_scores_gemma":[0.00013732394,0.00016148572,0.00019070794,0.000094882416,0.00010023291,0.00026072405,0.00007644321,0.70328575,0.0019053136,0.27100182,0.022741988,0.000043297397],"about_ca_topic_score_codex":0.0016344797,"about_ca_topic_score_gemma":0.0013000377,"teacher_disagreement_score":0.004205835,"about_ca_system_score_codex":0.0016396733,"about_ca_system_score_gemma":0.0014437718,"threshold_uncertainty_score":0.02106911},"labels":[],"label_agreement":null},{"id":"W2165020744","doi":"10.1007/s11276-008-0154-x","title":"Performance analysis of the cumulative ARQ in IEEE 802.16 networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Goodput; Retransmission; Protocol data unit; Automatic repeat request; Protocol (science); Computer network; Real-time computing; Hybrid automatic repeat request; Throughput; Telecommunications; Wireless; Network packet","score_opus":0.009621500378044687,"score_gpt":0.20172417466518736,"score_spread":0.19210267428714267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165020744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40625185,0.00619715,0.5610841,0.0014785407,0.0003275698,0.00011544602,0.00019362372,0.00094615045,0.023405572],"genre_scores_gemma":[0.9868606,0.0005842793,0.010500122,0.000076119584,0.00009775887,0.00003066141,0.000049852886,0.000042354004,0.0017583001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971269,0.0009987556,0.00007614013,0.00023616114,0.0010410444,0.0005209694],"domain_scores_gemma":[0.98558503,0.010255027,0.0006392699,0.00073434674,0.0025543375,0.00023195916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378682,0.001189212,0.00088297983,0.0010201737,0.0006955101,0.0017326873,0.0013065035,0.0007571984,0.0031322858],"category_scores_gemma":[0.018822454,0.00042216346,0.00041081663,0.0010679511,0.0013699079,0.001507831,0.0014808655,0.0010282692,0.00031096695],"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.0005693783,0.00008347315,0.0028347934,0.00012900923,0.00007552945,0.00011629533,0.00017775163,0.9046507,0.004840641,0.037745457,0.0015641823,0.047212753],"study_design_scores_gemma":[0.000012318365,0.00016159799,0.0007692008,0.000011831396,0.000031095326,0.00010058249,0.00004570796,0.9932768,0.0009974475,0.004131458,0.00044423324,0.000017732917],"about_ca_topic_score_codex":0.005879778,"about_ca_topic_score_gemma":0.0042994106,"teacher_disagreement_score":0.005879778,"about_ca_system_score_codex":0.0022250505,"about_ca_system_score_gemma":0.0021070854,"threshold_uncertainty_score":0.028445482},"labels":[],"label_agreement":null},{"id":"W2205378138","doi":"10.1007/s11276-015-1089-7","title":"A clustered trail-based data dissemination protocol for improving the lifetime of duty cycle enabled wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Ontario Institute of Technology","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Computer network; Bottleneck; Network packet; Energy consumption; Sink (geography); Distributed computing; Cluster analysis; Real-time computing; Embedded system","score_opus":0.033943575693253736,"score_gpt":0.29227835614620423,"score_spread":0.2583347804529505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205378138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11867051,0.0013840578,0.8720046,0.00040854848,0.00037510903,0.00028922778,0.0002873941,0.0021983753,0.004382076],"genre_scores_gemma":[0.8192315,0.0006348579,0.17429432,0.00015041308,0.00007027414,0.00015850196,0.00028979173,0.000109010165,0.0050611882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972624,0.00005404042,0.000023889492,0.000045978646,0.000107280925,0.000042596883],"domain_scores_gemma":[0.99882716,0.00033162185,0.00009964882,0.00022164785,0.0004176972,0.00010215407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006148073,0.0003542781,0.0005673754,0.0009523795,0.00081655715,0.0005899061,0.0013369927,0.00043631278,0.0017368202],"category_scores_gemma":[0.002119132,0.00020081471,0.00024106886,0.0011456405,0.00029490818,0.0012042348,0.0009360648,0.0005617076,0.0003675736],"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.0015106145,0.0005699855,0.0018796101,0.00044062966,0.00013814002,0.00026615354,0.00040165766,0.2849198,0.11657818,0.028254386,0.012499422,0.5525415],"study_design_scores_gemma":[0.00016141676,0.00053448556,0.00044294907,0.000026926687,0.00008546966,0.00016603271,0.000081736216,0.9609679,0.02261242,0.0077674254,0.007113916,0.000039376555],"about_ca_topic_score_codex":0.0017007751,"about_ca_topic_score_gemma":0.0030702616,"teacher_disagreement_score":0.0017368202,"about_ca_system_score_codex":0.00064666476,"about_ca_system_score_gemma":0.0013367904,"threshold_uncertainty_score":0.005810261},"labels":[],"label_agreement":null},{"id":"W2261702034","doi":"10.1007/s11276-016-1199-x","title":"Delay and energy consumption analysis of priority guaranteed MAC protocol for wireless body area networks","year":2016,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Dalhousie University","funders":"","keywords":"Computer science; Retransmission; Energy consumption; Computer network; Superframe; Throughput; Network packet; Quality of service; Markov chain; Node (physics); Body area network; Wireless network; Wireless sensor network; Real-time computing; Wireless; Telecommunications","score_opus":0.013657149317539934,"score_gpt":0.2455499756150728,"score_spread":0.23189282629753286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261702034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38724265,0.0073453872,0.5906059,0.00082533376,0.00033875924,0.00013291356,0.00019963291,0.00042812974,0.012881254],"genre_scores_gemma":[0.987946,0.0007351858,0.00917337,0.000047381003,0.00006306785,0.00003108223,0.000055957673,0.00004150901,0.0019063333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987734,0.00023972007,0.00004093761,0.00013734087,0.0005560749,0.00025250568],"domain_scores_gemma":[0.9963148,0.002535634,0.00018303024,0.00017206238,0.0007280769,0.000066419394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019327649,0.0008610381,0.0007099877,0.0011074287,0.00051827385,0.0010247242,0.0011982004,0.00044456127,0.0020005733],"category_scores_gemma":[0.0054370775,0.00036011304,0.000528032,0.0007851734,0.0006770807,0.0012233352,0.00052992837,0.00085004146,0.00017010322],"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.0009810345,0.0001832895,0.004247501,0.0002697827,0.00012982405,0.00034693896,0.00023318286,0.8684671,0.027813863,0.052638303,0.0015033366,0.0431858],"study_design_scores_gemma":[0.000004822499,0.00005877685,0.00044171538,0.000004854027,0.000020759822,0.00005505605,0.000021225918,0.9961591,0.0013330308,0.0016798843,0.00021517689,0.0000056416707],"about_ca_topic_score_codex":0.0050180876,"about_ca_topic_score_gemma":0.0033726979,"teacher_disagreement_score":0.0050180876,"about_ca_system_score_codex":0.002463149,"about_ca_system_score_gemma":0.0013024923,"threshold_uncertainty_score":0.01787144},"labels":[],"label_agreement":null},{"id":"W2344910158","doi":"10.1007/s11276-016-1261-8","title":"Joint TAS/SC and power allocation for IAF relaying D2D cooperative networks","year":2016,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Computer science; Nakagami distribution; Relay; Outage probability; Fading; Transmitter power output; Power (physics); Selection (genetic algorithm); Antenna (radio); Joint (building); Mathematical optimization; Optimization problem; Topology (electrical circuits); Telecommunications; Mathematics; Algorithm; Channel (broadcasting); Transmitter","score_opus":0.028214691388097107,"score_gpt":0.2556267181575915,"score_spread":0.22741202676949443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344910158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085125044,0.00079563487,0.89739805,0.0005463924,0.00016024796,0.000121261015,0.00023668281,0.00042011784,0.015196555],"genre_scores_gemma":[0.9562554,0.00026940732,0.03941973,0.00009136197,0.000064036976,0.00009424,0.000076289856,0.000022775324,0.003706752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938154,0.00016179551,0.000034478853,0.00008479293,0.00015124137,0.00018626795],"domain_scores_gemma":[0.9989485,0.0004950636,0.00007334597,0.00013865295,0.00028020394,0.000064175074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009351536,0.0007655939,0.0007749503,0.0005536423,0.00092788704,0.001259131,0.00090443384,0.00059967185,0.0024778717],"category_scores_gemma":[0.0024295177,0.00029561616,0.0004315262,0.0010930581,0.00067770586,0.0007020015,0.001031564,0.00048004615,0.0004884823],"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.00080223504,0.00018057167,0.0024547058,0.0002259681,0.00015286426,0.000489245,0.0005042701,0.6142911,0.036269344,0.07381485,0.0072737085,0.2635411],"study_design_scores_gemma":[0.00003465457,0.00012502201,0.00031709773,0.00001568167,0.00005138669,0.00019098882,0.00010077985,0.9744984,0.005101265,0.017212633,0.002333144,0.000018952303],"about_ca_topic_score_codex":0.00541295,"about_ca_topic_score_gemma":0.012094504,"teacher_disagreement_score":0.00541295,"about_ca_system_score_codex":0.0009216022,"about_ca_system_score_gemma":0.0021398673,"threshold_uncertainty_score":0.01076287},"labels":[],"label_agreement":null},{"id":"W2398904317","doi":"10.1007/s11276-016-1299-7","title":"Power control and clustering in heterogeneous cellular networks","year":2016,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Computer science; Base station; Cellular network; Macro; Power control; Interference (communication); Small cell; Cluster analysis; Computer network; Heuristic; Optimization problem; Heterogeneous network; Distributed computing; Mathematical optimization; Power (physics); Algorithm; Telecommunications; Wireless network; Wireless; Mathematics","score_opus":0.003608190083120832,"score_gpt":0.17803261821263297,"score_spread":0.17442442812951214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398904317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10152536,0.0015413371,0.8853465,0.0009977572,0.00014224325,0.000039615683,0.00007883089,0.00014358478,0.010184789],"genre_scores_gemma":[0.9799825,0.00055463734,0.013486412,0.00007070243,0.00011239581,0.00003287131,0.000035747922,0.000046695728,0.005678094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995103,0.0002049661,0.0000150644055,0.00008536228,0.00009883196,0.00008562048],"domain_scores_gemma":[0.9983707,0.0011016697,0.00016560093,0.000094114184,0.00020059396,0.000067478955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010599414,0.0006455308,0.00091380056,0.0006012024,0.0005465796,0.0012169239,0.0012437043,0.0008862004,0.0016429167],"category_scores_gemma":[0.0048653786,0.00042517064,0.00029837777,0.001106837,0.0011290794,0.0012163984,0.00092652335,0.0006263327,0.00019142748],"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.000036593727,0.000018981389,0.00017603225,0.000017861048,0.000015369898,0.000021465987,0.000021701919,0.96860284,0.00057695084,0.02222827,0.0005722229,0.0077116988],"study_design_scores_gemma":[0.000003791856,0.000008694192,0.000090770176,0.0000015758642,0.0000031706052,0.0000051862744,0.00000876213,0.9882683,0.00011822495,0.011353687,0.00013469624,0.0000030949022],"about_ca_topic_score_codex":0.0050183684,"about_ca_topic_score_gemma":0.0044060955,"teacher_disagreement_score":0.0050183684,"about_ca_system_score_codex":0.0012660597,"about_ca_system_score_gemma":0.0006133237,"threshold_uncertainty_score":0.009978294},"labels":[],"label_agreement":null},{"id":"W2499723252","doi":"10.1007/s11276-016-1335-7","title":"A performance evaluation of a fault-tolerant path recommendation protocol for smart transportation system","year":2016,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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; Path (computing); Correctness; Protocol (science); Computer network; Distributed computing; Algorithm","score_opus":0.02057557464667516,"score_gpt":0.25498784996205043,"score_spread":0.23441227531537526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499723252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88358,0.0019305941,0.103074275,0.00062914426,0.00027704943,0.00044893633,0.00033421136,0.0019126604,0.007813119],"genre_scores_gemma":[0.98997,0.00018445733,0.008895173,0.000030417137,0.000016721504,0.000034462366,0.00013503,0.000018188051,0.0007154636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981704,0.0004908445,0.00013066904,0.0002060887,0.0007157182,0.0002863076],"domain_scores_gemma":[0.99416083,0.0032382363,0.00035521662,0.0005038264,0.0015404361,0.00020141942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025809852,0.0007833757,0.0008446556,0.0011418349,0.0008560707,0.0009263875,0.001492192,0.0009289215,0.002198898],"category_scores_gemma":[0.0068432335,0.00019870454,0.00029924608,0.00096329494,0.000560092,0.0016464078,0.00064694125,0.0005431903,0.00024696076],"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.003920273,0.00082064373,0.0076572807,0.00043556743,0.00030848084,0.00032561523,0.00013578517,0.79563546,0.027387852,0.0039501726,0.0035818447,0.15584104],"study_design_scores_gemma":[0.00006067546,0.0009858068,0.0009093884,0.000004508727,0.00006034014,0.000107122716,0.000051766347,0.99102294,0.006213271,0.00027474615,0.00029535533,0.000014081156],"about_ca_topic_score_codex":0.014007709,"about_ca_topic_score_gemma":0.007003504,"teacher_disagreement_score":0.014007709,"about_ca_system_score_codex":0.0021349601,"about_ca_system_score_gemma":0.0013305277,"threshold_uncertainty_score":0.027852356},"labels":[],"label_agreement":null},{"id":"W2541601719","doi":"10.1007/s11276-016-1381-1","title":"Power allocation in small cell networks with full-duplex self-backhauls and massive MIMO","year":2016,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Carleton University","funders":"National Natural Science Foundation of China","keywords":"Backhaul (telecommunications); Computer science; MIMO; Small cell; Base station; Mathematical optimization; Cellular network; Computer network; Beamforming; Telecommunications; Mathematics","score_opus":0.005616793612536041,"score_gpt":0.1793142362918112,"score_spread":0.17369744267927517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541601719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19414197,0.0015440695,0.790644,0.00055051036,0.00012435832,0.00006555774,0.00013591629,0.00020107155,0.012592543],"genre_scores_gemma":[0.98254883,0.00029769514,0.014197374,0.00006108386,0.000057903017,0.000041810636,0.00002023325,0.000016141588,0.0027590233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999686,0.00013157312,0.000009405838,0.000036482812,0.00006589276,0.000070698145],"domain_scores_gemma":[0.9990103,0.0007371506,0.000054724638,0.000048423735,0.0000972694,0.00005205205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005791111,0.00040668395,0.00062809704,0.00028256373,0.00039588398,0.0008422691,0.00063779275,0.00038838756,0.0015292736],"category_scores_gemma":[0.0019578927,0.0004120786,0.0001728736,0.00058703026,0.00073351065,0.00081526034,0.0006442659,0.00031679522,0.00022630076],"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.00029613893,0.000083479405,0.00066122564,0.00007782234,0.0000646006,0.0001543627,0.00009994398,0.92208576,0.007336198,0.027075345,0.0015411625,0.04052384],"study_design_scores_gemma":[0.000014618756,0.000040482762,0.00020643185,0.0000032300507,0.000009412583,0.000033105254,0.00002214624,0.98838764,0.0006152426,0.010368758,0.00029319688,0.0000056939257],"about_ca_topic_score_codex":0.0013451081,"about_ca_topic_score_gemma":0.0028270653,"teacher_disagreement_score":0.0015292736,"about_ca_system_score_codex":0.0006254334,"about_ca_system_score_gemma":0.0004775606,"threshold_uncertainty_score":0.0051159263},"labels":[],"label_agreement":null},{"id":"W2571453491","doi":"10.1007/s11276-016-1435-4","title":"Design and wet-laboratory implementation of reliable end-to-end molecular communication","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Japan Society for the Promotion of Science","keywords":"Molecular communication; Computer science; Network packet; End-to-end principle; Computer network; Distributed computing","score_opus":0.011517952924433753,"score_gpt":0.253939388754601,"score_spread":0.24242143583016723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571453491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28033307,0.0002638796,0.6986596,0.00070301624,0.00028902772,0.00074874307,0.00030298586,0.003964072,0.014735529],"genre_scores_gemma":[0.812644,0.00014804842,0.1806709,0.00013861134,0.000030716496,0.0005276099,0.00018225226,0.00015597828,0.0055018943],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993043,0.00010352809,0.000026717922,0.00012677185,0.00033775764,0.00010095699],"domain_scores_gemma":[0.9990351,0.00015838604,0.00016004563,0.00021299678,0.0003600474,0.000073402225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009526822,0.0004088881,0.00034723687,0.00022122372,0.0005422498,0.0009528229,0.0023251858,0.00070742116,0.002744767],"category_scores_gemma":[0.0012048665,0.0003223855,0.00023096782,0.00013670146,0.0004919347,0.0007987265,0.0006132191,0.00080938754,0.0012295106],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061601534,0.0008408765,0.0017829136,0.00034209876,0.00006959238,0.00029461464,0.00023190049,0.06166585,0.85543144,0.023457205,0.0031501658,0.05211736],"study_design_scores_gemma":[0.00008598109,0.0014733764,0.0008797752,0.000017212707,0.00002596123,0.00011263405,0.000048443075,0.2633211,0.719007,0.0010998648,0.013890866,0.00003778003],"about_ca_topic_score_codex":0.00053445896,"about_ca_topic_score_gemma":0.0009563035,"teacher_disagreement_score":0.002744767,"about_ca_system_score_codex":0.00091251417,"about_ca_system_score_gemma":0.0011447356,"threshold_uncertainty_score":0.009182155},"labels":[],"label_agreement":null},{"id":"W2592830952","doi":"10.1007/s11276-017-1482-5","title":"An efficient dynamic traffic light scheduling algorithm considering emergency vehicles for intelligent transportation systems","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Traffic control and management","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Intersection (aeronautics); Computer science; Traffic optimization; Scheduling (production processes); Traffic bottleneck; Floating car data; Emergency vehicle; Traffic congestion reconstruction with Kerner's three-phase theory; Traffic conflict; Schedule; Traffic flow (computer networking); Traffic wave; Traffic signal; Real-time computing; Transport engineering; Traffic congestion; Computer network; Engineering","score_opus":0.009253508075361034,"score_gpt":0.23148762992415273,"score_spread":0.22223412184879168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592830952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07345306,0.00023884143,0.9224701,0.000163357,0.00018699293,0.00009145896,0.000054111475,0.0003401725,0.0030019102],"genre_scores_gemma":[0.85937786,0.00013192144,0.13808343,0.00006767324,0.00008037093,0.00010485255,0.00012303398,0.00004313638,0.0019876997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972945,0.000046773413,0.000010280087,0.00007361719,0.0000654866,0.00007450159],"domain_scores_gemma":[0.9996915,0.00011502755,0.000030734143,0.000017625334,0.0001066285,0.0000384613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004118051,0.0007684591,0.0010087524,0.0005644584,0.0008702351,0.00085025,0.0011565032,0.0006692637,0.0014337028],"category_scores_gemma":[0.00083051063,0.00038908518,0.00044741077,0.0006550964,0.0002884425,0.00073621905,0.00057796773,0.0005812224,0.00017799597],"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.0002529922,0.00015560836,0.0007579463,0.0000572419,0.000040235547,0.00007684191,0.000046161487,0.90697825,0.00606213,0.0042233868,0.0018706612,0.07947859],"study_design_scores_gemma":[0.000007845618,0.000015418698,0.00005106821,0.000001011194,0.0000052712435,0.0000053259682,0.000006300765,0.99904376,0.00024142169,0.00046835508,0.00015215563,0.0000019116942],"about_ca_topic_score_codex":0.008011179,"about_ca_topic_score_gemma":0.009517818,"teacher_disagreement_score":0.008011179,"about_ca_system_score_codex":0.00095589575,"about_ca_system_score_gemma":0.0019239299,"threshold_uncertainty_score":0.015929103},"labels":[],"label_agreement":null},{"id":"W2593862813","doi":"10.1007/s11276-017-1483-4","title":"E3TX: an energy-efficient expected transmission count routing decision strategy for wireless sensor networks","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Energy consumption; Wireless sensor network; Network packet; Routing protocol; Computer network; Transmission (telecommunications); Efficient energy use; Real-time computing; Telecommunications; Electrical engineering","score_opus":0.022240435661806498,"score_gpt":0.2690684449742435,"score_spread":0.24682800931243698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593862813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020126207,0.00040002988,0.9753559,0.00035733895,0.000118195225,0.000110782086,0.00010059954,0.00060963165,0.002821337],"genre_scores_gemma":[0.81156015,0.00033325976,0.18159413,0.0003741527,0.00011439996,0.00021665389,0.00018966742,0.00013567269,0.0054819104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994356,0.0001863706,0.0000293522,0.0000876391,0.0001803125,0.000080835074],"domain_scores_gemma":[0.9991013,0.0005390843,0.00006618181,0.000058770707,0.00017153457,0.00006310705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012805222,0.0007824115,0.0007733127,0.0005872096,0.00041158337,0.0007037467,0.0018993709,0.0008678251,0.0029235042],"category_scores_gemma":[0.0031006092,0.00022020961,0.0003413538,0.00056168507,0.00038367708,0.0011176537,0.0012363777,0.0007629977,0.000350918],"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.0007182651,0.0003045621,0.0008393078,0.00018971729,0.000094116185,0.00015813408,0.00012968588,0.63946944,0.011974669,0.029048748,0.008798911,0.30827442],"study_design_scores_gemma":[0.000021862077,0.0001056353,0.000086344735,0.000005739675,0.000010617276,0.000036101956,0.0000141135615,0.9933235,0.0014280241,0.004268307,0.0006929156,0.0000068230306],"about_ca_topic_score_codex":0.0015221098,"about_ca_topic_score_gemma":0.0028085383,"teacher_disagreement_score":0.0029235042,"about_ca_system_score_codex":0.0006961978,"about_ca_system_score_gemma":0.0009899423,"threshold_uncertainty_score":0.0097801685},"labels":[],"label_agreement":null},{"id":"W2601577395","doi":"10.1007/s11276-017-1494-1","title":"Community-aware single-copy content forwarding in Mobile Social Network","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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; Computer network; Latency (audio); Node (physics); Overhead (engineering); Markov chain; Distributed computing; Machine learning; Telecommunications","score_opus":0.08015620380598135,"score_gpt":0.2787713535608037,"score_spread":0.19861514975482233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601577395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17898473,0.0012102489,0.81376666,0.00080132973,0.00019908865,0.00027683776,0.00026976774,0.00058520347,0.0039061313],"genre_scores_gemma":[0.94178534,0.0004505982,0.05389543,0.00009459312,0.00013274765,0.00009911761,0.00015912954,0.000057667763,0.0033253967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988404,0.00029673477,0.00004506133,0.00027801874,0.00034282537,0.00019710588],"domain_scores_gemma":[0.992706,0.0050959447,0.00060380367,0.00048102302,0.0007041356,0.00040912794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021108615,0.0008634676,0.0021209961,0.0022759498,0.002064968,0.0016806977,0.004019873,0.0020264555,0.0013251303],"category_scores_gemma":[0.009501649,0.0007659551,0.0008215444,0.0023992963,0.0013021004,0.0030980455,0.0022766483,0.00089859194,0.00024959876],"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.00046811844,0.0003957415,0.003195693,0.00030492642,0.00015402924,0.00048263118,0.0005446318,0.8388878,0.008321364,0.06392296,0.0050369105,0.07828522],"study_design_scores_gemma":[0.00001283533,0.00002873299,0.00011380787,0.000004471005,0.000016340085,0.000054182117,0.000033594413,0.9901635,0.00040577105,0.008802102,0.00035596537,0.000008732374],"about_ca_topic_score_codex":0.008036969,"about_ca_topic_score_gemma":0.0093488125,"teacher_disagreement_score":0.008036969,"about_ca_system_score_codex":0.0017804549,"about_ca_system_score_gemma":0.0017798423,"threshold_uncertainty_score":0.015980363},"labels":[],"label_agreement":null},{"id":"W2603855048","doi":"10.1007/s11276-017-1493-2","title":"New path planning model for mobile anchor-assisted localization in wireless sensor networks","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Dalhousie University","funders":"","keywords":"Computer science; Wireless sensor network; Path (computing); Collinearity; Energy consumption; Distributed computing; Set (abstract data type); Computer network; Energy (signal processing); Event (particle physics); Real-time computing","score_opus":0.018339211808512657,"score_gpt":0.2525537816487973,"score_spread":0.23421456984028466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603855048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001998563,0.00023331013,0.9960996,0.00012032843,0.00004489733,0.00002467944,0.000093244475,0.00011540176,0.0012699789],"genre_scores_gemma":[0.5310975,0.002914316,0.4453172,0.00026512457,0.00023304658,0.0006711213,0.0010031696,0.00025446402,0.018244013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935335,0.000170191,0.000032950516,0.00016342403,0.00020359176,0.00007644307],"domain_scores_gemma":[0.9993432,0.00033932098,0.00006797168,0.000043598688,0.00017047128,0.000035345736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008749807,0.0011110886,0.0013240725,0.0009450661,0.00060996093,0.0012061582,0.002769634,0.0013563534,0.0032402957],"category_scores_gemma":[0.0021964973,0.0007400404,0.00094366824,0.002430788,0.000764,0.002057165,0.0012898681,0.0015459278,0.00071573735],"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.000014313749,0.000010058684,0.00009999362,0.0000346422,0.00001058278,0.0000317416,0.000024146128,0.978438,0.00031384148,0.011466441,0.0007583265,0.00879787],"study_design_scores_gemma":[0.0000019459646,0.0000049171235,0.000014136669,0.0000024208987,0.0000031874536,0.0000059199656,0.0000026424061,0.99716216,0.00004950042,0.0024819656,0.00026868097,0.0000024181184],"about_ca_topic_score_codex":0.016824907,"about_ca_topic_score_gemma":0.011766887,"teacher_disagreement_score":0.016824907,"about_ca_system_score_codex":0.0016773159,"about_ca_system_score_gemma":0.0018284243,"threshold_uncertainty_score":0.03345394},"labels":[],"label_agreement":null},{"id":"W2725362229","doi":"10.1007/s11276-017-1546-6","title":"RF energy harvesting: an analysis of wireless sensor networks for reliable communication","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Medical Research Council; Electronic Components and Systems for European Leadership","keywords":"Computer science; Network packet; Computer network; Wireless sensor network; Energy harvesting; Reliability (semiconductor); Telecommunications link; Timeout; Efficient energy use; Real-time computing; Energy (signal processing); Electrical engineering; Engineering","score_opus":0.017977953647016067,"score_gpt":0.247668720670076,"score_spread":0.22969076702305993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725362229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119260615,0.0070011048,0.9715305,0.00059091573,0.000138554,0.0000686688,0.00005630202,0.000112441405,0.008575431],"genre_scores_gemma":[0.82692164,0.028203202,0.13154376,0.0006773436,0.0008728773,0.00066601107,0.00020709849,0.00024325907,0.010664798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988372,0.00032610324,0.000046726498,0.00015178215,0.0005609459,0.000077391844],"domain_scores_gemma":[0.9981768,0.001039126,0.00025187855,0.000117381656,0.00038567695,0.000029165709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019225549,0.0011764236,0.00069821073,0.0011680773,0.0005353247,0.00085721264,0.0012406979,0.001018698,0.0013174578],"category_scores_gemma":[0.005653498,0.0004277994,0.0007879985,0.0012907924,0.000967993,0.00255774,0.00064289995,0.000896947,0.0004125375],"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.00004067591,0.000029490733,0.0008977923,0.00059124746,0.00008221776,0.0002781683,0.00022867888,0.75354517,0.009889966,0.19180265,0.0016947779,0.040919106],"study_design_scores_gemma":[0.0000023350735,0.00003725458,0.00030986103,0.000041070885,0.000018715065,0.000114905066,0.000032932658,0.97268087,0.00069801806,0.023845952,0.0022061719,0.000011878108],"about_ca_topic_score_codex":0.0014917864,"about_ca_topic_score_gemma":0.00091560243,"teacher_disagreement_score":0.0019225549,"about_ca_system_score_codex":0.0010277007,"about_ca_system_score_gemma":0.0005368661,"threshold_uncertainty_score":0.010167539},"labels":[],"label_agreement":null},{"id":"W2728571229","doi":"10.1007/s11276-017-1554-6","title":"Load balancing routing with queue overflow prediction for WSNs","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"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":"European Regional Development Fund; Université Clermont-Auvergne; Université de Lyon; Université Claude Bernard Lyon 1; Agence Nationale de la Recherche","keywords":"Computer science; Computer network; Queuing delay; Routing protocol; Queue; Dynamic Source Routing; Static routing; Distributed computing; Network packet","score_opus":0.010351866223148347,"score_gpt":0.22376758206505887,"score_spread":0.21341571584191052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728571229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08670135,0.0012674317,0.9067741,0.00067596,0.00031728638,0.0001038361,0.00024532026,0.001874379,0.002040433],"genre_scores_gemma":[0.93306094,0.00033975655,0.06478006,0.00007587423,0.00012416516,0.000047580015,0.00015335115,0.000075119104,0.0013431028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995092,0.00011323027,0.000035713987,0.00013460412,0.00013611821,0.00007111887],"domain_scores_gemma":[0.9985701,0.0007464282,0.00019503152,0.00017276924,0.00023642697,0.00007925197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547802,0.0007070306,0.00077907497,0.0006901316,0.0006386814,0.0010129508,0.0014023148,0.00052429165,0.0010428658],"category_scores_gemma":[0.0040078885,0.00037207737,0.0003143139,0.00087796466,0.000399164,0.0015572299,0.00079097087,0.00079125323,0.00016355529],"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.0003745048,0.00015918698,0.0022848493,0.00011351719,0.00007556512,0.00007462438,0.000089102374,0.86822784,0.0072908374,0.0054082945,0.0030300627,0.11287163],"study_design_scores_gemma":[0.000004415157,0.000015499583,0.00012634762,0.000002186174,0.000006363164,0.0000069982457,0.000006017661,0.9975922,0.00046508465,0.0016516263,0.000120151955,0.0000031578963],"about_ca_topic_score_codex":0.0058265883,"about_ca_topic_score_gemma":0.008173278,"teacher_disagreement_score":0.0058265883,"about_ca_system_score_codex":0.0009891833,"about_ca_system_score_gemma":0.0010421636,"threshold_uncertainty_score":0.011585355},"labels":[],"label_agreement":null},{"id":"W2730287276","doi":"10.1007/s11276-017-1551-9","title":"A hierarchical learning approach to anti-jamming channel selection strategies","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Jamming; Channel (broadcasting); Selection (genetic algorithm); Convergence (economics); Interference (communication); Adversarial system; Mathematical optimization; Artificial intelligence; Computer network","score_opus":0.019077499773533655,"score_gpt":0.2549604267114776,"score_spread":0.23588292693794397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730287276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060109296,0.00016241803,0.99090075,0.0001438354,0.000025859787,0.000031866133,0.000032281947,0.00014089179,0.002551251],"genre_scores_gemma":[0.70990276,0.00062012975,0.27640918,0.00035001195,0.0002606757,0.00024613598,0.00016719513,0.00011564746,0.011928249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998995,0.00038015054,0.000041400963,0.00014434695,0.00029219151,0.00014684538],"domain_scores_gemma":[0.99732286,0.0017555675,0.00016193425,0.00022814187,0.0004249292,0.000106633335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014183329,0.00068752246,0.0010639344,0.00093557476,0.0006456462,0.00095032423,0.0023962818,0.0012204105,0.00369037],"category_scores_gemma":[0.00540628,0.0005720387,0.0006044939,0.0011415819,0.0011446112,0.0016132254,0.0013943386,0.0012761349,0.0006826463],"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.000054713437,0.00008252569,0.00035834365,0.000055358116,0.000044392422,0.000036820584,0.00007573647,0.8782018,0.0018425186,0.05753875,0.0018794154,0.059829626],"study_design_scores_gemma":[0.000004551179,0.000015813139,0.00004694111,0.000002444467,0.000005382017,0.000007720096,0.0000043609602,0.98995614,0.00018776284,0.009550805,0.00021351973,0.000004578169],"about_ca_topic_score_codex":0.0054125804,"about_ca_topic_score_gemma":0.0061215186,"teacher_disagreement_score":0.0054125804,"about_ca_system_score_codex":0.0014025484,"about_ca_system_score_gemma":0.0014056026,"threshold_uncertainty_score":0.012345493},"labels":[],"label_agreement":null},{"id":"W2756349355","doi":"10.1007/s11276-017-1575-1","title":"Secure opportunistic routing protocols: methods, models, and classification","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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; Routing protocol; Computer network; Interior gateway protocol; Reliability (semiconductor); Protocol (science); Network packet; Node (physics); Set (abstract data type); Distributed computing; Routing (electronic design automation); Wireless; Cryptographic protocol; Link-state routing protocol; Computer security; Cryptography; Telecommunications","score_opus":0.09514426653872908,"score_gpt":0.3564103952561668,"score_spread":0.2612661287174377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756349355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020643566,0.0072036027,0.9633721,0.0016910373,0.00024651785,0.00022116861,0.0003305976,0.0003467079,0.0059446907],"genre_scores_gemma":[0.66321105,0.026753357,0.29296097,0.0003863949,0.0015658146,0.0011360006,0.0011979367,0.00018242327,0.012606122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968099,0.001000338,0.0002316472,0.0004540582,0.0012381918,0.0002658783],"domain_scores_gemma":[0.9912583,0.0052793142,0.0010610167,0.001369011,0.0008429303,0.0001894571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040512355,0.0016759488,0.0015209023,0.0035200734,0.0010718309,0.0033384298,0.0024965745,0.0016944088,0.0014405643],"category_scores_gemma":[0.009366968,0.00080753816,0.0010942578,0.0032607876,0.0020655538,0.00599789,0.001642313,0.0027059035,0.00046394274],"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.00014505141,0.00022633764,0.004136126,0.00035153684,0.00009206094,0.00010722403,0.00027863405,0.24219649,0.0017214961,0.61806685,0.006520299,0.12615786],"study_design_scores_gemma":[0.000019676132,0.00007476922,0.00046940273,0.00006583822,0.000043867793,0.0002630765,0.00006330893,0.75981385,0.0007376882,0.23239228,0.0060208994,0.000035359295],"about_ca_topic_score_codex":0.0019184686,"about_ca_topic_score_gemma":0.0020636488,"teacher_disagreement_score":0.0040512355,"about_ca_system_score_codex":0.0023800386,"about_ca_system_score_gemma":0.0017399613,"threshold_uncertainty_score":0.021425247},"labels":[],"label_agreement":null},{"id":"W2767464508","doi":"10.1007/s11276-017-1605-z","title":"Power allocation policy and performance analysis of secure and reliable communication in cognitive radio networks","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Electronic Components and Systems for European Leadership; Bộ Giáo dục và Ðào tạo","keywords":"Eavesdropping; Computer science; Cognitive radio; Constraint (computer-aided design); Interference (communication); Performance metric; Channel (broadcasting); Computer network; Power (physics); Metric (unit); Channel state information; Computer security; Mathematical optimization; Telecommunications; Wireless; Mathematics","score_opus":0.010296717256972496,"score_gpt":0.25777343061874614,"score_spread":0.24747671336177363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767464508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16695243,0.002104431,0.81682366,0.0009079946,0.00009237516,0.00014397793,0.000099039455,0.0002843577,0.012591761],"genre_scores_gemma":[0.98717415,0.00063817966,0.011153316,0.000049580693,0.00004843345,0.00005945622,0.000019369196,0.000030470568,0.00082709227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966941,0.0016350081,0.00008961946,0.0002599884,0.0007451545,0.00057610084],"domain_scores_gemma":[0.9828956,0.013054759,0.0018142334,0.00070665486,0.0012769243,0.00025183297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052268305,0.0015630323,0.0011465362,0.00136788,0.0007734207,0.0019467459,0.0010954526,0.0012591771,0.0015186034],"category_scores_gemma":[0.02377299,0.0005187446,0.0005190626,0.001300109,0.002608647,0.0023411412,0.0015043912,0.0013582135,0.00029383806],"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.0001518976,0.000040139614,0.0005083483,0.00008666255,0.000028758144,0.00012309352,0.00011882964,0.93989635,0.00303113,0.046865568,0.00045294958,0.008696242],"study_design_scores_gemma":[0.0000108063705,0.00006356596,0.00015224036,0.000012298708,0.000011626761,0.000049484257,0.000036852816,0.9868678,0.0007804852,0.011868291,0.00013599629,0.000010651686],"about_ca_topic_score_codex":0.002401627,"about_ca_topic_score_gemma":0.0009213024,"teacher_disagreement_score":0.0052268305,"about_ca_system_score_codex":0.0023157068,"about_ca_system_score_gemma":0.001520022,"threshold_uncertainty_score":0.027642488},"labels":[],"label_agreement":null},{"id":"W2767642415","doi":"10.1007/s11276-017-1607-x","title":"Movement prediction models for vehicular networks: an empirical analysis","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":15,"is_retracted":false,"has_abstract":false,"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; Kalman filter; Extended Kalman filter; Particle filter; Intelligent transportation system; Vehicular ad hoc network; Routing (electronic design automation); Real-time computing; Artificial intelligence; Computer network; Wireless ad hoc network; Telecommunications; Wireless; Transport engineering","score_opus":0.04294151464318037,"score_gpt":0.34433624230990695,"score_spread":0.3013947276667266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767642415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8731122,0.002091017,0.11877938,0.0023364231,0.000072388495,0.00012643659,0.0012668481,0.0002290104,0.0019862766],"genre_scores_gemma":[0.990825,0.0006624314,0.0062409895,0.000067300134,0.00005761314,0.00007844687,0.0010000751,0.000032852622,0.0010353175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770325,0.0015428356,0.00008279456,0.00029660563,0.00020573172,0.00016875856],"domain_scores_gemma":[0.9129163,0.0802419,0.0023532992,0.0020410146,0.0020293922,0.00041803843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013043299,0.0010715363,0.0011752823,0.0017355534,0.0007661789,0.0013797764,0.0019820274,0.0015228022,0.003404581],"category_scores_gemma":[0.054415017,0.0005955864,0.0014092918,0.0020158985,0.0011442847,0.0032153868,0.0008991396,0.0024722633,0.0005688784],"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.0005352179,0.000489024,0.174432,0.00018166231,0.0004999629,0.00020764914,0.00068835303,0.74492955,0.00028266083,0.023129148,0.0066180904,0.048006695],"study_design_scores_gemma":[0.000022495873,0.00008289256,0.01439517,0.000033935405,0.00009332589,0.000090081114,0.0002148268,0.9727895,0.00008499065,0.01167664,0.0004993125,0.000016802931],"about_ca_topic_score_codex":0.020178247,"about_ca_topic_score_gemma":0.01231881,"teacher_disagreement_score":0.020178247,"about_ca_system_score_codex":0.001757751,"about_ca_system_score_gemma":0.0011224626,"threshold_uncertainty_score":0.068980396},"labels":[],"label_agreement":null},{"id":"W2795249660","doi":"10.1007/s11276-018-1720-5","title":"Spectrum and energy efficiency of cooperative spectrum prediction in cognitive radio networks","year":2018,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cognitive radio; Computer science; Efficient energy use; Spectral efficiency; Hidden Markov model; Multilayer perceptron; Energy (signal processing); Artificial neural network; Perceptron; Channel (broadcasting); Artificial intelligence; Algorithm; Telecommunications; Wireless; Statistics; Mathematics","score_opus":0.008679502226986534,"score_gpt":0.21919218730151313,"score_spread":0.21051268507452658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795249660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48717576,0.0018448043,0.49858654,0.00092174346,0.000095049094,0.000036807625,0.00008939124,0.00013412522,0.011115758],"genre_scores_gemma":[0.99474466,0.00012793715,0.0043275463,0.00003842663,0.000022629225,0.000010302254,0.000016072376,0.0000126658515,0.0006997503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863213,0.00047940135,0.00005359707,0.00017533776,0.00040908935,0.00025047135],"domain_scores_gemma":[0.9888805,0.009693112,0.0003350687,0.00038626924,0.0005951644,0.00010987438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027959624,0.00051929324,0.00071162457,0.00059473724,0.0004932922,0.0015076409,0.0010714306,0.0009181214,0.0016010085],"category_scores_gemma":[0.015430165,0.00039906832,0.00024630892,0.0007277906,0.0012247988,0.0017883955,0.001271783,0.00054368854,0.00016202495],"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.0003979692,0.00016908286,0.002226387,0.00005326531,0.000056868503,0.000078906676,0.000108339,0.9407579,0.003340786,0.02253124,0.00043610312,0.029843265],"study_design_scores_gemma":[0.000008293282,0.0000288525,0.00043909845,0.0000046955324,0.000013680863,0.000029850708,0.000027920913,0.9900808,0.00081297976,0.008482002,0.00006666455,0.0000052586265],"about_ca_topic_score_codex":0.0028546087,"about_ca_topic_score_gemma":0.0030598757,"teacher_disagreement_score":0.0028546087,"about_ca_system_score_codex":0.0010087659,"about_ca_system_score_gemma":0.0010306583,"threshold_uncertainty_score":0.014786661},"labels":[],"label_agreement":null},{"id":"W2803769454","doi":"10.1007/s11276-018-1735-y","title":"Computation offloading balance in small cell networks with mobile edge computing","year":2018,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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; Computation offloading; Mobile edge computing; Server; Base station; Computation; Energy consumption; Computer network; Wireless; User equipment; Distributed computing; Transmission (telecommunications); Small cell; Latency (audio); Enhanced Data Rates for GSM Evolution; Edge computing; Algorithm; Telecommunications","score_opus":0.009206615572632519,"score_gpt":0.21703406088593874,"score_spread":0.2078274453133062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803769454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6345557,0.003225917,0.33305168,0.0013077098,0.00072224555,0.00020116442,0.0002665715,0.0007505157,0.02591842],"genre_scores_gemma":[0.9926428,0.00017688748,0.00535922,0.000051595347,0.00006746259,0.000018983312,0.00003622571,0.000028360844,0.0016183914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996191,0.00005490618,0.00001276638,0.000090380585,0.00008218266,0.00014053985],"domain_scores_gemma":[0.99943656,0.00026279438,0.00003471389,0.00005270478,0.00012904123,0.00008416652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004115,0.0006713748,0.00082670647,0.0005610021,0.0012719678,0.0016543815,0.0009441116,0.00040948216,0.0031446023],"category_scores_gemma":[0.0014455706,0.0001982738,0.00020251506,0.00075555034,0.00042312738,0.0017975621,0.0008051306,0.00037449505,0.00024316375],"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.0028716603,0.00078939565,0.00682906,0.0003460103,0.00015200066,0.0007015802,0.00052242755,0.6328927,0.048546232,0.049959462,0.015742574,0.24064694],"study_design_scores_gemma":[0.00001985534,0.00009133047,0.0006970645,0.000007918181,0.000028268774,0.000057111683,0.00014206133,0.9854079,0.0025746613,0.009858551,0.0011067224,0.000008572224],"about_ca_topic_score_codex":0.0037863085,"about_ca_topic_score_gemma":0.005883732,"teacher_disagreement_score":0.0037863085,"about_ca_system_score_codex":0.00083665136,"about_ca_system_score_gemma":0.00088759814,"threshold_uncertainty_score":0.010519683},"labels":[],"label_agreement":null},{"id":"W2883723754","doi":"10.1007/s11276-018-1796-y","title":"Next generation wireless cellular networks: ultra-dense multi-tier and multi-cell cooperation perspective","year":2018,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Reliability (semiconductor); Computer network; Low latency (capital markets); Wireless; Telecommunications; Wireless network; Key (lock); Open research; Efficient energy use; Cellular network; Latency (audio); Heterogeneous network; Next-generation network; The Internet; Electrical engineering; Computer security","score_opus":0.01902428644199325,"score_gpt":0.2265689387290187,"score_spread":0.20754465228702546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883723754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047774684,0.03394603,0.82816577,0.0058824476,0.0008003776,0.00004989424,0.00037926692,0.0001424583,0.08285895],"genre_scores_gemma":[0.91819805,0.025733583,0.043082952,0.00078715454,0.0013799106,0.00005151188,0.00012246228,0.000027252863,0.01061708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996662,0.00010641481,0.000007811708,0.00004973175,0.0001182791,0.000051450643],"domain_scores_gemma":[0.9993507,0.00033399003,0.00006796286,0.000052931497,0.00015441031,0.000040086354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005668633,0.00064984435,0.0006367927,0.00032486362,0.0003696934,0.0015542515,0.0009924897,0.0011591226,0.002030271],"category_scores_gemma":[0.0012514426,0.00040068003,0.00021859819,0.00081099337,0.0007376324,0.0024728654,0.0010130313,0.0011052439,0.00029166634],"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.00009489883,0.00010548695,0.0015216677,0.0003251741,0.00010737234,0.00037514392,0.0001118478,0.45886323,0.0050391816,0.44337717,0.0076828445,0.08239592],"study_design_scores_gemma":[0.000008230964,0.00007406972,0.0012236969,0.000053287164,0.00004357811,0.00036595605,0.00015959605,0.81835705,0.00083844626,0.16833533,0.010515344,0.00002539163],"about_ca_topic_score_codex":0.0020472168,"about_ca_topic_score_gemma":0.004330406,"teacher_disagreement_score":0.0020472168,"about_ca_system_score_codex":0.00091256417,"about_ca_system_score_gemma":0.0005438671,"threshold_uncertainty_score":0.0067919493},"labels":[],"label_agreement":null},{"id":"W2887410234","doi":"10.1007/s11276-018-1806-0","title":"An improved method for TOA analysis in MMW systems","year":2018,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Extremely high frequency; Energy (signal processing); Multipath propagation; Detector; Time of arrival; Algorithm; Signal-to-noise ratio (imaging); Noise (video); Electronic engineering; Telecommunications; Wireless; Artificial intelligence; Statistics; Mathematics","score_opus":0.011907216198168117,"score_gpt":0.2798330401114088,"score_spread":0.2679258239132407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887410234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005006806,0.000048100435,0.9979808,0.000016846128,0.000036128367,0.000016070118,0.00003178208,0.00027587757,0.0010938057],"genre_scores_gemma":[0.06265825,0.0003836428,0.9207797,0.0001343078,0.00016221081,0.00021315031,0.00026431005,0.0007460644,0.014658343],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952793,0.00012915916,0.000020718351,0.00005119036,0.00023457575,0.000036417885],"domain_scores_gemma":[0.99926,0.0002617513,0.00003223668,0.00013387216,0.0002875708,0.000024525589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005856923,0.0011243022,0.0007225926,0.0010621297,0.0006220965,0.0010233222,0.0012168451,0.0010873071,0.010973692],"category_scores_gemma":[0.001978836,0.0004075337,0.0010643586,0.0008380437,0.00040608502,0.0012127749,0.00081718684,0.0014449705,0.005191981],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016335388,0.00016402075,0.0007867505,0.00033696333,0.0001656892,0.00027496557,0.00020697695,0.3935132,0.06020019,0.08417315,0.012635824,0.44737887],"study_design_scores_gemma":[0.000006338638,0.000011715426,0.00009182018,0.000009172981,0.000011103098,0.00005299548,0.000008820712,0.9858482,0.002033842,0.0062810546,0.0056325747,0.00001235582],"about_ca_topic_score_codex":0.0041956524,"about_ca_topic_score_gemma":0.0053642676,"teacher_disagreement_score":0.010973692,"about_ca_system_score_codex":0.00040502977,"about_ca_system_score_gemma":0.0009296891,"threshold_uncertainty_score":0.03671068},"labels":[],"label_agreement":null},{"id":"W2904344771","doi":"10.1007/s11276-018-01896-2","title":"A framework for social media data analytics using Elasticsearch and Kibana","year":2018,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; NoSQL; Search engine indexing; Context (archaeology); Process (computing); Analytics; Set (abstract data type); Social media; Relational database; Enhanced Data Rates for GSM Evolution; Database; Big data; Data science; World Wide Web; Data mining; Operating system","score_opus":0.16183378974483906,"score_gpt":0.37284181598505267,"score_spread":0.21100802624021361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904344771","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017399603,0.00035182186,0.99368894,0.00044580613,0.000073032264,0.00010441155,0.0002497135,0.001997146,0.0013490878],"genre_scores_gemma":[0.07538901,0.0008567763,0.91742367,0.0002671035,0.000123511,0.00040846612,0.0012091681,0.00041426552,0.003908152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970192,0.00074800814,0.00035233836,0.00058418134,0.0010707796,0.000225648],"domain_scores_gemma":[0.9967194,0.0013019519,0.0001963762,0.00090086064,0.00068086316,0.00020053203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053386632,0.0010973613,0.0019216404,0.005882842,0.0022169834,0.0058227717,0.003964352,0.0016082283,0.0047665667],"category_scores_gemma":[0.014163907,0.0010598091,0.0021029576,0.007773928,0.0016505081,0.010719567,0.005985613,0.0030156001,0.0029934195],"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.0004199748,0.00043101163,0.0035262115,0.00037498918,0.00023101279,0.00044319066,0.0006688039,0.06919111,0.0029224122,0.5506902,0.018216537,0.35288462],"study_design_scores_gemma":[0.00002511974,0.000026447482,0.0002582132,0.00006511266,0.000041609477,0.00016202299,0.00016823722,0.7878582,0.0014511519,0.1876924,0.022213483,0.000037982958],"about_ca_topic_score_codex":0.009280298,"about_ca_topic_score_gemma":0.0089193005,"teacher_disagreement_score":0.009280298,"about_ca_system_score_codex":0.0014604068,"about_ca_system_score_gemma":0.002869305,"threshold_uncertainty_score":0.028233945},"labels":[],"label_agreement":null},{"id":"W2907095036","doi":"10.1007/s11276-018-01932-1","title":"Smart integrated IoT healthcare system for cancer care","year":2019,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Interoperability; Variety (cybernetics); Computer science; Interconnectivity; Cloud computing; Analytics; Health care; Internet of Things; Big data; Healthcare industry; Data science; Knowledge management; Computer security; Process management; World Wide Web; Business; Artificial intelligence","score_opus":0.011742293015414055,"score_gpt":0.24608266606036147,"score_spread":0.23434037304494743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907095036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.344495,0.0102453735,0.44881994,0.008683781,0.0052945367,0.0018935626,0.010598738,0.029127175,0.1408419],"genre_scores_gemma":[0.90853566,0.0020232112,0.048646443,0.004179377,0.0005836391,0.0004888477,0.0052469145,0.0003338879,0.029961908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997638,0.000039219056,0.000025789306,0.000052896747,0.000069023336,0.000049323484],"domain_scores_gemma":[0.9997739,0.000026599842,0.000020003026,0.000032489428,0.00009022122,0.000056803616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002884307,0.0003378575,0.00049772416,0.0004306574,0.00036188905,0.000675886,0.00062726095,0.0005609863,0.009617107],"category_scores_gemma":[0.000397158,0.00012354551,0.00035902674,0.00050952187,0.00012066829,0.0006361012,0.0009323397,0.00036058165,0.0026357498],"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.0022318328,0.0007568602,0.03592996,0.00079827843,0.0003051252,0.0022184364,0.00056017435,0.008502766,0.080543995,0.012602974,0.21779981,0.6377498],"study_design_scores_gemma":[0.00084963127,0.0026882866,0.07762239,0.00045979914,0.0011443838,0.0059955623,0.00092304655,0.27305213,0.08060144,0.01378999,0.54253155,0.00034181395],"about_ca_topic_score_codex":0.00082432065,"about_ca_topic_score_gemma":0.0014715847,"teacher_disagreement_score":0.009617107,"about_ca_system_score_codex":0.00036409043,"about_ca_system_score_gemma":0.00078988104,"threshold_uncertainty_score":0.0321725},"labels":[],"label_agreement":null},{"id":"W2951482547","doi":"10.1007/s11276-019-02055-x","title":"QoE awareness in progressive caching and DASH-based D2D video streaming in cellular networks","year":2019,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Quality of experience; Cache; Dynamic Adaptive Streaming over HTTP; Computer network; Cellular network; Video quality; Architecture; Multimedia; Real-time computing; Quality of service; Metric (unit)","score_opus":0.010073008489994503,"score_gpt":0.26016790891780156,"score_spread":0.2500949004278071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951482547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7215259,0.0013024352,0.27232435,0.0004307341,0.0001380557,0.000102241305,0.00009972212,0.00035367647,0.003722877],"genre_scores_gemma":[0.99649614,0.000081865306,0.0030350266,0.000014480778,0.000014691826,0.0000049240607,0.000014951353,0.0000039749407,0.00033392588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950266,0.00012664306,0.000026863685,0.000094556286,0.00012714247,0.00012219492],"domain_scores_gemma":[0.99806994,0.0011421867,0.000111058085,0.000098129436,0.00046171297,0.00011695377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089893193,0.00036929644,0.0006087616,0.00036144324,0.00046495217,0.0009503876,0.00061941025,0.00042600418,0.0006217426],"category_scores_gemma":[0.0032709453,0.00022707367,0.00018079074,0.0004943457,0.00052289374,0.0007667859,0.0005305998,0.0004242308,0.00008254627],"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.0035621966,0.0010100626,0.028727492,0.00029585132,0.00017189988,0.0010888409,0.0007454151,0.57945585,0.07687842,0.019179864,0.0027977633,0.28608632],"study_design_scores_gemma":[0.000013303982,0.00012239856,0.0018390733,0.0000047419894,0.000025048595,0.00006400428,0.0001127554,0.99344736,0.0030369128,0.0011323472,0.00019402619,0.000008072275],"about_ca_topic_score_codex":0.009716126,"about_ca_topic_score_gemma":0.008894714,"teacher_disagreement_score":0.009716126,"about_ca_system_score_codex":0.0007415401,"about_ca_system_score_gemma":0.00080931734,"threshold_uncertainty_score":0.019319117},"labels":[],"label_agreement":null},{"id":"W2954244885","doi":"10.1007/s11276-019-02071-x","title":"Sensor deployment in wireless sensor networks with linear topology using virtual node concept","year":2019,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut National des Sciences Appliquées de Lyon; Agence Universitaire de la Francophonie","keywords":"Software deployment; Wireless sensor network; Bottleneck; Computer science; Computer network; Greedy algorithm; Key distribution in wireless sensor networks; Distributed computing; Maximization; Wireless network; Real-time computing; Wireless; Embedded system; Algorithm; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.010866493170204803,"score_gpt":0.2303227409225727,"score_spread":0.2194562477523679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954244885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03881087,0.00074977125,0.9576521,0.00021657323,0.000087613305,0.000031203996,0.00001988128,0.00015317673,0.00227885],"genre_scores_gemma":[0.9127655,0.0010676943,0.08351689,0.00008840482,0.00007008607,0.00008865051,0.000032878954,0.00003694805,0.0023329817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.00026554023,0.000013517473,0.000054420223,0.00007943418,0.000027053531],"domain_scores_gemma":[0.999416,0.00035100197,0.000069567686,0.000049828093,0.00007395307,0.000039608694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075953733,0.00032022773,0.0003299721,0.00034243835,0.00029605784,0.00064927945,0.0008749811,0.0003867089,0.00074408494],"category_scores_gemma":[0.0016636986,0.00025233417,0.00022482587,0.00051961956,0.0008177874,0.0016462541,0.00089700473,0.0003603677,0.00015536115],"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.00019392383,0.00008280753,0.0009619303,0.00034586882,0.000063573374,0.00025359265,0.00022713997,0.72532916,0.04510947,0.15141223,0.0017807843,0.074239515],"study_design_scores_gemma":[0.000008498302,0.0001202849,0.00016947418,0.000010043324,0.000010792695,0.00010278854,0.000041026047,0.9846259,0.0025382426,0.011349526,0.0010143796,0.00000891477],"about_ca_topic_score_codex":0.00042451153,"about_ca_topic_score_gemma":0.00039296973,"teacher_disagreement_score":0.0008749811,"about_ca_system_score_codex":0.00041437635,"about_ca_system_score_gemma":0.00028265588,"threshold_uncertainty_score":0.004016876},"labels":[],"label_agreement":null},{"id":"W2978132160","doi":"10.1007/s11276-019-02155-8","title":"A Nash–Stackelberg equilibrium model for internet and network service providers in the demand market—a scenario-based approach","year":2019,"lang":"en","type":"article","venue":"Wireless Networks","topic":"ICT Impact and Policies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Service provider; Stackelberg competition; The Internet; Computer science; Nash equilibrium; Competition (biology); Profit (economics); Quality (philosophy); Service quality; Microeconomics; Service (business); Business; Marketing; Economics","score_opus":0.010654050827897624,"score_gpt":0.208698189506601,"score_spread":0.19804413867870335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978132160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09725857,0.0011293708,0.80658877,0.005981643,0.00021985466,0.00037631983,0.0012838203,0.00030339826,0.086858235],"genre_scores_gemma":[0.9332359,0.00088081736,0.030849228,0.00032052898,0.00014152231,0.000321518,0.0003348118,0.00007364459,0.03384199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988998,0.0005862307,0.000028157743,0.00016398357,0.00012126564,0.0002005692],"domain_scores_gemma":[0.99869186,0.0007610398,0.00013809849,0.000038057107,0.00020625832,0.00016480518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018904975,0.0014986364,0.001973796,0.0012748216,0.0011997557,0.003612867,0.0037929653,0.005071602,0.012777135],"category_scores_gemma":[0.0036333029,0.0013331395,0.0014604166,0.0017238468,0.0019943414,0.005194888,0.0021117397,0.0022735558,0.0011074487],"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.00007182011,0.00007446796,0.0002460863,0.000056400535,0.00004701273,0.00024152895,0.00008713471,0.74133307,0.0005274607,0.2532263,0.0021311014,0.001957554],"study_design_scores_gemma":[0.000029197163,0.000022371985,0.00007940193,0.000007468527,0.0000125375955,0.000028927958,0.000054215565,0.9592786,0.000045430017,0.039633393,0.00079059077,0.000017964294],"about_ca_topic_score_codex":0.017508803,"about_ca_topic_score_gemma":0.010736166,"teacher_disagreement_score":0.017508803,"about_ca_system_score_codex":0.0037974976,"about_ca_system_score_gemma":0.0027225062,"threshold_uncertainty_score":0.042743742},"labels":[],"label_agreement":null},{"id":"W2998424563","doi":"10.1007/s11276-019-02215-z","title":"Distributed self-optimizing interference management in ultra-dense networks with non-orthogonal multiple access","year":2020,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Interference (communication); Distributed computing; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.014200254023692904,"score_gpt":0.22402227035668604,"score_spread":0.20982201633299313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998424563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10699637,0.00046424018,0.8889826,0.00014416706,0.00006935746,0.0000304139,0.000020038982,0.00017394479,0.0031189113],"genre_scores_gemma":[0.97197795,0.00009984153,0.026726766,0.000047695798,0.000047399604,0.000023290253,0.000014378586,0.00001799141,0.0010447075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954504,0.00013091104,0.000018600364,0.000075212236,0.00013576642,0.000094535055],"domain_scores_gemma":[0.99889416,0.00056437805,0.00015326287,0.00009604693,0.0002244348,0.000067741224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081377244,0.0003784403,0.0006076785,0.00032664248,0.00044303894,0.0007026547,0.00090414775,0.00034095504,0.000572324],"category_scores_gemma":[0.0016098492,0.000272943,0.00020738777,0.0004504068,0.0005888237,0.00082447624,0.0010224188,0.00044182574,0.00010556256],"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.0002720508,0.00018005825,0.0011823062,0.000063587104,0.00008934807,0.00012971474,0.00015305616,0.8951978,0.016274411,0.015206732,0.0011542949,0.07009655],"study_design_scores_gemma":[0.0000058915844,0.00003220998,0.00011150847,0.0000011682866,0.0000057897546,0.000015676946,0.00001324593,0.9968131,0.00074638013,0.0021458603,0.00010645531,0.000002769532],"about_ca_topic_score_codex":0.0010175209,"about_ca_topic_score_gemma":0.0021877121,"teacher_disagreement_score":0.0010175209,"about_ca_system_score_codex":0.0005852113,"about_ca_system_score_gemma":0.00049804593,"threshold_uncertainty_score":0.004303694},"labels":[],"label_agreement":null},{"id":"W3035632193","doi":"10.1007/s11276-020-02385-1","title":"End-edge-cloud collaborative computation offloading for multiple mobile users in heterogeneous edge-server environment","year":2020,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Computation offloading; Server; Enhanced Data Rates for GSM Evolution; Mobile edge computing; Distributed computing; Benchmark (surveying); Edge computing; Quality of service; Mobile device; Computer network; Operating system; Artificial intelligence","score_opus":0.017194801692514503,"score_gpt":0.22881667062881356,"score_spread":0.21162186893629906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035632193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5335325,0.00065872056,0.45035407,0.0005114789,0.00040595006,0.00012232015,0.00018561818,0.0009461657,0.0132832],"genre_scores_gemma":[0.9816143,0.000059226884,0.01615888,0.00004838717,0.00003420181,0.000013282067,0.000059394988,0.00002542705,0.0019870107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995956,0.00004038395,0.000014975217,0.00009007197,0.00008284882,0.00017615601],"domain_scores_gemma":[0.9996076,0.00008129309,0.000021324966,0.0000853128,0.00011875795,0.00008567023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028875563,0.0006399796,0.00082783104,0.00026131386,0.0016703926,0.0011269307,0.001043725,0.00050895684,0.00196497],"category_scores_gemma":[0.0005867318,0.00023003753,0.0003820032,0.0005947971,0.00030646476,0.0010096615,0.0012848955,0.0003895708,0.00036341645],"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.0037901883,0.001373936,0.012962057,0.0002992337,0.0002846868,0.0036824862,0.0008414998,0.5132715,0.12698153,0.022044715,0.023255797,0.2912124],"study_design_scores_gemma":[0.000016502943,0.000056009416,0.0009885307,0.0000039393135,0.000023488408,0.0001404923,0.00013126142,0.98964816,0.005760286,0.0025190527,0.0006991609,0.000013210982],"about_ca_topic_score_codex":0.0063377987,"about_ca_topic_score_gemma":0.017663838,"teacher_disagreement_score":0.0063377987,"about_ca_system_score_codex":0.00043873198,"about_ca_system_score_gemma":0.000983114,"threshold_uncertainty_score":0.012601793},"labels":[],"label_agreement":null},{"id":"W3039984639","doi":"10.1007/s11276-020-02412-1","title":"Model-aided distributed shallow learning for OFDM receiver in IEEE 802.11 channel model","year":2020,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transfer of learning; Data transmission; Orthogonal frequency-division multiplexing; Limiting; Machine learning; Artificial intelligence; Channel (broadcasting); Transmission (telecommunications); Scope (computer science); Distributed computing; Computer network; Telecommunications","score_opus":0.061235850897584335,"score_gpt":0.25459312811298834,"score_spread":0.19335727721540402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039984639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04315041,0.00037829133,0.95327777,0.00049966184,0.000040973224,0.000019964182,0.0001391688,0.00054221,0.0019514597],"genre_scores_gemma":[0.8820547,0.0003273282,0.10916454,0.00028696438,0.00007643285,0.00009390478,0.00042193665,0.00014256554,0.0074315835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971193,0.00009827786,0.000014277573,0.000057102614,0.00005261633,0.000065695254],"domain_scores_gemma":[0.99879897,0.00087176036,0.000049645125,0.00006721759,0.00017720813,0.000035239842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089005544,0.0005308102,0.00087347924,0.00024118634,0.00036621094,0.0007461971,0.0011240729,0.0008845891,0.002944467],"category_scores_gemma":[0.0030333095,0.0004263452,0.00045004976,0.00036389055,0.00051068293,0.0011735908,0.0009142586,0.0015870497,0.00057114393],"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.00013488131,0.00004072758,0.00083238,0.0000654828,0.000041165986,0.00005825017,0.000074819945,0.9136046,0.0019185956,0.013155841,0.0017210976,0.068352185],"study_design_scores_gemma":[0.0000024938931,0.000005323655,0.00003754133,0.000001597785,0.0000026701273,0.0000036924582,0.000002555224,0.99755126,0.00014213394,0.0022029518,0.0000459485,0.0000018148424],"about_ca_topic_score_codex":0.010266562,"about_ca_topic_score_gemma":0.0138297975,"teacher_disagreement_score":0.010266562,"about_ca_system_score_codex":0.0007593225,"about_ca_system_score_gemma":0.0014326314,"threshold_uncertainty_score":0.020413637},"labels":[],"label_agreement":null},{"id":"W3088296267","doi":"10.1007/s11276-020-02459-0","title":"TCP CERL+: revisiting TCP congestion control in wireless networks with random loss","year":2020,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"TCP global synchronization; TCP Friendly Rate Control; Computer science; TCP Westwood plus; TCP acceleration; CUBIC TCP; H-TCP; Zeta-TCP; TCP tuning; Computer network; Compound TCP; TCP Westwood; HSTCP; Network congestion; Network packet","score_opus":0.00746378198499164,"score_gpt":0.19449204345410662,"score_spread":0.18702826146911497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088296267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010770094,0.008206285,0.95756596,0.0039710463,0.003945633,0.00016955906,0.00013992352,0.004286481,0.0109450575],"genre_scores_gemma":[0.57193,0.009658683,0.39303157,0.0033468595,0.008179874,0.00029526424,0.00024866543,0.0027729403,0.010536103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648917,0.0009644979,0.0001567464,0.0005485035,0.0015943823,0.00024670042],"domain_scores_gemma":[0.9930282,0.003549079,0.00025697687,0.0011536924,0.0017966835,0.0002153397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060570943,0.0017566093,0.0014971694,0.0013282918,0.00092485914,0.0035769478,0.0041927546,0.0016028779,0.0022742092],"category_scores_gemma":[0.021507775,0.0007620887,0.0006510408,0.0011685721,0.0023514347,0.0056344527,0.002194215,0.005009331,0.00090986706],"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.00041808077,0.0002744347,0.0015920565,0.0008512031,0.000147899,0.00025585407,0.0002832669,0.25966167,0.007277096,0.21466738,0.03586756,0.47870347],"study_design_scores_gemma":[0.000072266936,0.00012785169,0.00016237515,0.00010851521,0.00009255704,0.00009857195,0.00002334758,0.92465043,0.0040730094,0.042654708,0.027890444,0.000045880406],"about_ca_topic_score_codex":0.0057464447,"about_ca_topic_score_gemma":0.004405529,"teacher_disagreement_score":0.0060570943,"about_ca_system_score_codex":0.0016807978,"about_ca_system_score_gemma":0.0020555535,"threshold_uncertainty_score":0.032033384},"labels":[],"label_agreement":null},{"id":"W3160409256","doi":"10.1007/s11276-021-02627-w","title":"Second order Kalman filtering channel estimation and machine learning methods for spectrum sensing in cognitive radio networks","year":2021,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"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":"Institute of Population and Public Health; Engineering and Physical Sciences Research Council; King Saud University","keywords":"Computer science; Cognitive radio; Kalman filter; Transmitter; Cluster analysis; Centroid; Channel (broadcasting); Interference (communication); Algorithm; Extended Kalman filter; Artificial intelligence; Telecommunications; Wireless","score_opus":0.020998850139023577,"score_gpt":0.2832698251968621,"score_spread":0.26227097505783853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160409256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004479574,0.00026194815,0.99457705,0.00007912567,0.00003252878,0.0000075549165,0.0000075797275,0.00008893395,0.00046568646],"genre_scores_gemma":[0.77067614,0.0009942485,0.22396581,0.00012241292,0.0002312576,0.0001458728,0.00007608493,0.000054919645,0.003733341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941885,0.00022702961,0.000026710333,0.00011343553,0.00016094527,0.000053051397],"domain_scores_gemma":[0.9983967,0.0010681011,0.00014955609,0.00010677289,0.00025454423,0.00002429229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013762462,0.0005268041,0.0007433677,0.0005649342,0.00034662467,0.0007283225,0.00068431185,0.0007364938,0.0008692515],"category_scores_gemma":[0.004249255,0.00029643494,0.0005043992,0.0006004514,0.000658181,0.00090073457,0.0004937975,0.0008657253,0.00023007658],"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.00003790606,0.000034424615,0.0005817836,0.000058863723,0.000037846927,0.000027347454,0.000057182977,0.91760296,0.0017244675,0.017454183,0.00048245673,0.061900593],"study_design_scores_gemma":[0.0000016766239,0.000006396942,0.00008095564,0.0000020716618,0.0000018189013,0.0000041458234,0.0000021018227,0.9977221,0.00020996771,0.0018409117,0.0001248502,0.0000028827915],"about_ca_topic_score_codex":0.006105809,"about_ca_topic_score_gemma":0.003920508,"teacher_disagreement_score":0.006105809,"about_ca_system_score_codex":0.0007440332,"about_ca_system_score_gemma":0.0007879347,"threshold_uncertainty_score":0.0121405125},"labels":[],"label_agreement":null},{"id":"W3198512847","doi":"10.1007/s11276-021-02772-2","title":"A novel multi-band and multi-generation (2G, 3G,4G, and 5G) 9-elements MIMO antenna system for 5G smartphone applications","year":2021,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"UMTS frequency bands; Computer science; MIMO; GSM; Antenna (radio); Omnidirectional antenna; Electronic engineering; Antenna efficiency; Antenna array; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.023493982379412033,"score_gpt":0.2291932445095786,"score_spread":0.20569926213016657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198512847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14873138,0.0015114103,0.81124884,0.0012596059,0.00074275513,0.000096149364,0.00040278258,0.0024258492,0.03358122],"genre_scores_gemma":[0.8398048,0.0006349927,0.1413967,0.00079207204,0.0002448143,0.000080179205,0.0002691168,0.000062142135,0.01671523],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995704,0.00013585937,0.000018756633,0.00008077516,0.00012680706,0.000067471374],"domain_scores_gemma":[0.99970347,0.000044773882,0.000043775715,0.000050887567,0.00012423475,0.000032872405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021182961,0.00068329234,0.0005563582,0.00027118332,0.00033646327,0.0007912706,0.0006958655,0.00083567336,0.0043090233],"category_scores_gemma":[0.00022749408,0.0002640472,0.0005842786,0.0004278588,0.00022548922,0.0004915316,0.0004765443,0.0005118216,0.003147165],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009886748,0.00018353223,0.0048503694,0.00038806043,0.0003943587,0.0015651473,0.00031229624,0.043486506,0.723456,0.022280298,0.01721749,0.18487722],"study_design_scores_gemma":[0.0001265878,0.0022414557,0.005823419,0.00010335628,0.00039058644,0.0056993226,0.00023437043,0.6792994,0.23439711,0.0041512856,0.06733328,0.00019983546],"about_ca_topic_score_codex":0.0006370619,"about_ca_topic_score_gemma":0.0014582971,"teacher_disagreement_score":0.0043090233,"about_ca_system_score_codex":0.00047113083,"about_ca_system_score_gemma":0.00027261217,"threshold_uncertainty_score":0.014415145},"labels":[],"label_agreement":null},{"id":"W3199080036","doi":"10.1007/s11276-021-02786-w","title":"Energy and spectrum efficiency in predictive-cooperative cognitive radio networks","year":2021,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cognitive radio; Computer science; Constraint (computer-aided design); Scheme (mathematics); Efficient energy use; Energy (signal processing); Spectral efficiency; Duration (music); Exploit; Spectrum (functional analysis); Mathematical optimization; Computer network; Telecommunications; Wireless; Mathematics; Physics; Statistics; Electrical engineering","score_opus":0.007025000690807356,"score_gpt":0.20967490758751225,"score_spread":0.2026499068967049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199080036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26655614,0.0033602156,0.70650077,0.0019713903,0.00017416308,0.000067036504,0.00016706379,0.00019544647,0.021007705],"genre_scores_gemma":[0.991844,0.00032934576,0.0054477067,0.000079675156,0.000047777816,0.000025747197,0.000021050295,0.000020760892,0.002183954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868387,0.00049108855,0.000049322298,0.0001798258,0.00037136007,0.00022463805],"domain_scores_gemma":[0.988197,0.010322409,0.0004256138,0.0003120445,0.0006264243,0.00011636955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029806658,0.00081123144,0.0010686885,0.0008305558,0.00058693934,0.002064796,0.002154365,0.0013687836,0.0025016884],"category_scores_gemma":[0.0141208805,0.0007155508,0.00031355425,0.0013621807,0.0021952677,0.002625817,0.0015862823,0.0008193678,0.00023805571],"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.00019871302,0.00009550899,0.00075125723,0.00006496634,0.000034205546,0.00010243513,0.00010371696,0.92589587,0.0013648323,0.057374224,0.0005761993,0.013438161],"study_design_scores_gemma":[0.000010784355,0.000026269277,0.00023826437,0.000007518813,0.000011237572,0.00003860741,0.0000316095,0.9648859,0.00043817467,0.0341717,0.00013197596,0.000007894383],"about_ca_topic_score_codex":0.0025262283,"about_ca_topic_score_gemma":0.0025482338,"teacher_disagreement_score":0.0029806658,"about_ca_system_score_codex":0.001771033,"about_ca_system_score_gemma":0.0009905999,"threshold_uncertainty_score":0.015763462},"labels":[],"label_agreement":null},{"id":"W3204996375","doi":"10.1007/s11276-021-02783-z","title":"Optimization control method for industrial Internet of Things based on biological adaptive coevolutionary","year":2021,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Artificial Immune Systems Applications","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Service (business); Service provider; Pareto principle; Sequence (biology); Mathematical optimization; Operations research","score_opus":0.03180657996693247,"score_gpt":0.24820163333939335,"score_spread":0.21639505337246087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204996375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0155953085,0.00030920305,0.97753966,0.00015995261,0.00009146041,0.000040401337,0.000012216476,0.000081637154,0.0061701196],"genre_scores_gemma":[0.86535317,0.00038334238,0.12598728,0.00015472923,0.00007187737,0.00024570638,0.00005185025,0.00006647533,0.0076855705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978083,0.00006160157,0.000010179523,0.000055359917,0.00006557947,0.000026523756],"domain_scores_gemma":[0.9997948,0.00008909139,0.000023117418,0.000009810951,0.00007264607,0.000010519783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089674,0.0005874996,0.00077120506,0.00047284452,0.0005272804,0.0006985802,0.0009583827,0.00074805645,0.0018398103],"category_scores_gemma":[0.00080861006,0.0003171164,0.0006708666,0.00038601045,0.0005045853,0.00047607004,0.00068359,0.00056815095,0.00015031264],"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.000031061492,0.000031210377,0.0002752191,0.000059699436,0.000053063966,0.000048419446,0.000047982016,0.96392906,0.002227169,0.0095118275,0.0006820303,0.023103222],"study_design_scores_gemma":[0.0000031771722,0.000009301653,0.00004038994,0.0000015756187,0.0000045319234,0.000004687842,0.0000031154764,0.9991099,0.000096570504,0.00058357837,0.00014122327,0.0000018896915],"about_ca_topic_score_codex":0.0066930004,"about_ca_topic_score_gemma":0.0044857454,"teacher_disagreement_score":0.0066930004,"about_ca_system_score_codex":0.0005680304,"about_ca_system_score_gemma":0.0006924133,"threshold_uncertainty_score":0.013308108},"labels":[],"label_agreement":null},{"id":"W4213423008","doi":"10.1007/s11276-021-02884-9","title":"New probabilistic SINR analysis for capacity and reception-quality studies of DTV transmitter identification systems","year":2022,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Telecommunications and Broadcasting Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Transmitter; Autocorrelation; Interference (communication); Probabilistic logic; Noise (video); Telecommunications; Digital television; Identification (biology); Algorithm; Statistics; Mathematics; Artificial intelligence","score_opus":0.06638049299408319,"score_gpt":0.2858838134442461,"score_spread":0.21950332045016294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213423008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005838858,0.00066290284,0.9860101,0.00019317897,0.000055296954,0.000038144983,0.000104476545,0.000120304074,0.0069767376],"genre_scores_gemma":[0.8487305,0.004418627,0.12063152,0.00062392757,0.00065895985,0.00029891508,0.00062188343,0.00055124436,0.02346434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.001035651,0.00012391142,0.00035229666,0.0014056149,0.0004114678],"domain_scores_gemma":[0.9916073,0.0055231582,0.0006894614,0.0004545122,0.0015864049,0.00013915761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043332484,0.0024146757,0.0013765043,0.0026085267,0.00095048366,0.0026225145,0.001895929,0.0013861266,0.0048475116],"category_scores_gemma":[0.014808673,0.0012162774,0.0016528292,0.0024259894,0.0018776316,0.004015008,0.0026255234,0.002107937,0.0010432797],"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.000042694806,0.000031563966,0.0008230522,0.0001472053,0.00006276538,0.00014959819,0.00010777753,0.87743366,0.004179947,0.1029629,0.0012235066,0.012835473],"study_design_scores_gemma":[0.0000020390912,0.000017602904,0.00024273191,0.000019276213,0.000021009693,0.00007294837,0.000019183746,0.98636496,0.00072089187,0.011909899,0.0005930161,0.000016318916],"about_ca_topic_score_codex":0.0048861494,"about_ca_topic_score_gemma":0.0050591966,"teacher_disagreement_score":0.0048861494,"about_ca_system_score_codex":0.0027758465,"about_ca_system_score_gemma":0.0015564597,"threshold_uncertainty_score":0.022916675},"labels":[],"label_agreement":null},{"id":"W4224267955","doi":"10.1007/s11276-022-02962-6","title":"Negative input impedance of a dipole antenna printed on a grounded tellegen metamaterial substrate","year":2022,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Metamaterials and Metasurfaces Applications","field":"Materials 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Metamaterial; Antenna (radio); Dipole; Electrical impedance; Computer science; Electromagnetic field; Substrate (aquarium); Dipole antenna; Field (mathematics); Microwave; Input impedance; Acoustics; Physics; Materials science; Optoelectronics; Optics; Telecommunications; Mathematics; Geology; Quantum mechanics","score_opus":0.018797008622940682,"score_gpt":0.2458704239771952,"score_spread":0.22707341535425452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224267955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94731414,0.0001280925,0.029344684,0.00066961185,0.0001151687,0.00000964189,0.00014300672,0.0004984206,0.021777192],"genre_scores_gemma":[0.99521387,0.000037973354,0.0023085983,0.000047557955,0.000011718963,0.0000035178991,0.000039593662,0.000027674538,0.002309404],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998392,0.00004319407,0.000005012299,0.000035258818,0.00004956709,0.000027746235],"domain_scores_gemma":[0.99971527,0.00014886125,0.00004606579,0.000036120782,0.000033961212,0.000019629502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011517057,0.00032920792,0.0003383955,0.00017979162,0.00016271406,0.0006231335,0.0004584298,0.00080444646,0.0022976825],"category_scores_gemma":[0.0006427952,0.00013542468,0.00026741778,0.0002112596,0.00046345053,0.0004132856,0.00034832006,0.00026745145,0.00045390814],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011390123,0.000056591984,0.002076773,0.00016280013,0.00004344217,0.0019866878,0.00036166352,0.013749755,0.95159394,0.01431623,0.0010319237,0.013481201],"study_design_scores_gemma":[0.00025216953,0.0008797872,0.013281338,0.00007296207,0.00016560344,0.004419452,0.0006125053,0.28919503,0.67544377,0.006535112,0.009039052,0.00010310676],"about_ca_topic_score_codex":0.00023413067,"about_ca_topic_score_gemma":0.00009524629,"teacher_disagreement_score":0.0022976825,"about_ca_system_score_codex":0.00037043093,"about_ca_system_score_gemma":0.00011640538,"threshold_uncertainty_score":0.007686496},"labels":[],"label_agreement":null},{"id":"W4283794105","doi":"10.1007/s11276-022-03027-4","title":"Adaptable design for long range underwater communications","year":2022,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Underwater; Underwater acoustic communication; Computer science; Communications system; Keying; Telecommunications; Sea trial; Robustness (evolution); Range (aeronautics); Real-time computing; Marine engineering; Geology; Oceanography; Engineering","score_opus":0.04827426597089647,"score_gpt":0.23594736931982063,"score_spread":0.18767310334892418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283794105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006784499,0.00032132,0.9871832,0.000105924424,0.00007550697,0.000024059984,0.000021531225,0.00017423477,0.005309707],"genre_scores_gemma":[0.8913546,0.0007820223,0.086883016,0.00023370473,0.00013222918,0.00022781338,0.00007371836,0.00013443003,0.020178404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996625,0.00007891526,0.000013700592,0.000069745096,0.0001278707,0.000047205303],"domain_scores_gemma":[0.99961215,0.00014341794,0.00004769853,0.000049238886,0.0001321625,0.000015403757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004078831,0.0006779843,0.00040660528,0.00026946244,0.00029806586,0.0006912325,0.0009142647,0.0007525818,0.003768984],"category_scores_gemma":[0.0012809492,0.0002544893,0.00027563918,0.0002354279,0.00043602503,0.0007021149,0.0007692578,0.00088666874,0.0006832347],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086038395,0.00006705637,0.00033946545,0.000167219,0.000043335,0.00013520205,0.00013053244,0.8085521,0.034313116,0.04236714,0.0024198068,0.11137905],"study_design_scores_gemma":[0.000007810313,0.000085064305,0.00013157738,0.0000133643125,0.000012212359,0.000041668216,0.000017471273,0.9833814,0.0024411888,0.0106751025,0.003184184,0.000008941052],"about_ca_topic_score_codex":0.0013627685,"about_ca_topic_score_gemma":0.0016497084,"teacher_disagreement_score":0.003768984,"about_ca_system_score_codex":0.0005480946,"about_ca_system_score_gemma":0.00038846568,"threshold_uncertainty_score":0.0126084685},"labels":[],"label_agreement":null},{"id":"W4286750215","doi":"10.1007/s11276-022-03053-2","title":"Machine learning-based approaches for user association and access point selection in heterogeneous fixed wireless networks","year":2022,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Wireless network; Wireless; The Internet; Selection (genetic algorithm); Data mining; k-nearest neighbors algorithm; Deep learning; Telecommunications","score_opus":0.02436894488645723,"score_gpt":0.24739829127339724,"score_spread":0.22302934638694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286750215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015438073,0.0004066582,0.98310465,0.00018192966,0.000042892818,0.000029970586,0.000031093525,0.0001447013,0.00061999034],"genre_scores_gemma":[0.81339645,0.00061031256,0.18092194,0.00018203312,0.00032131508,0.00013568134,0.00016692067,0.000074063755,0.00419119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782455,0.0009055818,0.00013221004,0.0003431119,0.00052894006,0.0002656813],"domain_scores_gemma":[0.99227685,0.0061446857,0.00035441754,0.00031571137,0.00075181684,0.0001565307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003966292,0.00079508795,0.0019281171,0.0016389686,0.0009146721,0.0015117222,0.0030650906,0.0016001125,0.0014752826],"category_scores_gemma":[0.010724973,0.0006598155,0.0008689021,0.0021704733,0.0011411563,0.0022018934,0.0014488423,0.0016213454,0.0003963316],"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.00008589418,0.00009254856,0.0012515737,0.000038154296,0.00006809865,0.00006293269,0.000057146473,0.92574,0.0006438336,0.007941956,0.0005764702,0.06344138],"study_design_scores_gemma":[0.0000014327981,0.000004791057,0.000053453834,0.0000010861074,0.0000030113772,0.000004723197,0.0000035371436,0.99785256,0.00006709942,0.0019642583,0.00004240488,0.0000016884612],"about_ca_topic_score_codex":0.007936635,"about_ca_topic_score_gemma":0.0073200823,"teacher_disagreement_score":0.007936635,"about_ca_system_score_codex":0.0014536392,"about_ca_system_score_gemma":0.001140753,"threshold_uncertainty_score":0.020976007},"labels":[],"label_agreement":null},{"id":"W4289518813","doi":"10.1007/s11276-022-03076-9","title":"Multi-aspect detection and classification with multi-feed dynamic frame skipping in vehicle of internet things","year":2022,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Neural Network Applications","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":"Brandon University","funders":"Høgskulen på Vestlandet","keywords":"Computer science; Frame (networking); Dependability; Real-time computing; Variety (cybernetics); Frame rate; Object (grammar); The Internet; Artificial intelligence; Simulation; Telecommunications; World Wide Web","score_opus":0.014914005538164132,"score_gpt":0.24472764074958112,"score_spread":0.22981363521141698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289518813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29145226,0.00056088576,0.70282483,0.00022314773,0.0001858123,0.00009038452,0.00023389695,0.0017475648,0.0026811853],"genre_scores_gemma":[0.8656581,0.00018309348,0.13095944,0.000090328926,0.00004649526,0.000048127666,0.00042600906,0.000054231656,0.0025341804],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974483,0.000031248102,0.000012998224,0.000068348,0.00007828996,0.00006432371],"domain_scores_gemma":[0.99976474,0.000056262772,0.000024996376,0.000029557043,0.00010573031,0.000018697263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053705956,0.00050557463,0.0005760122,0.0015832252,0.00032423149,0.0004423064,0.0006828611,0.0006137866,0.0007392295],"category_scores_gemma":[0.0006764695,0.00024525487,0.0005966173,0.0008925424,0.00019806293,0.0005750766,0.00049150793,0.0004456341,0.0003506396],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004644115,0.0003212905,0.010465776,0.00009543707,0.00015744234,0.00036599426,0.00011986985,0.1074739,0.05291056,0.0023019668,0.0035906131,0.8217327],"study_design_scores_gemma":[0.0000038030307,0.000053225216,0.0026908224,0.0000055847645,0.000015833786,0.000069229885,0.000025864825,0.9876386,0.008082438,0.00063173147,0.000773549,0.000009405412],"about_ca_topic_score_codex":0.006563133,"about_ca_topic_score_gemma":0.0083273435,"teacher_disagreement_score":0.006563133,"about_ca_system_score_codex":0.0003855805,"about_ca_system_score_gemma":0.00038252556,"threshold_uncertainty_score":0.013049841},"labels":[],"label_agreement":null},{"id":"W4292416280","doi":"10.1007/s11276-022-03093-8","title":"A wide axial-ratio beamwidth circularly-polarized oval patch antenna with sunlight-shaped slots for gnss and wimax applications","year":2022,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Antenna Design and Analysis","field":"Engineering","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":"Concordia University","funders":"","keywords":"Beamwidth; GNSS applications; Computer science; WiMAX; Antenna (radio); Sunlight; Optics; Patch antenna; Physics; Telecommunications; Global Positioning System; Wireless","score_opus":0.007315468559528059,"score_gpt":0.1915837022772999,"score_spread":0.18426823371777185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292416280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55114204,0.000456379,0.43164518,0.00031996207,0.00029370977,0.000025106065,0.00012014809,0.0013957433,0.014601792],"genre_scores_gemma":[0.9520636,0.00018169453,0.042140245,0.00010966285,0.000049264534,0.000012665,0.00010469872,0.000030808093,0.005307399],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999905,0.000016683889,0.000004443451,0.000025852594,0.000024396366,0.000023656099],"domain_scores_gemma":[0.99990034,0.0000085977035,0.00002007185,0.00002056664,0.000031252785,0.000019198797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053531137,0.00033836227,0.00022653565,0.0001746284,0.00008985345,0.00029903816,0.0003604321,0.00039088176,0.0008597038],"category_scores_gemma":[0.00009105238,0.000111296664,0.00027777976,0.00020577459,0.000115512405,0.00018662447,0.00021898307,0.00015010497,0.00060099043],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045068807,0.00006131564,0.004624187,0.00009035027,0.00005557079,0.0006683498,0.000080469166,0.006554781,0.84568405,0.003088839,0.0030578354,0.13558349],"study_design_scores_gemma":[0.000080454236,0.0016584118,0.018021269,0.000027480888,0.00015678737,0.0040901797,0.00024764804,0.1586711,0.7747429,0.0012946423,0.04090612,0.00010293807],"about_ca_topic_score_codex":0.00024325676,"about_ca_topic_score_gemma":0.00032066737,"teacher_disagreement_score":0.0008597038,"about_ca_system_score_codex":0.00012963392,"about_ca_system_score_gemma":0.000085179665,"threshold_uncertainty_score":0.0028759837},"labels":[],"label_agreement":null},{"id":"W4321437760","doi":"10.1007/s11276-023-03244-5","title":"A multi-frequency communication routing protocol for mobile devices in the Internet of things","year":2023,"lang":"en","type":"article","venue":"Wireless Networks","topic":"AI and Multimedia in Education","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer network; Computer science; Wireless Routing Protocol; Zone Routing Protocol; Dynamic Source Routing; Routing protocol; Hazy Sighted Link State Routing Protocol; Distributed computing; Link-state routing protocol; Static routing; Routing (electronic design automation)","score_opus":0.039302263870257474,"score_gpt":0.3385138064517002,"score_spread":0.2992115425814427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321437760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022923443,0.0029500788,0.94838923,0.0017512685,0.0023597255,0.0006664461,0.00024734368,0.0034002902,0.017312057],"genre_scores_gemma":[0.45221004,0.0033724173,0.5120927,0.0016104154,0.0008416238,0.0008560216,0.0010671197,0.0004300894,0.027519468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916506,0.00024486767,0.00009273173,0.00008222841,0.00032817264,0.000086951295],"domain_scores_gemma":[0.9989643,0.00029376647,0.00008941037,0.00020975793,0.00037694795,0.00006587259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011918525,0.0005024634,0.00066452805,0.000824587,0.0013296056,0.0013129839,0.0011261652,0.0009512777,0.002243345],"category_scores_gemma":[0.0020409818,0.00031067565,0.0006112596,0.0006396588,0.00040911286,0.0015583298,0.0014051548,0.0015178575,0.0007854971],"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.0006803675,0.00028685038,0.0012849283,0.00090609444,0.0003334117,0.0011109824,0.00053376483,0.044930886,0.10097062,0.14850579,0.055430107,0.64502615],"study_design_scores_gemma":[0.00030321674,0.0014644263,0.002102671,0.00027510864,0.0006731621,0.0030584657,0.00040275377,0.5745219,0.05847928,0.054468334,0.30385885,0.0003918612],"about_ca_topic_score_codex":0.0010432891,"about_ca_topic_score_gemma":0.003043607,"teacher_disagreement_score":0.002243345,"about_ca_system_score_codex":0.00042174433,"about_ca_system_score_gemma":0.000779111,"threshold_uncertainty_score":0.0075047016},"labels":[],"label_agreement":null},{"id":"W4379209771","doi":"10.1007/s11276-023-03385-7","title":"A hierarchical growth method for extracting 3D phenotypic trait of apple tree branch in edge computing","year":2023,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Segmentation; Tree (set theory); Orchard; Point cloud; Image segmentation; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Cloud computing; Mathematics; Biology","score_opus":0.021191459845863698,"score_gpt":0.2551891517410208,"score_spread":0.2339976918951571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379209771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022801679,0.00017450345,0.9723221,0.00007290138,0.000027761589,0.00006163796,0.00077658595,0.0028190853,0.00094369956],"genre_scores_gemma":[0.2105121,0.00035498932,0.78090703,0.000108833585,0.000054057185,0.0002569845,0.0034793385,0.00055173197,0.003774813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996841,0.000028793695,0.000016448137,0.00010352388,0.00012785567,0.000039336464],"domain_scores_gemma":[0.9996125,0.00013227211,0.000035971458,0.000047041165,0.00014492309,0.000027289387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622489,0.0007824189,0.0006004322,0.0020515304,0.00050491747,0.0005497073,0.0010625098,0.000567313,0.0017068393],"category_scores_gemma":[0.000751688,0.00041286717,0.0011401409,0.0019633726,0.00026086703,0.0005681417,0.00068121165,0.00070747413,0.0009773253],"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.0001837796,0.00019420605,0.012025879,0.00021401104,0.00015462635,0.00025274494,0.0003160258,0.097391516,0.0982523,0.0046557295,0.0086042015,0.777755],"study_design_scores_gemma":[0.000008852658,0.000027458344,0.0068864706,0.000010089864,0.000038954488,0.00009563488,0.000054118856,0.9788639,0.009086163,0.0018629289,0.0030366746,0.00002881861],"about_ca_topic_score_codex":0.018258965,"about_ca_topic_score_gemma":0.031704385,"teacher_disagreement_score":0.018258965,"about_ca_system_score_codex":0.00042871042,"about_ca_system_score_gemma":0.0009170163,"threshold_uncertainty_score":0.036305368},"labels":[],"label_agreement":null},{"id":"W4382240482","doi":"10.1007/s11276-023-03414-5","title":"NMal-Droid: network-based android malware detection system using transfer learning and CNN-BiGRU ensemble","year":2023,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Malware; Android (operating system); Convolutional neural network; Network packet; Artificial intelligence; Machine learning; Computer security; Operating system","score_opus":0.01165765042397046,"score_gpt":0.23439273919090542,"score_spread":0.22273508876693496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42916146,0.003901415,0.3742901,0.0008465354,0.001179836,0.0007796529,0.0049222885,0.16521485,0.019703824],"genre_scores_gemma":[0.8608821,0.0005727001,0.11221675,0.0006316272,0.00016388585,0.00030886577,0.0059813894,0.0007276501,0.018515067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974054,0.000020044637,0.0000103513285,0.00007788541,0.00010134165,0.000049825743],"domain_scores_gemma":[0.9998229,0.00003506021,0.000017174534,0.000033280274,0.00006834838,0.000023296765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029858947,0.0012761501,0.00074691104,0.0012403073,0.0003439706,0.00045479235,0.0010353955,0.0005262573,0.0036534844],"category_scores_gemma":[0.0006378131,0.00025648504,0.00036496582,0.00034959236,0.00016695228,0.0010573601,0.00092966564,0.0005912599,0.0015677328],"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.0014449705,0.00079494674,0.014613232,0.00038910177,0.00037127043,0.00073571445,0.0001254832,0.029183138,0.06255272,0.0014100561,0.059607394,0.82877207],"study_design_scores_gemma":[0.00009727438,0.0005398472,0.008120951,0.00002677565,0.00011770359,0.00053172477,0.000055742163,0.9033742,0.07686167,0.001060947,0.009138171,0.00007507869],"about_ca_topic_score_codex":0.005271788,"about_ca_topic_score_gemma":0.008585262,"teacher_disagreement_score":0.005271788,"about_ca_system_score_codex":0.000511742,"about_ca_system_score_gemma":0.00047188028,"threshold_uncertainty_score":0.012222171},"labels":[],"label_agreement":null},{"id":"W4385423553","doi":"10.1007/s11276-023-03456-9","title":"Adaptive computation offloading for latency-sensitive tasks in heterogeneous edge-cloud-enabled smart warehouses using Gau-Angle FIS and AGE-MOEA-II","year":2023,"lang":"en","type":"article","venue":"Wireless Networks","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; Quanzhou City Science and Technology Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Latency (audio); Service (business); Profit (economics); Computation; Distributed computing; Algorithm; Operating system","score_opus":0.03727653571500918,"score_gpt":0.26205903156612664,"score_spread":0.22478249585111745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385423553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28820172,0.0014664858,0.6934698,0.0003424166,0.00037868536,0.00013380217,0.0001323787,0.0013833753,0.014491441],"genre_scores_gemma":[0.96371233,0.00013069413,0.034439348,0.00006916736,0.000025936897,0.000029593844,0.00006978242,0.000055041106,0.0014680491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971765,0.000035776327,0.000008864657,0.000051204228,0.00006876123,0.0001177681],"domain_scores_gemma":[0.99980384,0.00006471657,0.0000151681415,0.000023873692,0.00006142735,0.000031104875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035200865,0.0006735907,0.00072287634,0.00044893142,0.00087740895,0.00088764,0.0007284106,0.0003265257,0.0011760185],"category_scores_gemma":[0.000631128,0.00018757748,0.00046071262,0.00058452925,0.0003403912,0.0005536059,0.0006163136,0.00037348625,0.00017580658],"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.0003820217,0.00023537055,0.0022958245,0.000078783196,0.000070076436,0.00018890493,0.00011731688,0.87354225,0.018325804,0.0047029667,0.0034359964,0.09662467],"study_design_scores_gemma":[0.000007452042,0.00003360175,0.00037471097,0.0000034469413,0.000009367506,0.00001708114,0.000032791457,0.99663603,0.0013771615,0.0010772303,0.00042670735,0.0000042914735],"about_ca_topic_score_codex":0.010660469,"about_ca_topic_score_gemma":0.016800314,"teacher_disagreement_score":0.010660469,"about_ca_system_score_codex":0.0005964638,"about_ca_system_score_gemma":0.0013046316,"threshold_uncertainty_score":0.021196842},"labels":[],"label_agreement":null},{"id":"W4388818535","doi":"10.1007/s11276-023-03566-4","title":"Classification of pathological ECG beats based on wireless body sensor networks and fractional Fourier transform and convolutional neural network","year":2023,"lang":"en","type":"article","venue":"Wireless Networks","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Pattern recognition (psychology); Deep learning; Frequency domain; Abnormality; SIGNAL (programming language); Speech recognition; Computer vision; Medicine","score_opus":0.022803209616955547,"score_gpt":0.2718654723974887,"score_spread":0.24906226278053317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388818535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55630165,0.002141731,0.43722442,0.000511422,0.00028338467,0.00010980486,0.0005320595,0.00050325214,0.0023923244],"genre_scores_gemma":[0.9614675,0.0009295734,0.035887297,0.00006723566,0.00011993004,0.000029483013,0.000374867,0.000017053388,0.001107087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998535,0.000025082081,0.000013500967,0.00003725377,0.000046324876,0.000024274572],"domain_scores_gemma":[0.99977976,0.00008292575,0.00004425854,0.000016995189,0.00005778367,0.000018351366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035118457,0.0004286428,0.00028803496,0.0010402094,0.00014472763,0.0004165374,0.00023403115,0.0005236429,0.00044325585],"category_scores_gemma":[0.00090505707,0.00008400116,0.00030967762,0.0005169343,0.0002234464,0.0004279791,0.00020618289,0.00030527558,0.00018473718],"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.0015300096,0.00037668576,0.092912465,0.00029732467,0.00017676743,0.0012792649,0.00017465554,0.0677369,0.11659752,0.0033006,0.0035089466,0.7121089],"study_design_scores_gemma":[0.000017366312,0.00019285324,0.05255153,0.000034917866,0.00008022761,0.00096452143,0.000093391594,0.92661124,0.016097847,0.0022570011,0.0010791121,0.000020008281],"about_ca_topic_score_codex":0.0011853052,"about_ca_topic_score_gemma":0.0015501914,"teacher_disagreement_score":0.0011853052,"about_ca_system_score_codex":0.00020971846,"about_ca_system_score_gemma":0.00019036449,"threshold_uncertainty_score":0.0023568273},"labels":[],"label_agreement":null},{"id":"W4391110571","doi":"10.1007/s11276-023-03627-8","title":"A novel multi agents-based clustering algorithm for VANETs in 5G networks","year":2024,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Cluster analysis; Vehicular ad hoc network; Base station; Intelligent transportation system; Wireless ad hoc network; Computer network; Wireless; Stability (learning theory); Distributed computing; Cluster (spacecraft); Algorithm; Artificial intelligence; Machine learning; Telecommunications","score_opus":0.017496444343985722,"score_gpt":0.24845963245359096,"score_spread":0.23096318810960523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391110571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010864718,0.00048844464,0.9847837,0.00022517661,0.0001974629,0.00012401775,0.00006875119,0.00055692904,0.0026907674],"genre_scores_gemma":[0.3141027,0.0006001779,0.6757066,0.00024181968,0.000114456525,0.0002882911,0.00041926472,0.00013202328,0.008394612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933124,0.00019332967,0.00003850296,0.00013995642,0.00021480369,0.00008221857],"domain_scores_gemma":[0.9995061,0.00012214395,0.000045735324,0.000057266992,0.00022209907,0.00004661256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072074635,0.00077807414,0.0012157573,0.00096672255,0.0012285162,0.0009737381,0.0023555032,0.0011817586,0.0018685511],"category_scores_gemma":[0.001405579,0.000413052,0.00066861283,0.0014744616,0.00041696263,0.00142955,0.0014742392,0.000907819,0.0006719826],"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.0002366452,0.00013932917,0.000930761,0.0001189342,0.00015049352,0.000100672805,0.00012240009,0.7013393,0.005794721,0.022384074,0.008269192,0.26041347],"study_design_scores_gemma":[0.00001534433,0.000039467282,0.000104545536,0.000005791942,0.000012186232,0.000036487312,0.000028031556,0.9940374,0.00086723716,0.0025119658,0.0023308783,0.000010720214],"about_ca_topic_score_codex":0.009408451,"about_ca_topic_score_gemma":0.0119474735,"teacher_disagreement_score":0.009408451,"about_ca_system_score_codex":0.0010235391,"about_ca_system_score_gemma":0.0014748415,"threshold_uncertainty_score":0.018707335},"labels":[],"label_agreement":null},{"id":"W4391646306","doi":"10.1007/s11276-023-03648-3","title":"Employing blockchain and IPFS in WSNs for malicious node detection and efficient data storage","year":2024,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"King Saud University","keywords":"Computer science; Byzantine fault tolerance; Computer network; Internet of Things; Wireless sensor network; Computer security; Distributed computing; Fault tolerance","score_opus":0.015644447761507738,"score_gpt":0.2535298180037272,"score_spread":0.23788537024221945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391646306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21620487,0.0009631876,0.77072954,0.0007088293,0.0002471111,0.00026014214,0.00024938243,0.0014645784,0.009172395],"genre_scores_gemma":[0.9692328,0.00024435128,0.027681569,0.000043008084,0.000026178504,0.00006965406,0.00006650539,0.00002016973,0.0026157065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939156,0.0001681715,0.000042606996,0.000103710765,0.00020181041,0.00009213518],"domain_scores_gemma":[0.9982425,0.0007003443,0.00015699808,0.00049569743,0.00031580147,0.00008868209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011192795,0.00027176517,0.00050521665,0.00046707998,0.00071490125,0.0009295222,0.0008648027,0.0006281165,0.0027231043],"category_scores_gemma":[0.0025830925,0.00018499418,0.00015957013,0.0007681568,0.0007184593,0.0018225627,0.001043304,0.000528691,0.00046246624],"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.0018124401,0.00048053495,0.0048767766,0.00067610136,0.00010748756,0.0008438128,0.00047687,0.3843972,0.16172338,0.114530206,0.0056443587,0.32443076],"study_design_scores_gemma":[0.000056611578,0.00034091953,0.00049093866,0.000035997342,0.000024172245,0.00022516715,0.000077535595,0.911798,0.04926779,0.031415176,0.006241064,0.000026623266],"about_ca_topic_score_codex":0.0013793868,"about_ca_topic_score_gemma":0.0022865434,"teacher_disagreement_score":0.0027231043,"about_ca_system_score_codex":0.0005518308,"about_ca_system_score_gemma":0.0011884493,"threshold_uncertainty_score":0.009109676},"labels":[],"label_agreement":null},{"id":"W4396847458","doi":"10.1007/s11276-024-03748-8","title":"Machine learning-inspired hybrid precoding with low-resolution phase shifters for intelligent reflecting surface (IRS) massive MIMO systems with limited RF chains","year":2024,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities","keywords":"Precoding; Computer science; MIMO; Phase (matter); Resolution (logic); Surface (topology); Electronic engineering; Telecommunications; Artificial intelligence; Physics; Channel (broadcasting); Mathematics","score_opus":0.020949505090272023,"score_gpt":0.26625911581598166,"score_spread":0.24530961072570964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396847458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023799757,0.00026861366,0.9723219,0.00013883837,0.00004878205,0.000014158015,0.00003050328,0.00024637338,0.0031310634],"genre_scores_gemma":[0.5615109,0.00040255228,0.43193027,0.00022571189,0.00008353252,0.00006753151,0.000110530236,0.00004527767,0.0056237043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998217,0.000050000108,0.000006681556,0.000030208888,0.00007169634,0.00001964862],"domain_scores_gemma":[0.9997508,0.000110568835,0.00003901129,0.00004042471,0.00004761996,0.00001160527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020360568,0.00037635793,0.0003641208,0.00015128308,0.00014842932,0.00038389277,0.00042862113,0.00043406742,0.0013175457],"category_scores_gemma":[0.00067026075,0.00018046111,0.00025590832,0.00036418624,0.00034510132,0.00062071066,0.00046474682,0.000550608,0.00044759523],"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.00031665384,0.00015379218,0.00071843836,0.00022251258,0.00012420872,0.00016706946,0.00015695883,0.44983882,0.21203126,0.058857102,0.0033725698,0.27404052],"study_design_scores_gemma":[0.000012223699,0.000084052124,0.00011223073,0.000007293036,0.000009013791,0.0000651589,0.0000084239855,0.9818541,0.0115929,0.0047288747,0.0015145284,0.000011217118],"about_ca_topic_score_codex":0.00037530443,"about_ca_topic_score_gemma":0.0011006708,"teacher_disagreement_score":0.0013175457,"about_ca_system_score_codex":0.00018823952,"about_ca_system_score_gemma":0.0002922311,"threshold_uncertainty_score":0.0044075847},"labels":[],"label_agreement":null},{"id":"W4416236471","doi":"10.1007/s11276-025-04043-w","title":"PAPR reduction scheme for OTFS signal in low-altitude ISAC network","year":2025,"lang":"en","type":"article","venue":"Wireless Networks","topic":"PAPR reduction in OFDM","field":"Engineering","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Reduction (mathematics); Scheme (mathematics); Frame (networking); Clipping (morphology); Flexibility (engineering); SIGNAL (programming language); Noise reduction","score_opus":0.005910313744065789,"score_gpt":0.228011061509346,"score_spread":0.22210074776528022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416236471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17495215,0.0009227704,0.80282295,0.00041384582,0.00017284259,0.00005713436,0.000119308526,0.00076866813,0.01977029],"genre_scores_gemma":[0.89769375,0.00046075095,0.093422495,0.00011209288,0.00011073391,0.00003145877,0.00010066816,0.000027664504,0.008040407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997577,0.000040971627,0.000008095012,0.000037491332,0.00010224348,0.000053447366],"domain_scores_gemma":[0.99977046,0.00005026446,0.00002326912,0.000049241422,0.000097094664,0.000009701529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021367149,0.00051767373,0.00030356034,0.00036957202,0.00058589526,0.00041692588,0.00044313504,0.00034590106,0.0020887512],"category_scores_gemma":[0.0004970467,0.00010041901,0.00023676232,0.00040226828,0.0003209047,0.00027944983,0.00028641193,0.00043516324,0.00038082077],"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.000668312,0.00015398023,0.0027451399,0.00025609744,0.00007510655,0.00070388435,0.00054262177,0.06739017,0.3193202,0.02523876,0.005327193,0.5775786],"study_design_scores_gemma":[0.000048377773,0.0007540361,0.004584948,0.00006710979,0.00012292269,0.001565394,0.00023098174,0.8199702,0.14915746,0.0071022245,0.016338153,0.000058330974],"about_ca_topic_score_codex":0.0021393988,"about_ca_topic_score_gemma":0.0036009895,"teacher_disagreement_score":0.0021393988,"about_ca_system_score_codex":0.00032191252,"about_ca_system_score_gemma":0.0004547364,"threshold_uncertainty_score":0.0069875717},"labels":[],"label_agreement":null},{"id":"W4417029541","doi":"10.1007/s11276-025-04061-8","title":"Rank optimization technique of physical layer secrecy capacity in MIMO wiretap channel","year":2025,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Horizon College and Seminary","funders":"","keywords":"MIMO; Physical layer; Covariance; Secure transmission; Covariance matrix; Artificial noise; Channel (broadcasting); Wireless; Optimization problem; Rank (graph theory)","score_opus":0.016402942911476447,"score_gpt":0.2386521781519885,"score_spread":0.22224923524051204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417029541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009340458,0.0005768833,0.9815528,0.0003907714,0.000070939015,0.000021757773,0.0001610381,0.00017184089,0.007713665],"genre_scores_gemma":[0.65607065,0.003392197,0.32031912,0.000336263,0.00039465723,0.0002059583,0.000592358,0.00030102208,0.018387793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992054,0.00031542132,0.000026326443,0.00009542724,0.00025526085,0.0001021985],"domain_scores_gemma":[0.9988673,0.00057714444,0.00008383931,0.00016210554,0.00026901622,0.000040730847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011525732,0.0010631356,0.0007642949,0.0005813196,0.00041094646,0.0011924731,0.00077106984,0.0006659622,0.004534095],"category_scores_gemma":[0.0032442883,0.00044919082,0.00053302204,0.001036771,0.0011325307,0.0019380519,0.0011254568,0.0014773266,0.00092914194],"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.00022680691,0.0000899056,0.0006412699,0.00037170178,0.00007908388,0.00025872956,0.00023107148,0.5895401,0.018773293,0.30521032,0.009976663,0.07460104],"study_design_scores_gemma":[0.000007701235,0.000034914425,0.00015778274,0.000019109262,0.000012077074,0.000073402385,0.000026667614,0.96472013,0.0033510628,0.030434173,0.0011465001,0.00001647623],"about_ca_topic_score_codex":0.001950525,"about_ca_topic_score_gemma":0.0023135615,"teacher_disagreement_score":0.004534095,"about_ca_system_score_codex":0.0006587232,"about_ca_system_score_gemma":0.001118874,"threshold_uncertainty_score":0.015168071},"labels":[],"label_agreement":null},{"id":"W760567250","doi":"10.1007/s11276-015-0982-4","title":"LIP: an efficient lightweight iterative positioning algorithm for wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Scalability; Algorithm; Flooding (psychology); Node (physics); Real-time computing; Position (finance); Wireless; Key distribution in wireless sensor networks; Wireless network; Computer network; Telecommunications","score_opus":0.011694078488254045,"score_gpt":0.22598076930038433,"score_spread":0.21428669081213028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W760567250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002003526,0.00010346148,0.9954626,0.00004422189,0.000044456443,0.00002529812,0.000040277817,0.0015793476,0.0006967637],"genre_scores_gemma":[0.12142024,0.0002754256,0.871283,0.00015609096,0.00007018616,0.0003012252,0.0004118283,0.00043854452,0.005643512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938,0.00012805396,0.000030377098,0.000082656086,0.0003134103,0.000065439745],"domain_scores_gemma":[0.999345,0.00024539948,0.000049489325,0.00012353991,0.00019469393,0.000041934883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000755271,0.0009351462,0.0008542438,0.0008860092,0.0005271341,0.00094843376,0.0018379776,0.00088132476,0.0036234153],"category_scores_gemma":[0.0031206254,0.0004677463,0.00047894192,0.0009547304,0.00046178894,0.0018402806,0.0026794577,0.0012435254,0.0026550677],"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.00047154314,0.00009866884,0.0008040741,0.00027479566,0.00008347373,0.00015008372,0.00026704025,0.17098215,0.029424645,0.017585216,0.014308608,0.7655497],"study_design_scores_gemma":[0.00005602842,0.00011081383,0.00019042895,0.000023439463,0.000019310439,0.000109951055,0.000058390666,0.97142965,0.012729483,0.0074678888,0.007776684,0.00002786937],"about_ca_topic_score_codex":0.0020940865,"about_ca_topic_score_gemma":0.0029230635,"teacher_disagreement_score":0.0036234153,"about_ca_system_score_codex":0.0005378431,"about_ca_system_score_gemma":0.0011588924,"threshold_uncertainty_score":0.012121558},"labels":[],"label_agreement":null},{"id":"W804565110","doi":"10.1007/s11276-015-1003-3","title":"EPTR: expected path throughput based routing protocol for wireless mesh network","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Dynamic Source Routing; Link-state routing protocol; Wireless Routing Protocol; Static routing; Distributed computing; Routing protocol; Zone Routing Protocol; Path vector protocol; Equal-cost multi-path routing; Hazy Sighted Link State Routing Protocol; Enhanced Interior Gateway Routing Protocol; Wireless mesh network; Wireless network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.03529247846246507,"score_gpt":0.2863528678612852,"score_spread":0.25106038939882014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W804565110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027184399,0.0013410366,0.9276599,0.0011939985,0.0010125247,0.0006420618,0.0020889223,0.024953082,0.013923937],"genre_scores_gemma":[0.5458407,0.0013538465,0.40463805,0.001051943,0.0005041066,0.0010949442,0.005974021,0.0016993182,0.03784308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993344,0.00017064398,0.00005265202,0.00007777266,0.0002721562,0.000092316885],"domain_scores_gemma":[0.9991499,0.00023179142,0.00010011718,0.00020074286,0.0002545573,0.00006282141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119563,0.0005068125,0.00053917605,0.0007630206,0.0006115795,0.0007231902,0.0016582175,0.0006105661,0.005958498],"category_scores_gemma":[0.0031168316,0.00018189615,0.00030291738,0.00066786417,0.00032903004,0.0015044966,0.0013580298,0.0011052777,0.0014852541],"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.0018147755,0.00040438646,0.0014119529,0.00089928677,0.00015019055,0.0007362763,0.00029868304,0.06479205,0.064111166,0.06569616,0.11792355,0.68176156],"study_design_scores_gemma":[0.0004441277,0.0015747383,0.002213585,0.00012890859,0.0001900719,0.0018141306,0.00017363908,0.7401237,0.07363923,0.046514474,0.13299365,0.00018968241],"about_ca_topic_score_codex":0.0006302317,"about_ca_topic_score_gemma":0.0010658965,"teacher_disagreement_score":0.005958498,"about_ca_system_score_codex":0.00047922277,"about_ca_system_score_gemma":0.0007722997,"threshold_uncertainty_score":0.019933164},"labels":[],"label_agreement":null},{"id":"W856882214","doi":"10.1007/s11276-015-1010-4","title":"Towards a novel trust-based opportunistic routing protocol for wireless networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"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; Wireless; Wireless Routing Protocol; Dynamic Source Routing; Wireless network; Routing (electronic design automation); Geographic routing; Distributed computing; Telecommunications","score_opus":0.06011457483464218,"score_gpt":0.3011187145857745,"score_spread":0.24100413975113233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W856882214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013392783,0.0005110927,0.9824228,0.00036787204,0.00020112608,0.0001379442,0.00004205985,0.0004904731,0.002433873],"genre_scores_gemma":[0.48904094,0.0010174353,0.50097555,0.00027845587,0.0002358925,0.00031500342,0.00021945103,0.00013371072,0.007783532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986494,0.00031805027,0.00011818066,0.00013764978,0.00064767635,0.00012910398],"domain_scores_gemma":[0.9977501,0.00073491764,0.00021079261,0.0004018513,0.00074862724,0.00015373195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018949466,0.0004664835,0.0007282086,0.0006826886,0.0009660619,0.001512069,0.0019488058,0.0010197612,0.00084272906],"category_scores_gemma":[0.0050248816,0.0003768681,0.00045510373,0.00075578183,0.0007102181,0.0029421232,0.0025045148,0.0014298313,0.00045244995],"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.00092861213,0.0004930516,0.002763163,0.00043746573,0.00023410494,0.0010907162,0.0010590332,0.17504345,0.08178322,0.25168747,0.0151390955,0.4693406],"study_design_scores_gemma":[0.000053939246,0.00020645776,0.00027243048,0.00002699483,0.00008331074,0.00049502886,0.00014830289,0.9406609,0.010184395,0.0326089,0.015208586,0.00005071755],"about_ca_topic_score_codex":0.0017770733,"about_ca_topic_score_gemma":0.002965646,"teacher_disagreement_score":0.0019488058,"about_ca_system_score_codex":0.0007430688,"about_ca_system_score_gemma":0.0012305756,"threshold_uncertainty_score":0.010021567},"labels":[],"label_agreement":null}]}