{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5200874,0.04854702,0.4184581,0.005433293,0.00096944853,0.00088119286,0.0000020008504,0.00038778264,0.0052337563],"genre_scores_gemma":[0.99353355,0.004347588,0.0011597704,0.00014074784,0.00059371814,0.00006230923,0.000002802234,0.000029271767,0.00013023916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960605,0.0008523217,0.00040477965,0.00094152667,0.0007441847,0.0009966772],"domain_scores_gemma":[0.99785507,0.0006275755,0.00010857532,0.0008087576,0.00028300064,0.00031700698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030949519,0.00028471518,0.00042235004,0.00027529016,0.00021218526,0.00045177853,0.00090460427,0.00023747393,0.0000052790974],"category_scores_gemma":[0.000060382292,0.00027612122,0.000058574256,0.00083360315,0.00024904456,0.0010005813,0.0009164977,0.0009179952,0.0000075102694],"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.00014076068,0.0007853431,0.007628785,0.00012431527,0.00011568883,0.000462343,0.058934152,0.025715262,0.00004281693,0.28037778,0.0055414755,0.62013125],"study_design_scores_gemma":[0.0011727731,0.0001969932,0.013554051,0.00028284916,0.000005586401,0.000017687908,0.013270352,0.9672438,0.00002654481,0.0026139335,0.0011601907,0.0004552495],"about_ca_topic_score_codex":0.00040372805,"about_ca_topic_score_gemma":0.00062175945,"teacher_disagreement_score":0.9415285,"about_ca_system_score_codex":0.0002610416,"about_ca_system_score_gemma":0.00015665193,"threshold_uncertainty_score":0.9999691},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95471966,0.00018348245,0.039650552,0.00017870238,0.00033386424,0.002259249,0.0000047650283,0.00036658006,0.0023031677],"genre_scores_gemma":[0.9944587,0.00042998884,0.0033728618,0.00013799527,0.00049569685,0.0006047193,0.00001176818,0.000056199446,0.00043210678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655616,0.0002867823,0.0009109243,0.00082487636,0.00041242197,0.0010088482],"domain_scores_gemma":[0.9980594,0.00029240042,0.00025702477,0.001078853,0.0000858456,0.00022647041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076222955,0.00043037048,0.00079419726,0.00018580332,0.00014379076,0.00015629966,0.0016919363,0.00041211443,0.00019152279],"category_scores_gemma":[0.000004211232,0.00042720785,0.00020268725,0.0014335979,0.00014571215,0.00051541836,0.00012711361,0.0005487252,0.000078477155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006287757,0.0002011966,0.0017665745,0.00003840283,0.000022915749,0.00006115987,0.0004315931,0.69021666,0.00023405941,0.0023101764,0.00061405136,0.30404034],"study_design_scores_gemma":[0.0010920066,0.000108498905,0.0020217227,0.0005194836,0.0000087485905,0.000015963878,0.000014920233,0.9945581,0.00027784164,0.00015307876,0.0007234859,0.0005061639],"about_ca_topic_score_codex":0.00024067829,"about_ca_topic_score_gemma":0.00031248896,"teacher_disagreement_score":0.30434144,"about_ca_system_score_codex":0.000078358156,"about_ca_system_score_gemma":0.00012557513,"threshold_uncertainty_score":0.99981797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05911764,0.00050953863,0.89953506,0.0002692535,0.00025495113,0.0011000397,0.000014858238,0.0010942081,0.038104456],"genre_scores_gemma":[0.9708645,0.00036182703,0.026256952,0.00016244249,0.00039668623,0.00046572226,0.00008013636,0.0000356829,0.0013760654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960382,0.0008077829,0.000538271,0.0010333413,0.00072662375,0.00085577334],"domain_scores_gemma":[0.99571836,0.0002903491,0.00012508809,0.003167475,0.0002925792,0.00040612606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009428558,0.00034137917,0.00037259283,0.00010581985,0.00052050047,0.0004211703,0.003535627,0.00031717177,0.00031158177],"category_scores_gemma":[0.000016393735,0.00032888175,0.000106750864,0.0013673782,0.0003091592,0.0016537042,0.0006395127,0.0010446806,0.00013040127],"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.0001274947,0.0009587941,0.002646235,0.000018455708,0.00005455473,0.000008314664,0.00068662694,0.3811981,0.000014103862,0.049932834,0.0032383588,0.5611161],"study_design_scores_gemma":[0.00039569623,0.00019466876,0.011497126,0.000035046298,0.0000051372886,0.00001265609,0.000046239173,0.98424226,0.000021346565,0.0005947127,0.0026322068,0.00032290106],"about_ca_topic_score_codex":0.00009414787,"about_ca_topic_score_gemma":0.00003427276,"teacher_disagreement_score":0.91174686,"about_ca_system_score_codex":0.00014257539,"about_ca_system_score_gemma":0.00018476405,"threshold_uncertainty_score":0.9999163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52274764,0.004951096,0.45967036,0.004969457,0.00061211165,0.00064943335,0.0000028347235,0.00080822373,0.0055888635],"genre_scores_gemma":[0.9892326,0.0065885764,0.0021739623,0.00029706562,0.00037233814,0.000050430786,0.00001076677,0.000029243043,0.0012450275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977357,0.00037761882,0.00035911516,0.0006192952,0.00036354718,0.0005447151],"domain_scores_gemma":[0.997932,0.00047615118,0.000104518804,0.0011678201,0.00012404479,0.00019542169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446868,0.00025004745,0.00029074584,0.00014183624,0.00037126977,0.0009042007,0.0025238227,0.000153745,0.00015998204],"category_scores_gemma":[0.000028067965,0.00024059077,0.0000659617,0.0006745039,0.00019922025,0.0015698683,0.001016715,0.00054099306,0.00005036958],"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.000047631205,0.00011588288,0.006171176,0.000016471125,0.00005337571,0.000014340669,0.0008573066,0.046712287,0.00006046955,0.006650767,0.003205499,0.9360948],"study_design_scores_gemma":[0.0005000091,0.000054082495,0.007435387,0.00009208478,0.0000033653682,0.000020355279,0.000032792665,0.9764297,0.0002971235,0.00067357614,0.014176445,0.00028510153],"about_ca_topic_score_codex":0.00027642868,"about_ca_topic_score_gemma":0.00018125548,"teacher_disagreement_score":0.9358097,"about_ca_system_score_codex":0.00005993242,"about_ca_system_score_gemma":0.000027692506,"threshold_uncertainty_score":0.9811007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3345928,0.00041200637,0.66362596,0.00016402366,0.0002327307,0.0007510419,0.00000238682,0.00010146184,0.00011759642],"genre_scores_gemma":[0.99076355,0.00010381482,0.008290319,0.00018366655,0.00029700095,0.00017285881,0.00001184531,0.000026709646,0.00015023608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975186,0.00029347168,0.0005647034,0.00058130943,0.00049844926,0.00054349104],"domain_scores_gemma":[0.99824834,0.000603728,0.0002621425,0.000468202,0.0002628088,0.00015475678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018697191,0.00024912457,0.00038866748,0.00005894161,0.00020369948,0.00012626703,0.00046203547,0.0001230117,0.00008961929],"category_scores_gemma":[0.000024101482,0.0002446858,0.000101112804,0.00024444878,0.00010327745,0.00034890408,0.00006429778,0.00014803419,0.0000047659787],"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.00006870189,0.00005180752,0.00012350378,0.000011785289,0.000035929534,0.0000031598065,0.00014096688,0.18691258,0.000046381392,0.0016256524,0.00081460224,0.8101649],"study_design_scores_gemma":[0.0021184469,0.00010775552,0.00070018123,0.00008293823,0.00008083556,0.000016066262,0.000013280085,0.9955688,0.00017258627,0.0004621986,0.00041188597,0.0002650209],"about_ca_topic_score_codex":0.000012181239,"about_ca_topic_score_gemma":0.000008533852,"teacher_disagreement_score":0.8098999,"about_ca_system_score_codex":0.000047984064,"about_ca_system_score_gemma":0.00011149901,"threshold_uncertainty_score":0.99779975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42510852,0.025924917,0.5272855,0.0035537258,0.00067373173,0.0024136256,0.000010107379,0.0016724432,0.013357415],"genre_scores_gemma":[0.9843408,0.002009875,0.010504469,0.00032590408,0.00044101142,0.00007916798,0.000013086509,0.0000672982,0.0022183852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964257,0.00038834265,0.0004459827,0.0008941457,0.0007134782,0.0011323736],"domain_scores_gemma":[0.99664575,0.00049576303,0.00023291046,0.0018264198,0.00034933793,0.00044981527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056057074,0.00041035662,0.00046086835,0.00011222912,0.0005430754,0.00048658243,0.0023995049,0.0002418205,0.000095668394],"category_scores_gemma":[0.000023335904,0.00036607755,0.000055724548,0.0017481616,0.00032397898,0.0005319879,0.00078775344,0.0008351576,0.00010466056],"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.00077160064,0.0014596636,0.0036820425,0.00022238056,0.00021041874,0.0010856888,0.0022854262,0.44067502,0.0003657686,0.003064781,0.10400418,0.442173],"study_design_scores_gemma":[0.0012042053,0.0003990468,0.00017714636,0.00018039747,0.000015539214,0.00014533298,0.00001042647,0.9952239,0.00008147306,0.00013972977,0.0019220656,0.00050075],"about_ca_topic_score_codex":0.000016919335,"about_ca_topic_score_gemma":0.0000355061,"teacher_disagreement_score":0.5592323,"about_ca_system_score_codex":0.00006740959,"about_ca_system_score_gemma":0.00009496577,"threshold_uncertainty_score":0.9998791},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0633224,0.0047316467,0.917097,0.0013053986,0.0018411325,0.0013122081,0.0000022387826,0.0011276958,0.009260291],"genre_scores_gemma":[0.98497105,0.0022129635,0.011155436,0.00029712555,0.00034316888,0.00023806257,0.000033417808,0.000078260695,0.00067051227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591815,0.00041741916,0.00074869697,0.0008566497,0.0006761586,0.001382932],"domain_scores_gemma":[0.99651736,0.00051718083,0.00021063372,0.0022301057,0.0001822305,0.0003425015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013277316,0.000460205,0.0006231715,0.0003706217,0.00028471558,0.0003457073,0.0030785985,0.00046946591,0.000054194774],"category_scores_gemma":[0.000041954925,0.00045719196,0.0001601845,0.0021923706,0.00021147146,0.0006971409,0.0005383791,0.0014546397,0.0000700084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021835247,0.00025846213,0.0014143317,0.000018310757,0.00003426937,0.00007449846,0.00050084054,0.7315185,0.000014636541,0.015110576,0.013820227,0.23721348],"study_design_scores_gemma":[0.0008172679,0.00004217864,0.00084434106,0.00011238486,0.0000035679668,0.000019165254,0.000047813206,0.9863679,0.000048926264,0.00016700671,0.011017786,0.00051169004],"about_ca_topic_score_codex":0.00007015912,"about_ca_topic_score_gemma":0.000442757,"teacher_disagreement_score":0.9216487,"about_ca_system_score_codex":0.00018963907,"about_ca_system_score_gemma":0.00015612465,"threshold_uncertainty_score":0.999788},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008341874,0.0009448983,0.9833732,0.0018964097,0.00032636142,0.0004116382,0.0000015647782,0.0006452973,0.0040587313],"genre_scores_gemma":[0.90189445,0.0014254814,0.094187,0.00038185844,0.0005023219,0.00017039393,0.000018527375,0.000065352666,0.0013546349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651486,0.00038469184,0.00044484483,0.00073795865,0.0008122883,0.0011053698],"domain_scores_gemma":[0.99645376,0.00038994805,0.00017804238,0.0023301987,0.00028977613,0.00035824682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005867551,0.0003789167,0.00043169066,0.00020777082,0.00050779636,0.0006009652,0.0032137842,0.00022722164,0.00004063036],"category_scores_gemma":[0.000011985142,0.00033342937,0.000106067135,0.001748814,0.00028422865,0.0008013879,0.00086605956,0.0008304681,0.000052885152],"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.00004651228,0.00016387775,0.0032797232,0.000013228256,0.00009038275,0.00023086868,0.00036350772,0.02073148,0.000016160904,0.025103819,0.0046261447,0.9453343],"study_design_scores_gemma":[0.0007601103,0.00011761074,0.0025957965,0.00011414855,0.0000075557346,0.000226563,0.00006456714,0.9843473,0.000040252155,0.0004702547,0.010787651,0.00046823078],"about_ca_topic_score_codex":0.00010726352,"about_ca_topic_score_gemma":0.000209319,"teacher_disagreement_score":0.9636158,"about_ca_system_score_codex":0.00012820704,"about_ca_system_score_gemma":0.00018973017,"threshold_uncertainty_score":0.9999118},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19247822,0.0014289294,0.7967138,0.00017078056,0.00036273347,0.00018578398,0.0000021338003,0.000182307,0.008475305],"genre_scores_gemma":[0.9975411,0.0011056116,0.0006949898,0.00022422768,0.00012039058,0.000022366636,0.00004462083,0.000017292437,0.00022934368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811494,0.00012650304,0.0005407154,0.00044841052,0.00033981234,0.00042964294],"domain_scores_gemma":[0.9976773,0.00019077167,0.00025271135,0.0011568497,0.00049723923,0.00022507327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005836852,0.00025435895,0.0005366287,0.000253774,0.00023855228,0.00028950654,0.0014385659,0.00013751454,0.000013654476],"category_scores_gemma":[0.000032229356,0.00023325742,0.00016828287,0.003556056,0.0001440123,0.0009971973,0.00077044225,0.00042042867,0.000008816392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021518683,0.000064120904,0.021527305,0.0000026172168,0.00032548036,0.0000035145276,0.00061900605,0.9022153,0.000008040395,0.015213917,0.0010071537,0.05899202],"study_design_scores_gemma":[0.0003632799,0.00008275309,0.0036750552,0.00005118997,0.00007815309,0.0000029274647,0.000059323986,0.994839,0.000023282839,0.0000134601005,0.000541169,0.00027038335],"about_ca_topic_score_codex":0.0000033368906,"about_ca_topic_score_gemma":0.000026927566,"teacher_disagreement_score":0.80506295,"about_ca_system_score_codex":0.00008296204,"about_ca_system_score_gemma":0.00008846698,"threshold_uncertainty_score":0.95119613},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012382692,0.00042099608,0.9800661,0.0039105196,0.00090952555,0.0006198806,0.0000017696991,0.0003348736,0.0013536398],"genre_scores_gemma":[0.9743656,0.00014166634,0.022867704,0.0017133586,0.0004142569,0.0001800627,0.000044087516,0.000024162398,0.00024912055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998289,0.0002133172,0.00039219533,0.00046711974,0.0002296947,0.00040868515],"domain_scores_gemma":[0.9979138,0.00028859245,0.0001626934,0.00079447863,0.0005490076,0.00029147448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845787,0.00021239587,0.00025057243,0.000114203474,0.00033994953,0.00025857036,0.0009150443,0.00013184504,0.000006585953],"category_scores_gemma":[0.00012799838,0.00021853454,0.00007308767,0.0008186036,0.000050008202,0.00048533754,0.00029017037,0.00023270704,0.000038359707],"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.00010793739,0.00013917657,0.0005674142,0.000028804036,0.00007722766,0.0000038673147,0.0035037932,0.0816774,0.00056687905,0.16480786,0.030474912,0.71804476],"study_design_scores_gemma":[0.00085392786,0.00010966503,0.00033999424,0.000090620575,0.000012206098,0.000011069203,0.00016555811,0.96526766,0.00017998027,0.00047177667,0.03217299,0.00032455538],"about_ca_topic_score_codex":0.000008165824,"about_ca_topic_score_gemma":0.00008857854,"teacher_disagreement_score":0.9619829,"about_ca_system_score_codex":0.00014977762,"about_ca_system_score_gemma":0.00014490045,"threshold_uncertainty_score":0.891158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028590806,0.000053748132,0.95542145,0.0003184149,0.00068727136,0.04091895,0.0000063522275,0.00072600244,0.0015818825],"genre_scores_gemma":[0.686438,0.00001269464,0.018575609,0.0009952573,0.0035852918,0.28926802,0.000181743,0.00014061357,0.0008027512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955337,0.00023965444,0.0010318342,0.0012467823,0.0005541923,0.0013938359],"domain_scores_gemma":[0.9967906,0.00046477924,0.00064560026,0.001454206,0.00040146898,0.0002433647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058137265,0.00064214884,0.00066091033,0.00015543643,0.00050224585,0.0005398778,0.0018368042,0.00072667387,0.00003342798],"category_scores_gemma":[0.000017751772,0.00062318984,0.00026384444,0.0012489876,0.00022347063,0.00073409174,0.00044462152,0.00060003594,0.0000027047213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018444791,0.00010740845,0.00040217073,0.000040999774,0.00003985439,0.000026716925,0.000027628872,0.54176617,0.000054997436,0.22769634,0.05736155,0.1722917],"study_design_scores_gemma":[0.002453584,0.0002112165,0.00049738743,0.00014954532,0.0000142454155,0.000038994658,0.0000071181867,0.95368123,0.000117917494,0.0074015474,0.03476121,0.0006660344],"about_ca_topic_score_codex":0.00019142128,"about_ca_topic_score_gemma":0.0003288824,"teacher_disagreement_score":0.93684584,"about_ca_system_score_codex":0.00021746678,"about_ca_system_score_gemma":0.00022333795,"threshold_uncertainty_score":0.9996219},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03055021,0.00035835218,0.9642512,0.000006999657,0.002948598,0.00045145204,0.0000012191996,0.00053388026,0.00089805876],"genre_scores_gemma":[0.79250157,0.00016685216,0.20608753,0.00021256311,0.00088536076,0.000043400672,0.0000044351923,0.00006416805,0.00003412304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961977,0.00023090767,0.0007563392,0.0011126884,0.0006199007,0.0010824696],"domain_scores_gemma":[0.9978002,0.0002245112,0.00039399866,0.0010289601,0.00029681865,0.0002555626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007627373,0.0004921388,0.00050956453,0.00020758541,0.00045099977,0.000295222,0.001549913,0.00041112248,0.000082090344],"category_scores_gemma":[0.000015529607,0.0004913997,0.00020671588,0.001437663,0.0000974076,0.00080987136,0.00075889024,0.0007354181,0.0000473491],"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.000032564007,0.00012973207,0.0010954918,0.000009185487,0.000047666454,0.00006471699,0.0005541775,0.019771978,0.00003268909,0.012383506,0.0007734937,0.9651048],"study_design_scores_gemma":[0.00027230108,0.00010814394,0.00085268705,0.0003646334,0.000026057292,0.000102577884,0.000038901562,0.99361247,0.00032342787,0.00346129,0.00027197102,0.00056552596],"about_ca_topic_score_codex":0.00010364433,"about_ca_topic_score_gemma":0.00005874197,"teacher_disagreement_score":0.9738405,"about_ca_system_score_codex":0.00029747174,"about_ca_system_score_gemma":0.000108572014,"threshold_uncertainty_score":0.9997538},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07268147,0.0006442243,0.9240199,0.00021450227,0.00045746582,0.0011848336,0.0000019156137,0.0005781659,0.00021753377],"genre_scores_gemma":[0.96748614,0.000092388065,0.030544894,0.00018902426,0.000824789,0.00062583335,0.000073348056,0.00013515097,0.00002839926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809265,0.00006283449,0.00044620005,0.00042628858,0.00020821638,0.0007638117],"domain_scores_gemma":[0.99859715,0.00059011416,0.00012446883,0.00034149317,0.00013377926,0.00021298784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026409436,0.0003432358,0.0003436682,0.00008694574,0.00026429482,0.00011229612,0.00011464884,0.00028248402,0.000014101473],"category_scores_gemma":[0.00002203143,0.00037373236,0.00007811453,0.0005018878,0.00009492912,0.00013819357,0.000046897105,0.00035162672,0.000008699893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044040273,0.000032900898,0.00020970359,0.00005519244,0.000037270183,0.000002006979,0.00003282748,0.9829343,0.00012597107,0.00044252328,0.0037835916,0.012299689],"study_design_scores_gemma":[0.0007601588,0.000059223214,0.00034813897,0.00011270431,0.00004303157,0.000009347477,0.000022762517,0.9963127,0.000115448565,0.00015931204,0.0016497497,0.00040744874],"about_ca_topic_score_codex":0.000007359445,"about_ca_topic_score_gemma":0.000012514513,"teacher_disagreement_score":0.8948047,"about_ca_system_score_codex":0.0001073479,"about_ca_system_score_gemma":0.000018822644,"threshold_uncertainty_score":0.99987143},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056292117,0.00034992755,0.9414923,0.00018441405,0.00066556927,0.0005827958,0.0000023565733,0.00022867978,0.00020183779],"genre_scores_gemma":[0.9958189,0.000023061444,0.0026612822,0.0005723429,0.00070697657,0.000089706744,0.000009081989,0.00003700576,0.00008163452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769485,0.00014076334,0.0003931452,0.00075884274,0.0002746893,0.0007377331],"domain_scores_gemma":[0.99787027,0.0008901474,0.00021850131,0.00065200723,0.000081606035,0.0002874804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007412366,0.00029816182,0.0003929372,0.000060391703,0.0003644969,0.00028075866,0.0005842885,0.00021430975,0.000010192236],"category_scores_gemma":[0.000047285328,0.0002710198,0.00009843744,0.00021789747,0.000052979114,0.00018474723,0.00027239183,0.0002700267,0.0000033659526],"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.000066014865,0.00007000808,0.0032267103,0.00004974162,0.000039197694,0.0000095955,0.0002206006,0.41084805,0.00011191751,0.024268607,0.0020835174,0.55900604],"study_design_scores_gemma":[0.0017100963,0.00011286803,0.0033357306,0.00020321843,0.000019725125,0.000011388092,0.000009587842,0.9916156,0.000046159937,0.00022669892,0.0023858806,0.0003230612],"about_ca_topic_score_codex":0.000019712857,"about_ca_topic_score_gemma":0.000017949074,"teacher_disagreement_score":0.9395268,"about_ca_system_score_codex":0.000052675103,"about_ca_system_score_gemma":0.000030071698,"threshold_uncertainty_score":0.9999742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12314254,0.0010520454,0.87122655,0.000012035591,0.0020216042,0.0008030739,0.000009024064,0.0012654781,0.00046766724],"genre_scores_gemma":[0.9254649,0.0002105769,0.071370244,0.00012821663,0.0022162246,0.00010318079,0.0002314603,0.000247904,0.000027281156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967488,0.000042246193,0.0008173331,0.0006272223,0.00028452525,0.0014798674],"domain_scores_gemma":[0.99817836,0.00039543913,0.00017227758,0.0006210607,0.0002099444,0.00042291108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007987336,0.0005707349,0.0005505184,0.00017664502,0.00033297416,0.00011099662,0.00042299478,0.0005744465,0.00002859929],"category_scores_gemma":[0.00001908632,0.00064304826,0.00017753823,0.00072616525,0.00015867337,0.00025949677,0.00003379242,0.00063861127,0.0000071324457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010924002,0.00006317772,0.00019200596,0.00003695602,0.00007037453,0.000012951851,0.000059041813,0.96031195,0.00043177203,0.0013448434,0.00030568268,0.037062015],"study_design_scores_gemma":[0.0012601491,0.00007738115,0.000058181056,0.00013960355,0.000038707094,0.00001909559,0.00009555892,0.996542,0.0004914346,0.000041844625,0.00049594627,0.0007401388],"about_ca_topic_score_codex":0.0000040879186,"about_ca_topic_score_gemma":0.00005285909,"teacher_disagreement_score":0.8023224,"about_ca_system_score_codex":0.00031052477,"about_ca_system_score_gemma":0.000031853462,"threshold_uncertainty_score":0.9996021},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83445305,0.0021897773,0.16193157,0.000039536324,0.00037316006,0.00022879621,0.0000013903513,0.000022680853,0.0007600269],"genre_scores_gemma":[0.9986003,0.0006590655,0.00019530406,0.00015569816,0.00033637215,0.000024639747,0.000004075043,0.000015302103,0.0000092529235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975382,0.0004142171,0.00058123557,0.000342801,0.00034233346,0.0007812312],"domain_scores_gemma":[0.99783814,0.0012313841,0.00028891367,0.00044686344,0.000106161475,0.000088517074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010613336,0.00024456697,0.0004601195,0.00016739707,0.00007265266,0.000033871085,0.00077203487,0.00015963466,0.0000066697758],"category_scores_gemma":[0.00004085768,0.0001940003,0.0001023538,0.0014971866,0.00021221135,0.00045185245,0.00018658876,0.00044244053,4.5973078e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002626702,0.00038891195,0.18375865,0.000036505247,0.00004330186,0.000027668084,0.0027755154,0.5542635,0.000101957165,0.005958143,0.0001249672,0.25225827],"study_design_scores_gemma":[0.0005790622,0.00010004507,0.094505265,0.00039222682,0.000009982665,0.000019880787,0.00011579829,0.90379083,0.00021094183,0.000035801142,0.00003716606,0.00020297556],"about_ca_topic_score_codex":0.00030354952,"about_ca_topic_score_gemma":0.0004940989,"teacher_disagreement_score":0.3495274,"about_ca_system_score_codex":0.0000592139,"about_ca_system_score_gemma":0.000050651735,"threshold_uncertainty_score":0.7911103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017858636,0.0005992502,0.9798964,0.00012878305,0.00046641502,0.000786657,0.0000012888331,0.00017969121,0.00008284467],"genre_scores_gemma":[0.972259,0.000069953865,0.026636764,0.00018180154,0.00066545326,0.00006804832,0.000047461643,0.000049412225,0.000022119517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810207,0.00008881214,0.00031061633,0.0005003187,0.00021405343,0.0007841566],"domain_scores_gemma":[0.99883246,0.00029330963,0.0002426055,0.00017927312,0.0002190938,0.00023324083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043701395,0.00031593436,0.0003223344,0.00012318743,0.00050438714,0.00024231,0.00013203865,0.0001663116,0.000004648043],"category_scores_gemma":[0.000020851558,0.00028663527,0.00006878553,0.00054701354,0.000098632205,0.0011177107,0.00007709754,0.000284936,6.882165e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011384329,0.00003922391,0.0007056825,0.000008710481,0.00008332486,8.8994454e-7,0.00049178296,0.9565333,0.000019867464,0.0021744983,0.0000499044,0.039778963],"study_design_scores_gemma":[0.0008964275,0.00023890172,0.0016154324,0.00020545907,0.00007899735,0.00011064117,0.00009202468,0.99623734,0.000041594663,0.00004845043,0.000019467607,0.00041528876],"about_ca_topic_score_codex":0.000020831338,"about_ca_topic_score_gemma":0.000040215305,"teacher_disagreement_score":0.95440036,"about_ca_system_score_codex":0.00011472254,"about_ca_system_score_gemma":0.000033471366,"threshold_uncertainty_score":0.9999586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057839,0.0006584689,0.9356165,0.0002809744,0.0011328019,0.00279719,0.0000031864063,0.00057415257,0.0010977143],"genre_scores_gemma":[0.9920205,0.000141024,0.0051552565,0.00033228146,0.0011429503,0.0006896207,0.000029603512,0.000057797737,0.0004309536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954698,0.0003542414,0.0008119513,0.0012285167,0.00056103064,0.001574434],"domain_scores_gemma":[0.9977103,0.00028175712,0.000334088,0.0012712965,0.00012313899,0.00027942748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008629054,0.00060918956,0.000768417,0.00023928178,0.00067935797,0.00041514757,0.0025325953,0.0005824283,0.000028526701],"category_scores_gemma":[0.0000060701304,0.0006212394,0.00025581074,0.0016750193,0.0001846903,0.000849288,0.0019178619,0.001059948,0.00003342178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008799423,0.00061018317,0.14678736,0.000037119822,0.000043613698,0.00041601548,0.00020131942,0.7354844,0.000037303435,0.035390556,0.009279672,0.07162446],"study_design_scores_gemma":[0.0018146588,0.000058187008,0.07722465,0.00016634386,0.000009443673,0.000020629319,0.000010258114,0.9181366,0.000024569132,0.0004940209,0.0013166848,0.00072398933],"about_ca_topic_score_codex":0.0014365435,"about_ca_topic_score_gemma":0.0018352757,"teacher_disagreement_score":0.9341815,"about_ca_system_score_codex":0.00023256114,"about_ca_system_score_gemma":0.00007578608,"threshold_uncertainty_score":0.9996239},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056745917,0.0031648541,0.93696266,0.000709119,0.00030905483,0.0018737497,0.0000016052535,0.00017422253,0.00005882565],"genre_scores_gemma":[0.943603,0.00032167367,0.054159954,0.0006738081,0.0002660581,0.0008611578,0.000038597867,0.00004705063,0.00002869461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997099,0.00021256624,0.00062153937,0.0009188055,0.00031654563,0.0008315428],"domain_scores_gemma":[0.99828595,0.00047560417,0.00020966498,0.000568566,0.00017451553,0.00028569976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006228882,0.0003978549,0.0004803718,0.00012304528,0.0002789088,0.00040510547,0.00059174123,0.00038404687,0.000028981285],"category_scores_gemma":[0.000015758542,0.0003834569,0.000102412436,0.00062883896,0.00009187126,0.00073199143,0.00013983126,0.00042334408,0.0000052528903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003970867,0.000075108925,0.0009704355,0.000020260037,0.000018730087,0.0000047283133,0.0001685159,0.78321004,0.0002411895,0.0013602453,0.0002682644,0.21362275],"study_design_scores_gemma":[0.0019280154,0.00014125521,0.002902989,0.00033840502,0.0000111801255,0.00000384292,0.00003206731,0.9929545,0.000109844885,0.00036301315,0.0007599581,0.00045492893],"about_ca_topic_score_codex":0.000024131503,"about_ca_topic_score_gemma":0.000059867365,"teacher_disagreement_score":0.8868571,"about_ca_system_score_codex":0.00017251603,"about_ca_system_score_gemma":0.00010414666,"threshold_uncertainty_score":0.9998617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10415828,0.0032080638,0.88908756,0.0003398519,0.00083602854,0.00037845763,2.6765866e-7,0.00033250233,0.0016589975],"genre_scores_gemma":[0.9815397,0.0021636384,0.014563034,0.0004779333,0.00048479412,0.00010714798,0.000010439091,0.00003741223,0.0006158627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973217,0.00043906548,0.0005337698,0.000495459,0.00023547353,0.00097447814],"domain_scores_gemma":[0.99851966,0.00028268865,0.00017161075,0.0006119044,0.00018658933,0.0002275648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011607659,0.00031911914,0.00035890884,0.00017024034,0.0005167104,0.00022349722,0.00093334407,0.00027009004,0.000050827355],"category_scores_gemma":[0.00004407868,0.0003168773,0.00008382234,0.0017734553,0.00007113089,0.0014592765,0.0005692254,0.0010730642,0.00004300565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023769728,0.00014563116,0.017314324,0.000003194267,0.000021586777,0.000003651238,0.0010485278,0.9358356,0.00012257295,0.021526344,0.0028430806,0.021111727],"study_design_scores_gemma":[0.00059545005,0.0000448065,0.0075954245,0.00010987789,0.0000060221923,0.00001730656,0.00005172819,0.9861469,0.00010844508,0.0000044074213,0.0049302224,0.0003893799],"about_ca_topic_score_codex":0.000027714206,"about_ca_topic_score_gemma":0.0001182504,"teacher_disagreement_score":0.87738144,"about_ca_system_score_codex":0.00024466554,"about_ca_system_score_gemma":0.000056508372,"threshold_uncertainty_score":0.99992836},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015331944,0.0021757833,0.9713058,0.00015464434,0.0022143796,0.0007041593,7.4193423e-7,0.0028872825,0.005225299],"genre_scores_gemma":[0.9389029,0.000113959344,0.057946794,0.00053484493,0.0019081434,0.000094258656,0.000015103614,0.000052506766,0.0004314784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542105,0.00027141068,0.0007383033,0.001147479,0.0006505885,0.0017711899],"domain_scores_gemma":[0.9972462,0.00018205249,0.00034710305,0.0016329982,0.00017988974,0.0004117261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065303745,0.0005622163,0.00064699835,0.00013154086,0.00056332134,0.00055126555,0.0018342902,0.0004064974,0.0000057534685],"category_scores_gemma":[0.000008130004,0.0005452083,0.0002626228,0.0017334374,0.00009452101,0.00044432015,0.00028813613,0.00066993927,0.000067801906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013440814,0.00008495126,0.00016217068,0.000012135056,0.000023084385,0.00013074769,0.00011399401,0.7366435,0.000021707523,0.061347123,0.0019571688,0.19949001],"study_design_scores_gemma":[0.00046963242,0.0002982256,0.00027509464,0.000258057,0.000018620407,0.00012666862,0.00006439792,0.98056793,0.00006116973,0.000064160566,0.017132696,0.0006633314],"about_ca_topic_score_codex":0.00001272034,"about_ca_topic_score_gemma":0.0000067596543,"teacher_disagreement_score":0.923571,"about_ca_system_score_codex":0.0002029057,"about_ca_system_score_gemma":0.0000564531,"threshold_uncertainty_score":0.99969995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026579373,0.00013420687,0.96791714,0.00034244102,0.000978045,0.0009557246,1.1398564e-7,0.00061997905,0.002472965],"genre_scores_gemma":[0.9951664,0.00012116675,0.001977861,0.0010942208,0.0006359075,0.00045743585,0.000028257726,0.00007933886,0.00043938053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949446,0.00043224316,0.0010609867,0.0011326531,0.00062673265,0.0018028249],"domain_scores_gemma":[0.9971667,0.0005563803,0.00045558307,0.001269939,0.00017589137,0.00037553036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011034176,0.0005896149,0.00068627903,0.00022054359,0.00036976035,0.00066455087,0.0019105953,0.00046730365,0.00018872654],"category_scores_gemma":[0.000030412337,0.0006044991,0.00019838552,0.0015964155,0.00011276528,0.0010474381,0.00075549,0.001640924,0.00010966551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010607674,0.00005155468,0.00680558,0.00001162692,0.000019859004,0.000037669015,0.00012738684,0.88133913,0.000017726572,0.019540511,0.0013567287,0.0906816],"study_design_scores_gemma":[0.0010371937,0.00009925434,0.0033339325,0.00029307025,0.000008187534,0.000008170834,0.000041565443,0.9940622,0.00003939568,0.00010798967,0.00029008364,0.0006789501],"about_ca_topic_score_codex":0.000452089,"about_ca_topic_score_gemma":0.00012147169,"teacher_disagreement_score":0.96858704,"about_ca_system_score_codex":0.00028767053,"about_ca_system_score_gemma":0.0001124217,"threshold_uncertainty_score":0.99964064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049849596,0.00012734393,0.93969685,0.00013616192,0.0070083006,0.0014587778,0.000004901143,0.00122497,0.00049312616],"genre_scores_gemma":[0.9784107,0.000043689535,0.017348288,0.00020976168,0.0028644449,0.00080091594,0.000043481126,0.00011152625,0.00016719158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570024,0.00020996183,0.0009325432,0.0013907369,0.00050670543,0.0012598375],"domain_scores_gemma":[0.9961391,0.00065720204,0.00061984966,0.0017700145,0.0004086835,0.00040512788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009730169,0.0005809766,0.0007034735,0.0001815368,0.0007356737,0.0006476392,0.0018283983,0.0007576692,0.000011403553],"category_scores_gemma":[0.000028267277,0.00059830304,0.00035242413,0.0011301115,0.00015215289,0.0008977976,0.00038563236,0.0011422839,0.000020810901],"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.00020520549,0.00019635787,0.0012621994,0.00016717096,0.00024532058,0.00008868956,0.0003793238,0.21649483,0.003125702,0.15214227,0.0035221048,0.6221708],"study_design_scores_gemma":[0.0011021453,0.00015312852,0.00062929734,0.00011882688,0.000047964186,0.00013319444,0.000042585765,0.99442554,0.0007143606,0.00019125536,0.0017756226,0.00066606264],"about_ca_topic_score_codex":0.0000813547,"about_ca_topic_score_gemma":0.0007198809,"teacher_disagreement_score":0.9285611,"about_ca_system_score_codex":0.0001880444,"about_ca_system_score_gemma":0.00012563083,"threshold_uncertainty_score":0.99964684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062248786,0.00030549968,0.9898783,0.00025196825,0.0015342599,0.0011451192,0.000004358195,0.00033703633,0.00031857187],"genre_scores_gemma":[0.93662375,0.00021231912,0.059803586,0.00040459645,0.0025371532,0.00014924924,0.00014537183,0.00006031102,0.00006363615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976907,0.00008622421,0.0004237351,0.0008278103,0.0002708252,0.00070070784],"domain_scores_gemma":[0.9981306,0.00066494796,0.00022756026,0.00044856005,0.0002644727,0.0002638215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043048657,0.00035311843,0.00036511946,0.00011397319,0.0004343322,0.0002653658,0.00048087805,0.0004078724,0.000043741715],"category_scores_gemma":[0.00002648325,0.00034560685,0.00019016833,0.0005960256,0.00010476766,0.00049793004,0.00008203255,0.00064993545,0.0000045678485],"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.00008024557,0.0000867412,0.0002719045,0.00000876437,0.000038325892,0.000005188063,0.00016168744,0.35245147,0.00041290553,0.002605578,0.001016004,0.6428612],"study_design_scores_gemma":[0.0014898136,0.00006574509,0.0015214598,0.00008007384,0.000042962143,0.000018866103,0.000010231865,0.99406344,0.00027554893,0.00015153234,0.0018271822,0.00045313046],"about_ca_topic_score_codex":0.000021520056,"about_ca_topic_score_gemma":0.000047890495,"teacher_disagreement_score":0.9303989,"about_ca_system_score_codex":0.00004338624,"about_ca_system_score_gemma":0.000053512238,"threshold_uncertainty_score":0.99989957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092739925,0.00015447677,0.9050463,0.000070389084,0.000091689784,0.001413466,0.0000071569134,0.00037698218,0.000099637466],"genre_scores_gemma":[0.9913453,0.00015109562,0.0058173835,0.000018771781,0.00010873066,0.0022423575,0.00028304226,0.000022139748,0.00001120743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992973,0.000015347317,0.00022100442,0.00017306836,0.00006491679,0.00022835132],"domain_scores_gemma":[0.9996063,0.000030278716,0.000051017905,0.00012893943,0.00014944804,0.000034023145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000712868,0.00013076549,0.00012044122,0.00003238234,0.00021988894,0.000038260438,0.000053429387,0.00010094299,0.000046442972],"category_scores_gemma":[0.000002997108,0.00012165117,0.000019138315,0.00022524886,0.000036737805,0.00025711473,0.000011766378,0.00007846924,0.000004244196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122929605,0.000013438615,0.00071651855,0.00006742313,0.000034199686,4.0412587e-8,0.00017508502,0.8404229,0.0012178698,0.0059703826,0.0019962809,0.14937353],"study_design_scores_gemma":[0.0003516173,0.000065262735,0.0032846774,0.000016082771,0.000023328488,0.0000011318909,0.00020397647,0.99049276,0.0035095403,0.0017820211,0.00008991282,0.00017969575],"about_ca_topic_score_codex":0.000026482852,"about_ca_topic_score_gemma":0.00013824648,"teacher_disagreement_score":0.8992289,"about_ca_system_score_codex":0.0000637817,"about_ca_system_score_gemma":0.000007816262,"threshold_uncertainty_score":0.49607906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069486233,0.0000028309735,0.943669,0.000049355633,0.00026011086,0.04800952,0.0000030992808,0.0006308239,0.0004266454],"genre_scores_gemma":[0.7618715,0.0000014435651,0.003637169,0.000037457157,0.00015462085,0.2341152,0.000055281616,0.00004982517,0.000077475575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991328,0.000017189544,0.0002377845,0.00020155747,0.00009105539,0.00031959743],"domain_scores_gemma":[0.9995231,0.000065624634,0.00007402993,0.00022639429,0.00006546371,0.000045356443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009770737,0.00015318714,0.0001600742,0.00006236661,0.0000965932,0.000027585884,0.00015689142,0.00017243375,0.0000136857925],"category_scores_gemma":[0.000015505702,0.00016487659,0.0000352113,0.00016133298,0.00004158786,0.00013567951,0.000021889922,0.00015547153,0.00002645467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023567689,0.000045826746,0.0003902015,0.00015152842,0.000028168757,4.127295e-7,0.000037537444,0.82570183,0.0008197433,0.0027297526,0.0055107004,0.1645607],"study_design_scores_gemma":[0.0010969074,0.000028462708,0.0005708404,0.000078328114,0.000008361971,9.644637e-7,0.0000066428656,0.9790375,0.003621488,0.0012174752,0.014155143,0.00017786952],"about_ca_topic_score_codex":0.0000015202867,"about_ca_topic_score_gemma":0.000007682729,"teacher_disagreement_score":0.9400318,"about_ca_system_score_codex":0.00007582168,"about_ca_system_score_gemma":0.0000062180725,"threshold_uncertainty_score":0.67234725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070414715,0.00038144737,0.9877194,0.0003205971,0.0001352005,0.00026575435,3.1539358e-7,0.00030566723,0.00383012],"genre_scores_gemma":[0.9204124,0.00020268519,0.07797227,0.00063756056,0.00019344744,0.00005831209,0.0000095089035,0.000026678626,0.00048712027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979451,0.00039128997,0.00032644393,0.00060340815,0.00024969323,0.0004841239],"domain_scores_gemma":[0.9982749,0.00019474055,0.00012588454,0.0009363385,0.00027299047,0.0001951251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061180384,0.0002877831,0.00032053038,0.000057387482,0.00072139915,0.0005090714,0.0012880261,0.00012820933,0.000022005997],"category_scores_gemma":[0.000017208651,0.0002193826,0.00007020717,0.0007425909,0.00014486257,0.00048340994,0.00030043992,0.0005176482,0.000014808197],"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.000087073204,0.00046043438,0.004885925,0.000023619428,0.00010859142,0.00001098399,0.0056169047,0.29767773,0.0007833689,0.11312113,0.0007727065,0.57645154],"study_design_scores_gemma":[0.0010871904,0.00007786706,0.0018874891,0.00009085976,0.0000056797617,0.000016715228,0.000032371205,0.99243766,0.00017071763,0.000012004711,0.003835104,0.00034636448],"about_ca_topic_score_codex":0.0000064740116,"about_ca_topic_score_gemma":0.000018197601,"teacher_disagreement_score":0.91337097,"about_ca_system_score_codex":0.00004308492,"about_ca_system_score_gemma":0.00005961812,"threshold_uncertainty_score":0.89461625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13146348,0.0031370744,0.8611684,0.00038117325,0.0010777754,0.00047038993,0.0000012221581,0.0005599035,0.0017406017],"genre_scores_gemma":[0.98959285,0.0004292381,0.008278063,0.00053703313,0.00064557017,0.00006257137,0.000036190657,0.00010021573,0.00031829646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942326,0.0006378915,0.0010448868,0.0014025758,0.00091096776,0.0017711036],"domain_scores_gemma":[0.9969139,0.00024745576,0.0002994015,0.0014226355,0.00023747378,0.0008790975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011713406,0.0007306431,0.00085409364,0.00032142235,0.00020548908,0.00038924918,0.0017882866,0.0007376746,0.000017870221],"category_scores_gemma":[0.000014174517,0.00069807324,0.0002472907,0.0019890666,0.00016735295,0.0006038023,0.00034830126,0.0013070613,0.000038999297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008837041,0.00022327404,0.0007731345,0.000010250285,0.000028525645,0.000897612,0.00026846176,0.9315145,0.00003105295,0.0041716234,0.0012709785,0.060722224],"study_design_scores_gemma":[0.001979603,0.00016249277,0.0005486361,0.0002634668,0.000018547094,0.00014327774,0.00007736715,0.99230576,0.000065343556,0.00013427493,0.0034639793,0.0008372665],"about_ca_topic_score_codex":0.00024070544,"about_ca_topic_score_gemma":0.00016181591,"teacher_disagreement_score":0.8581293,"about_ca_system_score_codex":0.0002650063,"about_ca_system_score_gemma":0.0002024625,"threshold_uncertainty_score":0.99954706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009663032,0.004291804,0.99014646,0.0009139974,0.0014650507,0.0014995484,0.0000034174434,0.00045286267,0.0002605856],"genre_scores_gemma":[0.88128793,0.0014467323,0.11373166,0.0013154164,0.0013436502,0.00059407763,0.00003677466,0.000115550974,0.00012822625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950042,0.00021699489,0.0011811905,0.0012123178,0.00053375424,0.0018515526],"domain_scores_gemma":[0.9940148,0.0033455777,0.0005039256,0.0015500693,0.00024499604,0.00034065885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021206816,0.0006278012,0.00066076836,0.00020157616,0.0004974907,0.00045451053,0.0023078064,0.00082699215,0.000024481178],"category_scores_gemma":[0.000059766055,0.00052873616,0.00026593189,0.002051584,0.00030141865,0.0005024176,0.0005206385,0.0010875607,0.0000060842262],"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.00012303262,0.00011661353,0.00034980642,0.00001274985,0.000045829023,0.000029083496,0.00024775535,0.43168777,0.0000050364965,0.121748775,0.0005356093,0.44509792],"study_design_scores_gemma":[0.0012331869,0.00012695488,0.00082679285,0.0003155678,0.000029166296,0.00002915902,0.0000720088,0.9879397,0.00002324378,0.0045879968,0.004190893,0.0006253272],"about_ca_topic_score_codex":0.00003353097,"about_ca_topic_score_gemma":0.0004968567,"teacher_disagreement_score":0.8803216,"about_ca_system_score_codex":0.00020528072,"about_ca_system_score_gemma":0.00012508177,"threshold_uncertainty_score":0.9997164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054732174,0.0008997786,0.9399664,0.0001562516,0.0011001001,0.00024885932,0.0000057408324,0.0010137045,0.0018770022],"genre_scores_gemma":[0.9720958,0.000121452395,0.026478037,0.00012196818,0.0008338878,0.000024027038,0.00010174236,0.000065038184,0.00015804375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960792,0.00026662135,0.00094992504,0.00089441467,0.0005977071,0.0012121021],"domain_scores_gemma":[0.9970779,0.00047618436,0.0005710623,0.0013854165,0.0002808185,0.0002086387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004980593,0.00050711253,0.00069210364,0.00018210978,0.00029352691,0.00019371667,0.0015974691,0.00044369767,0.000012375854],"category_scores_gemma":[0.00001344844,0.0005111284,0.00027140154,0.0017866875,0.0001670331,0.00036402929,0.0005179775,0.000611196,0.00000944228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146661405,0.00019960389,0.002813643,0.000014080493,0.000046069857,0.000053316886,0.000037423528,0.95196134,0.000112198104,0.037502818,0.0024794878,0.004765368],"study_design_scores_gemma":[0.00066868024,0.00006338768,0.0028184846,0.00011002653,0.00002867396,0.000034261157,0.000014717006,0.99327886,0.00031290314,0.00011703196,0.002015282,0.0005376875],"about_ca_topic_score_codex":0.00014979397,"about_ca_topic_score_gemma":0.00005112438,"teacher_disagreement_score":0.91736364,"about_ca_system_score_codex":0.00012246022,"about_ca_system_score_gemma":0.000057718975,"threshold_uncertainty_score":0.99973404},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02903289,0.00041432297,0.96757096,0.00010553889,0.00029690305,0.0013694507,0.0000025727506,0.0003103026,0.0008970357],"genre_scores_gemma":[0.9705875,0.00006451045,0.027631257,0.000039417802,0.00046129632,0.001066448,0.000013999988,0.000042916603,0.00009263727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978182,0.00016491652,0.0004374143,0.000536471,0.00031410978,0.0007289083],"domain_scores_gemma":[0.9979001,0.00030233446,0.00014606702,0.0013224666,0.00015411376,0.00017486804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010343265,0.00023540782,0.00031487682,0.00026713574,0.00019592677,0.00021539621,0.0021270977,0.00023152422,0.0000024115625],"category_scores_gemma":[0.0000059355343,0.00023202952,0.00008010789,0.0008300574,0.00005706008,0.0003518324,0.00027490495,0.0005787432,0.0000083706045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018114622,0.0001525712,0.000022405044,0.000018408453,0.000004665785,0.000003335675,0.00027078524,0.9698255,0.0002143614,0.004208866,0.0005141666,0.024746811],"study_design_scores_gemma":[0.00044871258,0.00009787807,0.00006805548,0.00011040469,0.0000017798085,0.0000060965695,0.000053370735,0.99673367,0.00064339675,0.000015407943,0.0015501528,0.00027108533],"about_ca_topic_score_codex":0.00004068094,"about_ca_topic_score_gemma":0.0001462757,"teacher_disagreement_score":0.9415546,"about_ca_system_score_codex":0.00029871523,"about_ca_system_score_gemma":0.00010279492,"threshold_uncertainty_score":0.9461889},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40491655,0.0004018871,0.59037185,0.000019120604,0.0011850769,0.00053508446,0.0000036680535,0.0013896914,0.0011770925],"genre_scores_gemma":[0.9887724,0.0014250136,0.007193838,0.000114970346,0.0016276587,0.00009350847,0.00023883865,0.0004285305,0.000105253865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949087,0.00014060535,0.0013802932,0.00090847147,0.0005357021,0.002126257],"domain_scores_gemma":[0.9976352,0.00064093765,0.00026465612,0.0008698042,0.00014146503,0.0004479624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010854191,0.0009122653,0.0010349372,0.00050058187,0.00023566771,0.00012789587,0.0006558965,0.00097006396,0.00009132019],"category_scores_gemma":[0.000016942608,0.0010790522,0.00024180616,0.0022049942,0.00018195392,0.00047146197,0.00006386977,0.0014088692,0.000049050803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014856011,0.00009562269,0.0006903807,0.000058062153,0.00005331977,0.00009502202,0.00008249703,0.94626254,0.0004989986,0.00025233987,0.0005956897,0.051166955],"study_design_scores_gemma":[0.0017146942,0.000051347444,0.0005629648,0.00048839784,0.00004055752,0.000011048575,0.000056778605,0.99528134,0.0005239353,0.00001968845,0.0001292247,0.0011200169],"about_ca_topic_score_codex":0.00003272806,"about_ca_topic_score_gemma":0.00039047824,"teacher_disagreement_score":0.58385587,"about_ca_system_score_codex":0.0008237296,"about_ca_system_score_gemma":0.0000681155,"threshold_uncertainty_score":0.99916595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07503849,0.0005709813,0.91974163,0.00039201757,0.0017880278,0.0011541276,0.000005353681,0.0009106167,0.00039872815],"genre_scores_gemma":[0.9676257,0.0004796224,0.027689632,0.0009217355,0.0024621699,0.0003954482,0.00004544972,0.00012632292,0.00025393962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99425864,0.00031882248,0.001019031,0.0016052014,0.0006299605,0.0021683315],"domain_scores_gemma":[0.9955525,0.0013815053,0.00039421316,0.0017432438,0.00029353655,0.0006350097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008489008,0.0007231778,0.0009036665,0.00021044427,0.0012132635,0.00029528214,0.0021875878,0.0006664305,0.00001739168],"category_scores_gemma":[0.00004908011,0.0007218437,0.0005313749,0.0013498106,0.0004923401,0.0005708839,0.0007576662,0.0013067262,0.000022307591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022968305,0.00052931166,0.020926123,0.00005640366,0.00028908538,0.00048993947,0.000726636,0.63809943,0.000080113736,0.07379312,0.006539241,0.25824088],"study_design_scores_gemma":[0.0014984186,0.00015810499,0.0047627804,0.00012196171,0.000029041397,0.00025361066,0.000019518902,0.990005,0.00002764209,0.00021623276,0.0020605759,0.0008471075],"about_ca_topic_score_codex":0.00006008715,"about_ca_topic_score_gemma":0.00004795813,"teacher_disagreement_score":0.8925872,"about_ca_system_score_codex":0.000101101636,"about_ca_system_score_gemma":0.00011572848,"threshold_uncertainty_score":0.9995233},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006537117,0.0010136915,0.98937094,0.00006042911,0.00029745811,0.00068954483,0.0000018599566,0.00033919362,0.001689745],"genre_scores_gemma":[0.99319834,0.0002815814,0.005489565,0.00007197295,0.0005590692,0.00011201475,0.000014755747,0.00011498011,0.00015771526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984749,0.0001220751,0.0004911533,0.00025092388,0.00018726714,0.00047366478],"domain_scores_gemma":[0.9988473,0.00036491983,0.00014171221,0.00049453415,0.000071353556,0.00008018389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037546834,0.0002985235,0.0003426442,0.00006111214,0.00010942234,0.000032747314,0.00034554407,0.00023770372,0.000045886783],"category_scores_gemma":[0.000006182905,0.00023881128,0.00008671894,0.0003985307,0.00006860741,0.00014538964,0.000037493348,0.0004146161,0.00002000734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020915493,0.000025639305,0.00001853157,0.000026121297,0.000041867177,0.0000022682611,0.00010642948,0.97356576,0.0005249885,0.005355266,0.0029767544,0.017335486],"study_design_scores_gemma":[0.00028445676,0.000035692836,0.000007555783,0.00019625513,0.000018036351,0.0000026858427,0.000028874289,0.9960275,0.0025503817,0.00012208738,0.00047496962,0.0002514877],"about_ca_topic_score_codex":0.0000049321206,"about_ca_topic_score_gemma":0.0000109689445,"teacher_disagreement_score":0.98666126,"about_ca_system_score_codex":0.000104428684,"about_ca_system_score_gemma":0.000012828425,"threshold_uncertainty_score":0.9738441},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113589,0.0021512054,0.877523,0.000011765981,0.0037626512,0.001476121,0.000053297077,0.0010859976,0.00034696306],"genre_scores_gemma":[0.9865822,0.0002834362,0.010275438,0.00028483314,0.0015851145,0.0005029414,0.00017128397,0.00029298398,0.00002173678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951832,0.00016582821,0.0011602561,0.0010390965,0.0005142023,0.0019373844],"domain_scores_gemma":[0.9967197,0.0011309317,0.00012515094,0.0011361159,0.00025036166,0.00063769345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073215057,0.0009393417,0.0011533315,0.00016680293,0.0003469466,0.00016792775,0.0007411779,0.001060832,0.00019294441],"category_scores_gemma":[0.00004356916,0.0009767183,0.0005710175,0.0005675977,0.00043558754,0.00023849751,0.0001626091,0.00097209855,0.000026212843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082162605,0.0004107172,0.00052556937,0.00013423618,0.00031198817,0.0001465429,0.00020968079,0.5876963,0.00006289695,0.00041074806,0.0022307476,0.40703896],"study_design_scores_gemma":[0.004427785,0.0002767268,0.00027768675,0.00029433327,0.00018587575,0.000050355775,0.000024348554,0.9911459,0.0010660795,0.00041635495,0.00077563844,0.0010589246],"about_ca_topic_score_codex":0.000045876128,"about_ca_topic_score_gemma":0.00033468637,"teacher_disagreement_score":0.87299323,"about_ca_system_score_codex":0.0002858544,"about_ca_system_score_gemma":0.00010179011,"threshold_uncertainty_score":0.99926835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013193253,0.00037002587,0.98121554,0.00022729869,0.00031723836,0.002547701,0.0000022535482,0.00032684955,0.0017998385],"genre_scores_gemma":[0.9894169,0.00007732471,0.0066357274,0.0010221496,0.0013072095,0.0011880469,0.000008597032,0.000037226597,0.00030679832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997444,0.00006379905,0.00055652834,0.0006893054,0.00031079704,0.0009355707],"domain_scores_gemma":[0.99812996,0.00041920244,0.0002774982,0.000772958,0.00008728109,0.00031311857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011374146,0.00028154693,0.00031472972,0.000095853895,0.00039202857,0.00031107132,0.0008269565,0.00024074604,0.00001736954],"category_scores_gemma":[0.0000061322567,0.00027310525,0.00008760147,0.00069604,0.00010498989,0.0004446909,0.0002644881,0.00044997907,0.000028296177],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049381568,0.00016716389,0.023436356,0.000089038105,0.0000730945,0.00008458014,0.0006188984,0.011174288,0.0004526151,0.059505004,0.0129734175,0.89137614],"study_design_scores_gemma":[0.0010102333,0.00010558661,0.021007767,0.00014943692,0.000023328412,0.00007337932,0.00004479281,0.87028474,0.00045220688,0.0023034085,0.10366611,0.0008790173],"about_ca_topic_score_codex":0.000048341113,"about_ca_topic_score_gemma":0.00011385511,"teacher_disagreement_score":0.97622365,"about_ca_system_score_codex":0.000045120927,"about_ca_system_score_gemma":0.00004646099,"threshold_uncertainty_score":0.9999721},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043392792,0.00027918132,0.9504018,0.00012177773,0.002685315,0.0020100467,0.000013135054,0.0007182548,0.00037771763],"genre_scores_gemma":[0.9953105,0.00007818274,0.001383057,0.00045796277,0.00097511325,0.0011637348,0.00021135292,0.000044065,0.00037606354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680173,0.00016950363,0.00086500205,0.0009299024,0.0002934018,0.00094045897],"domain_scores_gemma":[0.99738646,0.00048253435,0.00039567077,0.0008807194,0.00053739984,0.00031723556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006303627,0.00040092345,0.00052225194,0.00008320523,0.0004615716,0.00048721107,0.00083956623,0.0004244228,0.00006600394],"category_scores_gemma":[0.00001222407,0.00038208812,0.0002717924,0.0004438589,0.0001285858,0.00089350325,0.00030793768,0.0004917068,0.00002117348],"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.00009933297,0.0003944074,0.007460721,0.000060422008,0.00016838408,0.00001623062,0.000252144,0.120144665,0.000052939966,0.0071117696,0.02232155,0.84191746],"study_design_scores_gemma":[0.0010422397,0.00024701832,0.002428871,0.00014560507,0.000032638956,0.000022175058,0.00013550001,0.9944868,0.000008936574,0.00055544963,0.00051503524,0.00037970344],"about_ca_topic_score_codex":0.00009661712,"about_ca_topic_score_gemma":0.000018831452,"teacher_disagreement_score":0.95191765,"about_ca_system_score_codex":0.000119468095,"about_ca_system_score_gemma":0.00006204303,"threshold_uncertainty_score":0.9998631},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012676227,0.000067352164,0.93576115,0.00026015902,0.0019854992,0.047165465,0.000003282218,0.0014571865,0.00062366365],"genre_scores_gemma":[0.8182894,0.000002196392,0.055459216,0.00089481403,0.003099355,0.12174277,0.000034733166,0.00021336638,0.00026415242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913593,0.00042995348,0.0024780126,0.0015808298,0.0009631751,0.0031887311],"domain_scores_gemma":[0.9930631,0.001132364,0.0027442968,0.0016514639,0.0006126915,0.0007960857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027689578,0.0009858614,0.0010752616,0.00033115735,0.0011249081,0.00049286115,0.001554723,0.00077185855,0.000034180637],"category_scores_gemma":[0.00017550749,0.0009555363,0.0005970017,0.0020459238,0.00020815352,0.00034392302,0.00040278592,0.0010621841,0.000021811251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014043819,0.0005640711,0.008167401,0.0000919512,0.00006324058,0.000015470854,0.000104026396,0.9689354,0.00014959622,0.0051638964,0.0022555797,0.0143489735],"study_design_scores_gemma":[0.0021113749,0.00012729135,0.0010110666,0.00031392617,0.000038372502,0.00006779434,0.000023664119,0.98904634,0.001023067,0.0000099151675,0.00508403,0.0011431482],"about_ca_topic_score_codex":0.000052163403,"about_ca_topic_score_gemma":0.000025127487,"teacher_disagreement_score":0.88030195,"about_ca_system_score_codex":0.0004172145,"about_ca_system_score_gemma":0.00021925983,"threshold_uncertainty_score":0.9992895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038042225,0.0009191949,0.95772916,0.0001962443,0.0011484744,0.0010212635,0.000005993349,0.00045451062,0.00048295545],"genre_scores_gemma":[0.98104763,0.00016393437,0.016445344,0.00035650033,0.0011194563,0.0004866425,0.0001245584,0.000100343095,0.00015561206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494785,0.00021972184,0.001330695,0.0013208446,0.0004407839,0.0017400905],"domain_scores_gemma":[0.99679077,0.0011122883,0.0005449794,0.0010706288,0.00023649968,0.00024482366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008687206,0.0006469596,0.0007884384,0.00023114652,0.00036764654,0.00041035216,0.0012614299,0.00064037036,0.000010277659],"category_scores_gemma":[0.000027290815,0.00068720663,0.0002940523,0.0011344656,0.00013242314,0.0007437594,0.0004124179,0.0006123348,0.0000050340714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010370841,0.00023114227,0.001731178,0.000021279613,0.000030841566,0.000050295166,0.00015045892,0.4754481,0.00010192306,0.16717377,0.00091514847,0.35404214],"study_design_scores_gemma":[0.0027749324,0.00011399957,0.002145276,0.0002518005,0.000018581837,0.000027538252,0.00004579119,0.9915033,0.0000670628,0.0009627396,0.0013198624,0.0007691292],"about_ca_topic_score_codex":0.00022204765,"about_ca_topic_score_gemma":0.0020307314,"teacher_disagreement_score":0.9430054,"about_ca_system_score_codex":0.00030789556,"about_ca_system_score_gemma":0.00010817198,"threshold_uncertainty_score":0.9995579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026404375,0.0008846346,0.9679671,0.0023245479,0.0004086401,0.0004883875,0.0000073603483,0.00038211796,0.0011328597],"genre_scores_gemma":[0.9934734,0.00011751926,0.004551481,0.0005470203,0.00039933124,0.00006219664,0.00074130454,0.00003918604,0.00006856922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956583,0.0008113246,0.0007715182,0.00109962,0.00066767447,0.0009915765],"domain_scores_gemma":[0.99325675,0.00071090175,0.00025400732,0.005383483,0.0002328357,0.00016201733],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013108747,0.00034896444,0.0004225943,0.00022854704,0.00027732534,0.0004778805,0.006668338,0.00033866207,0.000048047503],"category_scores_gemma":[0.000026470801,0.00036291024,0.00006875251,0.0025931778,0.0000959849,0.001060733,0.0026130204,0.0009925298,0.000023076482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051474013,0.00052411185,0.06520628,0.00003454652,0.000018719813,0.000021141906,0.000038977643,0.82006586,0.000020764355,0.010924394,0.0074533867,0.09564036],"study_design_scores_gemma":[0.0007243332,0.000011195947,0.12797035,0.000079591424,0.000004700527,0.0000021641983,0.000005043604,0.8691475,0.000013790432,0.00030912898,0.0014241504,0.00030808127],"about_ca_topic_score_codex":0.0011574439,"about_ca_topic_score_gemma":0.0074985027,"teacher_disagreement_score":0.96706903,"about_ca_system_score_codex":0.00011090153,"about_ca_system_score_gemma":0.00015283035,"threshold_uncertainty_score":0.9998823},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012966883,0.0001178023,0.9019873,0.00029454994,0.000088325265,0.09544251,7.4241444e-7,0.0003772982,0.0015617717],"genre_scores_gemma":[0.28514203,0.000058785932,0.120137125,0.000820884,0.0014357299,0.5914657,0.000015845095,0.00011488438,0.0008089865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757403,0.00026716336,0.00045228514,0.00069470954,0.0003374437,0.0006743922],"domain_scores_gemma":[0.9987716,0.00020631129,0.00016340254,0.00057129445,0.00008105559,0.00020630848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005833095,0.00034310122,0.00034860076,0.00007503614,0.00034039293,0.00048292862,0.0007660514,0.0002729689,0.000022655573],"category_scores_gemma":[0.0000024954081,0.00029785934,0.00007907552,0.00051456725,0.000088884764,0.00048642207,0.00017549498,0.0003673642,0.0000092052],"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.00011668052,0.00021103816,0.0014002005,0.00007636005,0.00001981607,0.000070955786,0.00006895861,0.049174562,0.00019294566,0.033898003,0.030353831,0.88441664],"study_design_scores_gemma":[0.0014666021,0.00013098624,0.0018342937,0.00021357181,0.0000063371053,0.00003643391,0.000002389112,0.92490906,0.00041565523,0.001998337,0.06856579,0.00042054168],"about_ca_topic_score_codex":0.00009999318,"about_ca_topic_score_gemma":0.000012439798,"teacher_disagreement_score":0.8839961,"about_ca_system_score_codex":0.000062205894,"about_ca_system_score_gemma":0.00007252161,"threshold_uncertainty_score":0.99994737},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3285787,0.002563727,0.66441756,0.0000136361305,0.00093021244,0.0028766245,0.0000034621582,0.00024092536,0.0003751259],"genre_scores_gemma":[0.98875844,0.00035658505,0.007569536,0.00005285086,0.000832631,0.0020118102,0.00002916035,0.00006438687,0.00032458684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966273,0.00015829995,0.0008031886,0.00096808065,0.00046493366,0.0009782161],"domain_scores_gemma":[0.99742275,0.00037379842,0.0004560123,0.0013000856,0.00030744995,0.00013988065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060848496,0.0004592892,0.00070300733,0.0001176647,0.0003397299,0.00015309996,0.0013497103,0.00028044474,0.000009995873],"category_scores_gemma":[0.000005938314,0.00043514627,0.00018743883,0.00093158253,0.000115405266,0.0006054488,0.00041641513,0.00046238597,0.000004531117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013547341,0.00068066287,0.0014368695,0.000018556451,0.000078506455,0.000005615443,0.00031869736,0.73661983,0.0000073356086,0.00028944985,0.0020769564,0.25833207],"study_design_scores_gemma":[0.002422179,0.0014971445,0.004418592,0.00006629751,0.000050376424,0.000008169067,0.00010426539,0.9889174,0.00009614859,0.00007346525,0.0018822242,0.0004637453],"about_ca_topic_score_codex":0.000022575683,"about_ca_topic_score_gemma":0.0001408595,"teacher_disagreement_score":0.66017973,"about_ca_system_score_codex":0.00010119503,"about_ca_system_score_gemma":0.00007183119,"threshold_uncertainty_score":0.99981004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04254776,0.0034046485,0.95080847,0.00070038816,0.0007207286,0.0010168712,0.0000049506634,0.00056090247,0.00023529655],"genre_scores_gemma":[0.9112948,0.0015599095,0.08466827,0.00093151384,0.0009736838,0.00017158382,0.00011973517,0.00006477281,0.00021570944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950248,0.0005534789,0.0010999247,0.0011128933,0.0007744342,0.001434496],"domain_scores_gemma":[0.994917,0.0013621282,0.00048790572,0.002230181,0.00056686887,0.0004359214],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014248913,0.00051706086,0.00062832347,0.00021314016,0.0007202639,0.0010415796,0.0029618863,0.0005458509,0.000025663734],"category_scores_gemma":[0.00009944603,0.0005386496,0.0003485584,0.0010268622,0.00019178323,0.0009894223,0.00052756,0.00092796027,0.000028006898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008176745,0.000101380945,0.00075085205,0.000010100207,0.000047078847,0.000006770168,0.00025709104,0.67364675,0.000118124604,0.006044468,0.00010234253,0.31883326],"study_design_scores_gemma":[0.0013310476,0.00014671194,0.009051377,0.00010061326,0.000013006019,0.00001038873,0.00001544826,0.98585,0.000121396464,0.00049196853,0.002256808,0.00061123737],"about_ca_topic_score_codex":0.000046137164,"about_ca_topic_score_gemma":0.00009277712,"teacher_disagreement_score":0.86874706,"about_ca_system_score_codex":0.00021153284,"about_ca_system_score_gemma":0.00012870361,"threshold_uncertainty_score":0.9999954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98621285,0.00029692994,0.005668142,0.000019883368,0.0015933088,0.005040424,0.000002808909,0.00020645956,0.0009591705],"genre_scores_gemma":[0.99641705,0.00006228367,0.00019072366,0.000050464718,0.00079211505,0.0023722644,0.0000070542487,0.0000776361,0.000030408804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977835,0.00008863117,0.0007487041,0.00034435597,0.0003121885,0.0007226233],"domain_scores_gemma":[0.99867857,0.0002496184,0.00015260656,0.00075898157,0.00007425935,0.00008596299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010553849,0.00034979888,0.00050331536,0.0000914558,0.00010807148,0.00007681696,0.00061942526,0.0003505303,0.000075640244],"category_scores_gemma":[0.000027111055,0.0002919832,0.00012972181,0.0005477063,0.00017463704,0.00025223292,0.00017192701,0.0016514404,0.000008495821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006842648,0.00038085436,0.08701745,0.0014394422,0.00022515305,0.00003159455,0.0063618226,0.77258915,0.033811916,0.0012916184,0.0012287956,0.09493796],"study_design_scores_gemma":[0.0012150373,0.000058826005,0.007991193,0.00071519415,0.000019030304,0.000011413878,0.000066412256,0.97014326,0.016992247,0.00007527214,0.0022968412,0.0004152766],"about_ca_topic_score_codex":0.00004103119,"about_ca_topic_score_gemma":0.0023468998,"teacher_disagreement_score":0.19755411,"about_ca_system_score_codex":0.000091187605,"about_ca_system_score_gemma":0.000035099994,"threshold_uncertainty_score":0.9999532},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009368439,0.00020880623,0.9820435,0.0003541409,0.00024222195,0.00011587735,0.0000021173391,0.00031628422,0.007348602],"genre_scores_gemma":[0.9748943,0.00020223598,0.02316863,0.0011371231,0.00027568114,0.0000033789531,0.0001668425,0.0000086522205,0.00014319368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980639,0.00007270618,0.00041910817,0.00044826037,0.0004956253,0.0005003865],"domain_scores_gemma":[0.9977,0.000059380356,0.00023903018,0.0017716447,0.00011590273,0.00011404361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087258616,0.0002004242,0.0002748523,0.0001664811,0.00028905226,0.0003756552,0.0019791499,0.000113729526,0.000043246226],"category_scores_gemma":[0.000012909597,0.00019284232,0.0000723021,0.0025435847,0.000030464595,0.0028989941,0.0004096351,0.00024581054,0.000022542687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032570135,0.000014791506,0.0035399934,0.000002094415,0.00007134281,0.0000023029854,0.00007323146,0.898509,2.5878205e-7,0.0036960044,0.008623701,0.08546399],"study_design_scores_gemma":[0.00021427816,0.000017556578,0.03766387,0.00002386198,0.00008138254,0.0000033309523,0.0000062939157,0.96056026,0.0000033167307,0.000078769255,0.0011151814,0.00023192455],"about_ca_topic_score_codex":0.0000046585014,"about_ca_topic_score_gemma":0.000007759088,"teacher_disagreement_score":0.9655258,"about_ca_system_score_codex":0.000057274447,"about_ca_system_score_gemma":0.00004600988,"threshold_uncertainty_score":0.78638816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028558758,0.00044978494,0.9881223,0.0007093606,0.0031758458,0.0033666824,0.0000029362295,0.0009754227,0.00034180423],"genre_scores_gemma":[0.96248084,0.0002965197,0.028634561,0.0016655615,0.0029567385,0.003120782,0.00003734439,0.00015619962,0.00065142306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944525,0.00038119408,0.0010298477,0.0015268541,0.0005663257,0.002043318],"domain_scores_gemma":[0.99543667,0.0008896017,0.0004893294,0.0020782999,0.00048246907,0.00062364514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010091275,0.0007797984,0.0009529007,0.00016094424,0.00057838554,0.0009353567,0.0025765165,0.0006771795,0.00012628279],"category_scores_gemma":[0.000026592437,0.00074315764,0.000419887,0.0010586922,0.00018392406,0.0011824942,0.0007703442,0.0008551988,0.00013466351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046309164,0.00019873907,0.00014576917,0.000050150313,0.00016378726,0.00003537142,0.00023368328,0.48246866,0.00009699819,0.041124195,0.20604537,0.26939097],"study_design_scores_gemma":[0.0010914713,0.0002290891,0.0004982937,0.00017925036,0.000031845895,0.00003598953,0.0000340876,0.99375755,0.000115779796,0.0014578396,0.0016613976,0.00090738054],"about_ca_topic_score_codex":0.00009589171,"about_ca_topic_score_gemma":0.00003082682,"teacher_disagreement_score":0.959625,"about_ca_system_score_codex":0.00019262245,"about_ca_system_score_gemma":0.0001501785,"threshold_uncertainty_score":0.99950194},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021612447,0.0004295435,0.9721467,0.00041464358,0.00064644037,0.0035393792,0.000002402297,0.00044424355,0.0007642277],"genre_scores_gemma":[0.9930559,0.000019180427,0.0028157798,0.000986218,0.0012128737,0.0016843725,0.000017335376,0.00007589672,0.00013243697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954178,0.00037423265,0.00081872445,0.0011191566,0.0007811057,0.0014890126],"domain_scores_gemma":[0.9974247,0.00047498345,0.00040585498,0.0011542577,0.0002116193,0.00032857296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010266011,0.0006337798,0.00082513,0.00016804543,0.0003024289,0.00047109748,0.0014063776,0.00048646913,0.000026804339],"category_scores_gemma":[0.0000086731225,0.0005308424,0.00016690623,0.0014374552,0.00012335142,0.00056450226,0.00012678656,0.0008448124,0.000009969426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021550516,0.00017954622,0.033124402,0.000026121223,0.000016108475,0.00021316942,0.000029784454,0.9389827,0.000035196153,0.0033015832,0.004020787,0.019855054],"study_design_scores_gemma":[0.004439159,0.00018016959,0.009097023,0.0008069798,0.000015670086,0.000019575302,0.0000056808517,0.98271024,0.00013736692,0.00016227704,0.0016834391,0.0007424346],"about_ca_topic_score_codex":0.0006322079,"about_ca_topic_score_gemma":0.0018759766,"teacher_disagreement_score":0.9714435,"about_ca_system_score_codex":0.00028168282,"about_ca_system_score_gemma":0.00037518123,"threshold_uncertainty_score":0.9997143},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3599148,0.00018059066,0.63657516,0.00019644522,0.0017784833,0.00075674715,0.000002851541,0.00013559159,0.00045934375],"genre_scores_gemma":[0.99487585,0.00025818188,0.0021568255,0.00059461757,0.0017278921,0.00019901972,0.000030804,0.000051543917,0.00010524065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968886,0.000056358185,0.0005505428,0.00095630536,0.00028144557,0.0012667615],"domain_scores_gemma":[0.99831474,0.0004744813,0.00024198892,0.0005092043,0.00021818261,0.00024141581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007210117,0.0004355296,0.0005131457,0.00020129026,0.00036627686,0.0005609028,0.0011266794,0.00031251952,0.000017709439],"category_scores_gemma":[0.00002768283,0.00043603138,0.00017054337,0.00083806243,0.00014009647,0.0009647055,0.00046601737,0.001046915,0.0000032167031],"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.0002414026,0.00022426348,0.00264413,0.000031257536,0.000080666825,0.000053246946,0.00037158304,0.35490313,0.000118388336,0.0028415895,0.0010137869,0.63747656],"study_design_scores_gemma":[0.0017790775,0.00023177353,0.007510209,0.000173858,0.000018159439,0.00003101035,0.000030125964,0.9888817,0.00036272212,0.00011915036,0.000292558,0.00056962884],"about_ca_topic_score_codex":0.000041643212,"about_ca_topic_score_gemma":0.00033541003,"teacher_disagreement_score":0.6369069,"about_ca_system_score_codex":0.00007837182,"about_ca_system_score_gemma":0.00008819586,"threshold_uncertainty_score":0.99980915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22126384,0.00053649896,0.77634746,0.0001245339,0.00043387368,0.000738778,0.0000012890562,0.00010649019,0.0004472292],"genre_scores_gemma":[0.99418175,0.0006028268,0.004168045,0.00013736574,0.00035279713,0.00032629125,0.00003947393,0.000027532138,0.00016393258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975909,0.00021062807,0.0006585291,0.0005562969,0.0004448748,0.00053876196],"domain_scores_gemma":[0.9985717,0.00020935715,0.00024527806,0.0005365298,0.00034024369,0.0000969108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014097153,0.00027241983,0.00042939885,0.00010273463,0.00014201376,0.00010071086,0.0006460242,0.00023641817,0.0000809411],"category_scores_gemma":[0.000014390189,0.00026992703,0.000116918636,0.0007196789,0.00007204855,0.0005467415,0.00006649909,0.00026056377,0.0000038701623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007072843,0.000049279846,0.0009896981,0.00000771088,0.000013711222,4.7339176e-7,0.000058840607,0.51439977,0.0000014160175,0.0006808542,0.00019691595,0.4835306],"study_design_scores_gemma":[0.0027259234,0.000119021635,0.0009272315,0.00027053853,0.000036561494,0.00000366354,0.000012135835,0.99526155,0.000022870265,0.00003902199,0.0002985412,0.00028294887],"about_ca_topic_score_codex":0.00001159105,"about_ca_topic_score_gemma":0.000030901374,"teacher_disagreement_score":0.7729179,"about_ca_system_score_codex":0.00010237136,"about_ca_system_score_gemma":0.000113667105,"threshold_uncertainty_score":0.99997526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029360604,0.00015988816,0.9674184,0.0002653142,0.0003292092,0.0020416593,0.0000023192981,0.00020066304,0.00022196991],"genre_scores_gemma":[0.97562504,0.00013578866,0.023347875,0.0002458021,0.00025872502,0.00023739408,0.000036253037,0.000033995508,0.000079136364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973131,0.0002088177,0.0006573139,0.00072021235,0.0003392119,0.00076138583],"domain_scores_gemma":[0.9983625,0.00047685517,0.00023462731,0.00046530264,0.00012967396,0.0003310673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094080647,0.00031142583,0.00039525342,0.00018259362,0.00021998085,0.00023962196,0.000471343,0.0003356031,0.000010391295],"category_scores_gemma":[0.00004443839,0.0002976371,0.00005493146,0.0005960042,0.00012793475,0.00054219604,0.0002265954,0.0004761547,0.0000034207665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005187763,0.00035802927,0.07969959,0.00009179186,0.000033764514,0.00044024657,0.00076729717,0.4619561,0.00020904542,0.046068184,0.001070524,0.40878662],"study_design_scores_gemma":[0.0018603927,0.00009512283,0.03841193,0.00028810778,0.000005472138,0.000034845976,0.000051524206,0.95804775,0.000082208986,0.00024722383,0.00051837985,0.0003570172],"about_ca_topic_score_codex":0.00013994779,"about_ca_topic_score_gemma":0.00030784227,"teacher_disagreement_score":0.94626445,"about_ca_system_score_codex":0.00009938418,"about_ca_system_score_gemma":0.000048289385,"threshold_uncertainty_score":0.99994755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020264765,0.00096886896,0.97399175,0.0030660296,0.00021778842,0.0010285272,8.6757933e-7,0.00029772503,0.00016369669],"genre_scores_gemma":[0.98584574,0.0006178344,0.01023422,0.0017180972,0.00028061282,0.0007526986,0.000039462215,0.00003363712,0.0004776817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981331,0.00031664528,0.0003763415,0.00056722376,0.00015927012,0.00044739887],"domain_scores_gemma":[0.998069,0.000547707,0.00018020894,0.00054828654,0.00049355207,0.0001612502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004366271,0.00027172823,0.00027510585,0.00009829172,0.00069492083,0.00042942975,0.0006250092,0.00020675638,0.000031297182],"category_scores_gemma":[0.000042110543,0.00025642506,0.000070802744,0.00067836506,0.000099721874,0.00058525044,0.00022320259,0.0003823152,0.000008764763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003135889,0.00008878113,0.0014515033,0.000012362727,0.000043805587,3.1608027e-7,0.0003252444,0.7306079,0.0004073463,0.021329923,0.013424191,0.23227721],"study_design_scores_gemma":[0.000825094,0.00010020039,0.0021830753,0.000089296016,0.0000116254305,0.0000023887787,0.000028471875,0.9887632,0.00022950937,0.000031091386,0.0074218153,0.0003142116],"about_ca_topic_score_codex":0.00002847629,"about_ca_topic_score_gemma":0.00014342197,"teacher_disagreement_score":0.965581,"about_ca_system_score_codex":0.00008155277,"about_ca_system_score_gemma":0.000056904886,"threshold_uncertainty_score":0.9999888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30827355,0.00034774226,0.6882752,0.000007725658,0.0005803833,0.00038184927,0.000005758841,0.0009010709,0.0012267206],"genre_scores_gemma":[0.9971618,0.00027302746,0.0023238587,0.000027444126,0.00008272736,0.00002804429,0.000018133711,0.000039602575,0.000045345325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988921,0.000044463817,0.00041329465,0.00017276521,0.00011442856,0.00036294563],"domain_scores_gemma":[0.99947506,0.000055038006,0.000060084454,0.000303478,0.00007203205,0.000034292225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014362001,0.00017607688,0.0002732721,0.00009666199,0.000041688723,0.00001891132,0.00015592335,0.00026950453,0.000045639517],"category_scores_gemma":[0.00003133298,0.00017859752,0.000050738963,0.00055760593,0.00013053785,0.00018617413,0.000047545884,0.00020275565,0.0000035530998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017087543,0.000023619976,0.04128057,0.000055284483,0.000014198519,0.0000036916626,0.00031529655,0.9483645,0.000008173473,0.0042424942,0.00079629425,0.004878806],"study_design_scores_gemma":[0.00018007835,0.00002521517,0.009904817,0.000121544115,0.000009667767,0.0000017527892,0.00012356997,0.98714226,0.0012895681,0.00057858386,0.0004004293,0.00022252837],"about_ca_topic_score_codex":0.00018006875,"about_ca_topic_score_gemma":0.00042777395,"teacher_disagreement_score":0.68888825,"about_ca_system_score_codex":0.000059243604,"about_ca_system_score_gemma":0.000010397254,"threshold_uncertainty_score":0.7282995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28611657,0.003748864,0.7028103,0.00087422173,0.0006091038,0.0012525829,0.0000035984006,0.00077036786,0.0038143836],"genre_scores_gemma":[0.99401987,0.0007187325,0.0016520732,0.0003127412,0.001038471,0.00063669216,0.00016702343,0.000114080576,0.0013403149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934811,0.0009793942,0.001313138,0.0013817279,0.0010290728,0.0018155561],"domain_scores_gemma":[0.9946247,0.0009123131,0.00044481718,0.003360148,0.0003344016,0.00032362706],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020413909,0.0006291311,0.0007397591,0.00044101462,0.00056309596,0.001083251,0.0045140916,0.0006952858,0.0000551964],"category_scores_gemma":[0.000024741634,0.0006656386,0.00022643384,0.0031078206,0.00043058515,0.0011574016,0.0014305512,0.0017233029,0.000071017275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000590749,0.00030811664,0.02024537,0.000018297476,0.000023592074,0.00005010359,0.00013995731,0.8720894,0.00008748856,0.023916557,0.0058237473,0.077238314],"study_design_scores_gemma":[0.0012299458,0.00007163397,0.02819683,0.00015082025,0.0000060332427,0.000028467166,0.00003184564,0.9565648,0.0001468158,0.00032495934,0.012556549,0.00069129793],"about_ca_topic_score_codex":0.0005774796,"about_ca_topic_score_gemma":0.00077164604,"teacher_disagreement_score":0.70790327,"about_ca_system_score_codex":0.0004806043,"about_ca_system_score_gemma":0.00017399629,"threshold_uncertainty_score":0.99995375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007411219,0.0008736375,0.9842654,0.0003321717,0.0040808404,0.0020515926,0.00003475839,0.00086616905,0.00008422109],"genre_scores_gemma":[0.81003404,0.00005864955,0.18613175,0.00052792265,0.0017290324,0.0009902617,0.00022946682,0.00018325991,0.00011564612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940805,0.00031726918,0.0012977591,0.0016263892,0.0006643056,0.0020137972],"domain_scores_gemma":[0.99545074,0.0015490424,0.0005578711,0.0011912646,0.000659189,0.0005918933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018673069,0.0007939252,0.0010926124,0.00043010566,0.0004175989,0.0005110079,0.0015574998,0.0007274215,0.0000026767189],"category_scores_gemma":[0.0001021756,0.00084458396,0.00042753125,0.0013544714,0.00015549744,0.0006186076,0.00027692763,0.00069251406,0.0000029489604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020580855,0.00022081367,0.0006940855,0.00003798093,0.000050311242,0.000031237294,0.0002027195,0.86993134,0.000022413777,0.0010049312,0.0010796477,0.12651873],"study_design_scores_gemma":[0.006475036,0.00029197923,0.00025461707,0.00040191913,0.000037892016,0.000022219914,0.000099141726,0.98984987,0.00017758476,0.00009975808,0.0014152006,0.00087480695],"about_ca_topic_score_codex":0.000088925306,"about_ca_topic_score_gemma":0.0003157195,"teacher_disagreement_score":0.8026228,"about_ca_system_score_codex":0.00043302617,"about_ca_system_score_gemma":0.00026205412,"threshold_uncertainty_score":0.9994005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055280165,0.022228662,0.9672914,0.0000851239,0.0011083449,0.0017869658,0.000013745863,0.0012876733,0.0006700546],"genre_scores_gemma":[0.983858,0.004690008,0.00824424,0.00018908414,0.0014608048,0.0003091668,0.00019222844,0.00020070712,0.00085574825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964057,0.00018374744,0.0009856692,0.000596535,0.000285256,0.0015430612],"domain_scores_gemma":[0.997224,0.0005869205,0.00023931485,0.0012215473,0.00042576747,0.00030244704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007085228,0.0006265696,0.00080977776,0.00016711817,0.0004449782,0.0003075531,0.0008948761,0.0005159696,0.000009620938],"category_scores_gemma":[0.000042935782,0.0006938252,0.00027500617,0.0007506031,0.000079953286,0.00031959356,0.00011757117,0.00071744586,0.000021529022],"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.00003457501,0.00009759236,0.0003980313,0.00012394498,0.00014482268,0.000043051627,0.0008428421,0.39339447,0.000100013036,0.0015203044,0.0006363899,0.602664],"study_design_scores_gemma":[0.0013446256,0.00006986118,0.0008360902,0.00026122478,0.000046945435,0.00002602759,0.0011886993,0.98647076,0.00009742274,0.00006091973,0.00884176,0.0007556595],"about_ca_topic_score_codex":0.000053953903,"about_ca_topic_score_gemma":0.000024640163,"teacher_disagreement_score":0.97833,"about_ca_system_score_codex":0.00039107192,"about_ca_system_score_gemma":0.000047071993,"threshold_uncertainty_score":0.9995513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00560121,0.000014335458,0.90313625,0.000107376494,0.00009324994,0.09075748,9.38723e-7,0.00017283624,0.000116304574],"genre_scores_gemma":[0.67414224,0.0000035302107,0.03805623,0.0002261282,0.0002755327,0.2871852,0.000003342617,0.00002352803,0.00008428464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977358,0.00022777179,0.0004051145,0.00069790834,0.00026378868,0.0006696134],"domain_scores_gemma":[0.9982502,0.00046804518,0.00020907033,0.00073822174,0.00012440865,0.00021007966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012548363,0.00029833763,0.0004630163,0.00016115051,0.00038313394,0.0003175408,0.00073074637,0.00017828008,0.00000785164],"category_scores_gemma":[0.0000129738,0.0002544016,0.00015618476,0.00096023746,0.00008153697,0.0001229826,0.0002116478,0.00020973444,0.0000054101597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001239258,0.000054624987,0.0035626322,0.000061006464,0.00009628991,0.0000015795115,0.00009690433,0.8685854,0.000009174636,0.004968086,0.00050507864,0.12193531],"study_design_scores_gemma":[0.0009866116,0.00033641513,0.004329292,0.0000598039,0.000056851663,0.000005309892,0.0000021896312,0.9896473,0.00009639819,0.00017306521,0.003959936,0.00034681856],"about_ca_topic_score_codex":0.000006908046,"about_ca_topic_score_gemma":0.0000070453175,"teacher_disagreement_score":0.86508006,"about_ca_system_score_codex":0.000032308537,"about_ca_system_score_gemma":0.000038832117,"threshold_uncertainty_score":0.9999908},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4295548,0.0040485216,0.565199,0.000057887642,0.00023848718,0.00042888644,9.3405447e-7,0.00018210696,0.00028936216],"genre_scores_gemma":[0.993119,0.005482359,0.0009938362,0.00013107818,0.00010406991,0.000055191176,0.000045088218,0.00003655677,0.000032791955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755216,0.00039197286,0.00067946845,0.00049644656,0.00031384162,0.0005661047],"domain_scores_gemma":[0.9975649,0.0004200394,0.0003486705,0.001400434,0.00013213175,0.00013379945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046739873,0.00030632096,0.0004646026,0.00018259324,0.00018657744,0.000059128677,0.0013046378,0.00030260917,0.000020468366],"category_scores_gemma":[0.00001677403,0.00028851355,0.00017270276,0.0015356061,0.00017859705,0.0004219203,0.00022487012,0.0005592392,0.000009859128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058772424,0.00019627737,0.0052300747,0.000004375696,0.000021055543,0.000013021871,0.00033510342,0.91080326,0.00000222749,0.0010558655,0.0017880017,0.08049196],"study_design_scores_gemma":[0.00071774545,0.00026953852,0.026805695,0.00017403896,0.000004470901,0.000016171416,0.000008576672,0.9715254,0.000008844692,0.00006143855,0.00014633402,0.00026179102],"about_ca_topic_score_codex":0.00003450097,"about_ca_topic_score_gemma":0.0001404619,"teacher_disagreement_score":0.56420517,"about_ca_system_score_codex":0.00019735175,"about_ca_system_score_gemma":0.00009750581,"threshold_uncertainty_score":0.9999567},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036763723,0.000108287444,0.0023815345,0.00007790975,0.9884431,0.00035560806,0.0005276628,0.00035274218,0.0073855403],"genre_scores_gemma":[0.0025501836,0.000062857034,0.0001102027,0.000122004996,0.9857095,0.000017537104,0.0031539332,0.00008720135,0.008186589],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98287934,0.00052399974,0.0016754115,0.0031532818,0.0105651505,0.0012028102],"domain_scores_gemma":[0.97722244,0.01606095,0.0010865395,0.0035610779,0.0016197945,0.00044916844],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.009137447,0.0007944801,0.0011495206,0.0006476996,0.0005847037,0.0022194928,0.0043744333,0.0020483476,0.00042331626],"category_scores_gemma":[0.009214956,0.0006447814,0.00034367153,0.0028313755,0.00025389268,0.00020579844,0.001095018,0.0028669909,0.0012512635],"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.00023849735,0.00009960179,0.00001574428,0.0000039408865,0.00007983539,0.000050690018,0.00007596286,0.0024952227,0.0000024621913,0.00002108258,0.9642586,0.03265835],"study_design_scores_gemma":[0.0008047599,0.00012976865,0.00010573305,0.00018486065,0.00005954104,2.8914297e-7,0.00009267041,0.0066248826,0.0000045389224,0.00014546089,0.9911482,0.0006993239],"about_ca_topic_score_codex":0.00064711797,"about_ca_topic_score_gemma":0.0005383774,"teacher_disagreement_score":0.031959027,"about_ca_system_score_codex":0.00028304663,"about_ca_system_score_gemma":0.00039196826,"threshold_uncertainty_score":0.99960035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046831258,0.00023450845,0.949444,0.0014011709,0.00037839604,0.0009042872,0.0000038886365,0.0001940058,0.00060847966],"genre_scores_gemma":[0.9730462,0.000106593245,0.025590215,0.0006356249,0.0004757956,0.000007016646,0.00006833427,0.000025549733,0.00004467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765676,0.00019611599,0.00049751013,0.0007175588,0.00022774866,0.00070430676],"domain_scores_gemma":[0.99875593,0.00046489103,0.00018301322,0.00025417854,0.00020810874,0.00013387171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004170758,0.00031941992,0.00050439686,0.00018674185,0.00024997172,0.0003296859,0.0002639107,0.00019128958,0.0000034156926],"category_scores_gemma":[0.000064546686,0.0003364677,0.00012405032,0.00086392957,0.00007184215,0.0004928368,0.00005733206,0.00037206602,0.0000022909967],"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.00060019083,0.00024159995,0.000370356,0.00001498957,0.00007121333,0.00021950844,0.0009995498,0.23139426,0.0002215404,0.035746627,0.00025365668,0.7298665],"study_design_scores_gemma":[0.002068213,0.00024315751,0.0035731343,0.00029499063,0.000015438382,0.000035326266,0.000043165284,0.99073756,0.0002573219,0.002283364,0.000021730539,0.00042657641],"about_ca_topic_score_codex":0.000027607854,"about_ca_topic_score_gemma":0.00019784634,"teacher_disagreement_score":0.92621493,"about_ca_system_score_codex":0.00019286353,"about_ca_system_score_gemma":0.0001107992,"threshold_uncertainty_score":0.99990875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29065025,0.0010053675,0.70593804,0.0003563889,0.000897756,0.00029206328,0.000001367466,0.00022277163,0.0006360122],"genre_scores_gemma":[0.9966248,0.000145879,0.0010995385,0.0014746065,0.0005123359,0.00002690858,0.000010629104,0.000035210014,0.00007005593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960376,0.00030520736,0.0012624697,0.0007828963,0.00052654714,0.0010852782],"domain_scores_gemma":[0.99717414,0.00074569305,0.00047953363,0.0010866792,0.00023093462,0.0002830446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00212621,0.00039569696,0.00075807166,0.0001765499,0.00012863382,0.0000939989,0.0015629504,0.0004124376,0.00001797098],"category_scores_gemma":[0.000014054348,0.00040605484,0.00018962228,0.0016437739,0.00010841765,0.00031123444,0.00033000752,0.00052401825,0.000010214316],"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.00014233292,0.00017688399,0.006540683,0.000025793046,0.000042974327,0.00006954798,0.00020238316,0.41165987,0.000052400344,0.02134579,0.00020172265,0.5595396],"study_design_scores_gemma":[0.0013058578,0.000058731777,0.011550986,0.00011181223,0.000008457377,0.000021595353,0.000034900735,0.98578495,0.00007217306,0.00024087407,0.00036204443,0.00044760405],"about_ca_topic_score_codex":0.00025497185,"about_ca_topic_score_gemma":0.0035581454,"teacher_disagreement_score":0.7059746,"about_ca_system_score_codex":0.00010035812,"about_ca_system_score_gemma":0.00007495368,"threshold_uncertainty_score":0.9998391},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043230485,0.001440593,0.95070755,0.00006616554,0.0022519843,0.001072467,0.0000052802616,0.0010483488,0.00017711632],"genre_scores_gemma":[0.9628518,0.003898206,0.026631763,0.00020750902,0.004550347,0.0003288133,0.00077153347,0.0002928371,0.00046718356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972639,0.00006562098,0.0007352548,0.0006494055,0.00033453817,0.0009512894],"domain_scores_gemma":[0.99849325,0.00013485047,0.0001905386,0.00060850754,0.00024289906,0.00032997708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018624357,0.0005983101,0.0005708208,0.00015202771,0.0004846556,0.00011544843,0.00037832547,0.0005768211,0.00004820936],"category_scores_gemma":[0.000012928547,0.0006899604,0.00019621088,0.0006673515,0.00006005341,0.00069645676,0.00005350996,0.00044821447,0.000015620924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037562066,0.000025942929,0.000035668232,0.000027542414,0.00007019179,0.0000089954,0.00014012064,0.9391409,0.004263543,0.008857957,0.010409294,0.036982242],"study_design_scores_gemma":[0.0012022863,0.00006679965,0.000024092364,0.0000703845,0.000056378147,0.000021814743,0.00002260146,0.99195546,0.004667583,0.000352176,0.0008192951,0.00074112247],"about_ca_topic_score_codex":0.000022613456,"about_ca_topic_score_gemma":0.00006930916,"teacher_disagreement_score":0.9240758,"about_ca_system_score_codex":0.00024763163,"about_ca_system_score_gemma":0.00007175238,"threshold_uncertainty_score":0.9995552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023189478,0.00025877098,0.97390974,0.000051369538,0.0002341411,0.00078939804,0.000006178238,0.0004329014,0.0011280375],"genre_scores_gemma":[0.99201703,0.00017985204,0.006684237,0.000050536753,0.00033161356,0.00032544308,0.00022647851,0.00010678256,0.00007799934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981598,0.0001862947,0.000531103,0.0003915421,0.00025839815,0.00047286396],"domain_scores_gemma":[0.99913746,0.0001677238,0.00020329088,0.00021977747,0.00015907107,0.00011267198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038673353,0.0003186848,0.00037800623,0.0001533907,0.00010593898,0.00006612627,0.00016756465,0.00024754638,0.000023632272],"category_scores_gemma":[0.000018883555,0.00032237006,0.00003243846,0.00064765406,0.00016161811,0.00031788525,0.000025842306,0.00031433924,0.0000041550616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011331815,0.000031393007,0.000727441,0.000038941867,0.000038678198,0.0000056885206,0.000077115285,0.98995596,0.0000621814,0.002381007,0.00034100548,0.0062272903],"study_design_scores_gemma":[0.0010714317,0.00007150327,0.0006113664,0.00040188563,0.000021489332,0.000010266075,0.00009212514,0.9970619,0.000059695027,0.000021438758,0.00019579791,0.00038109662],"about_ca_topic_score_codex":0.000013856111,"about_ca_topic_score_gemma":0.0000724008,"teacher_disagreement_score":0.9688276,"about_ca_system_score_codex":0.00022727999,"about_ca_system_score_gemma":0.00003881472,"threshold_uncertainty_score":0.9999228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055202488,0.0018392131,0.93655986,0.0008628906,0.0029023506,0.0006834476,0.0000027663327,0.00074919657,0.0011977698],"genre_scores_gemma":[0.99231344,0.0012431236,0.0006918082,0.0025363893,0.0017619422,0.00023167624,0.000025744741,0.00005908564,0.0011368035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956823,0.00034808897,0.0008255695,0.0011282959,0.0007204719,0.0012952688],"domain_scores_gemma":[0.99725455,0.00045036356,0.00041506797,0.0011753695,0.00024000842,0.00046466853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005472804,0.0006128252,0.0007671103,0.00013298437,0.0006941564,0.00022881961,0.0013879623,0.00045179416,0.00014058716],"category_scores_gemma":[0.000013515113,0.0006006884,0.00027775648,0.00077769737,0.00027516903,0.00066393096,0.00022243624,0.00080563116,0.000101185105],"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.0001994969,0.00031153404,0.0039497274,0.000013691498,0.0002139785,0.00023200478,0.00021409236,0.37997916,0.000067534165,0.037096158,0.0228867,0.5548359],"study_design_scores_gemma":[0.0031148696,0.00016890404,0.004718736,0.00009520076,0.000042272048,0.000082297986,0.000008725766,0.98355174,0.00002418718,0.00008873884,0.0074073705,0.00069694314],"about_ca_topic_score_codex":0.000041261792,"about_ca_topic_score_gemma":0.00003977395,"teacher_disagreement_score":0.93711096,"about_ca_system_score_codex":0.00016426083,"about_ca_system_score_gemma":0.00013466859,"threshold_uncertainty_score":0.99964446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031640977,0.00029227708,0.9918237,0.00015023093,0.0028155579,0.0008939262,0.0000025708985,0.0006298127,0.00022784524],"genre_scores_gemma":[0.9679943,0.00055406586,0.029235339,0.00076907675,0.00084622,0.0001960994,0.00006821939,0.00010097177,0.00023571482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99478227,0.00063107914,0.00093902095,0.0015306829,0.00055703346,0.0015599265],"domain_scores_gemma":[0.99680686,0.000434325,0.00047399005,0.0016342265,0.00021379224,0.0004368132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012022029,0.0007058836,0.00083942077,0.00026124198,0.00039304662,0.00039627572,0.0023223383,0.00073399435,0.00002719171],"category_scores_gemma":[0.00004213385,0.0007405404,0.00022581131,0.0015597038,0.00017161545,0.0009477143,0.0010532074,0.0011047056,0.000034038418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003430276,0.00029260785,0.0014542325,0.000019998606,0.000032141663,0.000044015946,0.00037053396,0.9644155,0.0000046705486,0.0045673335,0.001157993,0.027606685],"study_design_scores_gemma":[0.0030497871,0.00009023496,0.0019939998,0.00023902878,0.00001901429,0.000012204979,0.000046170702,0.99348813,0.000013502834,0.000039246304,0.00016865459,0.0008400009],"about_ca_topic_score_codex":0.000181794,"about_ca_topic_score_gemma":0.0003541679,"teacher_disagreement_score":0.9648302,"about_ca_system_score_codex":0.00022470485,"about_ca_system_score_gemma":0.0000661152,"threshold_uncertainty_score":0.99950457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04436402,0.00023878172,0.95092356,0.0002713394,0.00035802295,0.0007197556,0.0000027572964,0.0005463259,0.0025754077],"genre_scores_gemma":[0.86660403,0.00003597192,0.13248572,0.000385863,0.00014699085,0.00025100197,0.000031328065,0.000040576768,0.000018512403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981582,0.00013683579,0.000336606,0.0005794291,0.00025901597,0.0005299131],"domain_scores_gemma":[0.9961206,0.0008715487,0.00024087135,0.002390978,0.00023921592,0.00013683815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003874397,0.00026528508,0.00026105353,0.00008684736,0.0004563727,0.00013771615,0.002153228,0.00019198589,0.00000471046],"category_scores_gemma":[0.000043724773,0.00024503443,0.00007413675,0.0007238911,0.00016509405,0.00032992152,0.00023569452,0.00041361368,0.000017096889],"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.0001423014,0.00063718343,0.0023433082,0.000038999402,0.0001120246,0.000017314425,0.0019476087,0.02902424,0.0001688477,0.7676455,0.0014860198,0.19643667],"study_design_scores_gemma":[0.0005765396,0.0003500772,0.003359306,0.00015344254,0.000020943487,0.00001693486,0.00004147211,0.9913556,0.00012579867,0.0029913625,0.0006392483,0.00036928314],"about_ca_topic_score_codex":0.00006386759,"about_ca_topic_score_gemma":0.000057204597,"teacher_disagreement_score":0.96233135,"about_ca_system_score_codex":0.00006932912,"about_ca_system_score_gemma":0.00003491387,"threshold_uncertainty_score":0.99922144},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039273244,0.00038606836,0.9870613,0.002644673,0.003148619,0.0018795362,0.0000050920066,0.00038504665,0.0005623377],"genre_scores_gemma":[0.8318048,0.00014254072,0.15767227,0.0026320817,0.0055055926,0.0015922778,0.000027263464,0.00013526044,0.00048789912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593997,0.000093191076,0.00078714715,0.0010931398,0.00046454743,0.001621976],"domain_scores_gemma":[0.9959131,0.0016413624,0.0003721639,0.0016474078,0.00018245912,0.0002435374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021071034,0.00050075405,0.0005515671,0.000064244006,0.00053109555,0.00049193995,0.0031698726,0.00049949426,0.000019279254],"category_scores_gemma":[0.000030108478,0.00039641385,0.00022300851,0.0013557982,0.00021903415,0.00050147093,0.0007618985,0.00162388,0.000019187257],"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.00005534381,0.00024756143,0.0017247002,0.0000416749,0.00009076574,0.000020489328,0.00045293602,0.29931688,0.00047392873,0.13648656,0.02923094,0.5318582],"study_design_scores_gemma":[0.0010494537,0.000063530024,0.0015261937,0.00011365857,0.000017350405,0.00004334784,0.00001407071,0.97292656,0.00004396199,0.0014018479,0.022287788,0.0005122679],"about_ca_topic_score_codex":0.00010722807,"about_ca_topic_score_gemma":0.00058397785,"teacher_disagreement_score":0.82938904,"about_ca_system_score_codex":0.0000616033,"about_ca_system_score_gemma":0.00014582583,"threshold_uncertainty_score":0.9998488},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010100508,0.000024299019,0.83421654,0.0003737227,0.0005704334,0.1640882,0.0000070452584,0.00015501841,0.00046376887],"genre_scores_gemma":[0.2343587,0.0000049988585,0.015468183,0.0003708453,0.0019724746,0.7472777,0.000008846262,0.000058767917,0.00047953567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763244,0.000115661955,0.0006151007,0.00053297833,0.0003957442,0.00070804206],"domain_scores_gemma":[0.99777573,0.00052283047,0.00038773278,0.0010507085,0.00017604347,0.0000869359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000700995,0.00031883246,0.0004078222,0.0000605338,0.00032610947,0.0001978416,0.0018014989,0.0002342804,0.000020361509],"category_scores_gemma":[0.000005371289,0.00022258393,0.00024892983,0.0005353333,0.000109438806,0.0002304983,0.00019886956,0.00024567934,0.0000058129567],"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.00015710946,0.00026091546,0.0006121934,0.00015462119,0.000060126105,0.00001049597,0.00008780782,0.19454953,0.00043058192,0.6729205,0.051193766,0.07956236],"study_design_scores_gemma":[0.0014613544,0.00021351397,0.0005712361,0.00014881432,0.000018079547,0.000009276253,0.000009071728,0.9375507,0.0032691213,0.009721855,0.046656374,0.00037056307],"about_ca_topic_score_codex":0.00019373337,"about_ca_topic_score_gemma":0.00021415697,"teacher_disagreement_score":0.8187483,"about_ca_system_score_codex":0.000034397603,"about_ca_system_score_gemma":0.00010570402,"threshold_uncertainty_score":0.9076709},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15466513,0.00087299466,0.8422962,0.00014143872,0.0009236631,0.0004162719,0.000011689001,0.00026503197,0.000407605],"genre_scores_gemma":[0.97281796,0.000660864,0.024649825,0.00023826404,0.0011890552,0.0000709295,0.00022022481,0.00008882227,0.00006405355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99292094,0.0005418625,0.0015127166,0.0016951003,0.0017496427,0.0015797461],"domain_scores_gemma":[0.99501365,0.00047003257,0.0008645335,0.002751624,0.0006245556,0.0002756142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031969796,0.0006782424,0.00090630114,0.00049036596,0.0002734167,0.0002007687,0.0033153186,0.00055596424,0.000018314058],"category_scores_gemma":[0.000032755208,0.0007095866,0.0001561156,0.0031230864,0.00017492274,0.0013756725,0.0014148549,0.0008465982,0.0000056272083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014219808,0.0002876702,0.0010070917,0.0000074536833,0.000029031966,0.0000062514914,0.000086919914,0.5734151,0.000019155223,0.00070276886,0.00011897423,0.42430538],"study_design_scores_gemma":[0.0027216892,0.0000584307,0.0015017766,0.00043157744,0.000063063184,0.00004421888,0.000045454188,0.99400055,0.00014504907,0.0000030921058,0.00025227157,0.0007327936],"about_ca_topic_score_codex":0.00020811977,"about_ca_topic_score_gemma":0.00034700523,"teacher_disagreement_score":0.81815284,"about_ca_system_score_codex":0.0004733629,"about_ca_system_score_gemma":0.00027951846,"threshold_uncertainty_score":0.9995355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89313555,0.0039757737,0.008837398,0.00023599253,0.0008869002,0.00013147132,0.00010053704,0.00012145333,0.09257495],"genre_scores_gemma":[0.9969537,0.00035099633,0.00017360787,0.0008024966,0.0008442661,0.0000051710917,0.00008504304,0.000029260684,0.00075546023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99851775,0.000009682155,0.0005221334,0.0003491602,0.000039271017,0.00056199083],"domain_scores_gemma":[0.999268,0.0000719121,0.00021084651,0.00029080344,0.000030573596,0.00012783922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000320327,0.00018928497,0.00039514838,0.00008524317,0.00015126234,0.0000665466,0.00025641866,0.00021565073,0.00031017768],"category_scores_gemma":[0.000031815827,0.0002147548,0.000113311355,0.00051484513,0.000052034284,0.000087853514,0.000054884596,0.0002464162,0.00043850552],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007706411,0.00015679852,0.3473143,0.000010219593,0.00012609686,0.000026264466,0.00087677327,0.0015327837,0.00011261357,0.5916128,0.0405491,0.017605195],"study_design_scores_gemma":[0.00049048505,0.000041451593,0.6391937,0.000019577936,0.000007714874,0.0000019499769,0.00006403328,0.004352488,0.00006899753,0.005715416,0.34959567,0.0004484999],"about_ca_topic_score_codex":0.0020930746,"about_ca_topic_score_gemma":0.0005682229,"teacher_disagreement_score":0.5858974,"about_ca_system_score_codex":0.00007577167,"about_ca_system_score_gemma":0.00000979354,"threshold_uncertainty_score":0.87574464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014803973,0.000922543,0.98556244,0.0002786855,0.0010964104,0.008511748,0.00000792579,0.00089089,0.0012489401],"genre_scores_gemma":[0.9682193,0.00014282714,0.0041864957,0.0011291774,0.003540309,0.021430708,0.00010158135,0.0001741704,0.0010754775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942392,0.00027741198,0.0011100769,0.001698836,0.0006759579,0.0019984916],"domain_scores_gemma":[0.99598753,0.00083970936,0.00064613105,0.0019018804,0.00028342233,0.00034132405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009043761,0.000836339,0.00092142733,0.000155243,0.0007685382,0.0007674263,0.002408611,0.0007008788,0.00001755694],"category_scores_gemma":[0.000008368181,0.0008157996,0.00041394753,0.0010795217,0.00016105999,0.00060119986,0.000585114,0.0007605145,0.000014368863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016557191,0.00028848063,0.00047420117,0.000042781077,0.000062426036,0.000056170014,0.000054391578,0.44740748,0.00001853798,0.09506063,0.030291775,0.42607754],"study_design_scores_gemma":[0.001765985,0.0003588117,0.00025942878,0.00050698634,0.000021272332,0.000021749647,0.0000107643755,0.96859276,0.00013954143,0.0018865193,0.02549381,0.0009423404],"about_ca_topic_score_codex":0.00003862165,"about_ca_topic_score_gemma":0.00019755603,"teacher_disagreement_score":0.981376,"about_ca_system_score_codex":0.00022175733,"about_ca_system_score_gemma":0.0001309156,"threshold_uncertainty_score":0.9994293},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026375653,0.0011569759,0.9697347,0.00008716445,0.0003784248,0.0005863821,0.000040352585,0.0007316636,0.0009086852],"genre_scores_gemma":[0.980954,0.0004448523,0.017449647,0.00020433175,0.00044108025,0.000030450052,0.0002221002,0.00018550587,0.00006806233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705446,0.00008831553,0.00084378227,0.0005419667,0.00042464476,0.0010468098],"domain_scores_gemma":[0.9982838,0.00026092425,0.00029008838,0.0006586348,0.00025062528,0.0002559442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002588812,0.00067121914,0.0009895072,0.00016173327,0.00017561867,0.00007490645,0.00042383894,0.00050195213,0.000043008975],"category_scores_gemma":[0.000007312574,0.00066002854,0.00014939473,0.0009061477,0.00023081037,0.00036295448,0.000036909467,0.00079237856,0.000009056741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016320762,0.00006615049,0.0002826552,0.000026925582,0.00016884157,0.000020780091,0.00003179584,0.949265,0.0001466576,0.004109393,0.00012791187,0.04559065],"study_design_scores_gemma":[0.0021248371,0.00014513724,0.0003195089,0.0004362894,0.00010494694,0.00002467249,0.000046859826,0.9957661,0.000080092344,0.00016792963,0.000023305261,0.0007602898],"about_ca_topic_score_codex":0.0000052225087,"about_ca_topic_score_gemma":0.000051587896,"teacher_disagreement_score":0.95457834,"about_ca_system_score_codex":0.00030097103,"about_ca_system_score_gemma":0.000059989306,"threshold_uncertainty_score":0.9995851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2926037,0.00102655,0.7037143,0.000094879615,0.0011866174,0.00073172787,0.0000026414002,0.00021594828,0.00042360884],"genre_scores_gemma":[0.99496186,0.0002452581,0.0018227866,0.00032900332,0.002242772,0.00022273549,0.000037648504,0.00008891158,0.00004904478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958466,0.000111513255,0.00069547264,0.000962958,0.0003181484,0.0020652844],"domain_scores_gemma":[0.9982937,0.00044503275,0.0002056622,0.0005609196,0.00012172433,0.00037293663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009886749,0.0005134703,0.00065082544,0.00025349547,0.0003879409,0.00035090285,0.00081495283,0.000341471,0.000010538187],"category_scores_gemma":[0.000021793576,0.00055108196,0.00025067144,0.0009705587,0.00007705865,0.0010884099,0.00045780768,0.0007865679,0.0000072657444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023703891,0.0008243888,0.07679743,0.00004731944,0.00014318484,0.00013041988,0.001382543,0.4408899,0.000060282884,0.0832802,0.0001663381,0.39604095],"study_design_scores_gemma":[0.0012285298,0.00006593811,0.004067613,0.0003290794,0.000051151084,0.000054656335,0.00009909421,0.992799,0.000057151417,0.0005125892,0.00002816914,0.0007070333],"about_ca_topic_score_codex":0.00010006201,"about_ca_topic_score_gemma":0.00028322803,"teacher_disagreement_score":0.7023581,"about_ca_system_score_codex":0.00021431704,"about_ca_system_score_gemma":0.000046418296,"threshold_uncertainty_score":0.99969405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46211296,0.00018516943,0.53215665,0.00028083852,0.003679867,0.0003062835,9.965908e-7,0.00051736616,0.0007599],"genre_scores_gemma":[0.9797295,0.00023288335,0.017661901,0.00051642035,0.0014206542,0.000074907446,0.000039484374,0.00010745465,0.00021682405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99474466,0.00031211172,0.001060044,0.0014779717,0.00069899694,0.0017062051],"domain_scores_gemma":[0.99648374,0.00057848764,0.00047584658,0.0017613972,0.0002565149,0.0004440079],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010760577,0.0007030523,0.0007581531,0.00042409808,0.0003858581,0.00051756046,0.0020578613,0.00090439594,0.000045369045],"category_scores_gemma":[0.000052538373,0.00074499415,0.00023237328,0.002260152,0.00028516082,0.0008601224,0.00059049274,0.0024762738,0.000055479697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003068691,0.00015909952,0.008642912,0.000012374359,0.000025414236,0.0001442407,0.00014450937,0.8968565,0.00078775204,0.03820522,0.0001722431,0.054819066],"study_design_scores_gemma":[0.001126994,0.000044589462,0.0029513813,0.00017994412,0.0000115082,0.00008089355,0.000036611964,0.9934726,0.00059896975,0.0000886887,0.00056390977,0.0008439071],"about_ca_topic_score_codex":0.00013567426,"about_ca_topic_score_gemma":0.0008994791,"teacher_disagreement_score":0.5176165,"about_ca_system_score_codex":0.00013352434,"about_ca_system_score_gemma":0.000110146764,"threshold_uncertainty_score":0.99982506},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068320273,0.0005792014,0.9892201,0.00034120915,0.0008626899,0.00092338445,0.000002977815,0.00037435332,0.0008640825],"genre_scores_gemma":[0.94541085,0.000018164306,0.051801544,0.00071309187,0.0011909459,0.00035226071,0.000047197027,0.000050775394,0.0004151908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965039,0.0001749067,0.0007091753,0.0009948027,0.0003061007,0.0013111283],"domain_scores_gemma":[0.9983653,0.00046462906,0.00021091726,0.0006445798,0.00010136078,0.00021320178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010466051,0.00041552336,0.0005475198,0.00017042582,0.00028784593,0.00032170487,0.0010843084,0.00031717823,0.000006632901],"category_scores_gemma":[0.000018174615,0.0004237817,0.00017540838,0.0009837224,0.000055220215,0.00031658247,0.00024888443,0.0005468257,0.000007021221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030032164,0.00010092406,0.0025513452,0.000007500898,0.000015085751,0.000013292039,0.00006171249,0.7777728,0.000008335097,0.019815499,0.0014448868,0.19817859],"study_design_scores_gemma":[0.0017621812,0.000043907217,0.0026466385,0.000081502665,0.000013636269,0.000015332274,0.000027546312,0.9934523,0.0000050977865,0.00005773243,0.0013997362,0.0004943596],"about_ca_topic_score_codex":0.00015428697,"about_ca_topic_score_gemma":0.0004466234,"teacher_disagreement_score":0.9385788,"about_ca_system_score_codex":0.00016472818,"about_ca_system_score_gemma":0.000067072186,"threshold_uncertainty_score":0.9998214},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15189198,0.0001984345,0.8265224,0.0013531108,0.00023454752,0.016446292,0.000005305738,0.00068389304,0.0026640163],"genre_scores_gemma":[0.99092555,0.000045049543,0.0015280218,0.00024577242,0.000022593023,0.007024507,0.0000020464201,0.000008611632,0.00019783992],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986071,0.00013035159,0.00038092036,0.000299396,0.0003007641,0.00028146373],"domain_scores_gemma":[0.99710834,0.00016213147,0.000317949,0.0022700834,0.00010064676,0.000040852356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018747864,0.00015609691,0.0003319144,0.00017836787,0.0002907365,0.00006889116,0.0033106704,0.00013712075,0.000005194637],"category_scores_gemma":[0.000027033027,0.00010483846,0.0002492624,0.0034027507,0.00030616127,0.00046588972,0.0009826353,0.0002954095,0.000002930415],"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.0000645075,0.00075214443,0.3552893,0.000083137755,0.0016116714,0.000017336688,0.0015807585,0.17836647,0.00039917917,0.26049954,0.005360791,0.19597517],"study_design_scores_gemma":[0.0004428874,0.000041240884,0.14991659,0.0000522429,0.000097472766,0.000007778323,0.0000467906,0.8406911,0.0028020677,0.0003544525,0.0052297274,0.00031766176],"about_ca_topic_score_codex":0.00006113136,"about_ca_topic_score_gemma":0.00008653244,"teacher_disagreement_score":0.8390336,"about_ca_system_score_codex":0.000028231101,"about_ca_system_score_gemma":0.00008513679,"threshold_uncertainty_score":0.6152104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032634232,0.015250514,0.9100288,0.040133137,0.00047975415,0.00048566944,0.0000021460028,0.0003282573,0.0006575015],"genre_scores_gemma":[0.99175763,0.003086501,0.002723816,0.0019113116,0.00031832838,0.00007903953,0.00003306001,0.00002731382,0.00006296996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973248,0.0005598637,0.0004752002,0.0006051367,0.00040784435,0.00062712014],"domain_scores_gemma":[0.9984315,0.00022082472,0.00018740063,0.00065539026,0.00015924436,0.0003456205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014051289,0.00028009928,0.0003848342,0.00015597473,0.00013570426,0.0002462509,0.0006300627,0.00022381026,0.0000015016176],"category_scores_gemma":[0.000013571116,0.00028806835,0.000048458118,0.00032047371,0.00012235949,0.00055854133,0.00027637355,0.0003870333,0.0000022564059],"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.00011951752,0.00025659005,0.0010645709,0.00019713219,0.000031236388,0.00018999478,0.003516499,0.20883137,0.0000032009627,0.13369225,0.0023879553,0.6497097],"study_design_scores_gemma":[0.00088302343,0.00017745257,0.0011296478,0.00022630369,0.0000058094543,0.000012095958,0.0017191132,0.9897336,0.000019251003,0.00017037037,0.0055708694,0.00035249893],"about_ca_topic_score_codex":0.00022729256,"about_ca_topic_score_gemma":0.00032845634,"teacher_disagreement_score":0.95912343,"about_ca_system_score_codex":0.00014168081,"about_ca_system_score_gemma":0.00025755222,"threshold_uncertainty_score":0.99995714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0667246,0.000977822,0.9210406,0.003926979,0.00024906162,0.0004215097,0.0000040514096,0.0013858143,0.0052695624],"genre_scores_gemma":[0.991678,0.00016681524,0.0072168745,0.0004547953,0.00010788544,0.00013153504,0.000020112462,0.000016083017,0.00020790857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984505,0.00010078704,0.0003161924,0.00043097214,0.00025980518,0.00044173887],"domain_scores_gemma":[0.9980005,0.00017235219,0.00019255136,0.0013714842,0.00016073638,0.00010236044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013391933,0.00021900989,0.00023634518,0.00013189562,0.00022420763,0.0004394022,0.0023006336,0.00019702762,0.00013482539],"category_scores_gemma":[0.000019487505,0.00019874715,0.00008355479,0.0004462812,0.00013756772,0.0014072328,0.0006452581,0.00033820255,0.0012011495],"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.000014153584,0.0003501135,0.0012541607,0.000012792554,0.000094065595,0.000008235391,0.0043074875,0.012641184,0.0012738082,0.32430157,0.07242162,0.5833208],"study_design_scores_gemma":[0.00027053343,0.000042548265,0.0019594845,0.000034139437,0.0000047597196,0.0000043676673,0.0002808775,0.98595387,0.0010791379,0.009269971,0.0008153555,0.000284983],"about_ca_topic_score_codex":0.0009234458,"about_ca_topic_score_gemma":0.000034098317,"teacher_disagreement_score":0.9733127,"about_ca_system_score_codex":0.00015362559,"about_ca_system_score_gemma":0.000043894925,"threshold_uncertainty_score":0.9995765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14842802,0.008648732,0.83752966,0.000023400482,0.00218104,0.0009601921,0.000045889905,0.0003660889,0.0018169752],"genre_scores_gemma":[0.9976557,0.0001363,0.000029438046,0.0000672654,0.001245484,0.00044677118,0.000052244362,0.00009779464,0.0002689833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982373,0.00010241773,0.0004461306,0.00037001385,0.00018187499,0.0006622432],"domain_scores_gemma":[0.99882567,0.00033535363,0.00007994009,0.0001842452,0.00023832323,0.00033648178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005248358,0.00036979766,0.0006141737,0.00006615278,0.00015522641,0.00017023012,0.00015551796,0.0003168216,0.0000027730066],"category_scores_gemma":[0.000023061388,0.00033780382,0.00007655579,0.00023705217,0.000116679745,0.00016361626,0.000021737225,0.0002710042,0.0000038381067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007444111,0.00002209301,0.00018122618,0.000052906573,0.00014597339,0.00000971816,0.000430174,0.9812604,0.000025530788,0.002407035,0.0030100786,0.012380401],"study_design_scores_gemma":[0.0026335677,0.00014849282,0.000106356834,0.00024365389,0.00006265161,0.000025105779,0.0010109602,0.99340934,0.00001257266,0.000008729209,0.0019071946,0.0004313904],"about_ca_topic_score_codex":0.00007825392,"about_ca_topic_score_gemma":0.000072609175,"teacher_disagreement_score":0.84922767,"about_ca_system_score_codex":0.000068102345,"about_ca_system_score_gemma":0.00003591194,"threshold_uncertainty_score":0.9999074},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3349402,0.0013634718,0.6623325,0.000003918795,0.0002825179,0.0006846043,0.000014809284,0.00022548567,0.00015249467],"genre_scores_gemma":[0.9937669,0.000068076464,0.0055059292,0.00006850989,0.00021186458,0.00018871012,0.00011285956,0.00006715581,0.000009969362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742293,0.00036381956,0.0005528319,0.0005164538,0.00033905145,0.00080492796],"domain_scores_gemma":[0.9983276,0.00024554247,0.00012174083,0.00093414163,0.000060315153,0.000310632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011912443,0.0004404228,0.000816891,0.00026334965,0.00010219339,0.000047225974,0.00034215953,0.00030262856,0.00003057925],"category_scores_gemma":[0.00000440605,0.0004385141,0.00021282354,0.0010715445,0.00020614873,0.00019735038,0.000073530646,0.00047173325,0.0000012540378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014711502,0.00037419627,0.005120406,0.0002640496,0.0009681864,0.00000330998,0.00048449577,0.9532675,0.000023544102,0.00012544682,0.00008380964,0.03913794],"study_design_scores_gemma":[0.00078812445,0.000051981624,0.015974823,0.000032972544,0.0010376642,0.000002205241,0.000107660926,0.98123854,0.00022410927,0.000053489144,0.000072563715,0.00041586903],"about_ca_topic_score_codex":0.00005370908,"about_ca_topic_score_gemma":0.00007765145,"teacher_disagreement_score":0.6588267,"about_ca_system_score_codex":0.00012043391,"about_ca_system_score_gemma":0.00001237389,"threshold_uncertainty_score":0.99980664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14927614,0.0027932026,0.8446643,0.000018428447,0.0005775043,0.00018167669,0.0000012866269,0.001027756,0.0014597564],"genre_scores_gemma":[0.99874043,0.000503106,0.00035291418,0.000057458437,0.00020812712,0.000010256527,0.000007726069,0.0000565882,0.00006339218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985892,0.000019507446,0.00045053748,0.00019044911,0.00019019264,0.00056009885],"domain_scores_gemma":[0.9994055,0.000045031313,0.000055730106,0.00032079424,0.00009222441,0.00008073013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027303112,0.00022410956,0.00032216017,0.00014354331,0.00007931381,0.000022972175,0.0002489022,0.0004102397,0.000019525738],"category_scores_gemma":[0.000015998148,0.00019893503,0.00009905035,0.0006420295,0.00022310174,0.00008575542,0.000051097737,0.00036022608,0.000005607399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045254215,0.000030004867,0.004464116,0.00008242078,0.00005569479,0.000015928923,0.000069437265,0.9747937,0.0010185413,0.003447478,0.001242485,0.01473499],"study_design_scores_gemma":[0.0003249774,0.0000337659,0.00085984607,0.00013429315,0.000019768773,0.000010695358,0.00018427202,0.9766966,0.019987633,0.00006674836,0.0013802121,0.0003011524],"about_ca_topic_score_codex":0.000020974714,"about_ca_topic_score_gemma":0.000036740195,"teacher_disagreement_score":0.8494643,"about_ca_system_score_codex":0.000036918347,"about_ca_system_score_gemma":0.000008818622,"threshold_uncertainty_score":0.8112335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3386545,0.0011355864,0.65520155,0.000021447426,0.0022451577,0.0007918168,0.000046116973,0.00068385026,0.0012199521],"genre_scores_gemma":[0.99587804,0.00013203712,0.0013511667,0.00009305772,0.0018541279,0.00009879566,0.00028958486,0.00016739714,0.0001357719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673384,0.000058316666,0.00078863587,0.00062275917,0.00034410125,0.0014523204],"domain_scores_gemma":[0.9982096,0.00046074938,0.0001248362,0.0006782748,0.00017105426,0.00035550355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009288662,0.00055244664,0.0007052347,0.00013021723,0.0002386015,0.00015465562,0.00034114844,0.0006131104,0.000050453826],"category_scores_gemma":[0.00003195454,0.00059483177,0.00025590003,0.00034663634,0.00012842273,0.00019744999,0.00010337807,0.00071932346,0.000014420441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014007605,0.00041252567,0.005242069,0.00096442096,0.00068496034,0.0002041851,0.001928982,0.8126303,0.023132026,0.0054037017,0.006613715,0.14138238],"study_design_scores_gemma":[0.0018969588,0.000078111734,0.001551363,0.00016062032,0.0000814112,0.000010852012,0.00006526028,0.9908073,0.0026609998,0.0006231243,0.0013535348,0.00071046106],"about_ca_topic_score_codex":0.000051206982,"about_ca_topic_score_gemma":0.0015407131,"teacher_disagreement_score":0.6572236,"about_ca_system_score_codex":0.00028993105,"about_ca_system_score_gemma":0.000042177147,"threshold_uncertainty_score":0.9996503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12602645,0.0005218231,0.8719787,0.00005251734,0.00019678513,0.00059496856,8.1028855e-7,0.0002878838,0.0003400781],"genre_scores_gemma":[0.9969639,0.00025238295,0.002000818,0.000073451505,0.00023856171,0.00014300474,0.00011066842,0.00007568994,0.00014152122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987992,0.00007279901,0.0003684993,0.00028413066,0.00010496519,0.0003704292],"domain_scores_gemma":[0.99950445,0.000078889025,0.00008062277,0.0001704909,0.00007303004,0.00009253975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016964304,0.00021524343,0.00019961064,0.00013134777,0.000082646795,0.0000909922,0.00007511992,0.00023463482,0.000029272316],"category_scores_gemma":[0.0000072378184,0.00024524488,0.000021723128,0.0004759574,0.000025086569,0.00044075097,0.000022621758,0.0003200363,0.0000130090675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009833259,0.000013183464,0.0017209746,0.00003196804,0.0000099120225,8.148736e-7,0.00013729552,0.9829988,0.00037360738,0.00017282767,0.00082422345,0.013706569],"study_design_scores_gemma":[0.00048319323,0.00001858211,0.0038887535,0.00009153693,0.000008265172,0.0000061888845,0.00012878992,0.99481297,0.00009365947,0.00007546136,0.00014498511,0.00024761568],"about_ca_topic_score_codex":0.00021055192,"about_ca_topic_score_gemma":0.0006926436,"teacher_disagreement_score":0.87093747,"about_ca_system_score_codex":0.00022064861,"about_ca_system_score_gemma":0.000010583814,"threshold_uncertainty_score":1},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014489301,0.0019642445,0.97800475,0.0025433642,0.0001618149,0.0006659999,2.6490994e-7,0.00014523612,0.0020250338],"genre_scores_gemma":[0.99060345,0.002530979,0.0049620713,0.0012141508,0.00011578986,0.00018819893,0.000018111381,0.00001892045,0.00034831354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979473,0.0005006153,0.00042613148,0.0004997636,0.00018733827,0.00043885576],"domain_scores_gemma":[0.99852014,0.00032368745,0.00013294435,0.00072448497,0.0001405271,0.00015821963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005387056,0.00024254937,0.0003132863,0.00010324016,0.00026691848,0.00040390564,0.0007722192,0.00014865029,0.00006452021],"category_scores_gemma":[0.000023193636,0.00022730888,0.000039554685,0.0006901288,0.000105860076,0.00057162775,0.00060089433,0.00046284604,0.00001616863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019845504,0.00010776631,0.0006766023,0.0000045832703,0.00002911989,0.000004896048,0.0010675896,0.6799191,0.00010400402,0.035611536,0.0062076985,0.27624723],"study_design_scores_gemma":[0.0008416145,0.000045333556,0.0036971304,0.000091376096,0.0000034137793,0.0000047545755,0.00009093825,0.9931589,0.000030020274,0.000073691954,0.0016944949,0.00026838345],"about_ca_topic_score_codex":0.00003116427,"about_ca_topic_score_gemma":0.000054043445,"teacher_disagreement_score":0.97611415,"about_ca_system_score_codex":0.00010278347,"about_ca_system_score_gemma":0.000035878584,"threshold_uncertainty_score":0.9269387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5693025,0.0013864036,0.4270329,0.00012721967,0.00075175875,0.0005661225,0.000001522767,0.0004088521,0.00042274734],"genre_scores_gemma":[0.9940543,0.00030371,0.0032194748,0.0015410089,0.0005161657,0.00013272515,0.000021297636,0.0001059943,0.00010531367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461794,0.00027954314,0.00087937986,0.0015491773,0.000954442,0.0017195382],"domain_scores_gemma":[0.9967004,0.000824056,0.00041096972,0.0015541017,0.00017667211,0.0003338197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006674941,0.00076517236,0.00088320166,0.0002481339,0.0005793462,0.00017339589,0.0018099901,0.0005186635,0.000030642605],"category_scores_gemma":[0.00001264247,0.0006841923,0.00019522799,0.0018301286,0.00032110864,0.0006012313,0.00060873653,0.0016345073,0.00004724954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038384585,0.0002498489,0.007969097,0.000008346606,0.00006132683,0.0011415281,0.00021604102,0.919975,0.00000984284,0.009814391,0.0015279192,0.058642827],"study_design_scores_gemma":[0.0021186003,0.0003756234,0.0098614395,0.00060578744,0.000013394293,0.0002843269,0.000012696355,0.9854707,0.000016589449,0.00023008209,0.00016161389,0.00084910507],"about_ca_topic_score_codex":0.00012987784,"about_ca_topic_score_gemma":0.0012090931,"teacher_disagreement_score":0.42475182,"about_ca_system_score_codex":0.00025192072,"about_ca_system_score_gemma":0.00021252279,"threshold_uncertainty_score":0.99956095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040716055,0.00025125273,0.88530266,0.0003624514,0.00056108204,0.1118538,0.0000032321936,0.00094885874,0.0003094929],"genre_scores_gemma":[0.5517402,0.000022920542,0.023859408,0.0037312126,0.0018125182,0.41837522,0.000046709196,0.000119121214,0.00029264152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99494934,0.0002563544,0.0010016096,0.001450105,0.0005255413,0.0018170195],"domain_scores_gemma":[0.99630195,0.00060052855,0.00057232584,0.0018210935,0.00027100462,0.0004331198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000991937,0.0007238122,0.00077211775,0.00010937742,0.0006161106,0.000612902,0.0023136868,0.00062968954,0.000032361113],"category_scores_gemma":[0.000024490188,0.0007009948,0.000428094,0.00111496,0.00010373361,0.0006288719,0.0003114274,0.0008530235,0.000014323302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018689648,0.00019670364,0.00014779437,0.000027197182,0.000019700628,0.000017357283,0.00007738379,0.57541,0.0000038050216,0.0015531332,0.008118611,0.4142414],"study_design_scores_gemma":[0.0036740508,0.0009684885,0.000254685,0.00034005032,0.000018731445,0.0000151278155,0.000016644233,0.95850635,0.000039591625,0.00035391643,0.03502374,0.00078863086],"about_ca_topic_score_codex":0.0000028957493,"about_ca_topic_score_gemma":0.000022913999,"teacher_disagreement_score":0.8614433,"about_ca_system_score_codex":0.00020740127,"about_ca_system_score_gemma":0.00019663037,"threshold_uncertainty_score":0.99954414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063255854,0.0008177423,0.9327463,0.00003636241,0.00083111884,0.00066873466,0.0000073673355,0.0011398951,0.0004966138],"genre_scores_gemma":[0.99860805,0.00024731542,0.0002680193,0.00014341141,0.0002891446,0.0001729208,0.00012041432,0.000102016245,0.00004869783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983265,0.00004282247,0.0005060375,0.00031054128,0.00018512906,0.0006290079],"domain_scores_gemma":[0.999331,0.00007391672,0.00007049462,0.00030048096,0.00011522312,0.00010891073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002839281,0.00030977686,0.0003825327,0.0001659572,0.000072777446,0.000076635646,0.0002486967,0.00045698273,0.0000070321494],"category_scores_gemma":[0.000018523073,0.00031984822,0.000075358716,0.00054895587,0.00007144402,0.00014103418,0.00003986876,0.00029375075,0.000006040635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055983004,0.00003034661,0.0020587363,0.00003860621,0.000025608717,0.0000093006165,0.00010740838,0.9719205,0.00002490296,0.0025709707,0.0036057795,0.01955184],"study_design_scores_gemma":[0.0014394306,0.00007253048,0.000109169516,0.00008981022,0.000017837534,0.000005302893,0.00044796246,0.99450964,0.0009901098,0.00021250948,0.0017285862,0.00037712397],"about_ca_topic_score_codex":0.00004161652,"about_ca_topic_score_gemma":0.00020805532,"teacher_disagreement_score":0.9353522,"about_ca_system_score_codex":0.00020964266,"about_ca_system_score_gemma":0.000030593194,"threshold_uncertainty_score":0.9999254},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1101176,0.00007545701,0.8848787,0.0006069237,0.0011011184,0.0011936084,9.5345104e-7,0.000534847,0.0014908231],"genre_scores_gemma":[0.9904524,0.00003534364,0.006246831,0.0015188067,0.0008430173,0.00061647495,0.000026115744,0.000101852835,0.00015913956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945554,0.00038745944,0.00096652686,0.0014474422,0.00052970636,0.0021134247],"domain_scores_gemma":[0.99655193,0.0006505978,0.000426088,0.0016815453,0.00022207721,0.0004677371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075619144,0.0006996248,0.0009061807,0.00023587058,0.00028420193,0.00047022544,0.002049482,0.0005662945,0.00020610352],"category_scores_gemma":[0.000019248226,0.00063586177,0.0001575968,0.0015133701,0.0003360292,0.00081938715,0.00061170186,0.0013818801,0.000088416935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010571967,0.0004531564,0.057058506,0.000040841653,0.0000958074,0.00056638796,0.00046824687,0.73202413,0.000041039846,0.050416466,0.0034172072,0.15531246],"study_design_scores_gemma":[0.0019218995,0.00025347454,0.011217213,0.00020573704,0.000013689726,0.000065013126,0.00005465733,0.9851699,0.000048609185,0.000072801304,0.00020245761,0.0007745699],"about_ca_topic_score_codex":0.00070930657,"about_ca_topic_score_gemma":0.0012899984,"teacher_disagreement_score":0.8803348,"about_ca_system_score_codex":0.0002233062,"about_ca_system_score_gemma":0.00020226325,"threshold_uncertainty_score":0.9996093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016657947,0.0015636696,0.9735248,0.0019600128,0.00024174331,0.000708344,4.749912e-7,0.00014891705,0.0051940717],"genre_scores_gemma":[0.985908,0.0015019987,0.0117361415,0.000081674865,0.00011583412,0.000098810095,0.000008570737,0.000018559314,0.00053040916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756044,0.00044938194,0.0005167536,0.0003353176,0.00068216247,0.00045593822],"domain_scores_gemma":[0.9967174,0.0007315157,0.00023986836,0.0017805336,0.00047099523,0.00005966534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010236821,0.00015390807,0.00017764591,0.000059122405,0.0007364639,0.00023664604,0.0021589913,0.00008243577,0.000017502918],"category_scores_gemma":[0.000043950367,0.00011958498,0.00006233317,0.0015711635,0.00018915613,0.00045789362,0.0007971433,0.0002849162,0.0000142219715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001516395,0.000057085996,0.00050556316,0.000013081192,0.00003766655,0.0000017885615,0.00030080182,0.58657855,0.000025285464,0.14116485,0.0004242945,0.27087587],"study_design_scores_gemma":[0.00028910805,0.000040919476,0.0014754802,0.000081809805,0.000007579386,0.0000043818886,0.00009291501,0.9910169,0.00004436261,0.0033336822,0.0034839308,0.00012888019],"about_ca_topic_score_codex":0.000029507917,"about_ca_topic_score_gemma":0.000053130367,"teacher_disagreement_score":0.9692501,"about_ca_system_score_codex":0.000082234175,"about_ca_system_score_gemma":0.00007541517,"threshold_uncertainty_score":0.5664359},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4624546,0.003573184,0.531734,0.0004365512,0.00055874494,0.00093222456,0.0000021859503,0.00020424231,0.00010429357],"genre_scores_gemma":[0.9958575,0.0021407811,0.00065608975,0.00032612166,0.000453873,0.0003802432,0.000023569959,0.000058915575,0.000102900245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636245,0.00038553803,0.00071562716,0.00092166796,0.0004804226,0.0011342783],"domain_scores_gemma":[0.99720204,0.0006516212,0.00028677643,0.0012838999,0.0002208361,0.00035484348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009536984,0.0004320197,0.0005631731,0.00026663378,0.00065175415,0.00049722515,0.0016060933,0.00040003294,0.0000220114],"category_scores_gemma":[0.0000123456375,0.00042952862,0.00012187374,0.00093817146,0.0001602235,0.0004323184,0.0005224658,0.00069995265,0.000009095593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001067016,0.00022407387,0.0030965386,0.00010655727,0.000035128334,0.000014335939,0.000317483,0.8646678,0.00019170543,0.0015685451,0.00022741898,0.12944373],"study_design_scores_gemma":[0.0022037458,0.0001973491,0.0011020818,0.00027445928,0.000011621346,0.000029955349,0.00002608497,0.994402,0.00022856364,0.000027283342,0.0010423594,0.0004545053],"about_ca_topic_score_codex":0.00004333037,"about_ca_topic_score_gemma":0.00008997783,"teacher_disagreement_score":0.5334029,"about_ca_system_score_codex":0.00017193225,"about_ca_system_score_gemma":0.000032423508,"threshold_uncertainty_score":0.99981564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11437532,0.00025998044,0.8823613,0.000104050996,0.0018942714,0.00043860034,0.0000027700564,0.0005282438,0.00003547121],"genre_scores_gemma":[0.9812295,0.00010352898,0.015907858,0.00043905922,0.0019678308,0.00006149759,0.00015077686,0.00011767014,0.000022296477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553424,0.0005746757,0.00083352346,0.0013480908,0.0005042487,0.0012052254],"domain_scores_gemma":[0.99733496,0.00027449382,0.0005314957,0.0010394967,0.0004197366,0.00039982994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008886781,0.0005777773,0.0006391991,0.00024305398,0.001006373,0.00057569146,0.0006895278,0.00058855774,0.000003674851],"category_scores_gemma":[0.000033775512,0.0006150842,0.00014444217,0.0009716612,0.00022864244,0.00051852973,0.0002846902,0.00028008615,0.0000013119886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070093105,0.00015093287,0.00014538727,0.000024952828,0.000026732818,0.0000030506703,0.00011541822,0.91335493,0.0011590209,0.025822192,0.00011090058,0.059016414],"study_design_scores_gemma":[0.0014907082,0.00026288268,0.00013377442,0.00016340664,0.00004908498,0.000023544057,0.000020299196,0.9960373,0.0006761815,0.00010045274,0.00031029413,0.0007320575],"about_ca_topic_score_codex":0.00015534415,"about_ca_topic_score_gemma":0.00009941282,"teacher_disagreement_score":0.8668542,"about_ca_system_score_codex":0.00025882924,"about_ca_system_score_gemma":0.00007039748,"threshold_uncertainty_score":0.99963003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06805216,0.0025008898,0.92581993,0.0014231339,0.0010792254,0.0007160066,0.000015175683,0.00034074154,0.000052719406],"genre_scores_gemma":[0.98737323,0.00030027478,0.009145173,0.001748186,0.0010363985,0.00017699438,0.00007224031,0.00005801805,0.00008945385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952423,0.00043667998,0.0009796788,0.0013445108,0.00042879963,0.0015680376],"domain_scores_gemma":[0.9974092,0.0006467714,0.0003127996,0.0010146912,0.00016328311,0.0004532289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000804448,0.0006288499,0.0009526654,0.00016886933,0.00030460907,0.00023371143,0.0012215031,0.0006778188,0.000034777015],"category_scores_gemma":[0.000018830688,0.00061496784,0.0001508222,0.00087956694,0.00034714866,0.00061133393,0.0006047005,0.001221162,0.000020090481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000742942,0.00026375693,0.003437311,0.0000075476796,0.000057400095,0.0001667044,0.00012083434,0.79119563,0.000027853057,0.006456387,0.0013710078,0.19682127],"study_design_scores_gemma":[0.0042323954,0.000091485956,0.0077863173,0.000105779865,0.000018971587,0.00012503251,0.000017394836,0.98536974,0.00001623759,0.00008508004,0.0014879823,0.00066359295],"about_ca_topic_score_codex":0.00015542067,"about_ca_topic_score_gemma":0.00078775926,"teacher_disagreement_score":0.9193211,"about_ca_system_score_codex":0.00020149011,"about_ca_system_score_gemma":0.00008771281,"threshold_uncertainty_score":0.99963015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30185285,0.002780832,0.69174004,0.00020504855,0.0008019073,0.0006186752,8.841184e-7,0.00056716823,0.0014326116],"genre_scores_gemma":[0.99245113,0.001953444,0.0031860166,0.0011431166,0.00073764997,0.00015932322,0.000017857239,0.00011008148,0.00024139542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99448085,0.00034954134,0.0009509716,0.0014984555,0.0006870829,0.002033114],"domain_scores_gemma":[0.99686414,0.00046700516,0.0004300985,0.0017125047,0.00017199587,0.0003542261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093101145,0.0007388381,0.000885985,0.00024630857,0.0003590462,0.00047720852,0.0023672415,0.0005326526,0.000035750905],"category_scores_gemma":[0.000010257195,0.0006873972,0.00018016355,0.0027884126,0.00021306335,0.0009315373,0.00070754014,0.0014503635,0.000035360426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025838875,0.00019140833,0.022804376,0.000012897597,0.00006727898,0.0010270783,0.00044000382,0.6219438,0.000015800722,0.0064351466,0.00091647025,0.3458874],"study_design_scores_gemma":[0.001880679,0.00019816525,0.0059806826,0.0005289081,0.000020298303,0.00023804784,0.00009213209,0.9880247,0.000010704922,0.000105664396,0.002026953,0.00089302607],"about_ca_topic_score_codex":0.00014501186,"about_ca_topic_score_gemma":0.0014731518,"teacher_disagreement_score":0.69059825,"about_ca_system_score_codex":0.00025684407,"about_ca_system_score_gemma":0.00014051113,"threshold_uncertainty_score":0.99955773},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69204456,0.0005348492,0.30549404,0.000008418942,0.0005433149,0.00023792032,0.000003318821,0.00013755348,0.0009960277],"genre_scores_gemma":[0.9965226,0.0026269138,0.0003428448,0.00004295925,0.00021662751,0.000042057105,0.000036137153,0.00006665817,0.00010319961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817187,0.0000834558,0.00062559725,0.0003011306,0.00027356713,0.00054439576],"domain_scores_gemma":[0.9989237,0.0001704975,0.0001815731,0.00057206687,0.00007966914,0.00007246214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016534857,0.0003091104,0.00060166896,0.00025801975,0.00014297677,0.000010243294,0.00039228314,0.00024825297,0.00003011024],"category_scores_gemma":[0.000007782355,0.00026848586,0.00020673285,0.0038683105,0.00017803979,0.00023951141,0.000060859667,0.0005396005,0.0000020985422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021372573,0.00002376958,0.06894735,0.0000119706465,0.0002191673,0.0000030985923,0.00020585455,0.92527914,0.000011690433,0.00004165003,0.00027702353,0.0049579325],"study_design_scores_gemma":[0.00032895277,0.000012303705,0.07151006,0.00008702985,0.00012050969,0.0000029174605,0.000018730918,0.92750067,0.000089423,0.0000057790903,0.000061001974,0.00026264833],"about_ca_topic_score_codex":0.000024940358,"about_ca_topic_score_gemma":0.0002419215,"teacher_disagreement_score":0.3051512,"about_ca_system_score_codex":0.00020559317,"about_ca_system_score_gemma":0.00001892326,"threshold_uncertainty_score":0.99997675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004210888,0.00006941242,0.9498467,0.00060130365,0.00074634515,0.043867294,0.000027071539,0.0004304392,0.0002005388],"genre_scores_gemma":[0.9341992,0.0000036364036,0.021788403,0.0003506951,0.0011421442,0.04193603,0.00022270385,0.00013943703,0.00021776644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943227,0.0006154638,0.0012778103,0.0015011049,0.0009573975,0.0013254903],"domain_scores_gemma":[0.9922913,0.0016951027,0.0011407695,0.0037405873,0.00071606366,0.00041618926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028201018,0.0006667086,0.0008260582,0.00017691261,0.00046404888,0.00045163263,0.0047452464,0.00044245666,0.000007169544],"category_scores_gemma":[0.00017227347,0.0005232408,0.00024098466,0.0013540587,0.00032751152,0.0007847088,0.0012092459,0.0006663662,0.000003692686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003783109,0.0003218674,0.000206702,0.00011507268,0.000052881293,0.000010679388,0.00025789847,0.93058604,0.00018344235,0.0012779202,0.004218067,0.062391095],"study_design_scores_gemma":[0.0031749948,0.00022327428,0.00014486098,0.00032177643,0.00005242926,0.000013735473,0.000094010255,0.99324167,0.00068346644,0.00004594407,0.0013829961,0.0006208674],"about_ca_topic_score_codex":0.000117055904,"about_ca_topic_score_gemma":0.00014073735,"teacher_disagreement_score":0.9299883,"about_ca_system_score_codex":0.00016883093,"about_ca_system_score_gemma":0.00034923668,"threshold_uncertainty_score":0.99972194},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11388941,0.0002791383,0.8674447,0.000028272889,0.00038258603,0.017060354,0.00008286273,0.0005623005,0.00027035907],"genre_scores_gemma":[0.94610906,0.0003153977,0.0002989214,0.000048613947,0.00042252312,0.05251082,0.000069710666,0.0001398368,0.000085120606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967563,0.00013113079,0.0010575667,0.00071883993,0.00033500712,0.0010011145],"domain_scores_gemma":[0.9976554,0.0007514391,0.0003505409,0.0007640955,0.0002095632,0.0002689524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004980292,0.00063501997,0.001228136,0.00040855815,0.00017654046,0.00007407203,0.0004258409,0.0006655296,0.000092896225],"category_scores_gemma":[0.000016154077,0.000522036,0.00037986736,0.0009564366,0.0003219088,0.00026500598,0.00012884685,0.00029555394,0.0000014135902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010152862,0.00020031423,0.062170643,0.00042034936,0.003678181,0.000024415376,0.00012496751,0.73819494,0.0022998261,0.0064821453,0.0036009753,0.18178792],"study_design_scores_gemma":[0.002538841,0.00009424784,0.009920848,0.00044283242,0.0006527843,0.000009615148,0.000009891085,0.98292744,0.00045414836,0.00006406763,0.002211269,0.00067401107],"about_ca_topic_score_codex":0.000053001422,"about_ca_topic_score_gemma":0.00041224415,"teacher_disagreement_score":0.8671458,"about_ca_system_score_codex":0.00015352783,"about_ca_system_score_gemma":0.000032040625,"threshold_uncertainty_score":0.99972314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070459507,0.0019654166,0.9855082,0.003528459,0.0005513431,0.00053764944,0.0000019666143,0.00020901259,0.00065197505],"genre_scores_gemma":[0.9900558,0.0032399695,0.0047049876,0.0010309588,0.00024294041,0.00016838853,0.000010398601,0.000030614236,0.0005159267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980792,0.00023292447,0.00042942338,0.00059443386,0.00016314098,0.000500906],"domain_scores_gemma":[0.9979288,0.00054789905,0.00018957823,0.0008162741,0.00034446895,0.0001729551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069713243,0.00027219983,0.0003176451,0.00008278147,0.0005855398,0.00026489096,0.0006792558,0.00017067291,0.000025478708],"category_scores_gemma":[0.000057815894,0.00020369542,0.00008261566,0.00040637024,0.00013802899,0.00063432194,0.0005093075,0.00024039557,0.00000964951],"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.000055295073,0.00008569005,0.00063409074,0.000009146596,0.000092045,0.00000414952,0.0008310406,0.011153389,0.0016838299,0.3176698,0.011898444,0.6558831],"study_design_scores_gemma":[0.0010741878,0.0001366397,0.0014052541,0.00024779784,0.000011181761,0.000011745587,0.000030971798,0.9865337,0.00023743954,0.00032521618,0.009568096,0.00041779506],"about_ca_topic_score_codex":0.000002591871,"about_ca_topic_score_gemma":0.00003287341,"teacher_disagreement_score":0.9830099,"about_ca_system_score_codex":0.00009249723,"about_ca_system_score_gemma":0.000054562457,"threshold_uncertainty_score":0.83064586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053559892,0.0024107057,0.94278634,0.000017508606,0.00051843945,0.00024160255,0.0000020125626,0.00022814395,0.0002353621],"genre_scores_gemma":[0.99892455,0.00040046044,0.0003093461,0.000035187626,0.0001843748,0.00002640328,0.0000026525963,0.000072244715,0.00004476487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.00003788173,0.0002937724,0.00022645594,0.000063286774,0.00040592853],"domain_scores_gemma":[0.9995455,0.000089177556,0.00004170113,0.00021683636,0.000019363408,0.00008740904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113248614,0.00019839969,0.00025979534,0.00006374388,0.000034345154,0.000026211836,0.00009373398,0.00017921608,0.000016542976],"category_scores_gemma":[0.0000051606326,0.00016728051,0.000031338433,0.000120960874,0.00003363563,0.00014756428,0.000033344106,0.00013208477,0.00000470605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016624743,0.00000453047,0.0011367537,0.000011289014,0.00001579814,0.000025175354,0.000038716084,0.98781055,0.0009098185,0.000026878104,0.000039737974,0.009964099],"study_design_scores_gemma":[0.0010636528,0.000016547678,0.00018981897,0.00016767778,0.000004738603,0.000015311281,0.000008885497,0.9980351,0.00009070269,0.00001291866,0.00016680692,0.00022784605],"about_ca_topic_score_codex":0.000004192016,"about_ca_topic_score_gemma":0.000051054325,"teacher_disagreement_score":0.94536465,"about_ca_system_score_codex":0.00008379516,"about_ca_system_score_gemma":0.000002940419,"threshold_uncertainty_score":0.6821501},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38681704,0.000025307036,0.5045754,0.000053011965,0.0005395044,0.10694785,0.00004705136,0.0004850229,0.00050986273],"genre_scores_gemma":[0.8498394,0.0000071908353,0.00038863398,0.0000055808955,0.00019315298,0.14941339,0.00009094059,0.000051581977,0.000010119586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851346,0.000080682534,0.0005379481,0.00022781602,0.000304364,0.0003357226],"domain_scores_gemma":[0.99919343,0.000079311474,0.00016288548,0.00023023663,0.00026914527,0.00006498339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009698504,0.00020171916,0.0002702452,0.00006306107,0.00006423158,0.000014886899,0.00011795269,0.00016794552,0.000035129622],"category_scores_gemma":[0.000006432921,0.00015932103,0.0000910898,0.00017621092,0.000022317015,0.00023850576,0.0000044954454,0.00009428171,0.0000048700836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008739364,0.000019454945,0.0005655912,0.00032623886,0.000038138896,3.2551935e-7,0.000073806616,0.77644885,0.00039867204,0.000085016036,0.00059695565,0.22135958],"study_design_scores_gemma":[0.002770606,0.00008287193,0.002925138,0.001014301,0.00006442636,0.000002874174,0.000025038587,0.99042636,0.00074406987,0.000008088103,0.0017254712,0.00021072531],"about_ca_topic_score_codex":0.0000054994275,"about_ca_topic_score_gemma":0.000050455663,"teacher_disagreement_score":0.50418675,"about_ca_system_score_codex":0.00023785462,"about_ca_system_score_gemma":0.000038296203,"threshold_uncertainty_score":0.6496923},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9015746,0.00191974,0.094287686,0.00035609718,0.00021042442,0.00049925665,0.000006020003,0.00054015854,0.00060598523],"genre_scores_gemma":[0.9938817,0.002435442,0.0029638477,0.00007560949,0.00013478588,0.00019444908,0.000030334666,0.0001350167,0.00014880083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814445,0.00010856807,0.00046277672,0.0004372122,0.00015027204,0.00069674925],"domain_scores_gemma":[0.99832624,0.00038016183,0.0001160811,0.00087836623,0.000101827885,0.00019731578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021310411,0.0004168547,0.00039350925,0.00015210485,0.00011622436,0.00008116843,0.00046908946,0.00034389188,0.000058693797],"category_scores_gemma":[0.000008781789,0.00033192776,0.000053038908,0.00050204596,0.00013057711,0.0002480265,0.00013576313,0.00048666092,0.000026019563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044868564,0.0000744492,0.0033582733,0.000033063887,0.000052954343,0.000013223187,0.00032441688,0.98770636,0.0012971677,0.00051801646,0.000581751,0.0059954314],"study_design_scores_gemma":[0.0014620712,0.00008269395,0.0075502824,0.0003080521,0.000026636446,0.000014270482,0.00012293067,0.9885238,0.00023728808,0.0000038970816,0.0011157513,0.00055237213],"about_ca_topic_score_codex":0.00003203571,"about_ca_topic_score_gemma":0.00079917145,"teacher_disagreement_score":0.092307076,"about_ca_system_score_codex":0.00019916355,"about_ca_system_score_gemma":0.00003568506,"threshold_uncertainty_score":0.9999133},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20165746,0.0051028943,0.7904014,0.00029833824,0.00018542694,0.0006294019,0.0000062178246,0.0001600443,0.001558817],"genre_scores_gemma":[0.9861956,0.0020569835,0.011494631,0.00009021866,0.000022467908,0.000056997684,0.000030198085,0.000039324736,0.000013583784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991377,0.00010495978,0.0002750965,0.00014138826,0.00013333764,0.00020751706],"domain_scores_gemma":[0.99829894,0.00005615996,0.00012859763,0.0013420011,0.00008046428,0.00009381405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004259041,0.00014073025,0.00019228228,0.000060607406,0.00023625472,0.000088742396,0.00051028945,0.00011225608,0.000044252476],"category_scores_gemma":[0.000007872832,0.0001625984,0.00002905337,0.0001111336,0.000078362646,0.0001441005,0.00017107005,0.0001937766,0.000004684505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005398089,0.000052441195,0.0028730852,0.000091715454,0.00021562418,0.000008645179,0.00080195756,0.72149646,0.0412062,0.0067558014,0.007599709,0.2188444],"study_design_scores_gemma":[0.0012562481,0.00007898401,0.009154899,0.00021182273,0.00007185575,0.0000036713195,0.00017028445,0.93731165,0.042754136,0.000244653,0.008204862,0.00053692673],"about_ca_topic_score_codex":0.00007251823,"about_ca_topic_score_gemma":0.000049138645,"teacher_disagreement_score":0.78453815,"about_ca_system_score_codex":0.000033573328,"about_ca_system_score_gemma":0.000022059883,"threshold_uncertainty_score":0.6630571},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40550363,0.0016805665,0.58937234,0.00003647046,0.0024130184,0.0005414544,0.000012828663,0.00040609678,0.000033604512],"genre_scores_gemma":[0.9974855,0.0004173655,0.0014249827,0.000004661127,0.00032061202,0.00019622795,0.000052254127,0.00006584165,0.00003254521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986653,0.00001516339,0.00042866348,0.00030979322,0.00014612531,0.00043499933],"domain_scores_gemma":[0.9992328,0.000024346322,0.00010878954,0.0004556886,0.000053811928,0.00012450723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020999262,0.00024535353,0.00028881198,0.0000685962,0.00036558387,0.00016229562,0.00030492028,0.00012066448,0.0000067584156],"category_scores_gemma":[0.0000035461321,0.0002544782,0.00011706654,0.00004974403,0.000024730587,0.0001303541,0.00000951791,0.00015255618,0.0000043425925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009049016,0.000033708784,0.00001813201,0.00010922821,0.00006950356,0.0000059128793,0.00027581787,0.7796526,0.0001615398,0.00030273577,0.000045764784,0.219316],"study_design_scores_gemma":[0.0004822149,0.00003686828,0.0014075766,0.00011666294,0.000068970774,0.0000011428205,0.00026448074,0.9961298,0.000032569933,0.0000072196353,0.0011498983,0.00030257108],"about_ca_topic_score_codex":0.000020256803,"about_ca_topic_score_gemma":0.00024931922,"teacher_disagreement_score":0.5919819,"about_ca_system_score_codex":0.00006619197,"about_ca_system_score_gemma":0.000008928023,"threshold_uncertainty_score":0.99999076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12748933,0.00067042856,0.86696106,0.00018215786,0.0025901992,0.00067855994,0.000008638653,0.00088335143,0.00053626095],"genre_scores_gemma":[0.97452873,0.0003878185,0.022179127,0.00028990128,0.0018354923,0.00018932551,0.000109304965,0.00020823017,0.00027209305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920339,0.00039653757,0.0014280851,0.0025058098,0.0011970291,0.0024386405],"domain_scores_gemma":[0.992082,0.00094260706,0.0012258345,0.0041332343,0.00066993857,0.00094639615],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013476885,0.0011327618,0.0011941299,0.0002727338,0.0036416359,0.0024800503,0.0049508563,0.0010422806,0.000021420581],"category_scores_gemma":[0.00005657148,0.0010768113,0.0005205332,0.00063874427,0.0003756993,0.0010854667,0.0007067546,0.00090334343,0.0000065505365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018172897,0.00030000173,0.0001441827,0.0000117976,0.0000459518,0.000060935432,0.00016108502,0.6959291,0.00023297331,0.02158349,0.00039164926,0.2809571],"study_design_scores_gemma":[0.0022932235,0.00034620325,0.0010255923,0.00048797537,0.000052637966,0.000048820835,0.00009816153,0.99202245,0.000559658,0.00018141048,0.00154037,0.0013434901],"about_ca_topic_score_codex":0.0002602916,"about_ca_topic_score_gemma":0.00020749627,"teacher_disagreement_score":0.8470394,"about_ca_system_score_codex":0.00029759185,"about_ca_system_score_gemma":0.0001945188,"threshold_uncertainty_score":0.9991682},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06915397,0.00045261957,0.9212855,0.00042114264,0.0021767535,0.0004578639,0.000004205463,0.00025820208,0.0057897326],"genre_scores_gemma":[0.9961476,0.000101770296,0.0013051372,0.0006055288,0.0013612803,0.000093667,0.000024772391,0.000040802584,0.00031946742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701476,0.00039411825,0.00061554846,0.00050223985,0.0003618641,0.0011114419],"domain_scores_gemma":[0.9972803,0.0002953076,0.0004934203,0.0015837979,0.00012723276,0.00021992119],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012457101,0.00037547495,0.00066987966,0.00007445137,0.002646394,0.0009132928,0.002792564,0.0003702667,0.000015467183],"category_scores_gemma":[0.000008504024,0.00038119144,0.00020488101,0.00025148064,0.0002598331,0.0007146162,0.0013123284,0.0012791215,0.000018601027],"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.00010668052,0.00043855893,0.020812334,0.00004113067,0.00009305054,0.0002931595,0.0020122635,0.020075098,0.000017960247,0.014193087,0.017071106,0.9248456],"study_design_scores_gemma":[0.0011934718,0.0001430076,0.0036921366,0.00024937512,0.000017133914,0.000021150183,0.00030935794,0.98870635,0.00000824578,0.0018540375,0.003250742,0.0005550104],"about_ca_topic_score_codex":0.00023476395,"about_ca_topic_score_gemma":0.00045455244,"teacher_disagreement_score":0.9686312,"about_ca_system_score_codex":0.00013849963,"about_ca_system_score_gemma":0.00007611215,"threshold_uncertainty_score":0.999864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028762236,0.00058933767,0.9680604,0.000024375531,0.0006876829,0.00061939034,0.000009574779,0.00083481305,0.00041223798],"genre_scores_gemma":[0.9962177,0.00034725558,0.0023726944,0.000066439155,0.00038760254,0.00020135609,0.00010217935,0.00011329078,0.00019145165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831706,0.000019866839,0.0004628627,0.000375005,0.00015696707,0.00066825375],"domain_scores_gemma":[0.9989136,0.0000717295,0.00015426516,0.00067519303,0.0000747187,0.00011048351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018177959,0.0003376137,0.00043229896,0.00013228781,0.00039083266,0.0002249398,0.00051517994,0.0005659128,0.000008003372],"category_scores_gemma":[0.000024350657,0.00035917235,0.00009994685,0.00020644629,0.000074175325,0.00029114156,0.0000889617,0.00037432165,0.000002641458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003541768,0.000015509098,0.0040313937,0.000046478166,0.000022157365,0.000009389112,0.00014917573,0.9328424,0.000036265672,0.00078038085,0.005051774,0.056979693],"study_design_scores_gemma":[0.0010497902,0.000028626426,0.00082234025,0.00023897085,0.000019044934,0.000003135066,0.00011062235,0.99631053,0.00023008909,0.00019085736,0.00056737056,0.00042862707],"about_ca_topic_score_codex":0.00004047853,"about_ca_topic_score_gemma":0.00009101934,"teacher_disagreement_score":0.9674555,"about_ca_system_score_codex":0.00013312243,"about_ca_system_score_gemma":0.000034792043,"threshold_uncertainty_score":0.99988604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31818,0.0014250632,0.6751671,0.000053503918,0.0010798986,0.00034665182,0.000038312057,0.0008818927,0.0028276038],"genre_scores_gemma":[0.9907718,0.0014782612,0.0052674725,0.000071934126,0.000717081,0.00021692303,0.0006378392,0.00024492817,0.00059381867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966777,0.00011791561,0.0011006875,0.0006984012,0.00035349128,0.0010518038],"domain_scores_gemma":[0.9942622,0.0006920977,0.00079863355,0.0035121182,0.0003914426,0.00034346458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088488846,0.0006219835,0.0012747423,0.000333332,0.0009970518,0.0004344659,0.0019731228,0.0007128916,0.00002304807],"category_scores_gemma":[0.000082604405,0.0006980054,0.00043566086,0.0007176999,0.00041887152,0.0007553248,0.00026328728,0.00058473466,0.0000011520938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005452276,0.00007718698,0.008989711,0.00005485141,0.0009012909,0.0000045693073,0.000068279005,0.9583537,0.00024999527,0.0055939057,0.00082756,0.02482445],"study_design_scores_gemma":[0.0006793107,0.00006820108,0.008966084,0.00028341604,0.0008505563,0.000003602907,0.00005039937,0.98595166,0.0004604486,0.00008634568,0.001879443,0.00072050956],"about_ca_topic_score_codex":0.0010993145,"about_ca_topic_score_gemma":0.0029038326,"teacher_disagreement_score":0.67259175,"about_ca_system_score_codex":0.00014219852,"about_ca_system_score_gemma":0.000037517086,"threshold_uncertainty_score":0.9995471},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058880225,0.00014028365,0.93542755,0.00035980408,0.001767298,0.00040472875,0.0000052270943,0.0004997716,0.002515117],"genre_scores_gemma":[0.97939783,0.000046446352,0.01848646,0.00019168499,0.0012800179,0.000088125984,0.000014384367,0.000058446283,0.0004365821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971706,0.000064218,0.00039348484,0.0008925692,0.00052780204,0.0009512757],"domain_scores_gemma":[0.99688065,0.00024899893,0.0005160392,0.0018671218,0.00028466943,0.00020250307],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00064716773,0.0003620409,0.00039642456,0.00006117097,0.001552048,0.00096135365,0.0017720059,0.00026160022,0.0000034565137],"category_scores_gemma":[0.00006682851,0.0003237939,0.00013117134,0.00019536004,0.00014604276,0.0008801758,0.00038876245,0.00040119304,0.0000059851236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000695484,0.00006686282,0.010906954,0.000021500487,0.000062621264,0.00002769463,0.00023527445,0.9176893,0.00009919233,0.026433948,0.0013333537,0.04305375],"study_design_scores_gemma":[0.001135601,0.00013985185,0.006427314,0.00030823736,0.000022091457,0.000027429416,0.000018522209,0.9898826,0.00028726854,0.000076697455,0.001287008,0.00038737227],"about_ca_topic_score_codex":0.00013443257,"about_ca_topic_score_gemma":0.00031893424,"teacher_disagreement_score":0.9205176,"about_ca_system_score_codex":0.0002171021,"about_ca_system_score_gemma":0.00013908352,"threshold_uncertainty_score":0.99992144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15696009,0.00008656756,0.83362895,0.00053170207,0.0009703831,0.00033302378,4.4483872e-7,0.0006209044,0.00686795],"genre_scores_gemma":[0.98642117,0.00007068047,0.01162112,0.0002201582,0.0013685436,0.00006596275,0.000007500422,0.00005181705,0.00017306108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967209,0.00022782564,0.0004020889,0.0010392476,0.0005111617,0.0010987854],"domain_scores_gemma":[0.99781215,0.00015066298,0.00031067827,0.0012223131,0.00015177415,0.00035241537],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061179313,0.0004038605,0.0004929902,0.00018272958,0.0019535916,0.0025585624,0.0026215473,0.0003600761,0.0000041956478],"category_scores_gemma":[0.00007145566,0.00042072294,0.00014646066,0.00045302056,0.00016814386,0.0012647172,0.0009129413,0.0013220127,0.00003686253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002273928,0.00012449842,0.0011709352,0.0000248137,0.000049892176,0.00002547482,0.0018405764,0.87785673,0.00014511445,0.05416599,0.0006756224,0.063897625],"study_design_scores_gemma":[0.0003494148,0.00011044693,0.005044136,0.00009111551,0.000009716564,0.00006253488,0.00017518984,0.99186724,0.00009361902,0.0006959984,0.0009824994,0.000518085],"about_ca_topic_score_codex":0.00014222747,"about_ca_topic_score_gemma":0.00004143485,"teacher_disagreement_score":0.82946104,"about_ca_system_score_codex":0.00008829793,"about_ca_system_score_gemma":0.000086518776,"threshold_uncertainty_score":0.99982446},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002575646,0.00009848105,0.990629,0.00047036228,0.00032529628,0.0034303132,0.0000011441227,0.00023635685,0.004551464],"genre_scores_gemma":[0.90097225,0.00009254216,0.09516899,0.00017278454,0.00042936843,0.002904068,0.000007482883,0.00003285018,0.00021966017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788237,0.00023769618,0.00038308927,0.0007417695,0.00023654794,0.00051853905],"domain_scores_gemma":[0.99695086,0.00018021409,0.00052732066,0.0020025293,0.000107787615,0.00023126038],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012028005,0.00025314046,0.00032301786,0.000040521736,0.0009296874,0.0011521553,0.001730027,0.00023977779,0.0000051384204],"category_scores_gemma":[0.000053411175,0.00024377364,0.00006016034,0.000114481554,0.00016259638,0.0010610959,0.0008039437,0.00043761672,0.0000053101503],"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.000007695951,0.000028231896,0.0004450986,0.00001904297,0.000016402213,0.000014884551,0.00015086554,0.004619172,0.00004512568,0.4504369,0.00084376807,0.5433728],"study_design_scores_gemma":[0.00031176273,0.000033354016,0.0019879313,0.00014179623,0.000009864992,0.000019956635,0.00001573859,0.9851859,0.000010803598,0.010084902,0.0019198924,0.00027807264],"about_ca_topic_score_codex":0.000022596872,"about_ca_topic_score_gemma":0.000019581892,"teacher_disagreement_score":0.98056674,"about_ca_system_score_codex":0.000047017595,"about_ca_system_score_gemma":0.00007745247,"threshold_uncertainty_score":0.9998847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97990465,0.003902702,0.012894677,0.00012659909,0.000027600257,0.00024769388,0.0000054871293,0.00013023331,0.0027603654],"genre_scores_gemma":[0.9763191,0.02306022,0.0004122135,0.000029604926,0.00002411821,0.000048126814,0.00006295794,0.000026846626,0.000016838443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990909,0.000061562845,0.00034677208,0.00017783987,0.00010450272,0.00021843],"domain_scores_gemma":[0.998561,0.00016092868,0.00019415338,0.00092270557,0.000101105026,0.000060063005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040386536,0.00016715772,0.00037985863,0.00031278373,0.0002049001,0.0000951914,0.0004074118,0.00021658251,0.000007648733],"category_scores_gemma":[0.00003504312,0.00019073204,0.000038858918,0.00044762873,0.00024647824,0.0003938236,0.00021329011,0.00038459952,2.395417e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014542777,0.00014465285,0.43971428,0.00018511002,0.0010658674,0.0000024389274,0.004975463,0.45126918,0.00015758765,0.0130668795,0.00052483863,0.088748276],"study_design_scores_gemma":[0.00024221133,0.000017248602,0.24837735,0.00020685924,0.00006901116,0.0000012471774,0.000068802234,0.75064486,0.00009092912,0.000046321,0.000090589405,0.0001445631],"about_ca_topic_score_codex":0.00028616877,"about_ca_topic_score_gemma":0.00046075796,"teacher_disagreement_score":0.29937568,"about_ca_system_score_codex":0.00005795728,"about_ca_system_score_gemma":0.000014013431,"threshold_uncertainty_score":0.7777827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10411899,0.00014214413,0.8930338,0.0008493396,0.00025182043,0.00043180567,0.000015109879,0.000111753696,0.0010452173],"genre_scores_gemma":[0.9968954,0.00017682294,0.0001957519,0.00042057876,0.001491363,0.00017737999,0.00020105066,0.00001585105,0.00042581037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979727,0.00026998698,0.00035882107,0.0005107171,0.00040033858,0.00048740182],"domain_scores_gemma":[0.9982218,0.00014413148,0.00025501582,0.0008683881,0.00025096355,0.00025968623],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017179119,0.00016245416,0.0003579179,0.00011161841,0.0032959362,0.0004909542,0.00061702926,0.0002797769,0.00010908235],"category_scores_gemma":[0.000059697042,0.00016362467,0.00038526463,0.00037258776,0.00033267442,0.00053260947,0.000048657257,0.00018477623,0.000002430284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025438361,0.00012579838,0.028554944,0.000003909472,0.00038491603,8.92068e-7,0.0011346982,0.9431392,6.644219e-7,0.0040180795,0.00052929553,0.022082154],"study_design_scores_gemma":[0.00024726545,0.000041230953,0.01231617,0.000011688139,0.0006968338,2.0326128e-8,0.00062623917,0.9817729,0.0000012969267,0.0026683738,0.001444347,0.00017363408],"about_ca_topic_score_codex":0.005029499,"about_ca_topic_score_gemma":0.03946296,"teacher_disagreement_score":0.89283806,"about_ca_system_score_codex":0.00016119954,"about_ca_system_score_gemma":0.00010322484,"threshold_uncertainty_score":0.99800164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14927056,0.0013432284,0.8441837,0.00021786307,0.000813176,0.00019066305,0.000004491619,0.0001190964,0.0038572205],"genre_scores_gemma":[0.99743074,0.000713143,0.0002989695,0.0002013069,0.0011535325,0.000011996424,0.000012565331,0.00003014775,0.00014757765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717826,0.000253779,0.0005919519,0.0008613117,0.0002957235,0.0008190003],"domain_scores_gemma":[0.9986591,0.00040176505,0.00024279814,0.00037327662,0.0001446851,0.000178371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047209315,0.0003672282,0.0005625552,0.0002728633,0.0002679445,0.00015169934,0.00038535323,0.00023131956,0.000035659166],"category_scores_gemma":[0.000026570571,0.00036158608,0.00008675568,0.001532319,0.00056306174,0.00041846166,0.00026943535,0.00043051355,0.0000025208888],"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.0012428582,0.00142744,0.055640586,0.00005947192,0.0005721197,0.0006045588,0.0066908933,0.13176438,0.00050674204,0.2960762,0.0031783911,0.50223637],"study_design_scores_gemma":[0.0011729763,0.0006177779,0.0145748835,0.00031976384,0.0000208956,0.00008291853,0.0000793697,0.9811136,0.00080575974,0.0007487882,0.00010684592,0.00035639532],"about_ca_topic_score_codex":0.0001821173,"about_ca_topic_score_gemma":0.001304375,"teacher_disagreement_score":0.84934926,"about_ca_system_score_codex":0.00009727337,"about_ca_system_score_gemma":0.00008053288,"threshold_uncertainty_score":0.9998836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3035761,0.00028048872,0.6901107,0.000026728057,0.0039397473,0.0002627065,5.5281873e-8,0.00026944175,0.0015340289],"genre_scores_gemma":[0.9658821,0.000015689871,0.028985564,0.00030338456,0.0047002696,0.0000132742425,0.0000092489245,0.000040400362,0.000050016624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730694,0.00015981233,0.0005079871,0.0007962946,0.00021069417,0.001018287],"domain_scores_gemma":[0.99860734,0.00029373137,0.00028408208,0.00048180425,0.00017421777,0.00015879773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006377472,0.0003508906,0.00041577956,0.00016807919,0.0003994008,0.00033627957,0.0009318646,0.0001953361,0.0000016976477],"category_scores_gemma":[0.000005100462,0.00033722058,0.0000663238,0.001316214,0.00013512705,0.00031596454,0.00046547403,0.0005650318,0.000026683394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003168716,0.00011416581,0.02404339,0.00003278135,0.000016177488,0.00005825892,0.0015637394,0.81533474,0.00004371341,0.00028673722,0.0023596173,0.15611498],"study_design_scores_gemma":[0.0007700348,0.00020716825,0.004601687,0.0002889697,0.000005772436,0.000022779064,0.000031685115,0.99291676,0.00011155526,0.00005741233,0.0005446483,0.00044153896],"about_ca_topic_score_codex":0.000069100235,"about_ca_topic_score_gemma":0.000045251385,"teacher_disagreement_score":0.662306,"about_ca_system_score_codex":0.000117639065,"about_ca_system_score_gemma":0.0000711369,"threshold_uncertainty_score":0.999908},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06760875,0.0034044941,0.92597497,0.000014260821,0.0016214212,0.0006558856,0.0000069437415,0.00046654005,0.00024675584],"genre_scores_gemma":[0.98695016,0.0010769719,0.008778171,0.000054333366,0.0024166866,0.000089860034,0.00012541097,0.00015834915,0.00035006274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981603,0.000120656725,0.000466639,0.00056790776,0.00014834352,0.00053612696],"domain_scores_gemma":[0.9989351,0.000054081338,0.00012118776,0.0003973159,0.000316996,0.00017532021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020280326,0.0004308478,0.00037534986,0.00010501295,0.0003431131,0.00020233555,0.00015275997,0.0003896247,0.000030027117],"category_scores_gemma":[0.000012513891,0.0004663441,0.00006073372,0.00030736,0.00015610212,0.0006169594,0.000034324188,0.0003502948,0.000035528305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019144176,0.000049838127,0.00012994943,0.000023173414,0.00003957469,0.000007217086,0.0009580284,0.96234,0.031781215,0.00024553132,0.0006761582,0.003730185],"study_design_scores_gemma":[0.0013236429,0.00006157329,0.000028489023,0.00006285616,0.00003791938,0.000010209409,0.00043908172,0.9889912,0.008379916,0.0000021656874,0.00014613637,0.000516814],"about_ca_topic_score_codex":0.000081398386,"about_ca_topic_score_gemma":0.00042633738,"teacher_disagreement_score":0.9193414,"about_ca_system_score_codex":0.00031543194,"about_ca_system_score_gemma":0.000024733303,"threshold_uncertainty_score":0.9997788},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22549492,0.00057396584,0.7725179,0.00003222774,0.00040185056,0.00041585823,0.00001747034,0.00035842252,0.00018735428],"genre_scores_gemma":[0.9795628,0.00007244494,0.01927094,0.000027644663,0.00044460632,0.00036945296,0.00011226758,0.000071157185,0.0000686919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985814,0.00012709356,0.0004386893,0.0002936731,0.0000962906,0.0004628211],"domain_scores_gemma":[0.9983071,0.0002794607,0.000066636465,0.0011147858,0.000115381394,0.00011663906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050707505,0.00021664886,0.00044852355,0.0002774848,0.00011612139,0.00009730191,0.000594061,0.00022433426,0.000019166346],"category_scores_gemma":[0.000014698951,0.00023261947,0.00012869822,0.001230429,0.00005303316,0.00016797752,0.000047573514,0.00024993392,0.0000069518687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001355249,0.00003405429,0.0006489584,0.000026071102,0.0002208706,6.6695276e-7,0.00023304035,0.98537034,0.0014079454,0.00080098945,0.00021139762,0.011032099],"study_design_scores_gemma":[0.0003444188,0.00004848101,0.0014504844,0.000028907734,0.0001281634,0.000001205466,0.00014182986,0.9962785,0.00017490744,0.00000510559,0.0011296495,0.00026829282],"about_ca_topic_score_codex":0.00037780762,"about_ca_topic_score_gemma":0.0029024903,"teacher_disagreement_score":0.7540679,"about_ca_system_score_codex":0.000121061494,"about_ca_system_score_gemma":0.000015837402,"threshold_uncertainty_score":0.9485946},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006653709,0.000066616085,0.9921959,0.00020513733,0.00038910256,0.00014217832,0.0000718223,0.0002211508,0.00005435347],"genre_scores_gemma":[0.48414636,0.000020615249,0.5143785,0.0001041932,0.0012742274,0.0000053430376,0.00005008633,0.000017145472,0.0000035422777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984645,0.000051025378,0.00021656266,0.0005837248,0.00023024116,0.00045393422],"domain_scores_gemma":[0.9977524,0.0008016233,0.00010720033,0.0011010746,0.00013281491,0.000104879095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558152,0.0001538767,0.00022308726,0.00008615308,0.0003203132,0.00031122356,0.0019436617,0.00019754138,0.0000042579177],"category_scores_gemma":[0.00026265407,0.00015447667,0.000025515135,0.00041935724,0.0002965232,0.0003928442,0.0018486624,0.00024474374,0.0000021774565],"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.000053766464,0.000093558665,0.0011133599,0.00004571728,0.00011545329,0.000018810879,0.0020064584,0.000082736435,0.000059910137,0.40152714,0.037328836,0.55755424],"study_design_scores_gemma":[0.00012844279,0.000051022736,0.00031314374,0.000068304165,0.00002306641,0.0000065124273,0.000024355226,0.9799745,0.00005161812,0.017726853,0.0014458358,0.00018635392],"about_ca_topic_score_codex":0.000014584137,"about_ca_topic_score_gemma":0.00004429342,"teacher_disagreement_score":0.9798918,"about_ca_system_score_codex":0.000031395033,"about_ca_system_score_gemma":0.0000732217,"threshold_uncertainty_score":0.6299376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21253818,0.0048668203,0.71844023,0.0009077689,0.0599755,0.0012847834,0.0000038184617,0.00095866516,0.0010242215],"genre_scores_gemma":[0.9944335,0.000014169405,0.0023301132,0.00032070134,0.0025262763,0.00007569575,0.000020744703,0.000029091292,0.00024968467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834627,0.00006985162,0.00028558308,0.0005123219,0.00017412717,0.000611841],"domain_scores_gemma":[0.9988109,0.00010830212,0.00013022393,0.0005302305,0.0002924581,0.00012789658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019300773,0.00021008073,0.0003266353,0.000066430584,0.00021657167,0.00015911924,0.00076049624,0.00017276139,0.000001659083],"category_scores_gemma":[0.0000033537115,0.0001878892,0.00011133606,0.00041767836,0.000017190532,0.000105724284,0.00018797185,0.00026323687,0.000029369845],"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.00006812539,0.00003367751,0.029232755,0.0013978512,0.00009131053,0.000017700802,0.004221822,0.022565402,0.00008633354,0.013404725,0.01990374,0.90897655],"study_design_scores_gemma":[0.0004834426,0.000083359155,0.0007216553,0.00060840376,0.000007213886,0.0000064755895,0.0002969417,0.96465564,0.00015183125,0.000020494059,0.03266092,0.00030362784],"about_ca_topic_score_codex":0.00055926223,"about_ca_topic_score_gemma":0.000096981494,"teacher_disagreement_score":0.9420902,"about_ca_system_score_codex":0.0002763114,"about_ca_system_score_gemma":0.00017515496,"threshold_uncertainty_score":0.76618993},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47687033,0.0011742858,0.520761,0.0002490018,0.0003544375,0.0004080054,7.174931e-7,0.000074236545,0.0001079516],"genre_scores_gemma":[0.9968938,0.000039294096,0.0023411843,0.0004521613,0.00013813461,0.000057329904,0.000020438838,0.00002631899,0.000031330048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724483,0.00037755285,0.0005188233,0.00078666135,0.0003119177,0.0007601994],"domain_scores_gemma":[0.9986129,0.00033221688,0.00020478689,0.000678636,0.00005062898,0.00012085873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008857122,0.00030585003,0.0004664796,0.00021139736,0.000120212106,0.00034479584,0.00069632626,0.00022017448,0.0000086450655],"category_scores_gemma":[0.000010133556,0.00030667312,0.00006146966,0.0007249355,0.00006177365,0.0006764663,0.00037720645,0.0006430115,0.000004860257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003699426,0.00020447078,0.20693569,0.00010457195,0.000016912643,0.0002979998,0.0007628693,0.69141287,0.0001472256,0.0027128954,0.000062119696,0.09730541],"study_design_scores_gemma":[0.001197607,0.000060521914,0.015869545,0.00062723237,0.000004248822,0.0000042982088,0.00011700098,0.98134923,0.00019501246,0.00011045986,0.00008821277,0.0003766581],"about_ca_topic_score_codex":0.0004968271,"about_ca_topic_score_gemma":0.0003851316,"teacher_disagreement_score":0.52002347,"about_ca_system_score_codex":0.00013202066,"about_ca_system_score_gemma":0.0001408778,"threshold_uncertainty_score":0.99993855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49147198,0.00024270595,0.50534457,0.00019661819,0.001512218,0.0005510241,0.0000025403974,0.0003857741,0.00029258704],"genre_scores_gemma":[0.9769022,0.00013779083,0.020104693,0.0011868363,0.00088589574,0.000043124604,0.000035990946,0.00018290721,0.000520555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930609,0.00066338485,0.0011298346,0.0019823068,0.00086127484,0.0023023405],"domain_scores_gemma":[0.9960461,0.0006932979,0.0005651246,0.0019961204,0.000250134,0.00044916975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006043779,0.0009773417,0.0013089982,0.0003883072,0.00029301326,0.0002556263,0.0018234137,0.00082721555,0.0000612816],"category_scores_gemma":[0.000012498194,0.00090722414,0.0002262541,0.0019342019,0.0004240282,0.00057451334,0.00074221235,0.0015560011,0.00005697468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016736866,0.00022009326,0.014585399,0.0000137148545,0.000084073145,0.0003417133,0.0003123081,0.96952564,0.00029496782,0.008594683,0.000102001,0.0057580383],"study_design_scores_gemma":[0.002656827,0.00035857025,0.00096935907,0.00035669556,0.00003052827,0.00019816557,0.00021617148,0.9932086,0.0004443435,0.000007283872,0.00038133227,0.0011721523],"about_ca_topic_score_codex":0.00036439596,"about_ca_topic_score_gemma":0.00025945116,"teacher_disagreement_score":0.48543024,"about_ca_system_score_codex":0.00042409296,"about_ca_system_score_gemma":0.0001830482,"threshold_uncertainty_score":0.99933785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80795616,0.0012148002,0.18424599,0.00045757496,0.00033956848,0.0015126537,0.000010947527,0.00018999541,0.0040723057],"genre_scores_gemma":[0.9974715,0.000031196887,0.00043671537,0.0012000151,0.00025092787,0.00012205679,0.000039966355,0.00006595209,0.00038163367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987815,0.000059246955,0.00024538868,0.00014988838,0.00012361704,0.00064032717],"domain_scores_gemma":[0.9993383,0.00022987899,0.000042798674,0.0002902343,0.000026226633,0.00007250792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042670895,0.00026261824,0.0002952729,0.000054445147,0.000039513005,0.00015423236,0.00029782316,0.0001902078,0.000008519279],"category_scores_gemma":[0.000003882755,0.00020597792,0.00006235117,0.00027307373,0.0000417122,0.0001747074,0.000048557962,0.0002947318,0.0000030905776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001072543,0.000018357629,0.002033589,0.00030547535,0.000028831886,4.3066626e-7,0.0038195113,0.9758101,0.00002101346,0.00043917913,0.016769262,0.00064700976],"study_design_scores_gemma":[0.0008207729,0.00003162803,0.0005419487,0.00011388871,0.00002131766,0.000004310246,0.000336626,0.99658144,0.00000976493,0.00010545643,0.0011709754,0.00026186078],"about_ca_topic_score_codex":0.00007502938,"about_ca_topic_score_gemma":0.00026102742,"teacher_disagreement_score":0.18951537,"about_ca_system_score_codex":0.00004032204,"about_ca_system_score_gemma":0.000029287292,"threshold_uncertainty_score":0.83995354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082024924,0.00048347597,0.9142819,0.00018013288,0.00010822675,0.00048158012,0.000009697835,0.0019276303,0.000502433],"genre_scores_gemma":[0.986316,0.0025172087,0.01053652,0.00012695619,0.00006792222,0.00023071178,0.000113001006,0.00008843442,0.0000032417704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982392,0.000042090083,0.00046760705,0.00044192965,0.00017944202,0.0006297171],"domain_scores_gemma":[0.9988775,0.00016538546,0.00011050509,0.00065803505,0.000049503447,0.00013906747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000089701636,0.00039605785,0.0004228384,0.000109160224,0.000099616955,0.0001241595,0.001211005,0.00021544693,0.00001219861],"category_scores_gemma":[0.000011136362,0.00039433507,0.000057176694,0.00095737533,0.00010068894,0.00039372037,0.00036403188,0.00095248234,0.0000065088047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007360612,0.000038620954,0.006133427,0.00006559457,0.00009465414,0.000057509864,0.00013659043,0.97409606,0.000043026517,0.000208101,0.00023123968,0.018821584],"study_design_scores_gemma":[0.0009842839,0.000041227082,0.0040615387,0.00022181027,0.000017772929,0.000005033207,0.0002489289,0.99324036,0.00043293583,0.000022645416,0.00025000476,0.0004734539],"about_ca_topic_score_codex":0.0000062390054,"about_ca_topic_score_gemma":0.00008057629,"teacher_disagreement_score":0.9042911,"about_ca_system_score_codex":0.00011636482,"about_ca_system_score_gemma":0.000009858393,"threshold_uncertainty_score":0.99985087},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29907876,0.00038929752,0.6965414,0.00021037715,0.0028653184,0.0007367204,0.0000015661714,0.00013676302,0.000039810573],"genre_scores_gemma":[0.98675054,0.000034160483,0.010694743,0.00051697437,0.0017978919,0.00012330154,0.00003279721,0.00003340948,0.000016164428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796957,0.00012320957,0.00043500322,0.00067221,0.00022654871,0.0005734855],"domain_scores_gemma":[0.99895555,0.00036386086,0.00018376774,0.0002555929,0.00006010414,0.0001811149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025119848,0.00026903753,0.0003497434,0.000067733316,0.00021741068,0.00017375295,0.0005615693,0.0001434152,0.0000034524169],"category_scores_gemma":[0.00001989521,0.0002914762,0.000103418446,0.00051354035,0.000052724346,0.00026950042,0.00032796874,0.00023366483,0.000026751964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055174016,0.000083012004,0.0035060868,0.00003776597,0.00003573126,0.000027401187,0.0039268187,0.9309028,0.00023555705,0.00012606199,0.0035707674,0.05749283],"study_design_scores_gemma":[0.0010314566,0.00018543891,0.00053783535,0.000044486867,0.000007097378,0.0000030390722,0.000073175645,0.9903702,0.00086593954,0.000062770545,0.006492477,0.000326074],"about_ca_topic_score_codex":0.00001593705,"about_ca_topic_score_gemma":0.000011067072,"teacher_disagreement_score":0.6876718,"about_ca_system_score_codex":0.00015636583,"about_ca_system_score_gemma":0.000058521597,"threshold_uncertainty_score":0.99995375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05865993,0.00004344707,0.93755823,0.0026188954,0.0001800484,0.00052226114,0.000011004093,0.00034833557,0.00005787033],"genre_scores_gemma":[0.9889621,0.000029026896,0.009764225,0.00057986635,0.00022899911,0.00018573517,0.00012313464,0.000044250068,0.00008266388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997583,0.00011279167,0.00053697714,0.0008417527,0.00034497725,0.00058051274],"domain_scores_gemma":[0.99871886,0.00018112786,0.0002618383,0.0004131323,0.0001959292,0.00022911203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003185585,0.00028928736,0.00038575244,0.000100369005,0.00018640261,0.0001582913,0.0009157161,0.00026015379,0.0000030397841],"category_scores_gemma":[0.00006337158,0.0003185768,0.00012778776,0.00079261145,0.000046477337,0.0006675247,0.000149913,0.00043446838,0.000010026445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043598662,0.0000441337,0.000610271,0.00002042073,0.000010123558,0.000002840588,0.000630065,0.98640263,0.00079504785,0.006324277,0.0007711433,0.004345427],"study_design_scores_gemma":[0.00086061144,0.000045498928,0.00076305505,0.00005862317,0.000008025179,9.484607e-7,0.000023191014,0.996008,0.00020289558,0.0016149448,0.000057128014,0.00035708462],"about_ca_topic_score_codex":0.00001569962,"about_ca_topic_score_gemma":0.00005648452,"teacher_disagreement_score":0.93030214,"about_ca_system_score_codex":0.00014774867,"about_ca_system_score_gemma":0.000107984895,"threshold_uncertainty_score":0.9999266},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028169084,0.001528673,0.9616,0.005763636,0.00076805573,0.000964827,0.0000031767572,0.0007001114,0.000502428],"genre_scores_gemma":[0.9909798,0.00037001984,0.0007774468,0.0048585404,0.002699826,0.00016444085,0.000021984875,0.00006980755,0.000058114394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954033,0.0006172544,0.00093540445,0.001245655,0.0005849352,0.0012134782],"domain_scores_gemma":[0.99707866,0.0008475255,0.00047929984,0.00071873766,0.00032479173,0.0005510007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085472775,0.0006229252,0.0010969049,0.00011545279,0.00029837617,0.00045153924,0.0012988005,0.00038833628,0.00003480438],"category_scores_gemma":[0.00005945565,0.0005623992,0.00019191264,0.0014345009,0.00019717494,0.0006728335,0.00018839998,0.0012038162,0.000034459623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079611276,0.00004916287,0.00886365,0.000027054659,0.00008290563,0.00027143306,0.00015889898,0.6499718,0.000008982272,0.009261572,0.0011139173,0.3293945],"study_design_scores_gemma":[0.010497146,0.00018574734,0.0020073978,0.00040376553,0.000052546806,0.00003265687,0.000040464955,0.9843093,0.0000038202215,0.00003038835,0.0017461843,0.00069055386],"about_ca_topic_score_codex":0.000032850654,"about_ca_topic_score_gemma":0.0000675051,"teacher_disagreement_score":0.96281075,"about_ca_system_score_codex":0.00010297874,"about_ca_system_score_gemma":0.00012569089,"threshold_uncertainty_score":0.9996827},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018894296,0.0038699252,0.97529244,0.00035080008,0.00065123197,0.0003893804,0.0000021507478,0.00016471186,0.00038506027],"genre_scores_gemma":[0.871318,0.000440881,0.12720202,0.00029729056,0.00046652567,0.000012852291,0.000065847016,0.000053717624,0.0001428606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709696,0.00048613606,0.00048653415,0.00092671876,0.00014247854,0.0008611549],"domain_scores_gemma":[0.9977605,0.0014246405,0.00021052963,0.00027037557,0.00016785046,0.0001661096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010132722,0.00038109647,0.00059025374,0.00018088933,0.00043921883,0.00044996783,0.00018007899,0.0002181899,0.000018373556],"category_scores_gemma":[0.00014844409,0.0004277401,0.00010589831,0.0010216461,0.00008040716,0.0004501582,0.0003044954,0.00076845736,6.7097676e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004830577,0.000031421816,0.00021214758,0.000033170905,0.000067328365,0.00013978095,0.00063678226,0.30269834,0.00012788984,0.0012476018,0.000030354684,0.6947269],"study_design_scores_gemma":[0.0012298565,0.000080230406,0.0010277367,0.00041292256,0.000029402436,0.00029770072,0.00009404493,0.99407417,0.0006453809,0.0013789006,0.00023228017,0.0004973992],"about_ca_topic_score_codex":0.000032797656,"about_ca_topic_score_gemma":0.0005867396,"teacher_disagreement_score":0.8524237,"about_ca_system_score_codex":0.00009692314,"about_ca_system_score_gemma":0.00006314996,"threshold_uncertainty_score":0.99981743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023704972,0.0039078626,0.97162205,0.000035407833,0.00014089227,0.00038206246,0.000043802924,0.00014280206,0.000020121355],"genre_scores_gemma":[0.9862497,0.0007420675,0.011856194,0.000056636447,0.0003034578,0.00028767416,0.00019174232,0.000047220066,0.00026530176],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893516,0.000021284735,0.00032613327,0.00033786794,0.000089125446,0.00029044686],"domain_scores_gemma":[0.9994491,0.000047416826,0.000060815688,0.00021278691,0.00010958252,0.000120335266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013557753,0.00020700312,0.0003007183,0.00006162408,0.0002025074,0.00011184179,0.00006899692,0.00013548162,0.0000040702157],"category_scores_gemma":[0.000006359425,0.00021186628,0.00006729079,0.00023674226,0.00003801018,0.00009520244,0.000014614842,0.0001160125,0.000002482698],"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.00002487863,0.00023443613,0.0055546854,0.00075716194,0.0006393303,0.00001389488,0.00036505927,0.016364686,0.940451,0.00037965298,0.00050971593,0.034705482],"study_design_scores_gemma":[0.0013863335,0.00001003759,0.0010914223,0.00009460958,0.000104114646,0.00001577576,0.00019145686,0.99473757,0.0016701153,0.0000012126488,0.00046177433,0.00023560705],"about_ca_topic_score_codex":0.00003145672,"about_ca_topic_score_gemma":0.00023726387,"teacher_disagreement_score":0.9783729,"about_ca_system_score_codex":0.000040166833,"about_ca_system_score_gemma":0.0000129169375,"threshold_uncertainty_score":0.86396563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05022062,0.0073496266,0.9371217,0.00044963098,0.0006867718,0.00019181699,0.0000030989981,0.00016467407,0.0038120595],"genre_scores_gemma":[0.9953867,0.0025544611,0.00046513672,0.00065242255,0.0006554713,0.00002356412,0.000024509502,0.00003690427,0.00020084047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966197,0.00044179292,0.00047477795,0.0011749056,0.00030335478,0.0009854918],"domain_scores_gemma":[0.99834394,0.000681524,0.00013835625,0.00040503684,0.000177703,0.00025342518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035408934,0.00042198692,0.00058509124,0.00016452384,0.00032254186,0.00039490615,0.00035539098,0.00024663677,0.000025274912],"category_scores_gemma":[0.0000378512,0.000433642,0.00010702577,0.001660336,0.00022908337,0.00048203493,0.00043384326,0.00057745056,0.0000020717328],"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.00027474185,0.000734903,0.013247727,0.000024787407,0.00030928192,0.0044317343,0.0024335196,0.298083,0.000108907334,0.13492866,0.001133949,0.54428875],"study_design_scores_gemma":[0.0012724703,0.00015497603,0.008866945,0.0003012057,0.000020947497,0.00025596673,0.00015213776,0.98729295,0.00027202538,0.0006992404,0.00020622154,0.0005049409],"about_ca_topic_score_codex":0.00007368186,"about_ca_topic_score_gemma":0.00093584304,"teacher_disagreement_score":0.94516605,"about_ca_system_score_codex":0.0001255552,"about_ca_system_score_gemma":0.00015789444,"threshold_uncertainty_score":0.99981153},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012140077,0.00015193912,0.9971223,0.00006792415,0.0003350876,0.00044847085,0.000022177132,0.00012581355,0.0005122666],"genre_scores_gemma":[0.9667552,0.0000077316345,0.032566696,0.00008259773,0.00020505801,0.00020558471,0.00012769007,0.000024539704,0.000024903431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915135,0.00010604015,0.00032230877,0.00017585412,0.00008152304,0.00016289836],"domain_scores_gemma":[0.99908227,0.00049458566,0.00008080627,0.00017836297,0.00012798712,0.000035967034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023616198,0.000117295676,0.00024973362,0.000038775514,0.000043330692,0.0000112901635,0.00010161214,0.00023181939,0.00003442842],"category_scores_gemma":[0.000049437836,0.00011597143,0.00008464992,0.00018956255,0.00003280017,0.000049562685,0.000015946094,0.00017491671,0.0000021709523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000908752,0.00003820182,0.000074453186,0.0000055610917,0.00004292785,6.5701073e-7,0.000035513145,0.9876662,0.00065069704,0.0039472403,0.0013689075,0.0060787885],"study_design_scores_gemma":[0.00067192514,0.00006726663,0.00005797888,0.000058346843,0.000015077712,0.0000010940493,0.000042938682,0.99713916,0.0011825613,0.00005712793,0.0005963349,0.00011019663],"about_ca_topic_score_codex":0.000021154185,"about_ca_topic_score_gemma":0.0000025654667,"teacher_disagreement_score":0.9655412,"about_ca_system_score_codex":0.000063859196,"about_ca_system_score_gemma":0.00003145556,"threshold_uncertainty_score":0.47291777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63996965,0.003253208,0.35590133,0.000101969905,0.00016181362,0.00031337846,0.000033974648,0.0002519187,0.000012719475],"genre_scores_gemma":[0.9968064,0.0003443787,0.002490417,0.00000338271,0.000028210727,0.00023697253,0.000036811965,0.000012005563,0.000041443705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919355,0.00006730487,0.00037695406,0.00014663092,0.00008974107,0.00012579712],"domain_scores_gemma":[0.9992036,0.0002428544,0.00010476281,0.0003619503,0.000067740286,0.000019047799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042998313,0.00009285172,0.0002807976,0.00010928578,0.00017708252,0.000023271907,0.00018600083,0.000051372193,0.000005506653],"category_scores_gemma":[0.000033817123,0.00009444441,0.00006942486,0.00053620024,0.0000660147,0.000048077778,0.000051781324,0.00014535947,1.4102248e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008931491,0.000021212423,0.0025369555,0.00022766925,0.000478573,6.221018e-8,0.00054044323,0.9644684,0.00059583696,0.0022458867,0.00078608235,0.028089901],"study_design_scores_gemma":[0.00027260126,0.000042244654,0.014708208,0.000034188317,0.00036198288,0.0000019103904,0.0016180208,0.980641,0.00013482223,0.0011688893,0.0007931714,0.00022293508],"about_ca_topic_score_codex":0.00007357257,"about_ca_topic_score_gemma":0.00007137772,"teacher_disagreement_score":0.3568367,"about_ca_system_score_codex":0.00006712095,"about_ca_system_score_gemma":0.0000062771123,"threshold_uncertainty_score":0.38513315},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99478775,0.000162615,0.0021589943,0.00010065741,0.0012628499,0.00066731987,0.00021669574,0.0001092094,0.00053387997],"genre_scores_gemma":[0.9981356,0.00006773674,0.0006837627,0.00012366289,0.00018460634,0.000427324,0.00004708205,0.000042255757,0.0002879141],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99738383,0.00047428333,0.0006736202,0.0005442699,0.000446014,0.00047796586],"domain_scores_gemma":[0.9984582,0.00015462977,0.00054681266,0.0006263508,0.00010155137,0.00011247339],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009864127,0.0002708637,0.00059261854,0.00007496524,0.0004258744,0.00008856192,0.00061694277,0.00007237745,0.002076102],"category_scores_gemma":[0.000025844689,0.00024243786,0.00012449014,0.00042160755,0.00017582475,0.0001212294,0.0003110148,0.00019844959,0.00007309185],"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.00048099214,0.0001917422,0.000035201712,0.000025277019,0.000040799972,0.0000056463145,0.00030132543,0.007515061,0.983636,0.0070779407,0.00026393236,0.00042606352],"study_design_scores_gemma":[0.0014214047,0.00040396015,0.0018803565,0.000051019895,0.00010512573,0.000018194512,0.00044595014,0.026763821,0.9644711,0.0010859622,0.0028423676,0.00051072414],"about_ca_topic_score_codex":0.00029023745,"about_ca_topic_score_gemma":0.000028256698,"teacher_disagreement_score":0.019248761,"about_ca_system_score_codex":0.00007086209,"about_ca_system_score_gemma":0.00007783674,"threshold_uncertainty_score":0.99883616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003129976,0.0026805752,0.99226826,0.0002472822,0.00015275017,0.00054301356,0.000011378671,0.00035867136,0.0006080766],"genre_scores_gemma":[0.9906957,0.00027239992,0.006951432,0.000116300354,0.00008023843,0.0011978401,0.0000828985,0.00006362937,0.00053952663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990326,0.0001599004,0.00025921132,0.00012996621,0.00011887098,0.0002994541],"domain_scores_gemma":[0.99879277,0.00017200946,0.000041148,0.00090389483,0.000033888275,0.000056285357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037422797,0.00013017282,0.00017612363,0.000049414666,0.0005572467,0.000064827684,0.00084394193,0.000052331743,0.00006726311],"category_scores_gemma":[3.9831465e-7,0.0001402555,0.000074138334,0.00018394738,0.000033024116,0.000088277506,0.0002697999,0.0002617591,0.000009495921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024007948,0.000050349863,0.00032852613,0.000026662228,0.00008356165,9.491538e-7,0.0003617272,0.98415744,0.0004630256,0.0012296526,0.0039267964,0.009347291],"study_design_scores_gemma":[0.0004141653,0.00002818452,0.000061704704,0.000011336725,0.000015214449,0.000008073586,0.00017414764,0.8558163,0.00023564375,0.00021905765,0.14283311,0.00018302568],"about_ca_topic_score_codex":0.000017484499,"about_ca_topic_score_gemma":0.000029639177,"teacher_disagreement_score":0.98756576,"about_ca_system_score_codex":0.00011690333,"about_ca_system_score_gemma":0.000013472934,"threshold_uncertainty_score":0.57194537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03762367,0.0006630171,0.9546249,0.0007798576,0.0005196814,0.0053516976,0.000010327555,0.0003709296,0.00005590701],"genre_scores_gemma":[0.9883373,0.00007135716,0.0009862507,0.00059956865,0.00040513504,0.00920203,0.00010803808,0.00007765313,0.00021267406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959387,0.00082027016,0.00065981585,0.001038816,0.0005096505,0.0010327523],"domain_scores_gemma":[0.9980419,0.000723221,0.00058859185,0.00036672482,0.00010156962,0.00017794313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018246472,0.00044480394,0.0006101403,0.00024087026,0.0009338486,0.00064936955,0.0010924722,0.00031625715,0.000030489186],"category_scores_gemma":[0.000028131202,0.00048255842,0.00017817561,0.0012582262,0.00004274681,0.0005533076,0.00072222983,0.001196775,8.411089e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019221593,0.00015975045,0.0376015,0.000035858102,0.000044926343,0.00000975113,0.00010526221,0.9117553,0.000005669154,0.001286535,0.00065464014,0.04814859],"study_design_scores_gemma":[0.0019903264,0.000349551,0.002973698,0.000048136277,0.000018715562,0.000017203438,0.000014288734,0.9893179,0.000050583556,0.00026382128,0.004407229,0.0005485376],"about_ca_topic_score_codex":0.00017441846,"about_ca_topic_score_gemma":0.000483719,"teacher_disagreement_score":0.9536387,"about_ca_system_score_codex":0.00054103317,"about_ca_system_score_gemma":0.00010635604,"threshold_uncertainty_score":0.9997626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33247182,0.00011881107,0.666852,0.00012915596,0.000067480956,0.0002586319,7.398884e-7,0.00009223747,0.000009140985],"genre_scores_gemma":[0.9708945,0.00003334276,0.02869231,0.000116820054,0.00001496054,0.00018300394,0.0000054127077,0.000019238068,0.000040402883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986802,0.00010996872,0.0002927445,0.0004831856,0.00018083185,0.00025312058],"domain_scores_gemma":[0.9991491,0.00012194094,0.00024363077,0.00039213113,0.00004124202,0.000051967716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002029167,0.00014322817,0.00018888945,0.00012695033,0.0001597931,0.000041356932,0.00046408715,0.00005764139,0.0000027106587],"category_scores_gemma":[0.0000072168714,0.0001464774,0.000026837784,0.0008671418,0.00007717704,0.0003788982,0.00032700514,0.0004821396,0.0000011249786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014970188,0.0005503515,0.0149640795,0.00004977562,0.000046487523,0.000020146668,0.0034887702,0.64438206,0.06611843,0.0076072407,0.000020214618,0.26260272],"study_design_scores_gemma":[0.00066059065,0.00007677798,0.05287529,0.000031227664,0.0000037136197,0.000015590964,0.00010257446,0.9456633,0.00025528116,0.000104122155,0.00006045318,0.00015110517],"about_ca_topic_score_codex":0.00008412269,"about_ca_topic_score_gemma":0.00030459755,"teacher_disagreement_score":0.6384227,"about_ca_system_score_codex":0.00015012667,"about_ca_system_score_gemma":0.000018263438,"threshold_uncertainty_score":0.59731746},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020386308,0.0012544848,0.97701883,0.00014114904,0.00008443231,0.0007142075,0.00004760675,0.00030856504,0.000044415552],"genre_scores_gemma":[0.9964339,0.00016896818,0.001391129,0.00019768807,0.00022199572,0.0010844332,0.00020591579,0.00009160684,0.00020433823],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985653,0.00005106304,0.0003059137,0.00039069375,0.00023288814,0.00045413035],"domain_scores_gemma":[0.99924374,0.00013302025,0.00007992158,0.00033718644,0.00006589436,0.00014021636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021635254,0.0002717089,0.00040854394,0.00011154392,0.0005048957,0.000104930536,0.00022926314,0.00009249905,0.00004345008],"category_scores_gemma":[0.0000048814,0.00026238753,0.00012125278,0.0005561479,0.000068754794,0.00013524843,0.00006560473,0.00033463948,0.0000024511878],"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.0018626375,0.0011156716,0.07050189,0.0010743997,0.0058554225,0.00027412182,0.004462517,0.10517977,0.7562109,0.01897149,0.0029145584,0.03157661],"study_design_scores_gemma":[0.0011018903,0.00007583768,0.00051195,0.000021808757,0.00017448206,0.000022215188,0.00026138738,0.9953235,0.000021381884,0.00014546695,0.0019566615,0.00038343685],"about_ca_topic_score_codex":0.000058166224,"about_ca_topic_score_gemma":0.00007537803,"teacher_disagreement_score":0.97604764,"about_ca_system_score_codex":0.00007404126,"about_ca_system_score_gemma":0.00003456079,"threshold_uncertainty_score":0.99998283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03552652,0.0000387452,0.866918,0.00089233095,0.00031856165,0.09577688,8.682753e-7,0.00022251449,0.0003055779],"genre_scores_gemma":[0.7807688,0.000004018153,0.031134738,0.00016835796,0.000044892433,0.18782966,0.00001169783,0.000007170985,0.00003062849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912965,0.00012717892,0.00027199494,0.00016837801,0.00011189731,0.00019091323],"domain_scores_gemma":[0.99876034,0.0005040861,0.0001852292,0.00046222354,0.00006994271,0.000018182596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096172636,0.00007914921,0.0001067867,0.000060136204,0.0000693209,0.000060236147,0.0011733983,0.000064690044,0.0000016587006],"category_scores_gemma":[0.00003965445,0.000058764388,0.000038386937,0.0004824428,0.00003863416,0.0003201345,0.00014459234,0.00014479991,0.000004027038],"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.000046532863,0.00090497,0.07244251,0.00041502432,0.00004386289,0.00000310786,0.1782674,0.018384604,0.00035722408,0.038179565,0.007242199,0.683713],"study_design_scores_gemma":[0.00038883142,0.000038162147,0.008193711,0.00015243853,0.0000017240205,7.730495e-7,0.00060104084,0.9893436,0.00005705025,0.00035438896,0.00079830387,0.00006996719],"about_ca_topic_score_codex":0.00022943555,"about_ca_topic_score_gemma":0.00009194089,"teacher_disagreement_score":0.970959,"about_ca_system_score_codex":0.000024602654,"about_ca_system_score_gemma":0.000036803427,"threshold_uncertainty_score":0.23963422},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870117,0.00013733144,0.010664193,0.0007704477,0.00024528272,0.0004251321,0.000023817556,0.00013263474,0.0005895001],"genre_scores_gemma":[0.99681216,0.000019043166,0.0016489731,0.00012439686,0.0011183918,0.000033079254,0.00016092947,0.0000023524678,0.000080682905],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986155,0.0001084529,0.00034897582,0.0003263733,0.00014279023,0.00045789024],"domain_scores_gemma":[0.99829763,0.0014215173,0.00012008834,0.000041452375,0.0000487729,0.00007052642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059839134,0.00015461333,0.00033313842,0.000022193826,0.00014704293,0.000029525685,0.00023886921,0.00017174042,0.000022694303],"category_scores_gemma":[0.000044200227,0.000063250125,0.00013863541,0.00097243977,0.00003365778,0.000065890425,0.00006949998,0.0002476946,0.0000030940353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007777135,0.00011659609,0.008103007,0.000036461453,0.000021388392,0.00000430941,0.0004176196,0.0016007662,0.04314517,0.0014586452,0.0028619056,0.9421564],"study_design_scores_gemma":[0.00124816,0.00034709435,0.59174925,0.00033349748,0.0000414352,0.000012710431,0.00095485256,0.39310798,0.0024266017,0.0028255852,0.0062557682,0.00069705775],"about_ca_topic_score_codex":0.00015292886,"about_ca_topic_score_gemma":0.00088705885,"teacher_disagreement_score":0.9414593,"about_ca_system_score_codex":0.000012910981,"about_ca_system_score_gemma":0.000005711867,"threshold_uncertainty_score":0.25792652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12078023,0.00027023122,0.8742308,0.000034388388,0.0005731986,0.00033705484,0.0000010678431,0.0036690375,0.000103965984],"genre_scores_gemma":[0.9895245,0.0001003699,0.009710359,0.00006935929,0.0003512316,0.00008111543,0.0000080682175,0.000063875865,0.00009115219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997488,0.00023771946,0.00041227983,0.00076096784,0.00032488385,0.0007761075],"domain_scores_gemma":[0.9989406,0.00021174253,0.0001184116,0.000429686,0.00012380871,0.00017574777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059190334,0.00033325472,0.00038346442,0.0002446497,0.00070142077,0.00023199817,0.00036499003,0.00029284615,0.000003814205],"category_scores_gemma":[0.000015683705,0.0003604741,0.000107869644,0.0016197922,0.000069854694,0.0004793883,0.00016174484,0.0005927909,0.000013313452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004415001,0.0000117583995,0.0006650222,0.00010457613,0.00002170497,0.00008476015,0.000095812786,0.83782655,0.004567933,0.0007087933,0.00007135715,0.1557976],"study_design_scores_gemma":[0.00042018862,0.00013542175,0.0002257852,0.00023805919,0.000016580701,0.00008186641,0.000067658635,0.9862456,0.011049546,0.00012171721,0.0009967736,0.00040083923],"about_ca_topic_score_codex":0.000037614478,"about_ca_topic_score_gemma":0.00004488398,"teacher_disagreement_score":0.86874425,"about_ca_system_score_codex":0.00017085369,"about_ca_system_score_gemma":0.000042490952,"threshold_uncertainty_score":0.9998847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.537688,0.00013103934,0.45819116,0.00008492687,0.0031741078,0.00037640202,0.0000012356442,0.00029286338,0.000060223007],"genre_scores_gemma":[0.9899709,0.000028899301,0.008330361,0.00016153185,0.0013525996,0.00002359081,0.000026261983,0.000046122004,0.00005969207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976891,0.00014667981,0.00043042432,0.000705023,0.00020485678,0.00082388095],"domain_scores_gemma":[0.9987634,0.0005319615,0.00018386103,0.00025232873,0.00014251817,0.00012596056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053013454,0.00030487045,0.0004520124,0.00028137083,0.0006181281,0.00021978444,0.0003202607,0.00018840788,4.381344e-7],"category_scores_gemma":[0.000033683475,0.00032332394,0.00010269123,0.0010168131,0.000078935955,0.00031975436,0.000563489,0.00026449395,0.0000062376885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001290568,0.000112379144,0.0024679375,0.00009463426,0.00013626038,0.0006110166,0.010495191,0.8337158,0.0006542193,0.00046888817,0.00410653,0.14700808],"study_design_scores_gemma":[0.00067732134,0.00013844941,0.0018580443,0.00024577463,0.000016138954,0.000040506453,0.00008678077,0.9953362,0.0003059079,0.0007309606,0.00018536898,0.00037855015],"about_ca_topic_score_codex":0.00016870648,"about_ca_topic_score_gemma":0.000069796326,"teacher_disagreement_score":0.4522829,"about_ca_system_score_codex":0.00013662048,"about_ca_system_score_gemma":0.00006906557,"threshold_uncertainty_score":0.99992186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95965123,0.00038138498,0.03732533,0.0014822867,0.00041035717,0.00030333048,0.00001559899,0.00019505662,0.0002354153],"genre_scores_gemma":[0.9966934,0.0005209458,0.00052675937,0.00025459955,0.0013292901,0.0000438171,0.00028240267,0.00003504771,0.00031373632],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980888,0.000114797665,0.00043666654,0.00048694736,0.00040576918,0.00046705172],"domain_scores_gemma":[0.998742,0.00048503888,0.00016047824,0.00025255376,0.00012867579,0.00023126391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004793761,0.00026329298,0.00052785804,0.00013781774,0.00026065204,0.000030615236,0.0000685998,0.00036025397,0.000033887707],"category_scores_gemma":[0.000025847674,0.00022629362,0.0001496624,0.0005868218,0.00026060478,0.00006893613,0.00002788903,0.00056930835,0.000003759225],"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.0012216388,0.0002742712,0.45997155,0.00011021038,0.0002218473,0.00013006263,0.000055265842,0.4356815,0.00049922743,0.00040355365,0.002775026,0.09865588],"study_design_scores_gemma":[0.00087546674,0.00018163488,0.31617704,0.00013675382,0.00013188993,0.000022202583,0.000046458073,0.68207973,0.000009855188,0.00003636093,0.00016130043,0.00014130173],"about_ca_topic_score_codex":0.000013238937,"about_ca_topic_score_gemma":0.000006243968,"teacher_disagreement_score":0.24639826,"about_ca_system_score_codex":0.000044583532,"about_ca_system_score_gemma":0.000040375475,"threshold_uncertainty_score":0.9227986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004904414,0.008012489,0.9808452,0.000049622475,0.0035477164,0.0011067018,0.00003598267,0.0013192614,0.00017858871],"genre_scores_gemma":[0.96473837,0.00048377778,0.031049214,0.00027972253,0.0019328733,0.00057347864,0.00031030734,0.00042534448,0.0002068928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967616,0.000050866296,0.0007061098,0.00073923013,0.00027869229,0.0014635014],"domain_scores_gemma":[0.99873865,0.0003567871,0.00005468397,0.00052907696,0.00005091013,0.00026990572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055888563,0.0006223472,0.00061057386,0.00026787323,0.0001112963,0.00027396536,0.00045129735,0.0005760351,0.000041324813],"category_scores_gemma":[0.000010033358,0.0006856153,0.00028716022,0.0008334619,0.000064554246,0.00023823156,0.00008062128,0.0009954143,0.000021906966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014502918,0.000048817263,0.000032567954,0.0001370847,0.00008925686,0.00010591482,0.000053123953,0.75657946,0.000059111673,0.000028404918,0.0025220027,0.24032974],"study_design_scores_gemma":[0.0016479619,0.000043128282,0.00028206458,0.0008474297,0.000054955606,0.000032383396,0.000015741902,0.9843891,0.000032608743,0.00000859081,0.011904984,0.0007410209],"about_ca_topic_score_codex":0.000068979134,"about_ca_topic_score_gemma":0.0008160586,"teacher_disagreement_score":0.959834,"about_ca_system_score_codex":0.0003453926,"about_ca_system_score_gemma":0.000051789368,"threshold_uncertainty_score":0.9995595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36614838,0.0022914927,0.63035583,0.0005716656,0.00017291566,0.00023838118,0.000006431488,0.00020614573,0.000008767032],"genre_scores_gemma":[0.9956731,0.00010825677,0.003956953,0.0000790958,0.000070519185,0.000078535144,0.0000052848254,0.0000126842015,0.000015527197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988643,0.000029425617,0.0001735785,0.0006049949,0.000070231814,0.00025747382],"domain_scores_gemma":[0.9991223,0.0001650552,0.000031993266,0.0006164904,0.00001712428,0.00004700214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005007609,0.000118623204,0.00014210281,0.0001377804,0.0001486097,0.00013753361,0.0004576384,0.000165551,4.5288257e-7],"category_scores_gemma":[0.000011079381,0.00011727964,0.00001518361,0.00041216274,0.00007674885,0.000058113455,0.00051076687,0.000261258,8.367822e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018339897,0.00012112018,0.0008687289,0.00016761398,0.00004233225,0.000042550622,0.001401106,0.034475937,0.00073241955,0.09350077,0.0004675126,0.86816156],"study_design_scores_gemma":[0.00017985777,0.000023711309,0.0004596569,0.00005061486,0.0000068958693,0.000030253475,0.000028176324,0.9961388,0.00006843908,0.0012795534,0.0016054102,0.0001286445],"about_ca_topic_score_codex":0.000053455886,"about_ca_topic_score_gemma":0.00022966208,"teacher_disagreement_score":0.9616628,"about_ca_system_score_codex":0.000028392764,"about_ca_system_score_gemma":0.000016065867,"threshold_uncertainty_score":0.47825247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14773355,0.008001754,0.8387012,0.0001462518,0.00039155275,0.00095349626,0.000027453556,0.0039461586,0.00009860359],"genre_scores_gemma":[0.9922869,0.0017781086,0.0048333546,0.000011843325,0.00012313384,0.0003625728,0.00020035559,0.00021987184,0.0001838552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801946,0.0000678021,0.00048913073,0.0005258251,0.00022784242,0.0006699277],"domain_scores_gemma":[0.9985139,0.0004929896,0.00016490377,0.0006053413,0.00011843464,0.00010445777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027102546,0.0004621168,0.00046280542,0.00022043931,0.00031222816,0.00022804622,0.00044222828,0.00018412375,0.0000040979235],"category_scores_gemma":[0.000041454972,0.00040237416,0.00008470013,0.00067686784,0.00012909234,0.00032104895,0.00010027112,0.0009517486,0.0000049194446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018726068,0.00003901639,0.00016353815,0.00041384643,0.0002249968,0.000026946484,0.00030072549,0.9728917,0.00097098964,0.00076442555,0.000104635525,0.023911936],"study_design_scores_gemma":[0.00080963044,0.00034458557,0.000005427127,0.0017767103,0.000050120965,0.00002702672,0.0005932444,0.98832875,0.005101293,0.000016937738,0.002423907,0.0005223505],"about_ca_topic_score_codex":0.00002989018,"about_ca_topic_score_gemma":0.00008110152,"teacher_disagreement_score":0.84455335,"about_ca_system_score_codex":0.0004606195,"about_ca_system_score_gemma":0.000035431618,"threshold_uncertainty_score":0.9998428},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36929017,0.005803434,0.59922594,0.00044188264,0.013100517,0.0016447178,0.000009868465,0.0014886634,0.008994809],"genre_scores_gemma":[0.99425805,0.00026338224,0.0023101286,0.000072483104,0.0019215514,0.00031646073,0.000033240194,0.000057217716,0.00076746586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985225,0.00003415788,0.0004243714,0.00031247758,0.00011768792,0.00058877026],"domain_scores_gemma":[0.99946207,0.000083117404,0.000047882408,0.0002859254,0.000049434664,0.00007157722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026263666,0.00023576395,0.00029920018,0.00013677009,0.00011016226,0.000049350394,0.00021354771,0.00027122648,0.000047676782],"category_scores_gemma":[0.000010147856,0.0002777442,0.00010191839,0.0006922439,0.000054442913,0.0001496887,0.000039625236,0.00041498445,0.000013049107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004341737,0.000028331062,0.0005851985,0.00010267869,0.000059500773,0.0000018995946,0.0000493603,0.9471057,0.000797524,0.0021353045,0.036429625,0.012661474],"study_design_scores_gemma":[0.0008591688,0.000018825116,0.0010526617,0.00046279572,0.000020762232,0.0000055560618,0.00007103114,0.98193944,0.00093401584,0.0009313858,0.013363229,0.00034114992],"about_ca_topic_score_codex":0.000011807636,"about_ca_topic_score_gemma":0.000032592965,"teacher_disagreement_score":0.62496793,"about_ca_system_score_codex":0.0002217776,"about_ca_system_score_gemma":0.000036944464,"threshold_uncertainty_score":0.99996746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09106843,0.0004125566,0.90252954,0.0000867574,0.0001137979,0.00063887716,0.000007134609,0.0007503835,0.004392494],"genre_scores_gemma":[0.99483824,0.00044961664,0.0042248215,0.000041205556,0.000051436105,0.0003056703,0.000029302448,0.000041816176,0.000017893359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988308,0.00011603529,0.00041944048,0.00021046975,0.00014030216,0.0002829759],"domain_scores_gemma":[0.9990142,0.00014552254,0.00007343429,0.00063286803,0.00009098883,0.000043015956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002740281,0.00022587512,0.00043328974,0.00027144264,0.000042644675,0.000020713349,0.00045801266,0.00028388738,0.000010157835],"category_scores_gemma":[0.000017125993,0.00025644008,0.00009556198,0.0008703052,0.000100966434,0.0001632448,0.000115278024,0.00055033056,0.0000012039953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016660124,0.000115160816,0.00029567836,0.0001366881,0.000033857785,0.0000012543359,0.0004744946,0.9825982,0.0033447128,0.007440803,0.00034500548,0.005197509],"study_design_scores_gemma":[0.00028256563,0.000015214525,0.00042405227,0.00040086955,0.000011628763,0.000001005147,0.000026062582,0.96615154,0.031227363,0.0011357376,0.00011541544,0.00020857327],"about_ca_topic_score_codex":0.00007579453,"about_ca_topic_score_gemma":0.000071174,"teacher_disagreement_score":0.9037698,"about_ca_system_score_codex":0.00011205484,"about_ca_system_score_gemma":0.000021242697,"threshold_uncertainty_score":0.9999888},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036181945,0.0007681228,0.958682,0.000042299587,0.0015374097,0.00051652035,0.000024327348,0.0016667086,0.00058068644],"genre_scores_gemma":[0.9861716,0.000088631015,0.011761778,0.00012830428,0.0011551685,0.00017720375,0.00027518932,0.00012292413,0.00011920381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982145,0.00005759958,0.0004150805,0.00039633721,0.00022692593,0.0006895577],"domain_scores_gemma":[0.99893063,0.00010294221,0.00008169998,0.00038753301,0.00027067016,0.00022654938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025540194,0.00037481118,0.00039883816,0.00014294426,0.00025681453,0.00019351822,0.00030491388,0.0004442995,0.00001078468],"category_scores_gemma":[0.000011250964,0.00036352105,0.00010922319,0.0004543731,0.00009918111,0.00019769033,0.000059053065,0.00037748014,0.000010878451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021223734,0.00004026326,0.00006343512,0.000013302087,0.00004902221,0.000012121527,0.00041978704,0.9291047,0.000023610084,0.0017303533,0.0021698107,0.06635238],"study_design_scores_gemma":[0.00094577286,0.0001241467,0.000034310175,0.00008670829,0.00003306219,0.000016178214,0.00042445224,0.9946623,0.0015962168,0.000087356515,0.0015026126,0.00048689375],"about_ca_topic_score_codex":0.000008317909,"about_ca_topic_score_gemma":0.000011041598,"teacher_disagreement_score":0.9499897,"about_ca_system_score_codex":0.00017538988,"about_ca_system_score_gemma":0.000025635518,"threshold_uncertainty_score":0.9998817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047398006,0.000049068276,0.91489947,0.0002779603,0.0013460942,0.08037016,0.000003888857,0.001222395,0.0013569753],"genre_scores_gemma":[0.5098303,0.0000037589518,0.07372084,0.0017402202,0.0051414184,0.40897277,0.00006298167,0.00021772987,0.00031000155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938809,0.00047259853,0.0011047883,0.0015838966,0.00087081484,0.0020869952],"domain_scores_gemma":[0.99526584,0.0007121307,0.0007032523,0.0020673883,0.0005580449,0.000693324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001760175,0.00077456684,0.00092088437,0.000093338705,0.00054295914,0.0006164943,0.0025618875,0.0005663426,0.00002656476],"category_scores_gemma":[0.00006880217,0.00073898764,0.00034663678,0.0015535937,0.0001521085,0.0008162709,0.00071320165,0.00074452,0.000031101572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051848934,0.00049134437,0.0031515325,0.0001230772,0.00014187192,0.00010501869,0.00089368975,0.5757701,0.000021272617,0.102740966,0.19795038,0.118092276],"study_design_scores_gemma":[0.004218163,0.0003479616,0.00015193336,0.00038683394,0.000020765636,0.000015348149,0.0000531262,0.97602993,0.00008064694,0.0016271927,0.016177462,0.0008906564],"about_ca_topic_score_codex":0.00004130762,"about_ca_topic_score_gemma":0.000079279016,"teacher_disagreement_score":0.84117866,"about_ca_system_score_codex":0.00030912552,"about_ca_system_score_gemma":0.00053342094,"threshold_uncertainty_score":0.9995061},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001616322,0.000022834258,0.92432916,0.00041320795,0.001299246,0.071395405,0.000010435933,0.0008997839,0.0014683096],"genre_scores_gemma":[0.6165543,0.0000029204095,0.046209175,0.0019076169,0.0029900481,0.3316202,0.000094934345,0.00021998504,0.0004007798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941144,0.00022600325,0.0012252887,0.001565522,0.0008835243,0.0019852526],"domain_scores_gemma":[0.99503046,0.0005216449,0.00076415297,0.0019738122,0.0006472456,0.0010626913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002118259,0.00083829334,0.0009703678,0.00016473905,0.0004631171,0.00074898475,0.0028625957,0.0006734359,0.000019961799],"category_scores_gemma":[0.00010690316,0.0008136137,0.00037047136,0.0012380889,0.00022085056,0.0006465227,0.00071286364,0.0008934871,0.000014012132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003999913,0.0005444901,0.0006317072,0.00010979554,0.000091916496,0.00007544891,0.00019587953,0.63777333,0.000020115456,0.11146256,0.017843964,0.23085082],"study_design_scores_gemma":[0.005399076,0.00040986654,0.00010978622,0.00033508692,0.00003389705,0.00003244834,0.0000316742,0.97789747,0.000039206425,0.0004837531,0.014261803,0.000965931],"about_ca_topic_score_codex":0.000079161066,"about_ca_topic_score_gemma":0.000054941578,"teacher_disagreement_score":0.87811995,"about_ca_system_score_codex":0.00038597774,"about_ca_system_score_gemma":0.0010327152,"threshold_uncertainty_score":0.9994315},"labels":[],"label_agreement":null}]}