{"meta":{"query_hash":"1e5cffde0467","filters":{"venue":"IET Communications"},"cohort_total":268,"direct_labels_cover":0,"predictions_cover":268,"exported":268,"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/1e5cffde0467","api":"https://metacan.xera.ac/api/v1/cohort?venue=IET+Communications"},"results":[{"id":"W1181605978","doi":"10.1049/iet-com.2014.0720","title":"Performance analysis of orthogonal space–time block coding with antenna selection","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Transmitter; Coding gain; Block code; Bit error rate; Quadrature amplitude modulation; Antenna (radio); Computer science; Algorithm; Coding (social sciences); Mathematics; Quadrature (astronomy); Phase-shift keying; QAM; Selection (genetic algorithm); Telecommunications; Topology (electrical circuits); Electronic engineering; Statistics; Decoding methods; Channel (broadcasting); Combinatorics; Artificial intelligence","score_opus":0.02542341008347165,"score_gpt":0.25936891361179926,"score_spread":0.2339455035283276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1181605978","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.8676759,0.00095090567,0.10741415,0.0005625618,0.000031375,0.00042673878,0.00005060929,0.0018190923,0.021068638],"genre_scores_gemma":[0.94230133,0.0008027668,0.05664287,0.000010345951,0.000005535417,0.000054700595,0.00008131562,0.00002446985,0.00007668133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992812,0.00006248222,0.000266445,0.00009430006,0.00015897685,0.00013659408],"domain_scores_gemma":[0.99790406,0.000112572685,0.00010264826,0.0015228034,0.00029167932,0.000066229164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019977578,0.00011942161,0.00024020059,0.0003418888,0.00011115029,0.000014145015,0.0007151725,0.00005411491,0.0000130864155],"category_scores_gemma":[0.000025910746,0.00012070294,0.000054606815,0.0016171625,0.00013133997,0.00023014436,0.00013619238,0.00022578189,0.000011927545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080332524,0.00044293312,0.096239336,0.00009756853,0.0029181906,6.451004e-7,0.0033772013,0.80682164,0.07067827,0.008750234,0.0015319047,0.009061706],"study_design_scores_gemma":[0.00015587904,0.00005118063,0.00734744,0.00004441921,0.00023048554,0.0000049064683,0.000103061684,0.9854588,0.0043272455,0.000044728626,0.0020575067,0.00017437203],"about_ca_topic_score_codex":0.000016764938,"about_ca_topic_score_gemma":0.000107433014,"teacher_disagreement_score":0.1786371,"about_ca_system_score_codex":0.00009647602,"about_ca_system_score_gemma":0.000036860325,"threshold_uncertainty_score":0.49221233},"labels":[],"label_agreement":null},{"id":"W1483985176","doi":"10.1049/iet-com.2010.0047","title":"Channel estimation in bit-interleaved coded modulation with iterative decoding","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Fading; Computer science; Algorithm; Estimator; Channel (broadcasting); Decoding methods; Signal-to-noise ratio (imaging); Speech recognition; Telecommunications; Mathematics; Statistics","score_opus":0.018301104348061786,"score_gpt":0.28184770761027755,"score_spread":0.2635466032622158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483985176","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.20726798,0.00017542034,0.7839842,0.00083671225,0.0000878348,0.00064574665,0.00001687595,0.0013570925,0.005628131],"genre_scores_gemma":[0.83305097,0.00013005608,0.16632806,0.000026974449,0.0000070803912,0.00024404285,0.00016543682,0.000033956923,0.000013413749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.00006227938,0.00029593907,0.00012334359,0.00009444161,0.00015765017],"domain_scores_gemma":[0.99786955,0.00017145193,0.00007415488,0.0017388018,0.00010273535,0.000043289507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015685303,0.00014643311,0.00015020045,0.00022594542,0.00014900551,0.000050558487,0.0007228723,0.00008917296,0.000011731151],"category_scores_gemma":[0.000049250568,0.0001538337,0.000024505567,0.00039999798,0.00011043387,0.0004945019,0.0001232619,0.00056492485,0.000015104342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051068102,0.00047174227,0.0025714738,0.00009251234,0.00010896206,0.000002512654,0.014016614,0.6645953,0.12770407,0.05255389,0.00033669482,0.13749515],"study_design_scores_gemma":[0.000254213,0.000016831445,0.0025449838,0.00012730793,0.0000046617433,0.000004732742,0.00012821898,0.9835247,0.007981066,0.004873708,0.00034830315,0.00019126876],"about_ca_topic_score_codex":0.000029167457,"about_ca_topic_score_gemma":0.0017965432,"teacher_disagreement_score":0.625783,"about_ca_system_score_codex":0.00008400606,"about_ca_system_score_gemma":0.000015585232,"threshold_uncertainty_score":0.6273156},"labels":[],"label_agreement":null},{"id":"W1490159693","doi":"10.1049/iet-com.2012.0058","title":"Guest Editorial: Special Section on Photonic and Free Space Optics Networks","year":2012,"lang":"en","type":"editorial","venue":"IET Communications","topic":"Advanced Optical Network Technologies","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":"McMaster University","funders":"","keywords":"Special section; Section (typography); Photonics; Computer science; Free space; Optics; Telecommunications; Physics; Engineering physics","score_opus":0.010583744848192755,"score_gpt":0.24630258099934293,"score_spread":0.2357188361511502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490159693","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.000012015494,0.002786661,0.0011486433,0.00017364878,0.9827991,0.00031727957,0.00011705117,0.0012782698,0.01136733],"genre_scores_gemma":[0.00022136146,0.022784943,0.012043211,0.000004722343,0.96412945,0.00012750435,0.00041582805,0.00013633553,0.00013666926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985059,0.0000603291,0.00036067437,0.00026284083,0.00033617264,0.00047409965],"domain_scores_gemma":[0.9942791,0.0018664602,0.00011439734,0.003467757,0.00015765401,0.00011466213],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00022724096,0.00040888457,0.00041277433,0.00012944244,0.0002721042,0.00010049493,0.0016004139,0.0018143875,0.000010634391],"category_scores_gemma":[0.00085607666,0.00045491706,0.00008024826,0.00029398288,0.00033841675,0.00017821198,0.0008747682,0.003470314,0.000036675992],"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.000008814023,0.00003897797,0.0000015574057,0.00002352135,0.000055169454,3.1739887e-7,0.000030725987,0.0072307163,0.000008844825,0.0016831595,0.9904263,0.0004919076],"study_design_scores_gemma":[0.00026342523,0.000059027832,0.000004137294,0.00011288012,0.00007995857,9.063242e-7,0.000026260062,0.0052286987,0.0000094246825,0.0008740946,0.9929278,0.00041337812],"about_ca_topic_score_codex":0.000011302396,"about_ca_topic_score_gemma":0.0001803474,"teacher_disagreement_score":0.01999828,"about_ca_system_score_codex":0.0003094333,"about_ca_system_score_gemma":0.00003506687,"threshold_uncertainty_score":0.99979025},"labels":[],"label_agreement":null},{"id":"W1491362750","doi":"10.1049/iet-com.2010.0035","title":"Cooperative relaying protocol for energy-constrained <i>ad hoc</i> networks","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","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":"Concordia University","funders":"","keywords":"Computer science; Cooperative diversity; Computer network; Rayleigh fading; Wireless ad hoc network; Throughput; Transmission (telecommunications); Bandwidth (computing); Wireless; Fading; Wireless network; Protocol (science); Channel (broadcasting); Telecommunications","score_opus":0.1344708339621468,"score_gpt":0.33643902174551366,"score_spread":0.20196818778336686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491362750","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.000007373257,0.00061190006,0.9342647,0.0021348898,0.00008555447,0.026025036,0.0000055693345,0.0003788479,0.03648613],"genre_scores_gemma":[0.1360165,0.0012543658,0.4319255,0.0021285044,0.0000592603,0.42750618,0.000050581373,0.00004558529,0.0010135191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983455,0.0004068797,0.00046417376,0.0003410446,0.00010478079,0.00033760373],"domain_scores_gemma":[0.9948936,0.0004975433,0.00020383408,0.0037795373,0.0004969676,0.00012852973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050077337,0.00021727692,0.00022188296,0.00009908744,0.001172745,0.00017343288,0.004194637,0.00009900569,0.00004983019],"category_scores_gemma":[0.00009111426,0.00021089287,0.00011921756,0.000669135,0.00025936269,0.0005618566,0.0013731145,0.0003065581,0.000015348192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031681833,0.00033771148,0.00005231315,0.0000070533342,0.000057419053,5.4582523e-7,0.003050114,0.00010086629,0.00030298356,0.8234334,0.0069224685,0.16570346],"study_design_scores_gemma":[0.0015254801,0.00022395002,0.00017183251,0.00011114894,0.000013816667,0.000012410322,0.00014494786,0.3134912,0.00058631034,0.003997527,0.67922187,0.000499489],"about_ca_topic_score_codex":0.0000056070194,"about_ca_topic_score_gemma":0.00017719725,"teacher_disagreement_score":0.81943583,"about_ca_system_score_codex":0.00006117738,"about_ca_system_score_gemma":0.00015308947,"threshold_uncertainty_score":0.9019925},"labels":[],"label_agreement":null},{"id":"W1500784394","doi":"10.1049/iet-com:20060385","title":"Two-dimensional binary halftoned optical intensity channels","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Optical Imaging Technologies","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":"McMaster University","funders":"","keywords":"Transmitter; Computer science; Channel (broadcasting); Optical wireless; Binary number; Binary data; Bandwidth (computing); Spatial correlation; Spatial frequency; Wireless; Optics; Electronic engineering; Telecommunications; Physics; Mathematics; Engineering","score_opus":0.04650733822822458,"score_gpt":0.28472777381710446,"score_spread":0.23822043558887987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500784394","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.91344047,0.003442111,0.02573343,0.017234212,0.00073075615,0.00051299576,0.000027307928,0.009027307,0.029851435],"genre_scores_gemma":[0.8132065,0.00016324961,0.1863567,0.00010747364,0.000017786593,0.00003252983,0.00002336575,0.000022563765,0.000069848065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993289,0.000016017313,0.00018696224,0.00012655222,0.00011015172,0.0002314106],"domain_scores_gemma":[0.9980379,0.0001969792,0.000016871065,0.0015820239,0.00009854339,0.00006771971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058931822,0.00012984472,0.00016545485,0.00008444928,0.00025255018,0.00001193665,0.0007573232,0.00006945289,0.000016071706],"category_scores_gemma":[0.00014744075,0.00013441067,0.0000512075,0.00024786257,0.00061570836,0.00016646042,0.0005806408,0.00044815207,0.00020448564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007947397,0.0014831481,0.0033398203,0.00008123352,0.0005145706,0.00026962734,0.0017052793,0.5382602,0.17262818,0.20105739,0.06437013,0.016210923],"study_design_scores_gemma":[0.0010993388,0.00009928298,0.0073038745,0.00010960895,0.00005249809,0.00057125464,0.00024556922,0.91590476,0.03149818,0.027305491,0.014740547,0.0010695875],"about_ca_topic_score_codex":0.000007363046,"about_ca_topic_score_gemma":0.0000033067017,"teacher_disagreement_score":0.37764454,"about_ca_system_score_codex":0.00006363837,"about_ca_system_score_gemma":0.0000139530575,"threshold_uncertainty_score":0.5481108},"labels":[],"label_agreement":null},{"id":"W1523326937","doi":"10.1049/iet-com.2010.0436","title":"Performance analysis of cooperative diversity systems with opportunistic relaying and adaptive transmission","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Independent and identically distributed random variables; Rayleigh fading; Fading; Link adaptation; Computer science; Transmission (telecommunications); Spectral efficiency; Diversity combining; Modulation (music); Bit error rate; Algorithm; Random variable; Telecommunications; Mathematics; Channel (broadcasting); Statistics; Physics","score_opus":0.142104682693373,"score_gpt":0.2699197652789648,"score_spread":0.12781508258559177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523326937","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.08471415,0.0020596685,0.8830991,0.00038813407,0.000035316047,0.000423523,0.000016015865,0.00013488375,0.02912924],"genre_scores_gemma":[0.97170115,0.0038180903,0.024331922,0.000033975324,0.0000015859787,0.000018280369,0.000012803395,0.0000041504136,0.00007806437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907213,0.0002756077,0.00022472699,0.00018106705,0.00013538873,0.000111079076],"domain_scores_gemma":[0.9976707,0.00019127011,0.00015061263,0.001582327,0.00032256203,0.00008251385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031235252,0.000104832936,0.00023051554,0.0001974739,0.000836797,0.000032367992,0.0014477096,0.00003463621,0.000011827666],"category_scores_gemma":[0.0000110179,0.00008819441,0.000037887286,0.0011648709,0.00024238942,0.00038255184,0.001169715,0.00016386468,0.0000013048776],"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.00013658874,0.0007775162,0.10377634,0.0000589538,0.0026004228,0.0000052064515,0.09728889,0.003080099,0.0006178234,0.69166607,0.00014310732,0.099848986],"study_design_scores_gemma":[0.00022079534,0.00017287664,0.05695086,0.00009080302,0.00027275886,0.0000039228657,0.0005764291,0.9410468,0.000050263607,0.000026937547,0.00042110877,0.00016645607],"about_ca_topic_score_codex":0.00007741576,"about_ca_topic_score_gemma":0.00006786338,"teacher_disagreement_score":0.9379667,"about_ca_system_score_codex":0.000027137763,"about_ca_system_score_gemma":0.000055092576,"threshold_uncertainty_score":0.64360505},"labels":[],"label_agreement":null},{"id":"W1523368156","doi":"10.1049/iet-com.2009.0827","title":"Spectral efficiency analysis of rate-adaptive user selection diversity in orthogonal space time block coding multiple-input multiple-output systems with antenna selection","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Spectral efficiency; MIMO; Diversity gain; Block code; Computer science; Selection (genetic algorithm); Space–time block code; Algorithm; Coding (social sciences); Mathematics; Control theory (sociology); Telecommunications; Channel (broadcasting); Statistics; Decoding methods; Artificial intelligence","score_opus":0.028204509582647537,"score_gpt":0.2204212143652008,"score_spread":0.19221670478255326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523368156","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.5522492,0.00012264174,0.44626275,0.000012317044,0.00005056914,0.000442524,0.00003072393,0.00027583417,0.0005534685],"genre_scores_gemma":[0.9811574,0.00016445038,0.018454937,0.0000029368819,0.000014766025,0.00003465446,0.00007814822,0.000031437317,0.00006124145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987555,0.00019111637,0.00036763688,0.00023476346,0.00017178436,0.0002791985],"domain_scores_gemma":[0.9986558,0.00030635396,0.0001859753,0.00053827977,0.00025170663,0.000061873936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002403847,0.00020537687,0.00036091878,0.0005689028,0.00030455342,0.00001849422,0.0003941034,0.00010765758,0.000011897325],"category_scores_gemma":[0.000047497793,0.00022101121,0.00008266987,0.002753973,0.00010566125,0.00031979493,0.0001524505,0.00032290796,0.000006370277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065675784,0.00012275376,0.15448858,0.000011574497,0.00030313272,5.87019e-7,0.0011804955,0.841588,0.001946166,0.00025446876,0.000009985184,0.000028598743],"study_design_scores_gemma":[0.00044248207,0.000060233164,0.09941033,0.000059049264,0.00024600074,0.0000036236527,0.0002282416,0.89882666,0.00050355063,0.000004176189,0.000009918776,0.00020572831],"about_ca_topic_score_codex":0.0005787691,"about_ca_topic_score_gemma":0.0037035965,"teacher_disagreement_score":0.42890826,"about_ca_system_score_codex":0.00027507177,"about_ca_system_score_gemma":0.000029334455,"threshold_uncertainty_score":0.9012576},"labels":[],"label_agreement":null},{"id":"W1529853583","doi":"10.1049/iet-com.2011.0196","title":"Unveiling popularity of BitTorrent Darknets","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BitTorrent; Popularity; BitTorrent tracker; Upload; Computer science; Incentive; Internet privacy; Computer security; Computer network; Peer-to-peer; World Wide Web; Law; Artificial intelligence; Political science","score_opus":0.06657170852920677,"score_gpt":0.30062379833560876,"score_spread":0.234052089806402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529853583","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.5160255,0.021047046,0.40382245,0.009366324,0.0019903386,0.00044100618,0.000027456685,0.00068816927,0.046591725],"genre_scores_gemma":[0.9837025,0.000092442315,0.01596388,0.000106418214,0.000020903444,0.000007185161,0.00000780382,0.0000032243022,0.000095632255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993876,0.00011126145,0.000168867,0.00007614186,0.00011499513,0.00014109013],"domain_scores_gemma":[0.99767035,0.000106335494,0.00007362395,0.0020263721,0.000061660285,0.0000616702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030990038,0.00005460336,0.000085838234,0.000051532716,0.00014680337,0.00002546719,0.0015161952,0.000026617217,0.0000051977495],"category_scores_gemma":[0.000042124975,0.00005423378,0.000058650054,0.0001869637,0.000046443314,0.00030033092,0.00066519296,0.00013609178,0.00003656867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042576944,0.0013267939,0.07657358,0.000027913797,0.000075683034,4.8287063e-7,0.004398678,0.0000768044,0.01061162,0.8389076,0.0049976744,0.06299893],"study_design_scores_gemma":[0.0018358321,0.0002340727,0.33179358,0.0004049114,0.00015778781,0.00009780153,0.001068466,0.3288083,0.007048584,0.013039532,0.3137555,0.0017556399],"about_ca_topic_score_codex":0.00018072907,"about_ca_topic_score_gemma":0.000019586767,"teacher_disagreement_score":0.82586807,"about_ca_system_score_codex":0.000020726757,"about_ca_system_score_gemma":0.000023274812,"threshold_uncertainty_score":0.28174934},"labels":[],"label_agreement":null},{"id":"W1547429778","doi":"10.1049/iet-com.2010.0480","title":"Lower bounds on mobile terminal localisation in an urban area","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"RSS; Estimator; Cramér–Rao bound; Upper and lower bounds; Computer science; Algorithm; Terminal (telecommunication); Mean squared error; Classification of discontinuities; Geolocation; Statistics; Mathematics; Telecommunications; Mathematical analysis","score_opus":0.04983564698988737,"score_gpt":0.2609106680542209,"score_spread":0.21107502106433354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547429778","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.8983392,0.0004668405,0.011871288,0.00013609542,0.00035096012,0.0005305416,0.000033499866,0.0019285196,0.08634306],"genre_scores_gemma":[0.9979374,0.00010318526,0.0015587844,0.000060167,0.000010924443,0.00020588576,0.00005634625,0.000019772568,0.000047564627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994733,0.0000336682,0.00018791336,0.00009386067,0.00007120842,0.00014008442],"domain_scores_gemma":[0.99864143,0.000032706932,0.00002228188,0.0012370575,0.000036723337,0.00002979771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087514636,0.00009678709,0.000089609945,0.00015756114,0.00009084789,0.000025065969,0.0005922047,0.00009982878,0.00011172301],"category_scores_gemma":[0.000017840395,0.00010154423,0.000025782863,0.0002451401,0.00011132784,0.00018097779,0.00005937559,0.00020209307,0.00005655635],"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.00024296739,0.006464251,0.2622568,0.0002373203,0.00021263308,0.000074706964,0.083408475,0.0708918,0.006689307,0.3404548,0.03716365,0.1919033],"study_design_scores_gemma":[0.0023932625,0.0015752246,0.1120234,0.0003631277,0.0000802126,0.000031751864,0.008774622,0.64594936,0.03651606,0.019232728,0.170786,0.0022742848],"about_ca_topic_score_codex":0.000034826993,"about_ca_topic_score_gemma":0.00026603296,"teacher_disagreement_score":0.57505757,"about_ca_system_score_codex":0.00007470826,"about_ca_system_score_gemma":0.000011322052,"threshold_uncertainty_score":0.41408536},"labels":[],"label_agreement":null},{"id":"W1555094252","doi":"10.1049/iet-com.2010.0952","title":"Collaborative routing and camera selection for visual wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Routing protocol; Routing (electronic design automation); Wireless network; Geographic routing; Node (physics); Distributed computing; Wireless; Static routing; Telecommunications","score_opus":0.025102856189111497,"score_gpt":0.2742332566840966,"score_spread":0.24913040049498508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555094252","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.04367714,0.0003905837,0.9521199,0.00061308086,0.00019089386,0.00040182105,0.000004113487,0.000305284,0.0022972242],"genre_scores_gemma":[0.81180346,0.00021242589,0.18758105,0.00013647586,0.00004855469,0.0000971879,0.000013222827,0.000016688064,0.00009093101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988078,0.000217814,0.000265267,0.00031145767,0.00009188678,0.00030578513],"domain_scores_gemma":[0.99797463,0.000486516,0.00017418162,0.0009301406,0.00034418592,0.00009033034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029375727,0.00015272493,0.00017392215,0.00008200934,0.000717389,0.0001272331,0.00094835984,0.000106280975,0.0000025937893],"category_scores_gemma":[0.000039991366,0.00016183396,0.000042987424,0.0007237288,0.00016050025,0.00028762096,0.0004467475,0.00022746446,0.0000032333708],"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.00007980292,0.0009826347,0.010979646,0.000026282281,0.0002642343,0.0000019211595,0.018812697,0.0554638,0.002339996,0.8066776,0.0019382656,0.10243312],"study_design_scores_gemma":[0.00025871227,0.00008676292,0.0012057329,0.000024709962,0.000014303196,0.000008964643,0.0002892171,0.9956048,0.0005398248,0.00016765042,0.001602486,0.00019682254],"about_ca_topic_score_codex":0.000106712854,"about_ca_topic_score_gemma":0.00027722464,"teacher_disagreement_score":0.940141,"about_ca_system_score_codex":0.000047993453,"about_ca_system_score_gemma":0.000055412962,"threshold_uncertainty_score":0.65993977},"labels":[],"label_agreement":null},{"id":"W1963850605","doi":"10.1049/iet-com:20060639","title":"Channel estimation for 5.9 GHz dedicated short-range communications receiver in wireless access vehicular environments","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Wireless; Range (aeronautics); Channel (broadcasting); Telecommunications; Computer network; Engineering","score_opus":0.055156824267710965,"score_gpt":0.34029244650805074,"score_spread":0.2851356222403398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963850605","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.031827275,0.002711325,0.9549088,0.002053623,0.00011358418,0.0022460415,0.000109821696,0.0012481823,0.0047813808],"genre_scores_gemma":[0.90053153,0.0077938023,0.08932952,0.000121188365,0.000015720303,0.001194985,0.00087461196,0.00009231076,0.000046330002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981472,0.00014466936,0.00080184266,0.0002486292,0.00022042256,0.00043725214],"domain_scores_gemma":[0.9933342,0.00080861413,0.00012849752,0.0055066487,0.0000913384,0.00013075069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008385897,0.00028225934,0.00031658544,0.00040439676,0.00034246515,0.00006467936,0.0044487608,0.00025279974,0.000008508574],"category_scores_gemma":[0.00010619553,0.0003490127,0.00009923594,0.00072423974,0.00036577517,0.00070282567,0.00088021596,0.00064429815,0.000022898268],"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.00018290342,0.0039339345,0.01748327,0.0005612118,0.0006531017,0.000006797749,0.008007359,0.21315187,0.04377742,0.0353226,0.007416501,0.66950303],"study_design_scores_gemma":[0.0007666565,0.000036319238,0.019127462,0.00022692917,0.000052813873,0.000005458969,0.00026603165,0.9266813,0.010012646,0.005130231,0.036972962,0.00072122493],"about_ca_topic_score_codex":0.00006594013,"about_ca_topic_score_gemma":0.00073602225,"teacher_disagreement_score":0.86870426,"about_ca_system_score_codex":0.00041465266,"about_ca_system_score_gemma":0.000024364323,"threshold_uncertainty_score":0.99989617},"labels":[],"label_agreement":null},{"id":"W1965099004","doi":"10.1049/iet-com.2010.0478","title":"Performance of multi-relay coded cooperative diversity in asynchronous code-division multiple-access over fading channels","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Fading; Cooperative diversity; Relay; Asynchronous communication; Telecommunications link; Convolutional code; Code division multiple access; Computer network; Base station; Bit error rate; Telecommunications; Algorithm; Decoding methods; Channel (broadcasting)","score_opus":0.16781941556023566,"score_gpt":0.33255232891371694,"score_spread":0.16473291335348128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965099004","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.8006206,0.0009212269,0.1931616,0.0004080214,0.00023992624,0.0006999848,0.000018748871,0.00018380352,0.0037460793],"genre_scores_gemma":[0.97322404,0.0023850808,0.024114946,0.00012950932,0.0000062119193,0.000052101088,0.000016911297,0.000011567598,0.000059618476],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828744,0.00046986304,0.00046852077,0.0003092976,0.00019478818,0.00027008992],"domain_scores_gemma":[0.9962869,0.00039258142,0.00024182408,0.002649899,0.0003422032,0.00008658932],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005836129,0.00019049592,0.00028868634,0.0002346943,0.00085168553,0.00007425823,0.0053823735,0.00008543345,0.000050252536],"category_scores_gemma":[0.0001233538,0.00019544153,0.00006997991,0.00095570186,0.00025792173,0.0011938951,0.007519722,0.0003950895,0.000018920071],"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.000104054634,0.0035777716,0.7576309,0.00008028525,0.00018491599,0.000006010519,0.11603947,0.023880709,0.004747528,0.03562637,0.00046047787,0.057661545],"study_design_scores_gemma":[0.00092063914,0.00008233745,0.16517285,0.00014436326,0.0000062723443,0.0000015771794,0.000094610274,0.8308224,0.0022071232,0.000027510578,0.00028240232,0.00023790727],"about_ca_topic_score_codex":0.00023407339,"about_ca_topic_score_gemma":0.0013895535,"teacher_disagreement_score":0.8069417,"about_ca_system_score_codex":0.000120303346,"about_ca_system_score_gemma":0.00008170416,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null},{"id":"W1965138686","doi":"10.1049/iet-com.2012.0188","title":"Efficient narrowband interference cancellation in ultra‐wide‐band rake receivers","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Narrowband; Rake; Single antenna interference cancellation; Interference (communication); Computer science; Rake receiver; Spread spectrum; Telecommunications; Electronic engineering; Code division multiple access; Fading; Channel (broadcasting); Engineering","score_opus":0.014045868322491191,"score_gpt":0.22459825509931652,"score_spread":0.21055238677682533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965138686","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.90614325,0.0030375565,0.0036450103,0.006496435,0.00020074219,0.00086086465,0.000018093157,0.0009033573,0.07869468],"genre_scores_gemma":[0.9951907,0.00126673,0.0029669201,0.00006283437,0.0000055651462,0.00031959952,0.000041014348,0.00002421532,0.00012243338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990783,0.00009169955,0.00035953164,0.00014672904,0.00008318156,0.00024055857],"domain_scores_gemma":[0.9970732,0.00037702624,0.00005297406,0.00235284,0.00009085071,0.000053134456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013624724,0.00014769215,0.00016619486,0.00023377531,0.00015200324,0.00004609553,0.0013760832,0.00012758069,0.00013418775],"category_scores_gemma":[0.000093613206,0.00016440955,0.000039568735,0.00052054133,0.0001928284,0.00010171278,0.00008725239,0.00047256317,0.00022518872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035183253,0.0013549895,0.095739946,0.00019759068,0.0003444391,0.0000033266954,0.023465859,0.42299616,0.2697775,0.017654635,0.035755437,0.13267495],"study_design_scores_gemma":[0.0036338056,0.00019861813,0.14527959,0.0007965198,0.00010299542,0.000047325895,0.0071285665,0.66033113,0.046732977,0.013426779,0.119742766,0.0025789184],"about_ca_topic_score_codex":0.0005100493,"about_ca_topic_score_gemma":0.0018114088,"teacher_disagreement_score":0.237335,"about_ca_system_score_codex":0.00018951722,"about_ca_system_score_gemma":0.00002756063,"threshold_uncertainty_score":0.6704427},"labels":[],"label_agreement":null},{"id":"W1965632003","doi":"10.1049/iet-com.2011.0572","title":"Max–min relay selection in bidirectional cooperative networks with imperfect channel estimation","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Computer science; Relay channel; Channel (broadcasting); Transmission (telecommunications); Imperfect; Selection (genetic algorithm); Channel state information; Transmitter power output; Outage probability; Telecommunications; Power (physics); Wireless; Mathematical optimization; Mathematics; Transmitter; Fading; Artificial intelligence","score_opus":0.03744637526057233,"score_gpt":0.29418667822827893,"score_spread":0.2567403029677066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965632003","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.014783852,0.00300573,0.97159773,0.004009358,0.00019763754,0.00054342806,0.000002396139,0.0003478555,0.005512004],"genre_scores_gemma":[0.94941133,0.0013911846,0.048324395,0.00028537548,0.00005719056,0.0002592578,0.00004142776,0.000016242115,0.00021356613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983257,0.00061692164,0.0003106907,0.0002285726,0.000174017,0.0003440704],"domain_scores_gemma":[0.99791884,0.00040853006,0.00013094378,0.0012029359,0.0002302963,0.00010847279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535067,0.0001801835,0.00017935036,0.00021922756,0.0006661249,0.00013620238,0.0012282502,0.00008681557,0.000026693031],"category_scores_gemma":[0.00008024297,0.00016718624,0.000040712082,0.0016846181,0.000112730755,0.0011796101,0.00049886596,0.0005182726,0.000045177952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007599789,0.0019525265,0.02775804,0.000017383289,0.00017689854,0.0000015196608,0.012260922,0.5353266,0.0015664481,0.31493998,0.0050819293,0.10084177],"study_design_scores_gemma":[0.00038880028,0.00007417989,0.026196655,0.00006250154,0.000008332126,0.000034802753,0.000068192174,0.967643,0.00018561492,0.00006722897,0.0050212797,0.00024936994],"about_ca_topic_score_codex":0.00004162211,"about_ca_topic_score_gemma":0.00071859796,"teacher_disagreement_score":0.93462753,"about_ca_system_score_codex":0.00021109321,"about_ca_system_score_gemma":0.00009671608,"threshold_uncertainty_score":0.68176574},"labels":[],"label_agreement":null},{"id":"W1968683621","doi":"10.1049/iet-com:20060193","title":"Interaction between radio link level truncated ARQ, and TCP in multi-rate wireless networks: a cross-layer performance analysis","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Manitoba; University of Waterloo","funders":"","keywords":"Computer science; Selective Repeat ARQ; Computer network; Automatic repeat request; Radio Link Protocol; TCP global synchronization; CUBIC TCP; Link adaptation; Queueing theory; Transmission Control Protocol; Hybrid automatic repeat request; TCP acceleration; Throughput; Go-Back-N ARQ; TCP Westwood plus; Physical layer; TCP Friendly Rate Control; Fading; Channel (broadcasting); Wireless; Telecommunications link; Network packet; Telecommunications","score_opus":0.06440537866338394,"score_gpt":0.32568304730015735,"score_spread":0.2612776686367734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968683621","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.46198517,0.0004674882,0.5369043,0.000063368556,0.00006433641,0.00015700689,0.0000097363045,0.00017911014,0.00016950762],"genre_scores_gemma":[0.9763771,0.0032329846,0.019828292,0.000022158789,0.000058904072,0.00003904449,0.00034561506,0.000041810978,0.000054077645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881685,0.00007646547,0.0005239269,0.00019605299,0.00008286779,0.00030381462],"domain_scores_gemma":[0.9984096,0.00037243377,0.00011235303,0.00092210283,0.000101028854,0.00008246945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048479944,0.00018849535,0.00028582386,0.00036738697,0.00019937425,0.00006981773,0.00039737098,0.00015412556,0.0000072368825],"category_scores_gemma":[0.00002536852,0.0002183226,0.000055425862,0.0015950948,0.0001078963,0.0004968063,0.00011951994,0.00051054684,0.000007127604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009130879,0.00002884419,0.11547977,0.000009946673,0.00012528125,4.5769036e-7,0.00033265023,0.8648632,0.000117704476,0.00003253452,0.000009100184,0.018991342],"study_design_scores_gemma":[0.00030205186,0.0000062228355,0.34632677,0.000030015435,0.00005578435,8.649904e-7,0.000036503876,0.65266126,0.00011791908,0.000005325102,0.00031204073,0.00014528041],"about_ca_topic_score_codex":0.000059319304,"about_ca_topic_score_gemma":0.0012114154,"teacher_disagreement_score":0.517076,"about_ca_system_score_codex":0.00017713623,"about_ca_system_score_gemma":0.000010229319,"threshold_uncertainty_score":0.8902937},"labels":[],"label_agreement":null},{"id":"W1969410400","doi":"10.1049/iet-com.2014.0236","title":"Structured quasi‐cyclic low‐density parity‐check codes based on cyclotomic cosets","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Coset; Mathematics; Parity (physics); Low-density parity-check code; Computer science; Discrete mathematics; Algorithm; Decoding methods; Physics; Particle physics","score_opus":0.05266364806103158,"score_gpt":0.32064494345586936,"score_spread":0.2679812953948378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969410400","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.26308712,0.0003843422,0.6792995,0.026565421,0.0012268908,0.0016309981,0.00005683545,0.006394594,0.021354293],"genre_scores_gemma":[0.8479873,0.000018402481,0.15056057,0.0012386921,0.00002196672,0.00006242343,0.00003352928,0.000019530873,0.000057585785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980106,0.00055933703,0.0003395385,0.0003974578,0.00038537936,0.0003076862],"domain_scores_gemma":[0.99276376,0.00057557545,0.00020426919,0.005972159,0.00027998572,0.00020427507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007566292,0.00022217577,0.00026405952,0.00018324619,0.00037115888,0.00018244132,0.0043937387,0.00013985796,0.000004597886],"category_scores_gemma":[0.00049634156,0.00023017495,0.00009699463,0.0005545907,0.00018885157,0.00035892692,0.0009998255,0.0005637296,0.00010439925],"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.00032708893,0.009381075,0.09854888,0.00019878762,0.00034368958,0.00008774536,0.02398653,0.0054115304,0.027567001,0.4994782,0.20756955,0.12709993],"study_design_scores_gemma":[0.0013592896,0.00051581167,0.03251353,0.00023717833,0.0000427839,0.000048437993,0.00021245124,0.8719697,0.022999754,0.047705073,0.021231592,0.0011643932],"about_ca_topic_score_codex":0.0004386594,"about_ca_topic_score_gemma":0.0008776739,"teacher_disagreement_score":0.8665582,"about_ca_system_score_codex":0.00023390175,"about_ca_system_score_gemma":0.00026092696,"threshold_uncertainty_score":0.9386262},"labels":[],"label_agreement":null},{"id":"W1970385094","doi":"10.1049/iet-com.2009.0684","title":"Cooperative MIMO multiple-relay system with optimised beamforming and power allocation","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Medical Research Council","keywords":"Relay; Beamforming; MIMO; Computer science; Transmitter power output; Power (physics); Constraint (computer-aided design); Maximal-ratio combining; Mathematical optimization; Computer network; Telecommunications; Mathematics; Decoding methods; Fading","score_opus":0.024511360378735834,"score_gpt":0.2640844332275096,"score_spread":0.23957307284877374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970385094","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.06450934,0.0012532593,0.89356834,0.012534263,0.000296036,0.0011274837,0.000010082507,0.0008073059,0.025893917],"genre_scores_gemma":[0.8249917,0.0003053838,0.17419183,0.00021026802,0.000013351158,0.00012576283,0.000019977235,0.000013473983,0.00012822621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00021585367,0.0002894494,0.00029094637,0.00016279642,0.00020952336],"domain_scores_gemma":[0.9956213,0.00050927803,0.00014139223,0.0031594513,0.00043720973,0.0001313572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042689475,0.00017928288,0.00017865149,0.00010661348,0.0010495991,0.00029100417,0.0021072107,0.00007836504,0.000010776616],"category_scores_gemma":[0.00009904075,0.0001546574,0.000031997253,0.00051009277,0.00026460437,0.0006606474,0.0009467826,0.00053067197,0.000025532123],"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.000021598471,0.0002758995,0.0018729726,0.000020731679,0.00010707418,0.0000021357444,0.009781884,0.001269112,0.023965292,0.9369722,0.0005846389,0.025126481],"study_design_scores_gemma":[0.0014963421,0.00016341802,0.005020297,0.00018789133,0.000025406956,0.00011054975,0.0011692627,0.9479683,0.0016700117,0.000049168626,0.041507732,0.00063162326],"about_ca_topic_score_codex":0.00002402292,"about_ca_topic_score_gemma":0.00076682144,"teacher_disagreement_score":0.9466992,"about_ca_system_score_codex":0.000045651585,"about_ca_system_score_gemma":0.00011022878,"threshold_uncertainty_score":0.80727744},"labels":[],"label_agreement":null},{"id":"W1970630387","doi":"10.1049/iet-com.2012.0603","title":"Joint beamforming design and base‐station assignment in a coordinated multicell system","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Beamforming; Base station; Computer science; Telecommunications link; Relaxation (psychology); Mathematical optimization; Transmitter power output; Interference (communication); Heuristic; Telecommunications; Mathematics; Transmitter","score_opus":0.028138023252369186,"score_gpt":0.22882227521680396,"score_spread":0.20068425196443476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970630387","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.003941377,0.0004632966,0.99293876,0.00011963192,0.000051603132,0.00094901345,0.0000041823378,0.00028111672,0.0012510242],"genre_scores_gemma":[0.8143981,0.00010287237,0.18497077,0.000007834424,0.0000046690807,0.00042478033,0.000032583317,0.000023031022,0.00003534641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926347,0.000115089046,0.00032342874,0.00010032214,0.00005269631,0.00014502724],"domain_scores_gemma":[0.99905807,0.00017103516,0.000059513306,0.00059338694,0.000068292975,0.0000497335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021218722,0.00010582559,0.00013354463,0.00012469463,0.000095184565,0.000043774653,0.00016774694,0.00005430704,0.000007743864],"category_scores_gemma":[0.000034298526,0.000115958006,0.000013691034,0.00020701467,0.00002904087,0.00033472845,0.000061866056,0.00012716334,0.000041235093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010737136,0.000027042563,0.00009521515,0.000087954075,0.000012379818,3.7950548e-7,0.00090549653,0.98174626,0.013989661,0.0008073158,0.00014457261,0.0021826776],"study_design_scores_gemma":[0.00031111386,0.000010458938,0.00022159512,0.00014868105,0.0000074939767,0.0000031484008,0.0011266546,0.9966247,0.0012400642,0.00005342143,0.0001321557,0.00012049659],"about_ca_topic_score_codex":0.00014829278,"about_ca_topic_score_gemma":0.00003298916,"teacher_disagreement_score":0.81045675,"about_ca_system_score_codex":0.000251398,"about_ca_system_score_gemma":0.0000099726485,"threshold_uncertainty_score":0.47286302},"labels":[],"label_agreement":null},{"id":"W1970974668","doi":"10.1049/iet-com.2010.1033","title":"Average capacity performance of opportunistic relay selection with outdated CSI","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Relay; Relay channel; Computer science; Selection (genetic algorithm); Channel state information; Link Access Procedure for Frame Relay; Computer network; Channel (broadcasting); Terminal (telecommunication); Outage probability; Telecommunications; Wireless; Artificial intelligence; Fading; Power (physics)","score_opus":0.13928746142838194,"score_gpt":0.26747042400036436,"score_spread":0.12818296257198242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970974668","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.2911235,0.00041613088,0.6100188,0.0017188303,0.00015688085,0.000646411,0.00001346241,0.0006124874,0.0952935],"genre_scores_gemma":[0.91057724,0.0010776432,0.08795154,0.000100167636,0.000005845328,0.000034123666,0.000015460859,0.000008115944,0.00022987166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902034,0.00024301546,0.0002810406,0.00016740577,0.00013613902,0.00015208877],"domain_scores_gemma":[0.99676895,0.00010669663,0.00018832221,0.0024911189,0.00037512163,0.00006977077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339183,0.00011211933,0.0001456756,0.00010002828,0.0004230937,0.00003287451,0.0022420727,0.000043873846,0.000051813422],"category_scores_gemma":[0.000035329675,0.000101461745,0.00003288504,0.0007054533,0.00019997622,0.0004413648,0.0005533842,0.0002770569,0.000023790182],"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.00007166862,0.001335718,0.040690567,0.00005654829,0.00020955405,0.000001788329,0.019231774,0.00076855504,0.0072665517,0.8662114,0.0013154534,0.06284038],"study_design_scores_gemma":[0.0008953155,0.0006865259,0.08085858,0.0002362597,0.000042932817,0.000065873865,0.00010665778,0.885497,0.006082155,0.0005026558,0.024372587,0.00065348094],"about_ca_topic_score_codex":0.000038374958,"about_ca_topic_score_gemma":0.00017651459,"teacher_disagreement_score":0.88472843,"about_ca_system_score_codex":0.000042156156,"about_ca_system_score_gemma":0.000100577265,"threshold_uncertainty_score":0.41663665},"labels":[],"label_agreement":null},{"id":"W1971454239","doi":"10.1049/iet-com.2012.0265","title":"Range‐based localisation and tracking in non‐line‐of‐sight wireless channels with Gaussian scatterer distribution model","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Toronto","funders":"","keywords":"Line-of-sight; Range (aeronautics); Gaussian; Non-line-of-sight propagation; Tracking (education); Computer science; Wireless; Distribution (mathematics); Mathematics; Telecommunications; Physics; Mathematical analysis; Engineering; Aerospace engineering","score_opus":0.019935109636642995,"score_gpt":0.238712100562452,"score_spread":0.21877699092580902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971454239","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.38881922,0.0002126541,0.6089146,0.0011008431,0.000019277051,0.00034303588,0.000030819338,0.00020240895,0.0003571444],"genre_scores_gemma":[0.99701285,0.0001511542,0.0024179807,0.000030363079,0.0000054876173,0.00018588362,0.00017130481,0.000017823224,0.000007136968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994456,0.000024562043,0.00022502938,0.00009214197,0.00007995451,0.00013267493],"domain_scores_gemma":[0.9992114,0.00005244946,0.000045796198,0.0005773338,0.000087108536,0.000025959542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007951979,0.000105665335,0.00013611277,0.00010916422,0.000077443605,0.000036318674,0.00026502938,0.00009332035,0.000014340827],"category_scores_gemma":[0.000012686772,0.000096713375,0.0000183226,0.0002975489,0.00014371914,0.00021163165,0.000041081104,0.00015257936,0.0000067288897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016723456,0.00019290305,0.0111713465,0.00025469996,0.00004297611,8.6657985e-7,0.0023395165,0.9457143,0.0065538054,0.009435064,0.000569094,0.023708705],"study_design_scores_gemma":[0.00037736353,0.000014710129,0.0035715352,0.0001140374,0.000007876094,0.0000010240618,0.00021481643,0.9832167,0.011765743,0.00054389745,0.0000494983,0.00012276843],"about_ca_topic_score_codex":0.00009421281,"about_ca_topic_score_gemma":0.0001325508,"teacher_disagreement_score":0.60819364,"about_ca_system_score_codex":0.00004820696,"about_ca_system_score_gemma":0.000014105589,"threshold_uncertainty_score":0.3943857},"labels":[],"label_agreement":null},{"id":"W1971547627","doi":"10.1049/iet-com.2011.0765","title":"Layered space-time multiple-input multiple-output detector with parameterisable performance","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; TransAlta (Canada)","funders":"","keywords":"Detector; MIMO; Computer science; Computational complexity theory; Algorithm; Wireless; Channel (broadcasting); Control theory (sociology); Mathematical optimization; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.02479442909401466,"score_gpt":0.24179727554693667,"score_spread":0.217002846452922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971547627","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.84420896,0.0047162427,0.12498004,0.00072280626,0.0001748202,0.0016627321,0.000116496856,0.0064837965,0.016934104],"genre_scores_gemma":[0.8037489,0.0012070604,0.19413352,0.000038611743,0.000031066633,0.0004526202,0.00007709191,0.000093081326,0.00021804952],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986468,0.00012214477,0.00036749852,0.00016094865,0.00018622924,0.00051637384],"domain_scores_gemma":[0.9947701,0.0006911527,0.00011265559,0.004128306,0.000118452954,0.00017929586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021892157,0.00029638052,0.000296552,0.00014311139,0.0003644894,0.000050641716,0.0015719172,0.00013192403,0.000041312745],"category_scores_gemma":[0.0001124599,0.00029332683,0.00006804074,0.0004178177,0.00022844481,0.00076926366,0.00039919603,0.00052299874,0.0003237831],"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.00035197084,0.0026615355,0.3778359,0.000752549,0.0012528196,0.0000030648278,0.01241392,0.1271623,0.25972557,0.0029606961,0.013291915,0.20158777],"study_design_scores_gemma":[0.0014174624,0.00015621744,0.029778022,0.00028529312,0.00006994385,0.000044679735,0.00028492755,0.6913492,0.105888166,0.000077903314,0.16924061,0.001407537],"about_ca_topic_score_codex":0.000030062312,"about_ca_topic_score_gemma":0.00005662579,"teacher_disagreement_score":0.56418693,"about_ca_system_score_codex":0.00016332496,"about_ca_system_score_gemma":0.000021848668,"threshold_uncertainty_score":0.9999519},"labels":[],"label_agreement":null},{"id":"W1973612436","doi":"10.1049/iet-com.2011.0025","title":"Theoretical analysis for tree-like networks using random geometry","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Hierarchical routing; Routing table; Computer science; Hierarchical network model; Static routing; Network topology; Multipath routing; Routing (electronic design automation); Policy-based routing; Dynamic Source Routing; Distributed computing; Computer network; Routing protocol","score_opus":0.058631513950006355,"score_gpt":0.31698394375612327,"score_spread":0.2583524298061169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973612436","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.0074236793,0.0002266447,0.97196674,0.00009449743,0.000025258223,0.00027615274,0.000025684185,0.00009019611,0.019871173],"genre_scores_gemma":[0.91710347,0.00001968607,0.08233167,0.000048309383,0.00008413983,0.00012271797,0.00022477779,0.000018513298,0.000046716337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989818,0.00015984503,0.0003382005,0.0001939364,0.00008326864,0.00024298379],"domain_scores_gemma":[0.9972516,0.00044209516,0.00014543459,0.0019517844,0.00013465786,0.00007445678],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038466722,0.00014178669,0.00034311888,0.0002184341,0.00036671408,0.00004493374,0.0009430313,0.000047076297,0.0011112327],"category_scores_gemma":[0.000008859197,0.00013715721,0.0005227642,0.0011169309,0.00027646997,0.00007598061,0.0003067463,0.00018147245,0.000004297361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045009638,0.00037467436,0.059604116,0.0000018597668,0.0022967309,9.495758e-8,0.0003030596,0.0017447165,0.000034979686,0.92446846,0.0006775621,0.010448766],"study_design_scores_gemma":[0.00051064405,0.000021528498,0.0032294204,0.000009148149,0.002289939,2.4671468e-7,0.00016796582,0.9045279,0.00007257922,0.08638289,0.0025401902,0.00024756565],"about_ca_topic_score_codex":0.00026142295,"about_ca_topic_score_gemma":0.000077394965,"teacher_disagreement_score":0.9096798,"about_ca_system_score_codex":0.000021956148,"about_ca_system_score_gemma":0.000021289012,"threshold_uncertainty_score":0.9998019},"labels":[],"label_agreement":null},{"id":"W1974089078","doi":"10.1049/iet-com.2013.0895","title":"Evaluation of the capacity of constrained codes with multiple constrained signalling dimensions","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Signalling; Computer science; Telecommunications; Mathematical optimization; Mathematics; Mathematical economics","score_opus":0.05790657004328654,"score_gpt":0.2757744603460956,"score_spread":0.21786789030280906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974089078","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.3923086,0.000109461784,0.59736675,0.003566408,0.000042541407,0.00078941375,0.00005817429,0.00010518961,0.0056534675],"genre_scores_gemma":[0.92001325,0.000008572805,0.079851374,0.00003741501,0.000003993641,0.000060729995,0.000013129788,0.0000050368217,0.0000065057948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984971,0.0004866513,0.00031343175,0.00015202853,0.00044040915,0.000110340916],"domain_scores_gemma":[0.9957745,0.00079440995,0.00029170993,0.00237199,0.0007269518,0.00004040674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271403,0.00008955845,0.00015774506,0.000049044666,0.0003000229,0.000022214059,0.001603859,0.000038945735,0.000008430987],"category_scores_gemma":[0.0003004767,0.00006554235,0.000067542605,0.00045357482,0.00068694836,0.00011307787,0.00030388392,0.00012622167,0.000002971125],"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.0000027820754,0.0004536414,0.0022927774,0.00001958316,0.00010677009,2.939607e-8,0.0019618217,0.005570715,0.2961227,0.685023,0.00008071404,0.008365456],"study_design_scores_gemma":[0.00060476,0.00003390265,0.0048263483,0.00006852249,0.000110056906,0.000006144444,0.00012958255,0.95438474,0.031832166,0.0074057938,0.00048969395,0.00010829064],"about_ca_topic_score_codex":0.000116739364,"about_ca_topic_score_gemma":0.00033149152,"teacher_disagreement_score":0.94881403,"about_ca_system_score_codex":0.000023477649,"about_ca_system_score_gemma":0.0002174631,"threshold_uncertainty_score":0.2980396},"labels":[],"label_agreement":null},{"id":"W1976416527","doi":"10.1049/iet-com.2008.0414","title":"Antenna parameter effects on spatial channel models","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Spatial correlation; Channel (broadcasting); Antenna (radio); MIMO; Antenna array; Channel capacity; Computer science; Coupling (piping); Orientation (vector space); Electronic engineering; Telecommunications; Topology (electrical circuits); Mathematics; Geometry; Engineering","score_opus":0.02361615752610114,"score_gpt":0.2533806091973505,"score_spread":0.22976445167124937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976416527","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.0013674587,0.0005898769,0.9839112,0.0005962512,0.00015272737,0.00037054563,0.000009507913,0.0005786125,0.012423807],"genre_scores_gemma":[0.9837489,0.0002848507,0.015552336,0.0001822422,0.0000454036,0.000060775477,0.00004525488,0.000024175155,0.00005605346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994688,0.00004622645,0.00016584185,0.00009808773,0.000067639296,0.00015341792],"domain_scores_gemma":[0.9984476,0.00017233775,0.000029580118,0.0012628003,0.000040366165,0.000047317495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005459541,0.00011722786,0.00012666963,0.00007498929,0.00010030815,0.00002203223,0.0003906402,0.00006328798,0.000002682542],"category_scores_gemma":[0.00003579559,0.00012437497,0.000040175524,0.00014195447,0.000019124653,0.0001775051,0.000031900454,0.00016868499,0.000060864568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069296666,0.00009018729,0.0000063650796,0.000023982568,0.00002715228,0.0000011811157,0.0006698516,0.9656239,0.0033467035,0.005711975,0.00073772966,0.023753999],"study_design_scores_gemma":[0.00020259195,0.000053755564,0.00014730183,0.00007096224,0.000008851761,0.0000022484976,0.000013953889,0.99195325,0.0010124779,0.005994327,0.0003944111,0.00014585533],"about_ca_topic_score_codex":0.0000115445055,"about_ca_topic_score_gemma":0.000016823578,"teacher_disagreement_score":0.98238146,"about_ca_system_score_codex":0.00005503379,"about_ca_system_score_gemma":0.000004973274,"threshold_uncertainty_score":0.5071864},"labels":[],"label_agreement":null},{"id":"W1977873640","doi":"10.1049/iet-com.2010.0836","title":"Blind channel estimation and discrete speed tracking in wireless systems using independent component analysis with particle filtering","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Channel (broadcasting); Particle filter; Kalman filter; MIMO; Algorithm; Block (permutation group theory); Benchmark (surveying); Bit error rate; Wireless; Real-time computing; Control theory (sociology); Mathematics; Telecommunications; Artificial intelligence","score_opus":0.08058643431635498,"score_gpt":0.34007393093391936,"score_spread":0.2594874966175644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977873640","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.4809861,0.00014919565,0.51824236,0.000304926,0.000014113828,0.00016460432,0.0000015908654,0.000073452,0.0000636628],"genre_scores_gemma":[0.95617265,0.000030046414,0.04370306,0.000032412885,0.0000075933744,0.000027388323,0.000014201528,0.000007850343,0.0000047986723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988945,0.00027537206,0.00028307718,0.00015959101,0.0001873459,0.00020012724],"domain_scores_gemma":[0.9985503,0.00011657499,0.00015338793,0.0010393644,0.000061016573,0.000079374404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007346188,0.00010283342,0.00017909361,0.00022805002,0.00019444824,0.0002716438,0.0005761237,0.000044402055,8.5151515e-7],"category_scores_gemma":[0.000011264486,0.00009743619,0.000028025088,0.0008316872,0.000060458744,0.0010633722,0.00034633843,0.0001643576,0.0000016438593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076443735,0.0015586062,0.21306805,0.00013350719,0.00080060714,0.0000066125294,0.09006981,0.43970478,0.02724684,0.21440724,0.0000142166145,0.012913285],"study_design_scores_gemma":[0.0002237864,0.000014531917,0.028634656,0.000045352706,0.000042467735,0.0000101114265,0.00029190062,0.9691977,0.0013212111,0.00008197097,0.0000121416815,0.0001241794],"about_ca_topic_score_codex":0.00036484477,"about_ca_topic_score_gemma":0.00020878325,"teacher_disagreement_score":0.5294929,"about_ca_system_score_codex":0.000069402035,"about_ca_system_score_gemma":0.000020422458,"threshold_uncertainty_score":0.39733323},"labels":[],"label_agreement":null},{"id":"W1979510651","doi":"10.1049/iet-com.2014.0101","title":"New secure channel coding scheme based on randomly punctured quasi‐cyclic‐low density parity check codes","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Low-density parity-check code; Coding (social sciences); Computer science; Mathematics; Algorithm; Theoretical computer science; Decoding methods; Statistics","score_opus":0.02798032762434987,"score_gpt":0.2854081206070522,"score_spread":0.2574277929827023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979510651","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.003194521,0.0000803507,0.9731465,0.016640345,0.00026332313,0.00043678796,0.0000046702467,0.0015297217,0.004703782],"genre_scores_gemma":[0.76089054,0.00003088595,0.2374774,0.0013236142,0.000055701148,0.000053915566,0.000023093024,0.000019648134,0.00012521798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978367,0.0006038416,0.00037081706,0.0004635132,0.00036177662,0.00036336976],"domain_scores_gemma":[0.99313223,0.0011312283,0.0002517618,0.0050654537,0.00022627426,0.0001930351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012417049,0.00027855425,0.00037474342,0.00016820108,0.00070064433,0.00023855324,0.0039076474,0.00018013363,0.00000785995],"category_scores_gemma":[0.0009606419,0.00026976093,0.00016915878,0.00058786734,0.000095613315,0.00030193935,0.0008726877,0.0007299076,0.000055183114],"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.00051265024,0.0046316916,0.016319187,0.0003499009,0.0003523658,0.00001447159,0.019764176,0.0020792354,0.03208668,0.61430204,0.21917659,0.090411],"study_design_scores_gemma":[0.001619781,0.00018397688,0.003712068,0.0002699581,0.000027087597,0.000009855812,0.00005327088,0.953746,0.013930272,0.015054362,0.010784203,0.0006091193],"about_ca_topic_score_codex":0.0004156119,"about_ca_topic_score_gemma":0.0008574191,"teacher_disagreement_score":0.95166683,"about_ca_system_score_codex":0.000111773836,"about_ca_system_score_gemma":0.0001615213,"threshold_uncertainty_score":0.99997544},"labels":[],"label_agreement":null},{"id":"W1981188156","doi":"10.1049/iet-com.2013.0796","title":"Physical layer‐optimal and cross‐layer channel access policies for hybrid overlay–underlay cognitive radio networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Underlay; Overlay; Cognitive radio; Computer science; Computer network; Physical layer; Channel (broadcasting); Layer (electronics); Telecommunications; Wireless; Signal-to-noise ratio (imaging)","score_opus":0.047403982694264046,"score_gpt":0.3386335119511704,"score_spread":0.29122952925690637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981188156","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.10649776,0.00061636075,0.8847574,0.0039168815,0.00017820095,0.00045715593,0.000027575781,0.00020904848,0.003339635],"genre_scores_gemma":[0.993022,0.00029393012,0.0051752995,0.0008296005,0.00045690616,0.00006263083,0.00003610183,0.000029588296,0.000093933515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984429,0.00021126837,0.0002568312,0.00043633312,0.00014617758,0.00050648494],"domain_scores_gemma":[0.99614,0.0020520054,0.00015632261,0.0012180359,0.0002709468,0.00016268437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034618124,0.0002471657,0.00032461685,0.00010255856,0.0010173336,0.0009065336,0.001485242,0.000067503825,0.0000022808833],"category_scores_gemma":[0.00013900512,0.00024784706,0.00014346997,0.00032914287,0.0004099726,0.00074167387,0.0010927031,0.00034425073,0.000005349209],"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.00026643684,0.0018497647,0.002869525,0.00009978837,0.000945618,0.000009413734,0.016750166,0.035642065,0.0013332291,0.62809783,0.01398052,0.29815564],"study_design_scores_gemma":[0.0007747432,0.00012468186,0.0076107103,0.0000642336,0.000042031366,0.000038317274,0.00007415999,0.9806189,0.000390529,0.006749899,0.003168142,0.00034365823],"about_ca_topic_score_codex":0.00008637059,"about_ca_topic_score_gemma":0.000097522454,"teacher_disagreement_score":0.9449768,"about_ca_system_score_codex":0.000043652617,"about_ca_system_score_gemma":0.00004567491,"threshold_uncertainty_score":0.9999974},"labels":[],"label_agreement":null},{"id":"W1982622847","doi":"10.1049/iet-com.2010.1118","title":"Impact of outdated channel information on the bit error rate performance for amplify-and-forward selective relaying systems","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bit error rate; Rayleigh fading; Channel (broadcasting); Relay; Computer science; Diversity gain; Moment-generating function; Selection (genetic algorithm); Telecommunications; Signal-to-noise ratio (imaging); Algorithm; Fading; Diversity combining; Mutual information; Bit (key); Maximal-ratio combining; Electronic engineering; Mathematics; Statistics; Computer network; Probability density function; Engineering; Physics; Artificial intelligence; Power (physics)","score_opus":0.09509874779527124,"score_gpt":0.33413659698094045,"score_spread":0.23903784918566923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982622847","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.48849282,0.004302481,0.47371316,0.0127703175,0.0007346592,0.0047166,0.00014257156,0.0005439459,0.014583448],"genre_scores_gemma":[0.9966442,0.0010832702,0.0017096286,0.00018308178,0.000019645337,0.00026931224,0.000044869794,0.0000072291673,0.000038790455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989015,0.00034142612,0.00033749736,0.000087558765,0.000105116604,0.00022690892],"domain_scores_gemma":[0.9965782,0.0009565919,0.00027440247,0.0017539806,0.00037093685,0.00006588993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169462,0.00012598858,0.00015851436,0.00012145787,0.0007607486,0.00011971736,0.0014629703,0.00005353896,0.0000022949714],"category_scores_gemma":[0.00020480138,0.00008918643,0.000065726876,0.0005217542,0.00009319838,0.0011530452,0.00051400496,0.00025233068,0.000019684132],"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.00013046374,0.00062040304,0.012596577,0.000121992816,0.0005702942,3.132898e-8,0.051581215,0.010950086,0.0016718894,0.8618225,0.01285018,0.047084402],"study_design_scores_gemma":[0.0005068365,0.0002587604,0.05282181,0.00014219426,0.000024367659,0.0000060152393,0.0004695151,0.9325834,0.00029852812,0.00019507548,0.012427664,0.00026584722],"about_ca_topic_score_codex":0.000025614398,"about_ca_topic_score_gemma":0.000005992569,"teacher_disagreement_score":0.9216333,"about_ca_system_score_codex":0.00008958247,"about_ca_system_score_gemma":0.00006457873,"threshold_uncertainty_score":0.585114},"labels":[],"label_agreement":null},{"id":"W1982695909","doi":"10.1049/iet-com.2013.1035","title":"Iterative interference cancellation in multiuser relaying with fast frequency‐hopping modulation","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","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":"McGill University; University of Saskatchewan","funders":"","keywords":"Frequency-hopping spread spectrum; Single antenna interference cancellation; Interference (communication); Modulation (music); Computer science; Co-channel interference; Telecommunications; Electronic engineering; Physics; Acoustics; Decoding methods; Channel (broadcasting)","score_opus":0.04831355730042087,"score_gpt":0.29015028176768287,"score_spread":0.241836724467262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982695909","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.026690653,0.0003328691,0.9500096,0.0051152827,0.000076001576,0.00031736016,0.0000014523953,0.00017850091,0.017278276],"genre_scores_gemma":[0.8981383,0.0003473355,0.10100693,0.00027925838,0.000016877653,0.000085385895,0.000023548848,0.00001047881,0.00009188677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984572,0.0005514018,0.0003512707,0.00029075073,0.00014596428,0.00020341687],"domain_scores_gemma":[0.99675614,0.00040740354,0.00016913854,0.0023537131,0.00025619238,0.000057406734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046506763,0.0001526048,0.00016480198,0.00019407598,0.0004380382,0.00019681753,0.0018150429,0.000054564203,0.0000112440375],"category_scores_gemma":[0.00010031532,0.00014554331,0.000028902019,0.0008451192,0.000102364014,0.00087230594,0.0005716212,0.0003776883,0.000024161],"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.000016538537,0.0002691459,0.042650048,0.00001921483,0.00004245328,0.0000012294669,0.02813101,0.021159219,0.009938556,0.5909246,0.00016942044,0.30667853],"study_design_scores_gemma":[0.00043788328,0.00005238132,0.031696018,0.00023853629,0.0000033941562,0.0000037817617,0.0001322855,0.9633724,0.00016605713,0.0016990432,0.001953546,0.00024464764],"about_ca_topic_score_codex":0.000081084065,"about_ca_topic_score_gemma":0.003154376,"teacher_disagreement_score":0.94221324,"about_ca_system_score_codex":0.00015342006,"about_ca_system_score_gemma":0.00006384484,"threshold_uncertainty_score":0.59350836},"labels":[],"label_agreement":null},{"id":"W1983153254","doi":"10.1049/iet-com.2009.0643","title":"Multimode two-dimensional balanced conservative codes for holographic storage","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multi-mode optical fiber; Coding (social sciences); Decoding methods; Computer science; Encoder; Algorithm; Encoding (memory); Mathematics; Telecommunications; Optical fiber","score_opus":0.030434688415123808,"score_gpt":0.31305131123673247,"score_spread":0.28261662282160865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983153254","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.23862597,0.00026145106,0.7350278,0.020275509,0.00031507947,0.0011974995,0.0002265033,0.00077691826,0.0032932924],"genre_scores_gemma":[0.6838674,0.0000069049543,0.31511533,0.0004148787,0.0000126474515,0.00036769224,0.00011627311,0.000007699879,0.00009118976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.00007325272,0.00021490714,0.00026617027,0.00011327956,0.000197208],"domain_scores_gemma":[0.9959522,0.0007631188,0.00011315169,0.0028618553,0.00022526513,0.00008439162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002837586,0.00011702734,0.0001403128,0.00008513423,0.00060305797,0.000091120775,0.0023193448,0.00006193639,0.000012281761],"category_scores_gemma":[0.00007540986,0.00011720175,0.000093651855,0.0003851615,0.0002950852,0.0002340877,0.0004969863,0.00028408787,0.000042533648],"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.0000039406277,0.0004517528,0.0014504989,0.000006959313,0.000047379315,6.0748323e-7,0.00069828646,0.00032579535,0.16649981,0.8218119,0.0037022398,0.0050007924],"study_design_scores_gemma":[0.0010035222,0.000038095506,0.017537966,0.00001245132,0.000020660522,0.000013604737,0.000035345667,0.90604955,0.0033804015,0.027649453,0.043922767,0.00033616085],"about_ca_topic_score_codex":0.00008143918,"about_ca_topic_score_gemma":0.0004186356,"teacher_disagreement_score":0.90572375,"about_ca_system_score_codex":0.000011187655,"about_ca_system_score_gemma":0.000090180234,"threshold_uncertainty_score":0.47793487},"labels":[],"label_agreement":null},{"id":"W1983985058","doi":"10.1049/iet-com.2011.0043","title":"Interference-aware joint user selection and quantised power control schemes for uplink cognitive multiple-input multiple-output system","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Telecommunications link; Joint (building); Computer science; Interference (communication); Power control; Selection (genetic algorithm); Power (physics); Cognitive radio; Cognition; Control (management); Telecommunications; Artificial intelligence; Wireless; Psychology; Engineering; Channel (broadcasting)","score_opus":0.06485295410828515,"score_gpt":0.2701786479954458,"score_spread":0.20532569388716063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983985058","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.025576292,0.0004546799,0.97100836,0.0005009189,0.00019639496,0.0009687823,0.00003704644,0.00033087304,0.0009266715],"genre_scores_gemma":[0.9563494,0.00006990494,0.043185327,0.00015582051,0.00003935833,0.000107073014,0.000023307497,0.000024477571,0.000045361543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984359,0.00022577649,0.00042282365,0.0004414455,0.00011945476,0.00035455983],"domain_scores_gemma":[0.9969166,0.0012324331,0.00022786931,0.00089705596,0.00059590937,0.00013012487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003455006,0.00023730533,0.00033322768,0.00015938656,0.00066215923,0.00019275302,0.000699562,0.000116696574,0.0000046625514],"category_scores_gemma":[0.00024718215,0.00023309824,0.00015009713,0.00028577732,0.00015308542,0.00041012047,0.00036045516,0.00030083655,0.000013905387],"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.0014596878,0.0031198892,0.14118442,0.0005480381,0.0034491348,0.000036397665,0.051183674,0.00011184355,0.008373325,0.43603322,0.0020958628,0.3524045],"study_design_scores_gemma":[0.0026743966,0.00026086203,0.018203277,0.00042151142,0.000082746796,0.000056328427,0.0010395419,0.9746314,0.0010714772,0.00028993262,0.0008735615,0.0003949314],"about_ca_topic_score_codex":0.0001308499,"about_ca_topic_score_gemma":0.00043868847,"teacher_disagreement_score":0.9745196,"about_ca_system_score_codex":0.00008025419,"about_ca_system_score_gemma":0.000071260285,"threshold_uncertainty_score":0.95054704},"labels":[],"label_agreement":null},{"id":"W1985033232","doi":"10.1049/iet-com.2014.0658","title":"Improved finite‐length Luby‐transform codes in the binary erasure channel","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Yarmouk University","keywords":"Erasure; Luby transform code; Binary erasure channel; Online codes; Tornado code; Computer science; Erasure code; Binary number; Channel (broadcasting); Algorithm; Decoding methods; Mathematics; Low-density parity-check code; Computer network; Error floor; Arithmetic; Channel capacity","score_opus":0.07969589066284656,"score_gpt":0.3190004978732516,"score_spread":0.23930460721040503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985033232","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.018878361,0.0051671476,0.68733805,0.1828408,0.0010201683,0.0029764124,0.000044658285,0.0037448448,0.09798956],"genre_scores_gemma":[0.95137084,0.00019888516,0.04729026,0.0007854696,0.00002049533,0.0002210693,0.000014061779,0.000011980861,0.00008694615],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986708,0.00037864855,0.00027132637,0.00021296546,0.00021707841,0.00024917314],"domain_scores_gemma":[0.9954311,0.0007238078,0.00008680444,0.0035272245,0.00016671905,0.00006429922],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001450295,0.00013872012,0.00014368459,0.00014251434,0.00024988578,0.00013270584,0.0055261254,0.00008360673,0.0000012917557],"category_scores_gemma":[0.00026497064,0.00011073515,0.000058950576,0.00082521775,0.0001172267,0.00042379112,0.00061184476,0.0005332868,0.000020890408],"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.00009432299,0.0053589647,0.005577221,0.00012454618,0.00018867134,0.000051869658,0.3987718,0.0017910334,0.0049329237,0.3068675,0.09511362,0.18112753],"study_design_scores_gemma":[0.0009726564,0.0005485381,0.0031970362,0.00015752141,0.000025387832,0.000066843124,0.0045948173,0.8598064,0.0013711104,0.06653262,0.061950047,0.00077700865],"about_ca_topic_score_codex":0.0004741772,"about_ca_topic_score_gemma":0.0014566152,"teacher_disagreement_score":0.9324925,"about_ca_system_score_codex":0.00007457878,"about_ca_system_score_gemma":0.00013592048,"threshold_uncertainty_score":0.99985445},"labels":[],"label_agreement":null},{"id":"W1985607164","doi":"10.1049/iet-com.2012.0752","title":"Measurement‐based analysis of cross‐layer adaptation for MIMO in mobile urban environments","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Adaptation (eye); MIMO; Telecommunications; Psychology; Channel (broadcasting)","score_opus":0.050731977628316466,"score_gpt":0.2872204322434233,"score_spread":0.23648845461510684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985607164","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.023871144,0.0014539957,0.97244596,0.00004137091,0.000045744935,0.0012106454,0.000050572613,0.00007845228,0.0008020967],"genre_scores_gemma":[0.9636423,0.00006900917,0.034800038,0.000009654003,0.0000042859524,0.0012604299,0.00016329832,0.000020591626,0.000030405809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928045,0.00004365448,0.0003586377,0.000094178526,0.000109673514,0.0001133959],"domain_scores_gemma":[0.9987937,0.00008409587,0.00008493566,0.0009113878,0.00009844597,0.000027396998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016426135,0.000085181666,0.0001678389,0.00024027146,0.0000516326,0.000017204988,0.00029373917,0.00005282748,0.00002855723],"category_scores_gemma":[0.000041671887,0.0000995082,0.00007098719,0.00046706694,0.000041252402,0.00022682585,0.000024988336,0.000062270025,0.00001072869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016654407,0.00005817989,0.003526018,0.000017121847,0.00010796332,7.955199e-9,0.0003596332,0.986002,0.008992631,0.00006988616,0.00006507962,0.0007997578],"study_design_scores_gemma":[0.00033940305,0.000012778642,0.010595417,0.000020864361,0.00009584334,2.5364498e-8,0.00014023903,0.98552865,0.0015824679,0.00004230957,0.0015467841,0.00009524232],"about_ca_topic_score_codex":0.0000795526,"about_ca_topic_score_gemma":0.0003170736,"teacher_disagreement_score":0.9397711,"about_ca_system_score_codex":0.00015477838,"about_ca_system_score_gemma":0.00001106823,"threshold_uncertainty_score":0.40578267},"labels":[],"label_agreement":null},{"id":"W1988474002","doi":"10.1049/iet-com.2008.0579","title":"A cooperative turbo coding scheme for wireless fading channels","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Fading; Decodes; Decoding methods; Turbo; Algorithm; Turbo code; Wireless; Cooperative diversity; Coding (social sciences); Computer network; Telecommunications; Mathematics","score_opus":0.0820978407727377,"score_gpt":0.33642992564150187,"score_spread":0.2543320848687642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988474002","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.0031829805,0.0019474018,0.9442252,0.0377738,0.00025524138,0.0009062372,0.000009795499,0.00053444743,0.011164879],"genre_scores_gemma":[0.8996555,0.0015519806,0.09640559,0.0017132667,0.0000605939,0.00016616382,0.000036265676,0.000011381145,0.0003992336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986321,0.00022788146,0.00035513024,0.00031368213,0.00014395603,0.000327249],"domain_scores_gemma":[0.9957972,0.00055770145,0.00013745455,0.0029398615,0.000455042,0.00011271088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039235,0.00018925562,0.00023745609,0.0001335723,0.0012896224,0.000361372,0.0038531716,0.00007099281,0.000011403589],"category_scores_gemma":[0.00014259035,0.00019487675,0.00010447984,0.0007554851,0.00010162587,0.0006369986,0.0007277051,0.00029727275,0.000030900726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058899177,0.000179307,0.000029534263,0.0000048278225,0.00003099373,4.2800383e-7,0.003865649,0.00017038328,0.008851589,0.8945849,0.0040542926,0.088222235],"study_design_scores_gemma":[0.0009737836,0.00019508791,0.0004267082,0.00017285453,0.000014059253,0.000012611563,0.00020251937,0.8980055,0.0045948285,0.006322813,0.08848854,0.0005906991],"about_ca_topic_score_codex":0.000002551327,"about_ca_topic_score_gemma":0.000021416006,"teacher_disagreement_score":0.89783514,"about_ca_system_score_codex":0.00009105445,"about_ca_system_score_gemma":0.00009587531,"threshold_uncertainty_score":0.9918863},"labels":[],"label_agreement":null},{"id":"W1988563807","doi":"10.1049/iet-com.2013.0078","title":"Signal‐to‐noise‐ratio maximisation for linear multi‐antenna relay communications","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Iran Telecommunication Research Center","keywords":"Relay; Signal-to-noise ratio (imaging); Computer science; Maximal-ratio combining; Antenna (radio); SIGNAL (programming language); Telecommunications; Physics; Fading","score_opus":0.12449000689496947,"score_gpt":0.34261841902958534,"score_spread":0.21812841213461587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988563807","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.00047864963,0.0011204378,0.92907214,0.06434991,0.00014739342,0.0018942959,0.000019628675,0.00045336128,0.0024642104],"genre_scores_gemma":[0.47907332,0.0016383146,0.5140422,0.002302354,0.000036797504,0.0018335677,0.00014935201,0.00002850864,0.00089559896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976765,0.000553369,0.00070788694,0.0004259899,0.00022638375,0.00040987975],"domain_scores_gemma":[0.98742145,0.0011877662,0.0002458668,0.009688371,0.0011995186,0.00025704372],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070718536,0.00026745643,0.00028161053,0.00026009534,0.0017249531,0.00041851486,0.009068804,0.000119707656,0.00007823165],"category_scores_gemma":[0.00034781528,0.00027994314,0.00016147041,0.0011011654,0.00023205676,0.0010181708,0.0031851148,0.0004404782,0.0008064101],"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.000015582036,0.0017252776,0.0011095073,0.00003999685,0.00021445563,3.5409232e-7,0.012950258,0.0017931579,0.06713106,0.6492146,0.040888324,0.2249174],"study_design_scores_gemma":[0.0005085609,0.00007313964,0.0029487093,0.00006096133,0.000017311006,0.0000033509757,0.00016895203,0.85709876,0.0005565476,0.0013710378,0.13681726,0.00037539733],"about_ca_topic_score_codex":0.00007833321,"about_ca_topic_score_gemma":0.00037504314,"teacher_disagreement_score":0.8553056,"about_ca_system_score_codex":0.0001413289,"about_ca_system_score_gemma":0.00015682558,"threshold_uncertainty_score":0.99997157},"labels":[],"label_agreement":null},{"id":"W1989431552","doi":"10.1049/iet-com.2013.0206","title":"Simplified maximum‐likelihood detectors for full‐rate alternate‐relaying cooperative systems","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Maximum likelihood; Detector; Computer science; Statistics; Mathematics; Telecommunications","score_opus":0.05475262002154921,"score_gpt":0.29903515101822525,"score_spread":0.24428253099667604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989431552","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.013773385,0.0037006084,0.96045864,0.011099672,0.00060028647,0.0023249865,0.000023056542,0.0006323153,0.0073870313],"genre_scores_gemma":[0.95757085,0.0016968898,0.038088884,0.0006728315,0.00005954908,0.0015442603,0.00005016614,0.000030827076,0.00028571984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780595,0.000616672,0.00056071853,0.00039663268,0.00016459606,0.00045545137],"domain_scores_gemma":[0.9934444,0.0011305908,0.00023306154,0.0041416036,0.0008639183,0.00018645682],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00066690723,0.0002579186,0.00029598348,0.00015207763,0.0013027452,0.00081369077,0.004749648,0.00009607158,0.000037501097],"category_scores_gemma":[0.00019528637,0.00024726338,0.000116888696,0.0006423892,0.00013740806,0.0008826629,0.0015355189,0.0003691551,0.00032219177],"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.000023322968,0.0005608595,0.0005282301,0.000066752065,0.00037613988,0.0000014481055,0.006066929,0.0028064149,0.05107711,0.72245234,0.01990984,0.19613063],"study_design_scores_gemma":[0.0010788856,0.00019981634,0.0007735594,0.0001307317,0.000027133721,0.000019744306,0.0004984735,0.9178485,0.0010821335,0.008730744,0.068896554,0.00071372575],"about_ca_topic_score_codex":0.000100871366,"about_ca_topic_score_gemma":0.00015951043,"teacher_disagreement_score":0.94379747,"about_ca_system_score_codex":0.0001220718,"about_ca_system_score_gemma":0.00012317541,"threshold_uncertainty_score":0.999998},"labels":[],"label_agreement":null},{"id":"W1991017500","doi":"10.1049/iet-com.2014.0397","title":"Cooperative clustering‐based medium access control for broadcasting in vehicular <i>ad‐hoc</i> networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":28,"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":"University of Waterloo; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Vehicular ad hoc network; Broadcasting (networking); Wireless ad hoc network; Computer network; Access control; Mobile ad hoc network; Control (management); Telecommunications; Wireless; Artificial intelligence","score_opus":0.05955099436901137,"score_gpt":0.32680505706810997,"score_spread":0.26725406269909857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991017500","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.00043877086,0.0026624103,0.97919637,0.015001989,0.00018506144,0.00074874196,0.0000056730823,0.000190683,0.0015702936],"genre_scores_gemma":[0.95172715,0.0011558209,0.04284038,0.0034960918,0.000054657336,0.00059622596,0.000054502918,0.000022968448,0.000052188643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977126,0.0008583888,0.0005248226,0.0003695537,0.00014518635,0.0003894377],"domain_scores_gemma":[0.99376565,0.0022728434,0.00019944164,0.0032121819,0.00043218394,0.0001176985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013090683,0.00022025617,0.00032621413,0.00015735571,0.0007519104,0.0004330755,0.00523064,0.00010225781,0.000009655832],"category_scores_gemma":[0.00043739995,0.00022596118,0.000101343074,0.00083055126,0.0001579814,0.0005848788,0.0013337078,0.0004521457,0.000009119707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101538266,0.00085519097,0.0030282747,0.000060575887,0.00012430687,0.0000017917585,0.0028949657,0.61035895,0.0017866562,0.09026439,0.005092098,0.28543127],"study_design_scores_gemma":[0.0015209785,0.00006572646,0.0011810258,0.00009795677,0.000009305263,0.0000017786335,0.000019465417,0.919246,0.00006440878,0.00022937125,0.077322856,0.00024112535],"about_ca_topic_score_codex":0.000008228964,"about_ca_topic_score_gemma":0.0016775517,"teacher_disagreement_score":0.9512884,"about_ca_system_score_codex":0.00009659669,"about_ca_system_score_gemma":0.00012868046,"threshold_uncertainty_score":0.9719918},"labels":[],"label_agreement":null},{"id":"W1992198110","doi":"10.1049/iet-com.2013.1158","title":"Markovian‐based framework for cooperative channel selection in cognitive radio networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cognitive radio; Computer science; Markov process; Selection (genetic algorithm); Channel (broadcasting); Computer network; Telecommunications; Artificial intelligence; Wireless; Mathematics","score_opus":0.03248518600555658,"score_gpt":0.2994036015432307,"score_spread":0.26691841553767415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992198110","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.001372418,0.00026682296,0.9922628,0.0032773647,0.00013480308,0.0005337832,0.000005241653,0.00013462489,0.0020121688],"genre_scores_gemma":[0.89122915,0.00008042784,0.10749301,0.0008208956,0.00012948766,0.00015003269,0.000035169014,0.0000167729,0.000045037097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985488,0.00040320918,0.00026899276,0.00033857863,0.000095980104,0.00034442358],"domain_scores_gemma":[0.99596804,0.0028832383,0.00011652845,0.0006732685,0.00027830302,0.000080631755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005561689,0.0001668414,0.00023231792,0.00015114967,0.00059936784,0.0001272992,0.0008133303,0.00012675383,0.000008051165],"category_scores_gemma":[0.00037259844,0.00018044931,0.00008439823,0.0008969978,0.00014176588,0.00024416726,0.00017263662,0.00045015957,0.0000053382114],"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.0001966839,0.0011121045,0.00386612,0.000029012206,0.00017565883,0.0000038689686,0.0044254567,0.06033039,0.00014053956,0.78476304,0.0028750608,0.14208208],"study_design_scores_gemma":[0.0006187813,0.00012739844,0.0046093455,0.00015448786,0.000012588122,0.0000067271203,0.00005224787,0.9832103,0.00007934304,0.009743652,0.0011626874,0.00022240388],"about_ca_topic_score_codex":0.00003967701,"about_ca_topic_score_gemma":0.000507182,"teacher_disagreement_score":0.92287993,"about_ca_system_score_codex":0.000089112764,"about_ca_system_score_gemma":0.00008490508,"threshold_uncertainty_score":0.73585093},"labels":[],"label_agreement":null},{"id":"W1992290340","doi":"10.1049/iet-com:20070099","title":"Packet-loss-robust load-balancing switch with distributed extended cross-point queues","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Queue; Network packet; Packet switching; Computer network; Load balancing (electrical power); Queueing theory; Distributed computing","score_opus":0.02407038269048289,"score_gpt":0.2830280386695847,"score_spread":0.2589576559791018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992290340","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.025103128,0.0007255623,0.94496083,0.013545722,0.00036247697,0.00041400184,0.000024865047,0.0007515178,0.014111906],"genre_scores_gemma":[0.9834931,0.00006863464,0.01544513,0.00052881986,0.0000762776,0.000038955506,0.00004107382,0.000010462439,0.00029757895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846196,0.00017792739,0.00040857174,0.00032783323,0.00028569417,0.00033802798],"domain_scores_gemma":[0.9958372,0.00018018727,0.00019254202,0.003178331,0.0004960495,0.00011569975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052442536,0.00018464989,0.00023047342,0.000061312356,0.0006525004,0.00054647215,0.0022294128,0.000086462634,0.000016473095],"category_scores_gemma":[0.00005929469,0.00015375768,0.00008567124,0.000582739,0.00012823408,0.0006124238,0.00029141305,0.00033285972,0.000059963582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009618867,0.0014664235,0.013761501,0.00004361788,0.00024303338,0.0000556766,0.008395608,0.017356742,0.0014557872,0.8961886,0.034002878,0.026933935],"study_design_scores_gemma":[0.0029515577,0.00093068444,0.13068375,0.00076454773,0.00005715042,0.0007427272,0.0010031019,0.7252421,0.0015364805,0.02838599,0.10581994,0.0018819699],"about_ca_topic_score_codex":0.00015923755,"about_ca_topic_score_gemma":0.00045481886,"teacher_disagreement_score":0.95838994,"about_ca_system_score_codex":0.00018514851,"about_ca_system_score_gemma":0.0001374808,"threshold_uncertainty_score":0.6270056},"labels":[],"label_agreement":null},{"id":"W1992752766","doi":"10.1049/iet-com.2013.0128","title":"Multi‐objective resource allocation in multiuser orthogonal frequency division multiplexing system","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Resource allocation; Division (mathematics); Frequency-division multiplexing; Multiplexing; Telecommunications; Orthogonal frequency-division multiple access; Computer network; Mathematics; Arithmetic","score_opus":0.01761153776532924,"score_gpt":0.24279195568721426,"score_spread":0.22518041792188503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992752766","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.1203538,0.0014516946,0.86929816,0.00035706448,0.00019884476,0.0016174676,0.000028210348,0.0014445282,0.00525021],"genre_scores_gemma":[0.846553,0.00013298803,0.15254565,0.00002006463,0.000026309246,0.0004350365,0.00020675389,0.000053134194,0.000027019663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987862,0.0001569716,0.00044040446,0.00020432568,0.00014288897,0.00026922143],"domain_scores_gemma":[0.9981972,0.00029190822,0.000084858926,0.0012127341,0.00014229452,0.00007102218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016450127,0.00019184488,0.0001866321,0.00018191052,0.00019677429,0.00004907748,0.0005727907,0.00012507799,0.000017036484],"category_scores_gemma":[0.000077816956,0.00020919077,0.00004660324,0.00043551423,0.00006836416,0.0005283846,0.00015743804,0.00036869463,0.00011835299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013196725,0.00006607605,0.0050357645,0.000030410345,0.000016670685,4.3419084e-7,0.0010357082,0.9821121,0.0046811504,0.0013602506,0.00008138849,0.0055787396],"study_design_scores_gemma":[0.00041362797,0.000006858896,0.042388946,0.00017211873,0.0000039962674,0.0000017806636,0.0006306024,0.9556608,0.00016859572,0.00008028719,0.0002609291,0.00021141751],"about_ca_topic_score_codex":0.00019672353,"about_ca_topic_score_gemma":0.0005409111,"teacher_disagreement_score":0.72619927,"about_ca_system_score_codex":0.00035936103,"about_ca_system_score_gemma":0.00001626892,"threshold_uncertainty_score":0.85305524},"labels":[],"label_agreement":null},{"id":"W1992880174","doi":"10.1049/iet-com.2013.0134","title":"Modulation network coding","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Modulation (music); Linear network coding; Computer network; Physics; Network packet","score_opus":0.06457034901352429,"score_gpt":0.29760729472007863,"score_spread":0.23303694570655434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992880174","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.0020354309,0.0016532064,0.90619075,0.027163016,0.0002406828,0.0005106708,8.0852413e-7,0.0006099156,0.061595544],"genre_scores_gemma":[0.87021154,0.0015544652,0.12672746,0.0008946007,0.000049714312,0.00014036214,0.000016609787,0.000008331179,0.00039690177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891114,0.0002785426,0.00026789922,0.00018217675,0.00012950735,0.00023072085],"domain_scores_gemma":[0.99564946,0.00029830725,0.00010028881,0.0036220793,0.00024598208,0.000083870866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029452887,0.00010711574,0.000114431685,0.000060923332,0.00077496015,0.0003110615,0.003188776,0.0000454991,0.000115381474],"category_scores_gemma":[0.00005532285,0.000109477565,0.000052501204,0.00068219303,0.00007890172,0.0008409998,0.0015014966,0.00022887814,0.0005564651],"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":[3.160108e-7,0.00005504499,0.0008883597,0.0000018215023,0.000015790902,1.0359496e-7,0.00057917135,0.0009694587,0.0008239127,0.818336,0.019538546,0.15879147],"study_design_scores_gemma":[0.0001628634,0.000015505453,0.025174085,0.0000326035,0.000003457597,0.000004279522,0.000028092449,0.88113445,0.00004246563,0.018226847,0.074959464,0.00021589591],"about_ca_topic_score_codex":0.000021297212,"about_ca_topic_score_gemma":0.000049009326,"teacher_disagreement_score":0.880165,"about_ca_system_score_codex":0.000048683567,"about_ca_system_score_gemma":0.00003625208,"threshold_uncertainty_score":0.7152419},"labels":[],"label_agreement":null},{"id":"W1993546399","doi":"10.1049/iet-com:20050416","title":"Capacity analysis for a multiuser cross-layer downlink model in the presence of fading and interference","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Telecommunications link; Physical layer; Computer science; Scheduling (production processes); Fading; Base station; Beamforming; PHY; Interference (communication); Signal-to-interference-plus-noise ratio; Computer network; Telecommunications; Wireless; Mathematical optimization; Mathematics; Channel (broadcasting)","score_opus":0.08049654001323628,"score_gpt":0.3396949406064103,"score_spread":0.259198400593174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993546399","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.12990382,0.00017830508,0.86904836,0.000047956506,0.000010899504,0.00023161752,0.00002503185,0.000027804332,0.0005261795],"genre_scores_gemma":[0.9072037,0.00008307175,0.092612974,0.000008563808,0.0000034338993,0.00005673969,0.000012589919,0.00000670497,0.000012244141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.000026944761,0.00025313054,0.000074697484,0.000043367647,0.00010288303],"domain_scores_gemma":[0.9985964,0.00048906606,0.000049243226,0.000763666,0.0000852016,0.000016468297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431566,0.00006198018,0.00011446514,0.00011915975,0.00006890547,0.00001825959,0.00042516092,0.00004203755,8.150428e-7],"category_scores_gemma":[0.00011252026,0.000054101936,0.000033950346,0.00039091808,0.00008146865,0.00015755965,0.00005974329,0.00011244686,2.947322e-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.0000032866603,0.000018108221,0.008051613,0.00002238939,0.00003386554,2.5834394e-8,0.00502771,0.98233145,0.0026333432,0.0015455311,0.0000056874837,0.00032696017],"study_design_scores_gemma":[0.00012338822,0.000003996635,0.0057001663,0.000018809887,0.00002707728,4.3870392e-7,0.000282153,0.9927128,0.0006566823,0.00038968856,0.000029393967,0.000055438017],"about_ca_topic_score_codex":0.00006948465,"about_ca_topic_score_gemma":0.0015130828,"teacher_disagreement_score":0.7772999,"about_ca_system_score_codex":0.000027537482,"about_ca_system_score_gemma":0.0000045645706,"threshold_uncertainty_score":0.22062129},"labels":[],"label_agreement":null},{"id":"W1993713450","doi":"10.1049/iet-com.2014.0129","title":"Lattice‐based memory polynomial predistorter for wideband radio frequency power amplifiers","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"King Fahd University of Petroleum and Minerals","keywords":"Wideband; Amplifier; Radio frequency; Computer science; Lattice (music); Bandwidth (computing); Telecommunications; Electronic engineering; Physics; Acoustics; Engineering","score_opus":0.022787096367294125,"score_gpt":0.25737138100529366,"score_spread":0.23458428463799955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993713450","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.001591604,0.0008375999,0.96107084,0.0006740679,0.0005712536,0.00062304345,0.0001080525,0.00062477664,0.03389877],"genre_scores_gemma":[0.89988834,0.000023585782,0.0989203,0.00030119307,0.000084501095,0.0003074156,0.000118320706,0.00008048522,0.00027587154],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990269,0.00007172381,0.00030651691,0.0001838924,0.000107083506,0.0003038603],"domain_scores_gemma":[0.99691623,0.0006554155,0.00005479906,0.0021734736,0.000075661155,0.00012443544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022189356,0.0001915462,0.0002081347,0.00009606669,0.00022330835,0.00004222104,0.0008748505,0.00010706431,0.00006337697],"category_scores_gemma":[0.00011682214,0.00021644939,0.00010778797,0.00013424589,0.00015420289,0.00018962153,0.00004841504,0.00024090409,0.000049720544],"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.00025853026,0.0009994247,0.0045767664,0.0006455856,0.0011639942,0.000003988749,0.012198007,0.08771389,0.10869761,0.061450683,0.68712616,0.035165362],"study_design_scores_gemma":[0.003376277,0.00021973853,0.0020769255,0.00010847307,0.0002027354,0.000010949971,0.0002320821,0.101079755,0.004198767,0.010177181,0.8769157,0.0014014444],"about_ca_topic_score_codex":0.000015118517,"about_ca_topic_score_gemma":0.000040680843,"teacher_disagreement_score":0.8982967,"about_ca_system_score_codex":0.00013993222,"about_ca_system_score_gemma":0.000040210212,"threshold_uncertainty_score":0.882655},"labels":[],"label_agreement":null},{"id":"W1994488438","doi":"10.1049/iet-com:20060554","title":"On economical timing-error detectors for QAM receivers","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Advancements in PLL and VCO Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Jitter; Detector; Computer science; QAM; Impulse (physics); Symbol rate; Finite impulse response; Filter (signal processing); Reduction (mathematics); Digital filter; Control theory (sociology); Quadrature amplitude modulation; Bandwidth (computing); Electronic engineering; Algorithm; Bit error rate; Telecommunications; Physics; Mathematics; Decoding methods; Engineering","score_opus":0.0656070804619381,"score_gpt":0.3267254817267234,"score_spread":0.2611184012647853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994488438","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.64273316,0.0010047157,0.2591442,0.0031514184,0.0013169259,0.0013413292,0.00014714447,0.0042361547,0.08692497],"genre_scores_gemma":[0.957843,0.0001403643,0.041756064,0.000053120624,0.000013357369,0.000051576288,0.000018940491,0.000016925615,0.00010667339],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996006,0.0000043597397,0.00013875598,0.00007373416,0.0000275794,0.00015499203],"domain_scores_gemma":[0.9987944,0.0003436046,0.000020902762,0.00080004,0.000015441545,0.000025640036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000996576,0.000074296026,0.00007548698,0.000069123496,0.00012587335,0.000008692548,0.00052118924,0.00006236284,0.000015949507],"category_scores_gemma":[0.00007228102,0.00007845858,0.000036847072,0.00006932095,0.000079820325,0.000055209362,0.00007109981,0.0001398353,0.00004292142],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011722462,0.00042772118,0.0013009718,0.00009615428,0.0003824953,0.0000017696893,0.0012693701,0.04811304,0.008988291,0.30012226,0.046833027,0.5923477],"study_design_scores_gemma":[0.0009632255,0.00021864596,0.0017294419,0.000060855633,0.00004175724,0.0000029722912,0.0011387866,0.0490183,0.02690376,0.031022005,0.8882685,0.00063178287],"about_ca_topic_score_codex":0.0000018730001,"about_ca_topic_score_gemma":0.000045839704,"teacher_disagreement_score":0.84143543,"about_ca_system_score_codex":0.00008952329,"about_ca_system_score_gemma":0.000004033517,"threshold_uncertainty_score":0.3199448},"labels":[],"label_agreement":null},{"id":"W1999041413","doi":"10.1049/iet-com.2014.0399","title":"Strategic bargaining in wireless networks: basics, opportunities and challenges","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Higher Education Discipline Innovation Project; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Wireless network; Telecommunications; Computer network","score_opus":0.24798601825803362,"score_gpt":0.3079864416591468,"score_spread":0.06000042340111317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999041413","genre_codex":"other","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.011256038,0.092710316,0.28079075,0.12992868,0.00034184032,0.00073877996,0.0000040315185,0.00091027166,0.48331928],"genre_scores_gemma":[0.84149945,0.1506072,0.0073724715,0.00040023416,0.000021696993,0.00004036825,0.000008509251,0.000008236721,0.000041832798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986076,0.0006254956,0.0002635899,0.00020830479,0.00009086534,0.00020416534],"domain_scores_gemma":[0.9968681,0.0006118128,0.000084043095,0.0022586735,0.00009345498,0.00008396322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008376172,0.000124464,0.00016993326,0.000115494186,0.0003436948,0.00016598808,0.0019997407,0.000055868913,0.0000052855903],"category_scores_gemma":[0.000033498658,0.00013192705,0.000024718405,0.00025197712,0.0001684027,0.0003551039,0.001227667,0.00028536754,0.0000050392773],"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":[5.35718e-7,0.000032126456,0.00018407605,0.0000033008544,0.000004634698,3.1939533e-7,0.0007970769,0.000077221695,0.000008790805,0.86695594,0.000023621395,0.13191234],"study_design_scores_gemma":[0.00034011714,0.00004649956,0.005100281,0.0001206128,0.0000041332055,0.000007729434,0.0010672667,0.9335851,0.0000064974165,0.0157091,0.043734606,0.0002780672],"about_ca_topic_score_codex":0.000009816514,"about_ca_topic_score_gemma":0.00055680133,"teacher_disagreement_score":0.93350786,"about_ca_system_score_codex":0.000025543472,"about_ca_system_score_gemma":0.00004426399,"threshold_uncertainty_score":0.53798294},"labels":[],"label_agreement":null},{"id":"W1999699620","doi":"10.1049/iet-com.2010.0162","title":"Single-field programmable gate array simulator for geometric multiple-input multiple-output fading channel models","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Electromagnetic Compatibility and Noise Suppression","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; TransAlta (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Field-programmable gate array; Computer science; MIMO; Gate array; Channel (broadcasting); Baseband; Wireless; Electronic engineering; Simulation; Computer hardware; Telecommunications; Engineering; Bandwidth (computing)","score_opus":0.09330414381008302,"score_gpt":0.25959068910627847,"score_spread":0.16628654529619546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999699620","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.5588736,0.0030888359,0.42563614,0.00031625977,0.00035439557,0.0023538007,0.00008383854,0.0014655564,0.007827565],"genre_scores_gemma":[0.95647264,0.00016126448,0.04261323,0.000040840387,0.000041341442,0.0004082824,0.00007525365,0.000060301732,0.0001268627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985997,0.000066585206,0.00042845463,0.00026357287,0.00014487449,0.00049682974],"domain_scores_gemma":[0.9965927,0.0012478553,0.00007494596,0.0017850536,0.00015244057,0.00014698568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025791826,0.00024247501,0.0002756946,0.00026628526,0.0003074995,0.000053026848,0.0009433906,0.00015638405,0.000024625982],"category_scores_gemma":[0.00034916226,0.00025718045,0.00015536383,0.0005529146,0.0000613544,0.00029861537,0.0001625898,0.0003315438,0.000017402792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061391393,0.0051796734,0.004939771,0.0013890403,0.00086156896,0.000004687039,0.03663819,0.5241574,0.21123074,0.0023829127,0.004621329,0.20798078],"study_design_scores_gemma":[0.0008014404,0.00025900375,0.00020453312,0.00008532225,0.000045570698,0.0000024969106,0.00013389453,0.94499147,0.04665827,0.0025644558,0.003913598,0.00033996353],"about_ca_topic_score_codex":0.00011468078,"about_ca_topic_score_gemma":0.00028710612,"teacher_disagreement_score":0.42083406,"about_ca_system_score_codex":0.00007773756,"about_ca_system_score_gemma":0.000022211165,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W2000012073","doi":"10.1049/iet-com:20080110","title":"Performance of zero-forcing detectors over MIMO flat-correlated Ricean fading channels","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; MIMO; Channel (broadcasting); Bit error rate; Mathematics; Channel capacity; Computer science; Algorithm; Topology (electrical circuits); Telecommunications; Control theory (sociology)","score_opus":0.01454143419379784,"score_gpt":0.238419054596575,"score_spread":0.22387762040277717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000012073","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.8310345,0.0013847617,0.14860742,0.00008398967,0.00043392743,0.00050509884,0.000011573488,0.00081117253,0.017127573],"genre_scores_gemma":[0.9889466,0.00045435125,0.010399207,0.000014466372,0.000020295995,0.000014862067,0.00003248181,0.000029957779,0.000087762826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992224,0.000031958272,0.00036550616,0.00010154386,0.000085903775,0.0001926692],"domain_scores_gemma":[0.9986304,0.000083788844,0.00010076855,0.0010627457,0.00007467014,0.000047593756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011854145,0.00013674432,0.00017987746,0.00014831805,0.00015289169,0.000015500367,0.00047767046,0.00008812702,0.000010568744],"category_scores_gemma":[0.00003133709,0.0001557644,0.000049243285,0.00046397714,0.000035302757,0.00033392815,0.00005485582,0.00021696487,0.000017810424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040610003,0.000019416211,0.0013370621,0.00003829539,0.00003012876,1.9722472e-7,0.0013334927,0.96393675,0.02818232,0.0003164976,0.00014402786,0.0046577463],"study_design_scores_gemma":[0.0002522589,0.000040274695,0.002733854,0.000177152,0.000022302089,0.000004399631,0.000057128887,0.98694783,0.0089833485,0.00009042285,0.00049013185,0.00020091052],"about_ca_topic_score_codex":0.000015218576,"about_ca_topic_score_gemma":0.0000089783,"teacher_disagreement_score":0.15791214,"about_ca_system_score_codex":0.00009480609,"about_ca_system_score_gemma":0.000009850229,"threshold_uncertainty_score":0.63518876},"labels":[],"label_agreement":null},{"id":"W2000308072","doi":"10.1049/iet-com.2009.0140","title":"Cross-layer optimisation of network performance over multiple-input multiple-output wireless mobile channels","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; MIMO; Fading; Channel (broadcasting); Throughput; Computer network; Markov process; Channel capacity; Transmission (telecommunications); Physical layer; Buffer overflow; Markov chain; Quality of service; Wireless; Telecommunications; Mathematics; Statistics","score_opus":0.018500537304882193,"score_gpt":0.2697353760823955,"score_spread":0.2512348387775133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000308072","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.929508,0.00039859558,0.06642613,0.000036097823,0.00087350956,0.0006625429,0.000036811864,0.0005106075,0.0015477465],"genre_scores_gemma":[0.9512103,0.0011806209,0.046529952,0.000024372852,0.00022631779,0.00034051988,0.0002477672,0.00008823139,0.00015190021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859595,0.00005038578,0.00055757066,0.00021611537,0.00020172815,0.00037825905],"domain_scores_gemma":[0.99698085,0.00049680786,0.00017900665,0.0020140184,0.00023193016,0.00009737967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023094557,0.00025111614,0.0002815266,0.000097380434,0.00032002747,0.00005589486,0.00091387134,0.00022218442,0.000064930406],"category_scores_gemma":[0.00006263031,0.00028719316,0.000090029,0.00048470683,0.00024238389,0.0005439902,0.00023884037,0.0005994554,0.000027520973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012573727,0.00006370595,0.021186117,0.00003324096,0.000032393946,1.3432849e-7,0.00036258315,0.96031994,0.0054517672,0.00018926345,0.00024596122,0.0121023515],"study_design_scores_gemma":[0.0005839323,0.000024001793,0.014122227,0.00006122341,0.000016286753,0.0000028731486,0.00002394178,0.9748479,0.004150354,0.000034094897,0.0058484394,0.00028470534],"about_ca_topic_score_codex":0.00002051181,"about_ca_topic_score_gemma":0.00012150517,"teacher_disagreement_score":0.021702355,"about_ca_system_score_codex":0.000059385635,"about_ca_system_score_gemma":0.00002368599,"threshold_uncertainty_score":0.99995804},"labels":[],"label_agreement":null},{"id":"W2002503368","doi":"10.1049/iet-com.2013.0296","title":"Wireless local area network service providers’ price competition in presence of heterogeneous user demand","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Oligopoly; Revenue; Monopoly; Duopoly; Economic surplus; Competition (biology); Price discrimination; Service provider; Microeconomics; Revenue model; Nash equilibrium; Business; Service (business); Computer science; Industrial organization; Economics; Cournot competition; Marketing; Finance","score_opus":0.013530411104274307,"score_gpt":0.22037749995048522,"score_spread":0.20684708884621092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002503368","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.1740905,0.0017246961,0.8196669,0.0008075618,0.00012460939,0.001129457,0.0000109958255,0.00033393185,0.0021113479],"genre_scores_gemma":[0.9751389,0.0009032114,0.023493698,0.00007658464,0.000019883708,0.00023728772,0.00008310684,0.000033803415,0.00001354598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990654,0.00009631415,0.00035918388,0.00012857465,0.000113230475,0.00023727499],"domain_scores_gemma":[0.9983913,0.0002649461,0.0000857404,0.0010448733,0.00015926368,0.0000538779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087012464,0.00013449973,0.00018566524,0.000058936243,0.00008036495,0.000025566665,0.00058317144,0.00008829431,0.000038209295],"category_scores_gemma":[0.000011938743,0.00015441388,0.000027448694,0.0005764181,0.0000944888,0.00036322334,0.00016944538,0.0002112431,0.00002390932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029176308,0.00004570723,0.0012988263,0.00005000257,0.000014465836,3.0386144e-7,0.00033206595,0.99526346,0.00034629935,0.00088001066,0.00027523827,0.0014907101],"study_design_scores_gemma":[0.00020836742,0.0000110333085,0.0029204534,0.00017310707,0.0000077183795,0.0000040309324,0.00010974115,0.9948151,0.0002690609,0.00062517717,0.000702858,0.00015333721],"about_ca_topic_score_codex":0.00016829807,"about_ca_topic_score_gemma":0.0016146163,"teacher_disagreement_score":0.8010484,"about_ca_system_score_codex":0.00007734354,"about_ca_system_score_gemma":0.000017707176,"threshold_uncertainty_score":0.6296815},"labels":[],"label_agreement":null},{"id":"W2004316630","doi":"10.1049/iet-com.2008.0362","title":"Beamforming technique to solve the hidden beam problem in wireless communication systems","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Null (SQL); Beamforming; Beam (structure); Throughput; Antenna (radio); Wireless; Computer science; Planar array; Acoustics; Topology (electrical circuits); Mathematics; Telecommunications; Physics; Optics; Data mining; Combinatorics","score_opus":0.022178894716724098,"score_gpt":0.2964406925399306,"score_spread":0.27426179782320653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004316630","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.0023167876,0.0003683345,0.96076864,0.015096498,0.00005493452,0.0022569045,0.000005811705,0.00069756655,0.018434538],"genre_scores_gemma":[0.61374974,0.00012122226,0.38533604,0.00017217077,0.0000049558644,0.000570395,0.000008765121,0.000007082473,0.000029633125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985569,0.00020298107,0.0005930718,0.0001999212,0.0002472598,0.00019984275],"domain_scores_gemma":[0.9947001,0.00038290786,0.00027079252,0.0043303748,0.00025908332,0.00005675616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012094866,0.00013711044,0.00020809504,0.00029734013,0.00033332888,0.00015622184,0.005158789,0.000086102256,0.0000013193054],"category_scores_gemma":[0.00008901984,0.00012094224,0.000055769982,0.001365139,0.00010852612,0.0007610932,0.0007757732,0.00033326235,0.000012994808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034084,0.00028593215,0.00014410316,0.000016888936,0.000010940545,2.4428186e-7,0.0034540931,0.00051892636,0.008391821,0.9260941,0.0011035965,0.059975933],"study_design_scores_gemma":[0.0013052498,0.0011185823,0.018391384,0.0045580333,0.00007928006,0.00019726536,0.00234941,0.3490007,0.1501428,0.40522122,0.065094665,0.0025413837],"about_ca_topic_score_codex":0.00055575644,"about_ca_topic_score_gemma":0.000117867996,"teacher_disagreement_score":0.6114329,"about_ca_system_score_codex":0.00014531836,"about_ca_system_score_gemma":0.00009441041,"threshold_uncertainty_score":0.9586399},"labels":[],"label_agreement":null},{"id":"W2004641516","doi":"10.1049/iet-com.2013.0857","title":"Quasi‐cyclic low‐density parity‐check codes based on finite set systems","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Low-density parity-check code; Parity (physics); Computer science; Mathematics; Algorithm; Decoding methods; Physics","score_opus":0.04603468108576836,"score_gpt":0.30591305968357846,"score_spread":0.2598783785978101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004641516","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.00743202,0.00009830475,0.96794415,0.0056487746,0.00040284815,0.0004132447,0.000014560839,0.0019847008,0.016061423],"genre_scores_gemma":[0.9378332,0.000028331042,0.06087371,0.00090830936,0.000032480824,0.00010221308,0.000032067393,0.000018431014,0.00017129348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977844,0.0009057306,0.00035537194,0.0003651421,0.00030666415,0.00028269066],"domain_scores_gemma":[0.9907601,0.0021964277,0.00021388046,0.006519859,0.00019989707,0.00010984957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012268316,0.00019337996,0.00026183252,0.00017186388,0.0005353641,0.00025472444,0.0039954036,0.0001217336,0.000002810826],"category_scores_gemma":[0.00065088546,0.00020023053,0.00009683834,0.0005136268,0.00013809088,0.00022227234,0.000788983,0.0004953183,0.00015791078],"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.000051819643,0.005313624,0.039602086,0.0003797397,0.00014979033,0.000012672927,0.008381038,0.01438511,0.0035260757,0.81943315,0.07735681,0.031408075],"study_design_scores_gemma":[0.00017150868,0.00016860552,0.001974736,0.00017888252,0.000010301028,0.000005181073,0.000039554165,0.9737158,0.000901405,0.0022202434,0.02032996,0.00028383188],"about_ca_topic_score_codex":0.0005547785,"about_ca_topic_score_gemma":0.00037692956,"teacher_disagreement_score":0.9593307,"about_ca_system_score_codex":0.00009555335,"about_ca_system_score_gemma":0.000075475495,"threshold_uncertainty_score":0.81651634},"labels":[],"label_agreement":null},{"id":"W2004831858","doi":"10.1049/iet-com.2009.0537","title":"Hybrid-ARQ for layered space time MIMO systems with channel state information only at the receiver","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Selective Repeat ARQ; Hybrid automatic repeat request; Computer science; Automatic repeat request; Go-Back-N ARQ; Sliding window protocol; Algorithm; Error detection and correction; Channel state information; Channel (broadcasting); MIMO; Computer network; Wireless; Telecommunications","score_opus":0.010022341251450597,"score_gpt":0.23140161167397505,"score_spread":0.22137927042252445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004831858","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.0973924,0.0025882584,0.8187251,0.016667988,0.00066743785,0.008050431,0.0017611639,0.00644012,0.047707085],"genre_scores_gemma":[0.97429675,0.0008026315,0.02232543,0.00008637819,0.00001952354,0.00090327545,0.00047573325,0.000051891355,0.0010383612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921554,0.00006169639,0.00030012982,0.00008593405,0.00013030351,0.0002063984],"domain_scores_gemma":[0.9960025,0.00042071773,0.00014340908,0.0031306727,0.00024565074,0.000057035308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026527976,0.00016331983,0.00015748036,0.000084055355,0.00047005725,0.00008676929,0.0013365247,0.000058972797,0.000014992551],"category_scores_gemma":[0.00005521713,0.00013157938,0.000044679018,0.00017162858,0.00017476588,0.00056479336,0.00025919665,0.0004011476,0.00013188744],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032994416,0.00049565075,0.00044078525,0.0007250171,0.0009786297,0.0000013553029,0.016982114,0.4750915,0.06738292,0.09041717,0.26269573,0.084459186],"study_design_scores_gemma":[0.00050004123,0.00004973262,0.00031151762,0.00007770212,0.00002488724,0.000034294262,0.00023306721,0.32745984,0.00814895,0.0011437187,0.6616198,0.00039645255],"about_ca_topic_score_codex":0.00006846188,"about_ca_topic_score_gemma":0.00041877717,"teacher_disagreement_score":0.87690437,"about_ca_system_score_codex":0.00009552307,"about_ca_system_score_gemma":0.000037201033,"threshold_uncertainty_score":0.5365651},"labels":[],"label_agreement":null},{"id":"W2007432287","doi":"10.1049/iet-com.2013.0444","title":"Optimal power allocation and relay selection for multiple code division multiple access peer‐to‐peer communication","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Computer network; Asynchronous communication; Transmitter power output; Reciprocal; Power (physics); Transmitter; Channel (broadcasting)","score_opus":0.06531774646321586,"score_gpt":0.34811415746964885,"score_spread":0.282796411006433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007432287","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.028011322,0.0004155505,0.9199068,0.04889249,0.00012983457,0.0010934281,0.000017348937,0.00036678946,0.0011664495],"genre_scores_gemma":[0.76113117,0.00046027577,0.23647141,0.00078861904,0.000020747668,0.00045485504,0.00017900468,0.000025526764,0.0004684153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761724,0.00069001113,0.0005190455,0.00047345556,0.0003761079,0.0003241213],"domain_scores_gemma":[0.9918414,0.002187134,0.00024041506,0.0038976406,0.0016416301,0.00019179957],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0019802789,0.00024130527,0.00025446402,0.00023654242,0.0017359832,0.0006709963,0.004323117,0.00013157722,0.000010167918],"category_scores_gemma":[0.0021965744,0.00025747274,0.00008313522,0.00079952495,0.00014408474,0.0011627103,0.0028557554,0.00038852863,0.00003480611],"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.00016942574,0.0017982225,0.04412261,0.00007860086,0.0002538406,1.6395806e-7,0.023237256,0.05807285,0.022013333,0.46173638,0.07648775,0.31202957],"study_design_scores_gemma":[0.00072028284,0.000108121974,0.015567145,0.00005573172,0.000012663421,0.0000033087374,0.000070546535,0.73884153,0.00074999523,0.00040201083,0.24317774,0.00029092538],"about_ca_topic_score_codex":0.000058028836,"about_ca_topic_score_gemma":0.0012707446,"teacher_disagreement_score":0.73311985,"about_ca_system_score_codex":0.00012219344,"about_ca_system_score_gemma":0.00006535145,"threshold_uncertainty_score":0.9999877},"labels":[],"label_agreement":null},{"id":"W2007636585","doi":"10.1049/iet-com.2010.0899","title":"Mitigating the effect of jamming signals in wireless <i>ad hoc</i> and sensor networks","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Jamming; Computer science; Throughput; Node (physics); Wireless ad hoc network; Base station; Network packet; Mobile ad hoc network; Transmission (telecommunications); Wireless; Real-time computing; Telecommunications; Engineering","score_opus":0.019256343624334312,"score_gpt":0.2845734219552584,"score_spread":0.2653170783309241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007636585","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.8627873,0.015565852,0.10440534,0.006277648,0.00023180261,0.0076128803,0.000006053043,0.00017260485,0.0029405192],"genre_scores_gemma":[0.99042004,0.00030036116,0.008251613,0.00010710629,0.00003626241,0.00086359796,0.0000022670908,0.000007795849,0.000010965048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986214,0.00066144986,0.00026002037,0.000111322086,0.00009170611,0.0002540831],"domain_scores_gemma":[0.99624777,0.0021604658,0.0001444278,0.0013604867,0.000030205048,0.000056617813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013050692,0.000101515136,0.00017852352,0.000034935772,0.00024394196,0.00006824651,0.0012271372,0.000058306003,0.0000015489009],"category_scores_gemma":[0.000035369638,0.00007359914,0.000041113202,0.00038064795,0.0001486495,0.000266086,0.00068200665,0.00028878739,0.000001973975],"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.000032671174,0.00019715197,0.15522073,0.0001345359,0.0000801804,0.000001338968,0.011061431,0.008303606,0.0043501253,0.022871902,0.0009201593,0.7968262],"study_design_scores_gemma":[0.0012615828,0.0003298743,0.028556129,0.0007518494,0.000032312804,0.000029520597,0.00031237074,0.95119774,0.004673413,0.0005418685,0.011811961,0.00050140003],"about_ca_topic_score_codex":0.000031852585,"about_ca_topic_score_gemma":0.0000358155,"teacher_disagreement_score":0.9428941,"about_ca_system_score_codex":0.000012878669,"about_ca_system_score_gemma":0.000011735842,"threshold_uncertainty_score":0.3001286},"labels":[],"label_agreement":null},{"id":"W2008780774","doi":"10.1049/iet-com.2013.0627","title":"Single‐band full‐duplex MAC protocol for distributed access networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Protocol (science); Duplex (building); Telecommunications","score_opus":0.07129148757914659,"score_gpt":0.33463657468683317,"score_spread":0.26334508710768656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008780774","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.005770999,0.00025740618,0.85036147,0.005161649,0.00026141733,0.124913596,0.00042086816,0.0027859155,0.010066676],"genre_scores_gemma":[0.6436033,0.00003913014,0.0156683,0.00009137577,0.000102335165,0.33947614,0.0008563338,0.00009668371,0.00006638319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986039,0.00015873488,0.0005153427,0.00020297072,0.00011559749,0.0004034511],"domain_scores_gemma":[0.9942002,0.0009357635,0.00011896778,0.0043945014,0.00021508441,0.0001354793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028972176,0.000255624,0.0002709246,0.000098368786,0.00056728825,0.00025097333,0.003385754,0.00016248782,0.00006145449],"category_scores_gemma":[0.000189192,0.00028037096,0.00012618577,0.0004913331,0.00020168145,0.00032273858,0.0005265491,0.0004174399,0.00003105118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036440477,0.00045262527,0.00038111233,0.00016028473,0.00012833506,1.0434384e-7,0.00020129359,0.93274313,0.0051478865,0.012158175,0.03396524,0.014625395],"study_design_scores_gemma":[0.00062566134,0.00003532961,0.00056863745,0.000053831172,0.000019171433,0.0000023987532,0.000017003436,0.6596329,0.0004403065,0.00011044267,0.33826134,0.00023296941],"about_ca_topic_score_codex":0.000024722935,"about_ca_topic_score_gemma":0.00042311024,"teacher_disagreement_score":0.8346932,"about_ca_system_score_codex":0.00014059144,"about_ca_system_score_gemma":0.000027542628,"threshold_uncertainty_score":0.99996483},"labels":[],"label_agreement":null},{"id":"W2010693663","doi":"10.1049/iet-com.2012.0737","title":"Analysis and design of a new fountain codec under belief propagation","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fountain; Codec; Computer science; Telecommunications; Art","score_opus":0.05794702998626518,"score_gpt":0.3086166259596662,"score_spread":0.25066959597340105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010693663","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.0038309167,0.00018112043,0.9907062,0.0041124816,0.000013349313,0.00032730444,5.922808e-7,0.00021468772,0.0006133676],"genre_scores_gemma":[0.58898634,0.00006288417,0.41070306,0.00008979767,0.0000027439899,0.000043105298,0.000002920759,0.0000036056429,0.0001055335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991945,0.00019519804,0.00022408688,0.00015834133,0.00012477332,0.00010312012],"domain_scores_gemma":[0.9972832,0.00034695768,0.0001484219,0.0019874019,0.00018050402,0.00005347155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032363227,0.00007581389,0.0001375064,0.0002176692,0.00013321158,0.00008766805,0.0013290683,0.000043145596,0.000010155383],"category_scores_gemma":[0.00007883623,0.00007459145,0.000041588424,0.0010234715,0.00008224205,0.00037686838,0.0005156074,0.00011043358,0.000011673821],"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.0000120196455,0.0010044201,0.05236587,0.00005819894,0.0012895016,8.36667e-7,0.02318588,0.005393626,0.045963798,0.43769926,0.014913177,0.4181134],"study_design_scores_gemma":[0.00020651445,0.00013425162,0.055818144,0.000039430877,0.00016276153,0.000006571369,0.0002065621,0.85958284,0.0048410115,0.0782978,0.00042868772,0.0002754181],"about_ca_topic_score_codex":0.001773997,"about_ca_topic_score_gemma":0.00032746038,"teacher_disagreement_score":0.8541892,"about_ca_system_score_codex":0.0000331437,"about_ca_system_score_gemma":0.000080602724,"threshold_uncertainty_score":0.3041751},"labels":[],"label_agreement":null},{"id":"W2015348377","doi":"10.1049/iet-com.2014.0232","title":"Low‐complexity amplify‐and‐forward relaying protocol for non‐coherent chaos‐based communication system","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Hôpital Notre-Dame; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Computer science; Node (physics); Scheme (mathematics); Keying; Energy (signal processing); Power (physics); Telecommunications; Electronic engineering; Mathematics","score_opus":0.1186391054477795,"score_gpt":0.35949130293284765,"score_spread":0.24085219748506814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015348377","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.00016935634,0.00008469041,0.9333931,0.00874212,0.00006846541,0.046929482,0.000010605826,0.0005862706,0.01001589],"genre_scores_gemma":[0.59040445,0.000057138586,0.22773044,0.0006417087,0.00003702142,0.18094225,0.000076659904,0.00003023153,0.00008011816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975282,0.0008806716,0.0006289404,0.00039932266,0.00022174472,0.00034110658],"domain_scores_gemma":[0.9910333,0.0012367931,0.00036859224,0.0067541627,0.00044051016,0.00016662358],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015262999,0.00026015862,0.00032972926,0.0001521734,0.0018827865,0.00037915586,0.0047013494,0.00011960529,0.0000091507945],"category_scores_gemma":[0.00017295478,0.00025895637,0.00011450786,0.00047528977,0.0003098842,0.00043316177,0.0019406741,0.00044503895,0.00003593878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022273716,0.0003286842,0.00025878055,0.00024496994,0.000030278512,8.192496e-8,0.0010155836,0.00016612318,0.00056441914,0.9366358,0.0021921333,0.058540855],"study_design_scores_gemma":[0.0016476928,0.00011986188,0.0012922327,0.00048032726,0.000016052074,0.0000049049604,0.00010985497,0.84031814,0.00042963438,0.0022726804,0.15291974,0.00038885622],"about_ca_topic_score_codex":0.000025053936,"about_ca_topic_score_gemma":0.00018915435,"teacher_disagreement_score":0.9343631,"about_ca_system_score_codex":0.00015946943,"about_ca_system_score_gemma":0.00010817483,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W2016444633","doi":"10.1049/iet-com:20060224","title":"Cross-layer distributed approach for optimal rate allocation for homogeneous wireless multicast","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Distributed computing; Xcast; Pragmatic General Multicast; Wireless network; Protocol Independent Multicast; Wireless ad hoc network; Asynchronous communication; Distributed algorithm; Heterogeneous network; Wireless","score_opus":0.04813557615985369,"score_gpt":0.3299883542239474,"score_spread":0.2818527780640937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016444633","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.005367893,0.00016857541,0.9914504,0.0006148569,0.00013383135,0.0014707404,0.000119669836,0.00022478373,0.00044922333],"genre_scores_gemma":[0.5756896,0.000019942838,0.4226955,0.0001107862,0.000056679182,0.0007073065,0.00055095076,0.000017478862,0.00015175118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984698,0.00008458354,0.00044829072,0.00039622563,0.00013357894,0.00046747155],"domain_scores_gemma":[0.99494827,0.0011515018,0.00018540162,0.0030556738,0.00052820396,0.00013097517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012074859,0.00017588506,0.00019235241,0.00006497315,0.0007061006,0.0002711894,0.0030585858,0.00013500347,0.0000022771928],"category_scores_gemma":[0.00012096632,0.000187088,0.00013247452,0.00041512516,0.00018480631,0.0003313347,0.00057760027,0.00017997081,0.0000081524895],"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.00023189055,0.0024698474,0.0011582667,0.00013842701,0.000284238,0.0000025026955,0.0022764378,0.13268739,0.009241479,0.6161347,0.004640361,0.23073445],"study_design_scores_gemma":[0.00073888403,0.000080364516,0.001437886,0.000008910276,0.000019624935,0.0000095646865,0.00004329892,0.98088574,0.0017875627,0.0004856114,0.014265989,0.0002365331],"about_ca_topic_score_codex":0.000018771265,"about_ca_topic_score_gemma":0.000049126716,"teacher_disagreement_score":0.84819835,"about_ca_system_score_codex":0.00009517336,"about_ca_system_score_gemma":0.00008029058,"threshold_uncertainty_score":0.7629227},"labels":[],"label_agreement":null},{"id":"W2017457369","doi":"10.1049/iet-com.2014.0295","title":"Queueing model for heterogeneous opportunistic spectrum access","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queueing theory; Computer network; Spectrum (functional analysis)","score_opus":0.19410379709728662,"score_gpt":0.35726396369244456,"score_spread":0.16316016659515795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017457369","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.00067905546,0.0003637375,0.984062,0.0082806805,0.00013831937,0.00025782292,0.000011622249,0.00019781942,0.0060089105],"genre_scores_gemma":[0.9241009,0.000114983886,0.07481965,0.0006044382,0.000060599676,0.00003778894,0.000025123305,0.000015513791,0.0002210211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904025,0.000073270756,0.00022444683,0.00024324167,0.00013779843,0.00028097915],"domain_scores_gemma":[0.9974346,0.00023935357,0.000096069525,0.0018953253,0.00015179158,0.00018283077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003004278,0.00012019807,0.00015205129,0.00007979232,0.00034479596,0.00036153977,0.002348401,0.000043305765,0.0000015473222],"category_scores_gemma":[0.00007735513,0.00012721853,0.000078947196,0.00024503795,0.000076130535,0.0004016217,0.0008977791,0.00013683326,0.000009692785],"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.000025195342,0.00037989585,0.00024582207,0.00001987037,0.00011810986,0.000018465349,0.0035264534,0.0944449,0.00014261094,0.8200989,0.00868053,0.07229924],"study_design_scores_gemma":[0.00020758272,0.00002854308,0.000023501798,0.000015645519,0.000011098625,0.00002932315,0.000014647383,0.9301191,0.00004961295,0.06475629,0.004594078,0.00015055416],"about_ca_topic_score_codex":0.000050337836,"about_ca_topic_score_gemma":0.00038711593,"teacher_disagreement_score":0.92342186,"about_ca_system_score_codex":0.00008880224,"about_ca_system_score_gemma":0.00021151887,"threshold_uncertainty_score":0.51878214},"labels":[],"label_agreement":null},{"id":"W2019869643","doi":"10.1049/iet-com.2012.0079","title":"Secure joint source–channel coding with interference known at the transmitter","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transmitter; Computer science; Coding (social sciences); Gaussian; Channel (broadcasting); Decoding methods; Algorithm; Topology (electrical circuits); Mathematics; Telecommunications; Statistics; Physics","score_opus":0.03877616781752802,"score_gpt":0.2510152643250929,"score_spread":0.2122390965075649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019869643","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.26783904,0.027620826,0.526403,0.036215708,0.000444353,0.0024463164,0.0001440098,0.006599991,0.13228676],"genre_scores_gemma":[0.9933985,0.0013620447,0.004357047,0.0002555415,0.000035451376,0.00026443583,0.00004616674,0.00005152469,0.00022931358],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906313,0.00015702248,0.00026030265,0.00009415012,0.00013313472,0.00029224245],"domain_scores_gemma":[0.99653244,0.0002351643,0.000056177814,0.00301862,0.00007260766,0.00008497818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030907642,0.00017691188,0.00016018038,0.0000694882,0.0004208357,0.00005334026,0.0014786455,0.000083998326,0.00010472707],"category_scores_gemma":[0.000013882067,0.00013311316,0.00006445489,0.00023754194,0.00026384063,0.0002534409,0.00047285602,0.0005708554,0.00011043689],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012868864,0.0022071057,0.013583842,0.00079269474,0.0018583937,0.0000027492317,0.42632514,0.008984586,0.07417793,0.1383214,0.23604287,0.0975746],"study_design_scores_gemma":[0.0007491411,0.00009176172,0.0064693466,0.00062955316,0.00016515158,0.0001317984,0.0039347694,0.0610465,0.03885987,0.0010418101,0.88554054,0.00133975],"about_ca_topic_score_codex":0.000035446377,"about_ca_topic_score_gemma":0.00032129674,"teacher_disagreement_score":0.7255594,"about_ca_system_score_codex":0.00011617279,"about_ca_system_score_gemma":0.000011057651,"threshold_uncertainty_score":0.54281974},"labels":[],"label_agreement":null},{"id":"W2020175615","doi":"10.1049/iet-com.2014.0534","title":"Physical layer security of multiple‐input–multiple‐output systems with transmit beamforming in Rayleigh fading","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Rayleigh fading; Fading; Physical layer; Beamforming; Computer science; Telecommunications; Wireless; Channel (broadcasting)","score_opus":0.047980743773450754,"score_gpt":0.274168628319796,"score_spread":0.22618788454634525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020175615","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.95623624,0.0027349726,0.025444197,0.000686301,0.0000940693,0.0012648834,0.00012791097,0.0013566249,0.012054798],"genre_scores_gemma":[0.9867482,0.0003275189,0.012450968,0.000012767686,0.00003072939,0.000281607,0.00007458679,0.00006296671,0.000010658186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848175,0.00021669094,0.00054072216,0.00017482546,0.00029661105,0.00028940922],"domain_scores_gemma":[0.996253,0.00066490285,0.00011606183,0.0026181834,0.00021843823,0.00012940861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004469169,0.00024047252,0.00044542868,0.00024322301,0.000097805896,0.00004497294,0.0015864732,0.00013125564,0.000001358152],"category_scores_gemma":[0.00009723458,0.00024419194,0.000080039616,0.00059192115,0.00021127523,0.00039654877,0.00024156157,0.00063969294,0.0000091803395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032161805,0.004119823,0.16023704,0.0020151206,0.0010121294,0.00001797907,0.27314994,0.41966558,0.049083203,0.06752311,0.0034796533,0.019374799],"study_design_scores_gemma":[0.0017353643,0.00008958144,0.0016381367,0.0005971096,0.000045398385,0.000017033239,0.0030870643,0.9636459,0.0116431555,0.0008321575,0.01605932,0.0006097991],"about_ca_topic_score_codex":0.0007238991,"about_ca_topic_score_gemma":0.0012304119,"teacher_disagreement_score":0.5439803,"about_ca_system_score_codex":0.00019196262,"about_ca_system_score_gemma":0.000056874804,"threshold_uncertainty_score":0.9957858},"labels":[],"label_agreement":null},{"id":"W2021924106","doi":"10.1049/iet-com.2012.0596","title":"Performance analysis of adaptive <i>M</i> ‐ary quadrature amplitude modulation for amplify‐and‐forward opportunistic relaying under outdated channel state information","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Channel state information; Quadrature (astronomy); Adaptive quadrature; Channel (broadcasting); Computer science; Amplitude; Amplitude modulation; Quadrature amplitude modulation; Modulation (music); Telecommunications; Electronic engineering; Control theory (sociology); Physics; Wireless; Frequency modulation; Bandwidth (computing); Acoustics; Engineering; Bit error rate; Artificial intelligence; Optics","score_opus":0.06497505384593932,"score_gpt":0.2883537230713588,"score_spread":0.2233786692254195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021924106","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.018538088,0.0002858958,0.9761124,0.0029167132,0.00006124839,0.0007644093,0.00006968001,0.00013632506,0.0011152067],"genre_scores_gemma":[0.96356785,0.0018422018,0.033046704,0.0005689601,0.000005980503,0.0002503455,0.0006470022,0.000008258118,0.00006269589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986925,0.0001774895,0.0005681366,0.00018477767,0.00017346539,0.00020363413],"domain_scores_gemma":[0.99631655,0.00046763773,0.00039313626,0.001965589,0.0007432449,0.00011384598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045027546,0.00015976839,0.00028161437,0.00038383238,0.00055717333,0.0001906403,0.0013388781,0.00007947602,0.000011368756],"category_scores_gemma":[0.000089788,0.00015834824,0.00008896123,0.0012579174,0.00012610557,0.0018376299,0.00068506907,0.0002357201,0.00001072219],"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.000073822004,0.00048251648,0.003457489,0.0001423749,0.0024029699,1.3835937e-7,0.024552468,0.12230392,0.0035812291,0.54952353,0.0032514436,0.2902281],"study_design_scores_gemma":[0.00023706065,0.00005090628,0.02889332,0.000032971042,0.00009739118,7.9114204e-7,0.00023403061,0.9671997,0.000026906204,0.0016873481,0.0013635508,0.00017601476],"about_ca_topic_score_codex":0.000054246004,"about_ca_topic_score_gemma":0.00007510823,"teacher_disagreement_score":0.94502974,"about_ca_system_score_codex":0.00006172165,"about_ca_system_score_gemma":0.000086647786,"threshold_uncertainty_score":0.64572537},"labels":[],"label_agreement":null},{"id":"W2022179802","doi":"10.1049/iet-com.2012.0257","title":"Pulse waveforms for 60 GHz <i>M</i> ‐ary pulse position modulation communication systems","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Pulse-position modulation; Pulse (music); Waveform; Modulation (music); Telecommunications; Computer science; Position (finance); Communications system; Pulse-width modulation; Physics; Pulse-amplitude modulation; Optics; Acoustics; Power (physics); Business","score_opus":0.015244038207896795,"score_gpt":0.2330674060548241,"score_spread":0.2178233678469273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022179802","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.47577173,0.0412945,0.25064486,0.05142325,0.0017398612,0.019462828,0.0008699059,0.014557035,0.14423604],"genre_scores_gemma":[0.9632884,0.002379201,0.02787424,0.00020257954,0.000033732365,0.004062985,0.0018324697,0.0000892718,0.00023708798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983248,0.00016669794,0.0007270989,0.00021982963,0.00016917719,0.0003923651],"domain_scores_gemma":[0.992807,0.0004934349,0.00016261332,0.006005023,0.00040480684,0.00012714988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003349178,0.0002814755,0.00030348919,0.00029505332,0.00071755087,0.00019507574,0.0024857244,0.00031023132,0.00007506841],"category_scores_gemma":[0.0001160101,0.00030008095,0.00013078468,0.00055952044,0.00022712916,0.0009038261,0.00033954254,0.00051513035,0.00029405064],"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.000062083505,0.0021410536,0.0020245546,0.0006739298,0.0012218457,0.0000012498035,0.0053282883,0.19500917,0.1486442,0.24613494,0.11466515,0.28409356],"study_design_scores_gemma":[0.0007877174,0.00007344007,0.004696624,0.00013388644,0.000084985215,0.00003797686,0.00075486646,0.9302437,0.0012579015,0.015351834,0.045947973,0.0006291432],"about_ca_topic_score_codex":0.00048397353,"about_ca_topic_score_gemma":0.00018096752,"teacher_disagreement_score":0.7352345,"about_ca_system_score_codex":0.0002844548,"about_ca_system_score_gemma":0.00003869368,"threshold_uncertainty_score":0.9999451},"labels":[],"label_agreement":null},{"id":"W2023146896","doi":"10.1049/iet-com.2008.0559","title":"BER analysis of space–time diversity in CDMA systems over frequency-selective fading channels","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Fading; Fading distribution; Rayleigh fading; Diversity scheme; Computer science; Channel state information; Antenna diversity; Transmit diversity; Code division multiple access; Channel (broadcasting); Electronic engineering; Telecommunications; Algorithm; Antenna (radio); Wireless; Engineering","score_opus":0.051920136720817134,"score_gpt":0.3192665776324188,"score_spread":0.26734644091160165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023146896","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.58942074,0.009806492,0.28419784,0.027917115,0.00038423363,0.0029859026,0.000111804686,0.00090899883,0.08426689],"genre_scores_gemma":[0.9910227,0.00040887954,0.008285788,0.00006386766,0.000010295908,0.000027319098,0.00003182863,0.0000060024613,0.0001433068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977578,0.00078988605,0.0004181459,0.00029079942,0.00042066077,0.0003227132],"domain_scores_gemma":[0.99396145,0.00077311444,0.00023130335,0.004601579,0.00033783214,0.000094708],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00090498157,0.0001401567,0.00039921535,0.0009453275,0.00045658892,0.000114589595,0.0058894823,0.00010454347,0.000017844472],"category_scores_gemma":[0.00010423626,0.0001539363,0.00014910089,0.005500098,0.00015053402,0.00059320504,0.00258144,0.00044519457,0.000024369876],"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.000027062031,0.002089427,0.13402013,0.000028442217,0.0018792503,0.000009174598,0.027691728,0.25710428,0.0053038956,0.55882823,0.0034936983,0.009524688],"study_design_scores_gemma":[0.00024334782,0.0000437481,0.14174645,0.000051545554,0.00006514187,0.0000011756078,0.00007024322,0.8548857,0.00007739266,0.0023774258,0.00024497983,0.00019285677],"about_ca_topic_score_codex":0.0017204477,"about_ca_topic_score_gemma":0.0004983865,"teacher_disagreement_score":0.5977814,"about_ca_system_score_codex":0.00025137828,"about_ca_system_score_gemma":0.000087549175,"threshold_uncertainty_score":0.9994891},"labels":[],"label_agreement":null},{"id":"W2023890870","doi":"10.1049/iet-com:20070096","title":"Multilayer flavoured dynamic source routing in mobile <i>ad-hoc</i> networks","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dynamic Source Routing; Computer network; DSRFLOW; Routing protocol; Zone Routing Protocol; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Enhanced Interior Gateway Routing Protocol; Routing (electronic design automation); Wireless Routing Protocol; Distributed computing","score_opus":0.019528976417498307,"score_gpt":0.2655844483768559,"score_spread":0.2460554719593576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023890870","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.057806194,0.021091316,0.9122736,0.002192008,0.00043915823,0.0012277134,0.0000047557637,0.000974963,0.003990316],"genre_scores_gemma":[0.9358599,0.0060975556,0.056635145,0.00043692152,0.000032003874,0.00035445992,0.00002483134,0.000033511646,0.0005256636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791557,0.00036183232,0.0005357834,0.00043824673,0.00020369716,0.0005448757],"domain_scores_gemma":[0.99428874,0.0005930524,0.00019398385,0.0046923263,0.000100919264,0.00013095172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047029497,0.00022386952,0.0002758079,0.00012165395,0.00062034524,0.00009939835,0.0043796496,0.00016149576,0.00001298458],"category_scores_gemma":[0.000044012584,0.00024855457,0.000112469155,0.0010408562,0.00020761583,0.00045440914,0.0018384422,0.0007989179,0.00009301684],"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.000023815668,0.0014103885,0.0080247605,0.000015687274,0.00009018396,0.00004262475,0.017080361,0.38552317,0.0008517178,0.007080255,0.0081023285,0.5717547],"study_design_scores_gemma":[0.00043136725,0.000032622356,0.003145653,0.00004349525,0.000004577256,0.00004068319,0.00009019478,0.9347789,0.000016898039,0.00014195246,0.061008517,0.00026513854],"about_ca_topic_score_codex":0.00003927026,"about_ca_topic_score_gemma":0.0007590416,"teacher_disagreement_score":0.8780537,"about_ca_system_score_codex":0.0001562479,"about_ca_system_score_gemma":0.000090993955,"threshold_uncertainty_score":0.99999666},"labels":[],"label_agreement":null},{"id":"W2024334300","doi":"10.1049/iet-com:20045143","title":"Concatenated fibre-wireless channel identification in a multiuser CDMA environment","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Multipath propagation; Multiuser detection; Code division multiple access; Telecommunications link; Wireless; Wireless broadband; Channel (broadcasting); Wireless network; Electronic engineering; Computer network; Telecommunications; Engineering","score_opus":0.04660455161274572,"score_gpt":0.31282226722687173,"score_spread":0.266217715614126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024334300","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.0838382,0.0023418958,0.8793616,0.024190888,0.00026381452,0.0017195613,0.000016301325,0.0006778824,0.0075898166],"genre_scores_gemma":[0.98107725,0.00143706,0.016595127,0.00019302392,0.000020923837,0.00020452599,0.000084010055,0.000024560486,0.00036352538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973133,0.00049178215,0.0007678847,0.0004269951,0.00045836275,0.00054163695],"domain_scores_gemma":[0.9920501,0.0008796871,0.00023641535,0.0065183993,0.00014752011,0.00016788069],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002179552,0.00019110313,0.00021624647,0.0004151594,0.00040730342,0.00019570456,0.0067462707,0.00015178385,0.000021098218],"category_scores_gemma":[0.00008334428,0.00021027171,0.00007372397,0.0012145585,0.00029386557,0.0006595412,0.0024363291,0.00064000476,0.0003770173],"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.00011378541,0.0059283017,0.016991317,0.00010087479,0.00024846912,0.00005083176,0.025947154,0.012029966,0.07192871,0.40483338,0.0059097423,0.45591748],"study_design_scores_gemma":[0.0012947738,0.000048711514,0.15452598,0.000091965645,0.000007911948,0.000016101425,0.0005094811,0.8101955,0.0053820903,0.0032014258,0.024122775,0.000603261],"about_ca_topic_score_codex":0.00021777108,"about_ca_topic_score_gemma":0.00051146175,"teacher_disagreement_score":0.897239,"about_ca_system_score_codex":0.00031217415,"about_ca_system_score_gemma":0.000073825475,"threshold_uncertainty_score":0.9986277},"labels":[],"label_agreement":null},{"id":"W2024558741","doi":"10.1049/iet-com.2008.0428","title":"Ultra wideband technologies coexistence in Nakagami-<i>m</i>fading channels","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Ultra-Wideband Communications Technology","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Computer science; Phase-shift keying; Ultra-wideband; Orthogonal frequency-division multiplexing; Electronic engineering; Bit error rate; Narrowband; Wireless; Interference (communication); Telecommunications; Computer network; Channel (broadcasting); Engineering","score_opus":0.023217234783530664,"score_gpt":0.25890833496543436,"score_spread":0.2356911001819037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024558741","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.39484963,0.06855344,0.02867859,0.10841815,0.00081578444,0.0033414222,0.00010552612,0.033097133,0.36214033],"genre_scores_gemma":[0.98550904,0.00621338,0.007850339,0.00015147362,0.000006501731,0.00015331582,0.000030649502,0.000024536479,0.000060791772],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887383,0.000058271005,0.00041751703,0.00018473959,0.00010350495,0.00036214312],"domain_scores_gemma":[0.9958436,0.00029280747,0.000054928718,0.0037171042,0.000056835197,0.000034735218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018944463,0.0002010445,0.00025063148,0.00039996408,0.00021334767,0.00005252927,0.002860793,0.00018518153,0.000008114081],"category_scores_gemma":[0.00017525042,0.00022633377,0.000058138045,0.0010764628,0.00027987422,0.00024760584,0.00014920517,0.00073125324,0.00006133325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030895615,0.0016117037,0.0077555906,0.00012540766,0.0002410555,0.00003173137,0.010086726,0.042800706,0.29435024,0.27712202,0.015453119,0.35039082],"study_design_scores_gemma":[0.004083529,0.00059416686,0.013724938,0.0014690968,0.00016010208,0.0005093674,0.011856675,0.08454432,0.17031413,0.24860778,0.45947903,0.004656851],"about_ca_topic_score_codex":0.000027064427,"about_ca_topic_score_gemma":0.00016625169,"teacher_disagreement_score":0.5906594,"about_ca_system_score_codex":0.00013313424,"about_ca_system_score_gemma":0.000019519035,"threshold_uncertainty_score":0.9229623},"labels":[],"label_agreement":null},{"id":"W2027609975","doi":"10.1049/iet-com.2012.0407","title":"Optimisation of power allocation for asymmetric relay placement in multi‐hop relay systems","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Hop (telecommunications); Computer science; Computer network; Relay channel; Power (physics)","score_opus":0.08193746046152525,"score_gpt":0.32313633456929924,"score_spread":0.241198874107774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027609975","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.0100267,0.0046032537,0.96758485,0.008688312,0.0003002956,0.0025863382,0.000007740458,0.00015991963,0.0060425927],"genre_scores_gemma":[0.8485949,0.0013659471,0.14861816,0.00011225376,0.0000059719755,0.0008115342,0.0000443618,0.000010814608,0.0004360466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984054,0.00038711153,0.00061697955,0.00022521167,0.00017264193,0.00019268673],"domain_scores_gemma":[0.99550897,0.00078713015,0.00028626027,0.002762047,0.000595731,0.000059848277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008141979,0.00012810757,0.00019689235,0.00034943986,0.00023592782,0.00012038171,0.0021965269,0.000080611026,0.000014823423],"category_scores_gemma":[0.00029890673,0.000131733,0.00006196049,0.0011190586,0.00007102202,0.0005653801,0.00059355766,0.00019617833,0.000041629908],"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.000024091094,0.0024492515,0.0040655937,0.00011299005,0.0001610923,2.7839252e-7,0.015716197,0.08955373,0.013599832,0.7783992,0.016748218,0.079169504],"study_design_scores_gemma":[0.00095166266,0.00009217413,0.007752453,0.000117078765,0.000008232976,0.0000018691675,0.0004922356,0.9741909,0.0004198681,0.00014439366,0.015604903,0.00022426293],"about_ca_topic_score_codex":0.000100632606,"about_ca_topic_score_gemma":0.00009956183,"teacher_disagreement_score":0.8846371,"about_ca_system_score_codex":0.00016033617,"about_ca_system_score_gemma":0.000083966384,"threshold_uncertainty_score":0.53719157},"labels":[],"label_agreement":null},{"id":"W2030373593","doi":"10.1049/iet-com:20080021","title":"Cramer–Rao lower bound for data-aided and non-data-aided synchronisation of ultra-wideband signals with clock offset","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cramér–Rao bound; Multipath propagation; Frequency offset; Transmitter; Computer science; Upper and lower bounds; Wideband; Offset (computer science); Channel (broadcasting); Ultra-wideband; Electronic engineering; Algorithm; Estimation theory; Telecommunications; Orthogonal frequency-division multiplexing; Mathematics; Engineering","score_opus":0.044303887222712904,"score_gpt":0.29309032581090194,"score_spread":0.24878643858818905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030373593","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.39946875,0.024316417,0.50879616,0.0321116,0.00034402777,0.007104978,0.00556651,0.0027262948,0.019565247],"genre_scores_gemma":[0.9531515,0.002132315,0.04151132,0.00016396922,0.00001944928,0.00011962994,0.0028094756,0.000044536122,0.000047803784],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984236,0.00008911811,0.00064363534,0.00036257197,0.00017443403,0.00030664506],"domain_scores_gemma":[0.98859924,0.00090445095,0.00020002882,0.010008475,0.00020706175,0.00008072878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047169632,0.0002642218,0.00043292905,0.00019893808,0.00034721714,0.000087973785,0.0038250138,0.00019084994,0.000019217545],"category_scores_gemma":[0.00022867085,0.00026012593,0.000045875233,0.00043841018,0.0004280912,0.0006308852,0.00034957373,0.0003784343,0.00000975229],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006512095,0.004673543,0.0069428943,0.0009946221,0.0038979352,0.000006533356,0.006733872,0.014770518,0.47057036,0.047655135,0.17796627,0.26513714],"study_design_scores_gemma":[0.0091608465,0.002083137,0.010684079,0.0009641686,0.0021148587,0.00018204957,0.0020091187,0.500702,0.047356214,0.03273045,0.38870177,0.0033112685],"about_ca_topic_score_codex":0.000115359,"about_ca_topic_score_gemma":0.0005956771,"teacher_disagreement_score":0.55368274,"about_ca_system_score_codex":0.000062157975,"about_ca_system_score_gemma":0.00008651032,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W2033819375","doi":"10.1049/iet-com.2013.0027","title":"Robust joint signal and interference alignment in cognitive radio networks with ellipsoidal channel state information uncertainties","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cognitive radio; Ellipsoid; Joint (building); Computer science; Interference (communication); Channel (broadcasting); Interference alignment; Channel state information; Co-channel interference; SIGNAL (programming language); Telecommunications; Wireless; MIMO; Physics; Engineering","score_opus":0.03297967221086243,"score_gpt":0.2273643527684693,"score_spread":0.19438468055760688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033819375","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.041603632,0.00048385886,0.95243454,0.0024521458,0.000048169946,0.0005258813,0.0000039696315,0.000080671845,0.0023671242],"genre_scores_gemma":[0.9901455,0.0007262292,0.0086517185,0.00031684572,0.000015912083,0.00007698211,0.000025365796,0.0000063729717,0.000035071236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894774,0.00014711969,0.00030674468,0.00018139894,0.00013632992,0.00028068863],"domain_scores_gemma":[0.998784,0.00025487793,0.00013758568,0.00053673214,0.00020029339,0.00008650368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022401304,0.00015555964,0.00018089604,0.00014681228,0.00023253975,0.00039966695,0.00048529005,0.00004048817,0.0000135958235],"category_scores_gemma":[0.000015131194,0.00013719182,0.000024485762,0.00035766562,0.00021059775,0.0012558866,0.00042989914,0.00030070092,0.00001324144],"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.00011168574,0.0005431335,0.005843255,0.000054437987,0.00032015253,0.0000150275755,0.049751766,0.3395422,0.00010952051,0.0237318,0.0027819548,0.57719505],"study_design_scores_gemma":[0.00046387975,0.00012971832,0.013923173,0.00022161176,0.000007476326,0.000021504246,0.0010759629,0.9821233,0.000041252075,0.001681682,0.000099867626,0.00021055821],"about_ca_topic_score_codex":0.0007759831,"about_ca_topic_score_gemma":0.000896259,"teacher_disagreement_score":0.9485419,"about_ca_system_score_codex":0.00007622814,"about_ca_system_score_gemma":0.000050649844,"threshold_uncertainty_score":0.559452},"labels":[],"label_agreement":null},{"id":"W2034644636","doi":"10.1049/iet-com:20070445","title":"Error performance of general order selection in correlated Nakagami fading channels","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Nakagami distribution; Fading; Bit error rate; Diversity combining; Statistics; Computer science; Selection (genetic algorithm); Throughput; Statistic; Fading distribution; Algorithm; Mathematics; Telecommunications; Wireless; Artificial intelligence; Decoding methods","score_opus":0.032797106785932076,"score_gpt":0.27568351311660383,"score_spread":0.24288640633067177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034644636","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.9781967,0.0008429828,0.013800127,0.00012789632,0.000066627086,0.00028198972,0.0000065695167,0.0006987791,0.0059783217],"genre_scores_gemma":[0.9557949,0.004970832,0.038855284,0.000017021111,0.000008771517,0.00011981451,0.00004603198,0.000032108663,0.00015526263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992258,0.00007001811,0.00036416165,0.00008820023,0.00008970225,0.00016210428],"domain_scores_gemma":[0.99875134,0.00009069216,0.00007443243,0.00093627354,0.000117488366,0.000029800261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011136051,0.00011580041,0.00017087955,0.0002162784,0.00015703277,0.0000049275386,0.0007180227,0.00010111471,0.000018121744],"category_scores_gemma":[0.00003059309,0.00013938997,0.000027370905,0.00082129764,0.00012461132,0.00025366596,0.00013731426,0.0004162686,0.0000129635755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018549135,0.00027830718,0.019119889,0.000079973935,0.00006131193,8.397968e-7,0.0047836667,0.90188694,0.061054572,0.003127437,0.001138957,0.008449553],"study_design_scores_gemma":[0.00025772565,0.00003295124,0.010221959,0.00007852879,0.000005459525,0.00001939966,0.00005695663,0.9656516,0.01979869,0.00010566462,0.0035626509,0.0002084188],"about_ca_topic_score_codex":0.000067960005,"about_ca_topic_score_gemma":0.00006499006,"teacher_disagreement_score":0.063764654,"about_ca_system_score_codex":0.000110603236,"about_ca_system_score_gemma":0.000026012962,"threshold_uncertainty_score":0.5684158},"labels":[],"label_agreement":null},{"id":"W2034776565","doi":"10.1049/iet-com.2013.0421","title":"Lower bound on the bit error rate of a decode‐and‐forward relay network under chaos shift keying communication system","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Relay; Bit error rate; Computer science; CHAOS (operating system); Keying; Bit (key); Telecommunications; Computer network; Decoding methods; Physics; Computer security","score_opus":0.05583631251590348,"score_gpt":0.29127147032641026,"score_spread":0.23543515781050678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034776565","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.07912028,0.0105446065,0.6899907,0.15791541,0.00074170233,0.0022022119,0.000014665867,0.0010067859,0.058463614],"genre_scores_gemma":[0.9821371,0.0019855227,0.013766926,0.0017582964,0.000036008412,0.00014918724,0.000015753312,0.000022633003,0.00012860853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964017,0.002224306,0.00058593566,0.0002914232,0.00019785481,0.00029873638],"domain_scores_gemma":[0.988537,0.0032329168,0.00040077584,0.0074872426,0.00024454683,0.00009751567],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027304008,0.00022017662,0.00030208105,0.00010293582,0.0017257072,0.00025888774,0.004917081,0.00009789553,0.000013978936],"category_scores_gemma":[0.00019684173,0.00017577985,0.00010786138,0.00077778194,0.00041112426,0.00031086756,0.0023536594,0.0005717598,0.00005828134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007975548,0.00007813203,0.00017455603,0.00001164418,0.00004573582,8.491581e-8,0.0016095483,0.0020647394,0.000078043035,0.99052185,0.0013438107,0.0040638777],"study_design_scores_gemma":[0.00088205916,0.00021561838,0.014121281,0.0010834379,0.00007012429,0.000012889926,0.00064143393,0.8784637,0.0001756615,0.018927513,0.08474367,0.0006626327],"about_ca_topic_score_codex":0.00004541545,"about_ca_topic_score_gemma":0.00043007842,"teacher_disagreement_score":0.97159433,"about_ca_system_score_codex":0.000091541726,"about_ca_system_score_gemma":0.00007155907,"threshold_uncertainty_score":0.9995739},"labels":[],"label_agreement":null},{"id":"W2035235992","doi":"10.1049/iet-com.2011.0590","title":"DC‐free codes with complex‐valued signalling constellations","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Baseband; Keying; Quadrature amplitude modulation; Spectral efficiency; Computer science; Phase-shift keying; Mathematics; Signalling; Modulation (music); Electronic engineering; Algorithm; Theoretical computer science; Telecommunications; Bandwidth (computing); Decoding methods; Physics; Bit error rate; Engineering","score_opus":0.04148779780773912,"score_gpt":0.2708556652036167,"score_spread":0.22936786739587758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035235992","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.016680604,0.0018067933,0.7942133,0.004117482,0.000051380688,0.0016770265,0.00010237002,0.005446426,0.17590463],"genre_scores_gemma":[0.69236505,0.00059069385,0.3064087,0.00009268101,0.000009901439,0.00030736695,0.00011321572,0.000045134337,0.00006726559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990025,0.000104247374,0.0003618335,0.00013665218,0.00015659192,0.00023818805],"domain_scores_gemma":[0.99532676,0.00044754497,0.00008207188,0.0038028096,0.00024521185,0.000095575706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010722262,0.00019528755,0.00021785947,0.00009973896,0.00040283529,0.00009389988,0.0020054136,0.000076461154,0.0002640267],"category_scores_gemma":[0.000039725976,0.00019658954,0.000048742175,0.0003908456,0.00038110706,0.00037788393,0.00036252875,0.0003718595,0.00015729913],"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.000021307558,0.00080099684,0.0058303666,0.00023507308,0.00088545214,0.0000024729484,0.0047322027,0.1720088,0.20632455,0.4556734,0.07782443,0.075660944],"study_design_scores_gemma":[0.0012374683,0.00010812416,0.0064184284,0.0003132307,0.00010103055,0.000040164607,0.0015841075,0.8557727,0.017693954,0.028809179,0.086430535,0.0014910959],"about_ca_topic_score_codex":0.000078490244,"about_ca_topic_score_gemma":0.00016780883,"teacher_disagreement_score":0.68376386,"about_ca_system_score_codex":0.00008325202,"about_ca_system_score_gemma":0.000026828691,"threshold_uncertainty_score":0.8016688},"labels":[],"label_agreement":null},{"id":"W2036087139","doi":"10.1049/iet-com.2012.0604","title":"Optimal power allocation for green cognitive radio: fractional programming approach","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Fractional programming; Mathematical optimization; Power (physics); Telecommunications; Mathematics; Wireless; Nonlinear programming","score_opus":0.031007302686916902,"score_gpt":0.2804552340733856,"score_spread":0.24944793138646867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036087139","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.0032207868,0.00033960756,0.98371446,0.0053595565,0.000084427375,0.0009676758,0.000007530706,0.00017905695,0.00612687],"genre_scores_gemma":[0.6814498,0.0000266053,0.3176394,0.00019555731,0.000057089506,0.00035907584,0.000099947734,0.000011609336,0.00016091962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989095,0.00011183436,0.00023457919,0.00029541072,0.00016780634,0.00028091698],"domain_scores_gemma":[0.9978277,0.0005861641,0.00012297879,0.0008963895,0.00047548118,0.000091294154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002411218,0.00013569026,0.000140121,0.000091901355,0.00058674725,0.00027083416,0.0009148347,0.0000676174,0.000016150265],"category_scores_gemma":[0.00007323983,0.00014019228,0.00009909611,0.00035517273,0.00013266929,0.00073371176,0.00027611715,0.00022217719,0.0000452273],"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.00002695572,0.001379161,0.0007187741,0.00003058684,0.00038808433,0.0000011953418,0.0058690994,0.0008819997,0.00072511006,0.24690649,0.005617604,0.73745495],"study_design_scores_gemma":[0.0007130939,0.00013205354,0.0074166977,0.000048675673,0.000036920126,0.00005482762,0.0007286196,0.96223104,0.00009919579,0.0035705308,0.024568876,0.00039943887],"about_ca_topic_score_codex":0.00015389548,"about_ca_topic_score_gemma":0.000024312803,"teacher_disagreement_score":0.96134907,"about_ca_system_score_codex":0.000060224906,"about_ca_system_score_gemma":0.00007235138,"threshold_uncertainty_score":0.5716875},"labels":[],"label_agreement":null},{"id":"W2037978136","doi":"10.1049/iet-com.2014.0211","title":"Performance of the generalised quantise‐and‐forward scheme over the multiple‐access relay channel","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Relay channel; Channel state information; Computer science; Channel (broadcasting); Gaussian; Additive white Gaussian noise; Scheme (mathematics); Computer network; Topology (electrical circuits); Algorithm; Telecommunications; Wireless; Mathematics","score_opus":0.06539029703534567,"score_gpt":0.3046555757762541,"score_spread":0.23926527874090842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037978136","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.8940843,0.003011719,0.04593717,0.047369167,0.0004348596,0.00081317365,0.0000078355415,0.0001952328,0.0081465775],"genre_scores_gemma":[0.98883325,0.0037083556,0.0061890967,0.0010242735,0.000023624456,0.00006262465,0.000003762071,0.000008283372,0.00014674845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987236,0.00050433347,0.0002814264,0.00016074211,0.00017465,0.00015523456],"domain_scores_gemma":[0.99441487,0.00059813453,0.0001919499,0.0045832517,0.0001695228,0.000042265645],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00063839724,0.000112159054,0.00013400138,0.00004354144,0.0010036608,0.00013459321,0.0063557145,0.000041699193,0.0000065483723],"category_scores_gemma":[0.00017031188,0.0000699754,0.00006926092,0.0005542524,0.0003299696,0.00037481086,0.0036738976,0.00029744976,0.000007093892],"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.000020965303,0.00042623753,0.12764367,0.00006305764,0.00016526916,1.0408005e-7,0.01020198,0.0043901294,0.008198429,0.7660836,0.010134718,0.07267187],"study_design_scores_gemma":[0.00025524542,0.00001684972,0.1217353,0.000049275204,0.0000069691037,0.0000021728133,0.000015656302,0.84885776,0.00047901215,0.00018797528,0.028288221,0.000105567815],"about_ca_topic_score_codex":0.00003270732,"about_ca_topic_score_gemma":0.00020879493,"teacher_disagreement_score":0.84446764,"about_ca_system_score_codex":0.000018586645,"about_ca_system_score_gemma":0.00004122061,"threshold_uncertainty_score":0.9990204},"labels":[],"label_agreement":null},{"id":"W2039501150","doi":"10.1049/iet-com.2013.1000","title":"Performance analysis of relay‐multiplexing scheme in cellular systems employing massive multiple‐input multiple‐output antennas","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"King Saud University","keywords":"Computer science; Relay; Multiplexing; Scheme (mathematics); Electronic engineering; Telecommunications; Mathematics; Physics; Engineering","score_opus":0.06292105140103584,"score_gpt":0.28198273781289385,"score_spread":0.21906168641185803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039501150","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.53610605,0.0029296563,0.45534998,0.0016415485,0.00023986353,0.00070199464,0.000017525275,0.0003208716,0.002692477],"genre_scores_gemma":[0.9463572,0.0016572004,0.051558338,0.00009252035,0.000020968277,0.00011772397,0.000077408105,0.000020604597,0.000098031225],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694836,0.0009318744,0.0009564186,0.00044170365,0.0003290241,0.00039262488],"domain_scores_gemma":[0.9918297,0.0018688947,0.00048669393,0.005217286,0.00047971067,0.00011769415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013478311,0.00025804463,0.00059348205,0.0008457566,0.000568502,0.00015384537,0.0043558483,0.00012107561,0.0000051808174],"category_scores_gemma":[0.0006691564,0.00027051973,0.00020413054,0.0033051786,0.00021959316,0.00060364715,0.0018694517,0.0005335723,0.000022033164],"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.000026087879,0.00068260863,0.70593214,0.000101598715,0.0007735081,0.0000022937809,0.010598818,0.17979474,0.032502204,0.04249066,0.00014522085,0.026950134],"study_design_scores_gemma":[0.0005374982,0.00003039076,0.06578793,0.00018408241,0.00005009003,0.0000010048669,0.00019395172,0.92962354,0.00037437587,0.000010468402,0.002940577,0.0002661195],"about_ca_topic_score_codex":0.00016285818,"about_ca_topic_score_gemma":0.00066261174,"teacher_disagreement_score":0.74982876,"about_ca_system_score_codex":0.0001369281,"about_ca_system_score_gemma":0.00007002282,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W2039659962","doi":"10.1049/iet-com.2012.0709","title":"Adaptive relaying scheme for cognitive radio networks","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Scheme (mathematics); Computer network; Telecommunications; Wireless; Mathematics","score_opus":0.084550904026496,"score_gpt":0.31188503188884326,"score_spread":0.22733412786234725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039659962","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.0006190915,0.0037234277,0.97397304,0.0072754733,0.000119321565,0.00093590876,0.0000041593494,0.00027887756,0.013070719],"genre_scores_gemma":[0.7838096,0.0017738292,0.2121522,0.0007731544,0.00004479585,0.00092895684,0.000037880814,0.00001577518,0.00046380982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876094,0.0002744553,0.00030779166,0.00026817454,0.00009390868,0.0002947256],"domain_scores_gemma":[0.99524313,0.0014058615,0.00014279758,0.002466826,0.00062867877,0.00011268639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035045174,0.00015546067,0.00017618285,0.00008757702,0.0009839374,0.00025792053,0.00301545,0.0000750223,0.0000481221],"category_scores_gemma":[0.00017776791,0.00015980015,0.00010180792,0.0005527516,0.00016513107,0.00075742125,0.0013291888,0.00034996757,0.0001254887],"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.000010070234,0.0002704481,0.0005479068,0.000005871591,0.00014852479,2.552122e-7,0.0025815072,0.00032556587,0.00047865335,0.70378196,0.027498813,0.26435044],"study_design_scores_gemma":[0.0005356577,0.00006755125,0.002097475,0.00008232745,0.000012071609,0.0000048421803,0.00026459823,0.9695414,0.000055975164,0.0030925274,0.023964431,0.00028117764],"about_ca_topic_score_codex":0.000016826727,"about_ca_topic_score_gemma":0.00003932434,"teacher_disagreement_score":0.9692158,"about_ca_system_score_codex":0.0000625168,"about_ca_system_score_gemma":0.00006830738,"threshold_uncertainty_score":0.7567751},"labels":[],"label_agreement":null},{"id":"W2040597926","doi":"10.1049/iet-com.2009.0517","title":"Decorrelate-and-forward relaying scheme for multiuser wireless code division multiple access networks","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Beamforming; Relay; Rayleigh fading; Code division multiple access; Wireless; Fading; Wireless network; Computer network; Signal-to-noise ratio (imaging); Maximal-ratio combining; Telecommunications; Power (physics); Channel (broadcasting)","score_opus":0.06390249652713585,"score_gpt":0.34557600523625115,"score_spread":0.2816735087091153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040597926","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.04554379,0.0009432954,0.94571555,0.005408608,0.00046113663,0.00066033343,0.000009224351,0.000350119,0.0009079431],"genre_scores_gemma":[0.8429802,0.0021957904,0.15394223,0.00040861245,0.000036307883,0.00025615256,0.000045701952,0.000023542654,0.00011144534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985727,0.00017872128,0.00041475205,0.00037949963,0.00012358294,0.00033071512],"domain_scores_gemma":[0.9937515,0.0017450983,0.00019097948,0.003813225,0.00033537752,0.000163788],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000713277,0.0002018522,0.00022603998,0.00011554923,0.0015061053,0.0005066044,0.004900737,0.00015853524,0.000011556291],"category_scores_gemma":[0.00032485445,0.00020060713,0.000098248354,0.0004791701,0.00019649247,0.00094643695,0.0038650732,0.000801565,0.00001461539],"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.000030034736,0.00057077204,0.067082316,0.000031155778,0.00013564216,8.203305e-7,0.0030294734,0.001948909,0.01147368,0.39946383,0.0059409784,0.5102924],"study_design_scores_gemma":[0.00061548076,0.000019225074,0.007831016,0.000045233428,0.00000911058,0.0000038730677,0.000022649156,0.9375901,0.0001739481,0.0006548679,0.052778676,0.00025577555],"about_ca_topic_score_codex":0.000022296603,"about_ca_topic_score_gemma":0.001321335,"teacher_disagreement_score":0.9356412,"about_ca_system_score_codex":0.000030700598,"about_ca_system_score_gemma":0.000055634795,"threshold_uncertainty_score":0.9997938},"labels":[],"label_agreement":null},{"id":"W2041382836","doi":"10.1049/iet-com:20080210","title":"Partial regularisation approach for detection problems in underdetermined linear systems","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Underdetermined system; Overdetermined system; Karush–Kuhn–Tucker conditions; Integer (computer science); Mathematics; Computer science; Algorithm; Decoding methods; Least-squares function approximation; Mathematical optimization; Applied mathematics; Statistics","score_opus":0.04148451759894078,"score_gpt":0.28654462476762144,"score_spread":0.24506010716868065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041382836","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.0027795185,0.00085192104,0.9915436,0.00023568726,0.000047637106,0.0011554119,0.000009777192,0.0009634018,0.0024130426],"genre_scores_gemma":[0.90158916,0.00046786605,0.09674508,0.000019403447,0.000028342733,0.0009332988,0.00015845403,0.000027117349,0.000031256677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909735,0.00009287761,0.0004063362,0.00013505269,0.0000871702,0.0001812004],"domain_scores_gemma":[0.99797225,0.0001156791,0.00007873142,0.0017165771,0.000079978156,0.000036813515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026932228,0.00013199309,0.0001713628,0.00016153665,0.00014725042,0.000036003246,0.00067802996,0.00012703262,6.945435e-7],"category_scores_gemma":[0.000043371307,0.00015448677,0.000047753983,0.000316451,0.000048537757,0.0002450498,0.000051008963,0.00024361175,0.000002488091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019043167,0.0004178597,0.00015372921,0.00017299798,0.000035185647,1.1804101e-7,0.0013319922,0.8334562,0.06354733,0.01748673,0.00025466777,0.08312411],"study_design_scores_gemma":[0.00031125345,0.000048308735,0.00040731742,0.000039374718,0.000008548852,0.0000028498948,0.00010606396,0.98501825,0.0057667233,0.0021872728,0.0059208763,0.00018317721],"about_ca_topic_score_codex":0.000022755636,"about_ca_topic_score_gemma":0.000045568566,"teacher_disagreement_score":0.8988097,"about_ca_system_score_codex":0.0001716416,"about_ca_system_score_gemma":0.0000129485925,"threshold_uncertainty_score":0.6299788},"labels":[],"label_agreement":null},{"id":"W2042351700","doi":"10.1049/iet-com.2009.0642","title":"Performance of multiple-input and multiple-output orthogonal frequency and code division multiplexing systems in fading channels","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Fading; Computer science; MIMO; Electronic engineering; MIMO-OFDM; Code division multiple access; Bit error rate; Diversity scheme; Diversity gain; Frequency domain; Space–time block code; Frequency-division multiplexing; Block code; Telecommunications; Channel (broadcasting); Engineering; Decoding methods","score_opus":0.05066430289974461,"score_gpt":0.30424455383425975,"score_spread":0.25358025093451514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042351700","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.97954637,0.0015862429,0.016502535,0.0011246612,0.00017256162,0.00055931887,0.000025461917,0.00010357582,0.00037929034],"genre_scores_gemma":[0.95613736,0.0014657304,0.042196617,0.000019994402,0.000024753348,0.00009019715,0.000024037923,0.000019032283,0.000022285283],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792665,0.00038825066,0.0006167385,0.00037029633,0.00033315955,0.00036491922],"domain_scores_gemma":[0.99386936,0.0023354106,0.0002451805,0.0031419278,0.0002557169,0.00015241608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012626136,0.00019142276,0.0003059022,0.00035324035,0.0004933043,0.00019274415,0.0029606195,0.00014798895,0.0000015844282],"category_scores_gemma":[0.00048000916,0.00019554216,0.000038793733,0.00061292516,0.0004545669,0.00079242646,0.0027462281,0.00090042915,0.000004212753],"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.000015342705,0.00032170254,0.8794297,0.00016347608,0.000035026245,0.0000019775712,0.0053992136,0.013432407,0.033706613,0.023798544,0.000028611035,0.04366737],"study_design_scores_gemma":[0.00057500997,0.000034831974,0.13713096,0.00019280406,0.0000019539482,0.0000144860205,0.00008300588,0.86109513,0.00021123288,0.00010623376,0.0003838878,0.00017044325],"about_ca_topic_score_codex":0.00037426193,"about_ca_topic_score_gemma":0.001364585,"teacher_disagreement_score":0.84766275,"about_ca_system_score_codex":0.000037150257,"about_ca_system_score_gemma":0.000080191945,"threshold_uncertainty_score":0.7973978},"labels":[],"label_agreement":null},{"id":"W2043153978","doi":"10.1049/iet-com.2013.0558","title":"Uplink scheduling solution for enhancing throughput and fairness in relayed long‐term evolution networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Computer science; Maximum throughput scheduling; Term (time); Scheduling (production processes); Throughput; Computer network; Fairness measure; Telecommunications; Dynamic priority scheduling; Mathematical optimization; Round-robin scheduling; Wireless; Quality of service; Mathematics","score_opus":0.04230175406491025,"score_gpt":0.3090671617321022,"score_spread":0.2667654076671919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043153978","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.007415139,0.003203512,0.984142,0.0040586186,0.00014947695,0.00039207618,6.4144587e-7,0.00015127959,0.00048724186],"genre_scores_gemma":[0.88346773,0.00167229,0.114410564,0.00017097793,0.000049968414,0.00015388755,0.000028393026,0.000012339298,0.000033851073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855304,0.00036213695,0.00040729844,0.00031021144,0.00008195908,0.00028538096],"domain_scores_gemma":[0.996732,0.0007011013,0.0001317219,0.0021717744,0.00019376501,0.00006967021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011470534,0.00014701042,0.00019530575,0.00013054599,0.00078112003,0.0001740271,0.0016048674,0.00010674961,0.0000019088814],"category_scores_gemma":[0.00020850556,0.00016240173,0.000053196673,0.00053421996,0.000121846424,0.00059685454,0.0011165375,0.00034637656,0.0000052274922],"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.000016502925,0.00020771608,0.0077840346,0.000033208624,0.000030165202,1.8267271e-7,0.0022801277,0.009336953,0.0025757337,0.7518506,0.0001232247,0.22576156],"study_design_scores_gemma":[0.00049768924,0.000037055284,0.020658627,0.00013899538,0.000007760949,0.00000476631,0.00002245464,0.9745748,0.000051259594,0.0033184455,0.0004985909,0.0001895664],"about_ca_topic_score_codex":0.000024402541,"about_ca_topic_score_gemma":0.0022770513,"teacher_disagreement_score":0.96523786,"about_ca_system_score_codex":0.00014111491,"about_ca_system_score_gemma":0.00005477388,"threshold_uncertainty_score":0.66225505},"labels":[],"label_agreement":null},{"id":"W2044947776","doi":"10.1049/iet-com.2009.0461","title":"Improved channel access protocol for cooperative <i>ad hoc</i> networks","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Relay; Throughput; Bandwidth (computing); Node (physics); Multiple Access with Collision Avoidance for Wireless; Markov chain; Diversity gain; Hidden node problem; Channel (broadcasting); Optimized Link State Routing Protocol; Cooperative diversity; Data transmission; Wireless network; Wireless; MIMO; Telecommunications; Fading; Wi-Fi array","score_opus":0.09320148142979909,"score_gpt":0.3867840101752733,"score_spread":0.2935825287454742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044947776","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.00004832314,0.00026141864,0.894545,0.015402666,0.00033217415,0.08309118,0.000012912466,0.00048481004,0.0058215098],"genre_scores_gemma":[0.13230015,0.00074394065,0.13502431,0.002811249,0.00018222863,0.72787476,0.000084573934,0.000054461958,0.00092434615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985055,0.00023768915,0.00041715198,0.00037499564,0.00010357767,0.0003611248],"domain_scores_gemma":[0.99329865,0.00064219156,0.00021134753,0.0049614715,0.00073677447,0.00014954533],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00060842535,0.00022723689,0.00022616453,0.00009618454,0.001337884,0.0006938623,0.008041583,0.0001276221,0.000031789208],"category_scores_gemma":[0.00017882153,0.00021402324,0.000111220266,0.00073969224,0.00023097065,0.0009746465,0.002947166,0.0007305913,0.000014445141],"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.00011644119,0.0016577747,0.00011651627,0.000053332195,0.0001774656,6.854778e-7,0.0042327642,0.0011164749,0.018466795,0.49619475,0.05508659,0.4227804],"study_design_scores_gemma":[0.00089003576,0.00007845682,0.0001303036,0.000024936558,0.0000050894973,0.000003824483,0.000018758607,0.55019665,0.0006159694,0.0008860186,0.4468863,0.00026363065],"about_ca_topic_score_codex":0.0000036786846,"about_ca_topic_score_gemma":0.0007798167,"teacher_disagreement_score":0.7595207,"about_ca_system_score_codex":0.000035145837,"about_ca_system_score_gemma":0.0001763467,"threshold_uncertainty_score":0.9999622},"labels":[],"label_agreement":null},{"id":"W2044968799","doi":"10.1049/iet-com.2013.0232","title":"Relay‐assisted spectrum sensing","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Computer science; Spectrum (functional analysis); Telecommunications; Computer network; Physics","score_opus":0.026909967680740433,"score_gpt":0.26149326891430313,"score_spread":0.2345833012335627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044968799","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.0038474407,0.00026216247,0.89314926,0.022248669,0.00022477462,0.00010340877,8.90072e-7,0.00039598066,0.07976741],"genre_scores_gemma":[0.85442555,0.00009003666,0.14458978,0.00063380407,0.000082294115,0.0000013341958,0.0000065599743,0.00001058467,0.00016004418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988742,0.0002740749,0.00021360611,0.00023614021,0.0001420085,0.00025999182],"domain_scores_gemma":[0.99662083,0.00047861575,0.00008968916,0.0026560205,0.00006864729,0.000086173226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034880172,0.00011359188,0.00014504945,0.00008929715,0.0005452919,0.00020627001,0.0012211341,0.00004889301,0.0000059017666],"category_scores_gemma":[0.00008451029,0.00011780998,0.0000760037,0.0005059645,0.00010833727,0.00021591599,0.00057614857,0.0002704435,0.00009414908],"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.000002584981,0.00009643674,0.0002808196,0.000003918665,0.000039319606,0.000004892816,0.000760578,0.0001582016,0.0011146076,0.5726315,0.0022702797,0.4226369],"study_design_scores_gemma":[0.00026229926,0.000042149954,0.00947032,0.000052392188,0.000013929064,0.00011112926,0.000031480948,0.8794125,0.00028527807,0.01791206,0.092134,0.00027248697],"about_ca_topic_score_codex":0.00005907968,"about_ca_topic_score_gemma":0.00030189162,"teacher_disagreement_score":0.8792543,"about_ca_system_score_codex":0.00005107255,"about_ca_system_score_gemma":0.000032514075,"threshold_uncertainty_score":0.48041517},"labels":[],"label_agreement":null},{"id":"W2045608322","doi":"10.1049/iet-com.2013.0571","title":"Sparse channel estimation of pulse‐shaping multiple‐input–multiple‐output orthogonal frequency division multiplexing systems with an approximate gradient <i>l</i> <sub>2</sub> <i>−</i> <i>Sl</i> <sub>0</sub> reconstruction algorithm","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Orthogonal frequency-division multiplexing; Multiplexing; Channel (broadcasting); Computer science; Algorithm; Division (mathematics); Mathematics; Control theory (sociology); Telecommunications; Arithmetic; Artificial intelligence","score_opus":0.028249298803047777,"score_gpt":0.22757125603719044,"score_spread":0.19932195723414267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045608322","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.49407938,0.00051334663,0.50256956,0.00005270643,0.00035794263,0.00081867416,0.00011873221,0.0011900319,0.0002996172],"genre_scores_gemma":[0.92135125,0.00059366215,0.07689547,0.00004414762,0.0001260431,0.00026307686,0.00058087986,0.00014458147,8.7822076e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968786,0.00039494253,0.001050278,0.000574965,0.00048963085,0.00061155844],"domain_scores_gemma":[0.9957651,0.00049998536,0.0005269568,0.0025002377,0.00046625407,0.00024149474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000635239,0.00057917193,0.00066726655,0.00038920366,0.0006223789,0.00016914854,0.00092492945,0.00028289357,7.369655e-7],"category_scores_gemma":[0.00015574819,0.0006007438,0.0001704792,0.0005347937,0.00035284008,0.00087033265,0.00026363606,0.0006593669,0.000011488515],"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.000037372673,0.00033480348,0.0009444483,0.00019678095,0.00017487488,0.0000038135286,0.00092141714,0.34582213,0.45920542,0.0006631307,0.00010792976,0.19158788],"study_design_scores_gemma":[0.00073453947,0.00013798718,0.0007881336,0.000916503,0.000065605935,0.000087169356,0.00013783795,0.78809,0.20785514,0.00059857726,0.000050811406,0.000537699],"about_ca_topic_score_codex":0.00017558012,"about_ca_topic_score_gemma":0.00023375376,"teacher_disagreement_score":0.44226786,"about_ca_system_score_codex":0.00017181954,"about_ca_system_score_gemma":0.000050552437,"threshold_uncertainty_score":0.9996444},"labels":[],"label_agreement":null},{"id":"W2048283499","doi":"10.1049/iet-com.2009.0646","title":"Incoherent spatial diversity combining scheme for spread spectrum","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Fading; Diversity scheme; Antenna diversity; Computer science; Bandwidth (computing); Diversity combining; Spread spectrum; Telecommunications; Demodulation; Diversity gain; Direct-sequence spread spectrum; Interference (communication); Electronic engineering; Algorithm; Wireless; Channel (broadcasting); Engineering","score_opus":0.07773348497210626,"score_gpt":0.2739815835450186,"score_spread":0.19624809857291237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048283499","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.01955129,0.0010536592,0.90637785,0.00068770227,0.00023413017,0.0012166068,0.00009874788,0.0033061674,0.067473814],"genre_scores_gemma":[0.82164913,0.00050877145,0.17746422,0.00003451743,0.000013236772,0.00019388412,0.00006478824,0.000030867894,0.000040594587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932414,0.000043916218,0.00023707064,0.00011367075,0.000084563944,0.00019663185],"domain_scores_gemma":[0.99733204,0.00015722819,0.00006577896,0.0023154134,0.00006615492,0.00006337723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013298068,0.00013690893,0.00015723876,0.000084652514,0.00047667348,0.000015091447,0.0017043785,0.000076400655,0.000056355737],"category_scores_gemma":[0.000031011543,0.0001652997,0.00007343638,0.00013945681,0.00013046681,0.00018950924,0.0012352862,0.00026441575,0.000029766743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019646825,0.0026276861,0.060701504,0.00044501398,0.00105589,0.0000034402929,0.032481298,0.0015272616,0.021396434,0.6594052,0.021095855,0.19906397],"study_design_scores_gemma":[0.004453129,0.00059896853,0.04908486,0.0005252862,0.00025080523,0.000019827745,0.0022274635,0.33097064,0.17052592,0.22099692,0.21694334,0.0034028492],"about_ca_topic_score_codex":0.0002438859,"about_ca_topic_score_gemma":0.00048200265,"teacher_disagreement_score":0.80209786,"about_ca_system_score_codex":0.0000992874,"about_ca_system_score_gemma":0.000012658908,"threshold_uncertainty_score":0.6740726},"labels":[],"label_agreement":null},{"id":"W2048867907","doi":"10.1049/iet-com.2010.0730","title":"Blind channel estimation for equalisation in dispersive fading channel","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Fading; Channel (broadcasting); Rayleigh fading; Kalman filter; Algorithm; Channel state information; Computer science; Orthogonal frequency-division multiplexing; Blind equalization; Mathematics; Minimum mean square error; Equalization (audio); Statistics; Control theory (sociology); Telecommunications; Estimator; Wireless; Artificial intelligence","score_opus":0.12855643944303674,"score_gpt":0.3239183795907683,"score_spread":0.19536194014773156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048867907","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.005795114,0.00071300764,0.9824558,0.00043857875,0.000092778646,0.0010214569,0.00004292128,0.0007846259,0.00865571],"genre_scores_gemma":[0.88840264,0.0007608524,0.10952742,0.00003651287,0.000011836559,0.0009800066,0.0002177311,0.000040952385,0.000022032484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999182,0.00006302867,0.00035538452,0.00012587462,0.00007542029,0.00019832616],"domain_scores_gemma":[0.99803936,0.0002525423,0.00008663349,0.0014795165,0.00009798534,0.00004395783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025098663,0.0001400693,0.00015660241,0.00025292413,0.0001683846,0.000019121948,0.00088702806,0.00009938442,0.000009774133],"category_scores_gemma":[0.0001009935,0.00017133832,0.000052666317,0.0003301098,0.00008255132,0.00044840903,0.00014616584,0.00021471818,0.000014939544],"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.000244658,0.0014311047,0.00050805917,0.000570734,0.00028877237,0.0000017419179,0.15863457,0.26382148,0.01278354,0.42992082,0.002866427,0.12892808],"study_design_scores_gemma":[0.00058914075,0.000040951854,0.0005844794,0.000112977854,0.000015415502,0.0000018054236,0.0012470497,0.9408058,0.007728685,0.04760878,0.0009527092,0.0003122],"about_ca_topic_score_codex":0.0000462801,"about_ca_topic_score_gemma":0.00019678456,"teacher_disagreement_score":0.8826075,"about_ca_system_score_codex":0.00015425938,"about_ca_system_score_gemma":0.000013674952,"threshold_uncertainty_score":0.6986974},"labels":[],"label_agreement":null},{"id":"W2052739893","doi":"10.1049/iet-com.2013.1075","title":"Optimal multi‐input–multi‐output relay transform matrix with a bounded condition number","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bounded function; Relay; Matrix (chemical analysis); Computer science; Mathematics; Condition number; Mathematical optimization; Applied mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Power (physics)","score_opus":0.04558445347972081,"score_gpt":0.329468600376631,"score_spread":0.2838841468969102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052739893","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.006007003,0.00038654817,0.97193056,0.010481835,0.00008616734,0.0004511038,0.000008996038,0.00046751407,0.010180286],"genre_scores_gemma":[0.6229451,0.00064086844,0.3746352,0.0003978728,0.000018519268,0.00012822983,0.0000633268,0.000018406796,0.0011525374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819076,0.0005072167,0.00039731225,0.00034313026,0.00023729986,0.00032426216],"domain_scores_gemma":[0.9950159,0.00039386333,0.00016223305,0.0039472273,0.00032944608,0.0001513317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056815136,0.00023118286,0.000243767,0.00009806959,0.0011012389,0.00033141184,0.0033169694,0.00009955105,0.00005347055],"category_scores_gemma":[0.00006229606,0.00021214376,0.00009731615,0.0006500699,0.0002978606,0.00071861455,0.00062745664,0.0005015186,0.00031124093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005573223,0.0020147886,0.0030692625,0.000043701428,0.00027158542,0.0000040245445,0.015394198,0.004375546,0.0015269107,0.85458153,0.006011701,0.11265103],"study_design_scores_gemma":[0.002370716,0.00011967693,0.005310854,0.00012003049,0.000037041787,0.000059033217,0.00015416033,0.7478805,0.0003153881,0.00039276888,0.24265185,0.00058794225],"about_ca_topic_score_codex":0.000028274055,"about_ca_topic_score_gemma":0.00045743742,"teacher_disagreement_score":0.85418874,"about_ca_system_score_codex":0.00009931556,"about_ca_system_score_gemma":0.00010951887,"threshold_uncertainty_score":0.86509717},"labels":[],"label_agreement":null},{"id":"W2053406016","doi":"10.1049/iet-com.2011.0006","title":"Ergodic and outage capacities of relaying channels in spectrum‐sharing constrained systems","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transmitter; Relay; Fading; Rayleigh fading; Computer science; Nakagami distribution; Transmitter power output; Ergodic theory; Node (physics); Topology (electrical circuits); Transmission (telecommunications); Interference (communication); Channel (broadcasting); Computer network; Relay channel; Telecommunications; Power (physics); Mathematics; Physics","score_opus":0.05805624676233438,"score_gpt":0.273703508275998,"score_spread":0.2156472615136636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053406016","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.7585052,0.027677638,0.12836044,0.024279973,0.00063858734,0.0022408168,0.000015287695,0.0005526813,0.05772938],"genre_scores_gemma":[0.99146205,0.0023345887,0.005829545,0.000075788776,0.000009877558,0.00010037722,0.0000049054183,0.0000068429813,0.00017599398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897337,0.00020568399,0.00037820407,0.00017257588,0.00009751726,0.00017264359],"domain_scores_gemma":[0.997401,0.0003494412,0.00012844156,0.0019679484,0.00009691382,0.000056234898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003972076,0.00010294324,0.00019650448,0.00017874324,0.00023387722,0.00017746944,0.001787848,0.00004507733,0.0000148509935],"category_scores_gemma":[0.00006800184,0.00010621302,0.000028260552,0.00041263094,0.0003047654,0.00048169805,0.0011792538,0.00024684408,0.000013787741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011798531,0.00009315666,0.005629046,0.00004057706,0.000027716405,7.704449e-7,0.0135817835,0.00062149006,0.0025848567,0.9705833,0.000196363,0.0066397632],"study_design_scores_gemma":[0.00081362884,0.000067396715,0.010878207,0.0006119304,0.000009447085,0.000037269027,0.004087846,0.97143877,0.00041533652,0.008151315,0.0030280724,0.0004607787],"about_ca_topic_score_codex":0.00028840257,"about_ca_topic_score_gemma":0.00014543263,"teacher_disagreement_score":0.97081727,"about_ca_system_score_codex":0.000039710347,"about_ca_system_score_gemma":0.000036053545,"threshold_uncertainty_score":0.43312413},"labels":[],"label_agreement":null},{"id":"W2053744022","doi":"10.1049/iet-com.2013.0263","title":"Generalised twin‐box model for compensation of transmitters radio frequency impairments","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Radio frequency; Compensation (psychology); Transmitter; Computer science; Telecommunications; Psychology","score_opus":0.03644039399874516,"score_gpt":0.26958888130027564,"score_spread":0.23314848730153048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053744022","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.009579371,0.00017706462,0.9874001,0.00029878906,0.000077830286,0.0003905437,0.000079113546,0.00017118001,0.0018259803],"genre_scores_gemma":[0.7399308,0.00006586941,0.25963718,0.00006646867,0.00001218783,0.000106207735,0.00011918627,0.000028568622,0.00003350809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933445,0.000048657774,0.00028556067,0.00009507793,0.00008274476,0.00015350629],"domain_scores_gemma":[0.9985031,0.00016272797,0.000050859468,0.0011625575,0.00007164735,0.000049101654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014755093,0.00011155466,0.00016051547,0.0000682644,0.000086644905,0.000010265715,0.0005603799,0.000050759572,0.000007422136],"category_scores_gemma":[0.00001580365,0.00012864107,0.00007718583,0.00010360955,0.000067089415,0.00014257063,0.000021076703,0.000095909345,0.0000053522563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012464117,0.00013302376,0.00039427247,0.00011223862,0.00012170539,6.993102e-8,0.00439536,0.8212025,0.13747175,0.027434034,0.0036008572,0.0051217186],"study_design_scores_gemma":[0.0005525949,0.000023916851,0.00036644042,0.00001844108,0.00002796242,9.481475e-7,0.000022917926,0.9860651,0.0018813983,0.009463986,0.0014312112,0.0001451198],"about_ca_topic_score_codex":0.000014298916,"about_ca_topic_score_gemma":0.000025672207,"teacher_disagreement_score":0.73035145,"about_ca_system_score_codex":0.00006577407,"about_ca_system_score_gemma":0.000016719297,"threshold_uncertainty_score":0.52458304},"labels":[],"label_agreement":null},{"id":"W2054249572","doi":"10.1049/iet-com:20070063","title":"Comparison of direct-sequence impulse radio and direct-sequence ultra-wide bandwidth in multi-user interference","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Phase-shift keying; Bit error rate; Duty cycle; Computer science; Keying; Electronic engineering; Spread spectrum; Algorithm; Telecommunications; Power (physics); Physics; Decoding methods; Engineering; Channel (broadcasting)","score_opus":0.07930046468700676,"score_gpt":0.32438562252978176,"score_spread":0.24508515784277501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054249572","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.92917067,0.023404213,0.008658349,0.0018155345,0.00020746679,0.0011013868,0.00017545228,0.0015446787,0.033922255],"genre_scores_gemma":[0.9679533,0.011155102,0.020468859,0.000033935466,0.0000038098372,0.00017768612,0.000046405996,0.00003666887,0.00012418983],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99840933,0.00019007204,0.00070631824,0.0002521397,0.00012339147,0.00031875385],"domain_scores_gemma":[0.99553823,0.0009828875,0.00012976333,0.0031540885,0.00010944894,0.00008558507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021911066,0.00024873824,0.00050683913,0.0003057739,0.00022040165,0.000020332629,0.0020834426,0.00018041478,0.000016121858],"category_scores_gemma":[0.00031928252,0.0002740163,0.00006294549,0.00073263416,0.00091388385,0.00026289697,0.000273474,0.00069047103,0.000018050116],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033809556,0.0013471498,0.7229614,0.00016326304,0.0002127725,0.000010130442,0.015609431,0.0051182583,0.22795752,0.0058797924,0.0018303811,0.018876081],"study_design_scores_gemma":[0.0057293335,0.0006289955,0.3446435,0.001877088,0.0002629547,0.0004042722,0.004569227,0.2303718,0.3121677,0.001952314,0.093212165,0.0041806507],"about_ca_topic_score_codex":0.0004742835,"about_ca_topic_score_gemma":0.0017907917,"teacher_disagreement_score":0.37831792,"about_ca_system_score_codex":0.00013280907,"about_ca_system_score_gemma":0.000055375112,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W2054368192","doi":"10.1049/iet-com:20060221","title":"Performance of blind channel estimation algorithms for space-frequency block coded multi-carrier code division multiple access systems","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Computer science; Identifiability; Channel (broadcasting); Telecommunications link; Code division multiple access; Cramér–Rao bound; Ambiguity; Block code; Code (set theory); Subspace topology; Theoretical computer science; Mathematics; Telecommunications; Estimation theory; Decoding methods; Artificial intelligence","score_opus":0.10439267583034711,"score_gpt":0.3389786307951794,"score_spread":0.2345859549648323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054368192","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.15500756,0.0028138477,0.837355,0.00022855902,0.00020325223,0.0021305091,0.0005184034,0.0011954186,0.000547449],"genre_scores_gemma":[0.80646497,0.0033585501,0.18887313,0.0000073818455,0.000013326083,0.00090768206,0.00026121724,0.000060158134,0.00005360101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986488,0.000084040264,0.0006361865,0.00018542759,0.0001946387,0.0002509089],"domain_scores_gemma":[0.9960393,0.00046421023,0.00024645083,0.002747922,0.00041989348,0.000082235325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023957426,0.00022859726,0.00033638443,0.00021424775,0.00048002426,0.000032638927,0.001902116,0.00015273334,0.0000023172934],"category_scores_gemma":[0.00016391255,0.00025359477,0.00008801946,0.00041320358,0.0002350606,0.00063900015,0.00035515547,0.00028730032,0.0000056786507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004020633,0.00054697465,0.005255122,0.00058371725,0.0001537684,4.7481447e-7,0.0025464795,0.9655695,0.016552141,0.0012645827,0.0009418373,0.0065451865],"study_design_scores_gemma":[0.00088654633,0.000046541707,0.00222255,0.0001721824,0.00001830709,0.000007119614,0.0000669647,0.9820696,0.013299552,0.00008402863,0.0008695211,0.00025710338],"about_ca_topic_score_codex":0.000080775004,"about_ca_topic_score_gemma":0.000059828868,"teacher_disagreement_score":0.6514574,"about_ca_system_score_codex":0.00012399876,"about_ca_system_score_gemma":0.000042504416,"threshold_uncertainty_score":0.99999166},"labels":[],"label_agreement":null},{"id":"W2056099459","doi":"10.1049/iet-com.2010.0858","title":"Analysing bit-interleaved coded modulation in multiple-input multiple-output systems with channel estimation error","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Estimator; Computer science; Channel (broadcasting); MIMO; Algorithm; Channel state information; Iterative method; Fading; Control theory (sociology); Mathematics; Telecommunications; Statistics; Wireless; Artificial intelligence","score_opus":0.05289808801175709,"score_gpt":0.2908210279846944,"score_spread":0.2379229399729373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056099459","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.14302818,0.0018175268,0.85123605,0.00027684245,0.00011672155,0.0009623885,0.000032044234,0.0014922016,0.0010380573],"genre_scores_gemma":[0.9089344,0.00027033917,0.08978625,0.000018358056,0.000026521779,0.00050689664,0.0003537205,0.00007657305,0.00002693967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983903,0.00023484373,0.0006130492,0.00017555497,0.00020747093,0.00037874933],"domain_scores_gemma":[0.9964017,0.00052222016,0.00019282091,0.002623318,0.00015006897,0.00010982473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038783543,0.00026627825,0.00033308778,0.0004430585,0.0002468621,0.000067489746,0.00091092277,0.00014078734,0.00000290664],"category_scores_gemma":[0.00014607848,0.000279221,0.00005986314,0.0007346911,0.00012549499,0.00092881825,0.00019949203,0.00044988026,0.000026633326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019339428,0.00020461538,0.012817595,0.00007723797,0.00007007844,3.3450826e-7,0.0026998443,0.9712485,0.0030732092,0.0007400002,0.00006958383,0.008979661],"study_design_scores_gemma":[0.0004972749,0.000015706722,0.013168223,0.0002592713,0.000023793775,0.0000070231104,0.00053842535,0.9835835,0.0010371255,0.000112805596,0.00044610296,0.00031073936],"about_ca_topic_score_codex":0.00023195003,"about_ca_topic_score_gemma":0.00072877796,"teacher_disagreement_score":0.7659062,"about_ca_system_score_codex":0.00035732373,"about_ca_system_score_gemma":0.000017631353,"threshold_uncertainty_score":0.999966},"labels":[],"label_agreement":null},{"id":"W2056397562","doi":"10.1049/iet-com.2014.0464","title":"Performance analysis of a multi‐hop power line communication system over log‐normal fading in presence of impulsive noise","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"International Development Research Centre","keywords":"Fading; Power-line communication; Hop (telecommunications); Computer science; Telecommunications; Impulse noise; Communications system; Noise (video); Fading distribution; Acoustics; Speech recognition; Power (physics); Rayleigh fading; Physics; Artificial intelligence; Decoding methods","score_opus":0.016547086263917783,"score_gpt":0.2658394706734405,"score_spread":0.2492923844095227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056397562","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.9817643,0.0022073484,0.006247243,0.00012619786,0.00005102181,0.00031205436,0.00008717453,0.00013423283,0.009070395],"genre_scores_gemma":[0.9892999,0.0017124088,0.008720299,0.00001033485,0.0000042287197,0.00007943983,0.00012445214,0.000023979012,0.00002496563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838537,0.00029160944,0.00082674425,0.00013038458,0.00016130203,0.00020461378],"domain_scores_gemma":[0.99423933,0.00065669575,0.00026359526,0.0045336057,0.00024753006,0.000059233327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069529546,0.00016734666,0.00045882407,0.0006336974,0.00012284105,0.000014969638,0.0020405138,0.00010253437,0.000020981655],"category_scores_gemma":[0.0001391304,0.00018191925,0.00014722762,0.0016578184,0.00020648882,0.0002829093,0.0005609731,0.00034838798,0.0000065058157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057152716,0.001097203,0.15678042,0.00055336027,0.0013415451,3.7805304e-7,0.011615279,0.78010744,0.028179608,0.0130232405,0.00022392343,0.0070204698],"study_design_scores_gemma":[0.00038156693,0.000029874085,0.12325644,0.00020446841,0.00017154444,8.920156e-7,0.00041099777,0.8741553,0.00070109795,0.00000781954,0.0005248257,0.00015520914],"about_ca_topic_score_codex":0.00038530133,"about_ca_topic_score_gemma":0.0010215492,"teacher_disagreement_score":0.094047844,"about_ca_system_score_codex":0.000097126875,"about_ca_system_score_gemma":0.000026435318,"threshold_uncertainty_score":0.7418452},"labels":[],"label_agreement":null},{"id":"W2056720576","doi":"10.1049/iet-com.2013.0596","title":"Performance analysis of two‐way opportunistic decode‐and‐forward based systems in Nakagami‐ <i>m</i> fading environments","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Nakagami distribution; Computer science; Telecommunications; Decoding methods","score_opus":0.04907193897756067,"score_gpt":0.28851536492289076,"score_spread":0.23944342594533008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056720576","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.15323924,0.0017433208,0.83298856,0.0016044178,0.00012276744,0.00042905376,0.000016311964,0.000109562156,0.009746768],"genre_scores_gemma":[0.9849368,0.0021143884,0.0125826495,0.00019453086,0.000005158961,0.000059121998,0.00004556219,0.000007733714,0.000054086664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984101,0.0005193823,0.00047903383,0.00022977793,0.00017862642,0.00018307476],"domain_scores_gemma":[0.9960088,0.000653129,0.00021481246,0.0029819408,0.000054582873,0.00008670121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009684045,0.00012936718,0.00031567336,0.00040485928,0.00026478703,0.00007431814,0.0021199726,0.0000409814,0.000007828123],"category_scores_gemma":[0.00006990012,0.000134975,0.000067752546,0.0012036713,0.00015036142,0.00025536495,0.00081725104,0.0001927838,0.000007874308],"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.000016202821,0.0009365081,0.2723432,0.000109048764,0.0007061161,0.000001432142,0.0044379374,0.142722,0.009580176,0.32470366,0.00020463769,0.2442391],"study_design_scores_gemma":[0.0002926591,0.000024150038,0.029735574,0.000059132206,0.00006722911,7.5035433e-7,0.000023676745,0.9642388,0.000058163707,0.00005101891,0.005314882,0.00013395725],"about_ca_topic_score_codex":0.00004280481,"about_ca_topic_score_gemma":0.00020354004,"teacher_disagreement_score":0.8316975,"about_ca_system_score_codex":0.00006474218,"about_ca_system_score_gemma":0.00003565826,"threshold_uncertainty_score":0.550412},"labels":[],"label_agreement":null},{"id":"W2058277537","doi":"10.1049/iet-com.2014.0235","title":"Recursive method for generating column weight 3 low‐density parity‐check codes based on three‐partite graphs","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Parity (physics); Low-density parity-check code; Combinatorics; Discrete mathematics; Algorithm; Decoding methods; Physics","score_opus":0.037734728780342,"score_gpt":0.32790374855602983,"score_spread":0.2901690197756878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058277537","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.0025248465,0.000062706815,0.98753536,0.0058564134,0.00023114338,0.0006027763,0.000013804716,0.0007920549,0.002380912],"genre_scores_gemma":[0.30792403,0.000013389077,0.6904281,0.0012448134,0.00003381315,0.00027164072,0.000027106575,0.000018341687,0.000038775415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978586,0.0007206615,0.00037856377,0.0004634825,0.00024429004,0.000334436],"domain_scores_gemma":[0.9920868,0.0027817923,0.0002780481,0.0043140254,0.00043139936,0.00010789724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001898465,0.00020802958,0.00028853118,0.00016021154,0.0009779915,0.00020633895,0.0029706664,0.0001273505,0.0000037969637],"category_scores_gemma":[0.0008521215,0.00022352482,0.0001685452,0.00053362,0.00012754828,0.00023533407,0.0005938063,0.00040286602,0.000016437107],"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.00004102832,0.00090669387,0.00714246,0.000081763465,0.0000898376,0.000001375731,0.0019307164,0.0023001097,0.010967416,0.8686523,0.025337685,0.08254861],"study_design_scores_gemma":[0.00025179103,0.00017302751,0.0008336877,0.00009895249,0.000022126698,0.0000028633988,0.000013874176,0.92857295,0.012484416,0.049269438,0.007997178,0.00027970647],"about_ca_topic_score_codex":0.00023821564,"about_ca_topic_score_gemma":0.002283771,"teacher_disagreement_score":0.9262728,"about_ca_system_score_codex":0.00008540093,"about_ca_system_score_gemma":0.00009612622,"threshold_uncertainty_score":0.9115078},"labels":[],"label_agreement":null},{"id":"W2059088819","doi":"10.1049/iet-com.2011.0525","title":"Theoretical framework for quality of service analysis of differentiated traffic in 802.11 wireless local area networks","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Quality of service; Voice over IP; Network packet; Distributed coordination function; IEEE 802.11; Throughput; Wireless network; Telecommunications link; Queuing delay; Packet loss; Token bucket; Wireless; Telecommunications","score_opus":0.06812888433809106,"score_gpt":0.35835518318208726,"score_spread":0.2902262988439962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059088819","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.15837315,0.00022058804,0.8392862,0.0007691261,0.000041413416,0.0011787923,0.000021067808,0.000036601617,0.00007306352],"genre_scores_gemma":[0.97307837,0.000038560036,0.025748607,0.00012212587,0.000016336626,0.0009209494,0.00006503601,0.000008902745,0.0000011056912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981474,0.0005491996,0.0006770393,0.00017730078,0.00013986332,0.0003091809],"domain_scores_gemma":[0.9946087,0.0023579637,0.0003124096,0.0024152417,0.000212642,0.00009305313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009982411,0.00013224546,0.00050925155,0.00016032842,0.000091289185,0.000027387108,0.0021860918,0.0001851735,0.000029193197],"category_scores_gemma":[0.000052095744,0.00012177101,0.00019890688,0.0022477896,0.00027412525,0.00016228792,0.00049140136,0.00026070612,6.5175135e-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.000023754486,0.00061420846,0.016260292,0.00002964184,0.00016827515,2.2888736e-8,0.0011527345,0.031551447,0.000017311047,0.9421916,0.00001780047,0.007972896],"study_design_scores_gemma":[0.00024966552,0.000023130198,0.069581054,0.000091143644,0.00009832208,1.5864293e-7,0.00009584913,0.92140156,0.000044097356,0.008244487,0.000039608498,0.00013093646],"about_ca_topic_score_codex":0.0001252448,"about_ca_topic_score_gemma":0.0010797909,"teacher_disagreement_score":0.93394715,"about_ca_system_score_codex":0.000027596208,"about_ca_system_score_gemma":0.00003543728,"threshold_uncertainty_score":0.49656776},"labels":[],"label_agreement":null},{"id":"W2061308128","doi":"10.1049/iet-com:20070490","title":"On the performance of time division multiple access-based multihop fixed cellular networks with respect to available frequency carriers","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Memorial University of Newfoundland","funders":"","keywords":"Time division multiple access; Computer network; Computer science; Cellular network; Base station; Throughput; Code division multiple access; Telecommunications; Wireless","score_opus":0.059758235845881476,"score_gpt":0.27547779234028463,"score_spread":0.21571955649440316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061308128","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.7326048,0.0011724528,0.24739611,0.008356298,0.000091850656,0.001363934,0.0000133909125,0.000315204,0.008685972],"genre_scores_gemma":[0.97506326,0.0007919225,0.02285363,0.0007643873,0.000010154328,0.00012580305,0.000021780204,0.000016486874,0.0003525551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841464,0.00045647626,0.0003215055,0.0002747714,0.000281814,0.00025077787],"domain_scores_gemma":[0.99296755,0.0013150716,0.00017365994,0.0050966726,0.00034111444,0.00010596193],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00049683114,0.000176581,0.00019821925,0.00012746488,0.0013015621,0.00009428171,0.0053407033,0.000051535368,0.0001033763],"category_scores_gemma":[0.0001779539,0.00012797065,0.00006272425,0.0012260415,0.00026689458,0.0003293678,0.0010942675,0.0003735187,0.0001231876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002803787,0.0020473255,0.2522856,0.000042122065,0.00031998134,0.000009200016,0.008739233,0.5856688,0.037651762,0.04135468,0.056121845,0.015479099],"study_design_scores_gemma":[0.00041978573,0.00023682379,0.009105777,0.00013015329,0.0000066695725,0.000001900233,0.000009726704,0.9815249,0.0046734316,0.000022895038,0.0036435418,0.00022441745],"about_ca_topic_score_codex":0.00006949158,"about_ca_topic_score_gemma":0.00010176559,"teacher_disagreement_score":0.39585608,"about_ca_system_score_codex":0.00007353119,"about_ca_system_score_gemma":0.0001593599,"threshold_uncertainty_score":0.9999986},"labels":[],"label_agreement":null},{"id":"W2061690338","doi":"10.1049/iet-com.2014.0535","title":"On polar multiple description coding","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoder; Computer science; Polar; Polar code; Algorithm; Coding (social sciences); Binary number; Hamming distance; Hamming code; Variable-length code; Decoding methods; Network packet; Multiple description coding; Theoretical computer science; Block code; Computer network; Arithmetic; Mathematics","score_opus":0.14326756998204065,"score_gpt":0.3265984394758602,"score_spread":0.18333086949381955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061690338","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.012308426,0.00021465725,0.9535285,0.005399821,0.00036867312,0.00023173128,0.000003404452,0.0017406003,0.026204139],"genre_scores_gemma":[0.7872078,0.000020224565,0.21227221,0.00033244054,0.000011492274,0.00003057924,0.000006507522,0.000007460128,0.000111334644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991833,0.00018115967,0.00015488066,0.00016459676,0.00017154624,0.00014454269],"domain_scores_gemma":[0.9966113,0.00032043635,0.000076683835,0.0027510624,0.00015450713,0.0000860117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048795703,0.000082493105,0.00008094522,0.00011210517,0.00022591173,0.00012315229,0.0023540896,0.00004642535,0.0000015078471],"category_scores_gemma":[0.00055510213,0.00008690204,0.000036120524,0.000333809,0.000049345123,0.00040732897,0.000673072,0.00023679654,0.00013386579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011002072,0.0005096822,0.008699877,0.00000705066,0.000022624781,0.00000307088,0.008327764,0.00016393572,0.0063334606,0.8953758,0.05205972,0.028486004],"study_design_scores_gemma":[0.0011007148,0.00052856165,0.0068944017,0.00024134932,0.000020695308,0.00006175429,0.0006679057,0.70086056,0.009669105,0.1673915,0.111625835,0.00093760673],"about_ca_topic_score_codex":0.00022415991,"about_ca_topic_score_gemma":0.00019197351,"teacher_disagreement_score":0.7748993,"about_ca_system_score_codex":0.00012664412,"about_ca_system_score_gemma":0.0000580769,"threshold_uncertainty_score":0.43745235},"labels":[],"label_agreement":null},{"id":"W2062007216","doi":"10.1049/iet-com.2014.0205","title":"Reliability‐based decision fusion scheme for cooperative spectrum sensing","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Reliability (semiconductor); Computer science; Spectrum (functional analysis); Fusion; Scheme (mathematics); Reliability engineering; Sensor fusion; Artificial intelligence; Mathematics; Physics; Engineering","score_opus":0.02479238218581995,"score_gpt":0.28659466809524864,"score_spread":0.26180228590942867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062007216","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.0112518575,0.00011263024,0.9773484,0.0074910354,0.0001802102,0.00036163395,0.0000040233135,0.00018920098,0.003061023],"genre_scores_gemma":[0.57867026,0.000026750438,0.42072883,0.00046783462,0.000052922373,0.000006039865,0.000014663545,0.000009402702,0.000023260127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865806,0.00024072126,0.0002903266,0.00036359325,0.00017058344,0.00027673692],"domain_scores_gemma":[0.9947993,0.0022390361,0.000103033526,0.002476102,0.00029214998,0.00009035427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070605817,0.00014852108,0.00019875141,0.00010016261,0.0008495411,0.00021145365,0.0010192256,0.00006820593,0.000005248712],"category_scores_gemma":[0.00041074428,0.00014205926,0.00010903273,0.00047270564,0.00012629456,0.00025176856,0.00042789418,0.00021820223,0.00002222974],"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.00008315331,0.00043808253,0.0002591643,0.000023443468,0.000040525127,0.000001941581,0.0011721042,0.0046979585,0.012509808,0.36124882,0.004257521,0.61526746],"study_design_scores_gemma":[0.0004824724,0.000095300165,0.0005363347,0.00007619799,0.000007383736,0.0000051931434,0.000020276082,0.95398957,0.0013843009,0.016620915,0.026599532,0.00018252192],"about_ca_topic_score_codex":0.000029498811,"about_ca_topic_score_gemma":0.00022196477,"teacher_disagreement_score":0.9492916,"about_ca_system_score_codex":0.000084680134,"about_ca_system_score_gemma":0.000081027574,"threshold_uncertainty_score":0.6534069},"labels":[],"label_agreement":null},{"id":"W2064597225","doi":"10.1049/iet-com.2011.0730","title":"Capacity maximisation in eigen-multiple-input multiple-output using adaptive modulation and Reed–Solomon coding","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Coding gain; MIMO; Computer science; Channel capacity; Codec; Code rate; Algorithm; Quadrature amplitude modulation; Encoder; Link adaptation; Coding (social sciences); Decoding methods; Bit error rate; QAM; Adaptive coding; Variable-length code; Mathematics; Telecommunications; Channel (broadcasting); Statistics; Data compression; Fading","score_opus":0.10913611060438197,"score_gpt":0.2931609882454003,"score_spread":0.18402487764101835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064597225","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.5872475,0.0016612677,0.40786582,0.00018090392,0.000090089256,0.0006738326,0.00003494245,0.0007734115,0.0014722486],"genre_scores_gemma":[0.81995946,0.001002973,0.17877443,0.00002197636,0.000024975856,0.000106302956,0.00006167034,0.000042925072,0.000005268783],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987542,0.00020531559,0.00044182144,0.00015275597,0.00013597331,0.00030991324],"domain_scores_gemma":[0.9975871,0.0005544882,0.00012574942,0.001545648,0.00009240367,0.00009462225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038680588,0.00020501138,0.0002195518,0.00024739272,0.00027710598,0.000032534044,0.0005166066,0.00015734418,0.0000036232686],"category_scores_gemma":[0.00019041651,0.000253249,0.000040531067,0.00035368247,0.0001593254,0.0008839026,0.00029109398,0.0004502812,0.000006107706],"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.00006321624,0.000629746,0.41959357,0.00017335205,0.00015252171,7.625155e-7,0.023353962,0.1708025,0.25440806,0.02206733,0.00010924238,0.10864572],"study_design_scores_gemma":[0.00033614138,0.000010501273,0.063968845,0.000098207835,0.000012754683,0.000006586206,0.00039470455,0.92799103,0.005586086,0.00083523704,0.00047209044,0.00028779646],"about_ca_topic_score_codex":0.00030242177,"about_ca_topic_score_gemma":0.0005257215,"teacher_disagreement_score":0.75718856,"about_ca_system_score_codex":0.00037378006,"about_ca_system_score_gemma":0.00001234942,"threshold_uncertainty_score":0.99999195},"labels":[],"label_agreement":null},{"id":"W2065156813","doi":"10.1049/iet-com:20070272","title":"Multilayered linear dispersion codes for flat fading multiple-input multiple-output channels","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiplexing; Coding (social sciences); Computer science; Fading; Coding gain; Algorithm; Block code; Linear code; Dispersion (optics); Mathematics; Electronic engineering; Topology (electrical circuits); Telecommunications; Decoding methods; Optics; Statistics; Physics; Engineering","score_opus":0.06286843372378935,"score_gpt":0.30225952741672957,"score_spread":0.2393910936929402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065156813","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.12439346,0.003888139,0.8606343,0.0012475916,0.00036905863,0.0024172538,0.0003418784,0.004988871,0.0017194193],"genre_scores_gemma":[0.7669937,0.004551776,0.22707333,0.00005862249,0.00005899017,0.0006926871,0.00027538813,0.000100771904,0.0001947551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848837,0.00010157794,0.0005572756,0.00026535962,0.00017604875,0.00041135066],"domain_scores_gemma":[0.99460864,0.001569297,0.00012506115,0.0033173878,0.00023959352,0.00014004692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019312852,0.0003192365,0.0003681521,0.0002160212,0.000930855,0.000031118543,0.0018857067,0.0001952435,0.0000082378265],"category_scores_gemma":[0.00040970877,0.0003595873,0.00019426254,0.00032926447,0.00027505824,0.00039936864,0.00047719688,0.0004588761,0.000046710746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025993935,0.0012958779,0.018852947,0.00064566714,0.0007946598,0.000009541264,0.024339844,0.5100371,0.32060063,0.0053486372,0.025592621,0.09222248],"study_design_scores_gemma":[0.0008606376,0.000034118446,0.00047767942,0.00010478252,0.000018804523,0.000013197948,0.00021474103,0.89321166,0.03736694,0.00016216718,0.06709159,0.0004436681],"about_ca_topic_score_codex":0.000045172128,"about_ca_topic_score_gemma":0.00013780258,"teacher_disagreement_score":0.64260024,"about_ca_system_score_codex":0.00018080493,"about_ca_system_score_gemma":0.000026343198,"threshold_uncertainty_score":0.9998856},"labels":[],"label_agreement":null},{"id":"W2065883175","doi":"10.1049/iet-com.2012.0782","title":"Design of distributed collaborative space‐time block codes for two‐way relaying networks","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Block code; Block (permutation group theory); Computer network; Space–time block code; Distributed computing; Theoretical computer science; Telecommunications; Decoding methods; Mathematics; Combinatorics","score_opus":0.04559935547268625,"score_gpt":0.2990391749312891,"score_spread":0.2534398194586029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065883175","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.00054318836,0.0022211103,0.98715574,0.0074359393,0.00006325283,0.0012269733,0.000026107671,0.00017847036,0.0011491973],"genre_scores_gemma":[0.7396846,0.0012084636,0.25811863,0.0001483041,0.000020060268,0.00052502594,0.0000889322,0.00001526164,0.00019071379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981954,0.00069170265,0.0004631749,0.00024714135,0.00012190334,0.000280675],"domain_scores_gemma":[0.99301606,0.0022450078,0.00030470995,0.0031890376,0.0011454197,0.000099750745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060764625,0.00017996297,0.00029574236,0.00009348317,0.00073149893,0.00019775286,0.0032609142,0.00007455577,0.000029391309],"category_scores_gemma":[0.00022519677,0.00017858545,0.00007575343,0.0011132729,0.0002285548,0.00049631885,0.0011209318,0.0002465862,0.000043063766],"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.000053282918,0.0011384044,0.00048133897,0.00003358081,0.00052541966,5.7743046e-7,0.007743649,0.27199703,0.043642644,0.5165644,0.09982591,0.057993747],"study_design_scores_gemma":[0.0005222765,0.00007972619,0.00025296977,0.000060939463,0.000017069242,0.0000022023976,0.000098964774,0.98847973,0.0008433264,0.001460994,0.007964262,0.00021754274],"about_ca_topic_score_codex":0.000017509836,"about_ca_topic_score_gemma":0.000020830646,"teacher_disagreement_score":0.7391414,"about_ca_system_score_codex":0.000069132,"about_ca_system_score_gemma":0.0001222394,"threshold_uncertainty_score":0.7282503},"labels":[],"label_agreement":null},{"id":"W2071444230","doi":"10.1049/iet-com:20060336","title":"Joint rate and power adaptation for radio resource management in uplink wideband code division multiple access systems","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Throughput; Power control; Transmitter power output; Telecommunications link; Bit error rate; Link adaptation; Code division multiple access; Interference (communication); Fading; Power (physics); Code rate; Wideband; Computer network; Real-time computing; Electronic engineering; Telecommunications; Transmitter; Engineering; Wireless; Channel (broadcasting); Decoding methods","score_opus":0.05856204277610793,"score_gpt":0.2725907698827809,"score_spread":0.21402872710667298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071444230","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.022975987,0.0026990564,0.9714229,0.00024171858,0.0000994959,0.0010655279,0.0000181119,0.00021386311,0.0012633419],"genre_scores_gemma":[0.96554065,0.0034095254,0.030393995,0.000020796246,0.000010569155,0.00034203302,0.00016076436,0.000037010683,0.00008467236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927837,0.00006138697,0.0002995268,0.00014030005,0.000066043394,0.00015438745],"domain_scores_gemma":[0.9988988,0.00025651592,0.000062398554,0.00069653033,0.000045109824,0.000040619463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017673128,0.00011311356,0.000148157,0.000121089346,0.0002141416,0.000043455115,0.00029957382,0.000053715674,0.0000012767629],"category_scores_gemma":[0.000029746589,0.00012713883,0.00002231761,0.00022521704,0.00005140617,0.00027198863,0.00014018152,0.000116957126,0.0000019960553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008937928,0.000024620755,0.0006154354,0.000036803194,0.00001839182,6.9168846e-7,0.0006100529,0.9954289,0.00009022446,0.00067725556,0.0007057517,0.0017829213],"study_design_scores_gemma":[0.000710801,0.000010936858,0.0076705245,0.000092810136,0.000008493575,0.0000024678945,0.00018416127,0.9826494,0.000042520827,0.00009838264,0.008391265,0.00013826504],"about_ca_topic_score_codex":0.000017420021,"about_ca_topic_score_gemma":0.00007817428,"teacher_disagreement_score":0.94256467,"about_ca_system_score_codex":0.00008486265,"about_ca_system_score_gemma":0.000005213476,"threshold_uncertainty_score":0.5184571},"labels":[],"label_agreement":null},{"id":"W2071661590","doi":"10.1049/iet-com.2013.0164","title":"Block error rate of optical wireless communication systems over atmospheric turbulence channels","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Block (permutation group theory); Computer science; Atmospheric turbulence; Wireless; Turbulence; Channel (broadcasting); Bit error rate; Optical wireless; Telecommunications; Mathematics; Physics; Meteorology","score_opus":0.018615490124175165,"score_gpt":0.24842356489532755,"score_spread":0.2298080747711524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071661590","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.8780487,0.019120162,0.04202576,0.0059262845,0.0007317889,0.0016886987,0.00006626213,0.004978586,0.047413766],"genre_scores_gemma":[0.9742765,0.00413705,0.021093214,0.000041435622,0.000016689832,0.00024323387,0.000046563724,0.000060619142,0.000084694606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982205,0.00035393838,0.0007197089,0.00019427635,0.00018807377,0.00032350168],"domain_scores_gemma":[0.9917804,0.0012364679,0.0001784857,0.006468892,0.00023691035,0.00009885967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006056512,0.00025712347,0.0004370817,0.00005973917,0.00024468306,0.000082530576,0.0036790657,0.00024595446,0.000016862345],"category_scores_gemma":[0.0002727487,0.00027167972,0.00010063417,0.0006702048,0.00071265065,0.0002488597,0.000949566,0.0006306136,0.00006673703],"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.000020932806,0.0006143125,0.0008829027,0.00032547378,0.00029988858,4.971516e-7,0.0011339596,0.16781151,0.011335018,0.7888375,0.0031652504,0.025572788],"study_design_scores_gemma":[0.00034168558,0.000046833076,0.0011281775,0.00021632998,0.00003288808,0.000004921396,0.0003233828,0.97780097,0.0029743065,0.0017241329,0.015049196,0.00035720694],"about_ca_topic_score_codex":0.00008085247,"about_ca_topic_score_gemma":0.000028760836,"teacher_disagreement_score":0.80998945,"about_ca_system_score_codex":0.00010744535,"about_ca_system_score_gemma":0.00002626057,"threshold_uncertainty_score":0.99997354},"labels":[],"label_agreement":null},{"id":"W2072368099","doi":"10.1049/iet-com.2012.0491","title":"Convolutional doubly orthogonal codes over <i>GF</i> ( <i>q</i> )","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"GF(2); Convolutional code; Computer science; Mathematics; Combinatorics; Algorithm; Finite field; Decoding methods","score_opus":0.021424821267185524,"score_gpt":0.2547704431675885,"score_spread":0.23334562190040298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072368099","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.11043534,0.0033699153,0.66999865,0.04269095,0.0009474661,0.0011667482,0.00011162453,0.0018011804,0.16947815],"genre_scores_gemma":[0.9533256,0.00008807871,0.044307873,0.0018619786,0.000033100467,0.00012606061,0.000037028498,0.0000075006224,0.00021276381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897623,0.00016872237,0.00021897478,0.00021154113,0.00019932918,0.0002251736],"domain_scores_gemma":[0.9969377,0.00037208258,0.00007902222,0.002346729,0.00016022722,0.000104239865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025502947,0.00011764897,0.000114617724,0.00008716241,0.000485984,0.00022383267,0.0028040935,0.00005430289,0.00028365751],"category_scores_gemma":[0.000024223968,0.00011567111,0.00011538487,0.00048209104,0.0002820485,0.00064600416,0.00088568474,0.00022213363,0.00045644658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015443011,0.0001181495,0.0017123534,0.0000020671812,0.000021641095,2.4454272e-7,0.00017499429,0.000014116297,0.00097318063,0.9795178,0.0130892275,0.0043746647],"study_design_scores_gemma":[0.0007664999,0.00008037631,0.04279054,0.00004097506,0.000021603182,0.00003627544,0.00006307529,0.025891844,0.00035300487,0.54142636,0.38794675,0.00058266206],"about_ca_topic_score_codex":0.000072675815,"about_ca_topic_score_gemma":0.0000428464,"teacher_disagreement_score":0.84289026,"about_ca_system_score_codex":0.000019447616,"about_ca_system_score_gemma":0.00006891674,"threshold_uncertainty_score":0.58668494},"labels":[],"label_agreement":null},{"id":"W2074276474","doi":"10.1049/iet-com.2007.0325","title":"Multi-scale analysis of generalised processor sharing queues with long-range-dependent traffic inputs and variable service rates","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fork–join queue; Queue; Computer science; Multilevel queue; Bulk queue; Queueing theory; Processor sharing; Decoupling (probability); Queue management system; Set (abstract data type); Variable (mathematics); Real-time computing; Mathematics; Computer network; Engineering","score_opus":0.027378764422282934,"score_gpt":0.2780058607325195,"score_spread":0.25062709631023655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074276474","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.98392504,0.0006887827,0.010197294,0.003372967,0.000012980373,0.00029672188,0.000013837564,0.00021880149,0.001273565],"genre_scores_gemma":[0.98366934,0.000075445016,0.014811267,0.0010640655,0.000030531664,0.00003052406,0.00014727733,0.000017475806,0.00015409669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906236,0.00003106304,0.0003115723,0.00026786554,0.00015215433,0.00017500776],"domain_scores_gemma":[0.9979983,0.00007828921,0.00031428837,0.0011893869,0.0004023322,0.000017423148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035924691,0.00016200749,0.00034395908,0.0004274661,0.00031552045,0.000157068,0.0008014175,0.00004984191,0.000041006453],"category_scores_gemma":[0.00004715561,0.00014623268,0.00005978352,0.0024972265,0.000079832054,0.0007838856,0.00023739318,0.00013449963,0.000006710922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022501622,0.0017431197,0.10975832,0.00042042448,0.0028459555,0.0000040537093,0.0023801448,0.85636,0.011779336,0.011212423,0.0000639685,0.003207212],"study_design_scores_gemma":[0.00073986745,0.000013514643,0.027825434,0.00010434908,0.0030257148,0.0000010047181,0.00038797138,0.96594065,0.00016824238,0.0010137246,0.00043974258,0.0003397958],"about_ca_topic_score_codex":0.00038502738,"about_ca_topic_score_gemma":0.0063911537,"teacher_disagreement_score":0.10958061,"about_ca_system_score_codex":0.000020778993,"about_ca_system_score_gemma":0.000014554445,"threshold_uncertainty_score":0.59631956},"labels":[],"label_agreement":null},{"id":"W2076989091","doi":"10.1049/iet-com.2013.0287","title":"Dual‐hop amplify‐and‐forward cooperative relaying in the presence of Tx and Rx in‐phase and quadrature‐phase imbalance","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Rayleigh fading; Computer science; Quadrature (astronomy); Hop (telecommunications); Control theory (sociology); Outage probability; Channel state information; Compensation (psychology); Benchmark (surveying); Transmission (telecommunications); Fading; Channel (broadcasting); Telecommunications; Wireless; Electronic engineering; Physics; Engineering","score_opus":0.04402422241974788,"score_gpt":0.3435526511375032,"score_spread":0.2995284287177553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076989091","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.83578515,0.0248243,0.08590142,0.043862615,0.000117357245,0.0015540079,0.00003454832,0.00012149055,0.007799106],"genre_scores_gemma":[0.98354554,0.008754854,0.007080101,0.0004996249,0.000008284576,0.00007087269,0.000010887376,0.000005433402,0.000024428718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981585,0.000974071,0.0003494186,0.0002347778,0.00012058246,0.00016263271],"domain_scores_gemma":[0.9961651,0.0017026553,0.00012507316,0.0018421236,0.00010999322,0.000055047385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012182902,0.00012689436,0.00021578411,0.00011342405,0.00034832727,0.00015291708,0.0012781167,0.00005816269,0.0000021041856],"category_scores_gemma":[0.0003955692,0.00010315223,0.00001631684,0.0006199615,0.00037271946,0.00039578087,0.001085955,0.00046305513,0.0000011970217],"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.000038845697,0.00082382944,0.0061385683,0.000038803068,0.000025649038,0.0000031336904,0.053767957,0.00013430967,0.005705933,0.8373413,0.0007310232,0.09525062],"study_design_scores_gemma":[0.008036425,0.0007013683,0.040677954,0.0006923684,0.000030134534,0.00010629593,0.0036964905,0.87831783,0.0005273061,0.0081534395,0.058241826,0.0008185627],"about_ca_topic_score_codex":0.000042828156,"about_ca_topic_score_gemma":0.0007012037,"teacher_disagreement_score":0.87818354,"about_ca_system_score_codex":0.000015389365,"about_ca_system_score_gemma":0.000038331676,"threshold_uncertainty_score":0.4206426},"labels":[],"label_agreement":null},{"id":"W2080822912","doi":"10.1049/iet-com:20050589","title":"New concatenated coding and space–time modulation scheme for MIMO wireless communications","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; MIMO; Diversity gain; Coding gain; Multiplexing; Spatial multiplexing; Coding (social sciences); Space–time code; Modulation (music); Wireless; Algorithm; Decoding methods; Electronic engineering; Computer network; Telecommunications; Mathematics; Channel (broadcasting); Engineering","score_opus":0.0325588888763444,"score_gpt":0.30308745163515294,"score_spread":0.27052856275880854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080822912","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.011227094,0.00337052,0.96701765,0.004398538,0.000074109994,0.0013289752,0.00006858851,0.002484298,0.01003022],"genre_scores_gemma":[0.6328231,0.0026005448,0.36377075,0.000056737008,0.000021111626,0.00012282623,0.00030244308,0.00006249729,0.00023995206],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870896,0.0000729385,0.00055532623,0.00019596839,0.00012988411,0.00033689023],"domain_scores_gemma":[0.9942654,0.0010757776,0.00014709657,0.004115882,0.00022206569,0.00017377158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005244418,0.0002406705,0.00028032783,0.00022876827,0.0005703771,0.00007452341,0.0018442355,0.00018024111,0.000015278305],"category_scores_gemma":[0.000098175,0.00029337464,0.000073166055,0.0004732878,0.00027197474,0.00040569986,0.0005855398,0.00040861047,0.000025138257],"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.000049442966,0.00024297136,0.0016298908,0.00015441286,0.00030833078,5.840405e-7,0.0026432737,0.0011066073,0.41171184,0.34887755,0.013498992,0.21977611],"study_design_scores_gemma":[0.0011583319,0.000050672894,0.0034176195,0.00019045308,0.000060498125,0.0000136914105,0.0003688171,0.838833,0.020817857,0.009722735,0.124564186,0.0008021527],"about_ca_topic_score_codex":0.00005548408,"about_ca_topic_score_gemma":0.00017740564,"teacher_disagreement_score":0.83772635,"about_ca_system_score_codex":0.00016777038,"about_ca_system_score_gemma":0.00003708502,"threshold_uncertainty_score":0.99995184},"labels":[],"label_agreement":null},{"id":"W2082018198","doi":"10.1049/iet-com.2013.1145","title":"Spectrum‐sharing broadcast channels using fountain codes: energy, delay and throughput","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Fountain code; Throughput; Fountain; Computer science; Computer network; Telecommunications; Decoding methods; Wireless; Low-density parity-check code; Error floor","score_opus":0.07419073768560554,"score_gpt":0.31534483794888885,"score_spread":0.24115410026328332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082018198","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.0048688413,0.0030532894,0.97633785,0.0048619653,0.0001512769,0.00012907549,0.0000021840506,0.00023796693,0.010357557],"genre_scores_gemma":[0.9273436,0.0036624188,0.0677961,0.0008616585,0.000067312205,0.00002732627,0.000012868145,0.000016478767,0.00021220406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985869,0.00035032938,0.0003062668,0.0003363674,0.00014281187,0.0002773377],"domain_scores_gemma":[0.99562585,0.00036871523,0.00013130545,0.0036504704,0.00011231999,0.00011133699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057701307,0.00017325535,0.00020406714,0.00011891088,0.0010484305,0.00041277095,0.0031349943,0.00006222514,0.0000141449145],"category_scores_gemma":[0.00006412975,0.00018242384,0.000052586198,0.00052626734,0.00019164309,0.00053637003,0.0032502871,0.00025050147,0.000014900898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021221445,0.000072476425,0.00049617066,0.0000049818736,0.000028853796,5.013848e-7,0.0015928907,0.0007052404,0.00060123776,0.94851655,0.0002585663,0.047720414],"study_design_scores_gemma":[0.00024049544,0.000030061323,0.0002728568,0.00006452484,0.000009814305,0.00003446023,0.00004955151,0.8836791,0.00020131539,0.008767349,0.10640837,0.00024210605],"about_ca_topic_score_codex":0.00018807936,"about_ca_topic_score_gemma":0.00056904403,"teacher_disagreement_score":0.9397492,"about_ca_system_score_codex":0.00007451445,"about_ca_system_score_gemma":0.000043150725,"threshold_uncertainty_score":0.80637854},"labels":[],"label_agreement":null},{"id":"W2083520783","doi":"10.1049/iet-com.2014.0012","title":"Self‐optimising intelligent distributed antenna system for geographic load balancing","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Load balancing (electrical power); Antenna (radio); Telecommunications; Distributed computing; Geology; Geodesy","score_opus":0.03376056056352272,"score_gpt":0.29738399744973115,"score_spread":0.26362343688620843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083520783","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.0006708466,0.0012230722,0.98960555,0.0050656297,0.00015251998,0.00059669296,0.000022177837,0.000831435,0.0018320826],"genre_scores_gemma":[0.766706,0.0005056316,0.2322704,0.000088364104,0.00003841898,0.00025295306,0.00009668161,0.000019431971,0.00002209461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976068,0.0006211368,0.00052159367,0.00036337625,0.0003976115,0.00048945023],"domain_scores_gemma":[0.9901601,0.001684236,0.00021507077,0.006962517,0.00079831755,0.00017973453],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0018393468,0.00018922858,0.00026497297,0.00017624695,0.00105459,0.00041862333,0.007289231,0.00010437543,0.0000020063512],"category_scores_gemma":[0.0002653971,0.00019473654,0.0001577347,0.0010091556,0.00015356031,0.00037659775,0.0021890367,0.00041178535,0.00004121494],"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.000024212786,0.00084404554,0.0032701264,0.00040169543,0.00030510454,0.0000013618973,0.0028940293,0.0050744987,0.0012013395,0.9127574,0.0029513375,0.070274875],"study_design_scores_gemma":[0.00027147064,0.00004112289,0.00066155114,0.00013823059,0.000013111587,0.000010979473,0.00014029082,0.9395221,0.00014929658,0.000732832,0.058108676,0.00021035872],"about_ca_topic_score_codex":0.0000832088,"about_ca_topic_score_gemma":0.0000939252,"teacher_disagreement_score":0.9344476,"about_ca_system_score_codex":0.00032151348,"about_ca_system_score_gemma":0.00015920642,"threshold_uncertainty_score":0.9980818},"labels":[],"label_agreement":null},{"id":"W2083923465","doi":"10.1049/iet-com:20060082","title":"Limited-perimeter vector matching fault-localisation protocol for transparent all-optical communication networks[Note 1]","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Distributed computing; Flooding (psychology); Protocol (science); Computer network; Fault detection and isolation","score_opus":0.06481629986884274,"score_gpt":0.35524009051659927,"score_spread":0.29042379064775653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083923465","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.0005960143,0.00020871442,0.96210814,0.0012477019,0.00007280901,0.031777464,0.000013489301,0.0016194539,0.0023562138],"genre_scores_gemma":[0.47511125,0.00012108596,0.44699615,0.00013035553,0.00005872474,0.07732414,0.00016582405,0.00007808444,0.000014384309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845535,0.000058714362,0.0006213525,0.00020715655,0.00016387684,0.00049352867],"domain_scores_gemma":[0.9961678,0.0012318464,0.00008259482,0.0022903923,0.000122025966,0.00010537916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050283555,0.00025450595,0.00025246863,0.000108217566,0.0003118144,0.00007137607,0.0012990071,0.00026844617,0.000011533975],"category_scores_gemma":[0.000114164985,0.00026369307,0.000116618685,0.00033671636,0.00026951678,0.000279859,0.00020017348,0.0006248572,0.000016941674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022514533,0.00057794864,0.00015510325,0.00022458195,0.0002440227,0.0000016781632,0.0013553533,0.7013863,0.008052263,0.12717009,0.0029264905,0.15768106],"study_design_scores_gemma":[0.0013436204,0.0001379225,0.0013639439,0.00022198391,0.00007783655,0.00000763712,0.0003022345,0.8272741,0.0029880148,0.011889038,0.15367398,0.0007196838],"about_ca_topic_score_codex":0.0000073389056,"about_ca_topic_score_gemma":0.0001693625,"teacher_disagreement_score":0.515112,"about_ca_system_score_codex":0.00022222124,"about_ca_system_score_gemma":0.000012757281,"threshold_uncertainty_score":0.9999815},"labels":[],"label_agreement":null},{"id":"W2086735640","doi":"10.1049/iet-com.2010.0510","title":"Approach for cluster-based spectrum sensing over band-limited reporting channels","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cognitive radio; Computer science; Fusion center; Bandwidth (computing); Cluster analysis; Base station; False alarm; Computer network; Channel (broadcasting); Cluster (spacecraft); Throughput; Data mining; Set (abstract data type); Real-time computing; Algorithm; Wireless; Telecommunications; Artificial intelligence","score_opus":0.06718930769435565,"score_gpt":0.30583090460004236,"score_spread":0.2386415969056867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086735640","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.0015822601,0.00020897668,0.9913318,0.002232623,0.0004621772,0.00036114536,0.000011606109,0.0003309094,0.0034784577],"genre_scores_gemma":[0.69693136,0.000008106497,0.30221957,0.0004577587,0.00015857571,0.000028785349,0.000095543306,0.000013276914,0.000087026405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847025,0.00013525544,0.00057352014,0.00023150146,0.00016415998,0.00042529704],"domain_scores_gemma":[0.9966698,0.0003468477,0.0005596663,0.002166741,0.0001151249,0.00014179137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009231759,0.00014055533,0.000187467,0.000102174825,0.00059479533,0.000224251,0.00083989574,0.00008694181,0.0000043219816],"category_scores_gemma":[0.00021825939,0.0001419071,0.00013971498,0.0005580186,0.00006246502,0.00036821145,0.00024995988,0.00021575297,0.000007413156],"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.00023226015,0.008071325,0.009192776,0.0004211475,0.0010575508,0.000009754668,0.0125097325,0.23664343,0.0064564906,0.21377566,0.1166469,0.39498296],"study_design_scores_gemma":[0.0003457789,0.000025182115,0.0004338502,0.000013884985,0.000014054058,0.000024244542,0.000049792405,0.96779513,0.0009152656,0.0004544371,0.029738367,0.00019002488],"about_ca_topic_score_codex":0.00003163231,"about_ca_topic_score_gemma":0.0000058896726,"teacher_disagreement_score":0.7311517,"about_ca_system_score_codex":0.00006353461,"about_ca_system_score_gemma":0.00003792586,"threshold_uncertainty_score":0.5786804},"labels":[],"label_agreement":null},{"id":"W2087916991","doi":"10.1049/iet-com.2013.0480","title":"Goodput improvement for multipath transport control protocol in cooperative relay‐based wireless networks","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Goodput; Computer network; Computer science; Relay; Wireless; Multipath propagation; Protocol (science); Wireless network; Telecommunications; Throughput; Channel (broadcasting)","score_opus":0.035705890866737686,"score_gpt":0.3142749174386619,"score_spread":0.2785690265719242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087916991","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.00049844896,0.00005609874,0.96131384,0.0049865595,0.00006502634,0.03148838,0.000009881286,0.00017243632,0.0014093304],"genre_scores_gemma":[0.84959483,0.000046936217,0.031174242,0.0012972632,0.000030564726,0.11771706,0.0000439499,0.000019821144,0.00007533285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797684,0.00053848233,0.0006081597,0.00037911427,0.00013888798,0.00035853984],"domain_scores_gemma":[0.9950605,0.00096906663,0.00020081109,0.0032887126,0.00037108472,0.00010981543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011354435,0.00022728529,0.00031648582,0.00012348082,0.00057284767,0.00010947836,0.0031673897,0.0001014298,0.000009154238],"category_scores_gemma":[0.00008563097,0.00022111577,0.00011166342,0.00058549904,0.00014352088,0.0003134996,0.00029224303,0.00041474792,0.000007312846],"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.00023482212,0.0027548482,0.007436493,0.000086110784,0.000120286815,0.000001243531,0.0030500225,0.14532052,0.0038416428,0.5115511,0.0016993976,0.3239035],"study_design_scores_gemma":[0.0035738605,0.00021746951,0.0020423534,0.00008292914,0.000007460465,5.066308e-7,0.000021761341,0.9477685,0.000227921,0.00014124466,0.045659445,0.00025651365],"about_ca_topic_score_codex":0.000026039455,"about_ca_topic_score_gemma":0.0010315363,"teacher_disagreement_score":0.9301396,"about_ca_system_score_codex":0.00011493624,"about_ca_system_score_gemma":0.00015381935,"threshold_uncertainty_score":0.9016839},"labels":[],"label_agreement":null},{"id":"W2088295822","doi":"10.1049/iet-com:20060700","title":"DC-free trellis-based error-control codes","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convolutional code; Turbo code; Serial concatenated convolutional codes; Concatenated error correction code; Computer science; Puncturing; Algorithm; Linear code; Sequential decoding; Block code; BCJR algorithm; Decoding methods; Telecommunications","score_opus":0.023882859175976188,"score_gpt":0.29581010245941086,"score_spread":0.27192724328343465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088295822","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.0033281117,0.003457236,0.93671995,0.0025293643,0.000084182735,0.00046586315,0.00008585337,0.0033980634,0.04993139],"genre_scores_gemma":[0.8605662,0.0005570181,0.1382561,0.00026795568,0.00002083767,0.00012367911,0.0000773057,0.000056775785,0.00007413874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989097,0.00008229293,0.0004249395,0.00012864183,0.00015631467,0.00029808626],"domain_scores_gemma":[0.9929592,0.00078755507,0.00007616586,0.005955916,0.00011964786,0.00010148928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043884118,0.00018731852,0.00020914114,0.00018555237,0.0002578968,0.000032231153,0.0028853125,0.00012180779,0.000039259143],"category_scores_gemma":[0.00011295246,0.00021423314,0.00009211797,0.00038783622,0.00022003704,0.00018086335,0.00021094426,0.00045506994,0.00006390201],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017989801,0.0020000571,0.009285604,0.00031579303,0.0006612386,0.000015004147,0.0032833945,0.1857046,0.13192508,0.3187427,0.06713575,0.2807509],"study_design_scores_gemma":[0.0028704621,0.00009967504,0.008379742,0.00019883357,0.000104820545,0.00001141212,0.0004534933,0.3341255,0.07330098,0.019785173,0.5592588,0.001411118],"about_ca_topic_score_codex":0.0000310096,"about_ca_topic_score_gemma":0.00050391565,"teacher_disagreement_score":0.85723805,"about_ca_system_score_codex":0.00013576914,"about_ca_system_score_gemma":0.000024324341,"threshold_uncertainty_score":0.87361735},"labels":[],"label_agreement":null},{"id":"W2088715268","doi":"10.1049/iet-com.2011.0247","title":"Max–min fairness aware joint power, subcarrier allocation and relay assignment in multicast cognitive radio","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multicast; Subcarrier; Cognitive radio; Computer science; Relay; Computational complexity theory; Mathematical optimization; Computer network; Joint (building); Power (physics); Orthogonal frequency-division multiplexing; Algorithm; Wireless; Telecommunications; Mathematics; Engineering","score_opus":0.06951371755344149,"score_gpt":0.3130153817572423,"score_spread":0.24350166420380082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088715268","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.10321607,0.016501546,0.8386556,0.027224869,0.0005038573,0.001670836,0.000025468764,0.00041581065,0.01178597],"genre_scores_gemma":[0.98630035,0.002302754,0.010625728,0.00037281605,0.000017984661,0.00018627661,0.00003782117,0.000014110177,0.00014215172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99822533,0.0006489892,0.0003831922,0.00024365245,0.00018432015,0.0003144983],"domain_scores_gemma":[0.9970734,0.0004890341,0.00013007801,0.0019524102,0.00019123219,0.000163821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008490639,0.00016914445,0.0001970916,0.00016128726,0.00042104724,0.00013327353,0.0012134326,0.00007926296,0.00002917417],"category_scores_gemma":[0.00016860684,0.00017407954,0.000042985113,0.00055890926,0.00019292954,0.0007705888,0.0013609359,0.0003863132,0.00004718332],"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.00003671809,0.002781414,0.072335705,0.000045669593,0.00019018857,0.0000052879664,0.08003176,0.00024464965,0.005867352,0.5917467,0.0025517235,0.24416286],"study_design_scores_gemma":[0.0042923125,0.00023572291,0.6623574,0.00084351975,0.000079792124,0.000105477855,0.007087353,0.25854316,0.0028528234,0.0012644682,0.060442608,0.0018953959],"about_ca_topic_score_codex":0.000025302523,"about_ca_topic_score_gemma":0.00015387447,"teacher_disagreement_score":0.8830843,"about_ca_system_score_codex":0.0001442334,"about_ca_system_score_gemma":0.00006496407,"threshold_uncertainty_score":0.70987576},"labels":[],"label_agreement":null},{"id":"W2089955911","doi":"10.1049/iet-com.2013.0119","title":"Decode and forward relaying for energy‐efficient multiuser cooperative cognitive radio network with outage constraints","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Mathematical optimization; Fractional programming; Telecommunications link; Convergence (economics); Interference (communication); Iterative method; Convex optimization; Constraint (computer-aided design); Power (physics); Telecommunications; Wireless; Nonlinear programming; Algorithm; Regular polygon; Mathematics; Nonlinear system; Channel (broadcasting)","score_opus":0.033484063423222195,"score_gpt":0.28444135291543954,"score_spread":0.25095728949221735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089955911","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.0031696982,0.001327563,0.98616946,0.0026601942,0.000072294206,0.0004906535,0.000014983363,0.00016448855,0.0059306948],"genre_scores_gemma":[0.86988586,0.0007593666,0.12796748,0.0008757971,0.000037410882,0.00029524363,0.000044887947,0.00001957044,0.00011440054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833065,0.0004912562,0.00032020974,0.0003785935,0.0001408162,0.00033845982],"domain_scores_gemma":[0.995258,0.002203085,0.00016769014,0.0017207013,0.00050187594,0.00014866542],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006724555,0.00021620732,0.0002686305,0.00007782044,0.0013283858,0.00024605286,0.0014333931,0.00006924449,0.000008382897],"category_scores_gemma":[0.0002358621,0.00019201175,0.000056555953,0.00043677608,0.00054558186,0.000244886,0.0008678083,0.00024869404,0.0000067051915],"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.000038716036,0.00019727458,0.0009072882,0.000010106206,0.00014464783,6.819398e-7,0.0037246696,0.0061021885,0.00015510507,0.8463002,0.0010839289,0.14133523],"study_design_scores_gemma":[0.001673158,0.0001927388,0.0010945178,0.00021149236,0.000042226937,0.000020074913,0.00031878444,0.9580772,0.00017445497,0.00084545044,0.03693189,0.00041801803],"about_ca_topic_score_codex":0.000007965408,"about_ca_topic_score_gemma":0.00030540687,"teacher_disagreement_score":0.951975,"about_ca_system_score_codex":0.000045710058,"about_ca_system_score_gemma":0.00009165671,"threshold_uncertainty_score":0.99997175},"labels":[],"label_agreement":null},{"id":"W2090515627","doi":"10.1049/iet-com:20070546","title":"Mobility model for heterogeneous wireless networks and its application in common radio resource management","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Macrocell; Microcell; Computer science; Computer network; Wireless network; Mobility model; Heterogeneous network; Roaming; Mobility management; Radio resource management; Hotspot (geology); Wireless; Wireless WAN; Wi-Fi; Distributed computing; Base station; Telecommunications; Wi-Fi array","score_opus":0.05750960037065371,"score_gpt":0.3102521886297768,"score_spread":0.2527425882591231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090515627","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.04710485,0.0036905447,0.9419978,0.0036743435,0.000019791938,0.0020614446,0.000009481546,0.00023019854,0.0012115076],"genre_scores_gemma":[0.9645029,0.0046602204,0.028691843,0.00018781029,0.000012970379,0.0017064611,0.000064252636,0.000022365643,0.00015121124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980676,0.00037568485,0.0004924452,0.0004432854,0.00023731664,0.00038364812],"domain_scores_gemma":[0.99404764,0.00060606585,0.00014110975,0.00494379,0.00013287018,0.00012850072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079422997,0.00017401324,0.00025613204,0.00017172958,0.0007021942,0.00007315698,0.0043809605,0.00011486908,6.213843e-7],"category_scores_gemma":[0.0000137141205,0.00019853168,0.000064555934,0.0006689671,0.00021585844,0.00029884794,0.0023875076,0.00039590828,0.0000051082484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004877137,0.0009893132,0.0022810493,0.000073458315,0.00006188555,0.0000033532176,0.0020702188,0.69151306,0.00009326745,0.21269003,0.0009901465,0.08918545],"study_design_scores_gemma":[0.00045252845,0.00002003269,0.0019930613,0.000023860106,0.000004684657,0.000016934346,0.000023313765,0.9925688,0.00002708584,0.002047132,0.0026407081,0.00018189743],"about_ca_topic_score_codex":0.00003615823,"about_ca_topic_score_gemma":0.00034344886,"teacher_disagreement_score":0.91739804,"about_ca_system_score_codex":0.00014854976,"about_ca_system_score_gemma":0.00004304924,"threshold_uncertainty_score":0.8140988},"labels":[],"label_agreement":null},{"id":"W2090732764","doi":"10.1049/iet-com.2012.0629","title":"Optimal diversity multiplexing tradeoff for opportunistic relaying coded cooperation protocols with quantised channel state information feedback","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Channel state information; Multiplexing; Computer network; Channel (broadcasting); Diversity (politics); State (computer science); Telecommunications; Wireless; Algorithm; Political science","score_opus":0.10915180154350315,"score_gpt":0.31326375187923905,"score_spread":0.2041119503357359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090732764","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.0013510427,0.000019640334,0.98788357,0.0032929075,0.000046733123,0.0055194693,0.000030342091,0.00028549353,0.001570785],"genre_scores_gemma":[0.8259095,0.00010859456,0.16994804,0.0005055309,0.000016797247,0.0031164668,0.0002840866,0.000013212615,0.000097760814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984732,0.00034954812,0.00044675975,0.00022890508,0.00021984844,0.00028172386],"domain_scores_gemma":[0.99620134,0.00052508566,0.00031334918,0.002226605,0.0006075953,0.00012601672],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00085629715,0.0001934325,0.00022418969,0.00013948555,0.0023660397,0.0004306391,0.0024382279,0.00006126742,0.0000057503526],"category_scores_gemma":[0.00022032055,0.00018741867,0.00006131746,0.00047616227,0.0001435885,0.0017019125,0.0013337409,0.0002652411,0.000021266305],"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.00032203356,0.00076221686,0.0010717086,0.0001904255,0.00020378412,8.970145e-7,0.03407344,0.04650372,0.0022305653,0.7827265,0.0039006432,0.12801404],"study_design_scores_gemma":[0.0015701681,0.00020620004,0.000797408,0.00012188453,0.000011939892,0.0000047663493,0.00012768937,0.9753521,0.00019686119,0.0003993763,0.020916179,0.0002953908],"about_ca_topic_score_codex":0.00001767914,"about_ca_topic_score_gemma":0.00011855766,"teacher_disagreement_score":0.92884845,"about_ca_system_score_codex":0.00008927048,"about_ca_system_score_gemma":0.00012317726,"threshold_uncertainty_score":0.9989327},"labels":[],"label_agreement":null},{"id":"W2093444982","doi":"10.1049/iet-com.2012.0234","title":"Bit‐error‐rate performance improvement of mobile dual‐hop relaying systems using directional antennas","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Plan for Science, Technology and Innovation; Natural Sciences and Engineering Research Council of Canada; King Saud University","keywords":"Beamwidth; Bit error rate; Computer science; Orthogonal frequency-division multiplexing; Relay; Electronic engineering; Doppler effect; Antenna (radio); Telecommunications; Physics; Engineering; Decoding methods","score_opus":0.07334655323374006,"score_gpt":0.3047961387594709,"score_spread":0.23144958552573086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093444982","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.85139436,0.007168946,0.12687698,0.0023091713,0.0008202115,0.0017031597,0.000012513833,0.00042815975,0.009286483],"genre_scores_gemma":[0.9773356,0.0026642592,0.019176317,0.00012398452,0.000026958456,0.00030825607,0.000013151454,0.00001331624,0.00033816727],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849474,0.0002878231,0.00055491674,0.00022910455,0.00019785645,0.00023557326],"domain_scores_gemma":[0.99578637,0.0002925639,0.00030384245,0.0029496474,0.0005871678,0.00008039782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006236581,0.00015260882,0.0002185494,0.00015557543,0.000739982,0.00017675945,0.0019702946,0.000054725293,0.000035109617],"category_scores_gemma":[0.000042381685,0.00014933037,0.00007057256,0.00074231706,0.00015468634,0.0008178355,0.0015105663,0.00027579264,0.000057800353],"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.00001274014,0.0013870611,0.008560384,0.00020378528,0.000372741,9.943316e-7,0.009736456,0.033221997,0.68177515,0.09019832,0.0036435686,0.17088678],"study_design_scores_gemma":[0.00025498736,0.00009222585,0.0038384805,0.0001826433,0.000011963488,0.000010874347,0.00037858717,0.98391104,0.0023283556,0.00010490603,0.008639708,0.00024624178],"about_ca_topic_score_codex":0.00017914968,"about_ca_topic_score_gemma":0.00002479866,"teacher_disagreement_score":0.950689,"about_ca_system_score_codex":0.00011106026,"about_ca_system_score_gemma":0.00010918286,"threshold_uncertainty_score":0.60895157},"labels":[],"label_agreement":null},{"id":"W2094179064","doi":"10.1049/iet-com.2011.0834","title":"Performance analysis of a chaos shift keying system with polarisation sensitivity under multipath channel","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Medical Research Council","keywords":"Rake receiver; Computer science; Multipath propagation; Antenna diversity; Demodulation; Antenna (radio); Keying; Electronic engineering; Channel (broadcasting); Delay spread; Communications system; Bit error rate; Spread spectrum; SIGNAL (programming language); Telecommunications; Algorithm; Engineering","score_opus":0.021342179656283797,"score_gpt":0.24553798822145054,"score_spread":0.22419580856516674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094179064","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.69852686,0.00008610282,0.29856363,0.00017786196,0.000030550098,0.00019223827,0.000084706764,0.000038402788,0.0022996408],"genre_scores_gemma":[0.9984921,0.000003783758,0.0010239423,0.000011575781,0.00005644561,0.000032738244,0.00035443692,0.000009866926,0.000015096352],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993138,0.00013512539,0.00019497276,0.00008796956,0.00011374585,0.00015440471],"domain_scores_gemma":[0.9987677,0.00011343285,0.00018896519,0.0007733546,0.00010809737,0.000048487404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028393895,0.00009356475,0.00020487847,0.00012940183,0.00024098589,0.000017284152,0.00014367004,0.0000276796,0.000013983593],"category_scores_gemma":[0.000002878823,0.00008284311,0.00007458799,0.0005218837,0.00005352127,0.00026125435,0.00007292352,0.00009981661,0.0000072310027],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001613253,0.00036943637,0.92081934,0.00003373825,0.0011150852,3.8879563e-8,0.008180432,0.022735681,0.00082005805,0.04290453,0.0000044514704,0.0030010587],"study_design_scores_gemma":[0.00024056944,0.000010389323,0.50051534,0.00002910969,0.00041163716,2.8924e-7,0.0013699334,0.49715024,0.00013926129,0.000013011316,0.000025513284,0.00009469088],"about_ca_topic_score_codex":0.0010163686,"about_ca_topic_score_gemma":0.0001974081,"teacher_disagreement_score":0.47441456,"about_ca_system_score_codex":0.000046441248,"about_ca_system_score_gemma":0.00002921008,"threshold_uncertainty_score":0.33782437},"labels":[],"label_agreement":null},{"id":"W2094769547","doi":"10.1049/iet-com.2009.0782","title":"Performance analysis of directional CSMA/CA in the presence of deafness","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Beamwidth; Computer science; Directional antenna; Transmitter; Computer network; Wireless ad hoc network; Carrier sense multiple access with collision avoidance; Reuse; Wireless; Offset (computer science); Throughput; Telecommunications; Antenna (radio); Channel (broadcasting); Engineering","score_opus":0.028468799486173816,"score_gpt":0.30656559535523537,"score_spread":0.27809679586906155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094769547","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.9318421,0.0001877137,0.03864105,0.0044970457,0.00017999265,0.002518096,0.00002582541,0.000050010865,0.02205816],"genre_scores_gemma":[0.9869206,0.000048795133,0.012405724,0.000029609977,0.000007693426,0.00056014565,0.0000060998577,0.0000015728857,0.000019750492],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931216,0.00014042377,0.0002224592,0.00008838588,0.00015603448,0.00008055482],"domain_scores_gemma":[0.9970674,0.0006031889,0.00012358467,0.0020821914,0.000109166154,0.000014461114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005885709,0.000045229343,0.00011969879,0.00012381874,0.00010251215,0.000022412934,0.0028333953,0.00003247931,0.00001546252],"category_scores_gemma":[0.00003427117,0.00003398826,0.000057906636,0.0016374975,0.00014457948,0.00017296524,0.00030084146,0.00020658459,0.0000016928013],"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.000019696441,0.0012119577,0.4914803,0.000058591286,0.00032384627,4.8573287e-7,0.009273745,0.027243316,0.0050791316,0.37642705,0.0010764652,0.087805405],"study_design_scores_gemma":[0.00006730623,0.000016678923,0.43178913,0.000015640935,0.000022069173,0.0000010282001,0.000027358004,0.5631858,0.0003392673,0.00049243064,0.003993173,0.00005013254],"about_ca_topic_score_codex":0.00017621276,"about_ca_topic_score_gemma":0.0009211999,"teacher_disagreement_score":0.5359425,"about_ca_system_score_codex":0.000003828733,"about_ca_system_score_gemma":0.000043247805,"threshold_uncertainty_score":0.5265201},"labels":[],"label_agreement":null},{"id":"W2096748500","doi":"10.1049/iet-com.2011.0885","title":"Ultra-wideband pulse shaping: bypassing the inherent limitations of the Gaussian monocycle","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Ultra-wideband; Computer science; Time domain; Pulse (music); Telecommunications; Electronic engineering; Antenna (radio); Vivaldi antenna; Pulse shaping; Band-pass filter; Power (physics); Physics; Engineering; Radiation pattern; Detector","score_opus":0.1029430400698168,"score_gpt":0.2725995525440849,"score_spread":0.1696565124742681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096748500","genre_codex":"other","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.3588318,0.061975773,0.03125357,0.101378225,0.001538305,0.003661572,0.00017791949,0.0027899833,0.43839285],"genre_scores_gemma":[0.9948897,0.0019537818,0.002610071,0.00013468243,0.000023210938,0.00024429942,0.000019827974,0.000035311998,0.00008911954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988593,0.00020314484,0.00041372728,0.000085698885,0.00013903908,0.0002990908],"domain_scores_gemma":[0.99437106,0.0009477424,0.000115244715,0.0044322023,0.000075960335,0.000057803554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027030418,0.0001547922,0.0001571338,0.00008796246,0.0006704891,0.000039535913,0.0026792886,0.00011045377,0.000025897947],"category_scores_gemma":[0.0002575761,0.00010840444,0.00011814654,0.0006490957,0.00050097203,0.00022371188,0.00028583052,0.0005667024,0.000034482953],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014589472,0.0019627213,0.05374623,0.000118845295,0.0010369736,2.3094242e-7,0.03604836,0.01283139,0.19649686,0.44935942,0.023510035,0.22487433],"study_design_scores_gemma":[0.0011156969,0.00005862483,0.16006213,0.00034398396,0.0005009501,0.0000788059,0.009365997,0.016761255,0.07051618,0.013899334,0.7261099,0.0011871407],"about_ca_topic_score_codex":0.0000684389,"about_ca_topic_score_gemma":0.00038427662,"teacher_disagreement_score":0.7025999,"about_ca_system_score_codex":0.00008597179,"about_ca_system_score_gemma":0.000033168035,"threshold_uncertainty_score":0.5156928},"labels":[],"label_agreement":null},{"id":"W2098510757","doi":"10.1049/iet-com.2008.0297","title":"Compact Rayleigh and Rician fading simulator based on random walk processes","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rician fading; Multipath propagation; Fading; Computer science; Rayleigh fading; MIMO; Field-programmable gate array; Fading distribution; Wireless; Algorithm; Channel state information; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering; Embedded system","score_opus":0.019818851910891475,"score_gpt":0.28425340090456425,"score_spread":0.26443454899367275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098510757","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.093249515,0.027601294,0.565233,0.026631486,0.00023132443,0.0043920795,0.00020127972,0.016750298,0.26570973],"genre_scores_gemma":[0.9817631,0.0015807122,0.016117703,0.00039043877,0.000012519178,0.000035589972,0.00004625464,0.000029968709,0.000023685674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992464,0.000078861834,0.00025812935,0.00012328409,0.0001153106,0.00017800255],"domain_scores_gemma":[0.99709016,0.0007427167,0.000059032107,0.0019411577,0.00008863224,0.00007829033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013632305,0.00017230543,0.00021401753,0.0001507233,0.00029450364,0.000055363405,0.0008430681,0.00007042899,0.000010486768],"category_scores_gemma":[0.00013645281,0.00017916293,0.00003772994,0.00036875016,0.00009363054,0.00019436932,0.000051502513,0.00031712398,0.0000110523715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016389618,0.0010929315,0.0021435253,0.00031695556,0.00012961899,0.0000033308618,0.0029759237,0.78957355,0.016180977,0.025253315,0.0059533543,0.15621264],"study_design_scores_gemma":[0.0017332169,0.00013224511,0.0039111837,0.0003588893,0.0000346425,0.000003710703,0.0001244736,0.90803355,0.0135053145,0.0052211205,0.06631198,0.0006296491],"about_ca_topic_score_codex":0.000006086614,"about_ca_topic_score_gemma":0.000015421798,"teacher_disagreement_score":0.8885136,"about_ca_system_score_codex":0.000071692826,"about_ca_system_score_gemma":0.000023440196,"threshold_uncertainty_score":0.73060524},"labels":[],"label_agreement":null},{"id":"W2099843372","doi":"10.1049/iet-com:20060201","title":"Pairwise error probability of space–time codes for a keyhole channel","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Keyhole; Pairwise error probability; Pairwise comparison; Channel (broadcasting); Fading; Upper and lower bounds; Mathematics; Moment-generating function; Algorithm; Moment (physics); Function (biology); Computer science; Statistics; Probability density function; Telecommunications; Mathematical analysis; Physics","score_opus":0.041105829334970055,"score_gpt":0.3075649967438294,"score_spread":0.2664591674088594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099843372","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.03194642,0.0029277762,0.9378538,0.0022141875,0.00007286133,0.0023666406,0.00027902282,0.0025436,0.01979568],"genre_scores_gemma":[0.76461416,0.00025928984,0.23461042,0.000020333599,0.00000928276,0.00027457814,0.00008073456,0.00003417434,0.00009702555],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909973,0.000051616127,0.0004224529,0.00011496809,0.000094846335,0.00021636116],"domain_scores_gemma":[0.99603915,0.0006419732,0.00010244195,0.0029394797,0.00021420687,0.00006271958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062829803,0.00013642166,0.0002271903,0.000107788575,0.00014205859,0.000009532358,0.0011937304,0.00009521917,0.00001286063],"category_scores_gemma":[0.00015742893,0.00015389147,0.00009644884,0.0002821231,0.00023563698,0.00014497672,0.00022975277,0.00019550108,0.000011746536],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034460073,0.004674133,0.0027589258,0.0023050325,0.0008752361,0.0000014051972,0.01719857,0.05649176,0.4242558,0.30280006,0.035982683,0.15231179],"study_design_scores_gemma":[0.0016607083,0.00029777977,0.0048390077,0.00044559865,0.0001221452,0.0000089329205,0.0010098807,0.3621746,0.32862592,0.12138685,0.17800765,0.0014209485],"about_ca_topic_score_codex":0.000018241399,"about_ca_topic_score_gemma":0.00012719125,"teacher_disagreement_score":0.73266774,"about_ca_system_score_codex":0.00009209224,"about_ca_system_score_gemma":0.000021108508,"threshold_uncertainty_score":0.6275512},"labels":[],"label_agreement":null},{"id":"W2104678442","doi":"10.1049/iet-com.2011.0207","title":"Performance analysis of decode-and-forward relaying schemes with adaptive quadrature amplitude modulation (QAM)","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"King Saud University","keywords":"Spectral efficiency; Quadrature amplitude modulation; Rayleigh fading; QAM; Computer science; Transmission (telecommunications); Fading; Link adaptation; Channel state information; Bit error rate; Independent and identically distributed random variables; Channel (broadcasting); Wireless; Algorithm; Telecommunications; Electronic engineering; Mathematics; Statistics; Random variable","score_opus":0.05531626951570032,"score_gpt":0.29886420189556123,"score_spread":0.24354793237986092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104678442","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.41979524,0.0058574146,0.56537414,0.0024323177,0.00005385235,0.00033278822,0.0000084386165,0.00017727686,0.005968508],"genre_scores_gemma":[0.8726066,0.0020885472,0.12508705,0.00009652901,0.000008871374,0.000037335427,0.000027887341,0.000006885309,0.000040296345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989656,0.00021057206,0.0002832457,0.00016806152,0.00017670325,0.00019582328],"domain_scores_gemma":[0.99675226,0.00030081093,0.0002087811,0.0023794845,0.00027063512,0.0000880552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046247165,0.0001283586,0.00023594992,0.0002574165,0.0004644711,0.00006222894,0.0013108288,0.000056351673,0.000008687454],"category_scores_gemma":[0.000036694866,0.00011224393,0.00006438942,0.0017388749,0.00015039976,0.0008827783,0.0007620491,0.00024916467,0.000004472168],"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.000031274823,0.0003851689,0.2669133,0.00002033976,0.0012707746,1.2531339e-7,0.014134476,0.005915089,0.0018648239,0.6045527,0.00013982924,0.10477212],"study_design_scores_gemma":[0.00018240158,0.000044748766,0.2799214,0.000049954928,0.00017806813,0.0000025617685,0.00016585096,0.7153625,0.00021754653,0.000066607245,0.0036106734,0.0001976923],"about_ca_topic_score_codex":0.0000113727,"about_ca_topic_score_gemma":0.00010260515,"teacher_disagreement_score":0.7094474,"about_ca_system_score_codex":0.00004383313,"about_ca_system_score_gemma":0.000039001945,"threshold_uncertainty_score":0.45771745},"labels":[],"label_agreement":null},{"id":"W2111498936","doi":"10.1049/iet-com:20050530","title":"Performance of differential pulse-position modulation (DPPM) with concatenated coding over optical wireless communications","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Decoding methods; Intersymbol interference; Concatenated error correction code; Pulse-position modulation; Algorithm; Concatenation (mathematics); Coding gain; Optical wireless; Additive white Gaussian noise; Bit error rate; Electronic engineering; Wireless; Telecommunications; Channel (broadcasting); Detector; Pulse-amplitude modulation; Mathematics; Pulse (music); Block code; Engineering","score_opus":0.028503338993502544,"score_gpt":0.2440264731328885,"score_spread":0.21552313413938595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111498936","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.9840898,0.0003836748,0.0063301763,0.00086543855,0.00004609421,0.00036032696,0.000031550146,0.0009440274,0.00694892],"genre_scores_gemma":[0.9769095,0.00646008,0.01604995,0.00001719797,0.000009625847,0.0001582673,0.0003149809,0.00005331624,0.000027064269],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998603,0.00010508125,0.00057501835,0.0001717456,0.00027095724,0.00027423888],"domain_scores_gemma":[0.99473804,0.00039684106,0.0001451053,0.0043806466,0.00026170968,0.000077668905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011602337,0.00023487327,0.0003352929,0.00020766929,0.0005356248,0.00003116425,0.0022636133,0.0001946099,0.00003534078],"category_scores_gemma":[0.00003959209,0.00023181681,0.00007159988,0.000636481,0.0012567773,0.00039230625,0.00061802246,0.0006056369,0.000025939758],"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.0002876368,0.003066151,0.09888706,0.0005725942,0.0012291513,0.0000055643254,0.0042498275,0.025866177,0.5551515,0.2379127,0.0011244423,0.07164713],"study_design_scores_gemma":[0.0007241665,0.00011313434,0.10944458,0.00016404275,0.00004988472,0.00003117116,0.00013479518,0.86739826,0.02113703,0.00009849373,0.00032926782,0.00037516974],"about_ca_topic_score_codex":0.000028285589,"about_ca_topic_score_gemma":0.000041916654,"teacher_disagreement_score":0.8415321,"about_ca_system_score_codex":0.00014566112,"about_ca_system_score_gemma":0.000040606516,"threshold_uncertainty_score":0.9453215},"labels":[],"label_agreement":null},{"id":"W2112647076","doi":"10.1049/iet-com.2012.0627","title":"Secondary user access based on stochastic link estimation in cognitive radio with fibre‐connected distributed antennas","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Youth Science Foundation","keywords":"Cognitive radio; Computer science; Link (geometry); Stochastic geometry; Estimation; Computer network; Telecommunications; Mathematics; Wireless; Statistics; Engineering","score_opus":0.0253640848273287,"score_gpt":0.27978555515093223,"score_spread":0.2544214703236035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112647076","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.036029857,0.00009549514,0.9538047,0.007864719,0.00004568636,0.0007315452,0.00003584044,0.00019358883,0.0011985949],"genre_scores_gemma":[0.9825443,0.000012773456,0.016375689,0.0005929247,0.000020602587,0.00011478187,0.00030620254,0.000016778113,0.000015940082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863195,0.00025166458,0.00028227002,0.00033973798,0.0001914275,0.00030296211],"domain_scores_gemma":[0.99678224,0.0013758172,0.0001446451,0.0012911868,0.0003047742,0.000101343285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016684043,0.00019344824,0.0002175101,0.0002232759,0.00031100484,0.00045577934,0.0011960368,0.00007126488,0.000048770948],"category_scores_gemma":[0.0001707738,0.00017719837,0.000045047396,0.001083432,0.00015822037,0.0009017697,0.00028388857,0.00047558805,0.00003859441],"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.0003160594,0.002618896,0.015829703,0.00007898926,0.00046440627,0.000068328925,0.0037866812,0.20953523,0.00061931007,0.03755879,0.003250919,0.7258727],"study_design_scores_gemma":[0.00092280284,0.00011030506,0.11052815,0.00028573966,0.0000141614755,0.000013221259,0.000045216613,0.886648,0.000051406612,0.0011096873,0.000050108403,0.0002212218],"about_ca_topic_score_codex":0.00021202757,"about_ca_topic_score_gemma":0.00031006298,"teacher_disagreement_score":0.9465144,"about_ca_system_score_codex":0.00010072847,"about_ca_system_score_gemma":0.0001692724,"threshold_uncertainty_score":0.72259396},"labels":[],"label_agreement":null},{"id":"W2114939682","doi":"10.1049/iet-com.2010.0509","title":"Minimum mean squared error design of single-antenna two-way distributed relays based on full or partial channel state information","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Beamforming; Channel state information; Telecommunications link; Computer science; Mean squared error; Lagrange multiplier; Relay channel; Channel (broadcasting); Mathematical optimization; Control theory (sociology); Wireless; Telecommunications; Mathematics; Statistics; Power (physics)","score_opus":0.16356992139466783,"score_gpt":0.29878718463953674,"score_spread":0.1352172632448689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114939682","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.0008760571,0.00009269156,0.9943087,0.0019685414,0.00012907045,0.0006532661,0.000062027604,0.00022015272,0.0016894663],"genre_scores_gemma":[0.93712866,0.00017240255,0.061910704,0.0004073772,0.000008206863,0.00016437855,0.00016310919,0.0000122809015,0.00003287879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773645,0.00080737803,0.0007012427,0.00020288804,0.00026383618,0.0002882144],"domain_scores_gemma":[0.9945415,0.00064977654,0.00043692207,0.0037163456,0.0005311856,0.0001242723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075452455,0.00020827848,0.00025238495,0.00021889855,0.00047007677,0.00010606496,0.0031902462,0.00006372823,0.00004981862],"category_scores_gemma":[0.00025099883,0.00018696222,0.0000890064,0.00095045666,0.00020179903,0.00085305853,0.0007275193,0.0002805165,0.00006820984],"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.005542934,0.015182351,0.0007190544,0.0002646132,0.0008325817,0.000022351416,0.21962634,0.09123834,0.049803812,0.3479117,0.021941254,0.24691468],"study_design_scores_gemma":[0.001003581,0.00050175836,0.0003849119,0.00011487886,0.000017292728,0.0000033771926,0.00020901322,0.99199516,0.0021067495,0.00056297047,0.002835876,0.0002644524],"about_ca_topic_score_codex":0.000027681417,"about_ca_topic_score_gemma":0.00015148723,"teacher_disagreement_score":0.9362526,"about_ca_system_score_codex":0.00008975848,"about_ca_system_score_gemma":0.00015780529,"threshold_uncertainty_score":0.7624098},"labels":[],"label_agreement":null},{"id":"W2117144501","doi":"10.1049/iet-com.2008.0340","title":"Multiuser scheduling in high speed downlink packet access","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Network Optimization","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":"University of British Columbia","funders":"","keywords":"Computer science; Telecommunications link; Scheduling (production processes); Network packet; Channel state information; Computer network; Distributed computing; Real-time computing; Wireless; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.027568153097256836,"score_gpt":0.298303040692188,"score_spread":0.27073488759493114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117144501","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.68142945,0.0037441412,0.28491166,0.0072592637,0.00051414943,0.001172286,0.000042036896,0.002423657,0.018503344],"genre_scores_gemma":[0.9073556,0.0015846256,0.09070524,0.00012953853,0.00003882815,0.0000140210095,0.00012723982,0.00002306514,0.000021839596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930197,0.000042605174,0.0002623379,0.000112420894,0.0000787476,0.00020194425],"domain_scores_gemma":[0.9985935,0.00010797202,0.00003854992,0.001165372,0.000047953494,0.00004665626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008875548,0.000120144156,0.00014098515,0.000118825854,0.00009045696,0.000053867792,0.0008193039,0.00008130574,0.000022637283],"category_scores_gemma":[0.000036824953,0.00014038735,0.000028195353,0.00052947435,0.00003470711,0.00042830393,0.000102912614,0.00031309007,0.00003292752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022417105,0.000042796935,0.0009994387,0.0000037647828,0.0000058080172,5.674676e-7,0.00014619158,0.98830205,0.00042952475,0.0016298961,0.00014148258,0.008296219],"study_design_scores_gemma":[0.00041645378,0.00000744069,0.019686136,0.000060028287,0.000006475939,0.0000011166668,0.000035276324,0.9758429,0.00035128978,0.0020234191,0.0013675633,0.00020188831],"about_ca_topic_score_codex":0.000017790298,"about_ca_topic_score_gemma":0.00013628701,"teacher_disagreement_score":0.22592613,"about_ca_system_score_codex":0.00009011254,"about_ca_system_score_gemma":0.000010526812,"threshold_uncertainty_score":0.572483},"labels":[],"label_agreement":null},{"id":"W2118327116","doi":"10.1049/iet-com.2013.0646","title":"Improving spectrum access using a beam‐forming relay scheme for cognitive radio transmissions","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Cognitive radio; Computer science; Relay; Scheme (mathematics); Computer network; Telecommunications; Spectrum (functional analysis); Wireless; Physics; Mathematics","score_opus":0.05029851579646609,"score_gpt":0.31891784908425685,"score_spread":0.26861933328779075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118327116","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.01728485,0.00033755388,0.976563,0.002437998,0.00016153739,0.0005202668,0.00001173542,0.00022456008,0.0024585265],"genre_scores_gemma":[0.8103617,0.000048227343,0.18902129,0.0002995194,0.00012954455,0.000038164806,0.000019161087,0.000027337855,0.00005504614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840885,0.00015097292,0.0003744002,0.00041086396,0.00017273279,0.00048216892],"domain_scores_gemma":[0.99678063,0.0012280799,0.00020221248,0.0014470792,0.00017823791,0.00016373226],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005614678,0.00021081902,0.00026574256,0.0001747434,0.001432576,0.00044284743,0.0019364695,0.00009105564,0.000004681195],"category_scores_gemma":[0.00022675135,0.00021794159,0.00017747481,0.0005021814,0.00015094657,0.00074277766,0.0006209866,0.0003622873,0.000004234181],"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.000087856184,0.00070630794,0.0017521948,0.00014980411,0.00040013352,0.000008395668,0.0071985875,0.0018000024,0.02716788,0.24095298,0.00043864927,0.7193372],"study_design_scores_gemma":[0.00071165053,0.000068079375,0.0004810205,0.00021463852,0.000055784047,0.000044151373,0.000098643686,0.9876683,0.002262834,0.004206422,0.0038413906,0.00034713658],"about_ca_topic_score_codex":0.00013173641,"about_ca_topic_score_gemma":0.00014981824,"teacher_disagreement_score":0.9858683,"about_ca_system_score_codex":0.00009575795,"about_ca_system_score_gemma":0.00014629007,"threshold_uncertainty_score":0.99986744},"labels":[],"label_agreement":null},{"id":"W2120791636","doi":"10.1049/iet-com.2013.0659","title":"Multi‐hop relaying systems in the presence of co‐channel interference over Nakagami‐ <i>m</i> fading channels","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"University of Tabuk","keywords":"Nakagami distribution; Fading; Co-channel interference; Interference (communication); Computer science; Channel (broadcasting); Fading distribution; Telecommunications; Computer network; Rayleigh fading","score_opus":0.09812969559055215,"score_gpt":0.3301040105758546,"score_spread":0.23197431498530244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120791636","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.015804602,0.0042839595,0.96081436,0.0057597514,0.00050765683,0.0008882073,0.000008107392,0.00018746762,0.011745889],"genre_scores_gemma":[0.99164,0.001503805,0.0062009315,0.00037891025,0.00002311332,0.00014426184,0.000008942636,0.000009484091,0.00009057795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973699,0.001411626,0.0005061012,0.00024658052,0.00022125653,0.0002445348],"domain_scores_gemma":[0.99358594,0.0017947989,0.0002447756,0.0041290466,0.0001959353,0.000049520095],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0017302951,0.00015126371,0.00022719036,0.00015701134,0.00041930572,0.00020948926,0.0067627975,0.0000629062,0.000003490708],"category_scores_gemma":[0.00036998486,0.00012535974,0.000063311396,0.00084015104,0.00019697353,0.000480609,0.0013655738,0.00046405106,0.000018410206],"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.00001992296,0.0013224799,0.0046500303,0.00015420973,0.00010123739,0.0000021945566,0.12289481,0.033318643,0.016141498,0.78021145,0.0062801144,0.03490342],"study_design_scores_gemma":[0.00034840268,0.00004098907,0.0020196692,0.00032723453,0.000004853406,0.000006503965,0.0006709971,0.9858486,0.00017687785,0.00037027488,0.009997656,0.0001879353],"about_ca_topic_score_codex":0.000103724844,"about_ca_topic_score_gemma":0.00015436334,"teacher_disagreement_score":0.9758354,"about_ca_system_score_codex":0.000044237826,"about_ca_system_score_gemma":0.000042872085,"threshold_uncertainty_score":0.9986111},"labels":[],"label_agreement":null},{"id":"W2129521351","doi":"10.1049/iet-com.2010.0015","title":"Transceiver design using linear precoding in a multiuser multiple-input multiple-output system with limited feedback","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Precoding; MIMO; Computer science; Channel state information; Transmitter; Transceiver; Channel (broadcasting); Overhead (engineering); Data stream mining; Algorithm; Control theory (sociology); Telecommunications; Wireless; Artificial intelligence","score_opus":0.04716978642628267,"score_gpt":0.2577151425162582,"score_spread":0.21054535608997554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129521351","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.091516994,0.00018220443,0.9050527,0.000055595992,0.00021951973,0.0012723964,0.000032247906,0.0008111733,0.00085713685],"genre_scores_gemma":[0.66297174,0.000034656936,0.33666876,0.0000074721174,0.0000329899,0.00013077793,0.000035379027,0.000082873536,0.000035365796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856126,0.00016541983,0.0005232624,0.0002576747,0.00013730297,0.0003550514],"domain_scores_gemma":[0.9972893,0.0006639601,0.000110837915,0.0016596661,0.00016985412,0.000106394815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002830719,0.00028510054,0.00031565037,0.00027054644,0.00022497856,0.00005145628,0.00069930195,0.0002043386,0.0000049530377],"category_scores_gemma":[0.00013104345,0.00029313684,0.00005951994,0.00058764784,0.000099219964,0.0004594238,0.00006374569,0.0006729626,0.000027258808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002789997,0.000068008594,0.004463089,0.0001002218,0.000043783828,0.0000024329925,0.0019656525,0.96115184,0.031453382,0.000068223024,0.000011676169,0.00064378284],"study_design_scores_gemma":[0.0014778789,0.000017106338,0.0011153851,0.0003616817,0.000029562232,0.000028337707,0.0004645464,0.9935714,0.0021560704,0.0000018513153,0.0004359289,0.0003402747],"about_ca_topic_score_codex":0.00013976094,"about_ca_topic_score_gemma":0.0023333216,"teacher_disagreement_score":0.5714547,"about_ca_system_score_codex":0.0002058755,"about_ca_system_score_gemma":0.000042623942,"threshold_uncertainty_score":0.9999521},"labels":[],"label_agreement":null},{"id":"W2135872475","doi":"10.1049/iet-com.2011.0343","title":"Outage capacity optimisation for cognitive radio networks with cooperative communications","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Carleton University","funders":"","keywords":"Cognitive radio; Computer science; Relay; Transmission (telecommunications); Channel (broadcasting); Computer network; Wireless; Telecommunications","score_opus":0.06113273646059286,"score_gpt":0.29290889252692043,"score_spread":0.23177615606632757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135872475","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.003088206,0.0016436442,0.9822111,0.004017421,0.00014547394,0.0009354843,0.000037776976,0.00022546905,0.007695432],"genre_scores_gemma":[0.7954511,0.0004523488,0.20305647,0.0004393892,0.00011856754,0.00021623864,0.00015829774,0.000021959322,0.0000856412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836105,0.00041245288,0.00031388912,0.0002654557,0.00016160103,0.00048553504],"domain_scores_gemma":[0.99444395,0.0018763114,0.0002030234,0.0027469436,0.0005455882,0.00018417672],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00059908396,0.00022358347,0.00025625396,0.000098470184,0.0013517448,0.00023172956,0.001842914,0.000094397175,0.0000074555674],"category_scores_gemma":[0.00012666738,0.00020877314,0.000093021845,0.0006056516,0.0004799607,0.0010052416,0.00059839705,0.0004190826,0.000014039241],"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.00011116019,0.0019532382,0.008866946,0.000025905721,0.0007269901,0.0000013410136,0.024335396,0.0050111716,0.00026017922,0.8675029,0.0031874345,0.088017315],"study_design_scores_gemma":[0.0014654684,0.00023052449,0.008844772,0.00016985126,0.00014688494,0.0000684186,0.0009560525,0.96621275,0.000242997,0.0007926643,0.020172725,0.0006968862],"about_ca_topic_score_codex":0.000053567226,"about_ca_topic_score_gemma":0.000327467,"teacher_disagreement_score":0.9612016,"about_ca_system_score_codex":0.000120527955,"about_ca_system_score_gemma":0.00008127746,"threshold_uncertainty_score":0.9999484},"labels":[],"label_agreement":null},{"id":"W2143841082","doi":"10.1049/iet-com.2013.0299","title":"Performance analysis of a power line communication system employing selection combining in correlated log‐normal channels and impulsive noise","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Noise (video); Computer science; Selection (genetic algorithm); Telecommunications; Line (geometry); Speech recognition; Noise power; Power (physics); Power-line communication; Statistics; Acoustics; Mathematics; Artificial intelligence; Physics","score_opus":0.011419573270385449,"score_gpt":0.23519518394255634,"score_spread":0.2237756106721709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143841082","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.9884316,0.0014698438,0.0041072094,0.00016544295,0.000068166184,0.00025514376,0.000017375567,0.00025254654,0.005232728],"genre_scores_gemma":[0.9949958,0.0015063669,0.0031475362,0.000017253264,0.00000549547,0.00008658975,0.00019445708,0.000028731885,0.000017795874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986101,0.0002850386,0.0006400373,0.00014113703,0.00011365489,0.00021002493],"domain_scores_gemma":[0.9971751,0.00043139167,0.00018093722,0.001954864,0.00019138194,0.00006631562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799198,0.0001724689,0.00039737835,0.0006905895,0.00026587208,0.00003654216,0.0008486382,0.000120694545,0.000009498553],"category_scores_gemma":[0.00006620681,0.00019666727,0.00007730204,0.001783556,0.00013398142,0.00027968475,0.00034824372,0.0004455202,0.0000061093997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008389911,0.00068528147,0.2254541,0.00038357297,0.0018248779,4.915231e-7,0.015890026,0.7157604,0.011073775,0.01545784,0.00020191466,0.013183832],"study_design_scores_gemma":[0.00041298376,0.00005711826,0.05996402,0.00017710266,0.0002188107,0.000004491622,0.00043710013,0.9378859,0.00024983464,0.000019528901,0.00039035792,0.00018275296],"about_ca_topic_score_codex":0.00020544534,"about_ca_topic_score_gemma":0.00036932723,"teacher_disagreement_score":0.22212552,"about_ca_system_score_codex":0.00011061801,"about_ca_system_score_gemma":0.000018890601,"threshold_uncertainty_score":0.80198586},"labels":[],"label_agreement":null},{"id":"W2144476100","doi":"10.1049/iet-com.2013.0099","title":"Signal‐to‐noise ratio optimisation for multi‐input multi‐output relay systems with direct source–destination path","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Iran Telecommunication Research Center","keywords":"Relay; Computer science; Path (computing); Signal-to-noise ratio (imaging); SIGNAL (programming language); Noise (video); Telecommunications; Computer network; Physics; Artificial intelligence; Power (physics)","score_opus":0.08504776748951984,"score_gpt":0.30240850700862626,"score_spread":0.21736073951910642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144476100","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.0017022042,0.0007643426,0.98808444,0.00528694,0.00011806537,0.002406069,0.000009724548,0.00045912096,0.001169071],"genre_scores_gemma":[0.5890456,0.00023318983,0.4064051,0.00039333088,0.000031311523,0.0018481519,0.000080975864,0.000027842383,0.0019345257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978503,0.0005718845,0.0005281909,0.0004461896,0.00026400638,0.00033943617],"domain_scores_gemma":[0.99420464,0.00079909107,0.0002900355,0.0033437533,0.0011600894,0.00020236269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007037448,0.00026440606,0.00027804764,0.00021714176,0.0011755641,0.0006564994,0.0027252426,0.00009591058,0.000012920227],"category_scores_gemma":[0.00025090133,0.00024197205,0.000082930965,0.00080978987,0.00011091742,0.00090653315,0.0007292866,0.0002749326,0.00014945745],"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.0000685326,0.0031125369,0.00417318,0.00017671468,0.00042959047,0.0000018205963,0.037413407,0.38700372,0.02185142,0.09149926,0.033181522,0.42108828],"study_design_scores_gemma":[0.00077226583,0.00011766364,0.0027777327,0.00013583935,0.000018520486,0.0000050559975,0.00020741484,0.96577007,0.00021672662,0.000017842176,0.029621752,0.0003391065],"about_ca_topic_score_codex":0.00014366658,"about_ca_topic_score_gemma":0.00012851431,"teacher_disagreement_score":0.5873434,"about_ca_system_score_codex":0.00017723847,"about_ca_system_score_gemma":0.00013845606,"threshold_uncertainty_score":0.9867334},"labels":[],"label_agreement":null},{"id":"W2145537813","doi":"10.1049/iet-com.2008.0406","title":"Performance of spatially multiplexed MC-CDM with zero-forcing unified successive interference cancellation detection","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Orthogonal frequency-division multiplexing; Subcarrier; Multiplexing; Single antenna interference cancellation; Ergodic theory; Spatial multiplexing; Mathematics; Minimum mean square error; Topology (electrical circuits); Computer science; Electronic engineering; Algorithm; Control theory (sociology); Detector; Telecommunications; Statistics; Engineering","score_opus":0.016634303412074874,"score_gpt":0.24874255592098027,"score_spread":0.2321082525089054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145537813","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.49256212,0.0005360523,0.49505723,0.00035577966,0.00006362738,0.0006721559,0.000016883563,0.0012121685,0.009523984],"genre_scores_gemma":[0.9575026,0.0012048004,0.04109448,0.000023870221,0.000008548296,0.0000664703,0.000045258555,0.00002509002,0.000028906949],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913204,0.00006522779,0.0003839831,0.00012664092,0.00012817213,0.0001639676],"domain_scores_gemma":[0.9975533,0.00016973398,0.00019204762,0.0017956758,0.00024558345,0.000043651024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011157382,0.00016468807,0.00019867373,0.00015438467,0.00019727711,0.000021669211,0.00092285627,0.000079278405,0.000006943962],"category_scores_gemma":[0.000034939705,0.00016845186,0.000033100194,0.0004189191,0.000121615805,0.00040036923,0.00009200544,0.00032218863,0.000003966394],"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.000098493896,0.00012536661,0.0020189928,0.00009082799,0.000056339457,3.1285666e-7,0.0019656813,0.26276463,0.49924183,0.0023036269,0.000036090114,0.2312978],"study_design_scores_gemma":[0.0003966967,0.00023608416,0.0075919265,0.00031074308,0.000023905024,0.0000036864806,0.00008853281,0.62558216,0.36451417,0.00039214554,0.00054342597,0.00031653355],"about_ca_topic_score_codex":0.00008369773,"about_ca_topic_score_gemma":0.0005906129,"teacher_disagreement_score":0.46494046,"about_ca_system_score_codex":0.00013516829,"about_ca_system_score_gemma":0.00003154456,"threshold_uncertainty_score":0.6869268},"labels":[],"label_agreement":null},{"id":"W2154740911","doi":"10.1049/iet-com.2012.0739","title":"Survey on cooperative medium access control protocols","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Access control; Control (management); Computer network; Artificial intelligence","score_opus":0.14868713545750337,"score_gpt":0.3923372197399414,"score_spread":0.24365008428243803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154740911","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.0030077503,0.0013112222,0.66234416,0.17397241,0.0005554352,0.05137886,0.000114148665,0.00181009,0.1055059],"genre_scores_gemma":[0.9756729,0.00033651388,0.004367554,0.0039660954,0.000029046738,0.015005898,0.00005594178,0.000016055177,0.0005500178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.997323,0.0014803627,0.0003851026,0.00030089164,0.0002383797,0.00027229503],"domain_scores_gemma":[0.9921856,0.0014980274,0.0001552574,0.005157943,0.0008565913,0.000146608],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00073864433,0.0001898746,0.00023758053,0.0001147231,0.0007813476,0.0008474965,0.00829133,0.00006722549,0.00020489858],"category_scores_gemma":[0.0004072525,0.00016739874,0.00005771714,0.00083147397,0.00019388858,0.0010356312,0.0017615177,0.0004428637,0.0007497725],"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.00003810432,0.0022966866,0.026636241,0.000018344575,0.00027344018,0.0000018611072,0.0037529413,0.0010419155,0.0024251554,0.48049444,0.32009444,0.16292642],"study_design_scores_gemma":[0.002258899,0.00033127525,0.6243046,0.00019719219,0.0000096486565,0.0000037409527,0.000045241835,0.22980654,0.0009243694,0.0023165215,0.13894093,0.00086102023],"about_ca_topic_score_codex":0.00014251028,"about_ca_topic_score_gemma":0.00071552437,"teacher_disagreement_score":0.97266513,"about_ca_system_score_codex":0.000069729664,"about_ca_system_score_gemma":0.00016922208,"threshold_uncertainty_score":0.9970743},"labels":[],"label_agreement":null},{"id":"W2160570982","doi":"10.1049/iet-com.2009.0508","title":"Performance analysis of cooperative diversity with relay selection over non-identically distributed links","year":2010,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Independent and identically distributed random variables; Rayleigh fading; Moment-generating function; Relay; Fading; Probability density function; Cumulative distribution function; Expression (computer science); Cooperative diversity; Diversity combining; Selection (genetic algorithm); Upper and lower bounds; Mathematics; Computer science; Signal-to-noise ratio (imaging); Closed-form expression; Statistics; Function (biology); Maximal-ratio combining; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Random variable; Mathematical analysis; Combinatorics; Physics; Artificial intelligence","score_opus":0.022339129069348415,"score_gpt":0.27441112882777974,"score_spread":0.2520719997584313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160570982","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.7355172,0.00003524109,0.26041606,0.0012275715,0.00005048412,0.0001379821,0.000014445771,0.00008321882,0.002517815],"genre_scores_gemma":[0.9789965,0.00037669225,0.020323174,0.00011218751,0.000007427832,0.000018850764,0.000077497694,0.0000046066134,0.00008306476],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991128,0.00013659165,0.00023305064,0.00018779236,0.00019248074,0.00013730691],"domain_scores_gemma":[0.99687517,0.00025095383,0.00015300949,0.0020744996,0.0005782481,0.00006813814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032475294,0.000102172184,0.00018209181,0.00018613586,0.00094313116,0.00008903925,0.0021563813,0.00009388554,0.000064509586],"category_scores_gemma":[0.000060320832,0.00009500715,0.000073663236,0.00255843,0.00023400655,0.00049887336,0.0018533976,0.0006452617,0.000007277614],"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.00006807333,0.0012323923,0.68599546,0.000021786558,0.0024932213,0.0000017487317,0.010377865,0.022363108,0.018089967,0.2418339,0.0016858241,0.015836636],"study_design_scores_gemma":[0.00019182314,0.00005956182,0.3190626,0.000013024021,0.00014482885,0.0000020768528,0.00002088572,0.67866206,0.0006099122,0.0000136772005,0.0011028803,0.000116660485],"about_ca_topic_score_codex":0.000051561994,"about_ca_topic_score_gemma":0.0023108057,"teacher_disagreement_score":0.65629894,"about_ca_system_score_codex":0.000028547265,"about_ca_system_score_gemma":0.00008488253,"threshold_uncertainty_score":0.7253898},"labels":[],"label_agreement":null},{"id":"W2161737785","doi":"10.1049/iet-com.2012.0415","title":"Relay selection in cognitive radio networks with interference constraints","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Cognitive radio; Selection (genetic algorithm); Computer science; Interference (communication); Outage probability; Underlay; Expression (computer science); Secondary source; Relay channel; Computer network; Telecommunications; Power (physics); Signal-to-noise ratio (imaging); Fading; Artificial intelligence; Wireless; Decoding methods","score_opus":0.048266785875980794,"score_gpt":0.2928984349157018,"score_spread":0.24463164903972098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161737785","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.015435015,0.00107782,0.95517397,0.004711405,0.000054606076,0.00064610445,0.0000012098747,0.00023727956,0.02266258],"genre_scores_gemma":[0.96628416,0.0012707263,0.031558998,0.00040550574,0.000011719718,0.0002586685,0.000012635981,0.00000870044,0.00018886811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875706,0.0004047969,0.00027050482,0.0002387867,0.00009772343,0.00023113345],"domain_scores_gemma":[0.9978279,0.0005367098,0.000106296684,0.0011347457,0.0003164294,0.00007792782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026579064,0.00013464493,0.00014951143,0.00013364802,0.00031612307,0.00021423944,0.001912522,0.00005909275,0.00015470573],"category_scores_gemma":[0.00006969833,0.00012383123,0.000027998496,0.0009865223,0.00031875147,0.0006676718,0.00065684103,0.00052959006,0.00007666081],"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.0000286424,0.00093254994,0.041036427,0.000010062919,0.00015285409,0.000003904787,0.00943305,0.006148664,0.0010001847,0.20620193,0.0061038365,0.7289479],"study_design_scores_gemma":[0.0009015731,0.00014868099,0.07058309,0.0003416088,0.000009759806,0.000048632322,0.0004581109,0.9247697,0.00010425608,0.00047059392,0.0017602376,0.0004037333],"about_ca_topic_score_codex":0.000053788935,"about_ca_topic_score_gemma":0.00085916667,"teacher_disagreement_score":0.9508492,"about_ca_system_score_codex":0.0000798758,"about_ca_system_score_gemma":0.00008921201,"threshold_uncertainty_score":0.50496906},"labels":[],"label_agreement":null},{"id":"W2165478647","doi":"10.1049/iet-com:20070304","title":"Efficient multi-user detection scheme for overloaded group-orthogonal MC-CDMA systems","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Code division multiple access; Multiuser detection; Computer science; Quadrature amplitude modulation; Modulation (music); Algorithm; Phase-shift keying; Constant (computer programming); Scheme (mathematics); Mathematics; Telecommunications; Bit error rate; Decoding methods","score_opus":0.09521289777611618,"score_gpt":0.3246102910745373,"score_spread":0.22939739329842113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165478647","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.020369345,0.0017642523,0.97309804,0.0018697118,0.00030140686,0.001209327,0.00002179426,0.0004885907,0.0008775542],"genre_scores_gemma":[0.8575973,0.00041422562,0.14012185,0.0000928987,0.00005779802,0.0009978941,0.000049194423,0.000028299622,0.00064054324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756175,0.0005295706,0.00053628895,0.0004169618,0.00047815056,0.00047725887],"domain_scores_gemma":[0.9921362,0.0010042646,0.00022301578,0.00592056,0.0005347973,0.00018117804],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008020614,0.00020774394,0.00024937873,0.00022325898,0.0016165506,0.0001976616,0.005427435,0.00014911784,0.0000051783722],"category_scores_gemma":[0.00017671144,0.00021697626,0.00016117196,0.00093839876,0.0003182763,0.00028153788,0.0018092747,0.00052646466,0.00011396637],"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.00009879999,0.004316772,0.0028223696,0.00013357823,0.00036799003,0.000007588749,0.00472426,0.055433292,0.031669643,0.8623401,0.010490937,0.02759466],"study_design_scores_gemma":[0.0007846129,0.00005424894,0.0046567316,0.00003481796,0.000005340434,0.000039889394,0.00006123297,0.9410393,0.0002559247,0.00006345881,0.0527621,0.00024233684],"about_ca_topic_score_codex":0.00011752271,"about_ca_topic_score_gemma":0.00015589196,"teacher_disagreement_score":0.885606,"about_ca_system_score_codex":0.00019445017,"about_ca_system_score_gemma":0.00014896633,"threshold_uncertainty_score":0.9999537},"labels":[],"label_agreement":null},{"id":"W2167659531","doi":"10.1049/iet-com.2013.0466","title":"Probabilistic relay assignment strategy for cooperation networks with random relays","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Relay; Computer science; Probabilistic logic; Computer network; Relay channel; Telecommunications; Artificial intelligence","score_opus":0.053079198073174655,"score_gpt":0.29242900875895705,"score_spread":0.2393498106857824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167659531","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.00015763892,0.00065136474,0.98485416,0.005661045,0.00010301382,0.0011677548,0.0000024084588,0.00022052549,0.0071820607],"genre_scores_gemma":[0.90782344,0.0008199268,0.08911728,0.00051848067,0.00006905359,0.0011327749,0.00010017197,0.000019866653,0.00039898988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833024,0.0005819119,0.00036974938,0.00031135342,0.00014844973,0.00025829804],"domain_scores_gemma":[0.9944483,0.0011849869,0.0001643235,0.0034601912,0.00064077,0.000101411824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095906644,0.0001768175,0.00021679646,0.0000641044,0.0009770861,0.00030315682,0.0023538687,0.000074122,0.000012925612],"category_scores_gemma":[0.00028690472,0.00014965373,0.000060774302,0.0004651941,0.00015386344,0.00037866077,0.00047960083,0.00028927167,0.000015584837],"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.00003372136,0.00018979634,0.00006208905,0.000008314332,0.000040446685,1.0939225e-7,0.00036572214,0.17319357,0.000075953954,0.7744025,0.004081396,0.047546394],"study_design_scores_gemma":[0.0012842261,0.0002287175,0.00022853928,0.00005283193,0.000019833353,0.0000033310137,0.00001847913,0.9131103,0.000027875963,0.0015042549,0.08330401,0.00021760628],"about_ca_topic_score_codex":0.0000045233564,"about_ca_topic_score_gemma":0.00024960216,"teacher_disagreement_score":0.9076658,"about_ca_system_score_codex":0.00008283756,"about_ca_system_score_gemma":0.0000996043,"threshold_uncertainty_score":0.75150555},"labels":[],"label_agreement":null},{"id":"W2242976416","doi":"10.1049/iet-com.2014.1236","title":"Transmit power allocation for asymmetric bi‐directional relay networks using channel statistics","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Concordia University","funders":"Nantong University; Government of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Relay; Relay channel; Computer science; Channel (broadcasting); Transmitter power output; Power (physics); Computer network; Telecommunications; Statistics; Transmitter; Mathematics","score_opus":0.13638363402507478,"score_gpt":0.3417300877324978,"score_spread":0.20534645370742302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242976416","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.00011998878,0.0032049983,0.98928374,0.0037615502,0.000402908,0.00041694223,0.000022730443,0.00018994747,0.0025971858],"genre_scores_gemma":[0.5788573,0.0011411512,0.41898537,0.0004824442,0.00004911662,0.00012865601,0.00011865048,0.00001994206,0.00021736643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849135,0.00033995422,0.00040112398,0.0002689283,0.00022746378,0.00027119135],"domain_scores_gemma":[0.9958134,0.00073254545,0.00017246818,0.0022055397,0.0009033547,0.0001726532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000883786,0.00016367779,0.00018111087,0.00023132608,0.0007219192,0.0001951832,0.002255499,0.0000932589,0.000007063354],"category_scores_gemma":[0.0002653055,0.00017743564,0.00007369864,0.0013422915,0.00011202538,0.00046001346,0.00049387285,0.00028344034,0.000017448006],"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.000032220698,0.0007085032,0.0003385149,0.000012771357,0.00016371037,7.891506e-7,0.004169384,0.07096018,0.00023837393,0.7921333,0.0326325,0.098609775],"study_design_scores_gemma":[0.00046297486,0.00006524889,0.0004253143,0.000022724285,0.000017972636,0.000009245452,0.00006954216,0.9316705,0.000038352533,0.0026955174,0.0643027,0.00021989226],"about_ca_topic_score_codex":0.000026585765,"about_ca_topic_score_gemma":0.0001241379,"teacher_disagreement_score":0.8607103,"about_ca_system_score_codex":0.00019367386,"about_ca_system_score_gemma":0.00023355735,"threshold_uncertainty_score":0.7235615},"labels":[],"label_agreement":null},{"id":"W2246469622","doi":"10.1049/iet-com.2014.0318","title":"Adaptive transmission in amplify‐and‐forward cooperative communications using orthogonal space–time block codes under spatially correlated antennas","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh fading; Cumulative distribution function; Spectral efficiency; Spatial correlation; Computer science; Transmission (telecommunications); Algorithm; Fading; Relay; Block code; Coding (social sciences); Bit error rate; Mathematics; Topology (electrical circuits); Probability density function; Channel (broadcasting); Telecommunications; Statistics; Decoding methods; Physics","score_opus":0.11276938639785561,"score_gpt":0.3243417703368462,"score_spread":0.21157238393899058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246469622","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.03206649,0.01689755,0.89975095,0.036342286,0.00020365417,0.0018215559,0.00006439425,0.0006776418,0.012175475],"genre_scores_gemma":[0.8678583,0.00470779,0.12652104,0.0004972312,0.000014293109,0.00006744848,0.00010024251,0.000027937176,0.00020574017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965559,0.0016089149,0.0006822631,0.00044120304,0.00032144185,0.00039024747],"domain_scores_gemma":[0.99350446,0.00093805476,0.00024473656,0.0042541986,0.0007377341,0.00032079418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010457794,0.0003273124,0.00043987946,0.00030794044,0.0009314189,0.0002598676,0.0039744647,0.0001850776,0.000018888677],"category_scores_gemma":[0.00015087283,0.00033003377,0.00007851942,0.001400799,0.00064877584,0.00077215355,0.002643035,0.0009347754,0.00006079399],"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.00022812102,0.0028335913,0.003794987,0.000023875837,0.0005327114,0.000015386993,0.04313154,0.052771166,0.015910836,0.81641793,0.0024972865,0.061842564],"study_design_scores_gemma":[0.0011180176,0.0001180004,0.0015492772,0.00020647806,0.00003407356,0.00004163516,0.0005700604,0.98454845,0.00008123803,0.0020011717,0.009295221,0.00043640184],"about_ca_topic_score_codex":0.00018123088,"about_ca_topic_score_gemma":0.001117725,"teacher_disagreement_score":0.93177724,"about_ca_system_score_codex":0.0002525148,"about_ca_system_score_gemma":0.0005885542,"threshold_uncertainty_score":0.9999152},"labels":[],"label_agreement":null},{"id":"W2254104976","doi":"10.1049/iet-com.2015.0094","title":"Achievable rates and outage probability of cognitive radio with dynamic frequency hopping under imperfect spectrum sensing","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cognitive radio; Frequency-hopping spread spectrum; Imperfect; Computer science; Spectrum (functional analysis); Telecommunications; Computer network; Wireless; Physics","score_opus":0.03347996335318653,"score_gpt":0.27901402532874964,"score_spread":0.2455340619755631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254104976","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.55014956,0.0020647454,0.4377984,0.00396348,0.00006547468,0.0005063457,0.000011176726,0.00015156585,0.0052892184],"genre_scores_gemma":[0.94444036,0.00015532435,0.055256378,0.00008323004,0.000014284523,0.0000040504133,0.000013457695,0.000014239984,0.00001866851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985876,0.00034573535,0.00027044083,0.00033331622,0.00018128208,0.00028159344],"domain_scores_gemma":[0.9975231,0.0007497653,0.00016919716,0.0011842449,0.0002458143,0.0001278781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056541635,0.00017507399,0.00027562957,0.00010439548,0.00030398736,0.0001448728,0.0005133785,0.000053684285,0.0000017337152],"category_scores_gemma":[0.00013462063,0.00015689334,0.000045764442,0.00053693494,0.000437228,0.00043096696,0.00040695435,0.00029413894,0.0000028780905],"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.0005701581,0.0032214571,0.116503835,0.0004447118,0.0025722433,0.00015354532,0.08336113,0.0058864374,0.025090793,0.5464562,0.00034389415,0.21539557],"study_design_scores_gemma":[0.0028756987,0.00093457004,0.055077355,0.001062343,0.00017014897,0.00053678156,0.0031417198,0.7999833,0.0017275745,0.13331474,0.00009659806,0.0010791401],"about_ca_topic_score_codex":0.00027108024,"about_ca_topic_score_gemma":0.00121457,"teacher_disagreement_score":0.7940969,"about_ca_system_score_codex":0.00011393879,"about_ca_system_score_gemma":0.00020485382,"threshold_uncertainty_score":0.63979244},"labels":[],"label_agreement":null},{"id":"W2260858646","doi":"10.1049/iet-com.2015.0386","title":"Efficient combination of polynomial time algorithm and subtree decomposition for network coding","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Time complexity; Computer science; Multicast; Algorithm; Coding (social sciences); Computational complexity theory; Theoretical computer science; Mathematical optimization; Mathematics; Distributed computing","score_opus":0.05057372867581421,"score_gpt":0.3162539849989059,"score_spread":0.26568025632309167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260858646","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.0049366066,0.001766756,0.98628086,0.0044217613,0.0001496185,0.00048337821,0.000011263639,0.000118950615,0.001830828],"genre_scores_gemma":[0.6762172,0.0002516163,0.32321924,0.00011492329,0.00003331176,0.000058573576,0.000044035914,0.000007987183,0.00005310412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990152,0.00024130552,0.00029726143,0.00016182718,0.00012666274,0.00015771936],"domain_scores_gemma":[0.99751395,0.0005144111,0.00016794803,0.0013124227,0.00039873377,0.000092519695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777862,0.00009759191,0.00016412338,0.00008181418,0.00037822864,0.000082410595,0.0011761246,0.00004688507,0.0000023519603],"category_scores_gemma":[0.000075508644,0.0001058423,0.00004516748,0.0003665039,0.0001228515,0.00013810325,0.00079847913,0.000107414104,0.000007663543],"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.00005683445,0.001144373,0.000605332,0.00003264854,0.00014091835,5.0427263e-7,0.007783941,0.011966182,0.0045485613,0.45851815,0.032704283,0.48249826],"study_design_scores_gemma":[0.000729067,0.000094860305,0.0008453719,0.0000403999,0.000011699051,0.0000036553133,0.00003377841,0.99106616,0.00023124294,0.0012773195,0.0055439495,0.000122479],"about_ca_topic_score_codex":0.0000068589657,"about_ca_topic_score_gemma":0.000010826478,"teacher_disagreement_score":0.9791,"about_ca_system_score_codex":0.000062568055,"about_ca_system_score_gemma":0.0000737204,"threshold_uncertainty_score":0.43161237},"labels":[],"label_agreement":null},{"id":"W2269333319","doi":"10.1049/iet-com.2015.0361","title":"Multi‐way relaying for cooperative indoor power line communications","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Power-line communication; Relay; Diversity gain; Wireless; Broadband; Multiplexing; Transmission (telecommunications); Computer network; Communications system; Attenuation; Power (physics); Telecommunications; Electronic engineering; Channel (broadcasting); Real-time computing; Fading; Engineering","score_opus":0.12411118033265812,"score_gpt":0.3413145939228048,"score_spread":0.21720341359014667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269333319","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.04221587,0.11729814,0.53022325,0.05555386,0.0024934432,0.009027226,0.002669045,0.0074930983,0.23302609],"genre_scores_gemma":[0.7879316,0.0020084165,0.20799354,0.00021337491,0.00002723971,0.00077489647,0.00050901255,0.00007249347,0.0004694245],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986036,0.00020153471,0.0005617953,0.0001804835,0.00013372712,0.00031885988],"domain_scores_gemma":[0.9913165,0.000711595,0.000094148185,0.00703371,0.00061572395,0.00022830816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059939665,0.00024638863,0.00028539458,0.00017080836,0.00061238883,0.000097784054,0.0034363742,0.0001426115,0.000019705027],"category_scores_gemma":[0.00044105516,0.0002624402,0.00012071184,0.0005244564,0.00031007922,0.00034739956,0.0009586067,0.0005646838,0.00015485108],"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.0002895733,0.009381058,0.005898896,0.00030088233,0.0028829474,0.0000051008287,0.07698863,0.051921893,0.051198963,0.31919613,0.42998153,0.051954385],"study_design_scores_gemma":[0.0016567695,0.000111239846,0.0004348732,0.00007070179,0.000065496344,0.000008546066,0.0016033014,0.32837436,0.0004950961,0.0006047172,0.66607106,0.00050386396],"about_ca_topic_score_codex":0.000041326584,"about_ca_topic_score_gemma":0.00038645,"teacher_disagreement_score":0.74571574,"about_ca_system_score_codex":0.00017176298,"about_ca_system_score_gemma":0.00011514458,"threshold_uncertainty_score":0.9999828},"labels":[],"label_agreement":null},{"id":"W2276090935","doi":"10.1049/iet-com.2015.0371","title":"Complexity‐aware‐normalised mean squared error ‘CAN’ metric for dimension estimation of memory polynomial‐based power amplifiers behavioural models","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"King Fahd University of Petroleum and Minerals","keywords":"Mean squared error; Metric (unit); Dimension (graph theory); Polynomial; Computer science; Estimation; Power (physics); Amplifier; Mathematics; Algorithm; Statistics; Telecommunications; Bandwidth (computing); Combinatorics","score_opus":0.16154327453478495,"score_gpt":0.322104434085712,"score_spread":0.16056115955092704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276090935","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.023946019,0.00051247625,0.9713895,0.00042361903,0.00029924154,0.0011554485,0.00038463157,0.0004920935,0.0013969742],"genre_scores_gemma":[0.87186104,0.0000059472927,0.12717265,0.00005684183,0.0000089825335,0.00019054202,0.0006020835,0.000068984526,0.00003294188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984881,0.00012570918,0.00058079726,0.00020308558,0.00027993103,0.00032235254],"domain_scores_gemma":[0.9969067,0.00039247883,0.00017342446,0.0019590235,0.00036088895,0.00020745848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038609537,0.00025124932,0.00036438456,0.00038079044,0.000175872,0.000032662596,0.0008558068,0.00012654412,0.0000122115225],"category_scores_gemma":[0.0001031749,0.0002874143,0.00014179121,0.00057124987,0.00021544092,0.000390539,0.00012042921,0.00022651476,0.000008068695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006764378,0.00015823894,0.00008226836,0.000043160035,0.000059237205,3.6153142e-7,0.0023895288,0.98805165,0.0012272638,0.0021171116,0.00491557,0.00088797894],"study_design_scores_gemma":[0.0017025815,0.00011213007,0.00026848374,0.00004655804,0.000107455904,0.000002894926,0.0006834034,0.9893556,0.0034473753,0.0035027512,0.00039463554,0.00037610458],"about_ca_topic_score_codex":0.00014178154,"about_ca_topic_score_gemma":0.0001570314,"teacher_disagreement_score":0.847915,"about_ca_system_score_codex":0.00028965843,"about_ca_system_score_gemma":0.000113724425,"threshold_uncertainty_score":0.9999578},"labels":[],"label_agreement":null},{"id":"W2276790057","doi":"10.1049/iet-com.2015.0009","title":"Generation of balanced quadrature phase shift keyed sequences through guided scrambling","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scrambling; Phase-shift keying; Algorithm; Computer science; Mathematics; Decoding methods; Bit error rate","score_opus":0.2672783527815267,"score_gpt":0.4054042682871345,"score_spread":0.13812591550560782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276790057","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.036912408,0.0018212041,0.9356452,0.0150111,0.000186603,0.00042474366,0.00003675462,0.00034307007,0.009618908],"genre_scores_gemma":[0.79717475,0.00009707686,0.20217972,0.00021929917,0.00003646884,0.00006599532,0.00015764184,0.0000064048354,0.000062639236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988889,0.00014168845,0.00036823054,0.0002213428,0.00022949607,0.00015035148],"domain_scores_gemma":[0.9965948,0.00009114785,0.00020302401,0.002784032,0.00024776813,0.00007922772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003286526,0.000109297835,0.00015805509,0.00005948716,0.00024818932,0.00012999844,0.0022899034,0.00007043809,0.0000064447654],"category_scores_gemma":[0.000079127305,0.00010677593,0.000060535134,0.00068753265,0.0001362794,0.0006265987,0.00041353452,0.0001527334,0.00003641443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036957838,0.0006675273,0.00014145019,0.000013247656,0.000043815,0.000001498747,0.009303529,0.00090314134,0.09870637,0.8679502,0.015953531,0.0063119926],"study_design_scores_gemma":[0.0023581123,0.00015821475,0.00035426405,0.00006660598,0.000050294148,0.000030948908,0.0005151948,0.768106,0.047979508,0.062627815,0.11716482,0.0005882266],"about_ca_topic_score_codex":0.00016689606,"about_ca_topic_score_gemma":0.000090352565,"teacher_disagreement_score":0.8053224,"about_ca_system_score_codex":0.00003894643,"about_ca_system_score_gemma":0.00020258247,"threshold_uncertainty_score":0.4354196},"labels":[],"label_agreement":null},{"id":"W2292514988","doi":"10.1049/iet-com.2015.0110","title":"Generalised selection at multi‐antenna sources in two‐way relay networks","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Relay; Computer science; Selection (genetic algorithm); Antenna (radio); Telecommunications; Computer network; Artificial intelligence; Physics","score_opus":0.062017376311947155,"score_gpt":0.3177114554492566,"score_spread":0.25569407913730946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292514988","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.048734438,0.004166298,0.9231691,0.019960543,0.00027878862,0.00041740751,0.0000035891528,0.0004669934,0.0028028537],"genre_scores_gemma":[0.94928545,0.0064303996,0.04165567,0.0004841652,0.000041484705,0.000119693694,0.000011122259,0.000016311902,0.0019556973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981235,0.0007192709,0.00039828062,0.00031978893,0.00011982673,0.00031931515],"domain_scores_gemma":[0.9961216,0.000582596,0.00015037901,0.002868259,0.00018101225,0.00009615612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056966493,0.00016619294,0.00017882223,0.00016997934,0.00066380424,0.00010702584,0.0030458726,0.00006275991,0.000051616593],"category_scores_gemma":[0.00010995162,0.00013277178,0.00007492295,0.00090844743,0.00015657095,0.00048203566,0.0018805526,0.0002694815,0.00010310393],"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.00006912278,0.0015935736,0.16953284,0.000012709033,0.00018778098,0.000005459619,0.010349779,0.01745667,0.13026801,0.3655703,0.017955244,0.2869985],"study_design_scores_gemma":[0.0013714203,0.000027178385,0.023319831,0.00011111872,0.000006488148,0.000009460264,0.00002335654,0.9117777,0.00043252125,0.00022778935,0.062344793,0.00034837244],"about_ca_topic_score_codex":0.000060873404,"about_ca_topic_score_gemma":0.005421244,"teacher_disagreement_score":0.900551,"about_ca_system_score_codex":0.00024057811,"about_ca_system_score_gemma":0.00004513282,"threshold_uncertainty_score":0.566004},"labels":[],"label_agreement":null},{"id":"W2295528582","doi":"10.1049/iet-com.2014.1000","title":"Robust signal‐to‐noise ratio and noise variance estimation for single carrier frequency domain equalisation ultra‐wideband wireless systems","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Frequency domain; Computer science; Wireless; Wideband; Noise (video); Signal-to-noise ratio (imaging); Ultra-wideband; Acoustics; SIGNAL (programming language); Electronic engineering; Telecommunications; Physics; Engineering; Artificial intelligence","score_opus":0.05397896802096474,"score_gpt":0.259375450643077,"score_spread":0.20539648262211224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295528582","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.030582726,0.002724165,0.9563384,0.002716995,0.00019213979,0.0015151771,0.0001924533,0.0008055303,0.0049324185],"genre_scores_gemma":[0.91235083,0.00016038943,0.08572758,0.0000685382,0.000032230928,0.0012318685,0.00032103455,0.000058185695,0.000049347535],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854356,0.00018965865,0.00056341663,0.00024372946,0.00016952954,0.00029012788],"domain_scores_gemma":[0.9963806,0.00058904797,0.00012696734,0.0023757757,0.00034457943,0.00018298629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005597691,0.00023677554,0.00029122937,0.00022374197,0.00036668277,0.00016646771,0.0010407849,0.00020608396,0.0000046929404],"category_scores_gemma":[0.00026586858,0.0002705175,0.000046619447,0.00051369483,0.00017376221,0.0004308711,0.000103838924,0.0002637959,0.000019328229],"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.00004316975,0.0004018815,0.00096750294,0.00025219595,0.00023770923,0.0000012114743,0.0122884605,0.32761467,0.38333455,0.2599792,0.00614034,0.008739096],"study_design_scores_gemma":[0.0037972117,0.00051144994,0.00053423183,0.00055953366,0.00032290598,0.00012554225,0.006467324,0.87550515,0.020331929,0.05835372,0.031406853,0.0020841279],"about_ca_topic_score_codex":0.00023318535,"about_ca_topic_score_gemma":0.00031028257,"teacher_disagreement_score":0.8817681,"about_ca_system_score_codex":0.00028537595,"about_ca_system_score_gemma":0.000080900085,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W2296715623","doi":"10.1049/iet-com.2015.0543","title":"Diversity combining in bi‐directional relay networks with energy harvesting nodes","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Relay; Diversity (politics); Computer science; Energy harvesting; Diversity combining; Computer network; Energy (signal processing); Telecommunications; Mathematics; Fading; Statistics; Physics","score_opus":0.017718089771224355,"score_gpt":0.20130921466746324,"score_spread":0.18359112489623888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296715623","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.38411155,0.0030650352,0.54222244,0.0016116411,0.0007365644,0.0002146973,0.000018907476,0.0028473167,0.06517183],"genre_scores_gemma":[0.9847297,0.0006648195,0.014029887,0.000047338337,0.000055037337,0.000041287403,0.000016695238,0.0000397334,0.0003755096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908894,0.00011310028,0.00022643627,0.00016040589,0.00012767836,0.0002834308],"domain_scores_gemma":[0.9980155,0.0008929353,0.000057306068,0.0009018625,0.000058804206,0.0000735429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021359981,0.00015235056,0.0001566816,0.00010713098,0.0006134623,0.000027662622,0.0006921958,0.00010342099,0.000015103641],"category_scores_gemma":[0.000056277695,0.00012899873,0.000032097363,0.00042753172,0.00017517756,0.00026552586,0.0007014135,0.0002813518,0.0000050072854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006812463,0.000045528646,0.121299066,0.0000051398633,0.00004799056,0.0000036403535,0.00021329061,0.85892475,0.00022712817,0.008589714,0.00037748434,0.010259459],"study_design_scores_gemma":[0.0014477347,0.00004944634,0.13333042,0.0012821567,0.000039718965,0.000039814033,0.00009662978,0.8446211,0.0002651506,0.00056701596,0.017433772,0.0008270013],"about_ca_topic_score_codex":0.00050865277,"about_ca_topic_score_gemma":0.003710221,"teacher_disagreement_score":0.6006181,"about_ca_system_score_codex":0.00014803388,"about_ca_system_score_gemma":0.000018372879,"threshold_uncertainty_score":0.5260415},"labels":[],"label_agreement":null},{"id":"W2300078924","doi":"10.1049/iet-com.2015.0278","title":"Impact of spatial correlation on the BER performance of cooperative wireless relay networks with OSTBC","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Relay; Computer science; Wireless; Correlation; Wireless network; Spatial correlation; Computer network; Telecommunications; Mathematics; Physics","score_opus":0.03307229851139004,"score_gpt":0.2815571083553935,"score_spread":0.24848480984400345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300078924","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.5350281,0.00029857145,0.4543319,0.004839961,0.00006837389,0.0004762014,0.000010780953,0.0000641895,0.0048819184],"genre_scores_gemma":[0.99584556,0.0018296599,0.0020319552,0.0000720546,0.000013621713,0.00004684734,0.000008121919,0.000010009871,0.0001421539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870694,0.0004620283,0.00033491736,0.00015836966,0.00018696787,0.00015078193],"domain_scores_gemma":[0.99480236,0.001319782,0.00030786646,0.0030109652,0.0005164189,0.00004260973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004066942,0.0001366975,0.00018665701,0.00006874274,0.0003642008,0.000029158049,0.00216605,0.000051714323,0.00004324564],"category_scores_gemma":[0.00006569153,0.00006927673,0.000072664225,0.0005431669,0.00038698697,0.00029694452,0.00052888517,0.00023588067,0.000012696154],"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.00034689196,0.0011059864,0.12295717,0.000012790944,0.00047329278,5.4886385e-7,0.006221878,0.072873384,0.006663659,0.45009863,0.0025602698,0.3366855],"study_design_scores_gemma":[0.0007815266,0.0009997159,0.16125475,0.00046872394,0.000019700667,0.0000053922854,0.000036470898,0.8340695,0.001383913,0.000055505036,0.0006810898,0.00024372198],"about_ca_topic_score_codex":0.000039188544,"about_ca_topic_score_gemma":0.0001459013,"teacher_disagreement_score":0.76119614,"about_ca_system_score_codex":0.000069576716,"about_ca_system_score_gemma":0.00013227733,"threshold_uncertainty_score":0.4025096},"labels":[],"label_agreement":null},{"id":"W2313449680","doi":"10.1049/iet-com.2015.0624","title":"Cooperative jamming polar codes for multiple‐access wiretap channels","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Secrecy; Jamming; Computer network; Block code; Channel (broadcasting); Block (permutation group theory); Coding (social sciences); Upper and lower bounds; Polar code; Polar; Binary symmetric channel; Theoretical computer science; Algorithm; Decoding methods; Computer security; Mathematics; Channel capacity; Statistics","score_opus":0.0778249746291123,"score_gpt":0.35500888505475364,"score_spread":0.27718391042564133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313449680","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.0043263086,0.00023307065,0.978858,0.013760784,0.00024302653,0.00060015934,0.000035041678,0.0009086508,0.0010349634],"genre_scores_gemma":[0.8174502,0.0001154361,0.18137701,0.0003107275,0.00003356985,0.00038258045,0.000007948997,0.00001680511,0.00030569246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882984,0.00019133983,0.0002678803,0.00030682058,0.00013131935,0.00027279241],"domain_scores_gemma":[0.99459153,0.0019475843,0.00014632934,0.0028373948,0.00040366195,0.00007347612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049437885,0.00014924865,0.00017784606,0.000121594785,0.0005932019,0.00023119015,0.0049052704,0.00007036794,0.0000045230845],"category_scores_gemma":[0.00072995265,0.00011660357,0.00008074761,0.0003477795,0.000158729,0.0010006258,0.0014477015,0.00013480164,0.000025206888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051410385,0.0009371524,0.018326549,0.00007540073,0.00027520346,0.0000038166154,0.022774767,0.00010331829,0.09727761,0.43554392,0.03067177,0.39395908],"study_design_scores_gemma":[0.0037774465,0.0010440598,0.0067223166,0.0014702339,0.00009723945,0.00007308502,0.00071103347,0.3611882,0.3140726,0.0651823,0.24278504,0.0028764347],"about_ca_topic_score_codex":0.00015518592,"about_ca_topic_score_gemma":0.0004398311,"teacher_disagreement_score":0.81312394,"about_ca_system_score_codex":0.00008612661,"about_ca_system_score_gemma":0.00008645843,"threshold_uncertainty_score":0.9115295},"labels":[],"label_agreement":null},{"id":"W2318997196","doi":"10.1049/iet-com.2015.1213","title":"Cross‐layer aware joint design of sensing and frame durations in cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Cognitive radio; Joint (building); Computer science; Frame (networking); Layer (electronics); Cognition; Computer network; Telecommunications; Speech recognition; Wireless; Psychology; Neuroscience; Engineering","score_opus":0.06456444464341583,"score_gpt":0.3034291128124583,"score_spread":0.2388646681690425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318997196","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.020185651,0.00064581237,0.9755171,0.002685694,0.00006609496,0.00024713375,0.0000061992932,0.00005975855,0.0005865671],"genre_scores_gemma":[0.96471834,0.00088456715,0.03419563,0.00010628499,0.000031662898,0.0000065607237,0.0000037353182,0.000010781042,0.000042427233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871904,0.00033357143,0.0003588307,0.00025298126,0.000097079675,0.00023847895],"domain_scores_gemma":[0.9970361,0.0015871251,0.0001456571,0.00093855127,0.00022342468,0.00006915226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004140758,0.00012610256,0.00020772462,0.0001384153,0.00027712126,0.000111163085,0.0004151804,0.00008026227,0.000007962089],"category_scores_gemma":[0.00017119017,0.000105995874,0.000045925382,0.0004463129,0.00032812037,0.0003735927,0.00039769316,0.00021067474,0.0000032797575],"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.000089257745,0.0006051635,0.015784675,0.000026659125,0.00028907592,0.000041461608,0.008993959,0.011113486,0.02214784,0.07064342,0.0008631859,0.8694018],"study_design_scores_gemma":[0.0008544355,0.00006267956,0.051443912,0.0005207122,0.000018042794,0.00006132725,0.000108869164,0.9409867,0.0007647431,0.004737986,0.00017093412,0.0002696659],"about_ca_topic_score_codex":0.000082864935,"about_ca_topic_score_gemma":0.00022751236,"teacher_disagreement_score":0.9445327,"about_ca_system_score_codex":0.00005164557,"about_ca_system_score_gemma":0.0000708261,"threshold_uncertainty_score":0.43223864},"labels":[],"label_agreement":null},{"id":"W2325372342","doi":"10.1049/iet-com.2015.0906","title":"Performance study of opportunistic scheduling in dual‐hop multi‐user underlay cognitive network","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cumulative distribution function; Scheduling (production processes); Cognitive radio; Probability density function; Mathematical optimization; Monte Carlo method; Diversity gain; Fading; Algorithm; Mathematics; Telecommunications; Statistics; Wireless","score_opus":0.13859499111322576,"score_gpt":0.34601300805511137,"score_spread":0.2074180169418856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325372342","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.76488006,0.0010554865,0.22484586,0.0035378495,0.00019512867,0.0010710207,0.0000078545545,0.00021382519,0.0041929204],"genre_scores_gemma":[0.9789223,0.0026122164,0.017920155,0.00013636047,0.000017836095,0.00009211772,0.000005593326,0.000012250763,0.0002811754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816364,0.0006269374,0.0005165526,0.00025830613,0.00017595479,0.00025862124],"domain_scores_gemma":[0.9956639,0.0011328356,0.00021266671,0.002603565,0.00031196728,0.00007510787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077029463,0.00014852446,0.00023376913,0.00013900646,0.00037471607,0.000046866022,0.0018560848,0.000048815597,0.000020473484],"category_scores_gemma":[0.00019051362,0.00012250178,0.000040210278,0.00087391224,0.00017043031,0.0004397799,0.0017742408,0.0002425662,0.000032322685],"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.0000828783,0.0086988015,0.3071729,0.00005007197,0.00036695684,0.000017046663,0.04043394,0.0052760732,0.0037945912,0.22740099,0.0005686931,0.40613705],"study_design_scores_gemma":[0.00838865,0.000822208,0.3685128,0.0020481371,0.000076555945,0.000023133898,0.0055354116,0.6071309,0.00021358846,0.0007444831,0.0053059617,0.0011982014],"about_ca_topic_score_codex":0.000017262093,"about_ca_topic_score_gemma":0.00086402457,"teacher_disagreement_score":0.6018548,"about_ca_system_score_codex":0.00006393393,"about_ca_system_score_gemma":0.00011972589,"threshold_uncertainty_score":0.49954772},"labels":[],"label_agreement":null},{"id":"W2333338207","doi":"10.1049/iet-com.2015.0881","title":"Decoding schedule generating method for successive‐cancellation decoder of polar codes","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6,"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":"Fundamental Research Funds for the Central Universities; University of Toronto; Harbin Institute of Technology; National Natural Science Foundation of China","keywords":"Decoding methods; Computer science; Schedule; Polar; Algorithm; Sequential decoding; Arithmetic; Mathematics; Block code","score_opus":0.05541009581613126,"score_gpt":0.37748773701690597,"score_spread":0.3220776412007747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333338207","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.0032229647,0.0003793547,0.99160904,0.0033526681,0.00009681936,0.0002575917,0.000015054086,0.00028723496,0.0007792874],"genre_scores_gemma":[0.43481004,0.00004420536,0.5649425,0.000060759976,0.000015441045,0.00006251691,0.0000032770854,0.000008558654,0.00005274433],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886936,0.00023174562,0.00035846827,0.00022916989,0.00012557293,0.00018565486],"domain_scores_gemma":[0.9951919,0.002156515,0.0003157457,0.0019220109,0.00037035428,0.000043481392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088881096,0.00010646187,0.00017101964,0.00012546094,0.00034235156,0.00005698018,0.0019562293,0.000065236796,0.0000055058445],"category_scores_gemma":[0.0006587222,0.00008860581,0.00007921998,0.0002871955,0.00006696513,0.00046201888,0.00051739014,0.000088083994,0.0000034193974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005982588,0.000107255735,0.0042707897,0.00003207212,0.000047381167,1.5553047e-7,0.00133227,0.00021909506,0.4920025,0.2448029,0.00097305456,0.25620654],"study_design_scores_gemma":[0.00036123063,0.00007301303,0.00031993,0.00018995692,0.000018301966,0.000005517932,0.00006811362,0.7191133,0.2584113,0.016843643,0.0043174396,0.0002783064],"about_ca_topic_score_codex":0.00008261583,"about_ca_topic_score_gemma":0.00030801748,"teacher_disagreement_score":0.7188942,"about_ca_system_score_codex":0.00007223789,"about_ca_system_score_gemma":0.00009480144,"threshold_uncertainty_score":0.36351934},"labels":[],"label_agreement":null},{"id":"W2339491603","doi":"10.1049/iet-com.2015.1048","title":"Linearisation of radio frequency power amplifiers exhibiting memory effects using direct learning‐based adaptive digital predistoriton","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Amplifier; Computer science; Radio frequency; Power (physics); Digital radio; Electronic engineering; Telecommunications; Bandwidth (computing); Physics; Engineering","score_opus":0.021430580774337796,"score_gpt":0.24158599496720579,"score_spread":0.220155414192868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339491603","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.02997334,0.0012666975,0.9449416,0.000057069323,0.00030320225,0.00048577244,0.000073674855,0.0006537398,0.022244912],"genre_scores_gemma":[0.976818,0.00004094766,0.02289857,0.000006861174,0.000036966234,0.00004071772,0.0000289657,0.00006213747,0.000066804474],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989265,0.0001308076,0.00034889477,0.00017930997,0.00017634594,0.0002381118],"domain_scores_gemma":[0.9975104,0.0011867894,0.00013903803,0.0009506873,0.00013207317,0.000081044374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017574013,0.00018782186,0.00023591866,0.00013628557,0.00016326157,0.000028129347,0.00041380787,0.00009957611,0.000014826507],"category_scores_gemma":[0.00039184632,0.00017834168,0.00009542283,0.00025611688,0.00018865825,0.00045948202,0.00007433509,0.00025071803,0.000015298636],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106323925,0.00047802954,0.01072657,0.00036422405,0.00060218666,0.000009828825,0.006622031,0.22590637,0.69725066,0.0039070984,0.0010142511,0.05301241],"study_design_scores_gemma":[0.009802321,0.001579832,0.013299803,0.005847845,0.0007137172,0.000052748128,0.0026493447,0.61430436,0.3115609,0.013478227,0.021221727,0.005489195],"about_ca_topic_score_codex":0.00002511489,"about_ca_topic_score_gemma":0.00000496034,"teacher_disagreement_score":0.9468447,"about_ca_system_score_codex":0.0003148934,"about_ca_system_score_gemma":0.00005865744,"threshold_uncertainty_score":0.7272563},"labels":[],"label_agreement":null},{"id":"W2343701890","doi":"10.1049/iet-com.2015.0876","title":"Optimal power allocation to improve secrecy performance of non‐regenerative cooperative systems using an untrusted relay","year":2016,"lang":"en","type":"article","venue":"IET Communications","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":"University of Alberta","funders":"","keywords":"Secrecy; Relay; Computer science; Computer network; Power (physics); Computer security","score_opus":0.026751281704157078,"score_gpt":0.2849738364231965,"score_spread":0.25822255471903943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343701890","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.8713086,0.0003530001,0.12517552,0.000348909,0.000119295975,0.0007703778,0.00009982562,0.00038935474,0.0014350954],"genre_scores_gemma":[0.94714016,0.00041531288,0.051961217,0.000027276645,0.000020941996,0.00026174638,0.00005044083,0.000052146548,0.00007075342],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986478,0.00023339655,0.0005344227,0.00019213685,0.00017530214,0.00021692367],"domain_scores_gemma":[0.99598235,0.00018521176,0.0001334602,0.0029738082,0.0006089829,0.000116192576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002982141,0.00020677297,0.0002770269,0.00019331844,0.00022223586,0.00004864745,0.00132938,0.00013532223,0.00002099187],"category_scores_gemma":[0.00005753607,0.00018281353,0.000042968026,0.00045128795,0.0001653204,0.0006318996,0.0003153515,0.00021865575,0.00002505126],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021124652,0.00017983424,0.0002253875,0.000039580875,0.00009953126,1.5663167e-7,0.005008003,0.09522945,0.8885176,0.008393189,0.00027239308,0.0020137432],"study_design_scores_gemma":[0.0004385006,0.00030403733,0.0009952694,0.00041793057,0.00003327497,0.000006964625,0.0008002184,0.74650854,0.24738804,0.000014804238,0.0026115433,0.00048087063],"about_ca_topic_score_codex":0.000099365985,"about_ca_topic_score_gemma":0.000061997045,"teacher_disagreement_score":0.6512791,"about_ca_system_score_codex":0.0002458841,"about_ca_system_score_gemma":0.00007884618,"threshold_uncertainty_score":0.7454919},"labels":[],"label_agreement":null},{"id":"W2402627865","doi":"10.1049/iet-com.2016.0077","title":"Simplified search and construction of capacity‐approaching variable‐length constrained sequence codes","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Computer science; Variable (mathematics); Algorithm; Mathematics; Mathematical optimization; Genetics; Biology","score_opus":0.08051680200167717,"score_gpt":0.29591895667195695,"score_spread":0.2154021546702798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402627865","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.029065236,0.00011090557,0.96603084,0.0018365594,0.00005989758,0.00015686438,0.00012757443,0.00009908971,0.0025130128],"genre_scores_gemma":[0.5699123,0.00018329493,0.42984018,0.000025997837,0.00000586701,0.000008256758,0.0000079096,0.0000030932033,0.000013092728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990203,0.00021207344,0.00023988157,0.00021519052,0.00015666483,0.00015589583],"domain_scores_gemma":[0.99739856,0.000570762,0.000090497044,0.0017164622,0.00014885959,0.00007487041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045319466,0.00009050237,0.00014490176,0.00007604777,0.00030159467,0.000065429835,0.0012649442,0.000054866843,0.000008411893],"category_scores_gemma":[0.000100955665,0.0000668682,0.00002149304,0.00022374178,0.0006366302,0.00057074684,0.0009104749,0.00013953539,0.0000035961073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026948892,0.00004678712,0.0005413228,0.000013335739,0.000017854198,2.3300137e-7,0.0004500669,0.000010320915,0.029468926,0.87712896,0.00003829319,0.092281185],"study_design_scores_gemma":[0.0036340219,0.00036694997,0.009210239,0.001138381,0.00007671826,0.0005308478,0.0013469086,0.70047885,0.02566246,0.2380919,0.018100988,0.0013617246],"about_ca_topic_score_codex":0.00023963534,"about_ca_topic_score_gemma":0.000014158794,"teacher_disagreement_score":0.70046854,"about_ca_system_score_codex":0.000024153343,"about_ca_system_score_gemma":0.00009718601,"threshold_uncertainty_score":0.2726806},"labels":[],"label_agreement":null},{"id":"W2410996924","doi":"10.1049/iet-com.2015.0943","title":"Performance enhancement of multi‐hop relay‐based wireless systems based on outage probability","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hop (telecommunications); Relay; Computer science; Outage probability; Wireless; Computer network; Wireless network; Telecommunications; Fading; Channel (broadcasting)","score_opus":0.08723189252725588,"score_gpt":0.3050085729121892,"score_spread":0.2177766803849333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410996924","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.06517099,0.0004735656,0.9177963,0.009971549,0.00023370193,0.0009827375,0.000016501934,0.00025424716,0.0051003685],"genre_scores_gemma":[0.9610536,0.0005267142,0.037668932,0.0002265987,0.000007948159,0.00025298176,0.000009959872,0.000010346682,0.00024289219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979442,0.0007866171,0.0004962368,0.00028793246,0.00026983125,0.00021521373],"domain_scores_gemma":[0.99236035,0.001023242,0.0002601938,0.0058768005,0.00039938747,0.00008002641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010677301,0.00016192286,0.00022250954,0.00011375909,0.00037939727,0.000054560263,0.0033786471,0.000060060494,0.000022080298],"category_scores_gemma":[0.00014255765,0.000121986566,0.000078259654,0.00046957302,0.00023372134,0.00025342478,0.00061106903,0.0001826873,0.000055973876],"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.00023918349,0.009368629,0.033896398,0.0005163386,0.00017755042,0.000001886788,0.0038972164,0.020123325,0.108807854,0.24829106,0.0026362813,0.57204425],"study_design_scores_gemma":[0.00075580855,0.00013398468,0.0030207874,0.00043450677,0.0000059228573,3.704175e-7,0.000010685511,0.98252434,0.005761909,0.0000172429,0.007144353,0.0001901115],"about_ca_topic_score_codex":0.000010030056,"about_ca_topic_score_gemma":0.000030457491,"teacher_disagreement_score":0.962401,"about_ca_system_score_codex":0.00015751595,"about_ca_system_score_gemma":0.0001757777,"threshold_uncertainty_score":0.6278423},"labels":[],"label_agreement":null},{"id":"W2415023907","doi":"10.1049/iet-com.2016.0318","title":"On the capacity and energy efficiency of non‐coherent Rayleigh fading channels with additive Gaussian mixture noise","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Rayleigh fading; Upper and lower bounds; Spectral efficiency; Transmitter; Channel capacity; Channel state information; Channel (broadcasting); Fading; Additive white Gaussian noise; Gaussian; Computer science; Efficient energy use; Topology (electrical circuits); Energy (signal processing); Mathematics; Telecommunications; Wireless; Physics; Statistics; Mathematical analysis; Electrical engineering; Engineering","score_opus":0.013036454847476597,"score_gpt":0.21532558816971228,"score_spread":0.2022891333222357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415023907","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.047089547,0.00056205323,0.93394154,0.0013666401,0.00012618628,0.00039344857,0.00015562032,0.00017283774,0.016192095],"genre_scores_gemma":[0.99669546,0.00039984653,0.0026298142,0.000020342175,0.000015235671,0.000107777734,0.000009530053,0.000020598696,0.00010140907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951506,0.000057017038,0.0001471277,0.00009347352,0.000072082774,0.0001152617],"domain_scores_gemma":[0.998614,0.0003836875,0.00006828954,0.00083196507,0.00006622813,0.00003582057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007228396,0.00010713106,0.00011648852,0.000051303294,0.00013731467,0.0000104360315,0.000305911,0.00004409134,0.00001623839],"category_scores_gemma":[0.000037626516,0.00006068628,0.000019810825,0.00016368725,0.00014774509,0.000091907874,0.000053861393,0.00008813491,0.0000032174253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099361845,0.00064658286,0.0005157587,0.00021531215,0.000608147,0.00000280455,0.022601904,0.37412044,0.20901415,0.34106594,0.005877081,0.045232505],"study_design_scores_gemma":[0.0054331776,0.0010915606,0.0032467109,0.007911357,0.0002902857,0.00007371141,0.0034007744,0.61738265,0.31677634,0.008601328,0.033102192,0.0026899362],"about_ca_topic_score_codex":0.000024328496,"about_ca_topic_score_gemma":0.000078684374,"teacher_disagreement_score":0.9496059,"about_ca_system_score_codex":0.000046270445,"about_ca_system_score_gemma":0.000008942388,"threshold_uncertainty_score":0.24747147},"labels":[],"label_agreement":null},{"id":"W2418350050","doi":"10.1049/iet-com.2016.0473","title":"Energy‐efficient pilot and data power allocation in massive multi‐user multiple‐input multiple‐output communication systems","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Power (physics); Energy (signal processing); Communications system; Efficient energy use; Real-time computing; Computer network; Statistics; Electrical engineering; Mathematics","score_opus":0.048873347634488425,"score_gpt":0.27610058841577706,"score_spread":0.22722724078128864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418350050","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.010887855,0.007854569,0.9765754,0.0012116687,0.00033017102,0.0011729328,0.0003291457,0.0006565976,0.0009816587],"genre_scores_gemma":[0.9658954,0.002799132,0.02999887,0.000027034595,0.000019462985,0.0003655699,0.0005078543,0.000081479535,0.00030517922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980807,0.00034345826,0.0007016899,0.00038870497,0.00017124672,0.0003142317],"domain_scores_gemma":[0.9930626,0.0010075009,0.00019070356,0.0054217936,0.00020626406,0.00011113282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004708754,0.00027442764,0.0002918451,0.00025954624,0.00022921982,0.00008075274,0.0017578498,0.0001388521,0.000005165922],"category_scores_gemma":[0.000372189,0.00025009032,0.000026362779,0.00037875198,0.00019839914,0.0006155833,0.00088637957,0.00021527016,0.00003226824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005631807,0.00081521185,0.01231412,0.00012147587,0.0001749705,0.0000023477237,0.00251052,0.93407094,0.023056816,0.014768249,0.002212608,0.009896444],"study_design_scores_gemma":[0.001711512,0.000023261813,0.0032042596,0.000376588,0.000018672155,0.0000065289883,0.00049601874,0.98082316,0.00017309187,0.000023374561,0.012780891,0.00036265873],"about_ca_topic_score_codex":0.0004716409,"about_ca_topic_score_gemma":0.0019927141,"teacher_disagreement_score":0.95500755,"about_ca_system_score_codex":0.00029962792,"about_ca_system_score_gemma":0.0000356617,"threshold_uncertainty_score":0.9999951},"labels":[],"label_agreement":null},{"id":"W2439357740","doi":"10.1049/iet-com.2016.0128","title":"Joint wavelet‐based spectrum sensing and FBMC modulation for cognitive mmWave small cell networks","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Joint (building); Cognitive radio; Computer science; Modulation (music); Wavelet; Spectrum (functional analysis); Telecommunications; Artificial intelligence; Acoustics; Wireless; Physics; Engineering","score_opus":0.04397928670828304,"score_gpt":0.24056533055352572,"score_spread":0.19658604384524267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2439357740","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.054291,0.0004178642,0.9380433,0.0019989526,0.00022415015,0.00049928174,0.000051088624,0.00032246247,0.0041519194],"genre_scores_gemma":[0.971395,0.00021509314,0.02800936,0.000044592045,0.00008523803,0.000040448784,0.000049594855,0.00003787286,0.00012276066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993757,0.000051875384,0.00020923688,0.00013031997,0.000044990193,0.00018786671],"domain_scores_gemma":[0.9987147,0.00046108357,0.000054080658,0.0006283721,0.00007997856,0.000061800194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001369722,0.00011941665,0.00012142139,0.00008107902,0.00018739488,0.00003143391,0.00013318713,0.000076146476,0.000010347822],"category_scores_gemma":[0.0000555804,0.00011189865,0.00004929057,0.00010462955,0.00010103022,0.00008153489,0.000058973503,0.00011920036,0.000011927037],"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.00014687996,0.0004872975,0.0014286063,0.00043333738,0.0005654218,0.0000031015622,0.0034359468,0.10418643,0.22301434,0.010392333,0.009381769,0.64652455],"study_design_scores_gemma":[0.0008412747,0.000027007007,0.0031318872,0.0001308063,0.000042245356,0.000006383319,0.000110823465,0.98075175,0.009998258,0.001586609,0.0031340295,0.00023895211],"about_ca_topic_score_codex":0.000013927948,"about_ca_topic_score_gemma":0.000072664436,"teacher_disagreement_score":0.91710407,"about_ca_system_score_codex":0.00007934396,"about_ca_system_score_gemma":0.000016636634,"threshold_uncertainty_score":0.45630944},"labels":[],"label_agreement":null},{"id":"W2472981973","doi":"10.1049/iet-com.2016.0076","title":"Opportunistic scheduling for a two‐way relay network using Markov decision process","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Relay; Markov decision process; Markov process; Scheduling (production processes); Partially observable Markov decision process; Computer network; Decision process; Markov chain; Markov model; Mathematical optimization; Machine learning; Mathematics; Business; Statistics; Process management","score_opus":0.11711992038712456,"score_gpt":0.37751159357729364,"score_spread":0.2603916731901691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472981973","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.0034016198,0.0012613939,0.9871692,0.005656192,0.0002220589,0.0004633431,0.000008708273,0.00022226135,0.0015952335],"genre_scores_gemma":[0.5703532,0.00089490216,0.42808232,0.00032026612,0.00006975383,0.00011890117,0.000009692655,0.000017460017,0.00013349368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983175,0.00027324175,0.00048174433,0.00035543542,0.0001938983,0.00037822957],"domain_scores_gemma":[0.99315363,0.0019588927,0.0002310722,0.003993499,0.0005140999,0.0001488007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010495962,0.00018277937,0.0002196139,0.000103515515,0.0012941494,0.00018818906,0.0040835314,0.00006851066,0.000024572619],"category_scores_gemma":[0.00048612495,0.00014586325,0.00010492056,0.00069691584,0.0001555033,0.0005781975,0.0014086546,0.00018929418,0.00002601564],"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.00002951421,0.00018472163,0.00069077517,0.000014453828,0.000058660095,0.0000011315609,0.0006594515,0.0039866953,0.0037444604,0.41697407,0.0017173449,0.5719387],"study_design_scores_gemma":[0.0012145047,0.00006110342,0.00032753026,0.0006677459,0.000031818443,0.000022390082,0.000039924613,0.9330253,0.00016628948,0.020473585,0.04349337,0.0004764396],"about_ca_topic_score_codex":0.0000036798506,"about_ca_topic_score_gemma":0.00007610164,"teacher_disagreement_score":0.9290386,"about_ca_system_score_codex":0.00011581136,"about_ca_system_score_gemma":0.00021497396,"threshold_uncertainty_score":0.99536824},"labels":[],"label_agreement":null},{"id":"W2476671745","doi":"10.1049/iet-com.2015.0954","title":"NDA SNR estimation using fourth‐order cross‐moments in time‐varying single‐input multiple‐output channels","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Order (exchange); Algorithm; Mathematics; Statistics; Control theory (sociology); Artificial intelligence","score_opus":0.07622557198034358,"score_gpt":0.33753516576554593,"score_spread":0.26130959378520235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476671745","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.08114822,0.00006900217,0.9120548,0.004566676,0.000105069215,0.0004148612,0.000008587732,0.00048318837,0.0011496074],"genre_scores_gemma":[0.6514876,0.000026027394,0.347874,0.00022768795,0.000014251962,0.000056289166,0.000013081893,0.000016254942,0.0002848489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825865,0.0002950862,0.00048972917,0.00033561146,0.00031514117,0.00030578484],"domain_scores_gemma":[0.9965139,0.00055785413,0.00023178836,0.0023742518,0.00024062415,0.0000815753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007165143,0.00017949451,0.00018945792,0.00031849183,0.00035573277,0.0004082553,0.002458889,0.00011998688,0.000015660136],"category_scores_gemma":[0.0003548096,0.00016190739,0.000058637215,0.0007339501,0.00015197607,0.0015156112,0.0010843341,0.00019787395,0.00013403514],"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.000096156495,0.0055458937,0.063146256,0.00010683461,0.00027935317,0.000019888448,0.050658382,0.09605177,0.3043356,0.048774987,0.0032220865,0.4277628],"study_design_scores_gemma":[0.00089883566,0.000049897924,0.002593262,0.00023891224,0.000006453159,0.000011107385,0.000013548822,0.97818154,0.009451499,0.0052552153,0.002933842,0.0003659055],"about_ca_topic_score_codex":0.00010613878,"about_ca_topic_score_gemma":0.00003359796,"teacher_disagreement_score":0.8821297,"about_ca_system_score_codex":0.00022725604,"about_ca_system_score_gemma":0.00011495913,"threshold_uncertainty_score":0.66023916},"labels":[],"label_agreement":null},{"id":"W2482095914","doi":"10.1049/iet-com.2015.1205","title":"Fundamental limits of caching: improved bounds for users with small buffers","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Set (abstract data type); Upper and lower bounds; Computer network; Cache; Buffer (optical fiber); Algorithm; Mathematics; Telecommunications","score_opus":0.06948129246839965,"score_gpt":0.2722086962207822,"score_spread":0.20272740375238255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482095914","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.30982655,0.0003944882,0.6723698,0.014201188,0.00019704139,0.0005492301,0.0000643932,0.00023576144,0.0021615527],"genre_scores_gemma":[0.9657905,0.000057154917,0.03342245,0.00018570828,0.000009999366,0.000064275984,0.0000068716886,0.000009169857,0.00045388102],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993471,0.000060749808,0.0001739419,0.00016908639,0.000085253814,0.00016384905],"domain_scores_gemma":[0.9975311,0.00040011105,0.000113792514,0.0017802144,0.000116675816,0.000058077065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019227903,0.00009123247,0.00011946435,0.000064036365,0.0002306682,0.00006077957,0.0017183259,0.00003210614,0.0000013996253],"category_scores_gemma":[0.000039404396,0.00006345763,0.00007515511,0.00012279235,0.00013746318,0.00023015666,0.0002672336,0.000076204,0.000003724332],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028690937,0.0013724377,0.021467801,0.00008457974,0.0006127229,0.0000018607901,0.00545329,0.00008614323,0.4387345,0.28498366,0.0030853436,0.24383074],"study_design_scores_gemma":[0.03955361,0.011255483,0.06959782,0.0030159745,0.00087173947,0.00025449978,0.0052844244,0.37179956,0.062179893,0.02613505,0.40358987,0.006462074],"about_ca_topic_score_codex":0.00022661962,"about_ca_topic_score_gemma":0.00045653287,"teacher_disagreement_score":0.65596396,"about_ca_system_score_codex":0.00005110511,"about_ca_system_score_gemma":0.00008468254,"threshold_uncertainty_score":0.31931058},"labels":[],"label_agreement":null},{"id":"W2490336733","doi":"10.1049/iet-com.2016.0372","title":"Dual‐hop signal space cooperative systems using multiple DF relays","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Hop (telecommunications); Dual (grammatical number); Relay; Telecommunications; SIGNAL (programming language); Computer network; Topology (electrical circuits); Electrical engineering; Physics","score_opus":0.09838602357897028,"score_gpt":0.31265409243536135,"score_spread":0.21426806885639108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490336733","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.003424262,0.0030768854,0.97192097,0.012585662,0.00027565152,0.0006385362,0.000020795229,0.00038216877,0.0076750666],"genre_scores_gemma":[0.9625693,0.0019560219,0.0339821,0.00022157996,0.000059969534,0.00013141947,0.0000097262,0.000020577745,0.0010493158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977264,0.00093307754,0.00043136234,0.00034828208,0.00023338146,0.0003275387],"domain_scores_gemma":[0.99338996,0.001376673,0.0002005357,0.0043530515,0.0005313335,0.00014841503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005988903,0.00021192081,0.00024528548,0.0001370585,0.0011032537,0.00028091818,0.003123208,0.0000869302,0.00004308026],"category_scores_gemma":[0.00021163547,0.00016447343,0.000082248436,0.0007565015,0.00026636382,0.0008131177,0.0021710997,0.00028033456,0.00021158047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000989759,0.00030186857,0.0013766696,0.00000907442,0.00010809745,0.000004264534,0.0028481316,0.001626542,0.060867343,0.89948213,0.0058128084,0.02755316],"study_design_scores_gemma":[0.0011921298,0.000090815054,0.0005643995,0.0003926108,0.000023629465,0.000062204956,0.00033972363,0.81173295,0.001791862,0.0007072061,0.18243718,0.00066530163],"about_ca_topic_score_codex":0.00004598575,"about_ca_topic_score_gemma":0.0001461125,"teacher_disagreement_score":0.959145,"about_ca_system_score_codex":0.00019143513,"about_ca_system_score_gemma":0.00018336592,"threshold_uncertainty_score":0.84854466},"labels":[],"label_agreement":null},{"id":"W2499030722","doi":"10.1049/iet-com.2016.0132","title":"Joint interpolation for LTE downlink channel estimation in very high‐mobility environments with support vector machine regression","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Joint (building); Telecommunications link; Computer science; Support vector machine; Interpolation (computer graphics); Channel (broadcasting); Algorithm; Artificial intelligence; Computer network; Engineering","score_opus":0.021809543932045185,"score_gpt":0.26994719022416314,"score_spread":0.24813764629211796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499030722","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.021286942,0.00028841864,0.97399926,0.0021844835,0.00006624398,0.0010698475,0.000156187,0.00054138794,0.00040725566],"genre_scores_gemma":[0.9013414,0.0008885743,0.09649836,0.00002795614,0.000008270898,0.0007964217,0.00033904784,0.000042299638,0.000057684654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898994,0.00009027547,0.00042537876,0.00018270472,0.000121780526,0.00018992394],"domain_scores_gemma":[0.9973386,0.00028338758,0.00013090052,0.0021553442,0.00003915036,0.00005264845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027588388,0.00018209867,0.00020697998,0.00015768573,0.00012722786,0.000016587896,0.0006241341,0.00009679232,0.000027088377],"category_scores_gemma":[0.00007575599,0.00013933577,0.00004398125,0.00016061174,0.0001303806,0.00045952396,0.00020209426,0.00019619899,0.000019409083],"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.0006710673,0.002796481,0.0082685435,0.0005522916,0.00035466166,0.000003098161,0.005318784,0.041126627,0.4442543,0.02753898,0.003429323,0.46568584],"study_design_scores_gemma":[0.0041702027,0.00052464794,0.06729994,0.001646051,0.00007219799,0.000013018938,0.00017123128,0.788473,0.099359564,0.021369716,0.015549149,0.001351273],"about_ca_topic_score_codex":0.000029938285,"about_ca_topic_score_gemma":0.00016259968,"teacher_disagreement_score":0.8800544,"about_ca_system_score_codex":0.00033751523,"about_ca_system_score_gemma":0.000018228095,"threshold_uncertainty_score":0.5681948},"labels":[],"label_agreement":null},{"id":"W2507895428","doi":"10.1049/iet-com.2016.0048","title":"Area spectral efficiency of infrastructure relay enhanced cellular systems","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"","keywords":"Spectral efficiency; Relay; Computer science; Telecommunications link; Rayleigh fading; Transmission (telecommunications); Transmitter power output; Electronic engineering; Bandwidth (computing); Relay channel; Computer network; Single antenna interference cancellation; Fading; Channel (broadcasting); Telecommunications; Transmitter; Power (physics); Engineering; Physics","score_opus":0.028080568633731144,"score_gpt":0.26212991362439597,"score_spread":0.23404934499066482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507895428","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.032107614,0.0030550505,0.9453643,0.0032619834,0.00025101463,0.00027976997,0.000008793139,0.00018721074,0.015484256],"genre_scores_gemma":[0.9805911,0.0024305284,0.016492398,0.00005375894,0.000019624831,0.000035193476,0.0000053162707,0.0000086528335,0.00036343047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986708,0.0003173953,0.0004015049,0.00021476128,0.00018886228,0.00020664341],"domain_scores_gemma":[0.99464184,0.00043559208,0.00021346514,0.004367156,0.00026687825,0.000075046235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032409423,0.0001310995,0.00019604158,0.00011000783,0.00029576904,0.00006247218,0.0041442257,0.00006372822,0.000037622714],"category_scores_gemma":[0.000111424335,0.00009582642,0.00007506398,0.0006071853,0.00022006263,0.00029975313,0.0010893451,0.00017859935,0.00003832683],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041388566,0.00017620022,0.0004746607,0.000012728626,0.000040968793,6.074645e-7,0.002176133,0.0005108489,0.37948552,0.5848941,0.0021630814,0.030060982],"study_design_scores_gemma":[0.0046852357,0.00072931923,0.019324725,0.0021034607,0.00010042411,0.00006276168,0.00082466286,0.35526833,0.36981943,0.013969844,0.2304201,0.0026916876],"about_ca_topic_score_codex":0.0000061332976,"about_ca_topic_score_gemma":0.000016503996,"teacher_disagreement_score":0.94848347,"about_ca_system_score_codex":0.00007119486,"about_ca_system_score_gemma":0.00009648006,"threshold_uncertainty_score":0.7701072},"labels":[],"label_agreement":null},{"id":"W2512701964","doi":"10.1049/iet-com.2016.0593","title":"Impact of access contention on cooperative sensing optimisation in cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Cognitive radio; Computer science; Computer network; Telecommunications; Cognition; Wireless; Psychology; Neuroscience","score_opus":0.0738208690744657,"score_gpt":0.3488521769848617,"score_spread":0.275031307910396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512701964","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.30771065,0.00019738474,0.6874336,0.0013536535,0.00008435452,0.00036425152,0.000012587793,0.00006194099,0.002781592],"genre_scores_gemma":[0.9973143,0.00042580286,0.0021040041,0.00006333429,0.00003485743,0.0000062562117,0.000020087084,0.000006421202,0.000024938408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878067,0.00036002957,0.00030856984,0.00023222898,0.00011013057,0.00020835138],"domain_scores_gemma":[0.9973545,0.0013964068,0.0001864489,0.0006837326,0.00032507005,0.00005383107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029481814,0.0001331837,0.00020544151,0.00013973948,0.00015389759,0.00010069592,0.0006391382,0.00006181613,0.000012474628],"category_scores_gemma":[0.00014500142,0.00009053993,0.00010067752,0.00059400377,0.00012967199,0.0005960498,0.00026802282,0.00017035924,0.0000035086955],"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.00016406004,0.000549402,0.014738642,0.0000035997252,0.00020590956,0.000008312179,0.0014997647,0.011456008,0.006345279,0.020075275,0.00037208857,0.9445817],"study_design_scores_gemma":[0.0017020787,0.0003467809,0.22171278,0.00089882425,0.000020457555,0.000020179157,0.00008000039,0.77284646,0.0008811412,0.0011337247,0.000041597104,0.00031596742],"about_ca_topic_score_codex":0.00020850709,"about_ca_topic_score_gemma":0.00044677162,"teacher_disagreement_score":0.94426566,"about_ca_system_score_codex":0.00018364128,"about_ca_system_score_gemma":0.00006715652,"threshold_uncertainty_score":0.3692111},"labels":[],"label_agreement":null},{"id":"W2525649253","doi":"10.1049/iet-com.2016.0080","title":"Extreme learning machine for 60 GHz millimetre wave positioning","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Millimetre wave; Millimeter; Computer science; Extremely high frequency; Telecommunications; Astronomy; Physics; Optics","score_opus":0.05770384722302277,"score_gpt":0.2872472422198286,"score_spread":0.22954339499680584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525649253","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.0022592875,0.00087353005,0.94880605,0.033915594,0.00011478348,0.00017825296,0.000011596527,0.00044689275,0.013394035],"genre_scores_gemma":[0.8019311,0.00014327149,0.19362022,0.00025947127,0.0000400746,0.000058861646,0.00002939866,0.000014962388,0.0039026672],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989696,0.00020925609,0.00021066063,0.00023635387,0.00012754212,0.00024660042],"domain_scores_gemma":[0.99717516,0.0008123645,0.000114582486,0.0017024976,0.00011643805,0.000078964724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042280546,0.0001158096,0.00012601478,0.00011021905,0.00083268934,0.00011507345,0.0014464426,0.00005008415,0.000034170018],"category_scores_gemma":[0.00026765416,0.00008924547,0.00009306856,0.00026058592,0.000067763125,0.00028804576,0.0005780815,0.00017290746,0.00009406067],"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.00001225751,0.00022780705,0.0031570108,0.000019459525,0.000083477586,0.0000028419904,0.0019766397,0.000478643,0.0064606518,0.12733884,0.004413984,0.8558284],"study_design_scores_gemma":[0.0012363134,0.00022446124,0.0069554825,0.00017462735,0.000030407038,0.000042358148,0.000054169577,0.48777646,0.00064295187,0.014513693,0.4878511,0.00049796334],"about_ca_topic_score_codex":0.00007599916,"about_ca_topic_score_gemma":0.000041616102,"teacher_disagreement_score":0.8553304,"about_ca_system_score_codex":0.000043093667,"about_ca_system_score_gemma":0.00003299685,"threshold_uncertainty_score":0.6404457},"labels":[],"label_agreement":null},{"id":"W2525875107","doi":"10.1049/iet-com.2015.1029","title":"Ergodic sum rate analysis and efficient power allocation for a massive MIMO two‐way relay network","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Ergodic theory; Relay; Computer science; MIMO; Power (physics); Computer network; Telecommunications; Mathematics; Beamforming; Physics","score_opus":0.03143801009714463,"score_gpt":0.29845690920218076,"score_spread":0.2670188991050361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525875107","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.008807746,0.002096258,0.95845324,0.028584477,0.00012325747,0.00047050195,0.000011870401,0.0001644262,0.0012882086],"genre_scores_gemma":[0.9371281,0.0022399623,0.05931717,0.0005493094,0.000029184699,0.00025696785,0.000028326649,0.000013193566,0.0004377552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981901,0.00058365776,0.00039663631,0.00038212427,0.00013480088,0.00031267508],"domain_scores_gemma":[0.9940509,0.0015846514,0.00021852872,0.0035980463,0.0004207619,0.00012710944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010629463,0.00017448876,0.0002433143,0.00020370094,0.00089236203,0.00017724789,0.0021538492,0.00006210345,0.00002513573],"category_scores_gemma":[0.00019958467,0.00013730463,0.00014161719,0.0014375946,0.00021156279,0.00025063744,0.001178262,0.0001458665,0.000029988949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034951398,0.0003442297,0.004196832,0.000008713008,0.0007617806,7.620154e-7,0.0031465415,0.009448486,0.006987503,0.8880906,0.0069719097,0.08000768],"study_design_scores_gemma":[0.0023411373,0.00017143002,0.04494878,0.00019038253,0.00039574024,0.0000056159424,0.00009780345,0.82549185,0.00062194426,0.004182823,0.12067438,0.00087810453],"about_ca_topic_score_codex":0.000014198281,"about_ca_topic_score_gemma":0.00047755003,"teacher_disagreement_score":0.9283204,"about_ca_system_score_codex":0.00009028517,"about_ca_system_score_gemma":0.00007312873,"threshold_uncertainty_score":0.68634176},"labels":[],"label_agreement":null},{"id":"W2527592496","doi":"10.1049/iet-com.2016.1141","title":"Guest Editorial","year":2016,"lang":"en","type":"editorial","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Backhaul (telecommunications); Quality of service; Wireless; Wireless network; Standardization; Computer network; Distributed computing; Telecommunications","score_opus":0.009359496380160768,"score_gpt":0.27338823216267055,"score_spread":0.2640287357825098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527592496","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":[4.8232092e-8,0.0012417893,0.012449834,0.00006790046,0.9676365,0.0002499183,0.00058196543,0.00087324803,0.016898775],"genre_scores_gemma":[0.000053511503,0.003644702,0.0032514734,0.0000021418928,0.9898975,0.0002362453,0.001512731,0.0001515903,0.001250132],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987098,0.0000783349,0.0004332224,0.00019638034,0.0003331226,0.00024916953],"domain_scores_gemma":[0.9952606,0.001013208,0.000121680016,0.003140785,0.00038374553,0.00007999526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018112865,0.0002824627,0.00031652363,0.000118491706,0.00015966212,0.000058828995,0.0015904487,0.0009169563,0.00001980089],"category_scores_gemma":[0.0005239543,0.0002771859,0.00008765798,0.00015954563,0.000096560034,0.00022463221,0.0002623158,0.0008283681,0.0005559642],"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.0000015881579,0.000011139869,3.8281428e-7,0.000037730606,0.000040333183,1.8082997e-7,0.000049547292,0.000581047,0.00006468074,0.00007421799,0.9989418,0.00019737004],"study_design_scores_gemma":[0.00024768888,0.000009103496,1.2532749e-7,0.00018197804,0.000030186176,3.325434e-7,0.0000071807926,0.00035675833,0.000020634212,0.00013669216,0.9987034,0.00030587878],"about_ca_topic_score_codex":0.00001722214,"about_ca_topic_score_gemma":0.00008196612,"teacher_disagreement_score":0.022260953,"about_ca_system_score_codex":0.0003078092,"about_ca_system_score_gemma":0.00010551451,"threshold_uncertainty_score":0.99996805},"labels":[],"label_agreement":null},{"id":"W2528890166","doi":"10.1049/iet-com.2016.0631","title":"Impact of IQ imbalance on the performance of QSM multiple‐input–multiple‐output system","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science","score_opus":0.027591683650203567,"score_gpt":0.2585596039883402,"score_spread":0.23096792033813665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528890166","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.986847,0.0010105544,0.0072726617,0.00070013735,0.00005586699,0.00039753944,0.00014582503,0.00073277054,0.0028376905],"genre_scores_gemma":[0.9929809,0.002903392,0.0038751832,0.000005273822,0.0000069626167,0.00014268223,0.000008922356,0.00003368193,0.000043001568],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898493,0.00009512691,0.0004589555,0.0001088342,0.00015328664,0.00019884603],"domain_scores_gemma":[0.99272835,0.00186568,0.00021758664,0.004991386,0.00016663027,0.000030364961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019723421,0.00017287061,0.00026289813,0.00011515613,0.0001480397,0.0000072634734,0.002534408,0.00009629179,0.000007080429],"category_scores_gemma":[0.00031554594,0.00010558617,0.00012721687,0.0003398178,0.0004356374,0.00015143018,0.0003897565,0.00025638266,0.000034143686],"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.0001286995,0.0007073192,0.29536456,0.00057991646,0.0008445559,5.7781386e-7,0.00202539,0.15537693,0.3569783,0.068809845,0.002629199,0.11655471],"study_design_scores_gemma":[0.0020719746,0.00047910574,0.35592398,0.0025639085,0.000046617337,0.000013306806,0.0012340302,0.4408209,0.19019607,0.00032123394,0.00545212,0.00087675377],"about_ca_topic_score_codex":0.000026502497,"about_ca_topic_score_gemma":0.000020896568,"teacher_disagreement_score":0.28544396,"about_ca_system_score_codex":0.00018072451,"about_ca_system_score_gemma":0.00002628083,"threshold_uncertainty_score":0.47096026},"labels":[],"label_agreement":null},{"id":"W2558392635","doi":"10.1049/iet-com.2016.0694","title":"Optimal rate profile for multi‐user multi‐rate transmission systems by bivariate fixed‐point analysis","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Japan Society for the Promotion of Science","keywords":"Decoding methods; Single antenna interference cancellation; Algorithm; Noisy-channel coding theorem; Mathematics; Transmission (telecommunications); Interference (communication); Computer science; Bivariate analysis; Code rate; Binary number; Gaussian; Channel (broadcasting); Low-density parity-check code; Statistics; Telecommunications; Arithmetic","score_opus":0.03646068830527858,"score_gpt":0.308072495169775,"score_spread":0.2716118068644964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558392635","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.0011739711,0.0017330182,0.99303067,0.0007427652,0.000055652556,0.0010470091,0.0005285289,0.0013290116,0.00035935748],"genre_scores_gemma":[0.511602,0.0042264094,0.47875595,0.00003330919,0.000012326717,0.0020937037,0.00042005573,0.00009894855,0.002757328],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833715,0.00032027537,0.0006228156,0.00026980243,0.00010240872,0.00034754118],"domain_scores_gemma":[0.9953964,0.0008039352,0.00016668839,0.0032317562,0.00026467108,0.00013660082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057832425,0.00027854936,0.00039582804,0.0002492499,0.00034790096,0.0000753254,0.0016509413,0.00016997512,0.000025209247],"category_scores_gemma":[0.00011967472,0.00023066797,0.00021065546,0.0006143689,0.00013214964,0.00043591546,0.00020689434,0.00023582343,0.000043044838],"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.000059332273,0.0010224395,0.00060726074,0.00031892507,0.0023956206,9.605372e-7,0.002047722,0.116150975,0.8102208,0.016763475,0.019422568,0.030989971],"study_design_scores_gemma":[0.0009821984,0.00003088297,0.00036940488,0.00013819383,0.00021853445,8.8526e-7,0.00012206273,0.84403676,0.038003996,0.000074109186,0.11566246,0.0003605263],"about_ca_topic_score_codex":0.000055483222,"about_ca_topic_score_gemma":0.000033917753,"teacher_disagreement_score":0.77221674,"about_ca_system_score_codex":0.00014333928,"about_ca_system_score_gemma":0.000025372672,"threshold_uncertainty_score":0.9406367},"labels":[],"label_agreement":null},{"id":"W2559813799","doi":"10.1049/iet-com.2016.1160","title":"Semidefinite further relaxation on likelihood ascent search detection algorithm for high‐order modulation in massive MIMO system","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"QAM; Algorithm; MIMO; Quadrature amplitude modulation; Relaxation (psychology); Computational complexity theory; Mathematics; Computer science; Detection theory; Spectral efficiency; Detector; Bit error rate; Channel (broadcasting); Telecommunications; Decoding methods","score_opus":0.01967350818756038,"score_gpt":0.2685452292999823,"score_spread":0.24887172111242192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559813799","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.008277696,0.0002524699,0.9868985,0.0013552585,0.00012285271,0.0010458711,0.00008019047,0.0010231143,0.0009440767],"genre_scores_gemma":[0.89009094,0.0008779191,0.107679024,0.00002233401,0.00003146376,0.0010895983,0.0000959932,0.00006851616,0.00004422535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870265,0.00019920718,0.00045251538,0.00020728036,0.00017740215,0.00026092795],"domain_scores_gemma":[0.99694276,0.0005990926,0.000117075615,0.0020113238,0.00027546939,0.000054301956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003531276,0.00018489051,0.0001892722,0.00031184597,0.00018020798,0.000028730208,0.00063577754,0.00016608085,0.000006656902],"category_scores_gemma":[0.00007524014,0.00017149742,0.000054297667,0.00045782173,0.00006274964,0.00029623572,0.000121912286,0.00026545543,0.000054000426],"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.000013154091,0.00011174119,0.000096595766,0.00004431594,0.00003326945,2.2221221e-7,0.00047219856,0.009286722,0.027112944,0.010380123,0.0000628571,0.95238584],"study_design_scores_gemma":[0.0018580088,0.0001828298,0.007603963,0.0009927368,0.000028532431,0.000003893819,0.00061121315,0.88931614,0.08713296,0.007366658,0.0042184414,0.0006846192],"about_ca_topic_score_codex":0.00004623521,"about_ca_topic_score_gemma":0.00016888887,"teacher_disagreement_score":0.9517012,"about_ca_system_score_codex":0.00073461386,"about_ca_system_score_gemma":0.000022604368,"threshold_uncertainty_score":0.6993462},"labels":[],"label_agreement":null},{"id":"W2561568723","doi":"10.1049/iet-com.2016.0983","title":"Low‐complexity hybrid precoding for multi‐user massive MIMO systems: a hybrid EGT/ZF approach","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Victoria","funders":"","keywords":"Precoding; Computer science; MIMO; Zero-forcing precoding; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.0742567706055381,"score_gpt":0.289488513425815,"score_spread":0.2152317428202769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561568723","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.0011661436,0.0009163206,0.9920928,0.00019652379,0.0003389849,0.001521688,0.00046025167,0.0007251986,0.0025821286],"genre_scores_gemma":[0.760485,0.00034330302,0.23650084,0.00001536174,0.00008522694,0.0014027865,0.00020652812,0.00009726896,0.00086371496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998607,0.00011877638,0.0005226241,0.00027591654,0.00011056735,0.00036513267],"domain_scores_gemma":[0.9970729,0.000355009,0.00015493482,0.00207896,0.00022924833,0.00010896022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024611186,0.00024949556,0.00031334374,0.00012611144,0.00031083674,0.00006613106,0.000947079,0.00006558066,0.000010430758],"category_scores_gemma":[0.00016662586,0.00022166665,0.00010938479,0.000151042,0.00013382628,0.00043674122,0.00019242507,0.00015542154,0.000059266407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008701982,0.0012908446,0.0011227558,0.0036488716,0.0009042028,0.0000046647433,0.0025174287,0.81915325,0.029639034,0.09043634,0.03299781,0.018197782],"study_design_scores_gemma":[0.0015604647,0.000028363756,0.00009269239,0.0004511363,0.00006222194,0.000030124156,0.00033996638,0.9690503,0.0041310014,0.0004421197,0.023204064,0.0006075349],"about_ca_topic_score_codex":0.000023948838,"about_ca_topic_score_gemma":0.000026194133,"teacher_disagreement_score":0.7593188,"about_ca_system_score_codex":0.00029926494,"about_ca_system_score_gemma":0.000030718944,"threshold_uncertainty_score":0.90393037},"labels":[],"label_agreement":null},{"id":"W2563704281","doi":"10.1049/iet-com.2016.0976","title":"Wavelet‐based cognitive SCMA system for mmWave 5G communication networks","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cognitive radio; Computer network; Cognition; Wavelet; Communications system; Telecommunications; Artificial intelligence; Wireless; Psychology","score_opus":0.026533834371042425,"score_gpt":0.2614994100273818,"score_spread":0.23496557565633938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563704281","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.0018977532,0.0045817825,0.9772889,0.003283053,0.00012349295,0.001118501,0.00020625054,0.0037115251,0.0077887503],"genre_scores_gemma":[0.94160664,0.002538254,0.05375823,0.000059197482,0.00002004232,0.0016256274,0.00023404558,0.000086228596,0.000071722294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864465,0.0001661545,0.00051119534,0.00020720754,0.00011184535,0.00035892535],"domain_scores_gemma":[0.99186915,0.002716989,0.00016798377,0.004804417,0.00036718912,0.000074280215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031999295,0.00025471006,0.00029036202,0.00017960582,0.0005398999,0.000048854377,0.0024708898,0.0001845341,0.0000130012095],"category_scores_gemma":[0.00027400712,0.00022631661,0.00012431866,0.00039715768,0.00048503772,0.00029630828,0.0003480054,0.00032507366,0.000059447142],"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.00010635537,0.00037981174,0.00053739065,0.0003195457,0.00048926694,0.0000010504859,0.00052550086,0.018708868,0.010979856,0.22672272,0.0065709134,0.7346587],"study_design_scores_gemma":[0.0046104803,0.00014453783,0.0013518477,0.0025912742,0.00016104768,0.000019472653,0.0030200782,0.8659422,0.036097962,0.0052132616,0.07922092,0.001626938],"about_ca_topic_score_codex":0.0000081876215,"about_ca_topic_score_gemma":0.00007176292,"teacher_disagreement_score":0.9397089,"about_ca_system_score_codex":0.00031444704,"about_ca_system_score_gemma":0.000035765435,"threshold_uncertainty_score":0.92289233},"labels":[],"label_agreement":null},{"id":"W2567568922","doi":"10.1049/iet-com.2016.0853","title":"Design and prototyping of low‐power wide area networks for critical infrastructure monitoring","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Rapid prototyping; Computer science; Power (physics); Critical infrastructure; Embedded system; Engineering; Computer security; Mechanical engineering","score_opus":0.029211946005812423,"score_gpt":0.2920801982935841,"score_spread":0.26286825228777166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567568922","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.0010189731,0.000960034,0.993169,0.00033848797,0.000105614505,0.0038941777,0.0000058300566,0.000098142875,0.00040974392],"genre_scores_gemma":[0.9154703,0.0003147956,0.07966161,0.000012678886,0.0000465867,0.004459815,0.0000016838001,0.000024007124,0.000008505522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994925,0.00004039369,0.0001844823,0.000074684096,0.000042910076,0.00016499017],"domain_scores_gemma":[0.99808925,0.0011765563,0.000024003184,0.00059151946,0.0000730149,0.000045651595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016031545,0.000089132685,0.000121051635,0.000027805885,0.00010828178,0.000021246646,0.00028252185,0.00008570741,0.000011754955],"category_scores_gemma":[0.00008834352,0.00007074385,0.000028500293,0.00007692704,0.00010113983,0.00010446264,0.00007668395,0.00011552375,6.880876e-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.00046975017,0.00030367103,0.030364266,0.0016308516,0.0006507832,0.0000026260443,0.004178125,0.36081123,0.034398578,0.055371217,0.025777346,0.48604158],"study_design_scores_gemma":[0.0022667788,0.00035149296,0.019248012,0.0041534435,0.000087235065,0.000014731857,0.00014491919,0.85036063,0.012801429,0.0348479,0.074678525,0.0010449234],"about_ca_topic_score_codex":6.975083e-7,"about_ca_topic_score_gemma":6.096917e-7,"teacher_disagreement_score":0.91445136,"about_ca_system_score_codex":0.000020457253,"about_ca_system_score_gemma":0.000011167703,"threshold_uncertainty_score":0.28848508},"labels":[],"label_agreement":null},{"id":"W2571711166","doi":"10.1049/iet-com.2016.0617","title":"Non‐linear transceiver design for secure communications with artificial noise‐assisted MIMO relay","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Artificial noise; Relay; Computer science; MIMO; Precoding; Transceiver; Mathematical optimization; Relay channel; Physical layer; Channel (broadcasting); Relaxation (psychology); Power (physics); Mathematics; Telecommunications; Wireless","score_opus":0.09101922775802859,"score_gpt":0.3226872621371945,"score_spread":0.23166803437916592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571711166","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.0132714445,0.0024366025,0.9153733,0.025825258,0.00022570764,0.0049733813,0.0005918059,0.003418522,0.03388398],"genre_scores_gemma":[0.69873744,0.0012977725,0.29833195,0.000071692164,0.00003161487,0.0011105302,0.00023402004,0.00009201257,0.000092961345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984582,0.00016965657,0.00055601535,0.00024897602,0.00020572326,0.00036144897],"domain_scores_gemma":[0.9845161,0.0006062265,0.00024153339,0.014099488,0.00040213598,0.00013453155],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053318404,0.00031833324,0.0003741271,0.00015589275,0.0023068087,0.00025677506,0.0072237686,0.00024338199,0.000020135749],"category_scores_gemma":[0.00008242188,0.00033365516,0.00016077196,0.00020626302,0.00085862115,0.0005261758,0.00047721437,0.0007245361,0.000048121554],"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.0012175309,0.008478703,0.005190032,0.0014754377,0.0049707047,0.000015849986,0.058293376,0.037973356,0.2207602,0.33161452,0.1474347,0.1825756],"study_design_scores_gemma":[0.002118083,0.00029917632,0.007332112,0.0005644079,0.00045172466,0.000034590703,0.0008731515,0.6684445,0.020444704,0.0046575977,0.2930069,0.0017730766],"about_ca_topic_score_codex":0.00008153275,"about_ca_topic_score_gemma":0.000977143,"teacher_disagreement_score":0.685466,"about_ca_system_score_codex":0.00013386592,"about_ca_system_score_gemma":0.000102285565,"threshold_uncertainty_score":0.99991155},"labels":[],"label_agreement":null},{"id":"W2572771694","doi":"10.1049/iet-com.2016.0558","title":"Cooperative composite sequential detection and its application in spectrum sensing","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Composite number; Spectrum (functional analysis); Computer science; Pattern recognition (psychology); Algorithm; Artificial intelligence; Physics","score_opus":0.029992649153245978,"score_gpt":0.2907566351126995,"score_spread":0.26076398595945355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572771694","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.274284,0.00070624787,0.70477897,0.011512578,0.00018261041,0.0005334326,0.0000040452287,0.00014763647,0.007850458],"genre_scores_gemma":[0.9938276,0.00029332025,0.0057063107,0.00008756916,0.000046458532,0.000006486987,0.000004478079,0.0000071392215,0.000020682137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991978,0.00013610742,0.00017151838,0.00024253209,0.00008545286,0.00016658593],"domain_scores_gemma":[0.99822205,0.00010780331,0.00013239852,0.0014144754,0.000074182375,0.000049082035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022547315,0.00009780705,0.00012458197,0.00008392993,0.0011926927,0.00040614174,0.00073370733,0.00004717503,6.760529e-7],"category_scores_gemma":[0.00003669279,0.00010870966,0.000024783516,0.00014587388,0.00011161724,0.00053943635,0.0006065606,0.00023524583,0.000011190337],"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.000031153035,0.00021826403,0.0031169923,0.000017878114,0.0000752906,0.000021156811,0.0040918747,0.0006451254,0.17060348,0.20088857,0.000025230911,0.620265],"study_design_scores_gemma":[0.00031943593,0.000023099366,0.031852752,0.000039214203,0.0000070919104,0.00004703891,0.000028507386,0.95640427,0.0068756337,0.003507828,0.0007327266,0.00016239949],"about_ca_topic_score_codex":0.00033025796,"about_ca_topic_score_gemma":0.0050448203,"teacher_disagreement_score":0.95575917,"about_ca_system_score_codex":0.00006663448,"about_ca_system_score_gemma":0.000025249037,"threshold_uncertainty_score":0.91733485},"labels":[],"label_agreement":null},{"id":"W2574457189","doi":"10.1049/iet-com.2016.0902","title":"Augmented Hammerstein model for six‐port‐based wireless receiver calibration","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Microwave and Dielectric Measurement Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Port (circuit theory); Computer science; Calibration; Wireless; Computer network; Telecommunications; Mathematics; Statistics; Electronic engineering","score_opus":0.0956473395618084,"score_gpt":0.30225976319617226,"score_spread":0.20661242363436386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574457189","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.0060086492,0.00034338905,0.9752044,0.0014240204,0.000065062915,0.00064339896,0.000045555997,0.00056434155,0.0157012],"genre_scores_gemma":[0.9733587,0.00029017616,0.025484692,0.00011178829,0.00001529894,0.00025168134,0.00016973859,0.000026865808,0.00029104177],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994408,0.000021116479,0.00019500339,0.00010174306,0.00008773517,0.00015358864],"domain_scores_gemma":[0.99788857,0.000049154623,0.00007608938,0.0018547392,0.000086818145,0.000044610773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019268063,0.00010445215,0.00011456186,0.000057562083,0.00047357084,0.00008938269,0.00077427854,0.00007492662,0.000012383648],"category_scores_gemma":[0.00004282453,0.00011468747,0.00006240404,0.000045006953,0.00005016473,0.00019772747,0.0000534748,0.000111904796,0.0000047475096],"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.00007824595,0.00055670674,0.001760201,0.00031280288,0.00033498238,0.000001228565,0.0011215804,0.018048361,0.59465945,0.034646623,0.26665848,0.08182133],"study_design_scores_gemma":[0.00027003023,0.000012791763,0.00008865727,0.000027221155,0.00002362452,1.9259357e-7,0.0000066411903,0.95338035,0.03725763,0.0006537652,0.008149049,0.00013005306],"about_ca_topic_score_codex":0.000038057206,"about_ca_topic_score_gemma":0.00021028,"teacher_disagreement_score":0.96735007,"about_ca_system_score_codex":0.000060748644,"about_ca_system_score_gemma":0.000039423885,"threshold_uncertainty_score":0.46768194},"labels":[],"label_agreement":null},{"id":"W2582163805","doi":"10.1049/iet-com.2016.0303","title":"Code‐based security with random interleaving","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Interleaving; Code (set theory); Programming language; Theoretical computer science; Operating system","score_opus":0.03582894615192945,"score_gpt":0.2998896858542459,"score_spread":0.26406073970231647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582163805","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.021797847,0.00030592878,0.8890475,0.015032224,0.00026506645,0.00031691196,0.000016286003,0.00047559463,0.07274264],"genre_scores_gemma":[0.96374434,0.000018768913,0.0359011,0.00024174729,0.000015169753,0.00003371544,0.000004225911,0.000005337995,0.00003559664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999355,0.00014206837,0.00011209282,0.00015870496,0.00010008524,0.000132025],"domain_scores_gemma":[0.9936417,0.00026771243,0.00012892993,0.0057744253,0.000132604,0.00005463443],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00039371717,0.0000823593,0.000104292034,0.00005689696,0.0013296881,0.00044707826,0.005180295,0.000027873893,0.000012385842],"category_scores_gemma":[0.00011752085,0.00007102033,0.000063557585,0.000107326014,0.000299773,0.0004251134,0.00079823355,0.0001911979,0.000020674985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007542442,0.0003220038,0.0078053246,0.000014060157,0.00006202159,0.000003692658,0.0024830762,0.000034472498,0.00018031924,0.9640556,0.0017733728,0.023190608],"study_design_scores_gemma":[0.008328295,0.00048217704,0.025932468,0.000619201,0.0001014726,0.000026654203,0.0003585249,0.26109844,0.0027495595,0.29063946,0.40833044,0.0013333191],"about_ca_topic_score_codex":0.000041075193,"about_ca_topic_score_gemma":0.00036190372,"teacher_disagreement_score":0.9419465,"about_ca_system_score_codex":0.000010865893,"about_ca_system_score_gemma":0.000041207655,"threshold_uncertainty_score":0.99997044},"labels":[],"label_agreement":null},{"id":"W2587495713","doi":"10.1049/iet-com.2016.1166","title":"Interference and throughput aware resource allocation for multi‐class D2D in 5G networks","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Custom Security Industries (Canada); Toronto Metropolitan University","funders":"","keywords":"Throughput; Computer science; Interference (communication); Class (philosophy); Resource allocation; Computer network; Resource (disambiguation); Distributed computing; Telecommunications; Artificial intelligence; Wireless; Channel (broadcasting)","score_opus":0.06384297838110176,"score_gpt":0.3226781338232272,"score_spread":0.25883515544212543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587495713","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.001460898,0.00095717236,0.993959,0.00063206535,0.00009582474,0.0004944522,0.000013923791,0.00014095489,0.002245701],"genre_scores_gemma":[0.9677224,0.00061221543,0.031175384,0.000019276895,0.000025513345,0.00023158053,0.00007486712,0.000026908076,0.000111844856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994754,0.000033078515,0.00021149991,0.00012043803,0.000025569001,0.00013399468],"domain_scores_gemma":[0.9981521,0.00012904973,0.00008125205,0.001546108,0.000060260114,0.000031232565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013941572,0.00009599962,0.000120060125,0.000044297583,0.00030447764,0.0000800032,0.00062704424,0.000080981,0.0000012228297],"category_scores_gemma":[0.000088311994,0.00011107465,0.0000187764,0.000052320796,0.000087349,0.00029182227,0.00013888943,0.00015636893,0.000002509609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016231279,0.00008682191,0.0040253685,0.00012766955,0.00004572929,3.1359355e-7,0.0027646015,0.9369357,0.0007517084,0.007484343,0.0014113263,0.046350166],"study_design_scores_gemma":[0.00035589637,0.000008413923,0.0020588099,0.000114206436,0.0000062316058,0.0000013038344,0.00020427906,0.99083924,0.00006308991,0.00012146924,0.0061117364,0.000115334224],"about_ca_topic_score_codex":0.000069951224,"about_ca_topic_score_gemma":0.001665111,"teacher_disagreement_score":0.9662615,"about_ca_system_score_codex":0.000067304485,"about_ca_system_score_gemma":0.0000081615535,"threshold_uncertainty_score":0.4529493},"labels":[],"label_agreement":null},{"id":"W2591329929","doi":"10.1049/iet-com.2016.1356","title":"Effect of composite channel aging on the spectral efficiency of multi‐pair massive multiple‐input multiple‐output amplify‐and‐forward relay networks","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Medical Research Council; Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Relay; Computer science; Spectral efficiency; Channel (broadcasting); Composite number; Telecommunications; Relay channel; Computer network; Topology (electrical circuits); Physics; Algorithm; Electrical engineering; Engineering","score_opus":0.019525846366116043,"score_gpt":0.26583246570880614,"score_spread":0.2463066193426901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591329929","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.31534204,0.002034731,0.67705953,0.00080440106,0.00050214864,0.0021423474,0.00013027467,0.000382778,0.0016017463],"genre_scores_gemma":[0.99158996,0.00036351598,0.0077755717,0.000009545034,0.0000352919,0.00009970152,0.00004198576,0.00004820904,0.000036189616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987949,0.00023405801,0.00043242425,0.00017665945,0.00011376162,0.0002482052],"domain_scores_gemma":[0.9949993,0.001956568,0.00035274494,0.0025321697,0.000097723234,0.000061528364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048966525,0.00022685333,0.00035561522,0.00009216229,0.0006013066,0.000043332893,0.001157087,0.00011569005,0.0000015988958],"category_scores_gemma":[0.00046892354,0.00018445513,0.00010434818,0.00011960887,0.0003464839,0.00016026219,0.00030372897,0.0004234909,0.0000050713165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021852087,0.000056151905,0.006355625,0.00008683951,0.000073836956,3.815511e-7,0.001018494,0.98785824,0.0030966112,0.00033266965,0.000050022616,0.0010493075],"study_design_scores_gemma":[0.0008572522,0.000085908,0.0057520783,0.00030097473,0.000042657095,0.000002394034,0.000102370024,0.98565704,0.006938627,0.000010158359,0.00008287886,0.00016764172],"about_ca_topic_score_codex":0.00011619891,"about_ca_topic_score_gemma":0.00009500881,"teacher_disagreement_score":0.67624795,"about_ca_system_score_codex":0.000060773527,"about_ca_system_score_gemma":0.000008530879,"threshold_uncertainty_score":0.7521862},"labels":[],"label_agreement":null},{"id":"W2609937295","doi":"10.1049/iet-com.2016.1439","title":"Sparse inverse fast Fourier transform‐based channel estimation for millimetre‐wave vector orthogonal frequency division multiplexing systems","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Fourier transform; Computer science; Inverse; Discrete Fourier transform (general); Division (mathematics); Orthogonal frequency-division multiplexing; Channel (broadcasting); Algorithm; Multiplexing; Fractional Fourier transform; Telecommunications; Mathematics; Fourier analysis; Mathematical analysis; Arithmetic","score_opus":0.07225413859019222,"score_gpt":0.30715585900655473,"score_spread":0.2349017204163625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609937295","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.0041142274,0.000739678,0.989025,0.0010984147,0.00022900918,0.0013130842,0.00036034102,0.00092613616,0.0021940854],"genre_scores_gemma":[0.7439309,0.00033505817,0.25420663,0.000024807232,0.000030717307,0.0008826284,0.0004896611,0.000067852,0.00003177394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986621,0.00008739147,0.0005196619,0.00021523876,0.0002031916,0.0003124273],"domain_scores_gemma":[0.9945519,0.00043762045,0.00024424662,0.0044178558,0.00023076907,0.000117586445],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003572526,0.00026908884,0.0002961891,0.00019541975,0.0013245621,0.00018687495,0.0017165497,0.0001676437,0.000008548909],"category_scores_gemma":[0.0002629831,0.00030103474,0.00014742535,0.000118627795,0.00023478287,0.00073342584,0.00017830914,0.0003540797,0.000017524935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007130731,0.0007651438,0.0014862173,0.0010590517,0.00043000755,0.0000041179132,0.0035854315,0.6951136,0.024847375,0.055474754,0.0027112523,0.21445173],"study_design_scores_gemma":[0.00058053154,0.00003457537,0.0012522787,0.00023856964,0.000025470037,0.0000019253116,0.00007620922,0.988743,0.0032336225,0.0026356264,0.0028448636,0.0003333146],"about_ca_topic_score_codex":0.000102148195,"about_ca_topic_score_gemma":0.00032644134,"teacher_disagreement_score":0.73981667,"about_ca_system_score_codex":0.0001873551,"about_ca_system_score_gemma":0.00004714708,"threshold_uncertainty_score":0.99997556},"labels":[],"label_agreement":null},{"id":"W2610951593","doi":"10.1049/iet-com.2016.1432","title":"Cartesian augmented Hammerstein model for non‐linearity and I/Q impairments compensation in concurrent dual‐band transmitters","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Amplifier; Linearity; Control theory (sociology); Transmitter; Infinite impulse response; Electronic engineering; Digital filter; Bandwidth (computing); Telecommunications; Artificial intelligence; Engineering","score_opus":0.058113764367510666,"score_gpt":0.3195054528704115,"score_spread":0.26139168850290084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610951593","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.14312023,0.00042630738,0.85173166,0.00164837,0.0002215211,0.0013662351,0.00019670933,0.00014303252,0.0011459389],"genre_scores_gemma":[0.98661697,0.00019554966,0.012806354,0.000038867878,0.000008709373,0.00017252864,0.00009180377,0.000023531273,0.000045686615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936175,0.000026434907,0.0002284794,0.0001319479,0.00006746118,0.00018390648],"domain_scores_gemma":[0.9986433,0.000094094314,0.00005649428,0.0011032874,0.000037355316,0.000065505585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015491327,0.00012540366,0.00016157134,0.00006111997,0.0003139167,0.000072161565,0.00039395766,0.000052750675,0.000002080758],"category_scores_gemma":[0.00001836999,0.00014754216,0.000035852074,0.000036879977,0.00012357497,0.0002565245,0.0000524869,0.00016284619,0.0000024216986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029223794,0.0022297034,0.074281275,0.0015758332,0.0011178645,0.000015626189,0.08383078,0.49984932,0.1480312,0.013601341,0.012312104,0.1628627],"study_design_scores_gemma":[0.0011289185,0.000020241916,0.009240266,0.000049546674,0.000021886914,0.0000016895308,0.000098751734,0.9874154,0.00053111307,0.0005435198,0.0007870189,0.00016164863],"about_ca_topic_score_codex":0.000064169755,"about_ca_topic_score_gemma":0.0006841908,"teacher_disagreement_score":0.84349674,"about_ca_system_score_codex":0.00009115187,"about_ca_system_score_gemma":0.000019805258,"threshold_uncertainty_score":0.6016595},"labels":[],"label_agreement":null},{"id":"W2740227516","doi":"10.1049/iet-com.2017.0367","title":"Discrete location‐aware resource allocation for underlay device‐to‐device communications in cellular networks","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Underlay; Computer science; Resource allocation; Computer network; Resource (disambiguation); Resource management (computing); Cellular network; Distributed computing; Telecommunications; Signal-to-noise ratio (imaging)","score_opus":0.05060549029033064,"score_gpt":0.3193298200883414,"score_spread":0.26872432979801075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740227516","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.0005044826,0.0020630087,0.9816045,0.0069737583,0.0001669723,0.0017448378,0.000048503032,0.000392309,0.0065016085],"genre_scores_gemma":[0.9379378,0.0005303163,0.058904387,0.00014004741,0.00007388176,0.0012411228,0.00081660243,0.00009682525,0.00025900867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984719,0.00015273226,0.0006318115,0.00027693616,0.00010958332,0.000357041],"domain_scores_gemma":[0.99072367,0.00048934674,0.00023443867,0.008099341,0.0003225028,0.00013068966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050809846,0.0002480004,0.0002822552,0.00019141592,0.0012245578,0.00021667319,0.0035616728,0.0001733734,0.0000051137963],"category_scores_gemma":[0.00029815373,0.00030471265,0.00006938235,0.00042693433,0.00017298615,0.0005693889,0.000618737,0.00036130985,0.00004362373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008433018,0.0000694951,0.00063725363,0.00008404695,0.000043634343,1.5274237e-7,0.00104507,0.9825612,0.00060022046,0.009397637,0.0014609604,0.004091946],"study_design_scores_gemma":[0.0004972258,0.000019449568,0.0013148555,0.0002740809,0.000038098246,0.0000014675024,0.00062791666,0.929285,0.0001975375,0.00043353593,0.066928595,0.00038222407],"about_ca_topic_score_codex":0.00017605607,"about_ca_topic_score_gemma":0.0043320963,"teacher_disagreement_score":0.9374333,"about_ca_system_score_codex":0.0003188418,"about_ca_system_score_gemma":0.00005320658,"threshold_uncertainty_score":0.9999405},"labels":[],"label_agreement":null},{"id":"W2743875549","doi":"10.1049/iet-com.2016.1312","title":"Optimal and simple near optimal non‐coherent detection in amplify‐and‐forward two‐way relaying over fast fading channels","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fading; Simple (philosophy); Computer science; Algorithm; Channel (broadcasting); Telecommunications","score_opus":0.05218717176585899,"score_gpt":0.32966969988873157,"score_spread":0.27748252812287255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743875549","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.7333307,0.001286479,0.25731182,0.003847671,0.00022418084,0.0005765733,0.0000063933007,0.00016571108,0.0032504683],"genre_scores_gemma":[0.96678996,0.0019423829,0.030925335,0.00012424962,0.000032422056,0.00009450881,0.000008805273,0.000015356101,0.00006695591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986974,0.00020993117,0.0003257469,0.00033839673,0.00013750982,0.0002910413],"domain_scores_gemma":[0.99617714,0.00026729182,0.0002092744,0.003132561,0.00009314374,0.00012059784],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00060110615,0.00018058228,0.00021943409,0.000119807184,0.0025238574,0.0011038234,0.0022710275,0.00007893573,0.000010759423],"category_scores_gemma":[0.00011905844,0.00019311794,0.00004356844,0.00020268066,0.0002842851,0.0009983331,0.00349911,0.0005212676,0.000012655367],"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.000047224134,0.00041310387,0.022164052,0.000045274526,0.00013712027,0.000008128727,0.02903701,0.02067295,0.011546963,0.051594354,0.00043825302,0.8638956],"study_design_scores_gemma":[0.00079822267,0.000054714936,0.036629695,0.000084391075,0.000009656245,0.000015314567,0.00017335807,0.95157504,0.00034918546,0.000269205,0.009755601,0.00028564085],"about_ca_topic_score_codex":0.0001933014,"about_ca_topic_score_gemma":0.0007877147,"teacher_disagreement_score":0.93090206,"about_ca_system_score_codex":0.000078405086,"about_ca_system_score_gemma":0.00003865619,"threshold_uncertainty_score":0.9999331},"labels":[],"label_agreement":null},{"id":"W2749760377","doi":"10.1049/iet-com.2017.0454","title":"Pilot contamination mitigation strategies in massive MIMO systems","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","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":"Memorial University of Newfoundland","funders":"","keywords":"Contamination; MIMO; Computer science; Environmental science; Risk analysis (engineering); Business; Telecommunications; Channel (broadcasting)","score_opus":0.030638082079850328,"score_gpt":0.28781564626837114,"score_spread":0.25717756418852084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749760377","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.056342427,0.004652024,0.7164999,0.0017109341,0.0021334216,0.0026029882,0.00008084864,0.0012256908,0.21475177],"genre_scores_gemma":[0.99486744,0.00036430397,0.0041858214,0.00000474216,0.00003282509,0.00024429747,0.000101230464,0.000026412254,0.00017294794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931216,0.000071434566,0.00029457366,0.00010441565,0.00007961708,0.00013782023],"domain_scores_gemma":[0.99796283,0.00010438043,0.00014254257,0.0016433158,0.0001145199,0.000032390795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015816896,0.000109735774,0.00013943776,0.00010098049,0.00031486276,0.0002472333,0.00068715925,0.00005017347,0.0000036273343],"category_scores_gemma":[0.00009463182,0.00012958387,0.0000199078,0.00008129778,0.00009179613,0.00096518314,0.00007958571,0.00016587421,0.000029293615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061027195,0.00009181914,0.0038317412,0.00014845926,0.000041183084,0.000002329776,0.0015298689,0.8333434,0.008640203,0.14975084,0.0005406094,0.002073479],"study_design_scores_gemma":[0.0009506682,0.000048598962,0.029192396,0.00040148344,0.000018651901,0.0000054867014,0.002852746,0.9606711,0.0005089209,0.0020315417,0.002937012,0.0003813514],"about_ca_topic_score_codex":0.00023137746,"about_ca_topic_score_gemma":0.001428456,"teacher_disagreement_score":0.938525,"about_ca_system_score_codex":0.00016297102,"about_ca_system_score_gemma":0.000026937243,"threshold_uncertainty_score":0.5284277},"labels":[],"label_agreement":null},{"id":"W2750611814","doi":"10.1049/iet-com.2017.0489","title":"Green‐oriented user‐satisfaction aware WiFi offloading in HetNets","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; User satisfaction; Computer network; Heterogeneous network; Wireless; Human–computer interaction; Wireless network; Telecommunications","score_opus":0.027952244557068177,"score_gpt":0.2905056139741353,"score_spread":0.26255336941706714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750611814","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.18288818,0.0020645778,0.7385876,0.0028860036,0.0022320347,0.0020076837,0.00013359346,0.0022227166,0.06697761],"genre_scores_gemma":[0.98978037,0.0003300622,0.009342528,0.00001118776,0.000031819953,0.00008881596,0.00005142318,0.000034814242,0.0003289569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993342,0.000044645658,0.0002627091,0.000118606855,0.00007358652,0.00016620805],"domain_scores_gemma":[0.9974325,0.000056529756,0.000097911245,0.0023039987,0.000063920335,0.000045150515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113068025,0.00011362061,0.00013592037,0.00014210441,0.00041276807,0.00006029434,0.000585909,0.000079531055,0.000012441822],"category_scores_gemma":[0.000069516296,0.00013912118,0.000029977593,0.00015480882,0.00006216064,0.0006222898,0.00014474157,0.00022127625,0.000052123967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020667212,0.00017098637,0.29606488,0.00024558778,0.00015543344,0.000008225682,0.00517755,0.58755594,0.014980483,0.029212428,0.0032482743,0.063159555],"study_design_scores_gemma":[0.0012331029,0.000024578045,0.20983578,0.00043248598,0.000027291258,0.00001687833,0.0005380289,0.7567729,0.00097384845,0.0008236411,0.028665397,0.0006561113],"about_ca_topic_score_codex":0.0005709769,"about_ca_topic_score_gemma":0.0044248383,"teacher_disagreement_score":0.8068922,"about_ca_system_score_codex":0.00016190983,"about_ca_system_score_gemma":0.000012356545,"threshold_uncertainty_score":0.56731975},"labels":[],"label_agreement":null},{"id":"W2762882306","doi":"10.1049/iet-com.2016.0552","title":"Robust precoder design for massive MIMO with peak total power constrained single‐RF‐chain transmitters","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; MIMO; Computer science; Transmitter; Control theory (sociology); Channel state information; Amplifier; Channel (broadcasting); Antenna (radio); Transmission (telecommunications); Electronic engineering; Telecommunications; Wireless; Engineering; Bandwidth (computing)","score_opus":0.049782469480063804,"score_gpt":0.25121779206171113,"score_spread":0.2014353225816473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762882306","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.00070242805,0.00019860052,0.98910224,0.0012521897,0.00012616643,0.0010156998,0.000076671546,0.00026126765,0.0072647375],"genre_scores_gemma":[0.70703256,0.000025762569,0.29225656,0.000020139612,0.000017731772,0.00029928682,0.000049860817,0.000054032516,0.00024403173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922997,0.00004715341,0.00024611602,0.00016413083,0.00007577826,0.0002368437],"domain_scores_gemma":[0.99754155,0.00024868976,0.00012293813,0.0018752923,0.00013981033,0.00007174335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013813926,0.00018210361,0.00019446331,0.000059358215,0.00052837416,0.00012123141,0.00071408594,0.00008629338,0.000021284932],"category_scores_gemma":[0.0000738122,0.00018323194,0.000058816644,0.000058941652,0.00022270018,0.00037345962,0.000047153953,0.00014953873,0.0000076567285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029133087,0.00007034729,0.000042076965,0.000040934596,0.00012427774,9.450874e-7,0.0014467624,0.98886687,0.0060465913,0.0009702479,0.00096048275,0.0014013145],"study_design_scores_gemma":[0.003047019,0.00028654616,0.00051850977,0.0003635381,0.00014630325,0.000044846576,0.0015281206,0.983848,0.0037525806,0.00044858846,0.00508471,0.0009312535],"about_ca_topic_score_codex":0.0000101761,"about_ca_topic_score_gemma":0.000084624764,"teacher_disagreement_score":0.7063302,"about_ca_system_score_codex":0.000102606304,"about_ca_system_score_gemma":0.000037336686,"threshold_uncertainty_score":0.74719816},"labels":[],"label_agreement":null},{"id":"W2765188317","doi":"10.1049/iet-com.2017.0338","title":"Performance analysis of multi‐user scheduling in a spectrum sharing with OSTBC under correlated antennas in a cognitive radio system","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cognitive radio; Computer science; Scheduling (production processes); Rayleigh fading; Cumulative distribution function; Probability density function; Fading; Algorithm; Channel (broadcasting); Electronic engineering; Telecommunications; Mathematical optimization; Wireless; Mathematics; Statistics; Engineering","score_opus":0.032142622716383296,"score_gpt":0.2793524038067034,"score_spread":0.2472097810903201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765188317","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.85231483,0.00048062913,0.14503755,0.00004239445,0.00004210904,0.00040476146,0.000015744308,0.0001237926,0.0015381612],"genre_scores_gemma":[0.9907357,0.00022637671,0.008846567,0.0000022709373,0.0000037328557,0.000071952345,0.000043975655,0.000028393466,0.00004103725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916357,0.000037944756,0.0003893328,0.00015585028,0.00007499649,0.00017831355],"domain_scores_gemma":[0.998223,0.00009310849,0.00018663936,0.0013843186,0.00008153782,0.000031360076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020686733,0.00012920736,0.00033067845,0.00047036714,0.00015159739,0.000037586313,0.00062114117,0.000072997784,0.0000031999064],"category_scores_gemma":[0.00004452224,0.00013549833,0.000039472197,0.00075596006,0.0000890759,0.00037865737,0.00013641696,0.00027248493,0.000003976959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011164103,0.00003354672,0.20525247,0.00004498564,0.00018589663,0.0000012866363,0.00089442765,0.7930754,0.00017545313,0.00026275715,1.2958151e-7,0.00006247005],"study_design_scores_gemma":[0.0007048299,0.000009277191,0.155258,0.00084805035,0.00011929107,0.0000028105276,0.0013329035,0.8415001,0.00009912649,0.0000018992281,0.0000012770056,0.00012245943],"about_ca_topic_score_codex":0.00048151825,"about_ca_topic_score_gemma":0.0069560097,"teacher_disagreement_score":0.13842084,"about_ca_system_score_codex":0.00021513418,"about_ca_system_score_gemma":0.000020356745,"threshold_uncertainty_score":0.55254614},"labels":[],"label_agreement":null},{"id":"W2765650034","doi":"10.1049/iet-com.2017.0948","title":"Secrecy performance of hybrid satellite‐terrestrial relay networks in the presence of multiple eavesdroppers","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Relay; Computer science; Secrecy; Satellite; Computer network; Communications satellite; Telecommunications; Computer security; Physics","score_opus":0.05581903104355019,"score_gpt":0.2826035077074758,"score_spread":0.2267844766639256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765650034","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.97193277,0.009176355,0.00068038114,0.00043188606,0.0003261464,0.00065527885,0.000022786935,0.000075662436,0.016698709],"genre_scores_gemma":[0.9852354,0.013425869,0.0011546748,0.0000087220205,0.000028647191,0.00007206609,0.00003184828,0.00001957761,0.000023197983],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987248,0.00027343503,0.0005680385,0.00009603677,0.00016902834,0.00016865782],"domain_scores_gemma":[0.9922393,0.00096350047,0.00025666272,0.006448502,0.00006190809,0.000030143532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076998316,0.00011909226,0.00022407711,0.00007747247,0.00023033122,0.000047221383,0.0043298756,0.00005539364,0.0000050623935],"category_scores_gemma":[0.00025306526,0.00010469828,0.00007147041,0.00015248166,0.00037460457,0.00023932285,0.00035844566,0.00037015975,0.000008194269],"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.00014886801,0.00053214375,0.71073556,0.00035562314,0.0002448065,0.000002760524,0.017381959,0.18237507,0.0060191443,0.004160498,0.00063187093,0.077411726],"study_design_scores_gemma":[0.00095729774,0.00005371097,0.20625868,0.00047150956,0.000024687097,0.000014440168,0.0009036849,0.7583462,0.0025956673,0.00009709982,0.029989466,0.00028753077],"about_ca_topic_score_codex":0.00027512133,"about_ca_topic_score_gemma":0.00028401875,"teacher_disagreement_score":0.5759711,"about_ca_system_score_codex":0.00003112833,"about_ca_system_score_gemma":0.000023737763,"threshold_uncertainty_score":0.8046058},"labels":[],"label_agreement":null},{"id":"W2766446755","doi":"10.1049/iet-com.2016.0691","title":"Joint opportunistic user scheduling and power allocation: throughput optimisation and fair resource sharing","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Joint (building); Throughput; Resource allocation; Computer network; Shared resource; Telecommunications; Wireless; Operations management; Economics","score_opus":0.05078964273548128,"score_gpt":0.2783183632623148,"score_spread":0.2275287205268335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766446755","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.08538292,0.004084244,0.8645001,0.006665485,0.0002520862,0.00081812614,0.000025732526,0.0009792679,0.037292015],"genre_scores_gemma":[0.88239604,0.0021212013,0.1151341,0.000050984352,0.000031185296,0.000039977574,0.0000679127,0.000037171,0.00012139758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993175,0.00002329714,0.00023617539,0.00018413251,0.00008551922,0.00015337333],"domain_scores_gemma":[0.9978903,0.00007594886,0.00010944011,0.0017794308,0.00006426763,0.00008059535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017357335,0.00013437522,0.0001383931,0.000050707855,0.0008481166,0.0002350696,0.00045474927,0.000078153054,0.0000118203725],"category_scores_gemma":[0.00010270546,0.00015826723,0.000018822439,0.000054531512,0.00019248757,0.00052657723,0.00043427496,0.00020669206,0.000005000921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008772854,0.00005407878,0.004412394,0.000094392206,0.00010705582,0.000002234815,0.0025590658,0.89915115,0.0019426345,0.072828904,0.0005519954,0.018287342],"study_design_scores_gemma":[0.00028896195,0.000011553658,0.008146204,0.0001250072,0.000027905144,0.000011073874,0.00028889443,0.9801041,0.00008643687,0.0012247115,0.009436229,0.00024894977],"about_ca_topic_score_codex":0.000011163188,"about_ca_topic_score_gemma":0.000025805086,"teacher_disagreement_score":0.79701316,"about_ca_system_score_codex":0.000048467005,"about_ca_system_score_gemma":0.000011344872,"threshold_uncertainty_score":0.6523113},"labels":[],"label_agreement":null},{"id":"W2771072580","doi":"10.1049/iet-com.2016.1431","title":"Performance analysis of spectrum sharing‐based multi‐hop decode‐and‐forward over Nakagami‐ <i>m</i> fading channels subject to additive white generalised Gaussian noise","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"University of Tabuk","keywords":"Fading; Additive white Gaussian noise; Nakagami distribution; QAM; Quadrature amplitude modulation; Telecommunications; Computer science; Bit error rate; Mathematics; Underlay; Algorithm; Topology (electrical circuits); White noise; Signal-to-noise ratio (imaging); Decoding methods","score_opus":0.03097321409716577,"score_gpt":0.30296972421783014,"score_spread":0.2719965101206644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771072580","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.8352586,0.0007061702,0.15107779,0.0019038935,0.0001442641,0.0010834335,0.0006173171,0.0010947066,0.008113806],"genre_scores_gemma":[0.94409674,0.0019497654,0.053235583,0.00010998458,0.000017371705,0.0002748997,0.00016589582,0.00005775804,0.00009198186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986764,0.00006533952,0.00048814047,0.0002794656,0.00017524637,0.00031538654],"domain_scores_gemma":[0.9936973,0.00015721937,0.00026385373,0.0055997623,0.00012886609,0.00015300985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027699288,0.0002658069,0.00047579463,0.0005769031,0.00067516824,0.00012119982,0.0026252044,0.00010880676,0.000045071756],"category_scores_gemma":[0.00010120576,0.00030296057,0.00016924014,0.0006074928,0.00022399674,0.00047835335,0.00083503855,0.00033273036,0.000009297528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101419806,0.0005514856,0.19104823,0.00026019337,0.0027483604,0.0000030836247,0.009742851,0.7156981,0.046945583,0.0035393287,0.0009554854,0.02840586],"study_design_scores_gemma":[0.00039166378,0.00002957203,0.11098417,0.0001547349,0.00023689459,6.74076e-7,0.00006125923,0.8634869,0.022646349,0.000056611676,0.0015653366,0.00038587258],"about_ca_topic_score_codex":0.00014878508,"about_ca_topic_score_gemma":0.0009824128,"teacher_disagreement_score":0.14778875,"about_ca_system_score_codex":0.00013845526,"about_ca_system_score_gemma":0.000024167271,"threshold_uncertainty_score":0.99994224},"labels":[],"label_agreement":null},{"id":"W2782241925","doi":"10.1049/iet-com.2017.0679","title":"Packet relay‐assisted V2V communication with sectorised relay station employing payload combining scheme","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":7,"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":"Swine Innovation Porc","keywords":"Relay; Computer science; Computer network; Network packet; Payload (computing); Real-time computing; Physics","score_opus":0.02108312413343903,"score_gpt":0.24940445819534057,"score_spread":0.22832133406190155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782241925","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.90598565,0.0061625196,0.03674735,0.0032162124,0.0005272165,0.0016636351,0.00009704609,0.0037163568,0.04188399],"genre_scores_gemma":[0.9031201,0.00080658746,0.09486595,0.00014514093,0.00006860849,0.00017073815,0.0005797944,0.00011876272,0.00012430095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811584,0.00033010883,0.00054319785,0.00025446402,0.0003064664,0.0004499168],"domain_scores_gemma":[0.9949827,0.0004040241,0.00018342592,0.0038612345,0.00041449955,0.00015411257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053749705,0.00029759272,0.00029323404,0.00015544574,0.00081878423,0.00014916412,0.0012971341,0.00016026723,0.00008104927],"category_scores_gemma":[0.00009152737,0.00031135036,0.00007285166,0.00083066063,0.00036687317,0.00045379862,0.0002885246,0.0007934726,0.00024805922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053720764,0.0021725583,0.04994004,0.0006029322,0.0041951234,0.000036348283,0.048781715,0.5258913,0.06461262,0.039248005,0.15245256,0.111529574],"study_design_scores_gemma":[0.0019105818,0.00021120333,0.017730176,0.00055231794,0.00015063392,0.000060511316,0.0011379945,0.90195245,0.0011002264,0.00034754162,0.073930174,0.0009161806],"about_ca_topic_score_codex":0.00010083705,"about_ca_topic_score_gemma":0.0013466426,"teacher_disagreement_score":0.37606114,"about_ca_system_score_codex":0.00026751665,"about_ca_system_score_gemma":0.00006729175,"threshold_uncertainty_score":0.99993384},"labels":[],"label_agreement":null},{"id":"W278832587","doi":"10.1049/iet-com.2010.0078","title":"Efficient soft decoding of Reed–Solomon codes based on sphere decoding","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; List decoding; Code word; Algorithm; Sequential decoding; Computer science; Mathematics; Coding (social sciences); Theoretical computer science; Concatenated error correction code; Block code; Statistics","score_opus":0.0626680418802916,"score_gpt":0.2730091243760964,"score_spread":0.21034108249580483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W278832587","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.07793902,0.00035857144,0.8504979,0.0006534604,0.00021806205,0.0002691493,0.000014656017,0.00036105743,0.06968815],"genre_scores_gemma":[0.84232354,0.000017234233,0.15745614,0.00015464629,0.000006255815,0.00001970163,0.000003760579,0.000007989554,0.000010731868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988935,0.00022970475,0.000285762,0.00022149319,0.0001665807,0.00020296447],"domain_scores_gemma":[0.9961709,0.000641053,0.00016581474,0.0028483719,0.000102272345,0.00007163606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006052593,0.00011986418,0.00016078478,0.00016125446,0.00036480225,0.00004155533,0.0026706962,0.000055620123,0.000057315374],"category_scores_gemma":[0.00009720653,0.0001236868,0.00013033357,0.0005913623,0.00018377342,0.00008105794,0.0004870754,0.00018996534,0.000027898104],"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.000043448184,0.000994545,0.0053402768,0.000028373583,0.00004287071,0.0000022305912,0.004833816,0.0025869126,0.0020475765,0.9236624,0.00023011661,0.060187396],"study_design_scores_gemma":[0.0005812001,0.000322871,0.0055882484,0.00030922628,0.000037822487,0.0000051525158,0.00040675895,0.9578202,0.0083282245,0.024603326,0.0015580382,0.00043896044],"about_ca_topic_score_codex":0.00004929656,"about_ca_topic_score_gemma":0.00007106793,"teacher_disagreement_score":0.9552333,"about_ca_system_score_codex":0.000024035344,"about_ca_system_score_gemma":0.0000492263,"threshold_uncertainty_score":0.5043801},"labels":[],"label_agreement":null},{"id":"W2789696295","doi":"10.1049/iet-com.2017.1177","title":"Detailed analysis of energy detection‐based millimetre‐wave time‐of‐arrival measurement system","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Millimetre wave; Computer science; Real-time computing; Energy (signal processing); Telecommunications; Physics; Statistics; Mathematics; Optics","score_opus":0.028313683490626167,"score_gpt":0.22204058058239695,"score_spread":0.1937268970917708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789696295","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.06051721,0.0013553433,0.9231967,0.00009911351,0.0001837652,0.0002114957,0.000104554165,0.001189839,0.013142003],"genre_scores_gemma":[0.99635756,0.00004128875,0.0034815765,0.000008495819,0.000009709714,0.0000422819,0.000029752875,0.000015899692,0.000013459113],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991044,0.00007581978,0.00038976825,0.00009023269,0.00022125943,0.000118545046],"domain_scores_gemma":[0.9978081,0.00008401372,0.000106070045,0.0015065685,0.00046803933,0.000027226284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022195104,0.000104325874,0.0002699101,0.00058367185,0.00011289903,0.000008868623,0.00051242695,0.000092795795,0.000054617656],"category_scores_gemma":[0.00007054567,0.000106069914,0.00014794672,0.0017095768,0.00019868747,0.000039958177,0.0000782873,0.000069401925,0.000011578824],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013388219,0.0010630358,0.019614331,0.0009152042,0.020220634,0.0000027333476,0.0032350428,0.21727918,0.62861645,0.047736824,0.0029653662,0.05821732],"study_design_scores_gemma":[0.00016011778,0.000037369948,0.002046089,0.000033004137,0.0005036568,3.9129097e-7,0.00017043941,0.6363553,0.35934782,0.000029287981,0.0012088506,0.00010764996],"about_ca_topic_score_codex":0.000051739597,"about_ca_topic_score_gemma":0.0009036489,"teacher_disagreement_score":0.9358403,"about_ca_system_score_codex":0.00012563252,"about_ca_system_score_gemma":0.000022940138,"threshold_uncertainty_score":0.43254057},"labels":[],"label_agreement":null},{"id":"W2790600346","doi":"10.1049/iet-com.2017.1376","title":"2D curtailed harmonic memory polynomial for reduced complexity in concurrent dual‐band modelling and digital predistortion with the second band at harmonic frequency","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Science and Engineering Research Board; Defence Research and Development Organisation","keywords":"Predistortion; Harmonic; Multi-band device; Computer science; Polynomial; Dual (grammatical number); Mathematics; Telecommunications; Bandwidth (computing); Physics; Amplifier; Acoustics","score_opus":0.06907132848260732,"score_gpt":0.27627654965462745,"score_spread":0.20720522117202012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790600346","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.90407413,0.0028695602,0.08727134,0.00069951615,0.00022419645,0.0011865394,0.0003770858,0.0001891861,0.003108425],"genre_scores_gemma":[0.99640864,0.000105128,0.0027851579,0.000036540834,0.00006418898,0.0002445379,0.00013971438,0.00004212743,0.00017395463],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907213,0.000051041014,0.00029518112,0.00021550925,0.000097865115,0.00026826188],"domain_scores_gemma":[0.998529,0.00027031574,0.00008180787,0.00095719984,0.000086267835,0.00007539849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014882798,0.00018931349,0.00019731019,0.000064005886,0.00037464467,0.00008319237,0.00039299013,0.00006341627,0.000033928165],"category_scores_gemma":[0.000015111977,0.0001646022,0.000040160015,0.00014340208,0.0005187255,0.0003569128,0.00008413081,0.00026231812,0.000007057293],"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.002429365,0.002489392,0.01352267,0.0019409676,0.0030165312,0.00001823618,0.1370757,0.10433069,0.5110864,0.0125583485,0.17892778,0.032603934],"study_design_scores_gemma":[0.012663921,0.0010557038,0.011969134,0.00056151696,0.0003939595,0.000140238,0.0020873847,0.7649718,0.08222642,0.010120817,0.11080403,0.003005088],"about_ca_topic_score_codex":0.000024917177,"about_ca_topic_score_gemma":0.0013160167,"teacher_disagreement_score":0.66064113,"about_ca_system_score_codex":0.0002310636,"about_ca_system_score_gemma":0.000044989836,"threshold_uncertainty_score":0.6712283},"labels":[],"label_agreement":null},{"id":"W2792692675","doi":"10.1049/iet-com.2017.1093","title":"Enhanced Bloom filter utilisation scheme for string matching using a splitting approach","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bloom filter; Computer science; Bloom; Matching (statistics); Filter (signal processing); Scheme (mathematics); String (physics); Algorithm; Mathematical optimization; Mathematics; Statistics; Biology; Ecology; Mathematical analysis; Computer vision","score_opus":0.10986510650441123,"score_gpt":0.3213686138936641,"score_spread":0.2115035073892529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792692675","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.1856672,0.000099112825,0.8116632,0.0003589378,0.000105099694,0.00019841567,0.000003926754,0.00015872426,0.0017453702],"genre_scores_gemma":[0.64801246,0.000006191221,0.3516698,0.0001280742,0.00007246013,0.000032417778,0.000012112908,0.0000076885435,0.00005879573],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907005,0.00008821541,0.00024683468,0.00025283778,0.00012451375,0.00021752427],"domain_scores_gemma":[0.99769515,0.00022119693,0.00012891238,0.001726363,0.00018336618,0.000045024597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045974215,0.000103824204,0.000115718416,0.00008705763,0.0007997255,0.00022850509,0.0014928892,0.00004780469,0.0000024067408],"category_scores_gemma":[0.00007232488,0.00011181809,0.000079694146,0.00024049057,0.00007459689,0.0004911884,0.0006196282,0.00015687467,0.00000976657],"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.00002878505,0.0005105496,0.0006062968,0.00009231717,0.00016964122,4.0337e-7,0.020324627,0.00092929736,0.5255986,0.38347435,0.00037547798,0.06788969],"study_design_scores_gemma":[0.00029742162,0.00002640667,0.00015957412,0.00006704659,0.000014025712,0.0000058094265,0.0004384387,0.9909674,0.0038211457,0.0032529451,0.00076925533,0.00018054745],"about_ca_topic_score_codex":0.00013206065,"about_ca_topic_score_gemma":0.000018387127,"teacher_disagreement_score":0.9900381,"about_ca_system_score_codex":0.00005471378,"about_ca_system_score_gemma":0.00005183791,"threshold_uncertainty_score":0.6150923},"labels":[],"label_agreement":null},{"id":"W2793222875","doi":"10.1049/iet-com.2017.0719","title":"Maximising the degrees of freedom of the physical‐layer secured relay networks with artificial jamming","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Jamming; Physical layer; Degrees of freedom (physics and chemistry); Relay; Computer science; Layer (electronics); Telecommunications; Computer network; Physics; Nanotechnology; Materials science; Quantum mechanics; Wireless","score_opus":0.029828621906412216,"score_gpt":0.26204911993757396,"score_spread":0.23222049803116174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793222875","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.89014304,0.0023471192,0.07807525,0.005053815,0.00026006202,0.0013450852,0.000051609288,0.0008974904,0.021826552],"genre_scores_gemma":[0.9841434,0.00013331414,0.015547503,0.000019123443,0.000060506074,0.000045923713,0.0000066887774,0.000033011787,0.000010570836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906105,0.00019252635,0.0003288924,0.00008601701,0.00018167366,0.00014984315],"domain_scores_gemma":[0.995279,0.00043968967,0.0001761742,0.0038422218,0.00023928989,0.000023608172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026857606,0.00012679382,0.00018658629,0.000044421653,0.00033625416,0.000025496214,0.0022825303,0.00006976467,0.000007677648],"category_scores_gemma":[0.000050025767,0.000082166735,0.00008533229,0.0005259973,0.0010195778,0.000099090044,0.0004825273,0.0004252498,0.00000277652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011281277,0.0012501412,0.005821159,0.00017929381,0.0010140055,4.775857e-7,0.08358985,0.50872105,0.07864983,0.27141947,0.009279015,0.03996291],"study_design_scores_gemma":[0.00019439597,0.000090052825,0.005369805,0.00034674673,0.00011243552,0.0000057332027,0.0016619437,0.95940286,0.024055226,0.001037568,0.0074449764,0.00027823096],"about_ca_topic_score_codex":0.00011173788,"about_ca_topic_score_gemma":0.0011270725,"teacher_disagreement_score":0.45068187,"about_ca_system_score_codex":0.00002975799,"about_ca_system_score_gemma":0.000025848662,"threshold_uncertainty_score":0.42415473},"labels":[],"label_agreement":null},{"id":"W2794955612","doi":"10.1049/iet-com.2017.1206","title":"Joint user selection, mode assignment, and power allocation in cognitive radio‐assisted D2D networks","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cognitive radio; Computer science; Joint (building); Selection (genetic algorithm); Mode (computer interface); Computer network; Telecommunications; Wireless; Artificial intelligence; Human–computer interaction; Engineering","score_opus":0.03484522677891361,"score_gpt":0.2918016009714882,"score_spread":0.2569563741925746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794955612","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.02974405,0.00048453166,0.9589149,0.0032761567,0.0001373825,0.00032724955,0.0000025890552,0.00013727698,0.0069758743],"genre_scores_gemma":[0.9814606,0.0003520343,0.01754566,0.00041063983,0.00006970405,0.000031052634,0.000017588,0.000013273945,0.000099480356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986698,0.00029620153,0.00030110823,0.00033294113,0.00012013028,0.0002798057],"domain_scores_gemma":[0.998461,0.0002872099,0.00012253142,0.0007706764,0.0002711157,0.000087437336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034878994,0.00014674728,0.00017235141,0.00015645428,0.00046562726,0.0001734687,0.00044617188,0.000085491985,0.000015724401],"category_scores_gemma":[0.00005660421,0.00015691665,0.00003851379,0.0007813123,0.00025079597,0.00041629284,0.00035852898,0.0003006814,0.000010597237],"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.00015860953,0.0025227556,0.051895116,0.000023320643,0.0006489508,0.00001751161,0.022213003,0.0026219934,0.009992585,0.37050486,0.014000362,0.52540094],"study_design_scores_gemma":[0.00061978056,0.00011578796,0.09050877,0.00012221247,0.000018977447,0.000052248626,0.00016014182,0.90354174,0.0002454071,0.0015321084,0.0028090822,0.00027374318],"about_ca_topic_score_codex":0.00015649067,"about_ca_topic_score_gemma":0.0019396847,"teacher_disagreement_score":0.95171654,"about_ca_system_score_codex":0.00011584219,"about_ca_system_score_gemma":0.00006314005,"threshold_uncertainty_score":0.6398876},"labels":[],"label_agreement":null},{"id":"W2799587485","doi":"10.1049/iet-com.2017.1352","title":"Analysis of ripple size evolution in the LT process","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Queen's University","funders":"Division of Administrative Services; Natural Sciences and Engineering Research Council of Canada","keywords":"Ripple; Decoding methods; Expression (computer science); Algorithm; Mathematics; Computer science; Closed-form expression; Function (biology); Topology (electrical circuits); Combinatorics; Mathematical analysis; Power (physics); Physics","score_opus":0.018355845844803664,"score_gpt":0.3130997651791834,"score_spread":0.29474391933437977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799587485","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.5857793,0.005459944,0.28286898,0.00422129,0.000103960476,0.0015494857,0.00015222908,0.0018461348,0.11801867],"genre_scores_gemma":[0.98885745,0.000398521,0.010494104,0.000036789123,0.0000072217495,0.00015402761,0.000030512825,0.000010966424,0.000010392278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933124,0.000114136914,0.00027553557,0.00006745566,0.00011052372,0.00010108455],"domain_scores_gemma":[0.996748,0.00041550855,0.000065869346,0.0026158593,0.00014091091,0.000013869685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002815433,0.000072334806,0.00014365512,0.00019459544,0.00010666125,0.0000103136645,0.0016694544,0.000046650828,0.000025246078],"category_scores_gemma":[0.00011031125,0.00006495574,0.000054139637,0.0020105322,0.00023286337,0.00012948993,0.00010755691,0.00017610098,0.0000069338507],"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.0000665776,0.0028288937,0.16374052,0.0003536404,0.00315113,0.0000011464672,0.094226055,0.15015972,0.06813399,0.44904557,0.0064074094,0.061885346],"study_design_scores_gemma":[0.0004027229,0.000082339706,0.32823953,0.00010656573,0.0004969565,0.0000027417302,0.0034812961,0.61639297,0.00827036,0.025192084,0.016802782,0.0005296427],"about_ca_topic_score_codex":0.000057169564,"about_ca_topic_score_gemma":0.0013665798,"teacher_disagreement_score":0.46623328,"about_ca_system_score_codex":0.000059062517,"about_ca_system_score_gemma":0.000014354214,"threshold_uncertainty_score":0.31022894},"labels":[],"label_agreement":null},{"id":"W2883529285","doi":"10.1049/iet-com.2018.5386","title":"Performance of uplink WFRFT‐based hybrid carrier systems with non‐orthogonal multiple access","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Telecommunications link; Computer science; Telecommunications","score_opus":0.02846751050422739,"score_gpt":0.2704117697181071,"score_spread":0.24194425921387971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883529285","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.8720873,0.0010422961,0.11848046,0.00029459878,0.00012906828,0.00054292224,0.00009279267,0.001143645,0.006186913],"genre_scores_gemma":[0.9766364,0.000508838,0.02241358,0.000017997003,0.000016323294,0.00025344585,0.000079533835,0.000045217865,0.000028651977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991163,0.000035919435,0.0003539042,0.00013429065,0.00014918971,0.00021040834],"domain_scores_gemma":[0.99548376,0.0002493914,0.00013379297,0.003772745,0.00031301184,0.00004727673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011974559,0.00016940192,0.00022955437,0.00015411875,0.00025733936,0.00003702608,0.0025549293,0.00007051471,0.0000132845125],"category_scores_gemma":[0.00004479563,0.00016217759,0.00003833577,0.00038613277,0.0006415982,0.00033438904,0.00043164133,0.00031360975,0.0000188184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000136749,0.00044758653,0.16316885,0.0007461337,0.000410267,0.0000018502258,0.00084731507,0.7657546,0.020643076,0.0043609696,0.0023394846,0.041143164],"study_design_scores_gemma":[0.00039990307,0.00007690905,0.007410132,0.00016140405,0.000014850216,0.000004920196,0.0000833437,0.9571877,0.028616419,0.00002830512,0.005786054,0.00023007253],"about_ca_topic_score_codex":0.00003094393,"about_ca_topic_score_gemma":0.000056590525,"teacher_disagreement_score":0.19143313,"about_ca_system_score_codex":0.00006354556,"about_ca_system_score_gemma":0.00005480804,"threshold_uncertainty_score":0.661341},"labels":[],"label_agreement":null},{"id":"W2884190716","doi":"10.1049/iet-com.2017.0306","title":"Protocol with self‐adaptive GB for BANs","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Transceiver; Node (physics); Energy consumption; Transmission (telecommunications); Guard (computer science); Wireless sensor network; Sensor node; Quality of service; Real-time computing; Telecommunications; Key distribution in wireless sensor networks; Wireless; Engineering; Wireless network; Electrical engineering","score_opus":0.030652269211778195,"score_gpt":0.2846300056308953,"score_spread":0.2539777364191171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884190716","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.0032781798,0.000103035316,0.43668383,0.002431315,0.00025851378,0.21874449,0.00016445534,0.00492621,0.33340997],"genre_scores_gemma":[0.66081035,0.000006166749,0.13924721,0.000056568795,0.0001463453,0.19952863,0.00002357776,0.00005602985,0.00012510293],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950796,0.00002625159,0.00013032771,0.000091661146,0.00006307562,0.00018073157],"domain_scores_gemma":[0.99836326,0.00012306405,0.000027812719,0.0013020153,0.00013687504,0.000046984056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008399185,0.000104509374,0.00009790274,0.00003550175,0.00022869334,0.000027052134,0.0006029311,0.000055353652,0.00002073683],"category_scores_gemma":[0.0000071067193,0.00009582049,0.000028309001,0.00017834861,0.00013522919,0.00010577025,0.000079564925,0.00014101178,0.000048756414],"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.0007678614,0.0023912345,0.0047752284,0.000811515,0.0028536988,0.000005344945,0.037516564,0.03960169,0.0040880134,0.3402031,0.46740893,0.0995768],"study_design_scores_gemma":[0.00096907414,0.00028676091,0.0013389976,0.0000981776,0.00003777036,0.0000056676363,0.00014828092,0.4161048,0.0010647845,0.0008606543,0.5787618,0.00032323116],"about_ca_topic_score_codex":0.000009259221,"about_ca_topic_score_gemma":0.00028806648,"teacher_disagreement_score":0.65753216,"about_ca_system_score_codex":0.000054551136,"about_ca_system_score_gemma":0.000027929314,"threshold_uncertainty_score":0.39074463},"labels":[],"label_agreement":null},{"id":"W2884411660","doi":"10.1049/iet-com.2018.5069","title":"Content pollution propagation in the overlay network of peer‐to‐peer live streaming systems: modelling and analysis","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Overlay; Peer-to-peer; Live streaming; Overlay network; Computer network; Pollution; Distributed computing; Environmental economics; The Internet; World Wide Web","score_opus":0.07574646474468663,"score_gpt":0.29117587941017714,"score_spread":0.2154294146654905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884411660","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.0875052,0.00055206125,0.8883759,0.022206822,0.00007792001,0.00057764316,0.000011993291,0.00013121332,0.00056127395],"genre_scores_gemma":[0.917577,0.0000393522,0.08200993,0.000166967,0.000029355013,0.00009038754,0.00001321127,0.0000047403782,0.000069048845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856097,0.00024857477,0.0003564826,0.0002317926,0.00038581612,0.00021635681],"domain_scores_gemma":[0.9966274,0.00026958235,0.000161705,0.0022399612,0.0006628919,0.000038484937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013901998,0.000105757084,0.00020203479,0.00023342523,0.00026643116,0.00014325569,0.0020868925,0.00006667492,5.54703e-7],"category_scores_gemma":[0.00020240352,0.00008615958,0.000044120792,0.0022999982,0.0001401625,0.00022425037,0.0007860657,0.00017060344,0.000008040323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014054829,0.00017997886,0.009966477,0.000017270802,0.0002681984,0.0000010798288,0.022269594,0.75722307,0.00039565467,0.19111396,0.00401318,0.014537486],"study_design_scores_gemma":[0.00008624898,0.00008621386,0.016034687,0.00008001422,0.000058130645,0.0000024274614,0.0013050034,0.9788353,0.00004826526,0.0013105948,0.002034694,0.00011845917],"about_ca_topic_score_codex":0.0010732526,"about_ca_topic_score_gemma":0.0011351019,"teacher_disagreement_score":0.8300718,"about_ca_system_score_codex":0.000081579485,"about_ca_system_score_gemma":0.000034727647,"threshold_uncertainty_score":0.38780004},"labels":[],"label_agreement":null},{"id":"W2889614711","doi":"10.1049/iet-com.2018.5491","title":"Robust quaternary fountain codes in AWGN interference","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Fountain; Interference (communication); Additive white Gaussian noise; Computer science; Quaternary; Telecommunications; Mathematics; White noise; Decoding methods; Concatenated error correction code; Block code; Geology; Geography","score_opus":0.1026133796919187,"score_gpt":0.3357789117287844,"score_spread":0.23316553203686569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889614711","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.03777943,0.00023936108,0.9235571,0.006898118,0.00029528575,0.00027252128,0.0000031096858,0.0010889327,0.029866157],"genre_scores_gemma":[0.7708316,0.000067152476,0.22862661,0.00026423592,0.000020686597,0.000051983283,0.0000030763026,0.000007861015,0.00012681895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890274,0.00025031276,0.0002671292,0.00024954506,0.000115554074,0.0002146997],"domain_scores_gemma":[0.99613106,0.000302145,0.000093424045,0.0032842138,0.00014454272,0.000044617238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051881163,0.00011080184,0.00012644887,0.00017813031,0.00019631308,0.000117942196,0.0048105405,0.000057695383,0.000012415943],"category_scores_gemma":[0.00013460642,0.00011636342,0.000033804372,0.00055820786,0.00023427444,0.00041305475,0.0018024598,0.000292316,0.00013491845],"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.000036017405,0.0014010194,0.1783374,0.000040940286,0.00006322378,0.00002291253,0.03648459,0.00011112087,0.010508648,0.5915057,0.019954141,0.16153426],"study_design_scores_gemma":[0.00055840454,0.00060480303,0.035908774,0.0006581212,0.000012258016,0.00009430096,0.00072863564,0.84649915,0.011474945,0.08121358,0.021209506,0.0010375157],"about_ca_topic_score_codex":0.00097142864,"about_ca_topic_score_gemma":0.004269928,"teacher_disagreement_score":0.84638804,"about_ca_system_score_codex":0.00010084215,"about_ca_system_score_gemma":0.00006459901,"threshold_uncertainty_score":0.8939261},"labels":[],"label_agreement":null},{"id":"W2890880272","doi":"10.1049/iet-com.2018.5544","title":"Dynamic power allocation scheme with clustering based on physical layer security","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cluster analysis; Scheme (mathematics); Physical layer; Layer (electronics); Computer network; Telecommunications; Mathematics; Wireless; Artificial intelligence; Chemistry","score_opus":0.015076978184923354,"score_gpt":0.2773662058148606,"score_spread":0.2622892276299372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890880272","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.24757135,0.0005345112,0.65691245,0.008316469,0.00018898965,0.0010349599,0.000058788122,0.0072397445,0.07814273],"genre_scores_gemma":[0.9492728,0.000092161936,0.050248593,0.00011213173,0.000009752266,0.00014846622,0.00004938803,0.00004740414,0.00001928448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927455,0.000048841124,0.00017010812,0.0001573278,0.00014831439,0.0002008768],"domain_scores_gemma":[0.99601364,0.00018350789,0.0000539993,0.0035716074,0.0001354375,0.000041781426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000080065925,0.00017259391,0.00014698227,0.00012263327,0.00026127894,0.00003488424,0.0012803732,0.00008038182,0.000020947986],"category_scores_gemma":[0.000044119985,0.00016884992,0.000037351212,0.00040334335,0.00037913956,0.00018385355,0.00025569528,0.0004135732,0.00012663555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028280052,0.003335472,0.0023894554,0.00028648227,0.0005670251,0.000004766253,0.012020268,0.6730296,0.10898833,0.13320829,0.004134996,0.06175249],"study_design_scores_gemma":[0.00026501488,0.000100807185,0.00065907085,0.00006939267,0.0000064580863,0.0000015199827,0.00021866785,0.98681957,0.0034288364,0.0010103974,0.0071908827,0.0002293697],"about_ca_topic_score_codex":0.0000056963945,"about_ca_topic_score_gemma":0.00030388916,"teacher_disagreement_score":0.70170146,"about_ca_system_score_codex":0.0001391635,"about_ca_system_score_gemma":0.00002130632,"threshold_uncertainty_score":0.68854994},"labels":[],"label_agreement":null},{"id":"W2893084608","doi":"10.1049/iet-com.2018.5508","title":"Transceiver design for multiple‐input multiple‐output full‐duplex amplify‐and‐forward relay communication systems","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Transceiver; Computer science; Communications system; Duplex (building); Telecommunications; Wireless; Physics","score_opus":0.05610922498922317,"score_gpt":0.26568353410592777,"score_spread":0.2095743091167046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893084608","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.16138572,0.019495208,0.79816043,0.0048820167,0.00083765236,0.0068876757,0.0009474213,0.003711052,0.0036928293],"genre_scores_gemma":[0.8497957,0.004015722,0.14315367,0.00008423324,0.000093229115,0.0018398761,0.0005534019,0.0001575561,0.00030662763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725926,0.0005667347,0.0009306283,0.00038977453,0.00025951906,0.00059406593],"domain_scores_gemma":[0.9883309,0.0040598675,0.0002010276,0.0066288505,0.0005336156,0.00024571523],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00088970974,0.00046550922,0.00051890535,0.00028866756,0.0016082891,0.00023795723,0.0032119988,0.0003714978,0.0000215053],"category_scores_gemma":[0.00046591723,0.000525344,0.00017392114,0.00052837963,0.00092947175,0.00048349026,0.00044231812,0.0007246825,0.0001719654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026979778,0.0008149412,0.001430405,0.00045919482,0.0011437132,9.119585e-7,0.017318994,0.8642097,0.032283217,0.035432525,0.029889489,0.01674709],"study_design_scores_gemma":[0.0012816873,0.00010581645,0.0012315091,0.00015735082,0.000115899806,0.000018177823,0.00065128703,0.88681006,0.00037896362,0.000059330727,0.10864905,0.0005408624],"about_ca_topic_score_codex":0.00019266686,"about_ca_topic_score_gemma":0.0010527634,"teacher_disagreement_score":0.68841,"about_ca_system_score_codex":0.00023277184,"about_ca_system_score_gemma":0.000073911964,"threshold_uncertainty_score":0.9997198},"labels":[],"label_agreement":null},{"id":"W2897095671","doi":"10.1049/iet-com.2018.5464","title":"Energy‐efficient power allocation in underlay and overlay cognitive device‐to‐device communications","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Underlay; Overlay; Computer science; Power (physics); Energy (signal processing); Cognitive radio; Computer network; Efficient energy use; Cognition; Telecommunications; Electrical engineering; Wireless; Psychology; Signal-to-noise ratio (imaging); Engineering; Physics","score_opus":0.035340600927699195,"score_gpt":0.30455340878028836,"score_spread":0.26921280785258916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897095671","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.08091387,0.0037903828,0.789064,0.052148353,0.0003209025,0.0009109635,0.000026653475,0.00040294306,0.07242196],"genre_scores_gemma":[0.97042316,0.00044198913,0.026325831,0.0026121766,0.000036664063,0.000053702417,0.000027608805,0.000017883884,0.00006099928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982232,0.00042228814,0.00038690673,0.00041415798,0.00020854906,0.0003449276],"domain_scores_gemma":[0.99534017,0.0010447555,0.00012981365,0.0028830115,0.00044376415,0.00015851147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049543305,0.00019199146,0.00020375867,0.00028791142,0.0007000312,0.00023569753,0.0019380387,0.00008247066,0.00001107396],"category_scores_gemma":[0.00012759108,0.00021023811,0.000046390855,0.0013702229,0.0004318033,0.000280613,0.0017848318,0.0002754401,0.000061943894],"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.00003453996,0.0012453432,0.0028678551,0.000012032938,0.00013179351,0.000005536741,0.024740929,0.00019026129,0.002264372,0.7558859,0.0015077295,0.21111369],"study_design_scores_gemma":[0.0011475488,0.00030796736,0.06268619,0.0005275672,0.00005015956,0.000054655877,0.0018397748,0.86436343,0.00065416784,0.005579946,0.061889477,0.000899097],"about_ca_topic_score_codex":0.0004214783,"about_ca_topic_score_gemma":0.0064165047,"teacher_disagreement_score":0.88950926,"about_ca_system_score_codex":0.00012761758,"about_ca_system_score_gemma":0.00011683723,"threshold_uncertainty_score":0.85732615},"labels":[],"label_agreement":null},{"id":"W2898784777","doi":"10.1049/iet-com.2018.5664","title":"WDM for multi‐user indoor VLC systems with SCM","year":2019,"lang":"en","type":"preprint","venue":"IET Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Population and Public Health; Engineering and Physical Sciences Research Council; King Saud University","keywords":"Visible light communication; Subcarrier; Computer science; Wavelength-division multiplexing; Multiplexing; Interference (communication); Channel (broadcasting); Electronic engineering; Real-time computing; Computer hardware; Orthogonal frequency-division multiplexing; Telecommunications; Wavelength; Optics; Engineering; Physics; Light-emitting diode","score_opus":0.06996207456571116,"score_gpt":0.30145267775458895,"score_spread":0.2314906031888778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898784777","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.025131648,0.0796899,0.80818653,0.010399774,0.0027464107,0.01685496,0.0024005875,0.01824477,0.036345396],"genre_scores_gemma":[0.8202305,0.0044348687,0.17074496,0.000030196727,0.000026299675,0.0031875847,0.0005154897,0.00014810964,0.00068200595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984754,0.00009534487,0.00057819346,0.00031501317,0.00018436383,0.00035174083],"domain_scores_gemma":[0.98869264,0.0006352732,0.00019475781,0.010075477,0.00032890425,0.00007294947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025873695,0.00039940997,0.00058822247,0.00022395732,0.00020832088,0.00021238315,0.0051259804,0.0006039361,0.000007377989],"category_scores_gemma":[0.00015219815,0.0003820727,0.00014120321,0.00023850653,0.000309703,0.00012267052,0.002673506,0.0015111458,0.00014883213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077501245,0.0013158366,0.0050222264,0.005540898,0.0028544727,0.0000020616817,0.0021814608,0.6210738,0.0010213084,0.31258383,0.026911136,0.021415485],"study_design_scores_gemma":[0.0009927462,0.00006325686,0.0008813368,0.0009871009,0.00012555429,0.0000056480058,0.00079362065,0.8033268,0.0005382692,0.00066078827,0.1906124,0.0010124829],"about_ca_topic_score_codex":0.00007055325,"about_ca_topic_score_gemma":0.00012544569,"teacher_disagreement_score":0.79509884,"about_ca_system_score_codex":0.00023054951,"about_ca_system_score_gemma":0.00010418463,"threshold_uncertainty_score":0.99986315},"labels":[],"label_agreement":null},{"id":"W2900710097","doi":"10.1049/iet-com.2018.5035","title":"Prioritised and selective power control in cellular wireless networks","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Power control; Computer science; Signal-to-interference-plus-noise ratio; Telecommunications link; Transmitter power output; Power (physics); Interference (communication); Wireless; Power consumption; Signal-to-noise ratio (imaging); Computer network; Transmitter; Control (management); Control theory (sociology); Real-time computing; Mathematical optimization; Telecommunications; Mathematics; Artificial intelligence; Channel (broadcasting)","score_opus":0.017790172569892636,"score_gpt":0.28436153642798884,"score_spread":0.2665713638580962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900710097","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.046457138,0.0051018535,0.91128826,0.015647456,0.00020467944,0.0012386997,0.000007052192,0.00040780485,0.019647064],"genre_scores_gemma":[0.9874152,0.00079499476,0.011193241,0.00037188613,0.00003738943,0.00008833579,0.000007098202,0.000016851467,0.000075003205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979606,0.00078255875,0.00033674642,0.00032611747,0.00019132461,0.00040259882],"domain_scores_gemma":[0.99469745,0.0008208527,0.00010280264,0.0038937873,0.00035517092,0.00012992727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000762161,0.00014638656,0.00021700484,0.00018407755,0.00048184692,0.00022242374,0.003947023,0.00011967673,0.000012162367],"category_scores_gemma":[0.00006447713,0.0001602906,0.000038185935,0.0011281417,0.0005970326,0.00044416141,0.0016383077,0.0006149169,0.00003462032],"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.00012326588,0.0017920223,0.035135455,0.000026701295,0.00026292942,0.000017962962,0.017672746,0.0016072205,0.008708753,0.7306477,0.010557744,0.1934475],"study_design_scores_gemma":[0.0009803015,0.00009614849,0.018759958,0.00004986055,0.0000039526053,0.000008032868,0.000081270715,0.97066844,0.00012318967,0.002047205,0.006946757,0.00023489402],"about_ca_topic_score_codex":0.000116246934,"about_ca_topic_score_gemma":0.00055249786,"teacher_disagreement_score":0.9690612,"about_ca_system_score_codex":0.000096013675,"about_ca_system_score_gemma":0.000115766095,"threshold_uncertainty_score":0.7334616},"labels":[],"label_agreement":null},{"id":"W2903920861","doi":"10.1049/iet-com.2018.5654","title":"Pilot decontamination in massive multiuser MIMO systems based on low‐rank matrix approximation","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Human decontamination; Rank (graph theory); MIMO; Matrix (chemical analysis); Computer science; Mathematical optimization; Mathematics; Applied mathematics; Statistics; Medicine; Combinatorics; Chemistry","score_opus":0.020248782318115048,"score_gpt":0.27590395649652655,"score_spread":0.2556551741784115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903920861","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.0147977015,0.0004216468,0.96564484,0.00035217087,0.0007134353,0.0016182179,0.000048249403,0.0006939407,0.015709829],"genre_scores_gemma":[0.975218,0.000053412066,0.023847742,0.000029315495,0.00006425203,0.00041740545,0.0001987179,0.000051974715,0.000119167205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889827,0.00016105604,0.0004383144,0.00017112367,0.0001339612,0.00019729232],"domain_scores_gemma":[0.9980378,0.00027815514,0.000111671776,0.0013380535,0.000194363,0.000039920513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002606348,0.0001670973,0.00017834964,0.000307608,0.00014645481,0.000055130782,0.00045706725,0.000079174206,0.000016218262],"category_scores_gemma":[0.00011968326,0.00018997533,0.00003095557,0.00045606412,0.000070094604,0.00032062866,0.000043457934,0.00019701952,0.00017789747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019603913,0.00017217627,0.00041773263,0.00011045658,0.000014484241,5.510395e-7,0.00069034967,0.98855925,0.0030246698,0.005595353,0.00046615204,0.00092924305],"study_design_scores_gemma":[0.0007394185,0.000071629955,0.00088418555,0.00024964262,0.000008428799,0.0000010334426,0.00020335116,0.9959762,0.00066168234,0.00006832381,0.00094615744,0.00018994435],"about_ca_topic_score_codex":0.000086347856,"about_ca_topic_score_gemma":0.00037908758,"teacher_disagreement_score":0.9604203,"about_ca_system_score_codex":0.00035159718,"about_ca_system_score_gemma":0.000024202232,"threshold_uncertainty_score":0.7746969},"labels":[],"label_agreement":null},{"id":"W2904233643","doi":"10.1049/iet-com.2018.5216","title":"Cooperative jamming‐based physical‐layer security of cooperative cognitive radio networks: system model and enabling techniques","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Jamming; Physical layer; Cognitive radio; Computer science; Computer network; Layer (electronics); Telecommunications; Wireless","score_opus":0.02865989531718224,"score_gpt":0.2915801016213723,"score_spread":0.2629202063041901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904233643","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.2787738,0.00453558,0.66858745,0.00068886095,0.000094661526,0.0031474603,0.00045702007,0.0049983603,0.038716815],"genre_scores_gemma":[0.98084646,0.0008151188,0.017635433,0.000065019995,0.000055316632,0.00041996708,0.00008927601,0.000061818275,0.000011580076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856675,0.0003193143,0.00045985315,0.00023740677,0.00016882314,0.00024788297],"domain_scores_gemma":[0.9963746,0.0006700955,0.00014590057,0.001762975,0.0009518968,0.00009451058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036558535,0.00028171114,0.00045119907,0.00017343624,0.0004178702,0.00007087481,0.0009409311,0.00015829597,0.0000058223736],"category_scores_gemma":[0.00009508673,0.0002986414,0.000075255004,0.00052986527,0.00092223106,0.0003230891,0.00041127036,0.0005343506,0.000005245757],"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.00044681967,0.0046507763,0.0009980785,0.0020122088,0.0025476248,0.0000076254973,0.1765135,0.09421166,0.14849292,0.5143354,0.011910063,0.043873344],"study_design_scores_gemma":[0.00026343882,0.00012493315,0.000025259065,0.00047422724,0.000058372738,0.000003153688,0.0013120611,0.91541153,0.08104549,0.00024313491,0.00074186415,0.00029651079],"about_ca_topic_score_codex":0.000051831004,"about_ca_topic_score_gemma":0.00011957522,"teacher_disagreement_score":0.8211999,"about_ca_system_score_codex":0.00012313997,"about_ca_system_score_gemma":0.00006983514,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W2904255561","doi":"10.1049/iet-com.2018.5635","title":"Secrecy performance of a two‐way communication network with two half‐duplex DF relays","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Secrecy; Computer science; Duplex (building); Computer network; Telecommunications; Computer security; Chemistry","score_opus":0.020833190925555786,"score_gpt":0.2726434243523782,"score_spread":0.2518102334268224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904255561","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.7653004,0.007921156,0.03708987,0.0028904236,0.00017048304,0.0021155684,0.00006011691,0.003755833,0.18069613],"genre_scores_gemma":[0.8743568,0.0031423941,0.121738926,0.00008759449,0.000055093948,0.000326051,0.0001565703,0.000074101605,0.00006247979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830335,0.00029995225,0.00062726793,0.00018103035,0.00024582268,0.00034258602],"domain_scores_gemma":[0.9914131,0.00040351078,0.00023201102,0.0073813475,0.00047487952,0.000095116506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063200627,0.00025973254,0.00034467978,0.00015504516,0.00054550933,0.0000545545,0.0032837703,0.00011205556,0.00008539453],"category_scores_gemma":[0.00003097246,0.00027082703,0.00007316387,0.00090465246,0.0008714202,0.00043594258,0.0007682911,0.0006575419,0.00008106906],"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.0002387309,0.0012367497,0.045917835,0.0004486569,0.0010220838,0.000001402985,0.019313583,0.058818903,0.013980519,0.76459926,0.019878497,0.07454375],"study_design_scores_gemma":[0.0025931136,0.00062062574,0.013708982,0.0015899645,0.00021274113,0.00006800502,0.0005254359,0.78845483,0.020917758,0.009938419,0.15977278,0.0015973325],"about_ca_topic_score_codex":0.00026286926,"about_ca_topic_score_gemma":0.0017312171,"teacher_disagreement_score":0.75466084,"about_ca_system_score_codex":0.00011485492,"about_ca_system_score_gemma":0.00005467639,"threshold_uncertainty_score":0.99997437},"labels":[],"label_agreement":null},{"id":"W2911097812","doi":"10.1049/iet-com.2018.5580","title":"Optimum SWIPT relaying in bidirectional non‐regenerative relay networks","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Telecommunications; Computer network; Physics","score_opus":0.011457071562030225,"score_gpt":0.22641998441230549,"score_spread":0.21496291285027527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911097812","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.7302951,0.0091563985,0.05045265,0.0010262456,0.0027721238,0.0008431042,0.000016294256,0.0017133619,0.20372467],"genre_scores_gemma":[0.9782142,0.0011102621,0.019421026,0.00005596827,0.0000986246,0.00011646006,0.00007905915,0.000058507663,0.0008459102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990136,0.0001031382,0.00032362083,0.00017871115,0.00009749183,0.00028344948],"domain_scores_gemma":[0.9980523,0.00043331014,0.00005020642,0.0013490501,0.000054575532,0.00006056246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021119068,0.00016572459,0.00018950849,0.00012823244,0.00013973832,0.000045229877,0.0006778277,0.00016591424,0.00005352948],"category_scores_gemma":[0.000030144585,0.00019266165,0.000055977023,0.0005579335,0.00006480638,0.00020187224,0.00019396805,0.0007495912,0.00011127732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018319531,0.000026914075,0.0060147387,0.0000057722236,0.000025677109,6.572505e-7,0.00018182133,0.9880521,0.0006790738,0.0024672004,0.0016947575,0.00084944064],"study_design_scores_gemma":[0.00024575612,0.000011808971,0.008896888,0.00013216329,0.000006617956,0.000005810929,0.000055918925,0.982762,0.00013257064,0.00005537555,0.0074709016,0.00022419085],"about_ca_topic_score_codex":0.000054291133,"about_ca_topic_score_gemma":0.00027738567,"teacher_disagreement_score":0.24791904,"about_ca_system_score_codex":0.0001651325,"about_ca_system_score_gemma":0.000026868149,"threshold_uncertainty_score":0.7856514},"labels":[],"label_agreement":null},{"id":"W2912321194","doi":"10.1049/iet-com.2018.5705","title":"Complexity reduction of PTS technique to reduce PAPR of OFDM signal used in a wireless communication system","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"Orthogonal frequency-division multiplexing; Reduction (mathematics); Computer science; Wireless; SIGNAL (programming language); Telecommunications; Electronic engineering; Computer network; Mathematics; Channel (broadcasting); Engineering","score_opus":0.04725511285429897,"score_gpt":0.2938856096689246,"score_spread":0.24663049681462562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912321194","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.98260087,0.00028993786,0.0037668892,0.0004952155,0.00015791152,0.0014554241,0.000056673023,0.00031619007,0.010860885],"genre_scores_gemma":[0.9816098,0.00010070661,0.017847486,0.0000034418028,0.000011004878,0.00029774566,0.000058228925,0.000032851825,0.000038715916],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853003,0.00027994098,0.0006941136,0.00014415155,0.0001900021,0.00016177431],"domain_scores_gemma":[0.996671,0.0001419573,0.00018718869,0.0027556664,0.00018864687,0.000055514207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512811,0.00014184332,0.00035026038,0.00032519433,0.00006208835,0.0000106082325,0.0011724887,0.000121570185,0.000027215621],"category_scores_gemma":[0.000020064013,0.0001738052,0.00006992998,0.0008142866,0.00018990278,0.00020598534,0.00023549834,0.00033110662,0.000030797368],"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.000023994418,0.00019631202,0.0011318527,0.00035513376,0.000045853158,8.966843e-8,0.0019484485,0.010279591,0.95977956,0.024760162,0.00035224453,0.001126775],"study_design_scores_gemma":[0.0016154998,0.00020507738,0.020451965,0.0030051474,0.00007120168,0.00007524975,0.008290389,0.04704056,0.9134789,0.0020095333,0.002881535,0.000874916],"about_ca_topic_score_codex":0.00039196105,"about_ca_topic_score_gemma":0.000090552385,"teacher_disagreement_score":0.046300616,"about_ca_system_score_codex":0.00027800674,"about_ca_system_score_gemma":0.000048823476,"threshold_uncertainty_score":0.708757},"labels":[],"label_agreement":null},{"id":"W2915901518","doi":"10.1049/iet-com.2018.5203","title":"Evaluation of outage probability for uniformly distributed users based on signal‐to‐interference‐plus‐noise ratio","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Signal-to-interference-plus-noise ratio; Computer science; Interference (communication); Wireless network; Wireless; Signal-to-noise ratio (imaging); Probability density function; Stochastic geometry; Base station; Signal-to-interference ratio; Noise (video); Coverage probability; Stochastic geometry models of wireless networks; Telecommunications; Computer network; Statistics; Radio resource management; Mathematics; Power (physics); Artificial intelligence","score_opus":0.057609501881067796,"score_gpt":0.30616812235665647,"score_spread":0.2485586204755887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915901518","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.021618212,0.000058148067,0.9725752,0.00025466812,0.00011409011,0.0030818116,0.00039899244,0.00018244349,0.0017164365],"genre_scores_gemma":[0.9693656,0.000006446883,0.029209767,0.000020212146,0.000008006658,0.0006221473,0.0007158983,0.000027736232,0.000024219438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888927,0.00016142544,0.000399184,0.00015831112,0.00024334755,0.00014846679],"domain_scores_gemma":[0.9970898,0.00033003514,0.0001048438,0.0016969967,0.0007236006,0.00005469866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092557736,0.00013560864,0.00019883913,0.00010577666,0.00007377996,0.00002104776,0.00049739395,0.000070597125,0.000049275448],"category_scores_gemma":[0.00023627956,0.00014482558,0.000064837855,0.00031187333,0.00003437681,0.00017276402,0.00005069699,0.000110774075,0.00003226188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019762387,0.00005526173,0.00032588912,0.00006505185,0.000019914003,5.937886e-9,0.00028278233,0.9947222,0.0022790593,0.0012367251,0.00012312992,0.00087023666],"study_design_scores_gemma":[0.0007698761,0.000094986244,0.00048609127,0.00010437508,0.00005218167,1.0737931e-7,0.00014648234,0.9947239,0.00224059,0.000756209,0.0004834651,0.00014172964],"about_ca_topic_score_codex":0.000013044169,"about_ca_topic_score_gemma":0.00011891624,"teacher_disagreement_score":0.94774735,"about_ca_system_score_codex":0.0004998532,"about_ca_system_score_gemma":0.00012248525,"threshold_uncertainty_score":0.59058154},"labels":[],"label_agreement":null},{"id":"W2918509854","doi":"10.1049/iet-com.2018.5783","title":"Improved LAS detector for MIMO systems with imperfect channel state information","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Detector; Algorithm; Computer science; Decoding methods; Channel (broadcasting); MIMO; Metric (unit); Covariance matrix; Computation; Covariance; Computational complexity theory; Channel state information; Bit error rate; Mathematics; Telecommunications; Statistics; Wireless","score_opus":0.010180369768596056,"score_gpt":0.2333514680699225,"score_spread":0.22317109830132642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918509854","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.053680878,0.0022215876,0.92585146,0.00049409625,0.00032597463,0.0052324785,0.00039245503,0.003910598,0.007890477],"genre_scores_gemma":[0.9727202,0.0007351741,0.024776105,0.000038687434,0.0000099314575,0.001366304,0.00020672078,0.000047302707,0.00009955899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992357,0.00004489084,0.0003278899,0.00008774274,0.0000889303,0.0002148518],"domain_scores_gemma":[0.9969073,0.0002625848,0.000115390016,0.0024494473,0.00021136164,0.000053919255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016905164,0.0001637472,0.00019289851,0.0001319027,0.00014851011,0.00007956215,0.0009703858,0.00006977668,0.0000045085276],"category_scores_gemma":[0.000025818394,0.00015754199,0.000046974095,0.00022677424,0.00005317218,0.0007327576,0.0001412048,0.00022785125,0.00005018846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005377352,0.0006076145,0.0016859352,0.004495429,0.0015606667,5.557095e-7,0.018268885,0.58811533,0.17510793,0.042230744,0.010785449,0.15660374],"study_design_scores_gemma":[0.00087272335,0.00019442075,0.00024319945,0.0001453363,0.000022394845,0.000006457118,0.00046100447,0.90591186,0.012124106,0.0004072181,0.07914618,0.00046509985],"about_ca_topic_score_codex":0.000050217855,"about_ca_topic_score_gemma":0.00007225729,"teacher_disagreement_score":0.9190393,"about_ca_system_score_codex":0.00011938679,"about_ca_system_score_gemma":0.000028798628,"threshold_uncertainty_score":0.64243764},"labels":[],"label_agreement":null},{"id":"W2931875541","doi":"10.1049/iet-com.2018.5954","title":"Cross‐layer design of T‐ARQ and adaptive modulation and coding in a spectrum sharing with cooperative relaying system","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Link adaptation; Computer science; Automatic repeat request; Hybrid automatic repeat request; Coding (social sciences); Computer network; Telecommunications; Decoding methods; Mathematics; Fading; Telecommunications link; Statistics","score_opus":0.07459529037788769,"score_gpt":0.29432411544161596,"score_spread":0.21972882506372826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931875541","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.2780311,0.0017646732,0.7151485,0.0008552133,0.000041462932,0.00085947226,0.0000026028076,0.00010671266,0.00319027],"genre_scores_gemma":[0.9530851,0.000823371,0.04594663,0.000030502662,0.0000043414384,0.000040614468,0.0000026850726,0.000009571111,0.000057170764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988791,0.00029322537,0.00029388635,0.00027395977,0.00011150142,0.00014834163],"domain_scores_gemma":[0.9978028,0.00045805494,0.00015226546,0.0013966304,0.0001455147,0.000044737593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058556965,0.00012360374,0.00021013296,0.0001496856,0.00028450138,0.00015420148,0.00086891826,0.00004606295,0.000003533414],"category_scores_gemma":[0.000026234738,0.00011522159,0.000014121028,0.0005250282,0.0001317936,0.00061918516,0.0009650119,0.00024155068,0.0000035689889],"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.00006482251,0.00013639849,0.09122891,0.00006425217,0.00007161745,0.0000018493857,0.013839647,0.04035953,0.0062026074,0.8412855,0.0000071674062,0.0067376504],"study_design_scores_gemma":[0.000546908,0.000101054655,0.042248145,0.00036181562,0.000004810282,0.000013404039,0.0004146015,0.9556302,0.0002840033,0.0002158289,0.000034561443,0.00014466772],"about_ca_topic_score_codex":0.000051142983,"about_ca_topic_score_gemma":0.00013375716,"teacher_disagreement_score":0.9152707,"about_ca_system_score_codex":0.000082663835,"about_ca_system_score_gemma":0.00004950691,"threshold_uncertainty_score":0.46986002},"labels":[],"label_agreement":null},{"id":"W2939790404","doi":"10.1049/iet-com.2018.5344","title":"Secrecy analysis of wireless sensor network in smart grid with destination assisted jamming","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Jamming; Computer science; Secrecy; Wireless sensor network; Computer network; Wireless; Telecommunications; Smart grid; Wireless network; Computer security; Electrical engineering; Engineering","score_opus":0.012368701669981668,"score_gpt":0.2284122566462564,"score_spread":0.21604355497627473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939790404","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.99369633,0.00024191661,0.0022882037,0.00010713225,0.00008509373,0.00014617015,0.00000939356,0.00007393608,0.0033518183],"genre_scores_gemma":[0.99553734,0.00015401935,0.0041328315,0.0000128363035,0.000014597574,0.00001788517,0.00008951523,0.000010541098,0.00003041113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.999361,0.00007753157,0.00022158478,0.00009199031,0.00010938428,0.0001385051],"domain_scores_gemma":[0.99869895,0.00028670885,0.00005424065,0.00086576695,0.00006570133,0.000028645763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018939696,0.000079555655,0.00019956482,0.00019530892,0.000059380855,0.000013747941,0.00036266833,0.000053460888,0.000019191884],"category_scores_gemma":[0.000015509358,0.0000770002,0.000046186666,0.0016448407,0.00005899404,0.00009588962,0.000057560173,0.00018637975,0.000009362753],"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.0000093607,0.000076041215,0.46796125,0.000043417138,0.00026466866,8.5391497e-7,0.0012659269,0.52547085,0.0011289828,0.0017584964,0.000053813004,0.00196637],"study_design_scores_gemma":[0.00017321987,0.00001827789,0.5609957,0.00008761719,0.000116519586,0.0000019039812,0.00027940003,0.43734837,0.00013544345,0.000028725213,0.0006997798,0.00011505687],"about_ca_topic_score_codex":0.00013479375,"about_ca_topic_score_gemma":0.0029535964,"teacher_disagreement_score":0.09303446,"about_ca_system_score_codex":0.000042500065,"about_ca_system_score_gemma":0.000017782239,"threshold_uncertainty_score":0.31399772},"labels":[],"label_agreement":null},{"id":"W2940213010","doi":"10.1049/iet-com.2018.5736","title":"Towards insider threats detection in smart grid communication systems","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Science and Technology Department of Zhejiang Province; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer security; Smart grid; Damages; Insider; Insider threat; Computer science; Grid; Risk analysis (engineering); Petri net; Communications system; Internet privacy; Business; Telecommunications; Engineering; Distributed computing","score_opus":0.01996605115449409,"score_gpt":0.24888745000169624,"score_spread":0.22892139884720214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940213010","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.9038668,0.016598608,0.0009983828,0.000929479,0.0016363455,0.00097138394,0.000023348613,0.0006730234,0.0743026],"genre_scores_gemma":[0.9953727,0.003780033,0.00051907677,0.00003376999,0.000028788767,0.00010721507,0.000044060595,0.000020453755,0.000093877956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916965,0.00013972085,0.0002775454,0.000114414535,0.00012500159,0.00017365655],"domain_scores_gemma":[0.99765027,0.0001488989,0.000037375605,0.0020659699,0.000054305732,0.000043157157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002599385,0.00011360561,0.00015582291,0.00013948216,0.0001255766,0.00005506942,0.00079315895,0.00011265631,0.000020599993],"category_scores_gemma":[0.0000226957,0.00012021984,0.000040929248,0.00039822725,0.00007257166,0.00026134576,0.0001795526,0.00040299192,0.00026561166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010015899,0.0016676625,0.13318568,0.001243408,0.00052529667,0.000009676275,0.0388753,0.54447305,0.053314768,0.10616308,0.009007425,0.11143451],"study_design_scores_gemma":[0.0012366766,0.00007932055,0.15713863,0.00050467846,0.000034683093,0.000051099694,0.0026129007,0.70424247,0.0037771515,0.0022837983,0.1271727,0.00086587114],"about_ca_topic_score_codex":0.0005105937,"about_ca_topic_score_gemma":0.0021470534,"teacher_disagreement_score":0.15976946,"about_ca_system_score_codex":0.00012413057,"about_ca_system_score_gemma":0.000022429364,"threshold_uncertainty_score":0.49024227},"labels":[],"label_agreement":null},{"id":"W2940916153","doi":"10.1049/iet-com.2018.6075","title":"NOMA‐based cooperative relaying for secondary transmission in cognitive radio networks","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Cognitive radio; Noma; Computer science; Transmission (telecommunications); Computer network; Telecommunications; Wireless; Telecommunications link","score_opus":0.025427846474070013,"score_gpt":0.28150111601344846,"score_spread":0.2560732695393784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940916153","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.037377946,0.010768406,0.93439806,0.0014702503,0.00011430299,0.0018481363,0.00006919435,0.0012632392,0.012690486],"genre_scores_gemma":[0.9589944,0.0015539698,0.03847478,0.000074409996,0.0000055440164,0.0005422188,0.00023852816,0.00004427499,0.00007187264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918914,0.00007453053,0.0003118725,0.000153937,0.00005222322,0.00021826889],"domain_scores_gemma":[0.99724257,0.0011718794,0.00005227611,0.001401774,0.000096577984,0.00003489668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016015212,0.00015660113,0.0002185657,0.0001571536,0.0001614666,0.000024702837,0.00093359756,0.00015076928,0.00005329064],"category_scores_gemma":[0.00005938271,0.00017450683,0.000060147784,0.000395669,0.00012249213,0.00023258774,0.00011382354,0.00061324274,0.00001758367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004903847,0.00014876961,0.0011416702,0.000076526514,0.000067046625,4.427168e-7,0.001003741,0.85414803,0.0037940466,0.0058748997,0.00061796134,0.13307784],"study_design_scores_gemma":[0.0014696976,0.000051305757,0.0010761439,0.0002597876,0.000011030738,0.0000012817887,0.000917364,0.9744402,0.0028002455,0.00048994494,0.018188398,0.00029457707],"about_ca_topic_score_codex":0.000005945962,"about_ca_topic_score_gemma":0.00004530542,"teacher_disagreement_score":0.92161644,"about_ca_system_score_codex":0.00011186179,"about_ca_system_score_gemma":0.000043629785,"threshold_uncertainty_score":0.71161824},"labels":[],"label_agreement":null},{"id":"W2945683434","doi":"10.1049/iet-com.2018.6053","title":"Construction of tandem duplication correcting codes","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Tandem exon duplication; Tandem; Gene duplication; Computer network","score_opus":0.01971857925417302,"score_gpt":0.279202590832194,"score_spread":0.259484011578021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945683434","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.9839456,0.00033592308,0.0023402392,0.000236341,0.00008477686,0.00012423817,0.0000051541974,0.000016718413,0.012910975],"genre_scores_gemma":[0.9916414,0.00014026556,0.007858679,0.00006302378,0.000027657328,0.0000064978813,0.00012689442,0.000004356606,0.00013120573],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954766,0.000064420696,0.00015746958,0.00011551078,0.00004060436,0.00007431288],"domain_scores_gemma":[0.99905264,0.000047857477,0.000115173694,0.00067117997,0.00009489871,0.000018273873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014484985,0.000052127405,0.00007923211,0.000016704364,0.00007463757,0.0000073988945,0.0003049381,0.00007080446,0.0000146569255],"category_scores_gemma":[0.00007346902,0.000047469333,0.000043453678,0.000083227205,0.00009444864,0.0000022345675,0.00019263849,0.00006682736,0.000013944493],"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.000011053376,0.00006381607,0.12881717,0.000008505589,0.000026741465,1.9988079e-8,0.000041310177,0.00004769368,0.84391975,0.004068692,0.00016524644,0.02282997],"study_design_scores_gemma":[0.0013989273,0.0009556781,0.14875452,0.00014328955,0.00007065012,0.00008532945,0.0016646148,0.006432627,0.7252789,0.003960376,0.11047505,0.00078003836],"about_ca_topic_score_codex":0.000013246321,"about_ca_topic_score_gemma":0.000011062818,"teacher_disagreement_score":0.11864088,"about_ca_system_score_codex":0.0000057986063,"about_ca_system_score_gemma":0.00001983612,"threshold_uncertainty_score":0.19357432},"labels":[],"label_agreement":null},{"id":"W2947194432","doi":"10.1049/iet-com.2018.6133","title":"Mode selection map‐based vertical handover in D2D enabled 5G networks","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Handover; Computer science; Computer network; Transmission (telecommunications); User equipment; Throughput; Mode (computer interface); Cellular network; Fading; Node (physics); Base station; Selection (genetic algorithm); Real-time computing; Telecommunications; Wireless; Channel (broadcasting); Engineering","score_opus":0.01042025685094276,"score_gpt":0.2442655736750805,"score_spread":0.23384531682413776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947194432","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.016980521,0.0006673035,0.9699817,0.00030310065,0.00031393286,0.00065610046,0.0000055822993,0.0005073922,0.01058437],"genre_scores_gemma":[0.98887885,0.00008133784,0.010599804,0.000040988834,0.000022971462,0.00009880793,0.00008299566,0.00003496787,0.00015928762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932736,0.00007053099,0.0002401559,0.00011195841,0.000057559864,0.00019243771],"domain_scores_gemma":[0.99889904,0.00014347123,0.000019829922,0.0008481638,0.000050007224,0.000039491035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095796044,0.00010399185,0.00014079333,0.00009418032,0.00005813413,0.000025133813,0.00029645028,0.000102863676,0.000049250204],"category_scores_gemma":[0.00001633422,0.00012074746,0.000032391967,0.00033607255,0.000021389398,0.00019823457,0.000037151596,0.00026561308,0.00011538443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067893443,0.00003176861,0.0021819319,0.000016103371,0.000008636596,8.6387416e-8,0.00007109024,0.99439347,0.0018947411,0.00082736876,0.00034909116,0.00021890436],"study_design_scores_gemma":[0.00054349523,0.000010228866,0.00045437829,0.000049797283,0.000006560968,8.965506e-7,0.000020711459,0.9952832,0.00049005036,0.00010794148,0.0029060573,0.00012670373],"about_ca_topic_score_codex":0.00005481086,"about_ca_topic_score_gemma":0.0003837066,"teacher_disagreement_score":0.9718983,"about_ca_system_score_codex":0.00018701113,"about_ca_system_score_gemma":0.000019810333,"threshold_uncertainty_score":0.49239388},"labels":[],"label_agreement":null},{"id":"W2950128285","doi":"10.1049/iet-com.2018.6023","title":"MMSE‐based iterative processing with imperfect channel and parity check in MIMO systems","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Imperfect; MIMO; Computer science; Parity (physics); Algorithm; Channel (broadcasting); Mathematics; Telecommunications","score_opus":0.017492781009131046,"score_gpt":0.263899680294135,"score_spread":0.24640689928500398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950128285","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.7605747,0.03231724,0.1592052,0.0030295318,0.00014284257,0.0047913087,0.00009519357,0.003881302,0.035962712],"genre_scores_gemma":[0.9848967,0.00059672137,0.013997375,0.00003417556,0.0000051706343,0.0003624257,0.0000423448,0.000036006535,0.000029041805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926955,0.00010644922,0.00023272632,0.00013902223,0.000086801345,0.00016542865],"domain_scores_gemma":[0.99810076,0.0001713436,0.000064525055,0.0015379835,0.000082692364,0.0000427072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017442861,0.00015064754,0.00020996171,0.0001271633,0.00011258772,0.00006944065,0.0005742741,0.00007376817,0.000003040696],"category_scores_gemma":[0.000013998608,0.00014529227,0.000017025746,0.00033059935,0.00011271446,0.00030817636,0.00013260449,0.00037391525,0.000007925213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002680714,0.0020676965,0.14571774,0.0056680515,0.00044608835,0.000012015311,0.03911809,0.60984683,0.07340883,0.054215025,0.0012411257,0.06799044],"study_design_scores_gemma":[0.000615452,0.00006410753,0.0056034042,0.00068212836,0.00001063601,0.0000074154405,0.0007097787,0.9858921,0.0027399762,0.00027417467,0.0030259865,0.00037483082],"about_ca_topic_score_codex":0.00006564683,"about_ca_topic_score_gemma":0.00017148271,"teacher_disagreement_score":0.3760453,"about_ca_system_score_codex":0.000094134724,"about_ca_system_score_gemma":0.000032146225,"threshold_uncertainty_score":0.5924847},"labels":[],"label_agreement":null},{"id":"W2953177019","doi":"10.1049/iet-com.2019.0198","title":"Physical layer secrecy performance of multiple antennas transmission with partial legitimate user CSI","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Secrecy; Physical layer; Computer science; Transmission (telecommunications); Computer network; Secure transmission; Layer (electronics); Telecommunications; Computer security; Wireless; Materials science","score_opus":0.018963444710705844,"score_gpt":0.255696522959321,"score_spread":0.23673307824861514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953177019","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.9860465,0.00026483976,0.005995487,0.00030233955,0.000021418631,0.00040149828,0.000020622778,0.00054641906,0.0064008553],"genre_scores_gemma":[0.9817104,0.0008691114,0.017121043,0.000021546437,0.000010914507,0.000099747645,0.00006179983,0.000043340828,0.000062128405],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992232,0.00007179003,0.00025092767,0.00011427994,0.00016287419,0.00017694049],"domain_scores_gemma":[0.99728096,0.00017382005,0.00006332631,0.0023148598,0.00011138636,0.000055658504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111267684,0.00014874426,0.00023099354,0.00007422392,0.00009356825,0.000021760798,0.0010445949,0.00006675884,0.000037044414],"category_scores_gemma":[0.000006025223,0.0001365866,0.00006177595,0.00024340922,0.00012892082,0.0003189191,0.0001513297,0.00033169545,0.00005242019],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032014135,0.0022153445,0.0977631,0.00113962,0.00048375982,0.0000015072663,0.019687718,0.029584104,0.76984715,0.031405438,0.0017473954,0.04580471],"study_design_scores_gemma":[0.0006967356,0.00013905292,0.006137478,0.00032755447,0.00003081615,0.00000594718,0.0001524327,0.7865652,0.15102668,0.0001018387,0.05445963,0.0003566676],"about_ca_topic_score_codex":0.000031886895,"about_ca_topic_score_gemma":0.000023432647,"teacher_disagreement_score":0.7569811,"about_ca_system_score_codex":0.000030485113,"about_ca_system_score_gemma":0.000022953946,"threshold_uncertainty_score":0.556984},"labels":[],"label_agreement":null},{"id":"W2954741611","doi":"10.1049/iet-com.2018.6230","title":"Analytical model for optimal data transmission policy in two‐way relay network coding under phase type arrivals","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Computer science; Linear network coding; Coding (social sciences); Transmission (telecommunications); Computer network; Telecommunications; Statistics; Mathematics","score_opus":0.20633749223982026,"score_gpt":0.44492628306462834,"score_spread":0.23858879082480808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954741611","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.0033395912,0.0012604117,0.9756119,0.015689492,0.0000730383,0.00059145666,0.000018196555,0.00012557095,0.0032903184],"genre_scores_gemma":[0.7635659,0.0022563958,0.23263712,0.00076218904,0.000049553357,0.000032970172,0.00018969465,0.000017956248,0.00048822805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982353,0.000327022,0.0004678044,0.0004257438,0.00016741182,0.0003767379],"domain_scores_gemma":[0.9926815,0.0007648186,0.000112394395,0.006154079,0.00015769278,0.00012949033],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010937208,0.00017063135,0.0002673633,0.00016670965,0.00040496278,0.00016513557,0.0060528484,0.00006765009,0.000024677938],"category_scores_gemma":[0.00009266322,0.00017132657,0.00006618226,0.001187976,0.00008923755,0.0006566742,0.0021462308,0.0004018746,0.0000393577],"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.000036496913,0.0003326064,0.0002059908,0.000009349837,0.00003405224,2.8081303e-7,0.0009949998,0.27725232,0.0005706569,0.6792447,0.003459481,0.03785905],"study_design_scores_gemma":[0.0012341426,0.000043115295,0.000100562116,0.00008141587,0.000011168932,0.000002424087,0.00002437008,0.9701188,0.000014970223,0.00237327,0.025796704,0.00019905037],"about_ca_topic_score_codex":0.000020326303,"about_ca_topic_score_gemma":0.000123039,"teacher_disagreement_score":0.7602263,"about_ca_system_score_codex":0.0001097317,"about_ca_system_score_gemma":0.00029615915,"threshold_uncertainty_score":0.99932486},"labels":[],"label_agreement":null},{"id":"W2960091369","doi":"10.1049/cmu2.12356","title":"Spectrum sensing and resource allocation for 5G heterogeneous cloud radio access networks","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cloud computing; Computer network; Resource allocation; Remote radio head; Radio resource management; Cognitive radio; Heterogeneous network; Telecommunications; Wireless; Wireless network","score_opus":0.032412044540101596,"score_gpt":0.2792770804668029,"score_spread":0.24686503592670128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960091369","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.00932479,0.0031561144,0.96579945,0.01864534,0.00035122203,0.00060238526,0.000008864443,0.00025189389,0.0018599543],"genre_scores_gemma":[0.9871556,0.0002890186,0.011422494,0.0007863613,0.00017505193,0.000033584303,0.000052951003,0.000021798553,0.00006311462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863786,0.0003179411,0.00025191015,0.00034509355,0.00013597177,0.00031119966],"domain_scores_gemma":[0.9975177,0.000615799,0.00014114637,0.0015861728,0.000055059707,0.00008414676],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004822817,0.00013712319,0.00016801695,0.000102085796,0.0017896559,0.0003724675,0.0014419644,0.00003622726,0.0000045388792],"category_scores_gemma":[0.000029825378,0.00016360029,0.00007496733,0.00048064647,0.00009864129,0.00021072116,0.0010654664,0.00031303405,8.400102e-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.00010349108,0.0003866556,0.0006989614,0.000033078904,0.0002862961,0.000022147851,0.004596611,0.30900487,0.0005400872,0.14919078,0.013413726,0.5217233],"study_design_scores_gemma":[0.0002842268,0.00006637433,0.00032115247,0.000012644167,0.000016913133,0.00018897434,0.00006016997,0.93862873,0.000097344244,0.004658571,0.055466138,0.00019878334],"about_ca_topic_score_codex":0.000076577584,"about_ca_topic_score_gemma":0.0002553149,"teacher_disagreement_score":0.9778308,"about_ca_system_score_codex":0.00012133573,"about_ca_system_score_gemma":0.000045901492,"threshold_uncertainty_score":0.9995099},"labels":[],"label_agreement":null},{"id":"W2962734879","doi":"10.1049/iet-com.2014.0278","title":"Differential dual‐hop relaying under user mobility","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Hop (telecommunications); Computer network; Dual (grammatical number); Differential (mechanical device); Telecommunications; Physics","score_opus":0.064921736127841,"score_gpt":0.3127007859638327,"score_spread":0.24777904983599172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962734879","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.022436813,0.00043108972,0.9358408,0.0170564,0.000256592,0.0002491108,0.000002315809,0.00047021575,0.02325667],"genre_scores_gemma":[0.964223,0.0007471103,0.033468865,0.0009047559,0.000040491614,0.00006543172,0.000019642472,0.000011896629,0.00051879283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998229,0.0007494308,0.00032680345,0.00028002373,0.00018120786,0.00023348916],"domain_scores_gemma":[0.9929746,0.0006634843,0.00010940004,0.0059555015,0.00019262178,0.0001044145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038217395,0.00014619864,0.00016993583,0.00008085684,0.00088692625,0.00023464729,0.0033691386,0.00006708804,0.00009001248],"category_scores_gemma":[0.0001304834,0.00014384341,0.00008841162,0.00047482652,0.00017242938,0.0004099835,0.002684036,0.0003953499,0.00015406626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018930903,0.0002587183,0.0005812879,0.0000039454117,0.000026082571,8.9222084e-8,0.00090654264,0.00017204518,0.0027101384,0.96009386,0.0022026647,0.033042736],"study_design_scores_gemma":[0.0011878785,0.00010125925,0.053218078,0.000102515274,0.000036955455,0.000013878132,0.00019918561,0.509256,0.0011494724,0.023347318,0.4104825,0.0009049951],"about_ca_topic_score_codex":0.000014898797,"about_ca_topic_score_gemma":0.00015225977,"teacher_disagreement_score":0.9417862,"about_ca_system_score_codex":0.00006318513,"about_ca_system_score_gemma":0.000047628364,"threshold_uncertainty_score":0.6821609},"labels":[],"label_agreement":null},{"id":"W2964159840","doi":"10.1049/iet-com.2018.5273","title":"Overlapped LT codes over the binary erasure channel: analysis and design","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Binary erasure channel; Computer science; Erasure code; Binary number; Channel (broadcasting); Computer network; Algorithm; Decoding methods; Mathematics; Arithmetic; Channel capacity; Programming language","score_opus":0.035287467490104765,"score_gpt":0.2945892423021458,"score_spread":0.25930177481204103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964159840","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.08057089,0.0018276422,0.9025355,0.009112607,0.00016217816,0.0008051929,0.000008587757,0.0010529115,0.003924476],"genre_scores_gemma":[0.9282063,0.000293896,0.07081244,0.00039601413,0.000007709092,0.00005668897,0.000005563799,0.0000094172365,0.00021192525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880755,0.00041933477,0.00017981761,0.00024470064,0.00017897256,0.00016960198],"domain_scores_gemma":[0.9949376,0.0009142927,0.00011793599,0.0038880706,0.000099963545,0.000042119893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074738375,0.00011883964,0.00017450648,0.00017994431,0.00035127546,0.0001656857,0.0027175855,0.000060771305,0.000012430471],"category_scores_gemma":[0.0000642248,0.00009261611,0.00008582686,0.0012746406,0.00010903788,0.00029271268,0.0011812038,0.00025818433,0.000029379536],"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.00009491082,0.0021086861,0.2667587,0.00013614903,0.0052353265,0.000015920665,0.07683052,0.011496281,0.06294679,0.43355694,0.07327592,0.06754384],"study_design_scores_gemma":[0.00022136544,0.00013565397,0.146514,0.000042577318,0.00020028105,0.000012520001,0.00014997486,0.8353548,0.0010634162,0.009263768,0.006650349,0.00039127053],"about_ca_topic_score_codex":0.00021803139,"about_ca_topic_score_gemma":0.00022633433,"teacher_disagreement_score":0.84763545,"about_ca_system_score_codex":0.00003088332,"about_ca_system_score_gemma":0.000041275474,"threshold_uncertainty_score":0.5049995},"labels":[],"label_agreement":null},{"id":"W2969713425","doi":"10.1049/iet-com.2019.0194","title":"Blockchain in internet‐of‐things: a necessity framework for security, reliability, transparency, immutability and liability","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Blockchain; Immutability; Transparency (behavior); Cryptocurrency; Computer science; Computer security; Reliability (semiconductor); The Internet; Internet privacy; World Wide Web","score_opus":0.014313579554742092,"score_gpt":0.280014954844481,"score_spread":0.2657013752897389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969713425","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.67239046,0.0006404149,0.31188256,0.012959053,0.0000706935,0.0013036171,0.00001746937,0.0001878279,0.0005478841],"genre_scores_gemma":[0.8175381,0.000090761765,0.181979,0.00010437965,0.0000032026292,0.0002603265,0.0000065899712,0.0000070046262,0.000010634189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815136,0.0002481133,0.00063311466,0.000570546,0.00013765831,0.00025921396],"domain_scores_gemma":[0.9934317,0.0015304748,0.00020150283,0.0045818705,0.00018972582,0.00006473516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723479,0.00016917988,0.000374343,0.00013338686,0.0001256141,0.000040460247,0.0030988823,0.00030043087,0.0000104593],"category_scores_gemma":[0.0003850605,0.00017689388,0.00010512392,0.0006718405,0.0004306871,0.0001997038,0.0012676676,0.0006299486,0.0000041673475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015583624,0.0008727138,0.10194303,0.00017881948,0.000015213067,9.536412e-8,0.00909819,0.0000134924085,0.00014899256,0.8779217,0.000021802953,0.009770385],"study_design_scores_gemma":[0.00036862187,0.00009661045,0.018005278,0.00007790045,0.00000894295,0.0000027187857,0.00016447526,0.15632507,0.0007249116,0.8227718,0.0012547468,0.00019895828],"about_ca_topic_score_codex":0.00067386834,"about_ca_topic_score_gemma":0.000358917,"teacher_disagreement_score":0.15631157,"about_ca_system_score_codex":0.0000870539,"about_ca_system_score_gemma":0.00008804189,"threshold_uncertainty_score":0.7213523},"labels":[],"label_agreement":null},{"id":"W2971262151","doi":"10.1049/iet-com.2019.0187","title":"Energy‐efficient BBU pool virtualisation for C‐RAN with quality of service guarantees","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Telecommunication Regulatory Authority","keywords":"C-RAN; Virtualization; Computer science; Quality of service; Ran; Service (business); Computer network; Energy (signal processing); Business; Radio access network; Operating system; Mathematics; Cloud computing; Marketing; Base station","score_opus":0.0429144062498023,"score_gpt":0.2906401434294957,"score_spread":0.24772573717969337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971262151","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.09082156,0.0003970775,0.9008563,0.0059033195,0.00012074884,0.00038077278,0.00003115802,0.00016592912,0.0013231104],"genre_scores_gemma":[0.9536888,0.00003427944,0.04521978,0.0008208028,0.000014187169,0.000077411976,0.000050596736,0.000009953938,0.00008421867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899185,0.00014366224,0.00031063912,0.00020333446,0.00019624432,0.00015426718],"domain_scores_gemma":[0.99589944,0.00092926447,0.0002163271,0.0025822772,0.00033520872,0.000037462654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040572474,0.00010158535,0.00018246638,0.00006106614,0.00015417037,0.000048749564,0.001711136,0.000050300452,0.000008200348],"category_scores_gemma":[0.00003201209,0.00008747391,0.000060547067,0.0004988731,0.000052811796,0.00016079706,0.00030369483,0.00007720542,0.00001246954],"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.000055056487,0.0004314302,0.0021482224,0.00006393955,0.000066358996,7.318615e-8,0.0033942575,0.01919687,0.0013812791,0.959032,0.0006324211,0.01359811],"study_design_scores_gemma":[0.0017405916,0.0002999772,0.014865362,0.00015501546,0.000031331158,0.000004312093,0.00053302245,0.9548015,0.0013578092,0.007367703,0.018392658,0.00045071522],"about_ca_topic_score_codex":0.00053206156,"about_ca_topic_score_gemma":0.00053828594,"teacher_disagreement_score":0.95166427,"about_ca_system_score_codex":0.00002408735,"about_ca_system_score_gemma":0.00007426004,"threshold_uncertainty_score":0.35670826},"labels":[],"label_agreement":null},{"id":"W2979366326","doi":"10.1049/iet-com.2019.0574","title":"Scheduling algorithm based on preemptive priority and hybrid data structure for cognitive radio technology with vehicular <i>ad hoc</i> network","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Cognitive radio; Wireless ad hoc network; Vehicular ad hoc network; Scheduling (production processes); Distributed computing; Telecommunications; Wireless; Mathematical optimization","score_opus":0.012281344662419117,"score_gpt":0.23899330162792154,"score_spread":0.22671195696550242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979366326","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.3593318,0.024662616,0.6013306,0.002363418,0.000456131,0.006114026,0.0032833575,0.0015999936,0.00085810135],"genre_scores_gemma":[0.74332017,0.0003527594,0.2545869,0.00011981546,0.000058901926,0.000098012824,0.0013862161,0.00006599495,0.000011224301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877113,0.00007875036,0.00021404817,0.00039258334,0.0001515144,0.00039195587],"domain_scores_gemma":[0.99636,0.0004981657,0.00007913383,0.002838696,0.00013896021,0.00008506149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024125249,0.0002587206,0.00031320643,0.000094245006,0.0002478273,0.00005986474,0.0010951424,0.00016216307,0.000008276535],"category_scores_gemma":[0.000050166684,0.00025348525,0.000035359666,0.00035196717,0.00019683293,0.00018919505,0.0003708541,0.0007003406,0.000008985363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006542937,0.00006843086,0.0014409254,0.000074182346,0.00033949187,0.0000049525684,0.000114159455,0.9600737,0.00017623925,0.0005781342,0.00062837754,0.03643598],"study_design_scores_gemma":[0.0012045087,0.00015835339,0.00044898049,0.0002695562,0.00012150636,0.000024011722,0.00008728579,0.9834763,0.00019031212,0.0005221726,0.013185136,0.00031188817],"about_ca_topic_score_codex":0.0000034718234,"about_ca_topic_score_gemma":0.00007967406,"teacher_disagreement_score":0.3839884,"about_ca_system_score_codex":0.00006695939,"about_ca_system_score_gemma":0.00006837423,"threshold_uncertainty_score":0.9999917},"labels":[],"label_agreement":null},{"id":"W2979425925","doi":"10.1049/iet-com.2019.0657","title":"T_CAFE: A Trust based Security approach for Opportunistic IoT","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Identifier; Network packet; Internet of Things; Routing protocol; Computer security; Unique identifier; The Internet; Latency (audio); Telecommunications; World Wide Web","score_opus":0.04525479578256403,"score_gpt":0.27883538552086534,"score_spread":0.23358058973830131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979425925","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.0002983526,0.00013817436,0.9349541,0.002312907,0.00018903239,0.00067864807,0.00006752839,0.0002153959,0.061145827],"genre_scores_gemma":[0.7794681,0.000027207429,0.21813904,0.0010245827,0.00003705108,0.00016876389,0.00025861576,0.000015321772,0.0008612931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986392,0.00012916596,0.00033967683,0.00036120173,0.00020446607,0.000326265],"domain_scores_gemma":[0.9948536,0.0005519172,0.00015402598,0.0040823044,0.00017795086,0.0001801963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005323196,0.00016961795,0.00024744304,0.00008375292,0.00033478093,0.00015608763,0.0030160053,0.00011491434,0.000049551152],"category_scores_gemma":[0.000018206063,0.00017058264,0.00013856836,0.00032947262,0.00012558246,0.00014672628,0.00052274496,0.00026180418,0.000062231324],"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.000032746706,0.0009999083,0.0012055222,0.000117164614,0.000070820446,0.0000030570097,0.00077883614,0.00034620482,0.000074194,0.9197515,0.025411408,0.051208623],"study_design_scores_gemma":[0.0005013807,0.000062610525,0.00007268671,0.0000154486,0.00001866606,0.0000070280303,0.00005268032,0.9347479,0.000004475599,0.005009979,0.059299313,0.00020784079],"about_ca_topic_score_codex":0.000018728553,"about_ca_topic_score_gemma":0.000004393509,"teacher_disagreement_score":0.9344017,"about_ca_system_score_codex":0.000045090783,"about_ca_system_score_gemma":0.00030257637,"threshold_uncertainty_score":0.6956158},"labels":[],"label_agreement":null},{"id":"W2979583438","doi":"10.1049/iet-com.2018.5411","title":"Wireless information and power transfer with optimal transmit antenna selection","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Transmitter power output; Maximum power transfer theorem; Wireless; Antenna (radio); Splitter; Energy harvesting; Energy (signal processing); Telecommunications; Computer network; Power (physics); Electronic engineering; Mathematics; Transmitter; Physics; Engineering; Channel (broadcasting); Statistics","score_opus":0.0054986208880183135,"score_gpt":0.18678642809930843,"score_spread":0.18128780721129012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979583438","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.8546122,0.0002977387,0.1354833,0.00024823382,0.0000716038,0.00022655539,0.000008823627,0.00050136156,0.008550181],"genre_scores_gemma":[0.9934407,0.00042418225,0.005921782,0.00004994976,0.000008485395,0.00003860832,0.00004327498,0.000024125242,0.00004888779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999481,0.000029055727,0.00017752349,0.000071401955,0.000089870045,0.00015110924],"domain_scores_gemma":[0.9993099,0.000077128105,0.000014903487,0.00049020076,0.00006188526,0.000045995188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008399224,0.000114473136,0.00011186516,0.00006983341,0.000098155964,0.00006113638,0.00024827078,0.00007834529,0.000025923475],"category_scores_gemma":[0.000002352586,0.00011139998,0.00002031077,0.00023214672,0.00006192841,0.00057629036,0.000019366882,0.00026754697,0.000026488173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012435003,0.0001878026,0.02813282,0.00031577336,0.0004804553,0.0000011760042,0.011784351,0.844924,0.018955,0.042004284,0.00083207974,0.052257918],"study_design_scores_gemma":[0.0007959229,0.00010991094,0.014582855,0.00016561714,0.0000342215,0.00003820294,0.0002892304,0.9659837,0.00079760276,0.000023919209,0.016804101,0.0003747341],"about_ca_topic_score_codex":0.00002362547,"about_ca_topic_score_gemma":0.00009743118,"teacher_disagreement_score":0.1388285,"about_ca_system_score_codex":0.000029498256,"about_ca_system_score_gemma":0.000014906445,"threshold_uncertainty_score":0.45427594},"labels":[],"label_agreement":null},{"id":"W2982220845","doi":"10.1049/iet-com.2018.6090","title":"Gram–Schmidt orthogonalisation aided hybrid precoding in millimetre‐wave massive MIMO systems","year":2019,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Matching pursuit; Orthogonality; MIMO; Algorithm; Computer science; Spectral efficiency; Mathematics; Matrix (chemical analysis); Control theory (sociology); Telecommunications; Artificial intelligence; Beamforming; Compressed sensing","score_opus":0.026481842199326953,"score_gpt":0.24373542447292684,"score_spread":0.2172535822735999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982220845","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.48337358,0.013043429,0.40450513,0.00094798574,0.003303839,0.0063892095,0.000281547,0.0023964338,0.085758835],"genre_scores_gemma":[0.9874171,0.0005039928,0.011004281,0.000016531656,0.000036483,0.00021864165,0.00035478757,0.00005783854,0.00039035585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987252,0.00015735922,0.0005292517,0.00019910914,0.00013667624,0.00025242116],"domain_scores_gemma":[0.9978731,0.00030646284,0.00012898937,0.0015169072,0.000114190036,0.000060341787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002474674,0.00018523166,0.0002631382,0.0002662392,0.000094836876,0.00006376343,0.00044989274,0.000085703985,0.00003908217],"category_scores_gemma":[0.000073500334,0.00021670047,0.000056757246,0.0004658182,0.000035141475,0.00044344764,0.00011171903,0.00028779352,0.00021297888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005759081,0.000046491365,0.005508988,0.00014573046,0.00005339466,0.0000018242768,0.000782574,0.9818619,0.004271871,0.00567141,0.00042347185,0.0012265986],"study_design_scores_gemma":[0.00063662307,0.000020823978,0.0017426731,0.00031947708,0.00002006089,0.000012775561,0.0007537747,0.98892784,0.0009774728,0.0003333134,0.0058724685,0.0003826774],"about_ca_topic_score_codex":0.00010236164,"about_ca_topic_score_gemma":0.000120425815,"teacher_disagreement_score":0.5040435,"about_ca_system_score_codex":0.00029061624,"about_ca_system_score_gemma":0.00002568945,"threshold_uncertainty_score":0.8836789},"labels":[],"label_agreement":null},{"id":"W3011697281","doi":"10.1049/iet-com.2018.6122","title":"Task offloading, load balancing, and resource allocation in MEC networks","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Load balancing (electrical power); Task (project management); Resource allocation; Computer network; Distributed computing; Resource management (computing); Economics; Mathematics","score_opus":0.025259881748184044,"score_gpt":0.25067331615984206,"score_spread":0.225413434411658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011697281","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.03819076,0.006933649,0.8300351,0.09003727,0.0011776687,0.0005946692,7.5886305e-7,0.00077883806,0.03225131],"genre_scores_gemma":[0.9768473,0.00015196568,0.020908065,0.001756364,0.00025006034,0.000013590009,0.000010296465,0.000009523514,0.000052834523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905014,0.00014535499,0.00024452928,0.00024070662,0.00011124283,0.00020800065],"domain_scores_gemma":[0.99844813,0.00020331374,0.00008515933,0.0011045979,0.00005914153,0.00009963852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036686903,0.00009854654,0.00012581373,0.000049161816,0.00023783019,0.00013818243,0.0015225084,0.00005781308,9.468254e-7],"category_scores_gemma":[0.000106625346,0.000108799264,0.00002656957,0.00054135965,0.000061886836,0.00023315875,0.0010959938,0.00030004632,0.000020936095],"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.000035868383,0.00053814595,0.054213468,0.000116471114,0.000120970115,0.000016729748,0.09702678,0.011130719,0.0040792604,0.1006468,0.2575469,0.47452787],"study_design_scores_gemma":[0.00020026926,0.000023721092,0.0054511577,0.000036180685,0.000003770408,0.000004329164,0.000050389863,0.8018585,0.000028174443,0.00040001274,0.19180806,0.00013546612],"about_ca_topic_score_codex":0.000103377344,"about_ca_topic_score_gemma":0.000048175138,"teacher_disagreement_score":0.93865657,"about_ca_system_score_codex":0.000056268476,"about_ca_system_score_gemma":0.000063762534,"threshold_uncertainty_score":0.4436705},"labels":[],"label_agreement":null},{"id":"W3011892839","doi":"10.1049/iet-com.2019.0809","title":"Efficient linearisation technique for crosstalk and power amplifier non‐linearity suitable for massive MIMO transmitters","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Indian Institute of Technology Roorkee","keywords":"Linearity; Crosstalk; Computer science; Amplifier; MIMO; Electronic engineering; Transmitter; Control theory (sociology); Telecommunications; Bandwidth (computing); Engineering; Channel (broadcasting)","score_opus":0.033703062815455424,"score_gpt":0.28183126639307887,"score_spread":0.24812820357762344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011892839","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.0030003735,0.00033106,0.9915262,0.0022764555,0.000076089935,0.0019161297,0.0003109827,0.00022643026,0.0003362792],"genre_scores_gemma":[0.76197255,0.00004119304,0.23633786,0.0002568823,0.000026202059,0.0011621172,0.000110720364,0.000049862836,0.000042603737],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992001,0.000023265246,0.0002672469,0.0001955876,0.00007287475,0.00024089469],"domain_scores_gemma":[0.99859864,0.00044221897,0.000044536446,0.0006794956,0.00012572798,0.000109364395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017418528,0.00015822126,0.00018480024,0.000046110665,0.00025237893,0.00006122194,0.0003768391,0.000113880385,0.000008588547],"category_scores_gemma":[0.00009459719,0.00017867344,0.00007771224,0.00016509806,0.00010798304,0.000083972234,0.00006176931,0.00021880642,0.0000041119115],"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.0003660416,0.0004404511,0.0005077421,0.001055356,0.00040059246,0.000001296618,0.024975406,0.43238094,0.4970106,0.011970634,0.0238745,0.0070164544],"study_design_scores_gemma":[0.0013676301,0.00018687618,0.00062474154,0.000047573598,0.00007642227,0.0000030372414,0.00043551993,0.8264699,0.026920503,0.0015437419,0.14179565,0.00052837876],"about_ca_topic_score_codex":0.000009280964,"about_ca_topic_score_gemma":0.000008396744,"teacher_disagreement_score":0.75897217,"about_ca_system_score_codex":0.000057467063,"about_ca_system_score_gemma":0.000029552628,"threshold_uncertainty_score":0.7286091},"labels":[],"label_agreement":null},{"id":"W3012443826","doi":"10.1049/iet-com.2019.1214","title":"Delta compression optimisation for UAV‐enabled mobile edge caching","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encoding (memory); Enhanced Data Rates for GSM Evolution; Real-time computing; Redundancy (engineering); Cache; Data compression; Greedy algorithm; Hash function; Algorithm; Computer network; Artificial intelligence","score_opus":0.0734796480084799,"score_gpt":0.353370908156775,"score_spread":0.27989126014829513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012443826","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.00031782096,0.00073258125,0.991166,0.005233193,0.000038924576,0.0005973399,0.000013819693,0.0005334622,0.0013668848],"genre_scores_gemma":[0.4732152,0.00029477777,0.52515274,0.00096577907,0.000032153413,0.00023107171,0.000055016608,0.000010975658,0.000042266456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917716,0.00008976271,0.00023295761,0.0002270558,0.000110309105,0.00016277633],"domain_scores_gemma":[0.99785423,0.00032556898,0.000115305935,0.0014502818,0.00016178479,0.000092828246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001730179,0.00010307153,0.00013480922,0.00004182466,0.000448645,0.000115833594,0.0020544538,0.00004976634,0.000005496921],"category_scores_gemma":[0.00016433228,0.00010137736,0.00006842391,0.00031757308,0.000049866994,0.0007266091,0.00080620014,0.00018147887,0.000013406109],"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.0000740413,0.00061227434,0.00032725921,0.0001649207,0.00007904687,0.000002774394,0.009969543,0.006509658,0.09731017,0.1529616,0.045526106,0.6864626],"study_design_scores_gemma":[0.00052674056,0.0002466362,0.00010602169,0.000059197995,0.00001630672,0.0000034886543,0.00012537366,0.5389776,0.04929605,0.0094824005,0.40084472,0.00031542953],"about_ca_topic_score_codex":0.000014664515,"about_ca_topic_score_gemma":0.0000030277051,"teacher_disagreement_score":0.68614715,"about_ca_system_score_codex":0.00003401026,"about_ca_system_score_gemma":0.000044828048,"threshold_uncertainty_score":0.41340488},"labels":[],"label_agreement":null},{"id":"W3022639242","doi":"10.1049/iet-com.2019.0666","title":"Analysis and outage performance evaluation of a fair scheduling for independent non‐identically distributed users in a cognitive radio using OSTBC with equally correlated transmit antennas","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Cognitive radio; Computer science; Independent and identically distributed random variables; Scheduling (production processes); Outage probability; Computer network; Telecommunications; Fading; Random variable; Mathematical optimization; Mathematics; Wireless; Decoding methods; Statistics","score_opus":0.04978748381914839,"score_gpt":0.29845347429464486,"score_spread":0.24866599047549648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022639242","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.45501292,0.00017929717,0.5441178,0.000041485306,0.000007000202,0.00052527536,0.0000657707,0.000034597655,0.000015869646],"genre_scores_gemma":[0.9719896,0.00011179105,0.027402963,0.000009078924,0.000004261481,0.0001019722,0.00035550245,0.000024244391,6.0501526e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899566,0.00008544645,0.00042366495,0.0001642876,0.00018465686,0.00014627924],"domain_scores_gemma":[0.9988841,0.00018397706,0.00012383457,0.00032209785,0.00042470774,0.000061314066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038415857,0.00013050082,0.00028536242,0.00018435702,0.000086009815,0.000026064681,0.00020196172,0.00007399247,0.000003770102],"category_scores_gemma":[0.00015397352,0.00014066305,0.00004837012,0.001083421,0.000072810864,0.00025328077,0.000038651753,0.00017694893,4.3217813e-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.000060355935,0.000028724164,0.028060801,0.000070324226,0.0003463704,2.9084643e-7,0.0027985238,0.9651587,0.0024428947,0.000017044144,1.8191808e-7,0.0010158069],"study_design_scores_gemma":[0.001598442,0.000047661884,0.023829384,0.00020396788,0.00089701655,0.0000016534283,0.0013098626,0.9716072,0.00035238013,0.000008057377,7.789503e-7,0.00014361477],"about_ca_topic_score_codex":0.000034027053,"about_ca_topic_score_gemma":0.00032182556,"teacher_disagreement_score":0.51697665,"about_ca_system_score_codex":0.000112049005,"about_ca_system_score_gemma":0.00006294079,"threshold_uncertainty_score":0.57360727},"labels":[],"label_agreement":null},{"id":"W3043119649","doi":"10.1049/iet-com.2019.0892","title":"Physical layer security of interference aligned mixed RF/unified‐FSO relaying network","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Physical layer; Interference (communication); Computer science; Computer network; Layer (electronics); Telecommunications; Wireless; Materials science; Channel (broadcasting); Nanotechnology","score_opus":0.04643628619021856,"score_gpt":0.27939389888119603,"score_spread":0.23295761269097748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043119649","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.6182217,0.011010096,0.2966684,0.019929493,0.00039840353,0.0013255038,0.0001549312,0.008618433,0.043673046],"genre_scores_gemma":[0.9799023,0.0014485075,0.018383294,0.00008463551,0.000029419702,0.0000708771,0.000039761533,0.000034833993,0.0000063585344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907905,0.000091912,0.00035797205,0.00014649339,0.00011124829,0.00021333853],"domain_scores_gemma":[0.99672437,0.00043150608,0.00010981661,0.0025688123,0.000099101264,0.000066373366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092431415,0.00016563461,0.0002859584,0.00004503592,0.00015318673,0.000019506999,0.0023035372,0.00009958699,0.000013300362],"category_scores_gemma":[0.0001664141,0.00018490606,0.00008419898,0.0005860271,0.00026563788,0.00018626126,0.0010094739,0.00044306275,0.000041275838],"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.00006735891,0.0006226457,0.0030388606,0.0004363581,0.00057989365,0.0000030488454,0.023191037,0.3442819,0.16919337,0.37882894,0.021321645,0.058434933],"study_design_scores_gemma":[0.00084660907,0.0001764856,0.0014721787,0.00033788066,0.00008032331,0.000004737689,0.0038572613,0.810759,0.0958594,0.04665075,0.038901784,0.0010535583],"about_ca_topic_score_codex":0.000010332079,"about_ca_topic_score_gemma":0.00003516266,"teacher_disagreement_score":0.4664771,"about_ca_system_score_codex":0.000040229002,"about_ca_system_score_gemma":0.000016931239,"threshold_uncertainty_score":0.75402504},"labels":[],"label_agreement":null},{"id":"W3094826937","doi":"10.1049/iet-com.2019.1039","title":"Optimal transceiver design for energy harvesting two‐way relay networks","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Nanjing University; Nanjing University of Posts and Telecommunications; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Energy harvesting; Relay; Transceiver; Computer science; Energy (signal processing); Computer network; Telecommunications; Wireless; Mathematics; Physics; Statistics","score_opus":0.05393245427810768,"score_gpt":0.2496181433831353,"score_spread":0.1956856891050276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094826937","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.0009623162,0.002048283,0.99034995,0.0010116227,0.00015804516,0.00019001697,0.000012913897,0.0010176514,0.0042492263],"genre_scores_gemma":[0.7355472,0.00049283396,0.26285768,0.0002823838,0.00024786478,0.00023727567,0.000092987066,0.00009889699,0.00014293489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880314,0.00014095998,0.00037188138,0.0002184023,0.00008744067,0.0003781868],"domain_scores_gemma":[0.99759924,0.0010643057,0.00006162362,0.0010113647,0.00008209486,0.00018134314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021402922,0.00022333996,0.00023129767,0.00003980458,0.0003234941,0.000084695195,0.0011255856,0.00013404404,0.000015658152],"category_scores_gemma":[0.00010177796,0.00026225083,0.0001128563,0.00035002263,0.00011500742,0.00020477946,0.00009632824,0.0003994529,0.000008634555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008400088,0.000016516486,0.000020502857,0.000013410072,0.00005942988,7.2377486e-7,0.00031540875,0.98164546,0.00075810874,0.0056578307,0.0050461376,0.0064580776],"study_design_scores_gemma":[0.00039848598,0.000038150043,0.000036156012,0.000057035642,0.00004254,0.0000036415427,0.000021494961,0.94997936,0.00048235935,0.00005631229,0.048612803,0.00027168085],"about_ca_topic_score_codex":0.000036009606,"about_ca_topic_score_gemma":0.000065258595,"teacher_disagreement_score":0.73458487,"about_ca_system_score_codex":0.000048963026,"about_ca_system_score_gemma":0.000023695418,"threshold_uncertainty_score":0.99998295},"labels":[],"label_agreement":null},{"id":"W3104357977","doi":"10.1049/iet-com.2020.0372","title":"Feature‐oriented channel estimation in reconfigurable intelligent surface‐assisted wireless communication systems","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wireless; Feature (linguistics); Channel (broadcasting); Communications system; Computer network; Telecommunications","score_opus":0.04316528710667999,"score_gpt":0.26933939453791134,"score_spread":0.22617410743123134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104357977","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.14832859,0.0658263,0.6389155,0.08772764,0.0008717997,0.005802564,0.00033115273,0.015276843,0.036919642],"genre_scores_gemma":[0.968759,0.009420744,0.02082319,0.000087870154,0.0000075864596,0.00029187163,0.000480692,0.00006664981,0.00006237276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839824,0.00027379752,0.00058330595,0.00023937011,0.00018926439,0.00031600078],"domain_scores_gemma":[0.9956157,0.0004182254,0.00018441599,0.0034971489,0.00017510401,0.000109367225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002752075,0.000275559,0.00038091085,0.00017125541,0.00027722644,0.00008963957,0.0023836677,0.00023735693,0.000011548144],"category_scores_gemma":[0.00019231273,0.00032361443,0.00006634258,0.0013116645,0.00021906932,0.00044900874,0.0003803146,0.0009591626,0.0001060203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018210456,0.0001568818,0.0002924573,0.00013058016,0.000079910904,0.0000011678787,0.002525542,0.94667315,0.0050301165,0.022063043,0.0035887545,0.019440163],"study_design_scores_gemma":[0.0003439159,0.00002439394,0.00045977393,0.00020122425,0.000011556909,0.000005170872,0.0022870123,0.97212213,0.0035137737,0.0003689746,0.020317191,0.00034489762],"about_ca_topic_score_codex":0.00008543966,"about_ca_topic_score_gemma":0.00016415339,"teacher_disagreement_score":0.82043046,"about_ca_system_score_codex":0.00029780745,"about_ca_system_score_gemma":0.000034826866,"threshold_uncertainty_score":0.9999216},"labels":[],"label_agreement":null},{"id":"W3105010413","doi":"10.1049/iet-com.2019.0944","title":"Cross‐layer resource allocation for critical MTC coexistent with human‐type communications in LTE: a two‐sided matching approach","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Matching (statistics); Layer (electronics); Resource allocation; Telecommunications; Computer network; Statistics; Mathematics","score_opus":0.09895518543852387,"score_gpt":0.3618807525046838,"score_spread":0.26292556706615994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105010413","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.004583264,0.0018066533,0.9680563,0.005675418,0.000056239878,0.0018736805,0.000073118674,0.00088588364,0.016989423],"genre_scores_gemma":[0.75394094,0.00008511423,0.24437599,0.00019005936,0.000036065205,0.00058882113,0.0006616131,0.000075564545,0.000045837984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985417,0.000178061,0.0005790471,0.00026477277,0.00014274572,0.0002936356],"domain_scores_gemma":[0.99640125,0.0006336533,0.00009158664,0.0024875635,0.00025994433,0.00012602127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002911281,0.00021838829,0.0002807718,0.000108195934,0.0004889493,0.00012365385,0.0013802509,0.00010550728,0.000007673094],"category_scores_gemma":[0.00025832249,0.00024135699,0.00005589881,0.00062022585,0.00024643546,0.00036665678,0.00029732756,0.00047435221,0.000015447771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053707812,0.00027210498,0.0005894928,0.000284348,0.000076981894,5.8228517e-7,0.0074524935,0.8952524,0.0072568594,0.08771922,0.0005980371,0.0004437786],"study_design_scores_gemma":[0.0018049954,0.00010814789,0.00046100467,0.0002546249,0.00007045159,0.000014108441,0.0020894774,0.9799906,0.0003915054,0.0012474497,0.0129975295,0.0005701186],"about_ca_topic_score_codex":0.000060676593,"about_ca_topic_score_gemma":0.00024091135,"teacher_disagreement_score":0.7493577,"about_ca_system_score_codex":0.00018100727,"about_ca_system_score_gemma":0.000042818363,"threshold_uncertainty_score":0.9842253},"labels":[],"label_agreement":null},{"id":"W3107998045","doi":"10.1049/iet-com.2019.1344","title":"Impact of antenna correlation on the physical layer security of cooperative relaying with OSTBC system","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Physical layer; Computer science; Antenna (radio); Telecommunications; Computer security; Wireless","score_opus":0.037455460577610636,"score_gpt":0.2867812665103328,"score_spread":0.2493258059327222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107998045","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.97266835,0.0003436052,0.010878236,0.0017616138,0.000015278427,0.00069628155,0.00012773898,0.0005544745,0.012954404],"genre_scores_gemma":[0.9987724,0.0001264672,0.00093800697,0.000027001905,0.0000108816275,0.00006228128,0.000034268887,0.000027134956,0.00000158299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910915,0.00023986613,0.0002921701,0.00009147539,0.00016665639,0.000100653975],"domain_scores_gemma":[0.9972596,0.00061819964,0.00014613318,0.0016834344,0.0002468848,0.000045721514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014854636,0.00013626432,0.00025168064,0.000046919686,0.00012338634,0.00001551402,0.0009473969,0.00005541995,0.000007649519],"category_scores_gemma":[0.00007350824,0.00009624769,0.00009399778,0.00047368533,0.00019863999,0.00012604192,0.00016845365,0.0004560004,0.00001018239],"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.00031872652,0.0013540101,0.01595018,0.0006062871,0.0015168564,0.00000201706,0.123086214,0.09253619,0.13000761,0.62807894,0.0049391487,0.0016038179],"study_design_scores_gemma":[0.00033255634,0.0004108857,0.005477974,0.00040607736,0.00005839473,0.0000038799853,0.0022156409,0.9806822,0.009754949,0.00016912441,0.00026109998,0.00022721682],"about_ca_topic_score_codex":0.00006583788,"about_ca_topic_score_gemma":0.000016482802,"teacher_disagreement_score":0.88814604,"about_ca_system_score_codex":0.000080718055,"about_ca_system_score_gemma":0.000037751448,"threshold_uncertainty_score":0.3924867},"labels":[],"label_agreement":null},{"id":"W3110303522","doi":"10.1049/iet-com.2020.0188","title":"Hybrid beamforming designs for 5G new radio with fronthaul compression and functional splits","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Beamforming; Computer science; Telecommunications","score_opus":0.11342157796524305,"score_gpt":0.2500199701169251,"score_spread":0.13659839215168207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110303522","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.009312177,0.0013218764,0.9861281,0.0015706345,0.000038886188,0.0002813149,0.000019915953,0.00018623628,0.0011408594],"genre_scores_gemma":[0.8795176,0.0002208063,0.1197249,0.00022593819,0.000059381782,0.00004559989,0.00012089937,0.000024871202,0.000060013623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999537,0.000016913062,0.00015355821,0.00010722874,0.000072633884,0.00011265254],"domain_scores_gemma":[0.9993538,0.00010310186,0.000028030245,0.00034463097,0.0000438367,0.00012659945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059039485,0.000096195625,0.00010772278,0.000031460644,0.00019883731,0.000037134276,0.00016779872,0.000025603273,0.000023467928],"category_scores_gemma":[0.000019480192,0.00009064521,0.000027033186,0.000053172058,0.000029163244,0.00013420406,0.000039067734,0.0001266545,0.000007482753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002989244,0.00015573762,0.0007959547,0.0005163086,0.00051335094,0.0000019852298,0.007798012,0.526925,0.2732533,0.003967786,0.071316086,0.11445751],"study_design_scores_gemma":[0.000793811,0.000060318405,0.00015656918,0.00006131636,0.000039362138,0.000010281872,0.00010234339,0.94776136,0.015741752,0.00048208586,0.03459227,0.00019853575],"about_ca_topic_score_codex":0.000010614494,"about_ca_topic_score_gemma":0.000010052418,"teacher_disagreement_score":0.8702054,"about_ca_system_score_codex":0.000020214151,"about_ca_system_score_gemma":0.000026955711,"threshold_uncertainty_score":0.36964044},"labels":[],"label_agreement":null},{"id":"W3112374657","doi":"10.1049/cmu2.12053","title":"Low‐complexity channel estimation for time division duplex massive multi‐user multi‐input multi‐output systems","year":2020,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duplex (building); Computer science; Division (mathematics); Channel (broadcasting); Real-time computing; Telecommunications; Mathematics; Arithmetic","score_opus":0.07546087393445206,"score_gpt":0.29724478172888363,"score_spread":0.22178390779443158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112374657","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.00053491595,0.0007139388,0.9940192,0.0007533457,0.00027760176,0.0020962977,0.00036612182,0.0011028615,0.00013569083],"genre_scores_gemma":[0.621723,0.00009208732,0.37588617,0.00006525456,0.00006369826,0.00065862807,0.001006259,0.000114950264,0.00038996217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831635,0.0001403384,0.0006760269,0.00034426397,0.00016336511,0.0003596468],"domain_scores_gemma":[0.9975059,0.00029567885,0.00022152359,0.0014489866,0.00032605146,0.00020184313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019320265,0.00033458267,0.00041176914,0.00011587175,0.00043341765,0.000109289766,0.0009099572,0.00019173115,0.000011965163],"category_scores_gemma":[0.0003629355,0.00037454758,0.00012992711,0.00036369084,0.00011322207,0.0005192849,0.00027510116,0.00029066965,0.00030091504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007507151,0.00012474196,0.0000369258,0.00025896262,0.00005080837,4.215353e-7,0.0014662676,0.9930188,0.0031028504,0.0004359528,0.0007877894,0.00070896896],"study_design_scores_gemma":[0.001383672,0.00002966917,0.00040152957,0.00016300913,0.000037319696,0.0000017110261,0.00025706232,0.9950845,0.0004016331,0.00001605742,0.0018454441,0.00037835597],"about_ca_topic_score_codex":0.000047278165,"about_ca_topic_score_gemma":0.000032587734,"teacher_disagreement_score":0.62118804,"about_ca_system_score_codex":0.00020856317,"about_ca_system_score_gemma":0.000030329133,"threshold_uncertainty_score":0.99987066},"labels":[],"label_agreement":null},{"id":"W3119324982","doi":"10.1049/cmu2.12076","title":"Early results on deep unfolded conjugate gradient‐based large‐scale MIMO detection","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjugate gradient method; Scale (ratio); Computer science; MIMO; Conjugate; Artificial intelligence; Mathematics; Algorithm; Telecommunications; Physics; Mathematical analysis","score_opus":0.017070894841607058,"score_gpt":0.24723410077337793,"score_spread":0.23016320593177086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119324982","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.07852264,0.001607907,0.87168807,0.0013444686,0.0010524527,0.00086056005,0.00031684982,0.0020365976,0.04257048],"genre_scores_gemma":[0.98162574,0.00016021475,0.017447231,0.00008037358,0.000030932217,0.00010234065,0.00032562378,0.00004665496,0.0001808977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989936,0.00013400975,0.0003503871,0.00018695909,0.00010921528,0.00022586832],"domain_scores_gemma":[0.99761736,0.00020030234,0.000070182476,0.0018747959,0.00016034472,0.000077000535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013610156,0.00014540528,0.0001552436,0.00009746645,0.0002601275,0.00004931118,0.0003399077,0.00009759119,0.000013218247],"category_scores_gemma":[0.000109455636,0.00017505877,0.0000671542,0.00046757318,0.000038587907,0.00016164516,0.000066999666,0.00025348234,0.00012938917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078520665,0.0004570184,0.00024983418,0.00009165903,0.00012964573,0.000010025755,0.0045513404,0.95122886,0.031808436,0.0023211893,0.00081708794,0.008256366],"study_design_scores_gemma":[0.0023275046,0.00007853088,0.0014039633,0.00015372738,0.000048765054,0.000009690503,0.00069096364,0.9273384,0.03952572,0.0005283665,0.027417645,0.00047671757],"about_ca_topic_score_codex":0.000019086312,"about_ca_topic_score_gemma":0.0011861864,"teacher_disagreement_score":0.9031031,"about_ca_system_score_codex":0.00013443263,"about_ca_system_score_gemma":0.000021155176,"threshold_uncertainty_score":0.713869},"labels":[],"label_agreement":null},{"id":"W3129171852","doi":"10.1049/cmu2.12122","title":"An improved underwater TDOA/AOA joint localisation algorithm","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"China Postdoctoral Science Foundation","keywords":"Multilateration; Algorithm; Position (finance); Angle of arrival; Computer science; Least-squares function approximation; Cramér–Rao bound; Noise (video); Mathematics; Estimation theory; Statistics; Artificial intelligence; Azimuth; Telecommunications","score_opus":0.03840485169406325,"score_gpt":0.25731266271875086,"score_spread":0.21890781102468762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129171852","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.010421003,0.0026530072,0.96569663,0.0036225214,0.00020749854,0.00039545706,0.00006335813,0.0013397943,0.01560073],"genre_scores_gemma":[0.9302272,0.00071353104,0.067836806,0.00022220839,0.00006856218,0.000104554136,0.00047234035,0.00004876859,0.000305994],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988187,0.00023808666,0.00041658265,0.0001721516,0.00013103371,0.00022345237],"domain_scores_gemma":[0.99631506,0.00005494595,0.000050515268,0.003262845,0.00020130508,0.00011530768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021953907,0.00015792159,0.000183068,0.000069363174,0.00031137964,0.00018699298,0.0008544134,0.00010807172,0.00009413062],"category_scores_gemma":[0.0000032941398,0.00016793527,0.00007950386,0.00027628944,0.000079558704,0.00031404186,0.00022551882,0.0002793353,0.00013763962],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052924065,0.0009182792,0.0005429738,0.000112118774,0.00050377456,0.0000068537634,0.007404716,0.005592853,0.70000035,0.0062714443,0.0039691217,0.2746722],"study_design_scores_gemma":[0.00051076204,0.00003416007,0.0011092054,0.000037029084,0.000042010484,0.000043638105,0.0019470233,0.687978,0.064163074,0.0033933546,0.2402743,0.0004674005],"about_ca_topic_score_codex":0.00008795616,"about_ca_topic_score_gemma":0.00021135571,"teacher_disagreement_score":0.91980624,"about_ca_system_score_codex":0.00008559619,"about_ca_system_score_gemma":0.000044721197,"threshold_uncertainty_score":0.6848202},"labels":[],"label_agreement":null},{"id":"W3133855535","doi":"10.1049/cmu2.12148","title":"Enhanced BP decoding schemes of polar codes","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Belief propagation; Soft-decision decoder; Frame (networking); Reliability (semiconductor); Maximum a posteriori estimation; A priori and a posteriori; Polar; Mathematics; Telecommunications; Maximum likelihood; Statistics","score_opus":0.043271131127285666,"score_gpt":0.3307641410048815,"score_spread":0.28749300987759585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133855535","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.027145648,0.0018794285,0.9497527,0.0033068492,0.00011871201,0.00009875293,0.000005535311,0.0005822799,0.017110115],"genre_scores_gemma":[0.6029483,0.00020679658,0.39662066,0.00011317384,0.0000046011087,0.000012967944,0.0000049313608,0.000004789758,0.00008375691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991613,0.0001592431,0.00024011898,0.00017284711,0.00013168459,0.00013478311],"domain_scores_gemma":[0.9959962,0.00040443457,0.00012529605,0.0031322902,0.0003049905,0.000036826925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002581651,0.000077394754,0.0001406692,0.00007129182,0.00018769277,0.000054795295,0.002270635,0.000045591394,0.000011287041],"category_scores_gemma":[0.00028794268,0.00008791793,0.000065414846,0.0005528078,0.00008428932,0.00025084338,0.0012772672,0.00018488459,0.000013127184],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013609628,0.0002886783,0.002119359,0.00002920677,0.00004950852,0.0000022878412,0.0032010542,0.0000106439575,0.46211067,0.48563695,0.0014179145,0.045132376],"study_design_scores_gemma":[0.00011629993,0.000026884196,0.00079830404,0.00011680125,0.0000092336495,0.00001572372,0.000224213,0.012897619,0.96225905,0.010483863,0.012852636,0.00019933909],"about_ca_topic_score_codex":0.00004690642,"about_ca_topic_score_gemma":0.00016490577,"teacher_disagreement_score":0.5758027,"about_ca_system_score_codex":0.000031998174,"about_ca_system_score_gemma":0.0001256833,"threshold_uncertainty_score":0.42194423},"labels":[],"label_agreement":null},{"id":"W3134972866","doi":"10.1049/cmu2.12151","title":"Analysis of spectral efficiency for OFDM cooperative cognitive networks with non‐linear relay","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Relay; Subcarrier; Computer science; Spectral efficiency; Relay channel; Topology (electrical circuits); Telecommunications link; Amplifier; Interference (communication); Node (physics); Power (physics); Electronic engineering; Telecommunications; Channel (broadcasting); Mathematics; Physics; Engineering; Acoustics; Bandwidth (computing)","score_opus":0.041672125023223754,"score_gpt":0.3192907715405823,"score_spread":0.2776186465173585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134972866","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.008231335,0.0018678858,0.98301965,0.0019819245,0.000043554315,0.00035863946,0.000030019151,0.0000674415,0.0043995255],"genre_scores_gemma":[0.91469747,0.0018270336,0.08248492,0.0003357776,0.000017035592,0.00011718507,0.00021456824,0.000011390075,0.00029463618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852145,0.00034694312,0.0003982471,0.00033092065,0.00016539315,0.00023702874],"domain_scores_gemma":[0.99432564,0.0013248154,0.0002062683,0.0025795305,0.0014829141,0.000080847814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039315107,0.00015998645,0.00037978575,0.00019103475,0.00057121884,0.00008631207,0.0018389361,0.000060018527,0.00003217339],"category_scores_gemma":[0.00017325269,0.00014641443,0.00017464506,0.003690789,0.00026539815,0.00024204026,0.000749315,0.0002769469,0.0000043257296],"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.0001874433,0.003938494,0.012988972,0.000046335645,0.0076678786,0.000013104256,0.027324662,0.40484968,0.00345045,0.4821515,0.001858525,0.055522963],"study_design_scores_gemma":[0.00061048917,0.00014054908,0.004724208,0.000077639575,0.00036856334,0.0000036122567,0.00038988146,0.9908592,0.0010737736,0.000031977364,0.001507448,0.00021263768],"about_ca_topic_score_codex":0.0000086363225,"about_ca_topic_score_gemma":0.0007097358,"teacher_disagreement_score":0.9064661,"about_ca_system_score_codex":0.000042626307,"about_ca_system_score_gemma":0.00025539557,"threshold_uncertainty_score":0.59706074},"labels":[],"label_agreement":null},{"id":"W3170260460","doi":"10.1049/cmu2.12241","title":"Achievable secrecy rate analysis in mmWave ad hoc networks with multi‐array antenna transmission and artificial noise","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Artificial noise; Computer science; Wireless ad hoc network; Transmission (telecommunications); Secrecy; Noise (video); Antenna (radio); Transmission rate; Telecommunications; Computer network; Acoustics; Electronic engineering; Wireless; Artificial intelligence; Physics; Computer security; Physical layer; Engineering","score_opus":0.018144819803755968,"score_gpt":0.2470959262420395,"score_spread":0.22895110643828354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170260460","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.011903413,0.008741097,0.9783296,0.00027159296,0.000029777739,0.00019690549,0.00001262994,0.00013280202,0.00038216708],"genre_scores_gemma":[0.8895147,0.006199653,0.10383249,0.000021174566,0.000009808279,0.000050202096,0.00022768349,0.000030772026,0.00011351792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991394,0.00015192736,0.0002922434,0.00017816373,0.000056287572,0.00018195105],"domain_scores_gemma":[0.99873865,0.00012265638,0.00004661687,0.00092796894,0.00009257452,0.00007151299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016648261,0.00013686088,0.00024016881,0.00015347563,0.0001463379,0.000049485858,0.00019473211,0.00008455212,0.000016784772],"category_scores_gemma":[0.000020028207,0.00013826885,0.000043531483,0.0012295586,0.00005159823,0.0001952836,0.00003938245,0.0002569339,0.0000028303373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016372198,0.00007226628,0.0013580798,0.0000204781,0.00013097099,0.00000355944,0.0010382643,0.97652596,0.016221989,0.00007040107,0.000007585194,0.004534078],"study_design_scores_gemma":[0.00035311596,0.000011134246,0.003396785,0.00008141611,0.00012363604,0.0000043412697,0.0004648928,0.9940358,0.00052900246,0.000037988226,0.00077873934,0.00018318619],"about_ca_topic_score_codex":0.000023112449,"about_ca_topic_score_gemma":0.0031812198,"teacher_disagreement_score":0.8776113,"about_ca_system_score_codex":0.000059190792,"about_ca_system_score_gemma":0.000024740762,"threshold_uncertainty_score":0.563844},"labels":[],"label_agreement":null},{"id":"W3199564810","doi":"10.1049/cmu2.12275","title":"Joint optimization of antenna selection and beamforming in MIMO SWIPT systems with bidirectional communication","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Beamforming; MIMO; Computer science; Joint (building); Selection (genetic algorithm); Communications system; Antenna (radio); 3G MIMO; Telecommunications; Artificial intelligence; Engineering","score_opus":0.01719885986037411,"score_gpt":0.21317658087324304,"score_spread":0.19597772101286892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199564810","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.40999615,0.027210264,0.54125226,0.0010098554,0.00036883962,0.0007527161,0.000032396423,0.0009955618,0.018381987],"genre_scores_gemma":[0.92188156,0.0032497703,0.0746167,0.000007083869,0.000012813106,0.00006311795,0.000107185246,0.000025139962,0.000036636084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924177,0.00012905047,0.00031520645,0.00010216712,0.000097293916,0.00011449466],"domain_scores_gemma":[0.9988508,0.000181211,0.00008366287,0.0006658221,0.0001875066,0.000030992065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020634264,0.00009628273,0.00016110922,0.00012163766,0.00012412794,0.00003694818,0.00018090865,0.000075193326,0.0000045740303],"category_scores_gemma":[0.00004648312,0.000106922205,0.000017275457,0.0005824398,0.00007224923,0.00020135337,0.00009021191,0.00024067647,5.4677264e-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.00000239087,0.000040045612,0.0031309961,0.000045991856,0.000026706215,2.73202e-7,0.00020437459,0.9918291,0.0020505968,0.002251946,0.000026472408,0.0003910868],"study_design_scores_gemma":[0.00021440169,0.00001261544,0.0037841361,0.000401894,0.000014639525,0.000044427994,0.00025504766,0.9940649,0.0005962076,0.000033197946,0.00046428211,0.00011420108],"about_ca_topic_score_codex":0.00019888519,"about_ca_topic_score_gemma":0.0011807497,"teacher_disagreement_score":0.5118854,"about_ca_system_score_codex":0.00008415991,"about_ca_system_score_gemma":0.000039373663,"threshold_uncertainty_score":0.4360161},"labels":[],"label_agreement":null},{"id":"W4206662593","doi":"10.1049/cmu2.12322","title":"Coordinated 3D spectrum utilization for B5G indoor HetNets: A collaborated crowdsensing approach","year":2021,"lang":"en","type":"article","venue":"IET Communications","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Crowdsensing; Computer science; Computer network; Heterogeneous network; Wireless; Telecommunications; Wireless network; Data science","score_opus":0.1262847010364642,"score_gpt":0.3619478327010616,"score_spread":0.23566313166459743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206662593","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.0019889702,0.0011328292,0.98444265,0.0060750395,0.00023523055,0.0003511036,0.000028742441,0.0003529809,0.005392478],"genre_scores_gemma":[0.51904505,0.00013986263,0.4800558,0.00031774704,0.000023350036,0.00004839402,0.00020679108,0.000014882689,0.00014807565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836946,0.0005237887,0.00032894098,0.0003576195,0.00014076158,0.0002794278],"domain_scores_gemma":[0.99592704,0.00048926217,0.00015055478,0.002518702,0.00084411935,0.000070354305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006876612,0.0001439346,0.00022848415,0.00010175076,0.0005701434,0.00033543288,0.0011872232,0.00009811443,0.000005123531],"category_scores_gemma":[0.0005231892,0.00015828823,0.00006083766,0.0025463866,0.00008882879,0.00034575432,0.00043983842,0.00018904454,0.000010231027],"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.000089774396,0.00331972,0.010027842,0.0002899035,0.00070863485,0.000033266737,0.008872873,0.004920272,0.026070436,0.65036327,0.019233825,0.27607018],"study_design_scores_gemma":[0.0018798126,0.00009536007,0.010211759,0.000093295515,0.00004963549,0.00009619446,0.00036958733,0.82522804,0.017377615,0.012698243,0.13119285,0.00070764276],"about_ca_topic_score_codex":0.000031816748,"about_ca_topic_score_gemma":0.00014811418,"teacher_disagreement_score":0.82030773,"about_ca_system_score_codex":0.00006527708,"about_ca_system_score_gemma":0.00036393013,"threshold_uncertainty_score":0.64548063},"labels":[],"label_agreement":null},{"id":"W4229003883","doi":"10.1049/cmu2.12415","title":"Performance analysis of LDPC coded GFDM systems","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"China Scholarship Council","keywords":"Low-density parity-check code; Computer science; Decoding methods; Algorithm","score_opus":0.02983245580459984,"score_gpt":0.2574481106989731,"score_spread":0.22761565489437327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229003883","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.91145504,0.00422921,0.0020683699,0.0004408374,0.0008084908,0.00034498455,0.0003333355,0.00062128954,0.07969846],"genre_scores_gemma":[0.9983386,0.00035380851,0.0006803,0.0000073141564,0.000008402907,0.00017861392,0.00010435428,0.000012301581,0.0003163055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939775,0.00007476117,0.00023991056,0.000059512822,0.00013983519,0.00008823984],"domain_scores_gemma":[0.9983069,0.00007875109,0.000053909498,0.001489918,0.00004517613,0.00002537101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017137545,0.00005730244,0.0001547206,0.0002566655,0.00021704078,0.0000093941835,0.00073953724,0.000017186461,0.0001408682],"category_scores_gemma":[0.00000875698,0.00007006766,0.00006962161,0.0012234085,0.000052302614,0.000059301718,0.00019536527,0.0001763526,0.000013088418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016231062,0.000038765767,0.0022511976,0.000018932345,0.0004860515,6.452669e-8,0.00061283354,0.9905592,0.0017588293,0.0015768127,0.0023385135,0.00035715036],"study_design_scores_gemma":[0.000078300196,0.000013170537,0.0053758104,0.000004609518,0.0002315302,0.0000032560538,0.0006584549,0.9296972,0.0001637563,0.000008186202,0.06367414,0.000091571696],"about_ca_topic_score_codex":0.000049127604,"about_ca_topic_score_gemma":0.000011210498,"teacher_disagreement_score":0.086883575,"about_ca_system_score_codex":0.000094154675,"about_ca_system_score_gemma":0.000013346279,"threshold_uncertainty_score":0.28572762},"labels":[],"label_agreement":null},{"id":"W4281671688","doi":"10.1049/cmu2.12431","title":"Resource allocation for IRS‐assisted MC MISO‐NOMA system","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Noma; Resource allocation; Computer science; Resource (disambiguation); Computer network; Telecommunications; Environmental economics; Telecommunications link; Economics","score_opus":0.03492357967262469,"score_gpt":0.25797657284290637,"score_spread":0.22305299317028168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281671688","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.025215859,0.029127602,0.7703227,0.031816795,0.0009576786,0.005992712,0.0012094975,0.029485246,0.105871946],"genre_scores_gemma":[0.95113915,0.00020563614,0.044732314,0.0000569345,0.0000128106585,0.002959785,0.00059068284,0.000047025558,0.00025567587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998968,0.00013165496,0.0003748814,0.00015826344,0.00014995392,0.00021725154],"domain_scores_gemma":[0.99532664,0.00052027515,0.00010998718,0.003918803,0.00008520068,0.00003909505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026187557,0.00014689806,0.00017919505,0.00016937105,0.0009987125,0.00003224999,0.0025445102,0.00006757138,0.00001646059],"category_scores_gemma":[0.00008661934,0.00018601998,0.00008174024,0.000501807,0.000114928764,0.00011318869,0.0008238538,0.0004024268,0.000011348497],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040548268,0.0004281758,0.00021488799,0.00038394117,0.00028722058,0.0000011931207,0.002192389,0.35071757,0.019670613,0.43026486,0.05365167,0.14214692],"study_design_scores_gemma":[0.00040225388,0.000041528267,0.0003200218,0.00002993872,0.000022373644,0.00001865214,0.006142319,0.20633021,0.0012529682,0.0007250035,0.78442407,0.0002906315],"about_ca_topic_score_codex":0.000009748344,"about_ca_topic_score_gemma":0.000025197984,"teacher_disagreement_score":0.9259233,"about_ca_system_score_codex":0.00051839737,"about_ca_system_score_gemma":0.000028075998,"threshold_uncertainty_score":0.768139},"labels":[],"label_agreement":null},{"id":"W4307811933","doi":"10.1049/cmu2.12530","title":"Retracted: Development of intrusion detection system using machine learning for the analytics of Internet of Things enabled enterprises","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":8,"is_retracted":true,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Retract; Interim; Computer science; The Internet; Institution; Reliability (semiconductor); Peer review; Analytics; World Wide Web; Law; Data science; Political science","score_opus":0.03566159569684345,"score_gpt":0.26456533589678477,"score_spread":0.2289037401999413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307811933","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.106588505,0.00047001345,0.892193,0.000098874865,0.00021086397,0.0002769584,0.0000031818352,0.00004313142,0.000115439245],"genre_scores_gemma":[0.9537172,0.00005580649,0.04614375,0.000012590384,0.000007177065,0.000030002411,0.000007826789,0.000005876611,0.000019774692],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988032,0.0002495749,0.00051871623,0.00011235532,0.00022765742,0.00008849035],"domain_scores_gemma":[0.9979306,0.0004525441,0.0006182146,0.00077464036,0.00020762689,0.00001638805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001010436,0.000069342044,0.00016088737,0.00014967564,0.0005587518,0.00001783288,0.0012637287,0.000037425063,0.000008780715],"category_scores_gemma":[0.00008351207,0.00006079345,0.000074233896,0.0005478248,0.000058884147,0.00017059961,0.001198438,0.0003166915,2.0803719e-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.0005566408,0.001480784,0.0037440045,0.0012284591,0.0008906853,7.677515e-7,0.10690788,0.1053471,0.39976907,0.035136826,0.00013948802,0.3447983],"study_design_scores_gemma":[0.00014935814,0.00010336474,0.00018116807,0.00007452855,0.000024251263,0.000006911363,0.00069679844,0.9509426,0.04370732,0.00010205155,0.0039572283,0.000054440974],"about_ca_topic_score_codex":0.00034328896,"about_ca_topic_score_gemma":0.000082614046,"teacher_disagreement_score":0.8471287,"about_ca_system_score_codex":0.00011368486,"about_ca_system_score_gemma":0.00006594431,"threshold_uncertainty_score":0.42975235},"labels":[],"label_agreement":null},{"id":"W4311299308","doi":"10.1049/cmu2.12548","title":"A neuro‐evolutionary approach for software defined wireless network traffic classification","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Wireless network; Network traffic control; Traffic classification; Computer network; Machine learning; Wireless; Traffic generation model; Particle swarm optimization; Artificial neural network; Artificial intelligence; Software-defined networking; Distributed computing; Network packet","score_opus":0.045551019109044404,"score_gpt":0.2602298078012608,"score_spread":0.2146787886922164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311299308","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.0020043603,0.00057409465,0.9927631,0.0031254038,0.00017219999,0.00039147245,0.000023268514,0.0003589892,0.00058708014],"genre_scores_gemma":[0.74430704,0.00002103518,0.254076,0.00042258357,0.000053820007,0.0006011212,0.00034820888,0.000014383868,0.00015581334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983144,0.0003574971,0.00038201804,0.0003833175,0.0002621929,0.0003006065],"domain_scores_gemma":[0.99755013,0.000574978,0.00020872979,0.0014576503,0.00014685001,0.000061648054],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00054676866,0.0001390104,0.00018676213,0.00009852018,0.00163638,0.0001067178,0.003324879,0.000044433753,0.000014450017],"category_scores_gemma":[0.00006481392,0.00015398729,0.00019573579,0.0007774011,0.00007812879,0.00018966192,0.0009782668,0.0003570557,0.000007663843],"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.000007752963,0.0003385062,0.00008169371,0.00000868045,0.000047669688,3.4757076e-7,0.0008374611,0.30203167,0.000010447213,0.6623865,0.02189146,0.012357842],"study_design_scores_gemma":[0.00018594637,0.000050410315,0.00041468517,0.0000037800482,0.000024382576,0.00001329201,0.00021199863,0.96727914,3.4689012e-7,0.00019403957,0.031462345,0.0001596412],"about_ca_topic_score_codex":0.0000056859076,"about_ca_topic_score_gemma":0.000015651383,"teacher_disagreement_score":0.74230266,"about_ca_system_score_codex":0.000114490154,"about_ca_system_score_gemma":0.00011736385,"threshold_uncertainty_score":0.99966335},"labels":[],"label_agreement":null},{"id":"W4312708751","doi":"10.1049/cmu2.12445","title":"Distributed secure transmission for covert communication under multi‐user network","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Covert; Collusion; Computer network; Computer security; Transmission (telecommunications); Covert channel; Robustness (evolution); Telecommunications","score_opus":0.02975631721788517,"score_gpt":0.2822354633162386,"score_spread":0.2524791460983534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312708751","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.0017605204,0.012203057,0.96803594,0.009228314,0.00014968775,0.0019022767,0.00094354735,0.0028842313,0.0028924143],"genre_scores_gemma":[0.8533488,0.003271268,0.13627037,0.00038277986,0.00002018244,0.0024295547,0.0040132385,0.00009487077,0.00016894264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.998388,0.00040973836,0.000487721,0.00018027058,0.00021332175,0.00032097078],"domain_scores_gemma":[0.9949027,0.00060831395,0.000110615445,0.004140589,0.00014494265,0.00009288254],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005658014,0.00021696668,0.00025047237,0.00009317373,0.0015349494,0.0000662834,0.00306129,0.00011249754,0.00012334899],"category_scores_gemma":[0.0000236061,0.0002685973,0.00015127976,0.00057863106,0.00013467105,0.00021363249,0.0008576037,0.00078000006,0.000009629654],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007249352,0.0010518847,0.0005146961,0.00012988066,0.00034179824,4.5646198e-7,0.0032863542,0.40839657,0.0036171866,0.28035474,0.2886917,0.013542267],"study_design_scores_gemma":[0.00053658476,0.000029246658,0.00044006162,0.000032585172,0.00003478096,0.0000049664627,0.0003865359,0.19208331,0.00026702974,0.0056046033,0.80027974,0.00030058183],"about_ca_topic_score_codex":0.00003954015,"about_ca_topic_score_gemma":0.000113061134,"teacher_disagreement_score":0.85158825,"about_ca_system_score_codex":0.00030977582,"about_ca_system_score_gemma":0.000049481972,"threshold_uncertainty_score":0.99997663},"labels":[],"label_agreement":null},{"id":"W4313251342","doi":"10.1049/cmu2.12564","title":"Optimal finite alphabet scheme for NOMA uplink channels","year":2022,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Royal Bank of Canada","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; QAM; Quadrature amplitude modulation; Computer science; Channel state information; Noma; Algorithm; Decoding methods; Transmission (telecommunications); Constellation diagram; Mathematics; Wireless; Telecommunications; Bit error rate","score_opus":0.039156035628204876,"score_gpt":0.2800767613814581,"score_spread":0.2409207257532532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313251342","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.027032152,0.012697951,0.9292386,0.013318085,0.0006673857,0.0018937676,0.0005883032,0.0069803284,0.0075833905],"genre_scores_gemma":[0.7826526,0.0007283706,0.21353792,0.00008852077,0.000014940174,0.0024426586,0.0003011152,0.000051250503,0.00018259135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991527,0.000048991667,0.0002986383,0.00014132306,0.00010439338,0.000253925],"domain_scores_gemma":[0.9959675,0.00060633325,0.00007027927,0.003246782,0.00007004727,0.000039028826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020171596,0.00014677351,0.00017021212,0.00015247385,0.0007816292,0.000031220705,0.002720014,0.00006706648,0.00007639965],"category_scores_gemma":[0.00011512956,0.0001886104,0.00008830623,0.0004124274,0.0001334378,0.00015149027,0.0014178387,0.0005664276,0.000029316181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011851427,0.00016707607,0.0000944229,0.000034066088,0.00010232891,4.3334032e-7,0.0008116579,0.9257406,0.0034848535,0.042056307,0.009635132,0.017861294],"study_design_scores_gemma":[0.00033523017,0.00004454379,0.0000338522,0.0000074678596,0.00000740626,0.0000033745519,0.0007184606,0.61302793,0.0015582776,0.0021142073,0.38191497,0.00023428783],"about_ca_topic_score_codex":0.0000035607666,"about_ca_topic_score_gemma":0.0000042725483,"teacher_disagreement_score":0.7556205,"about_ca_system_score_codex":0.00013254848,"about_ca_system_score_gemma":0.000022173665,"threshold_uncertainty_score":0.7691309},"labels":[],"label_agreement":null},{"id":"W4323359377","doi":"10.1049/cmu2.12597","title":"Design of 60 GHz millimeter‐wave SIW antenna for 5G WLAN/WPAN applications","year":2023,"lang":"en","type":"article","venue":"IET Communications","topic":"Microwave Engineering and Waveguides","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Return loss; Computer science; Electrical engineering; Antenna gain; Antenna efficiency; Telecommunications; Antenna (radio); Radiation pattern; Electronic engineering; Engineering","score_opus":0.06669727603890921,"score_gpt":0.27054758452272376,"score_spread":0.20385030848381455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323359377","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.001529864,0.0014807583,0.9934422,0.00036223273,0.00010270198,0.00074768433,0.00020609441,0.0008628726,0.001265595],"genre_scores_gemma":[0.9402349,0.0013583206,0.057020206,0.000019241352,0.000042552863,0.0006730662,0.0002733109,0.000060287795,0.00031809747],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924743,0.000030533487,0.00030840078,0.00011935855,0.00007165143,0.00022263633],"domain_scores_gemma":[0.9978654,0.00052474876,0.000040154624,0.0014206955,0.00009230287,0.00005674201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024593234,0.00013218923,0.00017882946,0.00017139984,0.00013299358,0.000018570221,0.0005698702,0.000072454466,0.0000075090793],"category_scores_gemma":[0.00004733654,0.00014681258,0.00008394657,0.00049784896,0.00006941152,0.00005285231,0.000057023975,0.00012853481,0.000059185186],"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.000010037602,0.00014512488,0.000052464304,0.00047558948,0.000376984,0.0000011298443,0.0017905335,0.1839725,0.7795693,0.0046713324,0.022272132,0.0066628354],"study_design_scores_gemma":[0.00021840974,0.00002763143,0.0002902361,0.00005253017,0.000040339815,0.0000038429134,0.00012888151,0.9526128,0.0060611772,0.001415943,0.03892378,0.00022442626],"about_ca_topic_score_codex":0.000011273703,"about_ca_topic_score_gemma":0.0000050399485,"teacher_disagreement_score":0.938705,"about_ca_system_score_codex":0.000029856363,"about_ca_system_score_gemma":0.000017274693,"threshold_uncertainty_score":0.5986844},"labels":[],"label_agreement":null},{"id":"W4362676747","doi":"10.1049/cmu2.12607","title":"A new code‐based digital signature based on the McEliece cryptosystem","year":2023,"lang":"en","type":"article","venue":"IET Communications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"McEliece cryptosystem; Cryptosystem; Digital signature; Computer science; Public-key cryptography; Merkle signature scheme; Theoretical computer science; Signature (topology); Code (set theory); Algorithm; Key (lock); Key generation; Digital Signature Algorithm; Cryptography; Blind signature; Encryption; Mathematics; Computer security","score_opus":0.04070257753481336,"score_gpt":0.27442732495645344,"score_spread":0.2337247474216401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362676747","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.0009089809,0.00030374533,0.8725289,0.10502594,0.00026848476,0.00062480516,0.00052259007,0.0014760747,0.01834049],"genre_scores_gemma":[0.97664094,0.000019056115,0.020967534,0.0019850356,0.00003131894,0.00006395865,0.00023842859,0.000011615958,0.000042091426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885255,0.000175458,0.0001941527,0.0002516071,0.00030216237,0.00022407202],"domain_scores_gemma":[0.993131,0.0015301091,0.00008176135,0.005075563,0.00007602787,0.00010552726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033844984,0.00013431402,0.000111905916,0.00014843326,0.00055148266,0.00048420302,0.0046168617,0.0000728406,0.000025692787],"category_scores_gemma":[0.00013269659,0.0001010913,0.00012989211,0.0017735832,0.0000846944,0.00031903767,0.00061381777,0.00037132055,0.00034840306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009784691,0.00019684371,0.00038691945,0.000013334236,0.000022191862,0.0000035290143,0.00062300597,0.0007604993,0.00012823379,0.80510014,0.18399473,0.008760803],"study_design_scores_gemma":[0.00047774726,0.000084217674,0.0021737327,0.00010370784,0.000010744813,0.0000017677038,0.00014326109,0.51365066,0.00021618462,0.019241681,0.46359164,0.00030468655],"about_ca_topic_score_codex":0.00002149442,"about_ca_topic_score_gemma":0.00006803257,"teacher_disagreement_score":0.97573197,"about_ca_system_score_codex":0.000020753023,"about_ca_system_score_gemma":0.00017432854,"threshold_uncertainty_score":0.8579355},"labels":[],"label_agreement":null},{"id":"W4364376648","doi":"10.1049/cmu2.12609","title":"Evaluation of orthogonal frequency‐division multiple‐access systems in the presence of carrier frequency offset using wireless images transmission","year":2023,"lang":"en","type":"article","venue":"IET Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Carrier frequency offset; Orthogonal frequency-division multiple access; Computer science; Discrete cosine transform; Orthogonal frequency-division multiplexing; Frequency-division multiple access; Algorithm; Discrete Fourier transform (general); Electronic engineering; Bit error rate; Frequency offset; Channel (broadcasting); Telecommunications; Mathematics; Fractional Fourier transform; Fourier transform; Engineering; Artificial intelligence","score_opus":0.12126751338022144,"score_gpt":0.36889584496911487,"score_spread":0.2476283315888934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364376648","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.99132466,0.0030389263,0.0030793191,0.0002456448,0.00024683445,0.00070694566,0.00017876823,0.000106748535,0.0010721415],"genre_scores_gemma":[0.9983334,0.0005061137,0.00089437293,0.0000021140238,0.000018313709,0.00014259628,0.00007926423,0.000020566005,0.0000032755433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775887,0.00070668664,0.00055679237,0.00012847962,0.00069349614,0.00015567585],"domain_scores_gemma":[0.99764556,0.0005162581,0.00013831195,0.0012632236,0.00040467866,0.000031952102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019925677,0.000118059135,0.00018838057,0.0002511173,0.00012574901,0.00002953797,0.001179535,0.00008489779,0.000016547494],"category_scores_gemma":[0.00026786738,0.00010336324,0.00006133814,0.0009282482,0.0001617564,0.00035054926,0.0000879292,0.0002412161,0.000002792979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041027656,0.00013369133,0.020474961,0.00030530806,0.00008582572,8.245337e-7,0.00529351,0.6368122,0.32692078,0.0015144211,0.00045075468,0.008003631],"study_design_scores_gemma":[0.00030171624,0.000011162625,0.05059519,0.00045855876,0.000076011595,0.0000051054217,0.00087121746,0.9422358,0.0040536774,0.0011837934,0.000073119714,0.00013461498],"about_ca_topic_score_codex":0.0008932697,"about_ca_topic_score_gemma":0.00014191044,"teacher_disagreement_score":0.3228671,"about_ca_system_score_codex":0.000095890464,"about_ca_system_score_gemma":0.000115234245,"threshold_uncertainty_score":0.42150307},"labels":[],"label_agreement":null},{"id":"W4380081364","doi":"10.1049/cmu2.12645","title":"MAD‐DDS: Memory‐efficient automatic discovery data distribution service for large‐scale distributed control network","year":2023,"lang":"en","type":"article","venue":"IET Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Network packet; Testbed; Node (physics); Quality of service; Service discovery; Packet loss; Distributed computing; Forwarding plane; Web service","score_opus":0.04330377861748321,"score_gpt":0.2955064658538318,"score_spread":0.2522026872363486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380081364","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.0022014752,0.00056893606,0.9726295,0.016809959,0.00047756408,0.0008098759,0.0052881083,0.0011500334,0.00006457815],"genre_scores_gemma":[0.9471312,0.0001741342,0.024442106,0.0010466727,0.00021779693,0.00052948174,0.026307872,0.000034777728,0.000115959054],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978382,0.00023318852,0.0004799435,0.00050602615,0.00028604193,0.00065658067],"domain_scores_gemma":[0.9907667,0.0016953081,0.00021243379,0.0069756317,0.00022266421,0.00012725065],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011978259,0.0002094582,0.00029575327,0.000048982874,0.0010291775,0.00040490803,0.005827231,0.00010531355,0.000006070931],"category_scores_gemma":[0.00024650033,0.00020292039,0.00010035106,0.0019740134,0.00006169655,0.0005872399,0.0028920218,0.00023621564,0.00012662064],"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.0000474773,0.0013215155,0.0021489516,0.00020024372,0.0003580933,0.0000061481915,0.0017797495,0.18174937,0.000042647527,0.10637535,0.68320674,0.022763694],"study_design_scores_gemma":[0.0008042122,0.00002508567,0.007306347,0.00007077266,0.000052071315,0.000003734285,0.000119289674,0.94019824,0.0000035725852,0.0024148303,0.048773505,0.00022832246],"about_ca_topic_score_codex":0.000048289014,"about_ca_topic_score_gemma":0.0003120256,"teacher_disagreement_score":0.94818735,"about_ca_system_score_codex":0.0000857879,"about_ca_system_score_gemma":0.00012837729,"threshold_uncertainty_score":0.9995517},"labels":[],"label_agreement":null},{"id":"W4411973882","doi":"10.1049/cmu2.12764","title":"Performance Analysis of Mixed Beaulieu‐Xie and M Dual‐Hop Amplify‐and‐Forward Relay Systems","year":2025,"lang":"en","type":"article","venue":"IET Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"China Scholarship Council","keywords":"Relay; Hop (telecommunications); Dual (grammatical number); Computer science; Telecommunications; Computer network; Physics; Art","score_opus":0.02967245675040853,"score_gpt":0.31116762300524003,"score_spread":0.2814951662548315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411973882","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.71297604,0.03329469,0.19738725,0.024910644,0.00036487784,0.0014544748,0.000074915435,0.0005358663,0.029001268],"genre_scores_gemma":[0.97447264,0.010141578,0.014667773,0.000063954605,0.0000053234066,0.000113170805,0.000042549535,0.0000069980183,0.00048598918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998214,0.0005195468,0.0005017512,0.00027671445,0.00025847633,0.0002294937],"domain_scores_gemma":[0.9928983,0.0013157754,0.00018473605,0.005208905,0.00029944812,0.000092846414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094815576,0.00013336312,0.00036669755,0.0006395814,0.0007406924,0.00015372485,0.0029073001,0.00010301629,0.00000283928],"category_scores_gemma":[0.00010871991,0.00013335982,0.00006821027,0.002866686,0.00039914678,0.00033656965,0.0045191455,0.00038893017,0.000005080645],"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.000025925443,0.00053792424,0.10764951,0.00030492496,0.0029696974,0.0000011707818,0.005055821,0.02401599,0.0010147812,0.7789693,0.004817277,0.07463768],"study_design_scores_gemma":[0.00022004693,0.000026155032,0.074384294,0.00008789798,0.00015665485,0.000002381743,0.00016248118,0.9053269,0.000048342597,0.00015483859,0.01929233,0.00013764857],"about_ca_topic_score_codex":0.00020674487,"about_ca_topic_score_gemma":0.0001829394,"teacher_disagreement_score":0.88131094,"about_ca_system_score_codex":0.000049269987,"about_ca_system_score_gemma":0.000103069186,"threshold_uncertainty_score":0.5696882},"labels":[],"label_agreement":null},{"id":"W658016334","doi":"10.1049/iet-com.2015.0026","title":"Joint channel coding‐cryptography based on random insertions and deletions in quasi‐cyclic‐low‐density parity check codes","year":2015,"lang":"en","type":"article","venue":"IET Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Low-density parity-check code; Cryptography; Computer science; Coding (social sciences); Channel code; Joint (building); Mathematics; Algorithm; Theoretical computer science; Decoding methods; Statistics; Engineering","score_opus":0.05815915651934499,"score_gpt":0.28777912874917444,"score_spread":0.22961997222982944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W658016334","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.9836712,0.00046366834,0.008256655,0.00441047,0.000060624374,0.00030733712,0.00003697138,0.000045407116,0.0027476775],"genre_scores_gemma":[0.9958793,0.00032558735,0.0023576277,0.0010276336,0.000035980527,0.00005402813,0.00029728436,0.000008510129,0.000014048317],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9989034,0.00031372719,0.00025356744,0.00024842986,0.00008682258,0.00019407395],"domain_scores_gemma":[0.99870056,0.00012458589,0.00007913763,0.0008496846,0.00011923933,0.00012680223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051772274,0.00013623592,0.00018484954,0.00008477853,0.00026448222,0.000036796366,0.00033164944,0.00014703635,0.0000023889086],"category_scores_gemma":[0.00045611899,0.00012188164,0.00008704445,0.00021782808,0.00024212376,0.000004833863,0.00029163854,0.0002258572,0.0000055954397],"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.0023655873,0.01555027,0.31883815,0.00018770254,0.00047430332,0.000016470061,0.003110079,0.0056166225,0.5844674,0.031038262,0.024232535,0.014102604],"study_design_scores_gemma":[0.025734946,0.0045309733,0.56723833,0.0007491337,0.00024096765,0.00005774647,0.0031139334,0.21099336,0.08090267,0.021890111,0.0810665,0.0034813064],"about_ca_topic_score_codex":0.00014304116,"about_ca_topic_score_gemma":0.0006563162,"teacher_disagreement_score":0.5035647,"about_ca_system_score_codex":0.000017555212,"about_ca_system_score_gemma":0.00005355809,"threshold_uncertainty_score":0.4970189},"labels":[],"label_agreement":null}]}