{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072761476,0.0030708532,0.90521485,0.00029481115,0.00008937629,0.00006343291,0.00013017886,0.0002206278,0.018154368],"genre_scores_gemma":[0.96079004,0.002439377,0.03350483,0.00007024343,0.00009463435,0.00007632841,0.0001442619,0.00004761401,0.0028325443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983714,0.0005734337,0.000049735874,0.00009233178,0.0006928279,0.00022035364],"domain_scores_gemma":[0.997532,0.0013752213,0.00023357455,0.00015871736,0.00066735,0.000033077282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471488,0.0010208363,0.0006594081,0.00073496916,0.00032539893,0.0009771219,0.00043692667,0.00057569053,0.0012146819],"category_scores_gemma":[0.0040258975,0.00023384893,0.00043618216,0.0010722246,0.0007357667,0.000844778,0.0007407135,0.0006260429,0.00037176162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013059001,0.000027595159,0.00086079,0.00013282195,0.000079228,0.00015104865,0.000106374864,0.89718556,0.020012494,0.051219065,0.00079738785,0.029297033],"study_design_scores_gemma":[0.000002206126,0.00003463428,0.00022706992,0.000008402391,0.00001038221,0.000048332236,0.000009265808,0.9950765,0.0021247445,0.0020899207,0.00036017972,0.000008302886],"about_ca_topic_score_codex":0.0036930654,"about_ca_topic_score_gemma":0.002236412,"teacher_disagreement_score":0.0036930654,"about_ca_system_score_codex":0.0013283778,"about_ca_system_score_gemma":0.001056486,"threshold_uncertainty_score":0.009638131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018515576,0.00053985213,0.979214,0.0000823102,0.000024301446,0.000018211847,0.000017808336,0.00015756133,0.0014302968],"genre_scores_gemma":[0.7027647,0.0011819014,0.2935042,0.0001217637,0.00006880154,0.00008712979,0.000093505325,0.000050577022,0.0021274267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988286,0.00045189276,0.000044413628,0.000103181104,0.00045269507,0.000119188706],"domain_scores_gemma":[0.99745876,0.001709335,0.00019064127,0.00023547094,0.00037435122,0.000031534095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009820823,0.0006627578,0.0006781646,0.00047476034,0.000323674,0.00075420114,0.00072616636,0.0007424201,0.0005089731],"category_scores_gemma":[0.0067226137,0.00035867863,0.00031282063,0.00076895213,0.00076191913,0.0012575375,0.0009255225,0.00088690367,0.00027045983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015391552,0.00003950974,0.0012370339,0.00014826126,0.000059099973,0.00014257207,0.0002504596,0.82913077,0.009733477,0.026480969,0.00066700333,0.13195695],"study_design_scores_gemma":[0.00000806347,0.00004138535,0.00017894138,0.000013360736,0.000010462209,0.00005937621,0.000010308163,0.9921726,0.0041127405,0.002906923,0.00047535973,0.000010547946],"about_ca_topic_score_codex":0.0029896335,"about_ca_topic_score_gemma":0.0027649004,"teacher_disagreement_score":0.0029896335,"about_ca_system_score_codex":0.00047717994,"about_ca_system_score_gemma":0.0012808584,"threshold_uncertainty_score":0.005944431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041613825,0.0026925723,0.000118541226,0.013953079,0.9816165,0.000014813859,0.000024577248,0.00003460481,0.0015036751],"genre_scores_gemma":[0.0004242809,0.0021625136,0.00009170648,0.007115153,0.9800483,0.000014781056,0.000023153752,0.00003185527,0.010088307],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960769,0.000562887,0.00046551466,0.0005840293,0.001905818,0.00040492203],"domain_scores_gemma":[0.98719585,0.003142804,0.001434767,0.00041947112,0.0053497106,0.0024573805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048860665,0.0045806407,0.004465846,0.004196053,0.0030635565,0.0072438554,0.0030302396,0.016428571,0.02049681],"category_scores_gemma":[0.013817842,0.0015493024,0.0026636436,0.0015184799,0.002003155,0.0037006645,0.0017863706,0.015456425,0.012434426],"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.000055753324,0.00001787133,0.00003191922,0.00016778344,0.000022039672,0.0002787512,0.000007368397,0.000035909343,0.00015128682,0.00023136719,0.9933014,0.0056984485],"study_design_scores_gemma":[0.00007912801,0.000052047613,0.0004633075,0.00024451627,0.00008265101,0.0005579574,0.000026951442,0.00027704096,0.0002674432,0.00075719366,0.99716705,0.00002456003],"about_ca_topic_score_codex":0.00087111496,"about_ca_topic_score_gemma":0.0031556229,"teacher_disagreement_score":0.02049681,"about_ca_system_score_codex":0.0027187336,"about_ca_system_score_gemma":0.0020049862,"threshold_uncertainty_score":0.06856871},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030883456,0.0012872333,0.9604877,0.00038535253,0.000059475133,0.000121334226,0.000051092265,0.0002330694,0.00649122],"genre_scores_gemma":[0.8935603,0.0012555986,0.1011823,0.00018520099,0.000052523876,0.00025840144,0.00008183761,0.000032045777,0.0033918452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935037,0.00022090421,0.000041286385,0.00008213393,0.00022756396,0.00007768265],"domain_scores_gemma":[0.9987326,0.00073664635,0.00019755751,0.00010231287,0.00018877172,0.00004210219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389818,0.0007321276,0.00082635094,0.0005370363,0.0007133128,0.0009059112,0.001178511,0.0007410428,0.0008141979],"category_scores_gemma":[0.0026269197,0.00024717205,0.00034671207,0.000849363,0.00072475086,0.0009690288,0.00080578716,0.0005644288,0.00018966352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016004809,0.000121170866,0.00050974474,0.00039263946,0.00014285438,0.0007904958,0.00089297286,0.71057165,0.035572823,0.13378243,0.0056188516,0.11144427],"study_design_scores_gemma":[0.00003837476,0.00024626986,0.00015295722,0.000029839792,0.00005408531,0.00036247342,0.00007218149,0.96000314,0.0045175706,0.029250676,0.0052359877,0.000036377012],"about_ca_topic_score_codex":0.0016056555,"about_ca_topic_score_gemma":0.0024063531,"teacher_disagreement_score":0.0016056555,"about_ca_system_score_codex":0.00082074275,"about_ca_system_score_gemma":0.0009473405,"threshold_uncertainty_score":0.0059549212},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42792106,0.004492987,0.5016694,0.00067474064,0.0002031532,0.00011254753,0.0006583577,0.00029859878,0.06396913],"genre_scores_gemma":[0.96883976,0.0012131318,0.021556659,0.000077879784,0.00005665588,0.00007033437,0.00012078487,0.000020150672,0.008044505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997441,0.000045897716,0.000009932384,0.00005783834,0.00007691613,0.00006540549],"domain_scores_gemma":[0.99894744,0.000650866,0.00011362255,0.0001245764,0.00012230442,0.00004118183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422569,0.0003362837,0.00044564114,0.00038263886,0.00038214633,0.0012911293,0.0005978403,0.0007745089,0.0038881793],"category_scores_gemma":[0.001378421,0.00022311366,0.00020137285,0.00045320494,0.0010685953,0.0020678195,0.0006850531,0.00044388525,0.0003982307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032140885,0.000118149306,0.0008604867,0.0004376134,0.000040808496,0.00032775544,0.00014547548,0.16596937,0.10254184,0.69487154,0.0017586903,0.032606833],"study_design_scores_gemma":[0.000027651398,0.00014987458,0.0007473646,0.00003656695,0.000020681695,0.00031805155,0.00006441601,0.8384017,0.06575525,0.08578995,0.008605831,0.00008270328],"about_ca_topic_score_codex":0.0004846864,"about_ca_topic_score_gemma":0.00032976677,"teacher_disagreement_score":0.0038881793,"about_ca_system_score_codex":0.0006621974,"about_ca_system_score_gemma":0.00035069176,"threshold_uncertainty_score":0.013007283},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5685728,0.0013710413,0.41596463,0.00026203503,0.00002790302,0.000052599727,0.00008220049,0.00021176515,0.013454972],"genre_scores_gemma":[0.99653924,0.00014347001,0.0028781537,0.000011551784,0.0000070224055,0.0000135332775,0.00001246228,0.000003738474,0.0003909929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903274,0.00036661356,0.00003304088,0.000089864276,0.00031818417,0.0001596428],"domain_scores_gemma":[0.9957253,0.0029367534,0.0003970851,0.00023653533,0.0006516783,0.00005272162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012872239,0.00066064385,0.00046018724,0.00044935572,0.00031823703,0.0007353191,0.0004870595,0.0006000146,0.0006433685],"category_scores_gemma":[0.005530796,0.00020648389,0.00024581814,0.0006538588,0.0007806836,0.00059127115,0.0006599611,0.000306213,0.0001430397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016207455,0.0000302239,0.0020770733,0.00008628204,0.00006382548,0.00026215232,0.00019903804,0.9499348,0.010732189,0.016420254,0.00029099896,0.019741036],"study_design_scores_gemma":[0.000008456791,0.00012213596,0.00064070633,0.000006777399,0.000019871311,0.00012305375,0.000040269137,0.9946503,0.0016989297,0.0024593424,0.0002187526,0.000011426444],"about_ca_topic_score_codex":0.0030548077,"about_ca_topic_score_gemma":0.0021215181,"teacher_disagreement_score":0.0030548077,"about_ca_system_score_codex":0.0008899087,"about_ca_system_score_gemma":0.0006025539,"threshold_uncertainty_score":0.0068075657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2616431,0.0019518493,0.7227749,0.00034245176,0.000031766398,0.000048837992,0.00006914441,0.00018120026,0.012956736],"genre_scores_gemma":[0.984749,0.0005521862,0.013628418,0.000047773086,0.000022111411,0.00002820984,0.000039405826,0.000028488443,0.0009044003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984452,0.00073777704,0.0000387338,0.0000730995,0.00054541667,0.0001598395],"domain_scores_gemma":[0.9950059,0.0037447468,0.00028754567,0.00023062191,0.0006865316,0.000044675533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021214848,0.0007115578,0.0007276211,0.00056093367,0.00032530958,0.00084073475,0.0005020342,0.0005854258,0.0011849485],"category_scores_gemma":[0.00684102,0.00027219197,0.00039431918,0.0007100662,0.0008903892,0.00095796125,0.00072488794,0.00038892828,0.0002757985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019414254,0.00003751935,0.0011187581,0.00010552901,0.000077564975,0.00016770692,0.00010711574,0.9446138,0.013494967,0.02150313,0.00029536735,0.018284407],"study_design_scores_gemma":[0.000005902315,0.00006569258,0.0006525624,0.000011244014,0.000017723156,0.00009100406,0.000024219415,0.9923988,0.003203366,0.0033026068,0.00021647368,0.0000104380615],"about_ca_topic_score_codex":0.0011010944,"about_ca_topic_score_gemma":0.00084256125,"teacher_disagreement_score":0.0021214848,"about_ca_system_score_codex":0.00088392897,"about_ca_system_score_gemma":0.0005989379,"threshold_uncertainty_score":0.011219561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845501,0.00042729412,0.004895876,0.00044242092,0.000019391391,0.000026226424,0.0004265328,0.0001392684,0.009073015],"genre_scores_gemma":[0.99763834,0.00017915235,0.0010423479,0.000026554342,0.00001900064,0.000006659213,0.00021994147,0.00002442515,0.00084352074],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988821,0.00031705128,0.00007369199,0.00019533354,0.00037118595,0.00016069201],"domain_scores_gemma":[0.9827943,0.00839179,0.0028845554,0.0012279311,0.004123074,0.0005784829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014816724,0.00020825486,0.00041132647,0.0037599157,0.0006394854,0.0015296441,0.0007797977,0.0007421948,0.0012922186],"category_scores_gemma":[0.01100721,0.00023139546,0.00017450722,0.003166048,0.0007522524,0.003449109,0.0008693036,0.0006188449,0.00034369345],"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.0011543268,0.00036386578,0.7392158,0.00044276635,0.00014009413,0.0019913658,0.0075031873,0.023965366,0.019548437,0.05039387,0.007892874,0.14738818],"study_design_scores_gemma":[0.000056492012,0.00061619456,0.51556945,0.00021778,0.0002488272,0.0037372948,0.009924956,0.3919364,0.034469157,0.015526596,0.027491258,0.00020552131],"about_ca_topic_score_codex":0.0041865814,"about_ca_topic_score_gemma":0.0038888461,"teacher_disagreement_score":0.0041865814,"about_ca_system_score_codex":0.001035839,"about_ca_system_score_gemma":0.0003481914,"threshold_uncertainty_score":0.008324385},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049233433,0.0036816648,0.9368355,0.00064637535,0.00009541455,0.000026326981,0.00022544866,0.0004324894,0.008823348],"genre_scores_gemma":[0.8864989,0.0032969275,0.10497536,0.00027170902,0.00019797758,0.00014867766,0.0007428933,0.00027748552,0.0035901146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912879,0.0030723584,0.0004822786,0.00091282825,0.0033626084,0.0008819971],"domain_scores_gemma":[0.9011683,0.07846036,0.006063465,0.0045602694,0.0091663,0.00058134395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009601908,0.0013135844,0.002075816,0.0026592466,0.0007807081,0.003369167,0.0017417147,0.001947856,0.0028355238],"category_scores_gemma":[0.06625256,0.0007694058,0.00078361644,0.0025978351,0.0022925253,0.003574982,0.0030992017,0.0020944094,0.0011075073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002408162,0.000021370797,0.0025655306,0.0002908404,0.00007387971,0.0001699819,0.00014465551,0.93081325,0.0036110496,0.037721146,0.0010101303,0.023337424],"study_design_scores_gemma":[0.000016726,0.00015474223,0.0028250902,0.00016197927,0.000046514448,0.00036192458,0.00012014787,0.9639536,0.005350197,0.024086263,0.0028531624,0.00006962112],"about_ca_topic_score_codex":0.003801779,"about_ca_topic_score_gemma":0.0021202355,"teacher_disagreement_score":0.009601908,"about_ca_system_score_codex":0.0016337531,"about_ca_system_score_gemma":0.00093818613,"threshold_uncertainty_score":0.050780356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009007736,0.0005875518,0.988451,0.00015399334,0.00005909947,0.000032455504,0.000011535949,0.00015761002,0.0015390929],"genre_scores_gemma":[0.5981095,0.0013597965,0.3935693,0.00020433511,0.00020884551,0.00018378353,0.0001086219,0.00011412271,0.006141742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.00031123578,0.0000416014,0.0002241093,0.00027101947,0.00008338085],"domain_scores_gemma":[0.99901307,0.0004895201,0.00014411546,0.00014626145,0.00015615742,0.00005092959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075907,0.0010133302,0.0009247278,0.00078639924,0.0005324541,0.00087872706,0.0017671366,0.0012719145,0.0008132988],"category_scores_gemma":[0.003041731,0.00042153453,0.00080981024,0.0008634713,0.0005461945,0.0017444296,0.0012558582,0.00063078216,0.0002697843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033531105,0.00015195528,0.0009089214,0.00028526905,0.00019879299,0.00034409313,0.0003244663,0.59773874,0.038582604,0.04832992,0.0042821853,0.30851775],"study_design_scores_gemma":[0.000028812121,0.00013803176,0.00020583252,0.000012219545,0.000036119374,0.00015036813,0.00004485652,0.97265327,0.008503035,0.014139729,0.0040643187,0.000023409752],"about_ca_topic_score_codex":0.0010630499,"about_ca_topic_score_gemma":0.00140658,"teacher_disagreement_score":0.0017671366,"about_ca_system_score_codex":0.0006164837,"about_ca_system_score_gemma":0.0004528953,"threshold_uncertainty_score":0.005690038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031683948,0.00013637594,0.9667849,0.000053939868,0.000025084031,0.00002728302,0.000013285185,0.0003605656,0.0009145459],"genre_scores_gemma":[0.77797645,0.00015385021,0.21927603,0.000066521374,0.000046072917,0.00005952381,0.000069964495,0.00002269254,0.002328863],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999585,0.00013013143,0.000020580477,0.000052866355,0.00015362901,0.00005785467],"domain_scores_gemma":[0.9996076,0.00008578748,0.0000711822,0.000044813547,0.00017086342,0.000019834506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005540874,0.00033015272,0.000355682,0.00025247084,0.00030344314,0.00035287061,0.0006079986,0.000364338,0.0008767801],"category_scores_gemma":[0.0006968716,0.00018072216,0.00019140558,0.00013969574,0.0002140683,0.00037203092,0.00036456034,0.00034812235,0.00041892004],"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.0009998766,0.00012554684,0.0056516635,0.00025244174,0.00012656277,0.00034762186,0.0003193391,0.14574856,0.5149736,0.017862637,0.0026778942,0.31091425],"study_design_scores_gemma":[0.00006536601,0.0007195732,0.0021132035,0.00002738266,0.00009969674,0.00054522953,0.00005532948,0.81236917,0.17485543,0.0011680016,0.007934322,0.00004731588],"about_ca_topic_score_codex":0.0006031032,"about_ca_topic_score_gemma":0.0010776945,"teacher_disagreement_score":0.0008767801,"about_ca_system_score_codex":0.00029447384,"about_ca_system_score_gemma":0.0005084169,"threshold_uncertainty_score":0.0029331446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84447205,0.0005000351,0.14922866,0.00013722695,0.00002136259,0.000019641648,0.0000687607,0.0001486315,0.0054036463],"genre_scores_gemma":[0.9968263,0.000055916124,0.0028265584,0.000010946975,0.00000308897,0.000004890381,0.000011211406,0.000004188645,0.0002569536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992859,0.00028222444,0.000021294938,0.000081438535,0.00019949161,0.0001295999],"domain_scores_gemma":[0.99477035,0.0037482632,0.00035111496,0.00026586262,0.0007475926,0.00011685374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015636554,0.0006967129,0.0004717557,0.0003559622,0.00044605316,0.00087944244,0.0005043254,0.00078741007,0.0006240116],"category_scores_gemma":[0.005631688,0.0002175245,0.00019506406,0.00037859692,0.0007912544,0.00077659707,0.0006937413,0.0003622575,0.000112483736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007339472,0.00007014057,0.0027793315,0.0000965669,0.00006989272,0.00030687315,0.0001858995,0.93118656,0.037305366,0.010396501,0.00026449148,0.016604483],"study_design_scores_gemma":[0.000026569804,0.00028061314,0.0007550404,0.000007927283,0.000022644297,0.00011369346,0.000042889526,0.98592836,0.010402697,0.00226516,0.000135942,0.000018376883],"about_ca_topic_score_codex":0.0021637958,"about_ca_topic_score_gemma":0.0017368078,"teacher_disagreement_score":0.0021637958,"about_ca_system_score_codex":0.0007850885,"about_ca_system_score_gemma":0.00063076743,"threshold_uncertainty_score":0.008269489},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17017299,0.0007987147,0.82469183,0.0000570854,0.00004920309,0.000027779528,0.000029049264,0.00045051097,0.0037228742],"genre_scores_gemma":[0.84875166,0.00047674184,0.1474451,0.00007755871,0.00004531672,0.000037390626,0.000062295636,0.00004039607,0.003063589],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935645,0.00016083886,0.00002775726,0.00007101666,0.00030245772,0.00008151842],"domain_scores_gemma":[0.99917907,0.00044268937,0.0000967601,0.00009353461,0.00016956033,0.000018302424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606162,0.00048490847,0.00054643117,0.0002884326,0.0002989877,0.000677764,0.0004930395,0.0008902611,0.00069132703],"category_scores_gemma":[0.0017304248,0.00029542373,0.00025414984,0.0002680199,0.00026808665,0.00081193825,0.00039736458,0.000535078,0.0006882964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001143198,0.00016657395,0.0022757356,0.00031943378,0.00015249546,0.0003823946,0.00022307792,0.112149514,0.7305811,0.008097657,0.0004771008,0.14403178],"study_design_scores_gemma":[0.000050592444,0.0006804955,0.0024556655,0.000048870843,0.00008577083,0.00095701165,0.000058998645,0.3931194,0.59587866,0.0018514005,0.004763915,0.000049306967],"about_ca_topic_score_codex":0.00023020273,"about_ca_topic_score_gemma":0.0005078529,"teacher_disagreement_score":0.0008902611,"about_ca_system_score_codex":0.00019350853,"about_ca_system_score_gemma":0.00026665552,"threshold_uncertainty_score":0.0029648542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31538838,0.0015000353,0.6753743,0.0003853173,0.000034702414,0.000071277966,0.00007057162,0.00016104705,0.007014293],"genre_scores_gemma":[0.9808123,0.00045106473,0.01722273,0.000042562115,0.000022408478,0.000042228803,0.00002240104,0.000017501423,0.001366673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987018,0.0008101415,0.000038336115,0.00010998455,0.000158474,0.00018125969],"domain_scores_gemma":[0.99179465,0.0068719257,0.000570898,0.00020060857,0.00044680556,0.00011513161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033285713,0.0014841378,0.0013188405,0.00067506044,0.00044505295,0.0011873144,0.0009945835,0.0008546969,0.0006465877],"category_scores_gemma":[0.00811619,0.00062553596,0.00043045369,0.0010086553,0.0012101157,0.0010771566,0.0012880603,0.000483044,0.00016008508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031247962,0.000041217798,0.0008036682,0.00007253935,0.00008011544,0.00015795107,0.00021918319,0.9741253,0.0017073227,0.010637253,0.00031438007,0.011528535],"study_design_scores_gemma":[0.000010489988,0.00009905987,0.0001610379,0.0000055344185,0.000018041537,0.00003199478,0.000043905104,0.99522084,0.00063915487,0.0036335469,0.000128921,0.0000074657705],"about_ca_topic_score_codex":0.0026300927,"about_ca_topic_score_gemma":0.0021132694,"teacher_disagreement_score":0.0033285713,"about_ca_system_score_codex":0.0010710184,"about_ca_system_score_gemma":0.00054777466,"threshold_uncertainty_score":0.017603397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45316046,0.0029855692,0.53307915,0.00075411255,0.000114535476,0.00012316185,0.00013976937,0.0007276574,0.008915488],"genre_scores_gemma":[0.9907548,0.0004874554,0.0077255736,0.000063122905,0.000040851948,0.000037656122,0.00003794227,0.000041877076,0.00081073184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998386,0.00059133937,0.000039700473,0.0002033206,0.00044466768,0.00033494318],"domain_scores_gemma":[0.99468106,0.0034713717,0.0006624768,0.00032905067,0.00072211906,0.00013385966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032944665,0.0013746598,0.0008881193,0.00086371566,0.00053410657,0.0016174436,0.0012264093,0.00131129,0.0010591884],"category_scores_gemma":[0.0072971275,0.00069765304,0.0010648962,0.0007265066,0.0011739295,0.0019801897,0.0011504354,0.0013356863,0.00020206007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011105742,0.00007620304,0.0021575752,0.000051194027,0.000093965835,0.00023763938,0.000054508702,0.97143745,0.009052753,0.010783161,0.00032789743,0.005616575],"study_design_scores_gemma":[0.0000021140904,0.000030281808,0.0003883166,0.0000028249622,0.000017500211,0.0000308985,0.000004109531,0.99830496,0.0005665661,0.00060646783,0.00003958278,0.0000063786265],"about_ca_topic_score_codex":0.005440013,"about_ca_topic_score_gemma":0.0020018208,"teacher_disagreement_score":0.005440013,"about_ca_system_score_codex":0.0018694584,"about_ca_system_score_gemma":0.0009246873,"threshold_uncertainty_score":0.017423034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40172595,0.0012553203,0.57189184,0.00029980077,0.00016805755,0.00016897166,0.00024711603,0.00034706428,0.023895899],"genre_scores_gemma":[0.9240228,0.00067571003,0.07152309,0.000101751495,0.00004557627,0.00009775795,0.00021892639,0.000032130156,0.0032821505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997125,0.000070087575,0.000011303333,0.000043129658,0.00012634414,0.000036574635],"domain_scores_gemma":[0.99958605,0.00016118742,0.00006625801,0.00009797119,0.00006731927,0.000021270092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017795271,0.00032579128,0.00022193359,0.00037451417,0.0002760713,0.00052808813,0.000332767,0.0003023285,0.0014210484],"category_scores_gemma":[0.00080663455,0.00015468238,0.00022088397,0.00050010154,0.0005979249,0.0005117569,0.00040361116,0.0004609538,0.0003598066],"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.00034660375,0.00012964444,0.0018855395,0.00043253243,0.000058471513,0.0005051382,0.0002623778,0.29232872,0.15133058,0.45939356,0.0021821938,0.09114468],"study_design_scores_gemma":[0.00006857943,0.00055047055,0.0013887441,0.000078689416,0.00003339013,0.00080386683,0.0000829876,0.82518524,0.09719856,0.060381122,0.014165217,0.00006307653],"about_ca_topic_score_codex":0.000878591,"about_ca_topic_score_gemma":0.0010986797,"teacher_disagreement_score":0.0014210484,"about_ca_system_score_codex":0.00042784325,"about_ca_system_score_gemma":0.0007040526,"threshold_uncertainty_score":0.004753828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14175172,0.0010998253,0.85093844,0.0002278002,0.00004627561,0.000068530695,0.00007984286,0.0002442192,0.0055433298],"genre_scores_gemma":[0.95295125,0.00030643638,0.04441374,0.000042577372,0.000028771732,0.000041313673,0.000030388279,0.000009753036,0.0021757535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993229,0.00027624358,0.000018838491,0.000132599,0.00014948056,0.000100012345],"domain_scores_gemma":[0.9991584,0.00048484333,0.0001396328,0.00006443254,0.00012795793,0.000024852661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069348677,0.00091087795,0.0008713412,0.00025116475,0.00023804957,0.0006638523,0.0006330699,0.00078538666,0.00082717696],"category_scores_gemma":[0.0014784054,0.00029202137,0.00043754914,0.00051073893,0.00066943467,0.0009110833,0.0004508957,0.00038689957,0.0002786498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014069269,0.000031317042,0.0004985445,0.00010281103,0.00006324605,0.000297455,0.000077982055,0.961337,0.016328735,0.008357661,0.00029214963,0.012472364],"study_design_scores_gemma":[0.000026023647,0.00018839174,0.00024569183,0.0000058564015,0.000033653603,0.00012046933,0.000032542466,0.99118173,0.0040849214,0.0036261396,0.00043764978,0.000016967113],"about_ca_topic_score_codex":0.0016860362,"about_ca_topic_score_gemma":0.0015782876,"teacher_disagreement_score":0.0016860362,"about_ca_system_score_codex":0.00075267075,"about_ca_system_score_gemma":0.00045304035,"threshold_uncertainty_score":0.005461037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028119024,0.0002913889,0.9678609,0.00018563928,0.00002803691,0.000033543212,0.000038948936,0.00012482227,0.0033176683],"genre_scores_gemma":[0.83078545,0.0004495078,0.16468997,0.00016489207,0.00007248947,0.00017147405,0.00009030895,0.000047931124,0.0035278653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991886,0.00030793404,0.000023539851,0.0001493002,0.00016446313,0.00016612446],"domain_scores_gemma":[0.99951386,0.00020365513,0.00008408958,0.0000352167,0.00011678446,0.000046354522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072861643,0.00096226344,0.0008702903,0.00044472722,0.00041190223,0.0011027965,0.000660591,0.00088425365,0.0012842977],"category_scores_gemma":[0.0013299823,0.0004659007,0.00039898843,0.0008778759,0.0006744428,0.0007804489,0.00080804934,0.00057500973,0.00039814838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083266386,0.000030895306,0.00034318495,0.000039210274,0.000042543277,0.000086358545,0.00004961633,0.961847,0.0060953777,0.006996704,0.0008332609,0.023552703],"study_design_scores_gemma":[0.000022260045,0.00007422669,0.00015247695,0.0000046714667,0.000019370447,0.000030008061,0.00003445945,0.9937966,0.0015170439,0.0036101933,0.00072894077,0.000009798339],"about_ca_topic_score_codex":0.005025893,"about_ca_topic_score_gemma":0.00408402,"teacher_disagreement_score":0.005025893,"about_ca_system_score_codex":0.00082531536,"about_ca_system_score_gemma":0.0011992148,"threshold_uncertainty_score":0.009993255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6805037,0.0040199137,0.30025867,0.00085688423,0.00010309977,0.00008814454,0.0005541598,0.00062320183,0.012992235],"genre_scores_gemma":[0.99645185,0.0003301981,0.0026972853,0.00003552192,0.000017890781,0.000028451404,0.00005391307,0.00001600341,0.00036885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820125,0.0007714063,0.00007108435,0.00020105475,0.0002787844,0.00047646672],"domain_scores_gemma":[0.9771016,0.01888225,0.0013801525,0.0007396504,0.0015415514,0.00035464825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037318354,0.0014529709,0.0015082698,0.0012161805,0.0008488864,0.001669359,0.0013948247,0.001154495,0.0009753793],"category_scores_gemma":[0.014206343,0.00057786476,0.0005314788,0.0017132838,0.0016437506,0.001990165,0.0016366653,0.00062918686,0.00018282433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030707277,0.000037065893,0.00077260396,0.00004815558,0.000050896055,0.0001186371,0.00004547849,0.98940676,0.0013804281,0.0030649642,0.000274619,0.0044933925],"study_design_scores_gemma":[0.000016584683,0.00015166173,0.00040976462,0.000008296546,0.00003304407,0.00009103709,0.000049016453,0.99477863,0.0016111309,0.002718576,0.000110806344,0.000021483413],"about_ca_topic_score_codex":0.007817608,"about_ca_topic_score_gemma":0.00374181,"teacher_disagreement_score":0.007817608,"about_ca_system_score_codex":0.00245256,"about_ca_system_score_gemma":0.0017592718,"threshold_uncertainty_score":0.019736052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146439,0.00018950793,0.98316103,0.000050770726,0.00002745968,0.000018613704,0.000053622734,0.0004098565,0.0014451426],"genre_scores_gemma":[0.8409611,0.0011195664,0.1482039,0.0000967546,0.000061532235,0.000118877586,0.00035967692,0.00008807246,0.008990551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941087,0.00011172424,0.000027266558,0.00012797979,0.00022615607,0.00009597948],"domain_scores_gemma":[0.9994289,0.00023544738,0.000076810895,0.00007949514,0.00016157512,0.000017646787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059358083,0.000420649,0.00077778765,0.00047559896,0.00028538622,0.0007809258,0.001055384,0.0008492517,0.0007752676],"category_scores_gemma":[0.0017773508,0.0003193628,0.0005942845,0.001045355,0.00054783217,0.0011309163,0.0006604745,0.0005345721,0.0006418738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095850766,0.000036824575,0.0013266411,0.00008934342,0.00003930535,0.00016862038,0.00008786035,0.9263458,0.005617389,0.013072591,0.0008952778,0.05222457],"study_design_scores_gemma":[0.000006382328,0.00002989083,0.0004433526,0.0000044654607,0.000008408958,0.00007018884,0.000009663101,0.99564123,0.0012815442,0.0018487643,0.0006455539,0.000010460426],"about_ca_topic_score_codex":0.010380253,"about_ca_topic_score_gemma":0.0068393485,"teacher_disagreement_score":0.010380253,"about_ca_system_score_codex":0.0005850111,"about_ca_system_score_gemma":0.00093562825,"threshold_uncertainty_score":0.020639718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030918529,0.00010706328,0.99548256,0.00005249216,0.000030104267,0.000017040962,0.000025977577,0.00033527883,0.0008576506],"genre_scores_gemma":[0.1128213,0.00027867686,0.88426924,0.000117329655,0.00003684994,0.000061324936,0.00013304512,0.000042229323,0.0022399612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990012,0.0002724412,0.00006727936,0.00008921691,0.0004975189,0.00007225406],"domain_scores_gemma":[0.9988399,0.0004573942,0.000121615536,0.00020416574,0.00032833565,0.00004869098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083469,0.00074319314,0.0008402046,0.0004151228,0.00026253128,0.0012894296,0.0010185009,0.0011433286,0.001763311],"category_scores_gemma":[0.0038441357,0.00035947334,0.00052568753,0.0006631526,0.00042175397,0.0014175558,0.0012026528,0.0011597942,0.0015448616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007292507,0.0001548507,0.0019702706,0.00038953006,0.00019214684,0.0005225728,0.00024474377,0.2540747,0.15766637,0.10982092,0.004714112,0.4695206],"study_design_scores_gemma":[0.00004094808,0.00022624564,0.00028755196,0.000030133735,0.000041560088,0.00062529696,0.000016366217,0.94294524,0.038708493,0.009070938,0.007948493,0.0000586881],"about_ca_topic_score_codex":0.00043215498,"about_ca_topic_score_gemma":0.0007815832,"teacher_disagreement_score":0.001763311,"about_ca_system_score_codex":0.0004883047,"about_ca_system_score_gemma":0.0009774403,"threshold_uncertainty_score":0.005898893},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012309161,0.00126865,0.97233325,0.00069340365,0.000060869104,0.00004802723,0.00013440338,0.000106588435,0.01304556],"genre_scores_gemma":[0.78284204,0.008743816,0.1907276,0.0006369329,0.0005171736,0.0005817984,0.0005614851,0.00023873725,0.015150362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922204,0.0002851599,0.000025058067,0.000107321146,0.00027866976,0.000081861275],"domain_scores_gemma":[0.99719846,0.0018709152,0.0003443047,0.00015254332,0.00032947375,0.000104304956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014095684,0.00073841936,0.0007238287,0.0022406518,0.0006284617,0.0016554451,0.0015097794,0.0011083368,0.0032501903],"category_scores_gemma":[0.00633431,0.00039528756,0.001005379,0.0014557178,0.0014857408,0.002995404,0.0010278295,0.0012333497,0.00059576356],"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.000009700588,0.000012021199,0.00033346334,0.00007804285,0.000020296891,0.00007562031,0.0000712907,0.2888892,0.00061385345,0.702488,0.0018354069,0.005573107],"study_design_scores_gemma":[0.000003199543,0.000012428416,0.0001854576,0.000014157142,0.0000064502865,0.000046746223,0.00002066396,0.81896406,0.000119471675,0.17873348,0.0018842142,0.000009681107],"about_ca_topic_score_codex":0.0034613472,"about_ca_topic_score_gemma":0.0017739708,"teacher_disagreement_score":0.0034613472,"about_ca_system_score_codex":0.0022695928,"about_ca_system_score_gemma":0.0006055552,"threshold_uncertainty_score":0.016467154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09106556,0.00063981157,0.8976457,0.00017630612,0.000035949353,0.00005921622,0.00016894568,0.00019950683,0.010008861],"genre_scores_gemma":[0.88516164,0.0006803212,0.110489,0.000079011676,0.0000505926,0.00017651683,0.00024005488,0.0001235369,0.0029993113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979335,0.00073633075,0.00009085333,0.00019218156,0.0008224483,0.00022475547],"domain_scores_gemma":[0.9892944,0.008204139,0.00053149124,0.0007226971,0.001038569,0.0002087347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201236,0.001092256,0.0007223877,0.001374629,0.00042621297,0.0014476817,0.0010127852,0.0009987334,0.0020236906],"category_scores_gemma":[0.014368283,0.00035962928,0.00046402393,0.0012559216,0.0018966926,0.0023555246,0.0019195846,0.0010025324,0.0002870089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016254687,0.00002892754,0.0006660755,0.00012208846,0.0000490736,0.00010659597,0.000067863606,0.8639934,0.011251796,0.10172592,0.00036525298,0.021460446],"study_design_scores_gemma":[0.000004656269,0.000038847174,0.00021319298,0.000022353652,0.0000077566565,0.000055068303,0.000022250202,0.9690633,0.005724582,0.024255691,0.00056597905,0.0000263417],"about_ca_topic_score_codex":0.0023732483,"about_ca_topic_score_gemma":0.0015241129,"teacher_disagreement_score":0.0023732483,"about_ca_system_score_codex":0.001713164,"about_ca_system_score_gemma":0.0013579897,"threshold_uncertainty_score":0.012429893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7633813,0.001042463,0.21990174,0.00038053625,0.00007426259,0.00005846112,0.0006823111,0.0010729961,0.013405854],"genre_scores_gemma":[0.9967824,0.00017127392,0.0025210055,0.000023407189,0.000007155413,0.000014518172,0.00010536345,0.000034804176,0.00034007794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981122,0.00083633006,0.00006391414,0.00019232527,0.0005223161,0.00027290676],"domain_scores_gemma":[0.98830986,0.0090224175,0.0005419988,0.0009698584,0.0010564271,0.0000994292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021977613,0.0009657863,0.0007023163,0.0007237173,0.0004239688,0.00090507563,0.0007137671,0.0009516848,0.0010363794],"category_scores_gemma":[0.009145415,0.00037379222,0.0007361938,0.0012444421,0.0008745564,0.0014579605,0.000738259,0.0007449683,0.00027877258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006755397,0.000011844873,0.0010815008,0.000023485396,0.000014883206,0.00004949543,0.000024489094,0.99315166,0.0011695641,0.0015183078,0.00010505076,0.002782142],"study_design_scores_gemma":[0.000009798107,0.00009046239,0.0012840828,0.000011259122,0.000029600591,0.00009593253,0.00003331558,0.99271214,0.0043129153,0.0011949791,0.00019426367,0.0000312842],"about_ca_topic_score_codex":0.005743201,"about_ca_topic_score_gemma":0.0037223254,"teacher_disagreement_score":0.005743201,"about_ca_system_score_codex":0.0015324719,"about_ca_system_score_gemma":0.0008322159,"threshold_uncertainty_score":0.011622965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005540393,0.00021210095,0.99362636,0.000046202047,0.00003106237,0.000011672686,0.0000070522206,0.00015586159,0.00036926492],"genre_scores_gemma":[0.45694098,0.001150013,0.5384634,0.00007219825,0.000117582495,0.00010185237,0.00008303868,0.000057067016,0.0030138833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958295,0.00015181495,0.000019881494,0.000055946413,0.00015999097,0.000029406547],"domain_scores_gemma":[0.9994734,0.00031215986,0.00007063534,0.000058053192,0.00007185568,0.000013920176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641028,0.00058067,0.00053579867,0.0005100758,0.00027559607,0.0007730069,0.00040476865,0.0008925853,0.00056284026],"category_scores_gemma":[0.002099687,0.00027424726,0.00044703067,0.000650156,0.00058697764,0.0008519389,0.0005539337,0.00080123986,0.00021760956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032624355,0.000089574045,0.0009473115,0.00021756251,0.0001095235,0.000090487505,0.00014208908,0.6935259,0.02425679,0.024516538,0.0014215101,0.25435647],"study_design_scores_gemma":[0.000012568206,0.00004054518,0.00020848121,0.000006511314,0.000010066213,0.000029757868,0.0000050787266,0.99232084,0.0041841078,0.0024738393,0.0006972539,0.000011047951],"about_ca_topic_score_codex":0.002601711,"about_ca_topic_score_gemma":0.0019223694,"teacher_disagreement_score":0.002601711,"about_ca_system_score_codex":0.00040582826,"about_ca_system_score_gemma":0.00077654346,"threshold_uncertainty_score":0.005173087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06362746,0.0011194956,0.92434627,0.0004940174,0.00048819112,0.00027151572,0.00017989476,0.0007596937,0.008713404],"genre_scores_gemma":[0.7810555,0.00087372964,0.2103295,0.00021056783,0.00018117821,0.00024809674,0.00017291425,0.00004076193,0.006887776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992052,0.00014055429,0.00003388531,0.00009757475,0.0004102452,0.00011265144],"domain_scores_gemma":[0.99900717,0.00025735886,0.00016789901,0.0002530851,0.00023123465,0.000083189945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006328748,0.0004928699,0.0006271713,0.00078700646,0.0007199891,0.0008048621,0.0008469958,0.0007461644,0.0018655191],"category_scores_gemma":[0.0012977022,0.00026640852,0.0003710282,0.00065421977,0.0011589024,0.00092044956,0.0014591694,0.0010510035,0.00050583226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008488684,0.00025556146,0.0012982901,0.00060746307,0.00015354312,0.0011916473,0.00040601272,0.07284923,0.29111898,0.374988,0.0061758705,0.25010654],"study_design_scores_gemma":[0.00033087522,0.00096416805,0.0010214316,0.00012909342,0.0001760536,0.0023692104,0.0000705689,0.7614233,0.15013677,0.046327118,0.03677517,0.0002763161],"about_ca_topic_score_codex":0.00058210664,"about_ca_topic_score_gemma":0.00072339486,"teacher_disagreement_score":0.0018655191,"about_ca_system_score_codex":0.00061882933,"about_ca_system_score_gemma":0.0011605319,"threshold_uncertainty_score":0.0062407255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23703445,0.0012683535,0.7570837,0.0004275161,0.000081048034,0.00008253353,0.000059025977,0.00015730235,0.0038060367],"genre_scores_gemma":[0.98414975,0.00023537749,0.01495592,0.000039351962,0.000016617949,0.000025291376,0.000013587838,0.000008118869,0.0005560334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.00036292657,0.000035800032,0.000106722815,0.00018448492,0.00022939056],"domain_scores_gemma":[0.9952237,0.0037083582,0.00048127543,0.000112897884,0.00033122554,0.0001425097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022682522,0.00082658447,0.00090991345,0.0005691466,0.00037568348,0.0011756159,0.00080240116,0.00077475363,0.0010206715],"category_scores_gemma":[0.0062562414,0.0004982943,0.00048719026,0.00045359545,0.0009356796,0.0012007265,0.0008080813,0.0008149438,0.00008917502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011681536,0.00007590216,0.0004405525,0.000035200563,0.0000384936,0.00004047968,0.000043138338,0.9825394,0.0010530874,0.006503602,0.00021148192,0.008901918],"study_design_scores_gemma":[0.000007888249,0.000035545647,0.00009598643,0.0000021677154,0.000006272863,0.000006653736,0.000010352188,0.9979317,0.00017919479,0.0016758932,0.00004515204,0.0000031345073],"about_ca_topic_score_codex":0.005940191,"about_ca_topic_score_gemma":0.003657616,"teacher_disagreement_score":0.005940191,"about_ca_system_score_codex":0.001630884,"about_ca_system_score_gemma":0.0016235852,"threshold_uncertainty_score":0.011995792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76865834,0.0028296995,0.22436889,0.00025935634,0.00004498757,0.000024245148,0.00013691057,0.00023036523,0.00344724],"genre_scores_gemma":[0.9947758,0.00057112274,0.004368572,0.000022601203,0.000016223647,0.000008192837,0.000024768156,0.000015421549,0.00019717118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997166,0.0009828102,0.00020090064,0.0002381476,0.0010820866,0.00033006244],"domain_scores_gemma":[0.971894,0.020943122,0.0028547696,0.0017804585,0.0023669715,0.00016062344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00364603,0.0010737267,0.0010505745,0.0008372092,0.0006285321,0.001490505,0.00063138636,0.0011491894,0.00046507845],"category_scores_gemma":[0.021976369,0.00041154335,0.00033810237,0.00076019164,0.0012271485,0.0019435753,0.0010221993,0.0008479987,0.00016670157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005855854,0.00006627839,0.005377361,0.00021659535,0.00009957301,0.0010457343,0.00033594837,0.9181841,0.032453608,0.0088214865,0.00022501632,0.032588683],"study_design_scores_gemma":[0.000016867449,0.000440874,0.004018403,0.00004656093,0.00009728956,0.00082629,0.00013949822,0.95766085,0.031591635,0.004719254,0.00036607924,0.00007642465],"about_ca_topic_score_codex":0.0016977829,"about_ca_topic_score_gemma":0.0022757861,"teacher_disagreement_score":0.00364603,"about_ca_system_score_codex":0.0009375334,"about_ca_system_score_gemma":0.0007807974,"threshold_uncertainty_score":0.019282281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037031338,0.000860708,0.9591016,0.000103214996,0.000033604687,0.00003504694,0.00001676648,0.00014743104,0.0026701852],"genre_scores_gemma":[0.7894714,0.0008514645,0.20662314,0.00011162458,0.00007596522,0.00008467157,0.000039087547,0.000022056493,0.0027207318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990791,0.00032013207,0.00003400673,0.00007952251,0.0003896466,0.00009741266],"domain_scores_gemma":[0.9986493,0.0008196587,0.00016743504,0.000117456824,0.00022101404,0.000025106574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094903173,0.0006311069,0.00063935225,0.00045113213,0.00041920852,0.000678037,0.00094042264,0.0010061043,0.00043016346],"category_scores_gemma":[0.0024936232,0.00030815703,0.00042442573,0.0005580787,0.0006896901,0.00081368716,0.0007273486,0.00056985056,0.0002746405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031263844,0.000095644034,0.0016969907,0.00030468576,0.0001253605,0.0010154875,0.0008100312,0.6057676,0.1050907,0.10623182,0.001199482,0.17734957],"study_design_scores_gemma":[0.000025721865,0.0002230029,0.00025413674,0.00001812298,0.000025254398,0.0005142769,0.000023155519,0.9700188,0.016894419,0.01015658,0.0018132603,0.00003326029],"about_ca_topic_score_codex":0.000726229,"about_ca_topic_score_gemma":0.00089307333,"teacher_disagreement_score":0.0010061043,"about_ca_system_score_codex":0.00045542637,"about_ca_system_score_gemma":0.00056405313,"threshold_uncertainty_score":0.005019009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049958687,0.0005599372,0.9371942,0.00026981113,0.00012471984,0.00007629833,0.000102549384,0.00032308922,0.0113907],"genre_scores_gemma":[0.56129944,0.00080608367,0.4237177,0.00026260334,0.0000673007,0.0002988884,0.00016814675,0.000086425774,0.013293452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998758,0.000021998438,0.000008942255,0.000015721245,0.00006274833,0.000014828638],"domain_scores_gemma":[0.99963474,0.000118106866,0.00005148854,0.000094839554,0.000080409576,0.000020422622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017882581,0.00034154422,0.0002124269,0.00039475207,0.0003382097,0.0005466236,0.00041025013,0.00039695075,0.0019036896],"category_scores_gemma":[0.0007938339,0.00014252709,0.00016154055,0.00048271744,0.00045675962,0.000671131,0.0006218075,0.00049283163,0.00043503923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001508722,0.00005309696,0.0004480499,0.00020006264,0.000016509648,0.00017009217,0.000265377,0.04252302,0.24745065,0.5365067,0.0023347219,0.16988087],"study_design_scores_gemma":[0.000040674207,0.0002329891,0.00035016055,0.00006911529,0.000018577342,0.00036883447,0.00007229191,0.5264347,0.32160586,0.11865688,0.032080244,0.000069598005],"about_ca_topic_score_codex":0.00040085614,"about_ca_topic_score_gemma":0.00090231164,"teacher_disagreement_score":0.0019036896,"about_ca_system_score_codex":0.00042206727,"about_ca_system_score_gemma":0.00045796265,"threshold_uncertainty_score":0.0063684583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037371274,0.00083048816,0.959508,0.00016015246,0.000057098674,0.000055721222,0.000018226718,0.00014869228,0.001850358],"genre_scores_gemma":[0.92994416,0.00032656168,0.06860851,0.00007012265,0.000049995728,0.00005574863,0.000016360067,0.000008808517,0.0009196565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.0002674464,0.000055199216,0.00011935715,0.00024142262,0.00012133044],"domain_scores_gemma":[0.998393,0.0010823316,0.0001769843,0.000110317094,0.00018523065,0.00005213153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001409506,0.0007930804,0.0009847488,0.00037895024,0.00049179944,0.0009111241,0.0011728163,0.000566909,0.0008387591],"category_scores_gemma":[0.0026785808,0.00032306544,0.0003724589,0.00075401715,0.0008498997,0.0007481698,0.00085172214,0.00081319606,0.00011717974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039241192,0.00018821128,0.0006421886,0.00015783486,0.000104445215,0.00013266827,0.0002707429,0.82069963,0.0117270155,0.022318278,0.001120912,0.14224575],"study_design_scores_gemma":[0.000028474653,0.00007089846,0.000103144645,0.0000041248213,0.000015563857,0.000025943262,0.000012582017,0.995436,0.001427961,0.002636322,0.00022964287,0.00000927501],"about_ca_topic_score_codex":0.0035219742,"about_ca_topic_score_gemma":0.0035415962,"teacher_disagreement_score":0.0035219742,"about_ca_system_score_codex":0.00081262755,"about_ca_system_score_gemma":0.0010002999,"threshold_uncertainty_score":0.0074542165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26827464,0.0024081054,0.7085792,0.0012140707,0.00025493244,0.00010779345,0.00020454121,0.0013023041,0.017654572],"genre_scores_gemma":[0.87661475,0.0009122728,0.11501602,0.00026993133,0.00006201609,0.000078858786,0.00014006872,0.00007524026,0.006830794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993624,0.00015197063,0.000024583042,0.00005632881,0.00026160115,0.00014312485],"domain_scores_gemma":[0.99842715,0.000718791,0.00020473228,0.00029679056,0.00027708782,0.000075549375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009087923,0.00044095988,0.00058346783,0.0007528106,0.00060172577,0.00079931883,0.00082682073,0.0009305834,0.0013888876],"category_scores_gemma":[0.0044950712,0.00023612885,0.00027344257,0.000978418,0.0014797477,0.0017720677,0.001303862,0.001350949,0.00042498307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012090659,0.00013841856,0.0011559902,0.00030629185,0.000043922824,0.00038060008,0.0007441959,0.2302692,0.06542366,0.5176362,0.004008314,0.1786842],"study_design_scores_gemma":[0.00011346226,0.00031082067,0.0005448989,0.00013902086,0.00003575946,0.00043753724,0.00011044688,0.80771405,0.0806143,0.09717135,0.012668471,0.0001397789],"about_ca_topic_score_codex":0.002352783,"about_ca_topic_score_gemma":0.0021803135,"teacher_disagreement_score":0.002352783,"about_ca_system_score_codex":0.00090869056,"about_ca_system_score_gemma":0.0013849938,"threshold_uncertainty_score":0.0065930486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34174693,0.00050643296,0.64848095,0.00023914828,0.000050383278,0.000053595086,0.00010179662,0.00040111208,0.00841967],"genre_scores_gemma":[0.9963498,0.00010330394,0.0028925221,0.000013308196,0.000006247195,0.000013593227,0.000020660314,0.000012768827,0.0005877311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9996716,0.000083427905,0.000009323646,0.00004390995,0.0001254626,0.000066336266],"domain_scores_gemma":[0.99934465,0.00039889064,0.00006561503,0.00004768522,0.00012876741,0.000014328217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746945,0.00045383914,0.00035368095,0.00022193274,0.00022303688,0.00051361416,0.00044298105,0.00037862436,0.0008597669],"category_scores_gemma":[0.0017771815,0.00021646418,0.00034878394,0.00031603835,0.00043841486,0.00038839717,0.0003967134,0.00048302952,0.00015068921],"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.000024564415,0.00001773833,0.0007761502,0.000025430072,0.000017901302,0.000047392423,0.000022438368,0.987909,0.004199732,0.0016527312,0.00011719988,0.0051896772],"study_design_scores_gemma":[6.420471e-7,0.000009496123,0.000788304,0.0000012623916,0.0000024716403,0.000008170438,0.000004852755,0.99836665,0.0006099944,0.00015393186,0.000051378614,0.0000028294157],"about_ca_topic_score_codex":0.006427971,"about_ca_topic_score_gemma":0.0035895312,"teacher_disagreement_score":0.006427971,"about_ca_system_score_codex":0.0007142209,"about_ca_system_score_gemma":0.00055452983,"threshold_uncertainty_score":0.012781143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015125405,0.00067994226,0.97848266,0.00019318218,0.00009972828,0.00009927508,0.00007209642,0.00032573464,0.004921971],"genre_scores_gemma":[0.7547442,0.0011955447,0.23610137,0.00020243933,0.00009062613,0.00027979448,0.00014396707,0.000048120986,0.0071938904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999483,0.00016540183,0.000028597999,0.000045119956,0.00020124823,0.000076655364],"domain_scores_gemma":[0.99894565,0.0003132544,0.000103048435,0.0001725396,0.0004203496,0.000045190543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140345,0.00061655656,0.0004941113,0.0005821599,0.00069886283,0.0005291046,0.0008872882,0.0008047026,0.0012269795],"category_scores_gemma":[0.0024390668,0.00019509438,0.0004149604,0.00089770276,0.00079857203,0.00087865716,0.0007929164,0.00057212624,0.00053965196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004576399,0.000092944865,0.0007317362,0.00036625683,0.00009495527,0.000884529,0.0004144726,0.43602708,0.06182526,0.182084,0.0066442825,0.3103769],"study_design_scores_gemma":[0.000048660564,0.00021324675,0.0001593642,0.000036522877,0.00005659364,0.0005721588,0.00003182221,0.9529341,0.015350809,0.022096334,0.008423101,0.000077293946],"about_ca_topic_score_codex":0.0025092163,"about_ca_topic_score_gemma":0.0029305373,"teacher_disagreement_score":0.0025092163,"about_ca_system_score_codex":0.0005807816,"about_ca_system_score_gemma":0.001328207,"threshold_uncertainty_score":0.0049892664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007983525,0.00075797533,0.9844914,0.0001902618,0.000027731057,0.000044517805,0.000016852686,0.00007047197,0.006417225],"genre_scores_gemma":[0.670461,0.0024353785,0.31433874,0.00022947097,0.00013647354,0.00032268694,0.00007464283,0.00014233291,0.011859313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989041,0.0006845703,0.00002861812,0.000113655005,0.0002007019,0.000068399444],"domain_scores_gemma":[0.9985409,0.0011714573,0.000098972734,0.000050071343,0.000121058605,0.000017616014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001670421,0.001954596,0.0010873812,0.00054055103,0.00031286242,0.0014071019,0.00089995906,0.0015949064,0.0021174133],"category_scores_gemma":[0.0037133726,0.0006121779,0.0008897713,0.0008681133,0.0014362404,0.0011065596,0.0011235318,0.0010636953,0.0007819814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011797473,0.000056304416,0.00012968077,0.000252982,0.00008193346,0.00010349846,0.00013386353,0.9287007,0.006138093,0.039103836,0.000982835,0.024198316],"study_design_scores_gemma":[0.000017423743,0.000102024664,0.000063707696,0.000019138393,0.00001548013,0.000041087893,0.000022601715,0.9825204,0.0021106591,0.014064547,0.0010103727,0.000012448079],"about_ca_topic_score_codex":0.0007810839,"about_ca_topic_score_gemma":0.0006253014,"teacher_disagreement_score":0.0021174133,"about_ca_system_score_codex":0.0010709924,"about_ca_system_score_gemma":0.00048037714,"threshold_uncertainty_score":0.008834124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009011498,0.0005747062,0.98823684,0.00014819407,0.000028493747,0.000031772586,0.00006148672,0.00018355492,0.0017233888],"genre_scores_gemma":[0.60445017,0.0013436843,0.38879398,0.00020415874,0.0000904937,0.00019705169,0.0002663771,0.00005160106,0.00460247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878305,0.0005135166,0.0000645249,0.00013865379,0.00039202505,0.0001081954],"domain_scores_gemma":[0.9972453,0.0017944645,0.0002583999,0.00028538372,0.000374062,0.00004224551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001870433,0.0009076275,0.0010608849,0.0006137988,0.00032155763,0.0012914219,0.0012069409,0.0012430808,0.0017509635],"category_scores_gemma":[0.0063494756,0.00058238965,0.0005380187,0.00073217007,0.00080996926,0.0017582738,0.0011067848,0.0013148873,0.0006690928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002974673,0.00006068984,0.00057026505,0.0001715062,0.000059265705,0.00023768916,0.00018960792,0.82286924,0.008348523,0.0864678,0.0020668912,0.0786611],"study_design_scores_gemma":[0.000016561802,0.000031633015,0.000081850114,0.000008589528,0.0000074852915,0.00006658131,0.000007889278,0.98778605,0.0014038987,0.009661142,0.0009138624,0.000014410374],"about_ca_topic_score_codex":0.001467852,"about_ca_topic_score_gemma":0.0016617397,"teacher_disagreement_score":0.001870433,"about_ca_system_score_codex":0.0011509965,"about_ca_system_score_gemma":0.0014727862,"threshold_uncertainty_score":0.009891927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015390394,0.0012049095,0.9801782,0.0001683239,0.00006481855,0.00004687926,0.000017158887,0.00022768031,0.0027016778],"genre_scores_gemma":[0.914465,0.0011994952,0.08109452,0.00011330558,0.00007245363,0.00018263962,0.00006300237,0.000036463254,0.0027731068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919134,0.00026775518,0.00003065982,0.00010093355,0.00033683423,0.00007246097],"domain_scores_gemma":[0.99881184,0.00069131947,0.000111091045,0.0000732907,0.00028538174,0.000027032635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010901329,0.00048318514,0.0005604428,0.00087923295,0.0006185816,0.0006153766,0.0013013373,0.0006258857,0.0006219222],"category_scores_gemma":[0.0032227477,0.00020399822,0.00038245574,0.0011025388,0.0008515234,0.00054259546,0.0005163572,0.0005634559,0.00017466971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010281643,0.000057229077,0.00033757993,0.00018850194,0.000057499936,0.000104920735,0.0002535572,0.85858375,0.013426768,0.057471078,0.0022917856,0.06712451],"study_design_scores_gemma":[0.0000104183855,0.000059852147,0.00010269299,0.000008848143,0.000011561294,0.000030182182,0.000016379638,0.99211264,0.0009603081,0.005658161,0.0010170505,0.000011808393],"about_ca_topic_score_codex":0.008360473,"about_ca_topic_score_gemma":0.0071768,"teacher_disagreement_score":0.008360473,"about_ca_system_score_codex":0.0012069381,"about_ca_system_score_gemma":0.0011290852,"threshold_uncertainty_score":0.016623616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045664897,0.0004296201,0.9912958,0.00029146412,0.00008471427,0.000043239645,0.00003627093,0.00009611779,0.0031562718],"genre_scores_gemma":[0.8243634,0.0015261583,0.16566944,0.00034852332,0.00032626564,0.00038005607,0.00008353893,0.00006600361,0.0072365557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810576,0.0008652704,0.00006774226,0.00023430231,0.00045237047,0.000274564],"domain_scores_gemma":[0.9958687,0.0031441166,0.00026136445,0.00023438211,0.00035284707,0.00013865693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002844562,0.001141489,0.0011369631,0.00095661194,0.00081132224,0.0016096375,0.0025577182,0.0014917935,0.002517738],"category_scores_gemma":[0.0057650274,0.0007422535,0.0009979688,0.0009864818,0.0020776016,0.0018101075,0.0014061199,0.0019149402,0.0004263395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007172325,0.00006483154,0.00030969686,0.000063579646,0.000050114275,0.000119952994,0.000115991425,0.80641246,0.0010257213,0.17776613,0.00106404,0.012935758],"study_design_scores_gemma":[0.000010244368,0.000025749378,0.000044069115,0.00000714609,0.000008506854,0.00001864819,0.000009434459,0.9722907,0.00015562694,0.026864594,0.00055543653,0.000009839574],"about_ca_topic_score_codex":0.008302117,"about_ca_topic_score_gemma":0.00821679,"teacher_disagreement_score":0.008302117,"about_ca_system_score_codex":0.0029451025,"about_ca_system_score_gemma":0.00266522,"threshold_uncertainty_score":0.021368265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08004216,0.00020706118,0.91148007,0.00014860534,0.00013627014,0.00010980547,0.00006626536,0.004114033,0.0036957862],"genre_scores_gemma":[0.8037933,0.00012046978,0.18797341,0.00017130015,0.00011885321,0.000120760575,0.0002121412,0.00012858378,0.007361218],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996061,0.000053966673,0.000023026525,0.00008347903,0.00018106205,0.000052516323],"domain_scores_gemma":[0.99950993,0.000081863625,0.000056435743,0.00014759178,0.00014337662,0.000060806993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691534,0.00045100183,0.0004321894,0.000530835,0.0005465864,0.0011493355,0.0021387078,0.0004538508,0.002253056],"category_scores_gemma":[0.0008011918,0.0001891838,0.0002712498,0.0003964259,0.000416506,0.0007149755,0.000954387,0.0008181039,0.00062822364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023620403,0.0009581547,0.0032414927,0.00017025894,0.00019002981,0.0005336582,0.0002781147,0.23732188,0.35279235,0.05263564,0.0096915355,0.33982483],"study_design_scores_gemma":[0.00018325195,0.00041627657,0.00095781835,0.000010752456,0.00005584584,0.0002328613,0.000022786473,0.9115269,0.07036617,0.0076847384,0.008501348,0.000041269748],"about_ca_topic_score_codex":0.0012047493,"about_ca_topic_score_gemma":0.0012272624,"teacher_disagreement_score":0.002253056,"about_ca_system_score_codex":0.0006863572,"about_ca_system_score_gemma":0.0005802147,"threshold_uncertainty_score":0.0075372458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0672337,0.00080046424,0.9267126,0.00017582657,0.000042691685,0.000054861714,0.000024872195,0.00007872417,0.004876213],"genre_scores_gemma":[0.84622407,0.00045063125,0.14981073,0.00009773614,0.000032105192,0.00013221694,0.000028713965,0.000020400532,0.0032034332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995098,0.00019466365,0.00001671164,0.00004896708,0.00016750596,0.000062367355],"domain_scores_gemma":[0.9997514,0.00013421751,0.000040722058,0.000014626021,0.00004298626,0.000016005371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760535,0.0005340498,0.0006288802,0.00051653635,0.00033973617,0.00062302925,0.00059704564,0.0005236374,0.0007494239],"category_scores_gemma":[0.0009724332,0.00022343425,0.0003857943,0.000509807,0.00031604586,0.00060034153,0.0006266706,0.0003878823,0.000111759815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053963595,0.000054874483,0.0004656567,0.0000608645,0.00005346772,0.00008375288,0.000038728136,0.93986565,0.004256227,0.0069345897,0.00039983212,0.04773232],"study_design_scores_gemma":[0.000007288628,0.00003549615,0.0001285836,0.0000042952206,0.0000063572425,0.000028733652,0.0000061758165,0.997472,0.00069926365,0.0012688229,0.00033907266,0.000003869208],"about_ca_topic_score_codex":0.0012620968,"about_ca_topic_score_gemma":0.0012676234,"teacher_disagreement_score":0.0012620968,"about_ca_system_score_codex":0.000569941,"about_ca_system_score_gemma":0.0005341318,"threshold_uncertainty_score":0.004633069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009500466,0.0028061492,0.9439322,0.00086560246,0.00078224833,0.00023155942,0.00028756264,0.0002979836,0.0412963],"genre_scores_gemma":[0.5628298,0.0060694027,0.39978004,0.001481275,0.00060848444,0.0012012158,0.001000058,0.000101160476,0.02692857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942684,0.00018783586,0.000028188804,0.00006483502,0.00020581628,0.00008638929],"domain_scores_gemma":[0.9990056,0.00037580286,0.00007397602,0.0002144578,0.00030554028,0.000024558614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056846323,0.0004893272,0.00043117197,0.000841454,0.0005713827,0.0009415025,0.0008866493,0.0007479435,0.0035608981],"category_scores_gemma":[0.0023633465,0.00012771375,0.00025218385,0.0014844425,0.00062262564,0.0008230747,0.0011093678,0.00072623347,0.0010519911],"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.00016166877,0.00006233766,0.00045624547,0.0003568651,0.000035796653,0.00028098363,0.00015545118,0.11587327,0.013833128,0.5363343,0.012461477,0.31998855],"study_design_scores_gemma":[0.000060513757,0.00014692347,0.00036702838,0.00018412467,0.000040473526,0.0006638284,0.000055871686,0.71122265,0.00957253,0.17643182,0.1011974,0.000056800807],"about_ca_topic_score_codex":0.001617479,"about_ca_topic_score_gemma":0.001720706,"teacher_disagreement_score":0.0035608981,"about_ca_system_score_codex":0.00073214923,"about_ca_system_score_gemma":0.0009265525,"threshold_uncertainty_score":0.0119124055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12365695,0.0018606618,0.84020317,0.00095043774,0.000086731045,0.00009620553,0.0006119621,0.0004756326,0.0320582],"genre_scores_gemma":[0.97609484,0.0012518736,0.015822494,0.00021435463,0.00008370322,0.00016616727,0.00025620242,0.000065491964,0.006044882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989214,0.00044511195,0.000029981386,0.00009360105,0.0002497907,0.0002600994],"domain_scores_gemma":[0.99669576,0.0020403438,0.00033088736,0.00020393352,0.00064261194,0.00008653877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022916114,0.0012575202,0.0011730018,0.0011026763,0.0006170136,0.0018336184,0.001146035,0.0012624586,0.0031476307],"category_scores_gemma":[0.004883686,0.0005354204,0.0008914329,0.0012296616,0.001596277,0.0013203803,0.0015002884,0.0012585992,0.0006637976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027917735,0.000018315113,0.00022351352,0.000042270218,0.000021396412,0.000094381634,0.00004542148,0.9821536,0.0009360416,0.014980059,0.0003988791,0.0010581473],"study_design_scores_gemma":[0.0000025082654,0.000010425562,0.00008329992,0.000005228172,0.000007447446,0.000023951196,0.000011561746,0.9980324,0.00015367281,0.0015744878,0.00008944485,0.0000055592286],"about_ca_topic_score_codex":0.012809342,"about_ca_topic_score_gemma":0.0048233955,"teacher_disagreement_score":0.012809342,"about_ca_system_score_codex":0.0020529374,"about_ca_system_score_gemma":0.0012992858,"threshold_uncertainty_score":0.025469542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04600843,0.00041634555,0.949555,0.00013305669,0.00003470617,0.000022506203,0.000036335383,0.0008699725,0.002923715],"genre_scores_gemma":[0.82355756,0.00042919972,0.17230342,0.00009789504,0.000031051266,0.00003207301,0.00007147239,0.000048002963,0.0034293286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998834,0.000027233571,0.00000452417,0.000014750106,0.000056435514,0.000013637222],"domain_scores_gemma":[0.9998547,0.000059017864,0.000025632487,0.000022261225,0.000029403604,0.00000890638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013763232,0.00023897857,0.00021166082,0.00013875635,0.00019911648,0.00030019306,0.00051357306,0.00030522872,0.0015277759],"category_scores_gemma":[0.00040160966,0.00014446593,0.00017086153,0.00022245984,0.00027311067,0.0005514956,0.00033001366,0.0007146874,0.00047280057],"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.0004920024,0.00013491098,0.0007996367,0.00031507527,0.00006852756,0.00038119697,0.00020445179,0.3632405,0.3387449,0.03501758,0.0022997856,0.25830144],"study_design_scores_gemma":[0.000013837476,0.00013371087,0.00011290691,0.000010361913,0.0000129911,0.00017387272,0.00001470917,0.9362519,0.05843638,0.0018541355,0.002973453,0.000011693491],"about_ca_topic_score_codex":0.0008675775,"about_ca_topic_score_gemma":0.0017526845,"teacher_disagreement_score":0.0015277759,"about_ca_system_score_codex":0.00024710892,"about_ca_system_score_gemma":0.00039893176,"threshold_uncertainty_score":0.005110979},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02453073,0.0017230405,0.968627,0.00022435284,0.000041161962,0.000033901786,0.000019699239,0.00013728665,0.004662757],"genre_scores_gemma":[0.5269036,0.002482923,0.46640745,0.00020006795,0.00024422907,0.00008781688,0.000048433256,0.00008883314,0.0035366502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833727,0.0005407499,0.000052997315,0.00010058812,0.000887933,0.0000804451],"domain_scores_gemma":[0.9985489,0.0010365297,0.00013840267,0.0001492052,0.000111949535,0.0000149890975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015990691,0.00041569542,0.00042578793,0.0006565374,0.0002524576,0.000687685,0.00047333422,0.00064039696,0.0016318175],"category_scores_gemma":[0.004143972,0.00027833757,0.00029055006,0.00060679414,0.00069055,0.0012305798,0.00055594445,0.0008110517,0.0005151304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035336267,0.0000704144,0.00076780515,0.00036972843,0.000057282217,0.00015210758,0.000114647984,0.23830691,0.06987656,0.52730113,0.0009111236,0.16171895],"study_design_scores_gemma":[0.000092975155,0.00061684253,0.0008457523,0.00011897476,0.00007867878,0.00051381614,0.000043638,0.77998495,0.07939174,0.1161546,0.02209822,0.00005981423],"about_ca_topic_score_codex":0.00027474345,"about_ca_topic_score_gemma":0.0005022515,"teacher_disagreement_score":0.0016318175,"about_ca_system_score_codex":0.0008154775,"about_ca_system_score_gemma":0.0006124691,"threshold_uncertainty_score":0.008456826},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016288448,0.14120823,0.64475054,0.027054105,0.0022464707,0.00013758386,0.00010431105,0.00010428469,0.16810608],"genre_scores_gemma":[0.61186635,0.2241014,0.11675947,0.0041209343,0.006991125,0.0006335552,0.00015633702,0.000108623826,0.0352622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975821,0.0012935913,0.00009919921,0.00021679213,0.0005781534,0.00023012435],"domain_scores_gemma":[0.99753404,0.0018202852,0.00012895906,0.0001430753,0.00027312976,0.00010052531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004358151,0.00093413366,0.0012598293,0.0010712428,0.0013675048,0.0045609325,0.0018865374,0.0032287086,0.0030204915],"category_scores_gemma":[0.004142351,0.0007103785,0.0009628045,0.0027041247,0.006068864,0.0066294805,0.0021624197,0.0052529178,0.00081123837],"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.0000050038157,0.000012614334,0.000058967205,0.00010128399,0.0000065976583,0.000042633554,0.000122561,0.0075421175,0.00012231286,0.9780106,0.0013486913,0.012626558],"study_design_scores_gemma":[0.0000046080927,0.000014855852,0.000059004906,0.00011146111,0.0000032242558,0.000058703394,0.00014493124,0.016553655,0.00007080413,0.9656281,0.017339235,0.000011530449],"about_ca_topic_score_codex":0.0014422361,"about_ca_topic_score_gemma":0.0009678698,"teacher_disagreement_score":0.0045609325,"about_ca_system_score_codex":0.0021853705,"about_ca_system_score_gemma":0.0019413558,"threshold_uncertainty_score":0.0230484},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046285007,0.0001361597,0.93938076,0.00013211482,0.00009517017,0.00016429918,0.00064575556,0.0052617094,0.007898975],"genre_scores_gemma":[0.7660361,0.00028203012,0.22371262,0.000116437506,0.000028449216,0.00043720254,0.0009934768,0.00047711952,0.0079165045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997665,0.000057657784,0.000014588629,0.00002105532,0.00011337732,0.000026877055],"domain_scores_gemma":[0.99956995,0.0001904681,0.000039940925,0.00006663588,0.00011828283,0.000014716654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034266175,0.00050602783,0.00036331548,0.00025740836,0.00020412274,0.00035897095,0.0010516869,0.0003977193,0.0055077067],"category_scores_gemma":[0.0009499292,0.00022109067,0.0004014244,0.00020398207,0.0001961716,0.00052820693,0.00025291246,0.000660903,0.000835154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008187916,0.000031002164,0.0007449611,0.000095826545,0.00002988791,0.000114169256,0.000051197934,0.95586336,0.011805873,0.010702761,0.0022903935,0.018188698],"study_design_scores_gemma":[0.000013901752,0.000032338266,0.000052440402,0.0000030603928,0.000004281345,0.000020423402,0.000003257206,0.99187636,0.0052082655,0.00066415296,0.0021174036,0.000004154302],"about_ca_topic_score_codex":0.002345972,"about_ca_topic_score_gemma":0.003127852,"teacher_disagreement_score":0.0055077067,"about_ca_system_score_codex":0.00038248565,"about_ca_system_score_gemma":0.00087756733,"threshold_uncertainty_score":0.018425107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.658785,0.0011986133,0.3291222,0.00034567303,0.00004019838,0.00005180526,0.00023861257,0.00058851374,0.009629352],"genre_scores_gemma":[0.984766,0.00031234906,0.013942995,0.000047560523,0.000011451815,0.000018035764,0.000064959626,0.000011962434,0.00082466163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856746,0.00045305197,0.000050054776,0.0002019652,0.00042042413,0.00030710554],"domain_scores_gemma":[0.99337137,0.00484956,0.00059841084,0.0003998055,0.0006383259,0.00014256591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002276282,0.0008836767,0.0009053024,0.0005540356,0.0005634076,0.0011166746,0.00068584294,0.0010721429,0.0008128645],"category_scores_gemma":[0.007979407,0.0003584814,0.00031531753,0.000676879,0.0010920241,0.00073348655,0.00085132424,0.00041075767,0.0003094477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013786617,0.00008471955,0.007463032,0.0002048426,0.0001494473,0.00044109495,0.00025814373,0.8847067,0.043564975,0.015175398,0.0005705175,0.04600249],"study_design_scores_gemma":[0.0000493598,0.00031758478,0.0028878187,0.000046542467,0.000060609167,0.00029370474,0.000058568603,0.9616723,0.0299371,0.004333656,0.00028163998,0.00006114264],"about_ca_topic_score_codex":0.0028902283,"about_ca_topic_score_gemma":0.0028027347,"teacher_disagreement_score":0.0028902283,"about_ca_system_score_codex":0.00087716396,"about_ca_system_score_gemma":0.0016836541,"threshold_uncertainty_score":0.0120382905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3502568,0.001278386,0.63731104,0.00029935737,0.000071745046,0.000071533184,0.00007870767,0.00026959268,0.010362845],"genre_scores_gemma":[0.98712665,0.00022105091,0.011573467,0.000027712738,0.000011795999,0.000024139457,0.000017005723,0.000024178304,0.00097396335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931467,0.00024740605,0.000019487554,0.00009525436,0.00016287796,0.00016030767],"domain_scores_gemma":[0.9985851,0.00087191333,0.00022801143,0.00006476682,0.00020216533,0.00004812989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141616,0.00096110394,0.0008155801,0.0003472023,0.00028573032,0.0010343238,0.00048108946,0.00068533624,0.0011325566],"category_scores_gemma":[0.0031661415,0.00025830325,0.00032925248,0.00042818132,0.0006159724,0.0009010195,0.0007835134,0.0004156467,0.0001495411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000318362,0.0000142422805,0.00018254318,0.000020662148,0.000017125098,0.000021482798,0.0000067641313,0.9941338,0.0016772214,0.001287565,0.00004719012,0.002559635],"study_design_scores_gemma":[0.0000034026011,0.000042024352,0.00014116261,0.0000027104031,0.0000069915454,0.0000073767096,0.0000045896913,0.99826175,0.0008909576,0.00058639114,0.00004987451,0.0000028079935],"about_ca_topic_score_codex":0.0019240087,"about_ca_topic_score_gemma":0.0013592228,"teacher_disagreement_score":0.0019240087,"about_ca_system_score_codex":0.0010808958,"about_ca_system_score_gemma":0.00090511225,"threshold_uncertainty_score":0.007842541},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76590055,0.0004559606,0.2086074,0.0018248429,0.000107791115,0.00011715845,0.000218905,0.00008973936,0.02267751],"genre_scores_gemma":[0.9960622,0.00006326183,0.0026990427,0.000031980842,0.00001622693,0.000015720885,0.00002084704,0.000006436677,0.0010842467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808085,0.0008492468,0.000036102123,0.00025668216,0.00023147938,0.00054560666],"domain_scores_gemma":[0.99506855,0.0033896735,0.00063045067,0.00012471528,0.00044091654,0.0003456219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026226742,0.0005100527,0.0014849817,0.0005659658,0.0010036501,0.0026093395,0.0019192976,0.0020989748,0.0027437522],"category_scores_gemma":[0.00928407,0.0006077164,0.0007183487,0.0008633902,0.0017009953,0.0025636689,0.0016376504,0.0013447368,0.00021243276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037372275,0.00011843168,0.00385145,0.000078712066,0.00007477703,0.002013228,0.00016546652,0.89660424,0.003079829,0.08652911,0.0014399725,0.005671021],"study_design_scores_gemma":[0.000018607836,0.000038270406,0.00053316617,0.0000025959102,0.000008355386,0.000087302426,0.00009666484,0.98996466,0.00016262184,0.008906652,0.00016760411,0.000013510095],"about_ca_topic_score_codex":0.008539509,"about_ca_topic_score_gemma":0.007553351,"teacher_disagreement_score":0.008539509,"about_ca_system_score_codex":0.0025522036,"about_ca_system_score_gemma":0.0012369043,"threshold_uncertainty_score":0.018517554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010796065,0.00021977622,0.9981426,0.00004584828,0.000027693184,0.000008393326,0.000006362669,0.000060023056,0.0004098187],"genre_scores_gemma":[0.09964297,0.0016060581,0.8939483,0.00021167714,0.00015660666,0.00018248997,0.000088176224,0.00004774562,0.004115971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996866,0.00010606145,0.000019555828,0.00003816956,0.0001230122,0.000026656637],"domain_scores_gemma":[0.999658,0.00016790266,0.000036532656,0.00004614678,0.00008028509,0.000011055979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044604889,0.0007662479,0.0004189027,0.0003576376,0.0002846805,0.000346627,0.00048780994,0.00063715444,0.0019665726],"category_scores_gemma":[0.0010940718,0.0003107506,0.00041599493,0.0006792436,0.00049541006,0.0008792103,0.00064765936,0.0010412837,0.0007249356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001617379,0.00006795845,0.00061642396,0.00033437432,0.00014636599,0.00018444099,0.00027223123,0.15312734,0.16409867,0.1113066,0.004821785,0.564862],"study_design_scores_gemma":[0.000080443475,0.00030251362,0.0005993176,0.00006485166,0.000065385364,0.000535666,0.0000708382,0.8929173,0.043870058,0.042353485,0.019079557,0.000060530598],"about_ca_topic_score_codex":0.00045647298,"about_ca_topic_score_gemma":0.0006509115,"teacher_disagreement_score":0.0019665726,"about_ca_system_score_codex":0.00019644057,"about_ca_system_score_gemma":0.0006025384,"threshold_uncertainty_score":0.006578803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28937677,0.00058027136,0.7008915,0.00018998297,0.000073967974,0.0000742482,0.00019571536,0.00027693732,0.008340686],"genre_scores_gemma":[0.93495274,0.00022426869,0.06344952,0.00005317651,0.000023727367,0.000099430115,0.00012520369,0.000015033365,0.0010568995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956244,0.00012498352,0.000024092298,0.00006624418,0.00016417184,0.00005802892],"domain_scores_gemma":[0.9991922,0.0003841111,0.00011230296,0.00014620775,0.00013257419,0.000032550077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024509942,0.00022425124,0.00026774587,0.00066501874,0.00044179987,0.0005415967,0.00039717372,0.00031340632,0.00074236316],"category_scores_gemma":[0.0014728458,0.00013091753,0.00028742707,0.00067211135,0.00093106757,0.0006302308,0.00059939356,0.0004102302,0.00015244368],"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.00022190175,0.00005232391,0.0025477447,0.00022277384,0.000048869577,0.00034818045,0.00036331773,0.34876895,0.042698927,0.5438824,0.0012746337,0.059569895],"study_design_scores_gemma":[0.000029297687,0.00015173003,0.0010863281,0.0000337177,0.000018701872,0.00029481735,0.00004053176,0.872335,0.015929362,0.10689926,0.0031398726,0.000041359053],"about_ca_topic_score_codex":0.0014107031,"about_ca_topic_score_gemma":0.0012008208,"teacher_disagreement_score":0.0014107031,"about_ca_system_score_codex":0.000536108,"about_ca_system_score_gemma":0.00064245093,"threshold_uncertainty_score":0.0038897991},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051173087,0.0011527329,0.9432275,0.0003108638,0.00010977227,0.00006530281,0.00005368753,0.00036379154,0.0035433047],"genre_scores_gemma":[0.86181146,0.0008547601,0.13270216,0.00019246811,0.00012171964,0.00006182379,0.000047593152,0.000034632743,0.004173447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.00043000185,0.000040742867,0.00008539082,0.0002613866,0.00013095824],"domain_scores_gemma":[0.9968059,0.0020365636,0.00021427823,0.0003618431,0.0005173163,0.000064210806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019754085,0.0008984173,0.0007528045,0.00036910424,0.00043325342,0.0014021664,0.0012590584,0.0009298654,0.0021084703],"category_scores_gemma":[0.0032568336,0.0003617888,0.0007148812,0.00046823057,0.0006630474,0.0014215019,0.00089253817,0.0008002121,0.00047364616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005531849,0.00021414632,0.0017704517,0.00031400373,0.00027639035,0.00040409912,0.00024045017,0.7271608,0.033118915,0.08411125,0.002954757,0.14888154],"study_design_scores_gemma":[0.00001683774,0.00016701984,0.00012066319,0.000006351004,0.000024916102,0.00009155267,0.000029725494,0.9895223,0.0029865594,0.0062521836,0.00076790154,0.000014066218],"about_ca_topic_score_codex":0.0015738118,"about_ca_topic_score_gemma":0.0022111235,"teacher_disagreement_score":0.0021084703,"about_ca_system_score_codex":0.00065927365,"about_ca_system_score_gemma":0.00060951576,"threshold_uncertainty_score":0.010447025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035711713,0.00061991916,0.95931095,0.0001910253,0.00003768847,0.000076699274,0.000022875287,0.00007306241,0.00395612],"genre_scores_gemma":[0.8994569,0.00063494063,0.096107215,0.000058346304,0.00005941968,0.00015035996,0.000029396002,0.000030762913,0.0034726425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911517,0.00044828115,0.000021807602,0.00012300839,0.00018839954,0.0001033558],"domain_scores_gemma":[0.99882025,0.00086963194,0.00009015295,0.00004124284,0.00015035232,0.000028308265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010220556,0.0010078868,0.001024588,0.00051975175,0.0005013797,0.00085276045,0.0010417606,0.0011046635,0.0011380895],"category_scores_gemma":[0.0034758297,0.00051365164,0.0003798322,0.0007234494,0.0008366083,0.0010008318,0.00083949,0.0005050655,0.00027835878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009214568,0.000046941484,0.00024963255,0.0001041484,0.00004212067,0.00018349472,0.0001216715,0.94098157,0.0035626208,0.024120675,0.0008739225,0.029620968],"study_design_scores_gemma":[0.000012242926,0.000042504445,0.00005064597,0.0000028607265,0.000007593929,0.000028420653,0.000019446503,0.992163,0.0005509771,0.0067920685,0.00032459034,0.0000056047284],"about_ca_topic_score_codex":0.001952505,"about_ca_topic_score_gemma":0.002015608,"teacher_disagreement_score":0.001952505,"about_ca_system_score_codex":0.00079116086,"about_ca_system_score_gemma":0.00067934836,"threshold_uncertainty_score":0.005740285},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29394913,0.008113177,0.6874732,0.0005966325,0.00017409341,0.00008859698,0.00005294415,0.0006537633,0.008898565],"genre_scores_gemma":[0.93397,0.0066490346,0.056631204,0.00015150967,0.00021746347,0.0000568249,0.00005844689,0.000052795116,0.0022127694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943966,0.00020103752,0.00002319598,0.000038548176,0.00023604032,0.000061513696],"domain_scores_gemma":[0.99891067,0.00065887964,0.00016248296,0.00006673371,0.00016784821,0.00003341084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000697772,0.0006164508,0.00034405832,0.0006202056,0.0003704394,0.00050817296,0.00037496662,0.0004728278,0.00044138482],"category_scores_gemma":[0.0022223473,0.00022958833,0.00024750244,0.00065678015,0.0005917848,0.0007869603,0.00044193803,0.0004133827,0.00016253807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005444741,0.00026244274,0.0039035096,0.001034476,0.00018953352,0.0005607499,0.00047400102,0.3597291,0.31306306,0.014953824,0.001964585,0.30332026],"study_design_scores_gemma":[0.000047232013,0.0030746975,0.00647124,0.00016936757,0.00041122464,0.0015374874,0.00040850704,0.72041255,0.23350148,0.017444871,0.016424295,0.00009707373],"about_ca_topic_score_codex":0.0004874362,"about_ca_topic_score_gemma":0.00064802973,"teacher_disagreement_score":0.000697772,"about_ca_system_score_codex":0.0002732617,"about_ca_system_score_gemma":0.00037174125,"threshold_uncertainty_score":0.0036902428},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002975256,0.008814758,0.96331084,0.0011967501,0.0011565308,0.0005407248,0.00030810744,0.0010452685,0.02065179],"genre_scores_gemma":[0.25773093,0.015908603,0.6780768,0.0028077702,0.0016479479,0.0059367106,0.0017751824,0.0003289446,0.03578715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808264,0.0007221478,0.00015424231,0.00019900226,0.00074714754,0.00009478212],"domain_scores_gemma":[0.99842846,0.00059364416,0.00023679552,0.00022729723,0.00046161262,0.00005216342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015056424,0.0009168871,0.0008245041,0.0009057921,0.0010059074,0.0017827996,0.0017168296,0.0015992267,0.005819507],"category_scores_gemma":[0.0029659788,0.00042510967,0.000523604,0.0015759615,0.0013544378,0.0014613952,0.0011108546,0.002313052,0.002889779],"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.0002992638,0.00017924885,0.0005394619,0.0016289578,0.00018225748,0.00074069493,0.0005678547,0.0453259,0.029068988,0.60358167,0.055553563,0.2623322],"study_design_scores_gemma":[0.00018307088,0.00042235016,0.00057792873,0.00045063058,0.00009431171,0.0010612,0.00012331762,0.40312743,0.011763467,0.14156659,0.44046476,0.0001649055],"about_ca_topic_score_codex":0.001381764,"about_ca_topic_score_gemma":0.0012290371,"teacher_disagreement_score":0.005819507,"about_ca_system_score_codex":0.0014175139,"about_ca_system_score_gemma":0.0019882661,"threshold_uncertainty_score":0.019468188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037918247,0.00015268642,0.95863265,0.00025381194,0.00004024453,0.00006711495,0.000041138515,0.00042903534,0.0024650719],"genre_scores_gemma":[0.6963019,0.00018573838,0.2994544,0.00016687902,0.00003782414,0.00014176784,0.000097866316,0.000071380724,0.0035421418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925405,0.00017819199,0.000027942768,0.000111567766,0.00031672866,0.00011145654],"domain_scores_gemma":[0.9981997,0.0008098091,0.00022238638,0.00020500759,0.0004770043,0.00008595438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008301752,0.00057716353,0.0004970912,0.0006117591,0.0005120646,0.00086945447,0.001090803,0.0011968759,0.0010767935],"category_scores_gemma":[0.002997156,0.00029311646,0.00039557347,0.00049196306,0.0010181842,0.0007129126,0.0007195858,0.0010003209,0.00034167283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003353054,0.00007422085,0.0011052965,0.00016735101,0.000087151144,0.00040186272,0.0002498649,0.7434534,0.055557214,0.109063946,0.0018101959,0.08769428],"study_design_scores_gemma":[0.000010897244,0.000042776635,0.000060717142,0.0000058521578,0.0000079321635,0.000059293438,0.0000056680506,0.9873834,0.007023485,0.0047193756,0.00067254616,0.000008090578],"about_ca_topic_score_codex":0.0031275144,"about_ca_topic_score_gemma":0.0031185863,"teacher_disagreement_score":0.0031275144,"about_ca_system_score_codex":0.0012343216,"about_ca_system_score_gemma":0.0016642206,"threshold_uncertainty_score":0.0089556575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08354025,0.00087429787,0.9098013,0.00029590447,0.000064026426,0.000093089155,0.000027515738,0.00008653733,0.0052170553],"genre_scores_gemma":[0.89103276,0.00082157314,0.10303608,0.00006298039,0.000049508795,0.0001017302,0.00003858026,0.000008406351,0.0048485114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998042,0.000054568547,0.000011797215,0.000022298687,0.00009399198,0.000013105409],"domain_scores_gemma":[0.9997981,0.00008882868,0.000037238562,0.000026771382,0.000042110067,0.0000070040223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026612394,0.00023768198,0.00023713736,0.00017326356,0.00028199615,0.00041044614,0.00043751558,0.00029660962,0.00064391847],"category_scores_gemma":[0.00047370436,0.00009586864,0.00015726806,0.00017250872,0.0003163977,0.0005209335,0.00029240444,0.00031462568,0.00014061171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033058625,0.00013285635,0.0013145757,0.0006954921,0.00009655979,0.0007499254,0.0005265941,0.21490468,0.3207453,0.24007194,0.0019515521,0.21847998],"study_design_scores_gemma":[0.00006201598,0.00041806075,0.0005098925,0.000023270346,0.000056348003,0.00062276225,0.000041075524,0.9445539,0.02973101,0.016046988,0.007901788,0.0000328623],"about_ca_topic_score_codex":0.00049135496,"about_ca_topic_score_gemma":0.0008030656,"teacher_disagreement_score":0.00064391847,"about_ca_system_score_codex":0.00035026338,"about_ca_system_score_gemma":0.00049644086,"threshold_uncertainty_score":0.0025413632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032172205,0.00010343819,0.9956411,0.000048353297,0.000019394227,0.00001963834,0.0000033424408,0.00009522269,0.0008522981],"genre_scores_gemma":[0.48161718,0.00032514724,0.5140176,0.00013451013,0.0001121058,0.0002103586,0.00003832201,0.00013201043,0.0034127352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877745,0.00045492884,0.000057400204,0.00016468733,0.00043273665,0.00011269432],"domain_scores_gemma":[0.99868387,0.00072500913,0.00011103329,0.00015793976,0.00027112366,0.00005101974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032288914,0.00079171825,0.0008977759,0.0006704866,0.0005284353,0.001346883,0.0017061149,0.00089306565,0.0018085385],"category_scores_gemma":[0.0038824843,0.00048569927,0.0006241011,0.0006512384,0.00090363325,0.0011791122,0.0013090763,0.0010995955,0.00043190503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009029853,0.000098917735,0.00023929546,0.000057621,0.00006757767,0.00009477112,0.00015022143,0.8740574,0.005802634,0.064607255,0.0010362095,0.053697757],"study_design_scores_gemma":[0.000010964303,0.000019961226,0.000019716368,0.0000017652052,0.000005511673,0.00001208527,0.000004969145,0.99550533,0.00050464494,0.0035133148,0.00039818135,0.0000035884368],"about_ca_topic_score_codex":0.0013391249,"about_ca_topic_score_gemma":0.0011939558,"teacher_disagreement_score":0.0032288914,"about_ca_system_score_codex":0.0011681508,"about_ca_system_score_gemma":0.0010186951,"threshold_uncertainty_score":0.017076194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056179017,0.0006594269,0.9327803,0.00074173894,0.00017030473,0.00011627372,0.00041343403,0.00037329746,0.008566161],"genre_scores_gemma":[0.9662555,0.0007052,0.021644693,0.00020132402,0.0001419005,0.00024045931,0.00026488033,0.000053724994,0.010492309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870026,0.00030020048,0.00005860465,0.00025623175,0.00035882878,0.00032588938],"domain_scores_gemma":[0.9985689,0.0007329244,0.00022444902,0.00009230874,0.00029482454,0.000086535365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013338501,0.0009844647,0.0011408661,0.0007132653,0.00080273167,0.0014928891,0.0021387935,0.0014591848,0.0025549824],"category_scores_gemma":[0.003377381,0.0005108643,0.0008635585,0.0007237411,0.0010000675,0.0022167198,0.0010356742,0.0013833994,0.0005289405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007372269,0.00006619087,0.00088630937,0.000054470653,0.000043645727,0.00032896645,0.0002318318,0.8453406,0.0030575355,0.14377657,0.001435266,0.0047049546],"study_design_scores_gemma":[0.000008475038,0.000012078483,0.00010177173,0.0000029480852,0.000006407717,0.00002026631,0.000014472218,0.9918229,0.00009926118,0.007570877,0.00033366022,0.0000068616],"about_ca_topic_score_codex":0.017317273,"about_ca_topic_score_gemma":0.006655797,"teacher_disagreement_score":0.017317273,"about_ca_system_score_codex":0.0024852962,"about_ca_system_score_gemma":0.001579824,"threshold_uncertainty_score":0.034432948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027873913,0.00027457063,0.9686161,0.00016086728,0.000029622028,0.000031868447,0.00004859849,0.00007297175,0.0028914083],"genre_scores_gemma":[0.86769336,0.0004900833,0.12860769,0.00010391367,0.0000620427,0.000093577124,0.00011239155,0.000021402488,0.0028155062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986205,0.0003579421,0.000071912626,0.00018177686,0.0006076004,0.00016020915],"domain_scores_gemma":[0.9971685,0.0016502897,0.00034149154,0.00046643696,0.00032378518,0.000049475388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014908577,0.0006573485,0.0008672948,0.00045659393,0.00043434784,0.0011370741,0.001061722,0.0009106559,0.0010839558],"category_scores_gemma":[0.0037026922,0.00025714026,0.0005613784,0.0009789015,0.0015665853,0.0016139975,0.0016372389,0.0012001427,0.00024193739],"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.0003318097,0.000054270793,0.00055484794,0.00019910908,0.000060002778,0.00026338478,0.00026007643,0.62604266,0.010855345,0.30029675,0.00076180586,0.06031991],"study_design_scores_gemma":[0.00002234946,0.00006461717,0.00010552,0.000020107333,0.000021892283,0.00012404312,0.000025124677,0.9642211,0.0068125064,0.027645761,0.00091893924,0.000018108743],"about_ca_topic_score_codex":0.0012761628,"about_ca_topic_score_gemma":0.0008868496,"teacher_disagreement_score":0.0014908577,"about_ca_system_score_codex":0.0010303814,"about_ca_system_score_gemma":0.0013205864,"threshold_uncertainty_score":0.007884502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11261659,0.0016760612,0.8741659,0.00054017996,0.00008046021,0.0000441098,0.00008346377,0.00013986563,0.010653343],"genre_scores_gemma":[0.9842442,0.0015235695,0.012487772,0.00005173313,0.000060739032,0.00004362374,0.000026955146,0.000016786977,0.0015445787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865615,0.00059962977,0.000050547293,0.00010625164,0.0003461083,0.00024132733],"domain_scores_gemma":[0.99619836,0.0027787127,0.00044505962,0.00019903423,0.00032633287,0.00005239742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588228,0.0011931452,0.0008212556,0.00041753103,0.0005127249,0.0017271257,0.0004357668,0.001040211,0.0010631583],"category_scores_gemma":[0.0059419284,0.0004886155,0.00055962877,0.00053698506,0.0018938989,0.0022813766,0.0014419099,0.00080019765,0.00031164332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031763248,0.00003548768,0.0013803466,0.00030017082,0.00013844388,0.0006022047,0.00022196559,0.83555883,0.016248979,0.12436056,0.0009607404,0.019874593],"study_design_scores_gemma":[0.0000118578655,0.00009492433,0.00029108184,0.000030880612,0.000035441182,0.00017356378,0.000054662207,0.98254997,0.0033320815,0.012892607,0.0005100158,0.000022835808],"about_ca_topic_score_codex":0.0010107297,"about_ca_topic_score_gemma":0.00063333876,"teacher_disagreement_score":0.0017271257,"about_ca_system_score_codex":0.0008055169,"about_ca_system_score_gemma":0.0008342035,"threshold_uncertainty_score":0.008399427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6778792,0.0019609754,0.30994433,0.00034557242,0.00003457651,0.00006538694,0.00010540339,0.00024273769,0.00942181],"genre_scores_gemma":[0.99462366,0.00028438435,0.004777483,0.000015077987,0.000006393878,0.000011667599,0.000014945191,0.000005954046,0.00026051345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.00035974343,0.000045010125,0.0000817973,0.00033909184,0.00014466536],"domain_scores_gemma":[0.99483514,0.0036808809,0.0005993297,0.00023816648,0.00059559534,0.000050880924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016810737,0.0006868967,0.0004974927,0.00044698405,0.00042595138,0.00097100984,0.0006250389,0.0008025435,0.0006359039],"category_scores_gemma":[0.0065231696,0.0001962498,0.0002733654,0.00057870947,0.00069078634,0.00061813433,0.0005140175,0.00041566414,0.0001229675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006112129,0.00007876829,0.0049717547,0.00021486389,0.00009120122,0.00046333653,0.00035187489,0.8902988,0.037800312,0.014338433,0.0004094649,0.05037002],"study_design_scores_gemma":[0.000011348328,0.00020938473,0.001189057,0.0000131726165,0.00003157654,0.00015257052,0.000045822126,0.99193525,0.0048690373,0.0013395039,0.00018937778,0.0000138495125],"about_ca_topic_score_codex":0.003302733,"about_ca_topic_score_gemma":0.0034925633,"teacher_disagreement_score":0.003302733,"about_ca_system_score_codex":0.00082186656,"about_ca_system_score_gemma":0.00069078204,"threshold_uncertainty_score":0.00889045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48384988,0.0045381365,0.47135097,0.00094770826,0.00023287465,0.00012576071,0.00033013363,0.0006116018,0.03801294],"genre_scores_gemma":[0.9632346,0.0010363659,0.03325192,0.00008767982,0.000032546715,0.000036739697,0.00014201537,0.000029501221,0.0021486385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999826,0.000040416653,0.000009891877,0.000012893372,0.00009334691,0.000017534983],"domain_scores_gemma":[0.99929655,0.00038147045,0.00010301318,0.00006843212,0.00013429213,0.000016234688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020504366,0.0001593735,0.00017333956,0.00026170007,0.00020787258,0.0003134846,0.00022156294,0.0003933447,0.002382523],"category_scores_gemma":[0.0012545312,0.00007567334,0.0001131817,0.00050581974,0.00018725476,0.0003041513,0.00015225877,0.00033018485,0.00032746376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012377136,0.00014336754,0.007598096,0.00084878964,0.000051514355,0.0012673993,0.0004453167,0.18330832,0.31269795,0.056098606,0.0049790577,0.43132386],"study_design_scores_gemma":[0.00006216947,0.0016738063,0.016564341,0.00023510332,0.00008766764,0.0035851076,0.00034971276,0.7322994,0.19191715,0.018733831,0.034393862,0.00009780388],"about_ca_topic_score_codex":0.00043091862,"about_ca_topic_score_gemma":0.00041057236,"teacher_disagreement_score":0.002382523,"about_ca_system_score_codex":0.0002754826,"about_ca_system_score_gemma":0.00030018162,"threshold_uncertainty_score":0.007970333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41315374,0.007872256,0.54362965,0.001302447,0.0001624062,0.00005022743,0.00022084247,0.00062894827,0.032979466],"genre_scores_gemma":[0.98463076,0.0011929693,0.0113426205,0.00008135153,0.00007408836,0.000024635772,0.00006399089,0.000041013736,0.0025486369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856466,0.00047812576,0.000033531524,0.000108928274,0.0006082662,0.00020646148],"domain_scores_gemma":[0.9933137,0.0048634904,0.0004777119,0.0003104302,0.00096033665,0.00007436801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107378,0.0010317665,0.00089698425,0.0010190075,0.0005803931,0.0012402968,0.00068708917,0.0014700651,0.0021720643],"category_scores_gemma":[0.008770657,0.00035440002,0.00040301945,0.0007917914,0.0015158404,0.0012622079,0.00090327684,0.0007303986,0.00049788813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025642593,0.000038517792,0.0014591917,0.00016707783,0.00006616207,0.00023773652,0.00017211189,0.9342253,0.010338583,0.037358068,0.0005264384,0.0151543],"study_design_scores_gemma":[0.000010853463,0.00007256839,0.0010532386,0.000023438492,0.000017419006,0.00013308694,0.000026014213,0.98910224,0.0024601263,0.0067449906,0.00033610596,0.000019788058],"about_ca_topic_score_codex":0.0028908316,"about_ca_topic_score_gemma":0.0013918092,"teacher_disagreement_score":0.0028908316,"about_ca_system_score_codex":0.0017298037,"about_ca_system_score_gemma":0.0008575615,"threshold_uncertainty_score":0.012550652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05708561,0.0134795075,0.91567606,0.0005865366,0.00018242998,0.00017275929,0.0001436127,0.00083925953,0.011834215],"genre_scores_gemma":[0.74195504,0.013831328,0.23831098,0.00018614608,0.00020574019,0.00012105965,0.00020718641,0.000068115995,0.005114394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999286,0.00016344356,0.00006609211,0.000094804665,0.00030978597,0.00007983398],"domain_scores_gemma":[0.99943286,0.00018765884,0.00011478305,0.00012234133,0.00011356279,0.0000288092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725764,0.000511834,0.00048447648,0.00094229134,0.0004502465,0.0017522983,0.0007798433,0.0005443022,0.0008588077],"category_scores_gemma":[0.0017906211,0.00031548622,0.00046621438,0.0011256867,0.0006747549,0.0022495238,0.00094316487,0.0005756807,0.0002312199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034023335,0.00009906772,0.0033570912,0.000962342,0.00013794664,0.00043836588,0.0004227119,0.32289052,0.052182402,0.16568333,0.003929725,0.44955635],"study_design_scores_gemma":[0.000023003948,0.00056773715,0.003272927,0.00018143114,0.00019900104,0.00074703543,0.000242781,0.84451014,0.03126903,0.06318861,0.05568586,0.00011238499],"about_ca_topic_score_codex":0.0020626464,"about_ca_topic_score_gemma":0.0014550713,"teacher_disagreement_score":0.0020626464,"about_ca_system_score_codex":0.0010004658,"about_ca_system_score_gemma":0.00043136065,"threshold_uncertainty_score":0.007258892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12676325,0.00017778628,0.87069666,0.00007977184,0.000032422435,0.00005877011,0.000033630375,0.0005452498,0.0016123685],"genre_scores_gemma":[0.69345754,0.0001476378,0.30259117,0.00003116787,0.000021332884,0.0000541057,0.0000864831,0.0000268289,0.0035837786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993255,0.00018677227,0.000028268942,0.00011857507,0.00025547837,0.00008536221],"domain_scores_gemma":[0.998978,0.00053010223,0.0001539436,0.00010865001,0.00017365071,0.00005564881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078656676,0.0005429765,0.0005169918,0.0004083916,0.00058247155,0.0007194257,0.0005052793,0.00090979686,0.0012616658],"category_scores_gemma":[0.0024544485,0.0002986188,0.00034762739,0.0003822613,0.0007069814,0.0011983681,0.0011724008,0.00069266773,0.00051545457],"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.00034832838,0.00006428396,0.0019798966,0.00006393089,0.00005008054,0.00042729726,0.00018785479,0.88522154,0.025115715,0.0057157706,0.00024196347,0.080583364],"study_design_scores_gemma":[0.000008119779,0.00007015569,0.00044836118,0.000005334805,0.000009473656,0.00011828092,0.000009963629,0.9882272,0.010023206,0.000742942,0.0003249459,0.000011960404],"about_ca_topic_score_codex":0.0052714106,"about_ca_topic_score_gemma":0.006424382,"teacher_disagreement_score":0.0052714106,"about_ca_system_score_codex":0.000695954,"about_ca_system_score_gemma":0.0009069722,"threshold_uncertainty_score":0.010481417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5799385,0.0020210135,0.4082851,0.00014592001,0.000048438196,0.000022841166,0.000031289175,0.0002710701,0.0092358515],"genre_scores_gemma":[0.99002904,0.0004498745,0.00833225,0.000024341261,0.00001653854,0.000010768837,0.000009966691,0.000010141172,0.0011171387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993186,0.00022812233,0.000023836428,0.00006773576,0.0002056557,0.0001561094],"domain_scores_gemma":[0.9984567,0.0009772102,0.00023654559,0.00010872191,0.00017448433,0.00004637059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006481573,0.00044841217,0.0006387645,0.000558858,0.0007017857,0.0013255917,0.00040882025,0.0008210838,0.0005602196],"category_scores_gemma":[0.0024663752,0.00026995258,0.0003395728,0.0007038091,0.0011393733,0.001195441,0.0009564292,0.00041311266,0.0002245403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093697564,0.00011812743,0.0102841295,0.00024125726,0.00014206038,0.004650384,0.00089712994,0.7803207,0.06738428,0.07989907,0.0008701502,0.054255713],"study_design_scores_gemma":[0.000030730123,0.00023437635,0.0025420142,0.000034837234,0.000082034094,0.0016986185,0.00028243347,0.9587376,0.021849448,0.012685126,0.0017692425,0.000053543758],"about_ca_topic_score_codex":0.001226129,"about_ca_topic_score_gemma":0.0010685063,"teacher_disagreement_score":0.0013255917,"about_ca_system_score_codex":0.00045042657,"about_ca_system_score_gemma":0.00027865433,"threshold_uncertainty_score":0.0034278035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03843681,0.00032070852,0.9586984,0.00006394394,0.000018014864,0.000030483772,0.000010656621,0.000067675785,0.0023533164],"genre_scores_gemma":[0.92258686,0.00021055053,0.075725734,0.000026149952,0.000023616312,0.000039409108,0.000013114744,0.000026426376,0.0013481539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993406,0.00027009557,0.0000346352,0.00011195049,0.00017011417,0.000072519004],"domain_scores_gemma":[0.999199,0.0004622741,0.00014988812,0.00008278965,0.00008508207,0.000021078356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068678835,0.000790642,0.00063264224,0.00026363894,0.0002888093,0.00067247014,0.000814912,0.0005547675,0.00083530473],"category_scores_gemma":[0.0016966972,0.0002663552,0.00025290452,0.00032480413,0.00046138107,0.00089314947,0.00066258974,0.0004939196,0.0002625215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016794812,0.00005974992,0.0006651973,0.00013462978,0.00004470067,0.00016795324,0.00015107758,0.84472996,0.03520619,0.019259172,0.0003954882,0.09901787],"study_design_scores_gemma":[0.000017495293,0.000112393165,0.00029901337,0.000011907713,0.000014052664,0.00009733573,0.00003004808,0.9827483,0.008092058,0.0076731713,0.000891952,0.00001239039],"about_ca_topic_score_codex":0.00032442692,"about_ca_topic_score_gemma":0.0004920177,"teacher_disagreement_score":0.00083530473,"about_ca_system_score_codex":0.00042699417,"about_ca_system_score_gemma":0.00028035662,"threshold_uncertainty_score":0.0036321878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041777175,0.004608386,0.98759973,0.00025965174,0.00011334553,0.000037030994,0.00014585686,0.0003161295,0.0027421198],"genre_scores_gemma":[0.49929243,0.012976427,0.47581813,0.00087233103,0.0007484605,0.0007424702,0.0016460032,0.00045846685,0.0074452506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99095774,0.0022415824,0.0005356902,0.0015228817,0.0037896228,0.0009523808],"domain_scores_gemma":[0.96874857,0.02033025,0.001977239,0.0033638126,0.0051780795,0.00040207573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071041835,0.002214701,0.0023091983,0.0024157132,0.0011085992,0.0031934814,0.0023850582,0.0025361436,0.003440853],"category_scores_gemma":[0.04246368,0.0009499631,0.0012229792,0.0032090324,0.0032384358,0.0030397305,0.003048487,0.0035716135,0.0024235891],"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.00088317733,0.00012047595,0.0021775,0.0016028296,0.00038040668,0.000484726,0.00041703507,0.64412755,0.015804676,0.13400461,0.0069647976,0.19303218],"study_design_scores_gemma":[0.000051476043,0.00025699392,0.0016920579,0.00033572887,0.000107215834,0.0005038455,0.0001210761,0.9301183,0.014336274,0.040258996,0.012062899,0.00015515464],"about_ca_topic_score_codex":0.0046740607,"about_ca_topic_score_gemma":0.0033177715,"teacher_disagreement_score":0.0071041835,"about_ca_system_score_codex":0.0022488495,"about_ca_system_score_gemma":0.0044171847,"threshold_uncertainty_score":0.037571013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010733607,0.000106776424,0.9880002,0.000051870906,0.000012229065,0.000015070136,0.000009196319,0.000059438305,0.001011532],"genre_scores_gemma":[0.92588747,0.00017586161,0.072656356,0.000090061745,0.000027849957,0.00010282119,0.000030784526,0.000028637332,0.0010001957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983,0.00057588523,0.00008292108,0.0003677741,0.00043392627,0.0002394975],"domain_scores_gemma":[0.99842876,0.0007087103,0.00038462962,0.0001271541,0.00028359971,0.00006706118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847769,0.0013888718,0.0011194657,0.0004279791,0.00037214175,0.0013359077,0.0013593232,0.0010342011,0.0005952726],"category_scores_gemma":[0.003669945,0.00066649367,0.00078041025,0.0006203643,0.0012843822,0.0013658818,0.0017611,0.0010120542,0.00017809936],"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.00010377004,0.000037434136,0.00019370754,0.000059131802,0.000053418837,0.00006746575,0.00007331017,0.96349263,0.004888764,0.011936708,0.00022861207,0.018864928],"study_design_scores_gemma":[0.000011848692,0.00007732983,0.000057063768,0.0000040580844,0.0000095958585,0.000016811793,0.000009099162,0.9953809,0.0012331901,0.0030258745,0.00016662544,0.000007682993],"about_ca_topic_score_codex":0.0015104517,"about_ca_topic_score_gemma":0.0008305249,"teacher_disagreement_score":0.001847769,"about_ca_system_score_codex":0.0006915254,"about_ca_system_score_gemma":0.0011536232,"threshold_uncertainty_score":0.009772062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79760563,0.0014406721,0.19327478,0.00024156198,0.000035874382,0.000041351293,0.00016822686,0.00037140612,0.0068205344],"genre_scores_gemma":[0.9902194,0.00032899354,0.008614705,0.00002201674,0.000009623879,0.000011947793,0.000053796637,0.000010693469,0.0007288128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984993,0.00056402094,0.000058698173,0.00012488918,0.0005250144,0.0002281062],"domain_scores_gemma":[0.9881762,0.009158936,0.0010704859,0.0005935172,0.0008692745,0.00013164709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027148228,0.0007958695,0.00073810143,0.00073993177,0.000563847,0.00086848193,0.0004804719,0.0006865178,0.000713215],"category_scores_gemma":[0.009372154,0.00023797173,0.00031381505,0.0010754756,0.001400571,0.00078826555,0.0007514385,0.00041133803,0.00022150994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036866404,0.000018785197,0.004178836,0.000042595355,0.00003194068,0.00013082872,0.0001062151,0.9748892,0.0049026185,0.0071784137,0.00016484383,0.007987125],"study_design_scores_gemma":[0.00002621053,0.00012430188,0.002219565,0.000013475963,0.000024850895,0.00014562455,0.000046070763,0.9890366,0.0049844286,0.003223597,0.00012623925,0.000028996343],"about_ca_topic_score_codex":0.0067336233,"about_ca_topic_score_gemma":0.0047235065,"teacher_disagreement_score":0.0067336233,"about_ca_system_score_codex":0.0012029856,"about_ca_system_score_gemma":0.0013927096,"threshold_uncertainty_score":0.014357567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1589002,0.0033137305,0.8115131,0.0010497688,0.00015347087,0.000062725965,0.00020143029,0.0003569404,0.024448555],"genre_scores_gemma":[0.97151864,0.0017781337,0.021680705,0.00012725664,0.00009393166,0.00009920489,0.00012114425,0.000086084976,0.0044949106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983931,0.00047701006,0.00006598861,0.00021784374,0.0005962879,0.00024975694],"domain_scores_gemma":[0.99142444,0.0061772116,0.0006562076,0.00041019588,0.0012248569,0.00010706284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023975645,0.0012657619,0.0012935337,0.0011715919,0.00072478154,0.0017327978,0.000917043,0.0014061454,0.0023002743],"category_scores_gemma":[0.0134136705,0.00029910146,0.0004887296,0.00075553055,0.0015463582,0.0021679034,0.0012552888,0.0014051502,0.0004543469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002170853,0.000041356445,0.00090969267,0.00033943588,0.00006164391,0.00034175668,0.00033897263,0.82787526,0.015177429,0.1391843,0.0012521576,0.014260929],"study_design_scores_gemma":[0.0000075103912,0.00005828287,0.00036164213,0.00004535591,0.000018522302,0.00017369098,0.000054244898,0.9798019,0.002956721,0.016067116,0.00043032,0.00002466913],"about_ca_topic_score_codex":0.0018625443,"about_ca_topic_score_gemma":0.0009895199,"teacher_disagreement_score":0.0023975645,"about_ca_system_score_codex":0.0015575872,"about_ca_system_score_gemma":0.0009613086,"threshold_uncertainty_score":0.012679696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12010854,0.0007652413,0.8589866,0.0003654538,0.00015279916,0.00010602648,0.00014032515,0.00022613695,0.019148912],"genre_scores_gemma":[0.8166549,0.0005666886,0.17463407,0.0003279529,0.00010280069,0.00018758813,0.00025758462,0.00007202253,0.007196428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985055,0.000350779,0.00010099401,0.00015995042,0.00070282805,0.0001799879],"domain_scores_gemma":[0.9953969,0.0020973047,0.0005925632,0.0008034746,0.00093926926,0.00017043666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008055818,0.0008285389,0.00042217772,0.0009536353,0.0005870957,0.0014047079,0.0006614739,0.0008640362,0.0015901036],"category_scores_gemma":[0.0048378003,0.00024260936,0.00037422404,0.0009297662,0.0011506019,0.00082712184,0.0013103879,0.00096261874,0.00065883243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092528487,0.00016112051,0.0016795947,0.00024942958,0.000077427176,0.00040677644,0.0003286601,0.26663253,0.08152453,0.49437183,0.0018963075,0.15174657],"study_design_scores_gemma":[0.00011821563,0.0006736774,0.0008731737,0.00016747213,0.00006172776,0.0011064878,0.00008681846,0.6849083,0.123679474,0.15877219,0.029414436,0.00013802234],"about_ca_topic_score_codex":0.0009918677,"about_ca_topic_score_gemma":0.0008914622,"teacher_disagreement_score":0.0015901036,"about_ca_system_score_codex":0.000909972,"about_ca_system_score_gemma":0.000982899,"threshold_uncertainty_score":0.006602347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005975024,0.00041000583,0.9889042,0.00029724342,0.000038388112,0.000019920677,0.00001322754,0.000033134056,0.0043089977],"genre_scores_gemma":[0.7078078,0.0015096923,0.28176773,0.0003857799,0.00014808783,0.00023913787,0.00004658573,0.0000899979,0.008005171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957496,0.00018329322,0.000010917693,0.000060192193,0.00010228525,0.00006836436],"domain_scores_gemma":[0.99924767,0.0006074601,0.000051151805,0.00001926503,0.000055306708,0.000019204386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110297,0.00087477564,0.001012904,0.00056798686,0.00045857555,0.0013959769,0.00071485253,0.0011931122,0.0014977069],"category_scores_gemma":[0.0024996498,0.00046529755,0.00071589835,0.00077445136,0.001135602,0.001062651,0.00074368477,0.0013232001,0.00015001424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027853808,0.000024375842,0.000078236626,0.000048584436,0.000015371466,0.00003830998,0.000042367366,0.9408106,0.00077125337,0.045857377,0.00044744016,0.011838247],"study_design_scores_gemma":[0.000004206841,0.000010314257,0.000016529077,0.000005937724,0.0000031165064,0.0000073250653,0.000008356143,0.9848973,0.000154495,0.01449909,0.00039010425,0.0000032480425],"about_ca_topic_score_codex":0.0030658538,"about_ca_topic_score_gemma":0.0019999375,"teacher_disagreement_score":0.0030658538,"about_ca_system_score_codex":0.001169522,"about_ca_system_score_gemma":0.001051143,"threshold_uncertainty_score":0.008485496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62017417,0.004281497,0.35464317,0.0011658751,0.00018394963,0.00013721174,0.00029214832,0.0005556035,0.018566435],"genre_scores_gemma":[0.9903572,0.00032393035,0.008307336,0.000043712833,0.000010807619,0.000011690058,0.000030240386,0.0000071741633,0.00090777193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879456,0.0004807866,0.00004844237,0.0001510462,0.00027361317,0.00025150715],"domain_scores_gemma":[0.9968119,0.0020238475,0.0003000117,0.0003294481,0.00045388768,0.000080777725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197,0.0010356703,0.0010134093,0.0005572511,0.00072523305,0.0010073935,0.00085683906,0.0014090945,0.0015328045],"category_scores_gemma":[0.0040858844,0.0002260474,0.0004270251,0.00060950674,0.0013101676,0.0012461565,0.0013544268,0.00070137315,0.00018279749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012302195,0.00010369554,0.002493159,0.00034868586,0.00023214155,0.00062566355,0.00059073966,0.8440059,0.042617712,0.048120935,0.0014508798,0.058180276],"study_design_scores_gemma":[0.000058033853,0.0005736657,0.000700121,0.000025413628,0.00007179262,0.00053331576,0.00009672294,0.9773496,0.011334657,0.008480006,0.0007174023,0.000059322214],"about_ca_topic_score_codex":0.004481012,"about_ca_topic_score_gemma":0.0033110233,"teacher_disagreement_score":0.004481012,"about_ca_system_score_codex":0.0009676482,"about_ca_system_score_gemma":0.000989336,"threshold_uncertainty_score":0.011618972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29275295,0.0028834075,0.67737484,0.0007238593,0.000095079704,0.000094232884,0.0002798092,0.0003836374,0.025412256],"genre_scores_gemma":[0.99007726,0.0007586476,0.007645778,0.000048342594,0.00003479238,0.00002802309,0.000044563367,0.00002169808,0.0013407685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998502,0.0006166896,0.00003899613,0.0001227389,0.00048684815,0.0002327443],"domain_scores_gemma":[0.9944606,0.0037508216,0.00053424994,0.0003187063,0.0008396576,0.00009590968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020127955,0.0013254377,0.0006826141,0.00080305827,0.00047535152,0.0012355079,0.0007930229,0.00094097474,0.0016079381],"category_scores_gemma":[0.006918238,0.00034213424,0.0005660429,0.0007721845,0.001243288,0.0011351228,0.001043301,0.0007129473,0.0003393804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022033426,0.00003844939,0.0015343695,0.00013364523,0.0000713279,0.00035072063,0.0001333865,0.933279,0.009211922,0.043421444,0.00050183194,0.011103627],"study_design_scores_gemma":[0.0000039921288,0.000079911595,0.00040673063,0.000014509344,0.000019510457,0.00013643551,0.000026818518,0.9932355,0.0022333937,0.0036281163,0.00020282106,0.000012273706],"about_ca_topic_score_codex":0.0019760074,"about_ca_topic_score_gemma":0.0011719944,"teacher_disagreement_score":0.0020127955,"about_ca_system_score_codex":0.0015571008,"about_ca_system_score_gemma":0.000840802,"threshold_uncertainty_score":0.011297584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04548602,0.0034537162,0.9380219,0.00034091732,0.00015579586,0.000101154634,0.00007292777,0.0002701844,0.012097397],"genre_scores_gemma":[0.93093866,0.0017465105,0.063584045,0.00011057594,0.000079113735,0.00010032035,0.00006156608,0.000010421995,0.0033688236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970824,0.0000956715,0.000016539989,0.00004793775,0.00009477944,0.00003676388],"domain_scores_gemma":[0.9995272,0.00023829709,0.0000546629,0.000067934554,0.00010005007,0.000011755643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000367317,0.0003607941,0.00026757515,0.00033753348,0.0002703286,0.00046264613,0.00080303155,0.0005711595,0.0010416157],"category_scores_gemma":[0.0013953747,0.0001040869,0.00023912989,0.00038624695,0.00029812183,0.0004102607,0.0003168381,0.0004094798,0.00028004457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024122698,0.00012095774,0.0008748799,0.00040806152,0.00011110116,0.00078302575,0.00028511582,0.35595515,0.05793748,0.22223409,0.007143592,0.35390526],"study_design_scores_gemma":[0.000035150788,0.00017407915,0.00037278765,0.00002385536,0.000040219333,0.00045718325,0.000030749692,0.9440506,0.0045917733,0.040545557,0.009648945,0.000029180488],"about_ca_topic_score_codex":0.0010939019,"about_ca_topic_score_gemma":0.0013339791,"teacher_disagreement_score":0.0010939019,"about_ca_system_score_codex":0.00043536985,"about_ca_system_score_gemma":0.0003862699,"threshold_uncertainty_score":0.0034845471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03278088,0.0010230503,0.9625479,0.00016753863,0.00007492612,0.00005985573,0.000028718516,0.00015511838,0.0031620692],"genre_scores_gemma":[0.84451234,0.00088502304,0.15066162,0.00016394623,0.00006735118,0.00008279251,0.00006412309,0.000013125012,0.0035496475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944097,0.00022539074,0.00003260787,0.000075970966,0.00017103904,0.00005389666],"domain_scores_gemma":[0.99941826,0.00022382113,0.0000781446,0.00011447626,0.00014448084,0.000020829293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007018884,0.00059445755,0.00047185237,0.00035045948,0.00049338274,0.00046186778,0.0009537057,0.0006878577,0.0008675891],"category_scores_gemma":[0.0010177303,0.00020462647,0.0004011218,0.00046421305,0.0004173884,0.00063195196,0.00055705436,0.00045355005,0.00025022254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038166015,0.0002447706,0.00091649726,0.00042122867,0.00024176981,0.0011906936,0.0006511825,0.39190334,0.13318244,0.15015797,0.0044190693,0.3162893],"study_design_scores_gemma":[0.000040973457,0.00042947943,0.00026655724,0.00001856343,0.000062212595,0.0005862366,0.000035929024,0.9621977,0.016715081,0.0141681675,0.005436082,0.00004301129],"about_ca_topic_score_codex":0.0006187815,"about_ca_topic_score_gemma":0.0016703113,"teacher_disagreement_score":0.0009537057,"about_ca_system_score_codex":0.00048511676,"about_ca_system_score_gemma":0.00043741762,"threshold_uncertainty_score":0.0037119985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014300862,0.00010976967,0.99780446,0.000059189366,0.000011493351,0.000007868385,0.0000149790085,0.000072097944,0.0004900643],"genre_scores_gemma":[0.18276057,0.0010405761,0.8114081,0.00018292895,0.00022102764,0.00016573952,0.0003213727,0.00015338957,0.003746363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980134,0.0009951501,0.0000834635,0.00028120028,0.0005178783,0.00010889908],"domain_scores_gemma":[0.997934,0.0011872817,0.0001719162,0.0003107963,0.00034508607,0.000050951687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016387048,0.00093517324,0.001091398,0.0006020832,0.00045608322,0.0010622091,0.0007715023,0.00081275526,0.0023806796],"category_scores_gemma":[0.00572214,0.0004361171,0.00082103565,0.0011035079,0.0012865283,0.0015079316,0.0013581696,0.0017086343,0.0009322908],"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.00018907235,0.00005102503,0.0005215862,0.00026926448,0.0001426812,0.00026192944,0.00038203594,0.58742625,0.013006225,0.16729124,0.0039411155,0.22651753],"study_design_scores_gemma":[0.000017353692,0.000049695347,0.00014645413,0.000016704027,0.000015227519,0.00015106318,0.000031602718,0.94887185,0.0042646057,0.04167095,0.0047320765,0.000032403845],"about_ca_topic_score_codex":0.0017427896,"about_ca_topic_score_gemma":0.001548921,"teacher_disagreement_score":0.0023806796,"about_ca_system_score_codex":0.00047741248,"about_ca_system_score_gemma":0.0010762274,"threshold_uncertainty_score":0.008666456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6979913,0.004338961,0.26736194,0.0008331976,0.000116843825,0.000051303454,0.00021257554,0.0008179928,0.02827588],"genre_scores_gemma":[0.99385816,0.00047211963,0.004930292,0.00003539231,0.000026996324,0.00000808358,0.000029519877,0.0000167569,0.0006226713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983246,0.00060616113,0.000037584334,0.00014509528,0.0005570873,0.00032943618],"domain_scores_gemma":[0.9957903,0.0027665982,0.0004499658,0.0002895043,0.000626568,0.000077103985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020450552,0.0011412394,0.0008378605,0.00054823124,0.0006084913,0.0014361899,0.00052160147,0.0010321087,0.0009235422],"category_scores_gemma":[0.007620838,0.00030022167,0.00027363558,0.0006626472,0.0009685128,0.0013212872,0.0008709183,0.0005087713,0.00033026293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008248571,0.0001252023,0.007842616,0.00018704633,0.00012261604,0.00027161845,0.00024652423,0.88624495,0.022335969,0.027072107,0.00093041477,0.053796057],"study_design_scores_gemma":[0.000023597453,0.0002946416,0.002230731,0.000020855046,0.00003675562,0.00023497533,0.000068572015,0.9786211,0.01144532,0.006324559,0.0006591004,0.000039792933],"about_ca_topic_score_codex":0.0022229913,"about_ca_topic_score_gemma":0.0013529178,"teacher_disagreement_score":0.0022229913,"about_ca_system_score_codex":0.00097061624,"about_ca_system_score_gemma":0.00067691965,"threshold_uncertainty_score":0.010815382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04123652,0.0004553573,0.95273846,0.00022960412,0.000099103505,0.000053412485,0.00003612984,0.000113074995,0.005038263],"genre_scores_gemma":[0.914528,0.00035056967,0.08179197,0.00008008301,0.00008323266,0.000060695333,0.000037771686,0.000033097782,0.0030345889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994305,0.00022276722,0.000023671068,0.00008433256,0.00011555544,0.00012315567],"domain_scores_gemma":[0.99916863,0.00044394803,0.00009594651,0.000046091915,0.00019124638,0.000054097713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011116401,0.00055224966,0.000747413,0.000342518,0.00061380875,0.00086794747,0.0008222073,0.00060735364,0.0018097839],"category_scores_gemma":[0.0023216212,0.000215176,0.00032747563,0.00060477253,0.00047415908,0.00064573257,0.0007311977,0.00055932294,0.00021277675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001204112,0.00005567553,0.0003049713,0.000068542635,0.000024541345,0.00010911421,0.000094007984,0.94150656,0.004871132,0.022125527,0.0013241076,0.02939535],"study_design_scores_gemma":[0.000006799131,0.00003067493,0.000051127055,0.0000023339985,0.0000046453233,0.000013294659,0.000015327867,0.9963715,0.0005572837,0.0026830195,0.00026103796,0.0000030621225],"about_ca_topic_score_codex":0.0037608158,"about_ca_topic_score_gemma":0.003549322,"teacher_disagreement_score":0.0037608158,"about_ca_system_score_codex":0.0010481756,"about_ca_system_score_gemma":0.001583713,"threshold_uncertainty_score":0.007605076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019851675,0.0023621304,0.96908844,0.00044496614,0.0002688451,0.00018701267,0.00010994516,0.0008187728,0.0068681664],"genre_scores_gemma":[0.80163133,0.002677605,0.18618517,0.00035673712,0.00022005149,0.0006294818,0.0003993262,0.00008189666,0.007818287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990109,0.00035137052,0.000054213837,0.0001048263,0.00037643063,0.000102181635],"domain_scores_gemma":[0.99864584,0.0006378131,0.00015201062,0.00015670349,0.00035896924,0.00004867948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010966903,0.0004719068,0.0005765477,0.00055590126,0.00051071215,0.0007206117,0.0009058564,0.00064149464,0.0017735291],"category_scores_gemma":[0.0034386234,0.00019379215,0.00036250177,0.0007298333,0.00076420023,0.00087638624,0.0007558467,0.0010704553,0.00039109943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041687972,0.00018876724,0.0010924547,0.00045572326,0.00012873224,0.0006802951,0.00060601695,0.5631115,0.034895204,0.21521744,0.013319169,0.16988777],"study_design_scores_gemma":[0.000051897114,0.0001981915,0.00027776894,0.000035029316,0.000044772853,0.00024398995,0.000025058593,0.9615878,0.003051168,0.020901937,0.013543661,0.00003880958],"about_ca_topic_score_codex":0.0032840518,"about_ca_topic_score_gemma":0.0041196113,"teacher_disagreement_score":0.0032840518,"about_ca_system_score_codex":0.0010301494,"about_ca_system_score_gemma":0.0011542691,"threshold_uncertainty_score":0.0074743032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04194942,0.0009713838,0.9506015,0.0001738066,0.00007096816,0.00006929167,0.00008501548,0.00012612002,0.0059524905],"genre_scores_gemma":[0.9458316,0.0005477196,0.050449777,0.00008102973,0.000045835575,0.00006740832,0.000055792083,0.0000112193975,0.0029095341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986469,0.00053479685,0.00005871245,0.00034999076,0.00024582352,0.00016384358],"domain_scores_gemma":[0.99759287,0.0015637713,0.00024731355,0.0002527948,0.00027930032,0.00006386297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015266511,0.001004457,0.00138723,0.00048418704,0.0004920428,0.000980077,0.0016904442,0.0017960867,0.0013821747],"category_scores_gemma":[0.0036172417,0.00031831895,0.0005990777,0.00066307303,0.0010056176,0.001366449,0.0011705562,0.00063976797,0.00028295573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005193953,0.00009864586,0.0007477588,0.00042212565,0.00016453376,0.0008667964,0.00026876834,0.82750463,0.01914821,0.086102515,0.0015262914,0.06263043],"study_design_scores_gemma":[0.000025763498,0.0001326001,0.00015928697,0.000011481136,0.00003211984,0.0003227409,0.000038178194,0.97927356,0.0036816169,0.015286672,0.0010137775,0.000022132876],"about_ca_topic_score_codex":0.0012563242,"about_ca_topic_score_gemma":0.0009424867,"teacher_disagreement_score":0.0017960867,"about_ca_system_score_codex":0.0006260339,"about_ca_system_score_gemma":0.0008705209,"threshold_uncertainty_score":0.008073807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046204664,0.00012008935,0.952221,0.00013740189,0.000019994077,0.000021593612,0.000025846834,0.00015756149,0.0010917463],"genre_scores_gemma":[0.6912616,0.0002659755,0.30602053,0.00007350262,0.000039241266,0.00006820115,0.000110787994,0.000025342784,0.0021348663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998117,0.000065886794,0.000006240401,0.000021994007,0.00007794192,0.000016335021],"domain_scores_gemma":[0.99958843,0.00023711426,0.000055053613,0.000030147161,0.00007634674,0.0000128346055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037596686,0.0003452825,0.0003444896,0.00021942658,0.0001594521,0.0003357897,0.00031339916,0.00047039465,0.00054361916],"category_scores_gemma":[0.0013280686,0.00018079126,0.00025750019,0.00026862905,0.0003147121,0.00049465324,0.00043750645,0.00045781143,0.00012142663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020912709,0.00005066139,0.00060825597,0.00009980726,0.000028178278,0.00010081074,0.0001057783,0.8389104,0.025259884,0.010498291,0.0010164643,0.12311235],"study_design_scores_gemma":[0.0000043319374,0.000016110105,0.00007435864,0.0000017216278,0.0000019632955,0.00001627312,0.000005146801,0.99692184,0.0022163333,0.0005918553,0.00014687167,0.0000031978523],"about_ca_topic_score_codex":0.0021585915,"about_ca_topic_score_gemma":0.0020593952,"teacher_disagreement_score":0.0021585915,"about_ca_system_score_codex":0.00025185538,"about_ca_system_score_gemma":0.00064821873,"threshold_uncertainty_score":0.0042920113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060559373,0.0026406285,0.91495025,0.00048526848,0.0002063343,0.00013449742,0.00009198977,0.00053911575,0.020392625],"genre_scores_gemma":[0.6503075,0.001852653,0.33238107,0.0005646814,0.00033545023,0.0001598296,0.00023370163,0.000033708875,0.0141314855],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965215,0.000072634175,0.000014755613,0.000052289204,0.00018211534,0.000026025355],"domain_scores_gemma":[0.99979943,0.000042506665,0.000037414608,0.00004472905,0.00006335383,0.000012522215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003200843,0.00041311482,0.00034113566,0.00044345303,0.0004184635,0.0004945629,0.0005545343,0.00047546232,0.0019030826],"category_scores_gemma":[0.000404366,0.00013700147,0.00030917258,0.0006185135,0.00030172296,0.0005384917,0.0004624191,0.0005419251,0.0008806113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037341626,0.00012056777,0.0012800604,0.00030132846,0.00014142026,0.00045773038,0.00024975935,0.023239193,0.5154253,0.0686978,0.004120167,0.38559327],"study_design_scores_gemma":[0.0001449679,0.0021541123,0.0047288826,0.00012330951,0.00033838706,0.00495101,0.00007994214,0.46047977,0.3863115,0.031926896,0.10856768,0.00019358983],"about_ca_topic_score_codex":0.00019456308,"about_ca_topic_score_gemma":0.00039261344,"teacher_disagreement_score":0.0019030826,"about_ca_system_score_codex":0.000356996,"about_ca_system_score_gemma":0.00027468897,"threshold_uncertainty_score":0.0063664317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002262713,0.00022935886,0.9967168,0.000031401327,0.00003935977,0.0000127729945,0.000010397887,0.00021915148,0.00047794354],"genre_scores_gemma":[0.2303454,0.00066160306,0.763599,0.00009582216,0.00012641036,0.000096434815,0.00009055274,0.00007128325,0.0049135224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995245,0.00013827295,0.000022299891,0.00007229486,0.00019918979,0.000043447446],"domain_scores_gemma":[0.99955016,0.00018802144,0.000049490987,0.00009438141,0.00010065579,0.000017317521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000494434,0.00047352715,0.0004960541,0.000401945,0.00035993318,0.000677879,0.0004685529,0.0006874186,0.002011254],"category_scores_gemma":[0.0016428769,0.00021761807,0.00039067704,0.0003486694,0.0005780421,0.00081550155,0.0007258208,0.0008391588,0.00087872794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000504764,0.00007878352,0.0005692905,0.00029219338,0.00010907498,0.00015941521,0.00017325145,0.21192777,0.13926715,0.061567042,0.004683267,0.58066803],"study_design_scores_gemma":[0.000038159797,0.00012972592,0.00041041066,0.000031765583,0.000040046078,0.00029034444,0.00001780634,0.92296946,0.052792758,0.013352413,0.009871292,0.000055879358],"about_ca_topic_score_codex":0.000724252,"about_ca_topic_score_gemma":0.0011100104,"teacher_disagreement_score":0.002011254,"about_ca_system_score_codex":0.00035887465,"about_ca_system_score_gemma":0.000574154,"threshold_uncertainty_score":0.0067282915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022210017,0.00027594762,0.96809846,0.0003817833,0.000043751614,0.000056691308,0.00007743833,0.0001675994,0.008688287],"genre_scores_gemma":[0.86486703,0.000380253,0.13024612,0.00010103712,0.00004634184,0.000094094095,0.000103573024,0.000047614856,0.004114047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991134,0.00034208645,0.000035498182,0.00017326695,0.00023053301,0.000105145446],"domain_scores_gemma":[0.99811244,0.0011094573,0.00026468397,0.000146613,0.0002931076,0.00007370013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011269222,0.0012563888,0.00095212413,0.00038539493,0.00041191504,0.0015295073,0.0008762935,0.0013719212,0.0034278736],"category_scores_gemma":[0.0034490922,0.00045285988,0.0004476763,0.00058000605,0.001165596,0.0013887455,0.0009458051,0.0012695676,0.00092715473],"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.0003744678,0.0000970235,0.00035613065,0.00019819672,0.000051168572,0.0004066585,0.00012263855,0.85073465,0.018242583,0.088778414,0.0022999074,0.03833806],"study_design_scores_gemma":[0.000024365234,0.00007274337,0.00006372952,0.000008402047,0.000009317538,0.00007158582,0.000018792029,0.98827934,0.002663998,0.008320249,0.00045325558,0.000014241068],"about_ca_topic_score_codex":0.0019665528,"about_ca_topic_score_gemma":0.0017930161,"teacher_disagreement_score":0.0034278736,"about_ca_system_score_codex":0.0010862144,"about_ca_system_score_gemma":0.0011558925,"threshold_uncertainty_score":0.011467338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4901939,0.0034140204,0.472239,0.0008807326,0.00005887764,0.00006150396,0.0010315089,0.0004227365,0.031697698],"genre_scores_gemma":[0.9952496,0.0007613807,0.00286803,0.000033687753,0.000023419252,0.000043441632,0.00009677561,0.000018844368,0.0009048455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865735,0.00051268545,0.000051746345,0.00008430768,0.00028893162,0.0004049575],"domain_scores_gemma":[0.9840312,0.013442063,0.000888872,0.0005848462,0.00084278156,0.00021033922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368794,0.0008468896,0.0008673048,0.001225857,0.0006550352,0.0016688847,0.00092941464,0.0008619292,0.0021494033],"category_scores_gemma":[0.013534051,0.0004394907,0.00041679078,0.0015719194,0.0019652403,0.0020314867,0.0012768497,0.0006580559,0.00021154743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053489843,0.000017090024,0.0007312635,0.00007784627,0.000029077428,0.00020920741,0.00015885453,0.9151476,0.0010192926,0.07688319,0.0005769234,0.0050961575],"study_design_scores_gemma":[0.000007504535,0.000020343157,0.00078229775,0.000034712233,0.00001548956,0.00012400711,0.00009524899,0.95395553,0.0006515062,0.043875366,0.00041625273,0.000021853784],"about_ca_topic_score_codex":0.0050113113,"about_ca_topic_score_gemma":0.0029727973,"teacher_disagreement_score":0.0050113113,"about_ca_system_score_codex":0.0021392177,"about_ca_system_score_gemma":0.0011224626,"threshold_uncertainty_score":0.015521109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095167495,0.0002772972,0.98562604,0.00006019318,0.00006145307,0.000028050606,0.00008675252,0.00029828792,0.004045191],"genre_scores_gemma":[0.81908345,0.0011241551,0.14788188,0.00014930201,0.00008592937,0.00027520824,0.00038233976,0.0002153121,0.030802377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997669,0.000055519078,0.00000928409,0.00004746023,0.000090495385,0.000030344378],"domain_scores_gemma":[0.99983406,0.00005299241,0.000025342859,0.000026679314,0.000051355542,0.0000095107525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031087923,0.0009265481,0.0007556162,0.00034231987,0.0002840539,0.0008148821,0.0016385589,0.0014863004,0.0038605276],"category_scores_gemma":[0.00052841945,0.00043119807,0.00093776267,0.00035344803,0.00041882243,0.0012731465,0.0005710399,0.001144928,0.0013236483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011192646,0.000025332136,0.00029228287,0.000095854906,0.000053884716,0.00016932642,0.00007342886,0.9289356,0.021700416,0.026764007,0.00076898246,0.021008998],"study_design_scores_gemma":[0.000003907997,0.000016629012,0.00005107658,0.0000048410543,0.00000733457,0.000022947774,0.0000029960224,0.99660933,0.00092615857,0.0013512177,0.0009971106,0.000006417185],"about_ca_topic_score_codex":0.0025735814,"about_ca_topic_score_gemma":0.0026623127,"teacher_disagreement_score":0.0038605276,"about_ca_system_score_codex":0.00036409876,"about_ca_system_score_gemma":0.00050474476,"threshold_uncertainty_score":0.012914777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7795899,0.006873416,0.19334456,0.00024764138,0.00014730914,0.000053693104,0.000048420552,0.00048566697,0.019209413],"genre_scores_gemma":[0.97134227,0.0010241825,0.026121931,0.000072666466,0.000045582103,0.000020777183,0.00007153666,0.000020359232,0.0012807081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911803,0.0002760811,0.00003158728,0.00005903172,0.00042417276,0.00009117586],"domain_scores_gemma":[0.9977202,0.0013501346,0.00014725546,0.0001935354,0.00049890234,0.000089902634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013956286,0.0003675836,0.00041343193,0.0008463697,0.00020292019,0.0005595616,0.00046044853,0.00063641043,0.0009261241],"category_scores_gemma":[0.0032350465,0.00013731509,0.00019493113,0.0005413706,0.00045755925,0.0009948427,0.00056791404,0.0003618918,0.00032777706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00596382,0.00039077984,0.019733679,0.0009140531,0.00028557895,0.0013748494,0.00077118457,0.14409198,0.31939766,0.03420877,0.0011310345,0.4717366],"study_design_scores_gemma":[0.00027129523,0.0046279505,0.028139662,0.00012590978,0.00032354365,0.005104981,0.0004240577,0.68139035,0.2611326,0.007262941,0.011006094,0.0001906799],"about_ca_topic_score_codex":0.0003098876,"about_ca_topic_score_gemma":0.00039178078,"teacher_disagreement_score":0.0013956286,"about_ca_system_score_codex":0.00030985157,"about_ca_system_score_gemma":0.000238632,"threshold_uncertainty_score":0.007380903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043566756,0.001067528,0.95162547,0.0001968944,0.000098137905,0.00006116407,0.00008521971,0.00065570034,0.0026431542],"genre_scores_gemma":[0.7304803,0.0007509199,0.26482713,0.00019852741,0.000099029254,0.00013314538,0.00027114604,0.00009837713,0.0031413801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820125,0.0007837724,0.000089325804,0.00018841345,0.00054035493,0.00019686633],"domain_scores_gemma":[0.9929333,0.0051049343,0.0005052977,0.000368169,0.0009601767,0.000128166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002906829,0.0010144085,0.0010907197,0.0008375376,0.00073069375,0.0016260629,0.00067749637,0.0017383818,0.0017257129],"category_scores_gemma":[0.018330289,0.00042303483,0.00041433985,0.0006400028,0.0010722849,0.002106943,0.0014644949,0.0010535558,0.0006447032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012796316,0.000175423,0.0013017777,0.00019201715,0.00013073743,0.000048624417,0.00014695938,0.7617555,0.00878798,0.024564886,0.0020403594,0.19957608],"study_design_scores_gemma":[0.000022226961,0.00007173507,0.00032398797,0.000008809745,0.000008187352,0.00002898851,0.000015333335,0.9910267,0.0025086137,0.005688301,0.00027813434,0.000018899953],"about_ca_topic_score_codex":0.0032903466,"about_ca_topic_score_gemma":0.0021105744,"teacher_disagreement_score":0.0032903466,"about_ca_system_score_codex":0.0008475177,"about_ca_system_score_gemma":0.0019457873,"threshold_uncertainty_score":0.015372992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1360487,0.0013367075,0.8536743,0.00026064867,0.00005576673,0.0000580088,0.000048161437,0.00040111304,0.008116617],"genre_scores_gemma":[0.9652464,0.00073166116,0.031440277,0.000049829636,0.000031020587,0.000044631997,0.00006001918,0.00006735439,0.0023287358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989793,0.00032564456,0.000025811323,0.00006294848,0.0004817773,0.00012445258],"domain_scores_gemma":[0.9953471,0.0035132624,0.0003291859,0.00018354887,0.0005964642,0.000030472065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017157096,0.00063548767,0.0006041742,0.0005167065,0.00025222544,0.0007381475,0.0005346251,0.00077893655,0.0010657436],"category_scores_gemma":[0.008987985,0.00024247686,0.00031715786,0.00052164076,0.0010334738,0.000965107,0.000684999,0.0008125772,0.00019045835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008864937,0.000021237009,0.0010846285,0.00011766331,0.0000359457,0.00020439635,0.0001629773,0.9530212,0.00632999,0.02567975,0.00023968954,0.013013986],"study_design_scores_gemma":[0.000002116407,0.000041599003,0.00045402354,0.000011520667,0.0000060611133,0.00004740979,0.000015016929,0.9942227,0.0020275004,0.0030030352,0.0001609399,0.000007991038],"about_ca_topic_score_codex":0.003268541,"about_ca_topic_score_gemma":0.0018438033,"teacher_disagreement_score":0.003268541,"about_ca_system_score_codex":0.0006786718,"about_ca_system_score_gemma":0.00066032505,"threshold_uncertainty_score":0.009073615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5291082,0.0013654365,0.45869443,0.0004394678,0.00007150426,0.000050892664,0.0001408758,0.0005470032,0.009582102],"genre_scores_gemma":[0.99627703,0.0002310639,0.0024972425,0.000018066678,0.000012639968,0.000011329627,0.00002337712,0.000010505648,0.00091866835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928254,0.00020058213,0.00002611235,0.00011048238,0.00022207799,0.00015822791],"domain_scores_gemma":[0.99506915,0.003471554,0.00045166482,0.00016439288,0.0007535939,0.000089547706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076479284,0.00082270615,0.00083929196,0.00057432754,0.0005456203,0.0010614268,0.0005818332,0.0010064447,0.0010443074],"category_scores_gemma":[0.0045664865,0.0002880572,0.0004093912,0.0006694873,0.0010322905,0.0009644263,0.0006522382,0.0006681513,0.00018943018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118803866,0.000025200367,0.0011282287,0.00007136547,0.000037866546,0.0002760935,0.000089349196,0.98496014,0.004607987,0.0027802242,0.00016316459,0.005741526],"study_design_scores_gemma":[0.0000025104105,0.000054155178,0.00042073271,0.0000031622446,0.0000145579415,0.0000648437,0.000024547195,0.9982326,0.0007228265,0.00040127648,0.00005176357,0.000006897479],"about_ca_topic_score_codex":0.007842157,"about_ca_topic_score_gemma":0.0027621028,"teacher_disagreement_score":0.007842157,"about_ca_system_score_codex":0.0012196515,"about_ca_system_score_gemma":0.0006461389,"threshold_uncertainty_score":0.015592992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47884667,0.0020144326,0.49401996,0.0007115185,0.00007543421,0.00011317107,0.00023148052,0.00043374504,0.023553621],"genre_scores_gemma":[0.9937738,0.00026637962,0.0044732825,0.00003494564,0.000015210623,0.000024047213,0.000023952913,0.000014088484,0.001374307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00044061555,0.000036087033,0.000104779705,0.00028031974,0.00026748682],"domain_scores_gemma":[0.99470526,0.004018447,0.00036846322,0.00019495355,0.0006262184,0.00008671943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015013681,0.0011211103,0.0009182754,0.0005868498,0.00063433853,0.0013852669,0.00057870476,0.00090626476,0.0017908429],"category_scores_gemma":[0.0054572765,0.0003418628,0.00040279728,0.00062846375,0.0011941162,0.0009093128,0.0011190382,0.00049965293,0.00030976825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002465906,0.000029792127,0.0011944034,0.000095494324,0.0000517851,0.0002179646,0.0001868745,0.9752882,0.0055772336,0.008343247,0.00037446775,0.008393968],"study_design_scores_gemma":[0.000010398005,0.00013229898,0.000493498,0.000007660102,0.00002265712,0.00011429635,0.000055670767,0.9958198,0.0016478951,0.0015059676,0.00017423923,0.000015610716],"about_ca_topic_score_codex":0.0059063355,"about_ca_topic_score_gemma":0.0040083188,"teacher_disagreement_score":0.0059063355,"about_ca_system_score_codex":0.0013754161,"about_ca_system_score_gemma":0.0009422437,"threshold_uncertainty_score":0.011743903},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033444885,0.00007445266,0.96207523,0.00005895985,0.00002649168,0.00010142319,0.00008313814,0.00071797456,0.0034174784],"genre_scores_gemma":[0.29010323,0.0001347434,0.70530623,0.000110880246,0.000017443037,0.00023677462,0.00038036634,0.00017744841,0.0035329284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972874,0.000064178916,0.0000135940045,0.000044944558,0.00010619518,0.00004236776],"domain_scores_gemma":[0.9996326,0.0001523737,0.00003282672,0.000089670495,0.00007388407,0.00001863431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019119891,0.0003900476,0.00033618833,0.00074311625,0.00049616955,0.00037009155,0.0005168585,0.00035064394,0.002367609],"category_scores_gemma":[0.0008762902,0.00028121754,0.0005941749,0.0004982335,0.00047691847,0.00045137104,0.0006794724,0.0005254376,0.00082562445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003076525,0.0001711532,0.0014496811,0.00035877436,0.000103927276,0.0007040181,0.0006947236,0.23347355,0.17890391,0.17833363,0.0054665436,0.4000325],"study_design_scores_gemma":[0.00008532733,0.00021965477,0.0007324892,0.00003649152,0.000052872525,0.00055396114,0.00007505318,0.84772074,0.08277692,0.052369796,0.01528887,0.00008783632],"about_ca_topic_score_codex":0.0014052143,"about_ca_topic_score_gemma":0.0020946367,"teacher_disagreement_score":0.002367609,"about_ca_system_score_codex":0.00027203996,"about_ca_system_score_gemma":0.00065186963,"threshold_uncertainty_score":0.007920444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015379541,0.00069438264,0.9926641,0.00026932987,0.00011321127,0.00004713303,0.00004814458,0.0000710942,0.004554702],"genre_scores_gemma":[0.39883953,0.007097751,0.58389914,0.0009360908,0.001167022,0.00127719,0.00049963134,0.00023070826,0.0060529443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681914,0.0010468109,0.00017240545,0.00027626296,0.0014192645,0.00026605118],"domain_scores_gemma":[0.9960907,0.002232465,0.00025738787,0.00043144502,0.0009355071,0.000052486976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004468938,0.001878997,0.0011660741,0.0028603873,0.0008382234,0.0025568802,0.0032777789,0.0025686864,0.0025889555],"category_scores_gemma":[0.011630549,0.000794015,0.0017219317,0.0022271336,0.0027203346,0.0030866768,0.0015541479,0.0029717814,0.0009914804],"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.000011059946,0.00004794371,0.00026921727,0.00012915824,0.000033369106,0.00012091317,0.0001270419,0.25534844,0.001267468,0.7290925,0.0012808008,0.012272028],"study_design_scores_gemma":[0.000008851592,0.000035569192,0.00012487955,0.000061013052,0.0000137015495,0.00009992994,0.000039680865,0.8292563,0.00051013037,0.16446526,0.0053611565,0.0000235391],"about_ca_topic_score_codex":0.0034802742,"about_ca_topic_score_gemma":0.0010987264,"teacher_disagreement_score":0.004468938,"about_ca_system_score_codex":0.0036620935,"about_ca_system_score_gemma":0.0018360356,"threshold_uncertainty_score":0.026570499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77131045,0.010744715,0.1788362,0.0008308119,0.00024997842,0.000092943505,0.0005535815,0.0005072673,0.036873985],"genre_scores_gemma":[0.99389464,0.0015072434,0.0036064028,0.000036323105,0.000040558316,0.00001893407,0.00009599095,0.000034104833,0.0007657126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877566,0.00037193828,0.000039585884,0.0001411086,0.0004291841,0.00024254891],"domain_scores_gemma":[0.9903015,0.007286928,0.0007121036,0.0004886866,0.0010636249,0.00014719831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017468344,0.0009878329,0.00066090963,0.0010423528,0.00064984895,0.0012829083,0.00068452256,0.0011235479,0.0011033072],"category_scores_gemma":[0.013314263,0.00019368093,0.00027533187,0.0013382203,0.0013449704,0.0013688379,0.00076539075,0.00061586447,0.00026610645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002635187,0.00004076002,0.0017268559,0.0001013965,0.000043283548,0.00015559352,0.00009168049,0.9617422,0.0061333487,0.009051763,0.00055332686,0.020096239],"study_design_scores_gemma":[0.000012229345,0.00030946056,0.002837569,0.000035762274,0.00004757654,0.00020665479,0.00007028548,0.9866621,0.0043176934,0.004783172,0.0006877324,0.000029770054],"about_ca_topic_score_codex":0.0067763817,"about_ca_topic_score_gemma":0.0044603567,"teacher_disagreement_score":0.0067763817,"about_ca_system_score_codex":0.0016500753,"about_ca_system_score_gemma":0.0007050269,"threshold_uncertainty_score":0.013473928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005231763,0.0028887796,0.9770348,0.000492307,0.0001631594,0.000064770415,0.00011113906,0.00010741746,0.013905818],"genre_scores_gemma":[0.4265184,0.016360601,0.53760314,0.0011417208,0.00072725996,0.0004193106,0.0009516328,0.00012609568,0.016151797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.0003533024,0.0000408467,0.000103852086,0.0003928389,0.000083537634],"domain_scores_gemma":[0.9985079,0.0007793696,0.00007797015,0.00024745308,0.00035799545,0.000029179946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011508535,0.00050074974,0.00041976632,0.0010474869,0.00040066874,0.0010602686,0.0008231857,0.000652852,0.002400777],"category_scores_gemma":[0.0033621406,0.0002724763,0.00029678838,0.0015116336,0.0011192301,0.0019929004,0.0017166882,0.001362457,0.0008532928],"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.00017517392,0.000023666369,0.00034213622,0.00025043017,0.000017439173,0.00026798452,0.0001916719,0.06537056,0.0081304405,0.7486679,0.005358719,0.17120396],"study_design_scores_gemma":[0.000047222482,0.00014562775,0.00029320116,0.00021429361,0.00003141034,0.0006211107,0.00006993562,0.6263743,0.015651926,0.30833286,0.048137408,0.00008064201],"about_ca_topic_score_codex":0.0019678683,"about_ca_topic_score_gemma":0.0011284534,"teacher_disagreement_score":0.002400777,"about_ca_system_score_codex":0.0007231458,"about_ca_system_score_gemma":0.0008455761,"threshold_uncertainty_score":0.008031428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106443,0.0003173686,0.9874378,0.00011716118,0.000043116648,0.000034069973,0.000015003439,0.00008674315,0.0013045251],"genre_scores_gemma":[0.8485415,0.00036942321,0.14871489,0.00013190533,0.00009315209,0.00010240576,0.000051089984,0.000023580002,0.001971964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981993,0.0006475888,0.00010098712,0.00031104116,0.0005514796,0.00018963746],"domain_scores_gemma":[0.9983278,0.0008808413,0.00020942026,0.00017778148,0.0003494141,0.000054672233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002547818,0.0009566097,0.0010228456,0.0005230119,0.0004539129,0.00079177675,0.0016437577,0.0009380789,0.00091001706],"category_scores_gemma":[0.0037610806,0.00037974224,0.0006844283,0.0006200369,0.0007926762,0.0013137239,0.0013862605,0.001240715,0.00028873113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005789232,0.00013790824,0.0005678658,0.00032173243,0.00019362588,0.00033506364,0.00047493185,0.67335075,0.025818244,0.094330885,0.0022829135,0.20160712],"study_design_scores_gemma":[0.000027765635,0.00017938479,0.00012505306,0.0000135448145,0.000032069485,0.000103277125,0.000019441652,0.98106074,0.003347085,0.013855136,0.0012112841,0.000025173573],"about_ca_topic_score_codex":0.0010496976,"about_ca_topic_score_gemma":0.00074896985,"teacher_disagreement_score":0.002547818,"about_ca_system_score_codex":0.0007094398,"about_ca_system_score_gemma":0.000901476,"threshold_uncertainty_score":0.013474286},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02502456,0.0004263681,0.96491855,0.000092558774,0.000024695275,0.00006146387,0.00003658521,0.00025970067,0.009155628],"genre_scores_gemma":[0.70141006,0.0006876536,0.2926495,0.00007874177,0.000035807912,0.0002390509,0.000090676,0.00008959627,0.004718927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990796,0.00040024618,0.00003583528,0.00010363825,0.00026372768,0.000117040385],"domain_scores_gemma":[0.9991567,0.0005412775,0.00009061749,0.00007894321,0.00011630012,0.000016212769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008310343,0.0007231261,0.0005186811,0.0006214352,0.000364795,0.00093274924,0.00078559294,0.00052111846,0.0015489307],"category_scores_gemma":[0.0018882477,0.00029101083,0.00048169773,0.0009736147,0.0013729694,0.00071734854,0.0011667457,0.00064045616,0.00046232273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016139724,0.00007900704,0.00052442827,0.00032598194,0.00007971796,0.00032835777,0.0004995092,0.6691795,0.06820395,0.16616449,0.0016688197,0.09278477],"study_design_scores_gemma":[0.00000818582,0.00007002968,0.00018029205,0.00003727668,0.000008734077,0.00012871147,0.000037327623,0.95552623,0.028433518,0.013286861,0.0022502316,0.00003249848],"about_ca_topic_score_codex":0.0014431023,"about_ca_topic_score_gemma":0.0017003785,"teacher_disagreement_score":0.0015489307,"about_ca_system_score_codex":0.00084240426,"about_ca_system_score_gemma":0.00075814204,"threshold_uncertainty_score":0.0061120987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09347202,0.0010431734,0.90158606,0.00021712901,0.000044300377,0.000059856724,0.00006659108,0.00014391824,0.0033669295],"genre_scores_gemma":[0.77767146,0.00086038955,0.21926111,0.0000624538,0.00004489336,0.00007859024,0.000063610816,0.00001859851,0.0019389587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962294,0.00008195585,0.000030119523,0.00003956132,0.0001698244,0.000055563734],"domain_scores_gemma":[0.9983114,0.00077152374,0.00035792004,0.00020409877,0.00029549858,0.000059456033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005059854,0.000604351,0.00040969378,0.0005859701,0.00033236685,0.00079984573,0.00043754373,0.00055875734,0.00065675017],"category_scores_gemma":[0.0028307685,0.0002303973,0.0003140398,0.0006311472,0.0005551634,0.0008059599,0.00076356187,0.00057424925,0.00016016967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016800701,0.00006546696,0.0009800575,0.0002597414,0.000056420173,0.0002060085,0.00017607503,0.76221424,0.05021789,0.07466579,0.00071137695,0.11027893],"study_design_scores_gemma":[0.000016633485,0.00013198746,0.00021100468,0.000024884617,0.000014229775,0.00010219968,0.000019847865,0.9673776,0.015121777,0.015350331,0.0016063792,0.000023059965],"about_ca_topic_score_codex":0.001245686,"about_ca_topic_score_gemma":0.0016948719,"teacher_disagreement_score":0.001245686,"about_ca_system_score_codex":0.0009245807,"about_ca_system_score_gemma":0.0005616361,"threshold_uncertainty_score":0.0067083836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073801456,0.00015530417,0.99086994,0.0000662103,0.00002194276,0.000034693614,0.000025596502,0.00005513348,0.001390995],"genre_scores_gemma":[0.5659156,0.0005959582,0.43007693,0.00008403232,0.00006134559,0.00044018432,0.00015043344,0.000034188535,0.0026414334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912435,0.00028999144,0.000037911195,0.0001220548,0.0003340287,0.000091727634],"domain_scores_gemma":[0.9986137,0.000578966,0.00022258345,0.00014989535,0.00036931774,0.000065532724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008746922,0.00078121043,0.00056358316,0.00043348313,0.00035332,0.000703451,0.0010775278,0.0009775567,0.00083898334],"category_scores_gemma":[0.0025125628,0.0003714635,0.0003615423,0.000530275,0.00075030647,0.0006410604,0.0009649943,0.0006948175,0.00039914783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010848546,0.000046958365,0.0003846932,0.00010052649,0.000042197833,0.00015078213,0.00014244445,0.837844,0.020835212,0.061194524,0.0013119063,0.0778383],"study_design_scores_gemma":[0.00002604134,0.000076702054,0.00006831083,0.0000089914365,0.0000072079747,0.00006840491,0.000012145868,0.9883007,0.0026913579,0.007356272,0.0013717889,0.000012098308],"about_ca_topic_score_codex":0.0015795196,"about_ca_topic_score_gemma":0.0025684605,"teacher_disagreement_score":0.0015795196,"about_ca_system_score_codex":0.00077583926,"about_ca_system_score_gemma":0.0015425605,"threshold_uncertainty_score":0.005629182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13073665,0.0013135916,0.8646813,0.00019610552,0.000047254263,0.000034788096,0.000010491383,0.00021979309,0.0027600152],"genre_scores_gemma":[0.97805095,0.00029253386,0.021042984,0.000024785048,0.00002936652,0.000014916728,0.000006004964,0.000011028567,0.00052746636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937016,0.000297157,0.000020488644,0.000052986925,0.00018094422,0.00007820332],"domain_scores_gemma":[0.99915206,0.00056972355,0.00009870952,0.00006701811,0.000092771996,0.000019604848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009530082,0.0004924963,0.00044595345,0.00024239873,0.0001713443,0.00057765713,0.0004077037,0.00038282273,0.0003495814],"category_scores_gemma":[0.0034976485,0.00019014117,0.00017467036,0.00038344966,0.00051236316,0.0006213801,0.00044377078,0.00035399245,0.0000825813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012644993,0.00005289724,0.0006265122,0.00004121976,0.000031193962,0.000077296114,0.00004134196,0.91075104,0.01100042,0.007176723,0.00031873537,0.069756195],"study_design_scores_gemma":[0.0000067549263,0.000051103525,0.00018714297,0.0000017173171,0.00000641075,0.000024734569,0.00000539175,0.99686414,0.0012785365,0.0014365872,0.0001330224,0.000004474281],"about_ca_topic_score_codex":0.001219935,"about_ca_topic_score_gemma":0.001028373,"teacher_disagreement_score":0.001219935,"about_ca_system_score_codex":0.00030132683,"about_ca_system_score_gemma":0.00030173734,"threshold_uncertainty_score":0.0050400496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8463626,0.0012223454,0.14840256,0.00017657362,0.000035949924,0.00002254717,0.00012814901,0.0002222942,0.0034269851],"genre_scores_gemma":[0.9962889,0.00030883148,0.0027148873,0.000011354825,0.000008017877,0.000007934425,0.00005066831,0.0000143114985,0.00059498125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990282,0.0002325088,0.000039691546,0.00006772577,0.00042697266,0.00020496182],"domain_scores_gemma":[0.9945549,0.003463538,0.0007567923,0.0002705254,0.000893426,0.00006086576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158168,0.0005336488,0.0004733789,0.00056226866,0.0003910929,0.0005364384,0.00035441067,0.00049574475,0.0006517873],"category_scores_gemma":[0.0069426936,0.0001815936,0.00019297733,0.0007474476,0.0006202257,0.0008663037,0.0006687645,0.00037164715,0.00012801551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005203567,0.000037356203,0.009811624,0.00011723041,0.000068450485,0.00029991617,0.00014968653,0.9301929,0.021785744,0.011250289,0.000511841,0.02525465],"study_design_scores_gemma":[0.000005562001,0.00007373329,0.0025498148,0.000009345216,0.000017692024,0.00007755606,0.000032503118,0.9884567,0.0075879293,0.0010103263,0.00016222618,0.000016610451],"about_ca_topic_score_codex":0.0049163294,"about_ca_topic_score_gemma":0.0027880417,"teacher_disagreement_score":0.0049163294,"about_ca_system_score_codex":0.00075923925,"about_ca_system_score_gemma":0.00056119385,"threshold_uncertainty_score":0.00977546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5488085,0.00108337,0.42329192,0.0003262586,0.000119200806,0.00009821147,0.0006299778,0.00053919584,0.025103282],"genre_scores_gemma":[0.9555819,0.00049307576,0.040540338,0.00006674962,0.000020518793,0.00003790927,0.00017451838,0.00002322316,0.0030617935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997712,0.000029362644,0.000015993559,0.000029836077,0.00009188757,0.00006174514],"domain_scores_gemma":[0.99944276,0.00017204824,0.000146192,0.00011644531,0.00009868091,0.000023953566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024457093,0.00024852707,0.0002175494,0.00043153646,0.00027000817,0.0004718245,0.00027791035,0.00022163393,0.001045018],"category_scores_gemma":[0.0011724852,0.000079006015,0.00015966251,0.00055370433,0.00042239673,0.00051313074,0.00043149863,0.00034186264,0.00022660823],"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.0004679778,0.00013140547,0.004511407,0.00036476264,0.000048476642,0.000504974,0.0004380137,0.06413525,0.2378246,0.48142406,0.0022860933,0.20786294],"study_design_scores_gemma":[0.00010484063,0.0005470176,0.0060370695,0.00019068723,0.00007380471,0.0017314063,0.00015447567,0.40044096,0.40684158,0.14920187,0.03455938,0.00011680357],"about_ca_topic_score_codex":0.0013289555,"about_ca_topic_score_gemma":0.0015457665,"teacher_disagreement_score":0.0013289555,"about_ca_system_score_codex":0.00052948605,"about_ca_system_score_gemma":0.00077404844,"threshold_uncertainty_score":0.0038416982},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2293955,0.00055950705,0.7651514,0.0005102422,0.00005633457,0.000048150374,0.00006747292,0.00019639234,0.0040149908],"genre_scores_gemma":[0.9797314,0.00024360833,0.01761958,0.000055050474,0.00003413998,0.000039107053,0.000038296635,0.000042863867,0.0021960095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956304,0.00015316656,0.000015603913,0.00005880662,0.00011946111,0.00008989706],"domain_scores_gemma":[0.99835795,0.00093164353,0.00025784288,0.000103649756,0.00025483893,0.00009397845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014024369,0.00055047806,0.00068122306,0.00069458614,0.00038844696,0.0009182373,0.0011055624,0.0006460201,0.0011295005],"category_scores_gemma":[0.004055324,0.00037083635,0.00084993785,0.0005321631,0.0010218059,0.0012323017,0.0011483955,0.0008820578,0.00009281087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026325022,0.000015772157,0.0007979901,0.000027085243,0.000031317148,0.00008380896,0.000066991815,0.9558187,0.0024169597,0.03759919,0.00028253926,0.0028333704],"study_design_scores_gemma":[0.0000012357552,0.0000035333894,0.000106418294,8.9435935e-7,0.0000019235786,0.000004273734,0.0000058639675,0.9968733,0.000057883015,0.0029004149,0.000042056447,0.0000022789377],"about_ca_topic_score_codex":0.0079282215,"about_ca_topic_score_gemma":0.0031598583,"teacher_disagreement_score":0.0079282215,"about_ca_system_score_codex":0.0014570757,"about_ca_system_score_gemma":0.00096484035,"threshold_uncertainty_score":0.015764177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5474807,0.000652161,0.4456151,0.0002820868,0.000052138133,0.000048124704,0.000038794948,0.00011633896,0.0057145576],"genre_scores_gemma":[0.9881942,0.00015100239,0.010762245,0.000019589701,0.000013980756,0.00001259719,0.000008333487,0.0000025999836,0.00083530176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999548,0.00013458173,0.000023575372,0.00007608656,0.00014314913,0.000074590585],"domain_scores_gemma":[0.99844617,0.0008769335,0.0002561441,0.00014414002,0.00024041228,0.00003626271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007386362,0.00057232426,0.00061168155,0.0002624722,0.0004586588,0.0007633167,0.0005985079,0.0008521947,0.0002842693],"category_scores_gemma":[0.001704036,0.00023928772,0.00022736962,0.00039859762,0.0005388568,0.00078877195,0.00065100973,0.00034712997,0.00013369038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010528922,0.00020720874,0.007530535,0.00037045212,0.00024734144,0.003315732,0.0009049928,0.6688823,0.17794646,0.04099124,0.0009771633,0.09757367],"study_design_scores_gemma":[0.000029524455,0.00036603617,0.00084655604,0.000011364806,0.000079587204,0.0007377079,0.00015486004,0.9689214,0.021731762,0.005853581,0.0012447858,0.000022780509],"about_ca_topic_score_codex":0.000820663,"about_ca_topic_score_gemma":0.0010034518,"teacher_disagreement_score":0.0008521947,"about_ca_system_score_codex":0.00034539145,"about_ca_system_score_gemma":0.00036174123,"threshold_uncertainty_score":0.0039063096},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023487076,0.00078843284,0.9714234,0.0002169537,0.00012491486,0.0000749423,0.00005773821,0.00024276123,0.0035838045],"genre_scores_gemma":[0.5503221,0.00082767336,0.44271976,0.00016214587,0.0001943486,0.0001887814,0.00017956659,0.000031178144,0.0053744693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924433,0.00020758677,0.00006299101,0.00008887987,0.000322575,0.00007363833],"domain_scores_gemma":[0.99921453,0.00018549571,0.00011243365,0.00015660368,0.00028158785,0.000049294926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006244813,0.0007436373,0.00054708513,0.00044391508,0.00044391825,0.0006006652,0.00078475644,0.0007235914,0.0013494105],"category_scores_gemma":[0.0015040567,0.00026496264,0.00046034958,0.0008017428,0.00059505674,0.0008702833,0.00102238,0.000842868,0.00050083187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006043119,0.00017007289,0.0016595051,0.00042849392,0.00021649117,0.00079755246,0.00046363196,0.2543349,0.25252685,0.16589153,0.0038289893,0.31907764],"study_design_scores_gemma":[0.000042865588,0.0004864894,0.0005174696,0.000035503046,0.000102628364,0.0007187441,0.000018754416,0.92944896,0.046838664,0.010560363,0.011155268,0.00007418315],"about_ca_topic_score_codex":0.0009877523,"about_ca_topic_score_gemma":0.002125771,"teacher_disagreement_score":0.0013494105,"about_ca_system_score_codex":0.00053563964,"about_ca_system_score_gemma":0.0008139399,"threshold_uncertainty_score":0.004514277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19275485,0.002922277,0.78794223,0.00042521287,0.00016382158,0.000085435815,0.00007820892,0.00034916753,0.015278755],"genre_scores_gemma":[0.9706528,0.00058659277,0.02641712,0.00004746757,0.000026558446,0.000040331062,0.000025150426,0.000019399096,0.0021844497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937147,0.00018343775,0.000013874716,0.000055749995,0.00021688006,0.00015874382],"domain_scores_gemma":[0.99794513,0.001345706,0.00017170001,0.0001330387,0.00035366724,0.00005072293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008531619,0.00060603005,0.0006175728,0.00061490136,0.00054266705,0.0012439092,0.00068647007,0.00078881707,0.0009823762],"category_scores_gemma":[0.0036843172,0.00017876647,0.0003248159,0.0010028181,0.0011371175,0.0009608246,0.00081599865,0.00069506885,0.00017181662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005559546,0.000120730554,0.0007782534,0.00026012174,0.000077161436,0.00033700882,0.000313418,0.8076293,0.02300073,0.093676664,0.00173773,0.07151296],"study_design_scores_gemma":[0.000011925021,0.00012113224,0.00015391594,0.000017143542,0.000022557144,0.00012337443,0.000051511743,0.98386985,0.0058982233,0.008587801,0.0011227408,0.000019937199],"about_ca_topic_score_codex":0.0046384456,"about_ca_topic_score_gemma":0.0040577105,"teacher_disagreement_score":0.0046384456,"about_ca_system_score_codex":0.0016907164,"about_ca_system_score_gemma":0.001295586,"threshold_uncertainty_score":0.012267053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091625385,0.00025957072,0.901814,0.000111671376,0.000047674588,0.000035569443,0.00001757718,0.0004584951,0.005630011],"genre_scores_gemma":[0.9127847,0.000095182695,0.08349656,0.000043084045,0.000016624912,0.00004890837,0.000033408764,0.000024172039,0.0034574198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985564,0.000040113413,0.0000058790206,0.00003431756,0.00004117267,0.00002289101],"domain_scores_gemma":[0.99982184,0.00006330718,0.000032706677,0.000025331023,0.000044238925,0.00001263502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025948064,0.00036384302,0.0003737511,0.00029114957,0.00027539436,0.0005989139,0.00065794575,0.0005981757,0.0011663234],"category_scores_gemma":[0.0004412035,0.00017924455,0.00025403526,0.00034020387,0.00030351346,0.00042161407,0.00032147975,0.00029445504,0.00036262293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010433327,0.00009673731,0.00092991896,0.00004381881,0.00004272895,0.00008547115,0.00007018084,0.8774908,0.036772765,0.0046987017,0.00089628657,0.07876828],"study_design_scores_gemma":[0.000016009486,0.00005826352,0.0002145875,0.000002072875,0.000009456142,0.000037856145,0.0000118914095,0.9954117,0.0022723125,0.0010232142,0.00093736284,0.0000053401172],"about_ca_topic_score_codex":0.0008355865,"about_ca_topic_score_gemma":0.00094831095,"teacher_disagreement_score":0.0011663234,"about_ca_system_score_codex":0.00040413058,"about_ca_system_score_gemma":0.00026166116,"threshold_uncertainty_score":0.00390172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018098904,0.00038518623,0.9773965,0.00022490717,0.00012828322,0.00032691765,0.0000878718,0.00078503013,0.002566405],"genre_scores_gemma":[0.5274936,0.0005830427,0.46424657,0.00016318787,0.00009069097,0.0006489484,0.00037126956,0.00007555203,0.006327077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993381,0.00015843875,0.000048687118,0.00006754485,0.00034004438,0.000047130798],"domain_scores_gemma":[0.99939847,0.0001625482,0.00013595614,0.00013560716,0.00013486005,0.000032612734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072492386,0.00030967526,0.00042393708,0.0005505169,0.0006312073,0.0007237163,0.0011279151,0.0005939354,0.0019396722],"category_scores_gemma":[0.0015565198,0.00015360516,0.00023194391,0.0005214404,0.00065977743,0.0016055737,0.0010077673,0.0006123958,0.00029279524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011498183,0.00033211356,0.00088844646,0.0011153789,0.00011626794,0.000793338,0.00051096943,0.0807023,0.17849447,0.29247496,0.019518113,0.42390385],"study_design_scores_gemma":[0.000261154,0.0009670695,0.0008205981,0.000059868573,0.00009995072,0.0011904772,0.00008721583,0.7898359,0.099480025,0.064656116,0.0424181,0.0001235225],"about_ca_topic_score_codex":0.00035988257,"about_ca_topic_score_gemma":0.00048402854,"teacher_disagreement_score":0.0019396722,"about_ca_system_score_codex":0.0006210793,"about_ca_system_score_gemma":0.0007406591,"threshold_uncertainty_score":0.0064889193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059641264,0.00018968654,0.9920717,0.00008610196,0.000028710576,0.000062785606,0.000015254588,0.00012128053,0.0014604509],"genre_scores_gemma":[0.3998019,0.00050175237,0.5957568,0.00023918496,0.00008694006,0.00023384421,0.00007340243,0.00005889136,0.0032472431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872345,0.0003653589,0.000049863615,0.00032007857,0.00046679736,0.00007437653],"domain_scores_gemma":[0.9988242,0.00056244375,0.000106851,0.00026274755,0.000210258,0.000033554636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011688631,0.00058601337,0.0006705585,0.0008042943,0.00063298154,0.00074352213,0.002151466,0.00090469024,0.0014113428],"category_scores_gemma":[0.0024743327,0.00025460194,0.0006943194,0.0008171569,0.0007693105,0.0009452772,0.0012064438,0.00074518874,0.00039457245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003643433,0.00027032735,0.0012055283,0.00043383433,0.00036562,0.00032050407,0.00075634284,0.48521468,0.04658348,0.1516518,0.0034004685,0.30943307],"study_design_scores_gemma":[0.000030376552,0.00018534325,0.000348491,0.000020460751,0.00006592118,0.00031021514,0.00007995115,0.9606299,0.009130261,0.022211213,0.006945545,0.00004225527],"about_ca_topic_score_codex":0.0013412366,"about_ca_topic_score_gemma":0.0013816403,"teacher_disagreement_score":0.002151466,"about_ca_system_score_codex":0.0005981543,"about_ca_system_score_gemma":0.0006387971,"threshold_uncertainty_score":0.0061815977},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267807,0.0016164798,0.3652395,0.0002488761,0.000066454624,0.000058619495,0.000034625,0.0010868949,0.0048679276],"genre_scores_gemma":[0.99039674,0.00011545509,0.009030332,0.000015117355,0.000005301567,0.000007926697,0.0000089624955,0.000007972306,0.00041219543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955076,0.0001504884,0.000014190993,0.00006547684,0.00013008006,0.000088911875],"domain_scores_gemma":[0.9990946,0.0004999666,0.000062069856,0.000107367545,0.00020340514,0.00003255199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080751017,0.00057053566,0.0004179942,0.00046221897,0.00045274507,0.00050874293,0.0006971885,0.0003988945,0.00064200565],"category_scores_gemma":[0.0018072581,0.00013850386,0.00026434596,0.00042887084,0.00047585793,0.0006878905,0.0006934101,0.00038722574,0.000084681335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012319778,0.00035546612,0.0043453076,0.0003551295,0.00023498408,0.0008072153,0.0009889492,0.5097537,0.22207932,0.019310627,0.002530146,0.23800713],"study_design_scores_gemma":[0.00003058219,0.0005457717,0.000899435,0.000009134148,0.000105173356,0.000249668,0.00009053541,0.9432151,0.050667357,0.002815138,0.0013479263,0.000024194116],"about_ca_topic_score_codex":0.0019468821,"about_ca_topic_score_gemma":0.0019387172,"teacher_disagreement_score":0.0019468821,"about_ca_system_score_codex":0.00061201013,"about_ca_system_score_gemma":0.0004118522,"threshold_uncertainty_score":0.004440427},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13215761,0.0017610572,0.83874094,0.0004031523,0.00031029343,0.00018438602,0.0005323503,0.0018810182,0.024029205],"genre_scores_gemma":[0.8065732,0.00086352404,0.17572182,0.00020967254,0.00014344683,0.00016688897,0.0006019893,0.0001085197,0.015610916],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990796,0.00013252297,0.00006971958,0.00011329758,0.00048788224,0.00011705724],"domain_scores_gemma":[0.99714977,0.0006025835,0.00045291794,0.00064027484,0.0010598585,0.00009471881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776833,0.00047693847,0.00046731468,0.0006506739,0.00042600822,0.000735261,0.0008438709,0.0005706221,0.0025314847],"category_scores_gemma":[0.002164574,0.0001794253,0.000306908,0.0006489167,0.0006381682,0.00059645274,0.0005073572,0.0008248562,0.0010495881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010165395,0.00015040919,0.0017916289,0.00058796135,0.00014422924,0.0007244522,0.000249428,0.20742282,0.3931883,0.16011861,0.0064924615,0.22811316],"study_design_scores_gemma":[0.00008957959,0.00035452482,0.00095064414,0.000075323944,0.00007327195,0.0010657961,0.000026113288,0.50922483,0.45063388,0.013059141,0.024330828,0.0001160091],"about_ca_topic_score_codex":0.00149557,"about_ca_topic_score_gemma":0.0029418936,"teacher_disagreement_score":0.0025314847,"about_ca_system_score_codex":0.00079755415,"about_ca_system_score_gemma":0.0009981071,"threshold_uncertainty_score":0.0084686875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027449436,0.0004876082,0.9695599,0.00018453502,0.00005190877,0.000058586946,0.000028720162,0.0001243181,0.0020550003],"genre_scores_gemma":[0.8150625,0.00025401407,0.18183419,0.00013388679,0.00010386243,0.0000900878,0.000034523433,0.000053611355,0.0024333769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975442,0.0012416531,0.00009371648,0.00027092535,0.00045906284,0.00039040495],"domain_scores_gemma":[0.9960193,0.0030900568,0.00023537321,0.00025613827,0.0002894425,0.0001096907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004304243,0.0012165711,0.0015617149,0.00068991265,0.0009505669,0.001512118,0.0019928454,0.00119538,0.0012833946],"category_scores_gemma":[0.0068400027,0.00060593995,0.0005414202,0.00097109674,0.0011164391,0.0015383697,0.0016110138,0.0010748556,0.00018490707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009737039,0.00019910395,0.000765309,0.00015679546,0.00012509266,0.00013257541,0.0002942455,0.81322086,0.006837329,0.062652975,0.0023527227,0.11228933],"study_design_scores_gemma":[0.000028338329,0.00006496006,0.00007785995,0.00000517786,0.000012807616,0.00003179971,0.000016820275,0.9835187,0.0015274164,0.014213841,0.00049101067,0.000011218725],"about_ca_topic_score_codex":0.0024977468,"about_ca_topic_score_gemma":0.0029131933,"teacher_disagreement_score":0.004304243,"about_ca_system_score_codex":0.0017069987,"about_ca_system_score_gemma":0.0015004941,"threshold_uncertainty_score":0.022763312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098600745,0.0010580083,0.88792175,0.000526786,0.00004147594,0.00004186376,0.00004914758,0.00007288494,0.0116874045],"genre_scores_gemma":[0.95384926,0.00081368344,0.041965958,0.000084125524,0.000030878473,0.00006988006,0.000030532643,0.000020769632,0.0031348802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996927,0.000126004,0.00000809318,0.00003298523,0.000079844845,0.000060390073],"domain_scores_gemma":[0.99928623,0.00055711734,0.00005592655,0.000020405261,0.0000630869,0.000017255867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068520854,0.0008094493,0.0007084399,0.00032043786,0.00034405687,0.00080555724,0.00045215723,0.00081608654,0.00071022863],"category_scores_gemma":[0.0018536443,0.0002653277,0.0003844742,0.0005431688,0.0005488204,0.00072450086,0.00063891825,0.000662198,0.00012491585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006743883,0.000044526925,0.00027286532,0.00008122156,0.00002117054,0.00021789147,0.00016640345,0.94152296,0.0053162137,0.037738573,0.00062995375,0.0139208045],"study_design_scores_gemma":[0.000005212736,0.000024912373,0.000041828975,0.000002702257,0.0000039268816,0.000024088491,0.000015482714,0.9940889,0.00059957796,0.0049783546,0.00021115362,0.0000039351517],"about_ca_topic_score_codex":0.0032014027,"about_ca_topic_score_gemma":0.0027249595,"teacher_disagreement_score":0.0032014027,"about_ca_system_score_codex":0.00074096164,"about_ca_system_score_gemma":0.0006191741,"threshold_uncertainty_score":0.0063655376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007697325,0.0011721493,0.98401445,0.0006926152,0.00021284953,0.0000825958,0.00015905823,0.000216608,0.005752264],"genre_scores_gemma":[0.7751927,0.006809855,0.18946944,0.0005771831,0.00081097323,0.0009928616,0.0008400335,0.00022715854,0.02507975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988716,0.000371398,0.000059918195,0.00017862034,0.0003646389,0.00015381552],"domain_scores_gemma":[0.9991185,0.00037143278,0.00017767133,0.00012365144,0.00016426052,0.00004443372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013004297,0.0011429747,0.00097191497,0.001147265,0.00081099727,0.0012438163,0.0027376385,0.0021770648,0.001844222],"category_scores_gemma":[0.0034147843,0.00044884282,0.001431077,0.0016045383,0.0010534142,0.0027072036,0.0011308877,0.0016902287,0.0008491675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033749624,0.000031143667,0.0010922742,0.00008400037,0.000041397547,0.0004045381,0.0001554136,0.72626567,0.0023339747,0.25169477,0.00323429,0.014628858],"study_design_scores_gemma":[0.0000053631557,0.000025523403,0.00021889147,0.000011885604,0.000012397663,0.00012833295,0.000021277112,0.97396785,0.00017101801,0.022339841,0.0030841292,0.000013544135],"about_ca_topic_score_codex":0.0060306746,"about_ca_topic_score_gemma":0.0033500749,"teacher_disagreement_score":0.0060306746,"about_ca_system_score_codex":0.0017087018,"about_ca_system_score_gemma":0.00081582065,"threshold_uncertainty_score":0.012397528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23643064,0.0028617827,0.7373724,0.00070326705,0.00009952821,0.00012890648,0.0001382784,0.000109193985,0.022155985],"genre_scores_gemma":[0.9878991,0.000654168,0.010301662,0.000047659953,0.000032808668,0.000048069178,0.000017314163,0.000007721236,0.0009914686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893194,0.00046973195,0.000038589715,0.00012795396,0.0002088531,0.00022293569],"domain_scores_gemma":[0.9959006,0.0031307496,0.00040737938,0.000122067526,0.00035160626,0.000087670414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001649611,0.0012244735,0.00079654396,0.0006482759,0.0007861119,0.0017234022,0.00077718234,0.00097412366,0.0009454723],"category_scores_gemma":[0.004730625,0.0004238132,0.00039581847,0.000807948,0.0013011068,0.0013086045,0.0010614981,0.0006527207,0.00012909388],"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.0002914548,0.000098407145,0.0011473208,0.00039898345,0.00014092021,0.000903105,0.0004679393,0.77239865,0.028954914,0.1663668,0.0009899447,0.027841527],"study_design_scores_gemma":[0.000019713287,0.00019559478,0.00022906066,0.00002853732,0.00005063006,0.0003220599,0.00011464557,0.96917087,0.0034329034,0.025842113,0.0005572737,0.000036515317],"about_ca_topic_score_codex":0.00147591,"about_ca_topic_score_gemma":0.001746525,"teacher_disagreement_score":0.0017234022,"about_ca_system_score_codex":0.0015609502,"about_ca_system_score_gemma":0.0012021547,"threshold_uncertainty_score":0.011325598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7009461,0.003036858,0.2839312,0.0004962714,0.00010933757,0.000026495725,0.00006817874,0.0004985679,0.010886925],"genre_scores_gemma":[0.98551416,0.0005344316,0.013003873,0.00002970557,0.000017020062,0.0000066287403,0.000027655466,0.00000775172,0.0008587911],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995409,0.00015498104,0.000027752909,0.00005296379,0.00016486949,0.000058498852],"domain_scores_gemma":[0.9989506,0.0004878942,0.00012660655,0.00011570359,0.0003000642,0.000019129155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000695893,0.00052424346,0.00033382446,0.00028942095,0.00018771937,0.00043361352,0.000292376,0.00056380697,0.0005962452],"category_scores_gemma":[0.0016386042,0.00014014696,0.00014121342,0.0003006499,0.00020240966,0.0003971052,0.00030176266,0.00028991752,0.0003110894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001774271,0.00020970409,0.0057908804,0.00030275184,0.00011994956,0.00059919094,0.0003770047,0.28931826,0.44288498,0.010648078,0.0018002448,0.24617475],"study_design_scores_gemma":[0.00004477784,0.00077106786,0.0030352904,0.000027021197,0.00008495452,0.0005188515,0.000054472406,0.88025904,0.111990534,0.000978657,0.0021939774,0.000041447063],"about_ca_topic_score_codex":0.00066345197,"about_ca_topic_score_gemma":0.00084358186,"teacher_disagreement_score":0.000695893,"about_ca_system_score_codex":0.00024736632,"about_ca_system_score_gemma":0.00017658107,"threshold_uncertainty_score":0.0036802888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8689343,0.00042506732,0.1264035,0.00021208145,0.000026685848,0.000028879751,0.000058778925,0.00028217814,0.0036285021],"genre_scores_gemma":[0.9979372,0.000067503584,0.0017192429,0.000006446727,0.000004842265,0.0000044211424,0.000009301028,0.0000057206744,0.0002453152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995803,0.00013254111,0.000018231174,0.00004943724,0.00012573777,0.000093697185],"domain_scores_gemma":[0.9987204,0.0007539782,0.00015842012,0.00008005251,0.0002493142,0.000037832597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047449887,0.00045982897,0.00047152463,0.00034219,0.00044266405,0.00046613373,0.00022974776,0.00055576244,0.00087209826],"category_scores_gemma":[0.0017594043,0.00013509707,0.00023867436,0.00033801794,0.0005150516,0.00043981062,0.00038992657,0.00030820994,0.00014984584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007912559,0.0000438211,0.0062315315,0.00019090722,0.00014552112,0.0005710225,0.000372871,0.84456766,0.119553514,0.010604597,0.00021737965,0.016710008],"study_design_scores_gemma":[0.000010541602,0.00023051685,0.0012207127,0.0000058944697,0.000035026627,0.00014265026,0.00002920055,0.9835743,0.014018864,0.00056735944,0.00014854314,0.000016498516],"about_ca_topic_score_codex":0.0016709913,"about_ca_topic_score_gemma":0.0007762223,"teacher_disagreement_score":0.0016709913,"about_ca_system_score_codex":0.00048598595,"about_ca_system_score_gemma":0.00038749314,"threshold_uncertainty_score":0.0035260916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.432872,0.0035786012,0.5292332,0.0010365642,0.0001222207,0.00012152729,0.00015703676,0.0007643721,0.032114517],"genre_scores_gemma":[0.99052924,0.00048727565,0.007854689,0.000059697333,0.000021408807,0.000018462777,0.000025332414,0.000014249715,0.0009897279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986131,0.00034689737,0.000048194714,0.00014278438,0.0005285187,0.0003204231],"domain_scores_gemma":[0.99356353,0.0037249462,0.0005150689,0.0004185033,0.0015884239,0.00018948631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018276602,0.00082640524,0.000630707,0.0009824501,0.0006853418,0.0012324326,0.0007008924,0.0010326082,0.001720598],"category_scores_gemma":[0.009221835,0.000320627,0.00029685293,0.00092459744,0.0010916864,0.0008911955,0.00094521546,0.0006302873,0.0003256618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046971408,0.000079948724,0.0028544301,0.0001185194,0.00007056749,0.00025722577,0.00017012646,0.90289587,0.025559915,0.035262715,0.0008669295,0.03139399],"study_design_scores_gemma":[0.000008097318,0.000100196194,0.00036665733,0.000006221018,0.000020912981,0.00008168811,0.000039077004,0.99531746,0.0015263533,0.0022737652,0.00024811598,0.000011595045],"about_ca_topic_score_codex":0.008971893,"about_ca_topic_score_gemma":0.004202531,"teacher_disagreement_score":0.008971893,"about_ca_system_score_codex":0.0016428877,"about_ca_system_score_gemma":0.0019456752,"threshold_uncertainty_score":0.017839372},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72167534,0.0021711902,0.2661667,0.00019733445,0.000056510366,0.0000389941,0.00004797386,0.0007909353,0.008855095],"genre_scores_gemma":[0.94242036,0.00048590553,0.055046234,0.00009198484,0.000020372092,0.000014144563,0.00003313163,0.000034128287,0.0018537374],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998233,0.00002352755,0.000007876534,0.00003136287,0.0000851371,0.000028948516],"domain_scores_gemma":[0.9996474,0.00010363151,0.00008573739,0.000089175745,0.000050869185,0.00002322201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001933184,0.0001506375,0.00017228581,0.0001916364,0.00013455596,0.00035858463,0.00029460105,0.0002941049,0.00058707444],"category_scores_gemma":[0.0005798015,0.000099981975,0.000101539554,0.00026586832,0.00033636784,0.00031387698,0.00030472394,0.00020589468,0.0002323536],"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.00016222445,0.000034261866,0.00049955974,0.00009889947,0.000009953243,0.000103466315,0.00012588469,0.0024872872,0.92906326,0.003177256,0.00016879984,0.06406915],"study_design_scores_gemma":[0.000024948115,0.0007503774,0.0038816796,0.00002569049,0.000021652819,0.0011669698,0.00006205349,0.0250083,0.9582892,0.0016859615,0.00905869,0.000024456103],"about_ca_topic_score_codex":0.00024446228,"about_ca_topic_score_gemma":0.00033247398,"teacher_disagreement_score":0.00058707444,"about_ca_system_score_codex":0.00021163863,"about_ca_system_score_gemma":0.00020218051,"threshold_uncertainty_score":0.001963973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06073049,0.00014129523,0.9311832,0.000086439446,0.00007585858,0.00010548346,0.0002704451,0.0016381821,0.005768634],"genre_scores_gemma":[0.8127676,0.0002733806,0.1812643,0.000059221908,0.000027565842,0.00021333402,0.00040800773,0.00017246108,0.0048140027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997962,0.000055446046,0.000014337261,0.000023205896,0.00008569162,0.000025158743],"domain_scores_gemma":[0.99969137,0.00014436067,0.000025298892,0.000064855405,0.000060842573,0.00001333711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002517735,0.0003635776,0.00042768853,0.0002636246,0.00015893417,0.0004479781,0.00072969106,0.0004583712,0.0022420548],"category_scores_gemma":[0.00086285523,0.00017136178,0.00037709955,0.00027089234,0.00024116656,0.0005736256,0.00024694946,0.0006023372,0.00049152056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064389584,0.000021330487,0.00029437014,0.000029147037,0.000016276574,0.00007637321,0.000025636698,0.96753204,0.007963445,0.013955656,0.00040808797,0.009613337],"study_design_scores_gemma":[0.00000844832,0.0000224671,0.000043071694,0.0000014037707,0.0000035764178,0.000018610008,0.0000018580241,0.99621576,0.001990625,0.000722754,0.0009679425,0.000003449877],"about_ca_topic_score_codex":0.0017940437,"about_ca_topic_score_gemma":0.0014810531,"teacher_disagreement_score":0.0022420548,"about_ca_system_score_codex":0.00029099916,"about_ca_system_score_gemma":0.00047669373,"threshold_uncertainty_score":0.00750041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022966335,0.00070769055,0.9710876,0.0002803949,0.000088974244,0.000038444174,0.00012757059,0.00021823998,0.00448471],"genre_scores_gemma":[0.8938018,0.0016852918,0.09942222,0.00022426712,0.00022845062,0.00028786526,0.00025854525,0.00013442348,0.003957142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595934,0.0010974379,0.00022642591,0.00045351245,0.0017010601,0.0005622655],"domain_scores_gemma":[0.9713589,0.022044383,0.0021844474,0.0019282352,0.0021446045,0.0003393144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004553578,0.0020066155,0.0015534259,0.001752823,0.00095899054,0.0026191394,0.0015632586,0.0016840814,0.004096473],"category_scores_gemma":[0.032947898,0.00057489553,0.0008353171,0.0020568722,0.0024609144,0.004138334,0.0033063735,0.0021833042,0.00080187264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028380842,0.00004847455,0.00092497305,0.000312587,0.00009204558,0.00041546216,0.00023550917,0.65339977,0.009480065,0.29929915,0.0017408569,0.03376732],"study_design_scores_gemma":[0.000015552598,0.00013406776,0.0002983941,0.000068277004,0.000036380414,0.0005617687,0.00006183279,0.8805764,0.007824034,0.10879493,0.0015569865,0.00007148575],"about_ca_topic_score_codex":0.0006190325,"about_ca_topic_score_gemma":0.0005814443,"teacher_disagreement_score":0.004553578,"about_ca_system_score_codex":0.0016775795,"about_ca_system_score_gemma":0.0011543806,"threshold_uncertainty_score":0.024081886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38470986,0.005201488,0.5898363,0.00085084734,0.00007706454,0.00012173983,0.00020859383,0.0004639047,0.018530246],"genre_scores_gemma":[0.9865194,0.0009074527,0.011252471,0.00004969157,0.000027231174,0.00003315891,0.000051544175,0.000024016672,0.0011349603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980585,0.00083177834,0.00007787576,0.00016975375,0.0005703387,0.00029163266],"domain_scores_gemma":[0.9888325,0.008184591,0.0007563813,0.00063659076,0.0014755938,0.00011428572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003254073,0.001257664,0.0010311297,0.001354205,0.0006685548,0.0011558166,0.0007668154,0.0011214804,0.0014086826],"category_scores_gemma":[0.012802216,0.00039389104,0.0005406358,0.0010414574,0.00091778557,0.0014110941,0.000969873,0.00067200017,0.00042288948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049477414,0.00012847738,0.003133755,0.00023843735,0.00015528945,0.00024101963,0.00053534994,0.85640085,0.023090186,0.06782827,0.0011470098,0.04660655],"study_design_scores_gemma":[0.00001835174,0.00022906544,0.0006758552,0.000017681257,0.000046130546,0.00018937328,0.00006597122,0.98615533,0.0054584676,0.0066155884,0.00050043897,0.000027795151],"about_ca_topic_score_codex":0.0026014352,"about_ca_topic_score_gemma":0.0018202083,"teacher_disagreement_score":0.003254073,"about_ca_system_score_codex":0.0015313515,"about_ca_system_score_gemma":0.0009125059,"threshold_uncertainty_score":0.017209351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9552739,0.00042703358,0.04136127,0.00011851963,0.000026717766,0.00001926829,0.000049872153,0.0001820228,0.002541425],"genre_scores_gemma":[0.9938632,0.00009988602,0.005492424,0.0000135748805,0.0000069105167,0.0000061847722,0.000032686286,0.000006715056,0.00047841968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901307,0.00024962286,0.000046630506,0.00009246252,0.00045400756,0.00014417223],"domain_scores_gemma":[0.9972716,0.0014269324,0.00045972146,0.0001987757,0.00054019236,0.00010276749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075421913,0.00061588554,0.0004200351,0.00045781687,0.00045590525,0.0006301188,0.0005236534,0.0005674001,0.00063664885],"category_scores_gemma":[0.0034795713,0.00022103566,0.00018816144,0.0005950868,0.00064901,0.0006025786,0.0007967307,0.0003846476,0.0001584199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030343519,0.00022119223,0.016056608,0.00027203036,0.00020144871,0.0010594793,0.0003665153,0.5552408,0.30628031,0.0073390054,0.0005783776,0.10934984],"study_design_scores_gemma":[0.000038735576,0.0007937814,0.0045755436,0.000026030948,0.000078193785,0.00045836848,0.00004119026,0.8281508,0.1639763,0.0012056273,0.00060644955,0.00004893088],"about_ca_topic_score_codex":0.0027140328,"about_ca_topic_score_gemma":0.0023441145,"teacher_disagreement_score":0.0027140328,"about_ca_system_score_codex":0.0009192607,"about_ca_system_score_gemma":0.000770737,"threshold_uncertainty_score":0.0066697598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03230446,0.00027089773,0.9654498,0.00011829059,0.00003530806,0.000028623295,0.000017150482,0.00013294,0.0016425608],"genre_scores_gemma":[0.9623412,0.00026641117,0.03568052,0.00006749716,0.000050949046,0.000049559185,0.000034761266,0.000017252129,0.0014918625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868053,0.00040808166,0.000043764798,0.00024251103,0.0003495007,0.00027554785],"domain_scores_gemma":[0.998181,0.0011265206,0.00024946488,0.00009716586,0.00026270334,0.00008319807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014023014,0.0009498934,0.0013012065,0.00049806683,0.00052653556,0.001372738,0.0014398003,0.0008678478,0.0008491627],"category_scores_gemma":[0.0033048294,0.00062025915,0.0007963861,0.00077737565,0.0011322248,0.0010264282,0.0011567175,0.0010659036,0.00016376487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020294068,0.0000984454,0.0010242219,0.000100123754,0.00008442465,0.0001727469,0.00011338217,0.9447453,0.0030608678,0.018381992,0.00053579506,0.031479772],"study_design_scores_gemma":[0.0000062199,0.00002544513,0.0000956416,0.0000029458613,0.000010175135,0.000020420035,0.0000059041336,0.9977672,0.00034900414,0.0016169292,0.000094374744,0.0000057751026],"about_ca_topic_score_codex":0.007968559,"about_ca_topic_score_gemma":0.0051421574,"teacher_disagreement_score":0.007968559,"about_ca_system_score_codex":0.0011504863,"about_ca_system_score_gemma":0.0016509026,"threshold_uncertainty_score":0.015844345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033638137,0.00013613653,0.99561834,0.00008276586,0.00001846439,0.000022164855,0.000018018714,0.000076745026,0.00066348526],"genre_scores_gemma":[0.5102854,0.00077897124,0.48283517,0.00014878208,0.00007859054,0.00041417909,0.0001628341,0.000070497445,0.0052256696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988123,0.0004999321,0.00006580085,0.00028345743,0.00027291983,0.000065520435],"domain_scores_gemma":[0.99862707,0.00069624465,0.00020727342,0.00011854385,0.00030688845,0.00004406432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016825179,0.0015965764,0.0014317817,0.00032710558,0.0002703848,0.0011683718,0.0013016609,0.0014351316,0.0015881608],"category_scores_gemma":[0.0037259897,0.00063272216,0.0006292063,0.0005156256,0.00084622257,0.0013059169,0.0008824953,0.0009657996,0.00066998485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027624104,0.000060851333,0.000384011,0.00024306963,0.00009319255,0.00016594035,0.00018872548,0.8532663,0.024437739,0.025833456,0.0014802767,0.0935702],"study_design_scores_gemma":[0.000038602662,0.00016208107,0.000082503975,0.000009918523,0.000016955435,0.00008130858,0.00001500563,0.9914464,0.0036091495,0.0037089707,0.0008148246,0.000014306283],"about_ca_topic_score_codex":0.00073511066,"about_ca_topic_score_gemma":0.00078591827,"teacher_disagreement_score":0.0016825179,"about_ca_system_score_codex":0.0005514483,"about_ca_system_score_gemma":0.0010371672,"threshold_uncertainty_score":0.008898139},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08457136,0.001091904,0.9080369,0.00025866818,0.000075285054,0.000082259045,0.000050601488,0.0001795387,0.0056536514],"genre_scores_gemma":[0.9034268,0.00047799016,0.09351429,0.00007865488,0.000036893845,0.000097968914,0.00005236961,0.000037588983,0.0022773112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991358,0.00046858363,0.000019736404,0.000076230914,0.00018749129,0.00011214444],"domain_scores_gemma":[0.9986308,0.0009800903,0.0001222871,0.00006991226,0.00013914313,0.00005775586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014119605,0.00043533603,0.00082757784,0.00044783275,0.00050984323,0.00092351704,0.0006257596,0.00070769363,0.0011314189],"category_scores_gemma":[0.0028259808,0.00046154912,0.00044801593,0.0008728897,0.0007297116,0.00054057006,0.0006296845,0.00064012635,0.00017620903],"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.000035125027,0.00002178493,0.0002467058,0.000019370616,0.000012736325,0.000034439083,0.000021034326,0.98511165,0.00065750966,0.005878248,0.00025546705,0.007705941],"study_design_scores_gemma":[0.000007498677,0.000021958747,0.000092959905,0.0000014732868,0.0000027173771,0.000009620102,0.0000052784944,0.99721366,0.00025822516,0.002176554,0.00020785179,0.000002261822],"about_ca_topic_score_codex":0.004405543,"about_ca_topic_score_gemma":0.0035563852,"teacher_disagreement_score":0.004405543,"about_ca_system_score_codex":0.0008846873,"about_ca_system_score_gemma":0.0010839527,"threshold_uncertainty_score":0.008759856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041458182,0.0003222009,0.95567876,0.000065499924,0.000028772221,0.00004127189,0.000009619929,0.00017047962,0.002225196],"genre_scores_gemma":[0.8171198,0.00048470506,0.18112902,0.00006942831,0.00003477653,0.000049813276,0.000020233674,0.000009390761,0.0010827482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995448,0.00018037949,0.000022995291,0.00008274741,0.000120111785,0.000048952446],"domain_scores_gemma":[0.99938345,0.0002511043,0.00009672729,0.000140779,0.00010854908,0.000019426732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007403145,0.00061903195,0.00040740782,0.000367789,0.0002589777,0.0004232843,0.0010240264,0.0005973277,0.00095355674],"category_scores_gemma":[0.0016492931,0.00019605213,0.0004996603,0.0004685422,0.00051194965,0.0007307544,0.00052107545,0.00043308598,0.00026724345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050019124,0.00034570036,0.0017623522,0.00026332197,0.0002446577,0.00047462434,0.0004909135,0.31216243,0.27794328,0.072845384,0.0018072743,0.33115992],"study_design_scores_gemma":[0.00005398786,0.00051089,0.0006611398,0.000017104203,0.000092587805,0.000542864,0.000038433252,0.95031476,0.037517853,0.0069896244,0.0032244604,0.000036403144],"about_ca_topic_score_codex":0.00069833786,"about_ca_topic_score_gemma":0.00089144695,"teacher_disagreement_score":0.0010240264,"about_ca_system_score_codex":0.00025130415,"about_ca_system_score_gemma":0.0003263919,"threshold_uncertainty_score":0.0039152503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40390238,0.0035322378,0.5774847,0.00036487012,0.00008696032,0.000052167008,0.00010884105,0.00027668974,0.014191131],"genre_scores_gemma":[0.9890443,0.00091051694,0.008656298,0.00002400358,0.000032057116,0.000017231945,0.000023565186,0.000009737525,0.0012821404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941885,0.00016252826,0.00002858711,0.00008341048,0.00017314826,0.00013347794],"domain_scores_gemma":[0.99700063,0.0020703801,0.00042052256,0.00012691943,0.00033590733,0.00004564243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006793141,0.0011623667,0.0008966843,0.000510801,0.00071357086,0.001357691,0.000670943,0.001062645,0.00061882247],"category_scores_gemma":[0.003401752,0.0002998195,0.00044274912,0.0006518448,0.0008744723,0.0010629892,0.00074544235,0.00064324954,0.00019544516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016733659,0.00003865375,0.0022264763,0.00019574305,0.00007593687,0.0010437822,0.00026615872,0.93891245,0.0145175485,0.024125885,0.00034055405,0.018089494],"study_design_scores_gemma":[0.000005081433,0.0001232608,0.0008800803,0.000013170859,0.000053006683,0.00042394368,0.00007301011,0.99056655,0.0036765065,0.003726308,0.00043821384,0.000020839832],"about_ca_topic_score_codex":0.0031938413,"about_ca_topic_score_gemma":0.0033204106,"teacher_disagreement_score":0.0031938413,"about_ca_system_score_codex":0.0010752461,"about_ca_system_score_gemma":0.0004994479,"threshold_uncertainty_score":0.0078015327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010892237,0.00023948081,0.98655,0.00015725048,0.000037214588,0.000043622927,0.00002268967,0.000104885956,0.0019526208],"genre_scores_gemma":[0.6814226,0.00076034846,0.30768892,0.00028372195,0.00016461898,0.0002749551,0.00007757665,0.000059432852,0.009267857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992581,0.0003063228,0.00003665688,0.0001246527,0.00021450363,0.000059643382],"domain_scores_gemma":[0.9986959,0.0007746083,0.00015144897,0.00009220495,0.00025490965,0.000030971773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011499702,0.00070789224,0.0009062932,0.0002499743,0.00035070663,0.00124966,0.0007610088,0.0010613337,0.0018413435],"category_scores_gemma":[0.0026852589,0.00050230604,0.00044078543,0.00041156687,0.00062748283,0.001015973,0.00088393776,0.0008912197,0.0005318781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013844707,0.000094882605,0.0005267434,0.00026928962,0.00010698697,0.00018342148,0.00021519576,0.8962606,0.015341289,0.020847647,0.0013179504,0.064697444],"study_design_scores_gemma":[0.000018595414,0.00016208764,0.000098716235,0.000011760012,0.000018957402,0.0000757041,0.000020131687,0.9923919,0.0035712372,0.002973472,0.0006464779,0.000010900449],"about_ca_topic_score_codex":0.0007025824,"about_ca_topic_score_gemma":0.00080553995,"teacher_disagreement_score":0.0018413435,"about_ca_system_score_codex":0.00057785126,"about_ca_system_score_gemma":0.0008013303,"threshold_uncertainty_score":0.0061599016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019099526,0.0007271641,0.9749477,0.00022626804,0.000025252244,0.000032195272,0.000033408356,0.00015230417,0.004756239],"genre_scores_gemma":[0.93717754,0.00069666596,0.059473746,0.000094747964,0.00004920431,0.00014078818,0.00006767135,0.0000656402,0.002233992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999199,0.00033259013,0.000029385608,0.00008899458,0.00023890639,0.00011111779],"domain_scores_gemma":[0.9971975,0.0022922067,0.00019037953,0.00007961533,0.00018561413,0.000054616008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00179771,0.0008269098,0.0010070868,0.0008220871,0.00036489085,0.0010860743,0.00093024917,0.00086340995,0.0011342268],"category_scores_gemma":[0.0058207544,0.0004259333,0.00045056292,0.001024982,0.0011512673,0.0009434389,0.0012724167,0.000882004,0.00017292834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016529677,0.000013952981,0.00009407029,0.000037344427,0.000011144367,0.000027260552,0.000036393238,0.98460627,0.00050811237,0.0057868515,0.00025445627,0.008607578],"study_design_scores_gemma":[0.0000032601479,0.000007692247,0.000039881877,0.0000035477237,0.0000022667289,0.000007025056,0.0000056440863,0.9964478,0.00017039433,0.0031867232,0.0001230249,0.0000027913939],"about_ca_topic_score_codex":0.0044556437,"about_ca_topic_score_gemma":0.0028498066,"teacher_disagreement_score":0.0044556437,"about_ca_system_score_codex":0.0016130612,"about_ca_system_score_gemma":0.0012397593,"threshold_uncertainty_score":0.01170367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67955065,0.0009420851,0.30842987,0.0003559855,0.000039301132,0.00005133314,0.00006549005,0.0005502257,0.010015025],"genre_scores_gemma":[0.9959443,0.0001455364,0.0034229006,0.000016893944,0.000009423417,0.0000074549494,0.000011356257,0.0000072470743,0.00043485122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.00028806733,0.000024133524,0.00007269083,0.00024228221,0.00012413286],"domain_scores_gemma":[0.9973456,0.0018181164,0.00028019727,0.00009540162,0.0004158159,0.00004488431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007690829,0.00074332417,0.00060556293,0.00048529965,0.00045834915,0.00075301947,0.00038001387,0.00068619236,0.00085134455],"category_scores_gemma":[0.0023060443,0.00022130599,0.00040397226,0.0007279529,0.0007552026,0.000477258,0.0004342708,0.00034853164,0.00017610523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000318196,0.00003701027,0.0024874907,0.00010065828,0.00009382052,0.0002770159,0.00011899122,0.95826495,0.022031011,0.0030623048,0.00024428737,0.012964302],"study_design_scores_gemma":[0.0000051979414,0.00012922226,0.0007371869,0.0000041068506,0.000025764273,0.00005354819,0.000020963653,0.9961488,0.0025152331,0.00027710592,0.00007421594,0.0000085580405],"about_ca_topic_score_codex":0.0046897396,"about_ca_topic_score_gemma":0.0025475975,"teacher_disagreement_score":0.0046897396,"about_ca_system_score_codex":0.00081917335,"about_ca_system_score_gemma":0.000496736,"threshold_uncertainty_score":0.009324908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02944436,0.0015373395,0.9582138,0.00037909867,0.00005240822,0.000054481374,0.00005240932,0.00011249802,0.010153628],"genre_scores_gemma":[0.9118094,0.001250401,0.07938258,0.0001202567,0.00007103182,0.00011593122,0.00006553706,0.000075070646,0.0071099363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993963,0.00028645128,0.000023683378,0.0000901659,0.00012474284,0.00007859131],"domain_scores_gemma":[0.9981505,0.0014478507,0.00016035946,0.00004669651,0.00016410576,0.000030434432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013353226,0.0015572973,0.0012690049,0.0005473152,0.00030074507,0.001218993,0.0007653345,0.0013930956,0.0017600843],"category_scores_gemma":[0.0032641864,0.00058859476,0.0006183697,0.0007608087,0.0009758724,0.0009759816,0.0009879284,0.00096330774,0.00039620942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010194579,0.0000345972,0.00013558677,0.00016345935,0.000055188346,0.00009071242,0.00005681995,0.97148603,0.0022763838,0.01434746,0.0005844144,0.0106673855],"study_design_scores_gemma":[0.000014759105,0.000053488693,0.00006913164,0.000007231993,0.000010568801,0.00002044777,0.000011577918,0.99303424,0.0005101973,0.005946434,0.00031534067,0.0000066549374],"about_ca_topic_score_codex":0.001922243,"about_ca_topic_score_gemma":0.0011867535,"teacher_disagreement_score":0.001922243,"about_ca_system_score_codex":0.0011651752,"about_ca_system_score_gemma":0.000588597,"threshold_uncertainty_score":0.008454025},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7940222,0.0012816034,0.19185609,0.00040249,0.00010640176,0.0000485675,0.00019101534,0.000781068,0.011310596],"genre_scores_gemma":[0.9854688,0.000115647665,0.0135394605,0.000067359935,0.000016417272,0.000012092807,0.000062918836,0.000012624202,0.00070466596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796367,0.0005167636,0.00008307864,0.00024488178,0.00083722535,0.0003544846],"domain_scores_gemma":[0.9957728,0.0022903972,0.00040725837,0.00039585328,0.0010186593,0.000115052084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016886685,0.00079016405,0.00074746826,0.0006819967,0.00074136455,0.0008406771,0.00066400424,0.0011577498,0.0010060368],"category_scores_gemma":[0.0065019378,0.00024212062,0.00031079742,0.0007830824,0.0009453745,0.00085800985,0.0008552024,0.00049410964,0.00023443381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031606876,0.00023564193,0.016078051,0.00039332578,0.000309217,0.0006401494,0.0005608482,0.7143325,0.1041135,0.022349218,0.0015290735,0.13629779],"study_design_scores_gemma":[0.000056702356,0.00038989566,0.0033684624,0.000030404324,0.00005812673,0.00045838376,0.00005755647,0.94305116,0.04967316,0.0021644155,0.00063877273,0.000053036805],"about_ca_topic_score_codex":0.0045248005,"about_ca_topic_score_gemma":0.003364965,"teacher_disagreement_score":0.0045248005,"about_ca_system_score_codex":0.00088891765,"about_ca_system_score_gemma":0.0015954869,"threshold_uncertainty_score":0.008996904},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002978977,0.71698767,0.19602688,0.003425435,0.0029506236,0.00032058527,0.00042410986,0.00037739464,0.07650836],"genre_scores_gemma":[0.04927239,0.84805197,0.07319377,0.0030846512,0.004742974,0.0008153228,0.0010675637,0.00012238084,0.019648938],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976866,0.0005015489,0.00025257756,0.0002616983,0.0011406979,0.00015676975],"domain_scores_gemma":[0.9969885,0.0017928589,0.00012192242,0.0002236576,0.0008090371,0.00006407862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018839702,0.0011992725,0.001205976,0.0029974054,0.0009623262,0.0021151265,0.0019884715,0.0020639296,0.006085232],"category_scores_gemma":[0.005087931,0.0007804199,0.00069059746,0.0053677014,0.0007316094,0.0038087254,0.0016953384,0.0020222417,0.0027789965],"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.00009189781,0.00013768485,0.0006897096,0.003680162,0.000080159276,0.00025038084,0.00031085336,0.008794133,0.0020021203,0.11682232,0.03802712,0.8291136],"study_design_scores_gemma":[0.000027887569,0.00019736392,0.0006912444,0.002246323,0.00010403879,0.0014065035,0.00017032388,0.020927442,0.0015243541,0.07336793,0.89925927,0.00007738432],"about_ca_topic_score_codex":0.0018608909,"about_ca_topic_score_gemma":0.0009301711,"teacher_disagreement_score":0.006085232,"about_ca_system_score_codex":0.0009890293,"about_ca_system_score_gemma":0.0018717564,"threshold_uncertainty_score":0.020357192},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26936305,0.0016478426,0.7186521,0.00031864346,0.000039271243,0.00004791273,0.00006397659,0.00034866383,0.009518523],"genre_scores_gemma":[0.9915223,0.00027785444,0.0073303264,0.000032393014,0.00001726863,0.000019838802,0.000019441584,0.000015324566,0.00076536404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982881,0.0006927925,0.00004796045,0.00017090105,0.0005790193,0.00022123221],"domain_scores_gemma":[0.99307525,0.004790862,0.000512996,0.00042806618,0.001094996,0.0000978551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023137773,0.0010072648,0.0009352334,0.0007409842,0.0004232012,0.0010625053,0.0007268497,0.00091638963,0.0009833289],"category_scores_gemma":[0.008081898,0.0003093713,0.0005462814,0.000866821,0.0010079463,0.0008501188,0.0008677991,0.00052120315,0.00026864288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013934037,0.000034645676,0.0013614488,0.000087266024,0.00007582902,0.00025635117,0.00018460602,0.9534186,0.012845557,0.014051214,0.00036369375,0.01718143],"study_design_scores_gemma":[0.000005448247,0.00014439847,0.00049515965,0.0000073358865,0.000024126964,0.00014240103,0.000032920554,0.9940646,0.0024909342,0.0024009263,0.00017930621,0.000012419355],"about_ca_topic_score_codex":0.0017280657,"about_ca_topic_score_gemma":0.00091476575,"teacher_disagreement_score":0.0023137773,"about_ca_system_score_codex":0.0013346468,"about_ca_system_score_gemma":0.0006533366,"threshold_uncertainty_score":0.012236595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17203493,0.0035685808,0.8113012,0.0006868698,0.000105417654,0.00006529682,0.0001610994,0.0001860939,0.011890636],"genre_scores_gemma":[0.9872809,0.000902869,0.010179008,0.00008770394,0.00008853151,0.00004424514,0.000024535644,0.000019064091,0.0013732464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838316,0.0006804943,0.000053199226,0.00021725359,0.000351179,0.0003146278],"domain_scores_gemma":[0.99049544,0.007933365,0.00068629824,0.00021617163,0.00053455355,0.00013426742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018848995,0.0010763884,0.0013066579,0.0005332047,0.000593795,0.0019099204,0.0012842629,0.001096915,0.0011010079],"category_scores_gemma":[0.010763426,0.0005865339,0.00041468674,0.0011470891,0.0012676971,0.0018514073,0.0011250644,0.0007960746,0.00017388005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020595526,0.000046465328,0.0012821759,0.00020615985,0.00012459185,0.0010667902,0.00024279892,0.9109287,0.0025093528,0.061383743,0.0010645371,0.020938592],"study_design_scores_gemma":[0.000032030628,0.000092781156,0.0005632377,0.00002391468,0.000044524186,0.00033383493,0.000079186946,0.97034854,0.0009816822,0.026614215,0.00086491444,0.00002116199],"about_ca_topic_score_codex":0.0026616026,"about_ca_topic_score_gemma":0.0019189779,"teacher_disagreement_score":0.0026616026,"about_ca_system_score_codex":0.0011638569,"about_ca_system_score_gemma":0.0008107921,"threshold_uncertainty_score":0.0099684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0840733,0.0006148983,0.9121799,0.00014082756,0.0000730167,0.00007378959,0.000042473566,0.00079762447,0.0020040555],"genre_scores_gemma":[0.7246757,0.0001906242,0.27287143,0.0001124433,0.00007609026,0.00008564446,0.000054503347,0.00002347632,0.0019100307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990306,0.00027466327,0.000060770763,0.000109567685,0.00041017783,0.000114328446],"domain_scores_gemma":[0.99902236,0.0002667547,0.00011893271,0.00020136086,0.0003364168,0.000054140986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803123,0.0004048069,0.00070201786,0.0006931366,0.0005946845,0.0005237357,0.0006713427,0.00046808663,0.001348754],"category_scores_gemma":[0.0017882294,0.00018940508,0.00016691534,0.00035037362,0.00041279357,0.00056445086,0.0009310765,0.0004515697,0.00032969506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012812641,0.00015334791,0.0018716418,0.00029425827,0.00009476854,0.0004524346,0.00050758413,0.077771306,0.3505019,0.045297306,0.0039273594,0.51784676],"study_design_scores_gemma":[0.00013061345,0.00044337584,0.0011867707,0.000040785657,0.00006178387,0.00064746314,0.00003536983,0.8504014,0.12629963,0.011174087,0.009495899,0.00008280347],"about_ca_topic_score_codex":0.0004370123,"about_ca_topic_score_gemma":0.0007249214,"teacher_disagreement_score":0.001348754,"about_ca_system_score_codex":0.00039035094,"about_ca_system_score_gemma":0.00052750536,"threshold_uncertainty_score":0.0045120716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075836577,0.00013421915,0.9900922,0.000078945755,0.000031419826,0.00003275915,0.0000157921,0.00007179775,0.0019590806],"genre_scores_gemma":[0.83894753,0.00039001822,0.15495698,0.00015092142,0.00009408848,0.00024931924,0.00004492789,0.00004044268,0.005125752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851865,0.00063067605,0.00005995863,0.00023024992,0.00041015362,0.00015027612],"domain_scores_gemma":[0.9980698,0.0010662734,0.0002102389,0.00026293026,0.00030366846,0.00008707692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019134451,0.0007385947,0.00070648,0.0006015922,0.0006044878,0.0009096612,0.002019477,0.00067911536,0.0015864515],"category_scores_gemma":[0.0041695037,0.00029738943,0.00041292465,0.0007797564,0.0010953012,0.0012880149,0.0011779206,0.0006446077,0.00034442852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014090835,0.000089046924,0.00045784417,0.000100793164,0.000054363158,0.00025523675,0.0003034255,0.5759796,0.008973571,0.3464503,0.0021525407,0.06504235],"study_design_scores_gemma":[0.000016701519,0.00007552402,0.000084316154,0.0000060088605,0.000013892656,0.0001170029,0.000020661895,0.9551086,0.0012636742,0.041117907,0.0021583568,0.00001732901],"about_ca_topic_score_codex":0.0012939502,"about_ca_topic_score_gemma":0.0011684641,"teacher_disagreement_score":0.002019477,"about_ca_system_score_codex":0.0009573623,"about_ca_system_score_gemma":0.0010668484,"threshold_uncertainty_score":0.010119379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022345748,0.00012022833,0.97560465,0.00005914553,0.000008937802,0.000020818145,0.000016283382,0.000075472955,0.0017487755],"genre_scores_gemma":[0.8669874,0.00027631002,0.13040943,0.00003877244,0.000029081895,0.00008840853,0.00004378886,0.000044550263,0.0020822196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995315,0.00017736854,0.000022015329,0.000073058334,0.00014363028,0.000052456147],"domain_scores_gemma":[0.99948597,0.0002939398,0.000077006865,0.000049231447,0.00007080564,0.000023104307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005799361,0.00065066834,0.00050899613,0.0003864007,0.00030534164,0.00059331924,0.0008104514,0.00044693396,0.00078290363],"category_scores_gemma":[0.0014485739,0.00027878533,0.0002890203,0.0005167405,0.0004999204,0.0009972231,0.00071780226,0.00051560736,0.00021746353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112943446,0.000037455415,0.00029960374,0.000056786976,0.000022035792,0.00006162,0.000076141274,0.90420973,0.012863634,0.023053607,0.00044152228,0.05876487],"study_design_scores_gemma":[0.000008239679,0.000030795465,0.00007540959,0.0000023930263,0.0000045525403,0.000021243392,0.000008635826,0.9934835,0.0016724836,0.0043640686,0.00032377153,0.000004898343],"about_ca_topic_score_codex":0.00094837416,"about_ca_topic_score_gemma":0.0014230696,"teacher_disagreement_score":0.00094837416,"about_ca_system_score_codex":0.000595939,"about_ca_system_score_gemma":0.0005628604,"threshold_uncertainty_score":0.0043238997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44425395,0.0008271913,0.5508473,0.00013126893,0.000021418764,0.000035582056,0.000028738881,0.00011929806,0.0037352748],"genre_scores_gemma":[0.9854359,0.00033408977,0.013646517,0.000019623416,0.00000941831,0.000018678636,0.000009951094,0.00000641197,0.0005193572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999225,0.00031480423,0.000026569094,0.00007507896,0.000278268,0.000080253296],"domain_scores_gemma":[0.99604046,0.0030604412,0.00040295493,0.0001486233,0.00031963695,0.000027827047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254165,0.0005509473,0.00039637487,0.00025931644,0.00028190447,0.00047655654,0.00037602332,0.00044918183,0.0003353546],"category_scores_gemma":[0.0041663274,0.00022439839,0.00027004653,0.0006547325,0.00065636187,0.0008623974,0.0005862419,0.00030925276,0.00008405004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019497353,0.00004713911,0.0016082571,0.00010556108,0.000084917265,0.0003153265,0.00021575963,0.9260992,0.02497467,0.017112032,0.00021270811,0.029029481],"study_design_scores_gemma":[0.000010968538,0.00012769112,0.00042021452,0.000007402761,0.000042547694,0.00014359,0.000037400576,0.98980075,0.0074230265,0.001730592,0.00024477998,0.000010971772],"about_ca_topic_score_codex":0.001506769,"about_ca_topic_score_gemma":0.0019317192,"teacher_disagreement_score":0.001506769,"about_ca_system_score_codex":0.0004783791,"about_ca_system_score_gemma":0.00051575806,"threshold_uncertainty_score":0.0054230094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18777004,0.001282884,0.79891557,0.00019781043,0.000038989125,0.00006142414,0.00015601898,0.0004508615,0.011126439],"genre_scores_gemma":[0.9785943,0.00036511375,0.020242319,0.000021465557,0.000015365236,0.00005392042,0.00005954745,0.000039977844,0.000607942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973308,0.00078516704,0.00014184337,0.00028757995,0.0010441628,0.0004104206],"domain_scores_gemma":[0.9821951,0.013573519,0.001453903,0.0013255958,0.0012605116,0.00019134051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038149813,0.0011492841,0.0009539475,0.0014644433,0.00046936466,0.0016111755,0.0013999103,0.0010310443,0.0010224904],"category_scores_gemma":[0.0269747,0.0004140747,0.0007461168,0.0011170215,0.0018117549,0.002235064,0.001323168,0.0010119322,0.00025543323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101790705,0.00003224486,0.001368209,0.00011217648,0.000043956978,0.00022682824,0.00012795217,0.9479826,0.0027679494,0.03574417,0.0001660046,0.011326194],"study_design_scores_gemma":[0.000005706828,0.00005272854,0.00068306,0.00002847765,0.000020391264,0.00021577014,0.000045029596,0.9815356,0.0038401627,0.013305649,0.00024092924,0.000026537178],"about_ca_topic_score_codex":0.0018225444,"about_ca_topic_score_gemma":0.000731837,"teacher_disagreement_score":0.0038149813,"about_ca_system_score_codex":0.0013610033,"about_ca_system_score_gemma":0.0008691562,"threshold_uncertainty_score":0.020175815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046999035,0.000088016524,0.9933143,0.000059493876,0.000021572523,0.00002926078,0.000014469866,0.0004417827,0.0013312063],"genre_scores_gemma":[0.1772079,0.0002087057,0.8199821,0.00007475318,0.000052774652,0.00013921199,0.0002088676,0.00013524143,0.001990391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986041,0.00033772734,0.00006909262,0.00024469147,0.0005453651,0.0001990411],"domain_scores_gemma":[0.99853885,0.0006353269,0.00007825221,0.0003680079,0.0003219731,0.000057650283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073901284,0.0007812548,0.0008520952,0.0011326699,0.00060316356,0.0008268523,0.0013209248,0.0006351828,0.002118644],"category_scores_gemma":[0.0027714649,0.0002712433,0.00068465725,0.0022031048,0.0007227913,0.0018104868,0.001111043,0.0012327513,0.00053695205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036382547,0.0002229965,0.00088636467,0.00021504807,0.00006186799,0.0001416983,0.00021983027,0.25355223,0.03793168,0.10939533,0.0081044985,0.5889046],"study_design_scores_gemma":[0.00003921887,0.00006674314,0.00009371832,0.0000070820433,0.000015873535,0.00010232644,0.000018430068,0.9731588,0.0069296793,0.017047182,0.0025073641,0.000013624256],"about_ca_topic_score_codex":0.0059263394,"about_ca_topic_score_gemma":0.004027389,"teacher_disagreement_score":0.0059263394,"about_ca_system_score_codex":0.0013751005,"about_ca_system_score_gemma":0.0023576533,"threshold_uncertainty_score":0.011783719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076642856,0.003201131,0.90654576,0.00031505176,0.00007276418,0.000032896936,0.00004246625,0.0001759328,0.012971142],"genre_scores_gemma":[0.95568323,0.0015250464,0.03992915,0.000053083477,0.00006487532,0.000032374413,0.000024355846,0.000015270338,0.002672678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972063,0.000118765834,0.000009205882,0.000032882876,0.000085491214,0.000033095934],"domain_scores_gemma":[0.999201,0.00054842595,0.00007649676,0.000079424724,0.00008181351,0.000012846318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041523975,0.00058935315,0.00034554905,0.0002730005,0.0003234772,0.00061279256,0.00052396616,0.00065763865,0.0009902461],"category_scores_gemma":[0.0013675503,0.00018681888,0.00034716705,0.00037544093,0.00031472588,0.00059124804,0.00042912705,0.0004292361,0.00027475914],"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.00029593075,0.00009785162,0.0010543744,0.00038309034,0.00008482812,0.00091027643,0.0004806152,0.6899321,0.07826238,0.10349487,0.0031404975,0.12186316],"study_design_scores_gemma":[0.000013793962,0.00031339366,0.00030508058,0.000024485396,0.0000416266,0.00042900385,0.00006826524,0.96816707,0.010713157,0.01323615,0.0066664135,0.000021613108],"about_ca_topic_score_codex":0.00050135417,"about_ca_topic_score_gemma":0.0010782733,"teacher_disagreement_score":0.0009902461,"about_ca_system_score_codex":0.00042914733,"about_ca_system_score_gemma":0.00019160552,"threshold_uncertainty_score":0.003312707},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036146015,0.00045315517,0.96088946,0.00010299394,0.000037923586,0.000029047975,0.00010962403,0.0004445561,0.0017872581],"genre_scores_gemma":[0.84696937,0.00042636506,0.14988756,0.00006694419,0.000044648572,0.000119620076,0.00043721838,0.00015632289,0.0018920061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881005,0.0004138925,0.00010208824,0.00016675025,0.0004282201,0.00007912653],"domain_scores_gemma":[0.99564147,0.0028603226,0.00033365152,0.00051087135,0.00058060203,0.00007307757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732741,0.0011802152,0.0006822889,0.0010254219,0.0003482309,0.0010172335,0.00093831227,0.00088724465,0.0013798422],"category_scores_gemma":[0.008325461,0.00028811817,0.0007153691,0.0007054271,0.00060548505,0.0011814153,0.0008742565,0.000938572,0.00032372525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002833114,0.0000617513,0.0020178757,0.00021279983,0.00012510213,0.00007616386,0.00009200705,0.87514895,0.012380201,0.010982537,0.0010882126,0.09753117],"study_design_scores_gemma":[0.000002480344,0.000034917415,0.00048629378,0.000009319062,0.00001045649,0.000039581148,0.00000990911,0.99442023,0.0028102968,0.0017348964,0.00043161417,0.000010000449],"about_ca_topic_score_codex":0.0033835452,"about_ca_topic_score_gemma":0.0034772805,"teacher_disagreement_score":0.0033835452,"about_ca_system_score_codex":0.0007657869,"about_ca_system_score_gemma":0.0008103491,"threshold_uncertainty_score":0.009163678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34697947,0.0004721067,0.6369243,0.00024003159,0.00010052968,0.00011711042,0.000085787746,0.0006057029,0.0144749805],"genre_scores_gemma":[0.89193535,0.00020860322,0.10532846,0.000042441832,0.000009328515,0.000045893976,0.000066448185,0.000030093124,0.0023333705],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983346,0.00003856186,0.000011126115,0.00002476194,0.00006287201,0.000029291252],"domain_scores_gemma":[0.99963,0.00013172481,0.000081141,0.000054071148,0.000080472324,0.000022669232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019516768,0.00030325574,0.00022263617,0.00031907883,0.0001875469,0.0003815879,0.00031359223,0.0002238855,0.00068875507],"category_scores_gemma":[0.00087680796,0.00012690912,0.00016352207,0.00017086252,0.00039379194,0.00032440588,0.00044263218,0.00017239853,0.00035316983],"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.0003140817,0.00007928454,0.001069976,0.00022974332,0.000022865219,0.00048296273,0.0004256071,0.08272183,0.6356632,0.16176915,0.0011887216,0.11603258],"study_design_scores_gemma":[0.000086375,0.0005035356,0.0006261811,0.00003685203,0.000024035895,0.00043314093,0.00008946171,0.52089685,0.43228325,0.027620899,0.017344702,0.00005473881],"about_ca_topic_score_codex":0.00029994588,"about_ca_topic_score_gemma":0.00038943547,"teacher_disagreement_score":0.00068875507,"about_ca_system_score_codex":0.0002671115,"about_ca_system_score_gemma":0.0002513056,"threshold_uncertainty_score":0.0023041368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07753221,0.0012888706,0.91708905,0.00025553038,0.000053854907,0.000039478648,0.000037402733,0.00023103594,0.003472636],"genre_scores_gemma":[0.95389795,0.00066031766,0.04379321,0.000053796884,0.000050965595,0.00006944852,0.000031861502,0.000014153795,0.0014283817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988851,0.0006206223,0.000041055733,0.00010959792,0.00024082919,0.00010285761],"domain_scores_gemma":[0.99868625,0.00075135514,0.00016712694,0.0002022292,0.0001461347,0.00004693379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000968972,0.0009392559,0.0007661259,0.0004754632,0.00036810612,0.0008516832,0.00082581287,0.0007913501,0.0004985459],"category_scores_gemma":[0.0018745717,0.0004241845,0.00046928218,0.0009592203,0.0009942345,0.0008339309,0.0012069558,0.0005682779,0.00032782892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031888255,0.000037070462,0.0010222163,0.00018265123,0.00010714364,0.00070980034,0.00035738805,0.79005194,0.057258867,0.05059413,0.0010939651,0.098266006],"study_design_scores_gemma":[0.00005221999,0.00029572088,0.0005182989,0.000019435163,0.000041203533,0.00045008695,0.00004959224,0.96564084,0.0072506815,0.023581449,0.00205288,0.000047562487],"about_ca_topic_score_codex":0.00057749724,"about_ca_topic_score_gemma":0.0007948519,"teacher_disagreement_score":0.000968972,"about_ca_system_score_codex":0.00047149693,"about_ca_system_score_gemma":0.0003229463,"threshold_uncertainty_score":0.0051245093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003054657,0.00039127283,0.9960218,0.00003844549,0.000017793185,0.0000070126903,0.000006979724,0.00007834702,0.00038370967],"genre_scores_gemma":[0.44157678,0.001817774,0.55314535,0.00013233854,0.0001476619,0.00009169079,0.00013449744,0.00014034503,0.0028135362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986267,0.0005181782,0.00008657389,0.00022946898,0.00046502202,0.00007414632],"domain_scores_gemma":[0.99825233,0.0009962954,0.00019471972,0.0002468792,0.0002903801,0.000019447687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016280287,0.0010209238,0.0008349482,0.0006391527,0.00020507746,0.0010720652,0.0007659869,0.000914037,0.0009384767],"category_scores_gemma":[0.0071012443,0.00049097155,0.000562285,0.00076338864,0.00061475695,0.0012940617,0.0008712495,0.000992779,0.00040058265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037305025,0.000104388266,0.0007125423,0.0003505835,0.00023960558,0.00012793089,0.0001233195,0.61106306,0.053810425,0.052381907,0.0016005996,0.27911258],"study_design_scores_gemma":[0.000009260121,0.00005586198,0.00025638033,0.000017659815,0.000022807253,0.00006939153,0.000009169798,0.97939736,0.013596805,0.0053569386,0.0011860572,0.000022425154],"about_ca_topic_score_codex":0.00072451116,"about_ca_topic_score_gemma":0.00062464917,"teacher_disagreement_score":0.0016280287,"about_ca_system_score_codex":0.0004354288,"about_ca_system_score_gemma":0.00043746346,"threshold_uncertainty_score":0.008609951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08965083,0.0022644673,0.8990532,0.0002557405,0.00006515759,0.000056254812,0.000037650923,0.000112901245,0.008503799],"genre_scores_gemma":[0.9402181,0.0018915432,0.05236301,0.00011571309,0.00006398273,0.00011480866,0.000029359375,0.000016122274,0.0051872837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959487,0.00015262682,0.000018777242,0.00008393895,0.00010319578,0.000046524587],"domain_scores_gemma":[0.9994949,0.00029910117,0.00007609275,0.000037446538,0.00007311979,0.000019226329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008259777,0.0008472924,0.0007375565,0.00044787754,0.00042197978,0.0009844562,0.0008029557,0.0010168091,0.000762683],"category_scores_gemma":[0.0010346165,0.00042350692,0.0005798681,0.0008157437,0.00063967926,0.001293145,0.0010600575,0.00044306176,0.00030646854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002061561,0.00007416122,0.0005446647,0.000225443,0.00018202844,0.00050126907,0.0002802493,0.8823611,0.0335469,0.03770656,0.00047921165,0.04389227],"study_design_scores_gemma":[0.000025798074,0.0002639509,0.00022233848,0.000015210605,0.000056020363,0.00015406593,0.00006090657,0.9825133,0.0031406048,0.012287366,0.0012382042,0.000022231103],"about_ca_topic_score_codex":0.0006238385,"about_ca_topic_score_gemma":0.0006689277,"teacher_disagreement_score":0.0010168091,"about_ca_system_score_codex":0.00054336095,"about_ca_system_score_gemma":0.00029371007,"threshold_uncertainty_score":0.004368186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8046789,0.0015429425,0.18517222,0.0004440073,0.000030855474,0.000025310588,0.00008123197,0.00029452684,0.007729986],"genre_scores_gemma":[0.9960748,0.00019784085,0.0033461223,0.000023696148,0.00000752059,0.0000067528927,0.000013357002,0.000011061913,0.00031899475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979214,0.00089775235,0.000073761956,0.00015061795,0.0007179539,0.00023850605],"domain_scores_gemma":[0.9818526,0.0137970075,0.0015127347,0.00085749105,0.0018588881,0.00012127913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026288356,0.000853416,0.00080427324,0.00044628966,0.00045721108,0.000794911,0.0004866878,0.0008070517,0.00061903225],"category_scores_gemma":[0.016422939,0.00035925824,0.0002571307,0.0007015865,0.0010074419,0.0012384764,0.00094498135,0.00047666012,0.00021509377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024135069,0.000043351265,0.0041176965,0.000087315944,0.00008510834,0.00036235264,0.00014708447,0.95813906,0.014102862,0.008698856,0.00022359811,0.013751506],"study_design_scores_gemma":[0.000014662671,0.00020025208,0.0020241637,0.000016159102,0.0000463866,0.000331994,0.000070067,0.98218346,0.012074144,0.002814382,0.00019733388,0.000026941378],"about_ca_topic_score_codex":0.001506645,"about_ca_topic_score_gemma":0.0019005617,"teacher_disagreement_score":0.0026288356,"about_ca_system_score_codex":0.00077454466,"about_ca_system_score_gemma":0.0009095164,"threshold_uncertainty_score":0.013902783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030187044,0.0004611165,0.96501887,0.00017142313,0.000033196982,0.000035048124,0.000017640892,0.000053917123,0.004021767],"genre_scores_gemma":[0.7705387,0.0018214339,0.2221706,0.00014175792,0.00009065959,0.0001374556,0.00005592357,0.000035849363,0.0050076847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950993,0.00018599347,0.000014978505,0.000041607076,0.00018705898,0.000060440507],"domain_scores_gemma":[0.9982199,0.0012067044,0.0001748862,0.00014531548,0.00021907754,0.000034108845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079859374,0.0007839301,0.0004220711,0.0005574488,0.00029320535,0.0008258456,0.00047909032,0.00074480893,0.0007941959],"category_scores_gemma":[0.0027960248,0.00031360926,0.00035017324,0.00065137155,0.0010452465,0.0007373256,0.00093930465,0.0011268482,0.0002582774],"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.00018310235,0.000068027955,0.00047075708,0.00015771364,0.000043501866,0.00019148015,0.00028087277,0.6254182,0.01646662,0.31505725,0.00083655876,0.040825903],"study_design_scores_gemma":[0.000011777184,0.00006907434,0.00006118165,0.000012761016,0.000010976747,0.00006005278,0.000021435977,0.97404873,0.005722413,0.018616403,0.0013539906,0.000011242873],"about_ca_topic_score_codex":0.00072402356,"about_ca_topic_score_gemma":0.0006229084,"teacher_disagreement_score":0.0008258456,"about_ca_system_score_codex":0.0005632999,"about_ca_system_score_gemma":0.00063253794,"threshold_uncertainty_score":0.004223466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07423312,0.0012649753,0.92201066,0.0001595288,0.0000792815,0.00006272437,0.000024608187,0.00016947341,0.0019955826],"genre_scores_gemma":[0.936424,0.000377327,0.062379606,0.00007064629,0.000044722,0.00007526889,0.000020575522,0.000027235845,0.0005805528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988562,0.00040980167,0.00007808934,0.00023591219,0.00024522754,0.00017486938],"domain_scores_gemma":[0.99694675,0.001897575,0.00047504087,0.00018923088,0.0003472386,0.00014415104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023614,0.001047617,0.00072487927,0.00044853037,0.00041675026,0.0010712739,0.0010549165,0.00074300263,0.0005981862],"category_scores_gemma":[0.0064541963,0.0006093758,0.00033881952,0.0004091831,0.0006281491,0.0010140674,0.0010764443,0.0006563691,0.000119499964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058072136,0.00021798827,0.0013619214,0.000203734,0.0001240955,0.00016790457,0.00027439446,0.83051616,0.043565977,0.018272271,0.0007716042,0.10394323],"study_design_scores_gemma":[0.000025744917,0.00022475244,0.00036136011,0.0000132208515,0.00004331248,0.00007597352,0.000029683213,0.9902006,0.005293223,0.0031473618,0.0005686424,0.000016156933],"about_ca_topic_score_codex":0.0012351713,"about_ca_topic_score_gemma":0.0016062129,"teacher_disagreement_score":0.0023614,"about_ca_system_score_codex":0.0009324263,"about_ca_system_score_gemma":0.0012659469,"threshold_uncertainty_score":0.012488425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76967615,0.00187316,0.2147397,0.000319587,0.00006971244,0.000052281066,0.000077610326,0.00017151624,0.013020261],"genre_scores_gemma":[0.9970312,0.00016629524,0.0024658416,0.000015528674,0.000008048153,0.000007609003,0.000009648927,0.0000051929687,0.00029051874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990897,0.0002730537,0.000027439062,0.00010554038,0.00021471654,0.00028960055],"domain_scores_gemma":[0.9954673,0.0029590412,0.0004498711,0.00024101899,0.00073340157,0.00014940482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016472006,0.0008302156,0.00065120956,0.0005833591,0.00073413237,0.0011803292,0.00080625183,0.00050664996,0.00066653336],"category_scores_gemma":[0.0060270512,0.00023429526,0.00030810945,0.00072376314,0.0007619794,0.0009195572,0.0009970265,0.0003700305,0.00007489634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040296707,0.000094537274,0.004623101,0.0001215312,0.000092839706,0.0004207832,0.00019989317,0.95017976,0.008048158,0.014618961,0.0004964714,0.020700894],"study_design_scores_gemma":[0.0000063500315,0.0001114806,0.00073680526,0.000005436341,0.00002369036,0.00013137916,0.000085093845,0.9952922,0.0014751691,0.0019669728,0.00015445065,0.000011025596],"about_ca_topic_score_codex":0.0077132764,"about_ca_topic_score_gemma":0.006839332,"teacher_disagreement_score":0.0077132764,"about_ca_system_score_codex":0.0013607965,"about_ca_system_score_gemma":0.0015710008,"threshold_uncertainty_score":0.015336812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005331452,0.000069852744,0.9919911,0.00004197607,0.000035939214,0.000057466696,0.000046212925,0.00050659967,0.0019193181],"genre_scores_gemma":[0.18504086,0.0003249744,0.80725074,0.00009518451,0.00008357685,0.00022438001,0.00046890706,0.00017880181,0.0063325823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.000090750036,0.00002878747,0.000070946386,0.00024933313,0.000040650226],"domain_scores_gemma":[0.99947923,0.00015115348,0.000043672084,0.00007483953,0.00022977046,0.00002132064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034202906,0.00075412425,0.00033821166,0.0007811856,0.00052448036,0.00038845677,0.0005711948,0.00033320824,0.0036490993],"category_scores_gemma":[0.0014302124,0.00022700743,0.00041413627,0.00057767396,0.00029019738,0.00049746095,0.0005174675,0.00058348145,0.0011668624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040016577,0.00008263982,0.001025859,0.00026649213,0.0000440098,0.00036844084,0.00038002987,0.18583103,0.10245928,0.05317435,0.0065397867,0.649428],"study_design_scores_gemma":[0.00008494148,0.00017315737,0.00036095912,0.000022125516,0.000031492495,0.00042393978,0.00004690704,0.92323935,0.056796294,0.009893464,0.008885277,0.00004202066],"about_ca_topic_score_codex":0.0038011342,"about_ca_topic_score_gemma":0.004134178,"teacher_disagreement_score":0.0038011342,"about_ca_system_score_codex":0.0005037001,"about_ca_system_score_gemma":0.001846974,"threshold_uncertainty_score":0.012207389},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051910937,0.00025485188,0.9457297,0.00005339383,0.000021061343,0.000019788906,0.0000075881167,0.0004314949,0.0015712054],"genre_scores_gemma":[0.7959843,0.00026153034,0.19917966,0.00007086601,0.000028765253,0.00004579404,0.000033198266,0.000044055072,0.0043517947],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991596,0.000014038364,0.0000050450944,0.000019363373,0.00003503837,0.000010538763],"domain_scores_gemma":[0.9998185,0.0000831764,0.00003345881,0.000022412216,0.00003770223,0.000004723075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015888417,0.00033058802,0.0001835191,0.00016085581,0.00015076551,0.00029448845,0.0004608147,0.00029170385,0.0006901655],"category_scores_gemma":[0.00063220976,0.00014412183,0.00018111839,0.00014345247,0.00022222304,0.00033211915,0.00028342012,0.00041244624,0.00021816508],"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.0001685993,0.00006898704,0.0009771063,0.00014604696,0.000063640575,0.00021740046,0.00019493637,0.29273587,0.16500288,0.004256432,0.00057124597,0.53559685],"study_design_scores_gemma":[0.000010574117,0.0001246673,0.00042095367,0.000008887171,0.000016726735,0.00020215519,0.000013715803,0.94254553,0.053448167,0.0010530694,0.0021451658,0.000010414194],"about_ca_topic_score_codex":0.0007364457,"about_ca_topic_score_gemma":0.0012726494,"teacher_disagreement_score":0.0007364457,"about_ca_system_score_codex":0.00019533951,"about_ca_system_score_gemma":0.0002463996,"threshold_uncertainty_score":0.0023088455},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1791992,0.0006198257,0.81316245,0.00021560151,0.000032840002,0.000043648273,0.000020864503,0.00012653689,0.0065790815],"genre_scores_gemma":[0.98056066,0.00017287984,0.018535249,0.000021888047,0.000009867815,0.000014699565,0.000004578634,0.000007872456,0.00067235396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.00025486483,0.000025361214,0.00006852206,0.00014699722,0.000073076146],"domain_scores_gemma":[0.9991549,0.00055014965,0.00011449369,0.00007643978,0.00008388633,0.00002016927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008145762,0.00063470413,0.00044288885,0.00022962841,0.00022120644,0.0005741048,0.00046845956,0.0004440717,0.00073009037],"category_scores_gemma":[0.0019746546,0.00024747037,0.0002611186,0.0003534644,0.00083272986,0.00060700206,0.0006501671,0.00040807208,0.00015872427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019493955,0.000066209315,0.00043455826,0.00010377498,0.000054767414,0.00012813474,0.00018825986,0.9064634,0.043049365,0.024350233,0.00028959336,0.024676735],"study_design_scores_gemma":[0.000027078691,0.00015852015,0.00024239373,0.000008598661,0.000023178116,0.00006270266,0.00003396571,0.98028827,0.013223086,0.005531428,0.00038835983,0.000012387706],"about_ca_topic_score_codex":0.00050713384,"about_ca_topic_score_gemma":0.00061169115,"teacher_disagreement_score":0.0008145762,"about_ca_system_score_codex":0.0004845559,"about_ca_system_score_gemma":0.000504414,"threshold_uncertainty_score":0.0043079257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012766159,0.00009399809,0.9842681,0.00004687409,0.000014280052,0.000058386115,0.00006263946,0.00016851137,0.0025210383],"genre_scores_gemma":[0.17431684,0.00029300654,0.8218721,0.00007429868,0.00002346818,0.00024742927,0.00031470766,0.00007855486,0.0027795853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930644,0.00019665623,0.000035932197,0.000066500186,0.00033309063,0.00006130346],"domain_scores_gemma":[0.9987048,0.00072978524,0.00011633148,0.00018600535,0.00022425553,0.00003883376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006218798,0.00058936636,0.00068386557,0.0008428471,0.00033226673,0.00059827435,0.000827792,0.00062676653,0.0026260703],"category_scores_gemma":[0.0035557246,0.00037700395,0.00048194916,0.0010403696,0.0006463271,0.00096395,0.0010590667,0.001005062,0.00071961596],"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.00028881768,0.00010128568,0.00045235266,0.00027770252,0.00004785633,0.00032168574,0.00023824892,0.45359626,0.06457776,0.2856314,0.003071446,0.19139527],"study_design_scores_gemma":[0.000051161336,0.00012226272,0.00017509419,0.00002780803,0.00001269748,0.00020034121,0.000024854178,0.92741114,0.027937405,0.037834138,0.0061676875,0.000035478726],"about_ca_topic_score_codex":0.0010211549,"about_ca_topic_score_gemma":0.0011877539,"teacher_disagreement_score":0.0026260703,"about_ca_system_score_codex":0.0004179151,"about_ca_system_score_gemma":0.001234291,"threshold_uncertainty_score":0.008785069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26913905,0.0034851034,0.7071837,0.00039407137,0.000090103116,0.00005259002,0.00010236969,0.00076548866,0.01878763],"genre_scores_gemma":[0.99062246,0.00067627826,0.008172229,0.000017207196,0.000016571183,0.000012514454,0.000017685983,0.000015040807,0.00045003791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.00020974144,0.00001890285,0.000053470325,0.00020298365,0.000079036596],"domain_scores_gemma":[0.9982284,0.0011580173,0.00019495474,0.00010777333,0.00027129607,0.000039646457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074394426,0.0005241023,0.000618274,0.00043853043,0.0003088444,0.00068856374,0.0005153089,0.00040779583,0.00095124595],"category_scores_gemma":[0.0025559429,0.00016248738,0.00030945096,0.00055635447,0.0004561761,0.00055792875,0.00054039154,0.00034808883,0.00017670673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022539371,0.00004930778,0.0015464696,0.0001595795,0.000055232416,0.0002890769,0.00016990115,0.93197304,0.024336057,0.013761863,0.00072167057,0.0267125],"study_design_scores_gemma":[0.0000049381847,0.000097704884,0.00057871564,0.000011317768,0.00002019678,0.000112234135,0.000020611256,0.9935121,0.0036686661,0.001638682,0.000324275,0.000010527933],"about_ca_topic_score_codex":0.0010554598,"about_ca_topic_score_gemma":0.00074657693,"teacher_disagreement_score":0.0010554598,"about_ca_system_score_codex":0.00062166445,"about_ca_system_score_gemma":0.00032359562,"threshold_uncertainty_score":0.0045104623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39613423,0.00202448,0.5729335,0.0006862185,0.000042661046,0.000042695727,0.00016124068,0.0001474469,0.027827507],"genre_scores_gemma":[0.9905032,0.0006261623,0.0075988877,0.00003942091,0.000027963237,0.00003047153,0.00004792044,0.000027859185,0.0010981193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897456,0.0004653309,0.000022592489,0.00007156949,0.00030408346,0.00016185676],"domain_scores_gemma":[0.99258024,0.0064067394,0.0003090146,0.00028388915,0.00034755838,0.000072628885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018213512,0.00078988937,0.0006914608,0.0008201383,0.00028618073,0.0011393538,0.0007241885,0.00059586804,0.00140739],"category_scores_gemma":[0.008948318,0.00022876826,0.00033008316,0.00078947993,0.0022059053,0.0013448303,0.0010537173,0.00066323386,0.00019789868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000678776,0.000033638273,0.00050852034,0.00006988715,0.000026579526,0.00008361598,0.000056505738,0.8859988,0.0040478474,0.10364352,0.00024058412,0.005222574],"study_design_scores_gemma":[0.0000067002284,0.000022007705,0.00041455455,0.000021624497,0.0000078133435,0.000036242553,0.0000159066,0.97821414,0.0022586258,0.018810788,0.0001806456,0.000010959463],"about_ca_topic_score_codex":0.0012518704,"about_ca_topic_score_gemma":0.0006791988,"teacher_disagreement_score":0.0018213512,"about_ca_system_score_codex":0.0010183898,"about_ca_system_score_gemma":0.000700653,"threshold_uncertainty_score":0.009632349},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038465574,0.00034300998,0.95762783,0.00015226826,0.000030637842,0.000026102101,0.000028895643,0.00009533867,0.003230385],"genre_scores_gemma":[0.92573357,0.00031728132,0.07187305,0.000056181565,0.00002732225,0.00005423314,0.000028360162,0.00001723155,0.0018926882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996573,0.0001422806,0.000012650057,0.000040146555,0.00009990594,0.00004779111],"domain_scores_gemma":[0.9997491,0.00014280646,0.00003637658,0.000027405924,0.000035962585,0.000008325423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045126976,0.0004492705,0.00045239518,0.00020947245,0.00021671611,0.00044100863,0.00046750915,0.0004003795,0.0006429379],"category_scores_gemma":[0.0011927163,0.00021495538,0.00019726381,0.00051152677,0.00042995028,0.0006188933,0.00058287726,0.000319565,0.00018116987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008588916,0.000035790752,0.00028460668,0.00008379527,0.00001837733,0.000101341335,0.00004155452,0.9211102,0.010313833,0.022144973,0.00053714064,0.045242492],"study_design_scores_gemma":[0.0000113208325,0.000051844516,0.00014851261,0.0000048213255,0.0000041988233,0.00002973066,0.00001138204,0.99014837,0.002471079,0.006507971,0.0006065977,0.0000042985343],"about_ca_topic_score_codex":0.0005431556,"about_ca_topic_score_gemma":0.000851988,"teacher_disagreement_score":0.0006429379,"about_ca_system_score_codex":0.00031118494,"about_ca_system_score_gemma":0.00046616726,"threshold_uncertainty_score":0.00238657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14841844,0.00068873365,0.84677047,0.00021771231,0.000059755836,0.000029745475,0.000029419627,0.00017912251,0.0036066363],"genre_scores_gemma":[0.91053855,0.000361523,0.08754189,0.00006382252,0.00003062063,0.00002380397,0.000028619244,0.000006083878,0.0014050634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998679,0.000025567517,0.000004896288,0.00001595831,0.00006554148,0.00002010624],"domain_scores_gemma":[0.9998616,0.000062152176,0.000019850768,0.000020643578,0.000027610626,0.000008034728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026487323,0.00023837572,0.00016944435,0.00026878226,0.00018500599,0.00027493917,0.0003027052,0.0003176932,0.0005119167],"category_scores_gemma":[0.0006096727,0.00007539193,0.00014563215,0.00021922874,0.000260345,0.00031750937,0.00021448429,0.00023915611,0.00014079943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075445656,0.00022800006,0.0023209376,0.00013297153,0.000059157046,0.00035951223,0.00021335586,0.1303467,0.2788532,0.03041861,0.0017978423,0.5545152],"study_design_scores_gemma":[0.000016500846,0.00015946192,0.0010501237,0.000012689048,0.000020691094,0.00016877444,0.00003086205,0.9396115,0.054122306,0.0027718814,0.0020198682,0.000015363856],"about_ca_topic_score_codex":0.0011565572,"about_ca_topic_score_gemma":0.0017715201,"teacher_disagreement_score":0.0011565572,"about_ca_system_score_codex":0.0002517296,"about_ca_system_score_gemma":0.00032934762,"threshold_uncertainty_score":0.0022996664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050096128,0.0005079596,0.94397265,0.0003951389,0.00006162942,0.00008457374,0.000100693316,0.000142689,0.004638594],"genre_scores_gemma":[0.9605002,0.00056796405,0.035313547,0.00007349878,0.000042196978,0.00011484108,0.00007616288,0.000029225286,0.003282431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992125,0.0003081882,0.000026253218,0.0001241793,0.0001344214,0.0001945436],"domain_scores_gemma":[0.9976065,0.0018775258,0.00020347266,0.00007349646,0.00014285705,0.00009607821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014529618,0.0009001717,0.0011956425,0.0005428399,0.0006401574,0.0010999951,0.0010347757,0.0008164789,0.0025479756],"category_scores_gemma":[0.0023849835,0.0006620132,0.0008599242,0.00086848607,0.000939238,0.0013076401,0.00078886934,0.0009497446,0.00021795841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005373466,0.000024500934,0.00018440094,0.000029230023,0.000020736483,0.00008721057,0.000033086373,0.97833335,0.0005695386,0.016339386,0.00032429426,0.004000549],"study_design_scores_gemma":[0.00000825645,0.000011061762,0.000035822577,0.0000015736192,0.000004243965,0.000008336854,0.000004562059,0.9964593,0.00008182341,0.0032596278,0.00012226676,0.0000031689729],"about_ca_topic_score_codex":0.012499248,"about_ca_topic_score_gemma":0.010219703,"teacher_disagreement_score":0.012499248,"about_ca_system_score_codex":0.0020811588,"about_ca_system_score_gemma":0.0019803604,"threshold_uncertainty_score":0.024852991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015709206,0.0003278843,0.98315513,0.00004399701,0.000026330508,0.000008652658,0.000016550537,0.00023853955,0.00047373792],"genre_scores_gemma":[0.6155361,0.00058082136,0.3817678,0.000079793586,0.00010142416,0.000048048063,0.00014911841,0.00008953877,0.0016474334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994711,0.00019038915,0.000039919843,0.000079190686,0.00018151924,0.000037886537],"domain_scores_gemma":[0.9977702,0.0014168579,0.00027117803,0.00019427888,0.00031231454,0.00003518599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085131,0.00074886746,0.00090611674,0.0010212258,0.0003151967,0.00089792354,0.00071552803,0.00071204896,0.00046719884],"category_scores_gemma":[0.0044573806,0.0005020988,0.0006636695,0.000658404,0.0005172397,0.0010763551,0.0008862739,0.0006864337,0.00024507652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058012636,0.00009753904,0.0028667992,0.0002333026,0.0002478948,0.00019443886,0.00012291498,0.6429881,0.03459803,0.016439559,0.001029344,0.300602],"study_design_scores_gemma":[0.000010032557,0.000037578146,0.0006664454,0.000010428508,0.000020446048,0.00014064866,0.000007346166,0.9860591,0.01032544,0.0021354805,0.00056503795,0.000021999766],"about_ca_topic_score_codex":0.0010253863,"about_ca_topic_score_gemma":0.0009159205,"teacher_disagreement_score":0.001085131,"about_ca_system_score_codex":0.0004120894,"about_ca_system_score_gemma":0.0006216363,"threshold_uncertainty_score":0.005738795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037669476,0.01398161,0.9055035,0.0025679378,0.0006123262,0.0002028,0.0004678953,0.00062789023,0.038366552],"genre_scores_gemma":[0.7877139,0.015521889,0.17663115,0.0022691034,0.0022137503,0.0010558959,0.00071989786,0.00088972284,0.012984665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950287,0.0016174313,0.0001471463,0.0007548641,0.0014088381,0.0010430521],"domain_scores_gemma":[0.95647246,0.033967596,0.0019237713,0.002351051,0.0038179415,0.0014671265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00790942,0.003066593,0.003181104,0.0033140539,0.0018548099,0.0065802177,0.006742821,0.003412041,0.00903913],"category_scores_gemma":[0.045729473,0.0011829074,0.0018855374,0.0034335912,0.00378694,0.013400992,0.0053489637,0.008922893,0.0015083776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005654857,0.00030905078,0.0010030253,0.000976646,0.00010948085,0.000363684,0.0008265814,0.1199326,0.011425255,0.81845117,0.009327138,0.036709763],"study_design_scores_gemma":[0.00003652316,0.00019782156,0.00041505948,0.0003362004,0.000108416185,0.00042315217,0.00022746061,0.63780266,0.004789561,0.34786478,0.0076909102,0.00010744637],"about_ca_topic_score_codex":0.0021689094,"about_ca_topic_score_gemma":0.001385563,"teacher_disagreement_score":0.00903913,"about_ca_system_score_codex":0.004973918,"about_ca_system_score_gemma":0.0026903576,"threshold_uncertainty_score":0.041829467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14199938,0.0010723716,0.84767663,0.00024138017,0.00005726691,0.00007676274,0.000055088287,0.00021439086,0.00860675],"genre_scores_gemma":[0.9334721,0.00037148356,0.06365651,0.000034615656,0.00001806993,0.00005238176,0.000028996757,0.0000057245866,0.0023601395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994716,0.00019661839,0.000027824708,0.00009455101,0.0001424642,0.00006690562],"domain_scores_gemma":[0.9992599,0.0003407282,0.00011887015,0.00010489144,0.00015024962,0.000025369643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058696367,0.0007365254,0.0006449638,0.00040662292,0.0005123111,0.00081937324,0.0009601452,0.00090256875,0.00068351894],"category_scores_gemma":[0.0012330214,0.00025603012,0.00039874337,0.00061567104,0.0005510587,0.0009689744,0.0009529627,0.00044562266,0.00025027504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058333046,0.00013973945,0.0018460137,0.00029323515,0.0001659713,0.0008412745,0.00048425462,0.75552213,0.05520566,0.059326947,0.0011471563,0.12444431],"study_design_scores_gemma":[0.0000477143,0.00027372318,0.00019546469,0.000014723799,0.000041001644,0.0003130674,0.000056074143,0.98008966,0.0077508693,0.008162305,0.0030219457,0.000033377808],"about_ca_topic_score_codex":0.0015811085,"about_ca_topic_score_gemma":0.001805231,"teacher_disagreement_score":0.0015811085,"about_ca_system_score_codex":0.00068695267,"about_ca_system_score_gemma":0.0005053029,"threshold_uncertainty_score":0.0049842596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02768376,0.00015799896,0.97144777,0.000055087265,0.000017760107,0.000008975185,0.000017323879,0.00031218288,0.0002990763],"genre_scores_gemma":[0.7927364,0.00021362871,0.20528618,0.000040321538,0.00002977806,0.000038078728,0.00014802018,0.000050842158,0.0014567649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995259,0.00022777701,0.000022291035,0.000059217677,0.00011834667,0.000046523324],"domain_scores_gemma":[0.9988777,0.00067923276,0.00009262198,0.00011153459,0.00021912283,0.000019798354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010085276,0.00048146586,0.00056763913,0.00027272032,0.00023177457,0.00040450017,0.0004301157,0.00054797786,0.0005252433],"category_scores_gemma":[0.0036868649,0.00025586662,0.00042856717,0.0004527867,0.00025724128,0.0006689395,0.00040747752,0.000911418,0.0002833974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017914505,0.000051245854,0.0012883213,0.00004316062,0.000047295376,0.000052406358,0.000046507856,0.8706572,0.0051126257,0.0028317024,0.00042073303,0.119269654],"study_design_scores_gemma":[0.0000012419765,0.0000139039,0.00009364557,9.001237e-7,0.0000014070928,0.000004876294,0.000002211532,0.999042,0.00054847094,0.00021313113,0.00007599823,0.0000021681742],"about_ca_topic_score_codex":0.0041892976,"about_ca_topic_score_gemma":0.0030562908,"teacher_disagreement_score":0.0041892976,"about_ca_system_score_codex":0.00025129935,"about_ca_system_score_gemma":0.00056606985,"threshold_uncertainty_score":0.008329868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39924982,0.0031867702,0.5475905,0.00034647153,0.00005022394,0.0000548854,0.00021622989,0.00020591833,0.049099267],"genre_scores_gemma":[0.9917093,0.0006489995,0.0058865966,0.000038436694,0.000017679944,0.000018421842,0.00004443775,0.00001575238,0.0016203541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995233,0.00017926931,0.000013303722,0.000060349445,0.00012503861,0.00009878858],"domain_scores_gemma":[0.9982193,0.0012481506,0.00013701906,0.00009563138,0.00027101923,0.000028857126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833581,0.0004583826,0.00047825533,0.0004952493,0.00020984406,0.0009726588,0.00046194764,0.0004772266,0.0019347575],"category_scores_gemma":[0.0032537854,0.00015723494,0.00020078656,0.0007489156,0.0005415076,0.00090229616,0.0006456723,0.0003064975,0.00036430187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011284022,0.00002770614,0.0018822756,0.00009334198,0.000050677427,0.00021324784,0.000104103485,0.9207311,0.008263622,0.042407412,0.0006909635,0.025422659],"study_design_scores_gemma":[0.0000069899725,0.00008557383,0.0014013136,0.00001641232,0.000020367537,0.00020858306,0.000072885276,0.97876793,0.0036877769,0.014117643,0.0016027131,0.0000117843865],"about_ca_topic_score_codex":0.0009194858,"about_ca_topic_score_gemma":0.00055999425,"teacher_disagreement_score":0.0019347575,"about_ca_system_score_codex":0.00073843665,"about_ca_system_score_gemma":0.00028818302,"threshold_uncertainty_score":0.0064724684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33691624,0.002744566,0.6488312,0.0008012807,0.00008209772,0.000051124025,0.000016185406,0.00010154959,0.010455761],"genre_scores_gemma":[0.99354327,0.00019606731,0.005888847,0.000026383777,0.000013757817,0.000013902371,0.0000020968794,0.0000069827424,0.0003086437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865156,0.00070075557,0.000040268435,0.00011860749,0.0003148385,0.00017397948],"domain_scores_gemma":[0.98814386,0.010715601,0.0004577982,0.00020226066,0.00035163912,0.00012896257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00276625,0.0005621749,0.00062141474,0.0004169937,0.00044980505,0.0012476898,0.0006125666,0.00068369944,0.00057688827],"category_scores_gemma":[0.013772872,0.00030799492,0.00032664716,0.0005295739,0.0015230733,0.0013492332,0.0012126068,0.00062871625,0.00004386084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013992135,0.00007164888,0.0014428924,0.000069446854,0.000065006825,0.00017465436,0.00013864208,0.94622016,0.0041433866,0.02960071,0.00028896317,0.01764462],"study_design_scores_gemma":[0.000010482571,0.00006506936,0.00030179642,0.0000047438643,0.000015541586,0.00004164074,0.000031223244,0.991918,0.0008404788,0.006645797,0.00011954137,0.0000057052353],"about_ca_topic_score_codex":0.0015502247,"about_ca_topic_score_gemma":0.001228278,"teacher_disagreement_score":0.00276625,"about_ca_system_score_codex":0.00087946217,"about_ca_system_score_gemma":0.0009394304,"threshold_uncertainty_score":0.014629483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02923487,0.0005515768,0.9684894,0.0002923597,0.00003903944,0.000018631185,0.00003623483,0.0003205494,0.0010172287],"genre_scores_gemma":[0.821837,0.00054822234,0.17439045,0.0001400145,0.00009311264,0.00012131769,0.00019505086,0.00004145398,0.0026334517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941444,0.00023427034,0.00003826186,0.00010191395,0.0001548146,0.000056409797],"domain_scores_gemma":[0.9981811,0.0012577329,0.00017255936,0.00012177247,0.000233516,0.00003346441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013380228,0.0004904685,0.0008110591,0.0005618615,0.0003038496,0.0007516419,0.0005878113,0.0008819901,0.00086489005],"category_scores_gemma":[0.0051751346,0.00021031179,0.00040944078,0.00072248274,0.00050656736,0.0006032366,0.00078610436,0.0012797364,0.00027835983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082622195,0.000041208146,0.0016778908,0.000054463682,0.000042730288,0.00005309023,0.000046694768,0.8496362,0.0017499179,0.014002079,0.00096923695,0.13164392],"study_design_scores_gemma":[0.0000015288521,0.000010489179,0.000152279,0.0000023622756,0.000001295481,0.0000062852455,0.0000023666973,0.9959663,0.00027799234,0.0034444132,0.00013167104,0.0000029246087],"about_ca_topic_score_codex":0.0012427795,"about_ca_topic_score_gemma":0.00080495176,"teacher_disagreement_score":0.0013380228,"about_ca_system_score_codex":0.0006008441,"about_ca_system_score_gemma":0.00044380422,"threshold_uncertainty_score":0.007076204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030870287,0.0024648663,0.94746834,0.00075572473,0.00013100408,0.00005369357,0.0001516576,0.00022435865,0.017880017],"genre_scores_gemma":[0.9345371,0.0044222036,0.046853144,0.00033949342,0.0003373176,0.00020136563,0.00020925418,0.0001851361,0.012914979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986206,0.00055599806,0.000053666216,0.00015870278,0.00035022912,0.00026074718],"domain_scores_gemma":[0.99536043,0.0032835489,0.00040377578,0.00019424674,0.00066589465,0.000092099675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025861582,0.0021250208,0.001438545,0.0012866319,0.0005794518,0.0023316892,0.0012829296,0.0011856818,0.0028814317],"category_scores_gemma":[0.0071145003,0.0007576127,0.0010181778,0.0016190798,0.0016059964,0.002270488,0.00157599,0.0015553478,0.00073436816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006932513,0.000040261977,0.00028675963,0.00015353953,0.000083858446,0.00019061384,0.00012554739,0.89474154,0.0027333417,0.08956921,0.0020811239,0.009924818],"study_design_scores_gemma":[0.0000042961137,0.000022188067,0.000112599206,0.000011122802,0.00001551669,0.00004699248,0.000021179152,0.9860994,0.0004928599,0.012650516,0.0005122475,0.000010995692],"about_ca_topic_score_codex":0.0029838716,"about_ca_topic_score_gemma":0.0017136593,"teacher_disagreement_score":0.0029838716,"about_ca_system_score_codex":0.0025027606,"about_ca_system_score_gemma":0.0011976275,"threshold_uncertainty_score":0.018158853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022837572,0.009775165,0.0005000482,0.0432785,0.9138189,0.00006238243,0.0004898167,0.0003273389,0.031519424],"genre_scores_gemma":[0.0035709164,0.013741931,0.00057848956,0.043934252,0.7875082,0.00010491804,0.00087584887,0.00036797626,0.14931749],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975284,0.00030822557,0.00026098988,0.0006021358,0.000994511,0.0003057386],"domain_scores_gemma":[0.989829,0.001568787,0.00060279574,0.00061333604,0.005031905,0.0023541616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021448345,0.0014435903,0.001333092,0.0018878811,0.0016637786,0.00602379,0.0020483073,0.0049723205,0.20964614],"category_scores_gemma":[0.014516602,0.00046782856,0.0012191306,0.0008109636,0.00089409837,0.0039028449,0.002017077,0.006287947,0.12893976],"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.00003052851,0.000010269679,0.00005290667,0.0001563931,0.0000053551125,0.00012738968,0.000015922684,0.000017276676,0.000117252384,0.0007649732,0.97833794,0.020363683],"study_design_scores_gemma":[0.000011154759,0.000015045996,0.00011364277,0.00013155701,0.0000055792602,0.00023765373,0.000027413096,0.000023797656,0.000083172396,0.0005632857,0.9987822,0.000005567545],"about_ca_topic_score_codex":0.0005783086,"about_ca_topic_score_gemma":0.00084284233,"teacher_disagreement_score":0.20964614,"about_ca_system_score_codex":0.0015219157,"about_ca_system_score_gemma":0.0021552038,"threshold_uncertainty_score":0.7013362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87502724,0.0013593762,0.11236028,0.00050469325,0.00009372542,0.0000373844,0.00015856785,0.00055335887,0.009905319],"genre_scores_gemma":[0.9977608,0.00018806935,0.0017057963,0.000031591877,0.000016747641,0.000006014185,0.0000277721,0.00001202872,0.0002512423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882895,0.00033796806,0.000057419973,0.00013508702,0.0003904528,0.0002502091],"domain_scores_gemma":[0.9967314,0.0019094808,0.00053777435,0.00021734038,0.0005394309,0.00006461233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010785157,0.0006416163,0.00069478963,0.00046719576,0.0006615625,0.0008109192,0.0004099272,0.0006925116,0.0011529652],"category_scores_gemma":[0.0035165744,0.00022084608,0.00024674047,0.0005226845,0.0007731005,0.0009377898,0.0007959976,0.0004693658,0.000345816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020838303,0.0001454825,0.020895053,0.0005056016,0.00018310662,0.00132673,0.0006093242,0.6075068,0.29704076,0.01445208,0.0012367279,0.05401445],"study_design_scores_gemma":[0.000028812688,0.00064045517,0.005973805,0.000058955342,0.00009426402,0.0007026763,0.00015948409,0.85594934,0.13314447,0.0020973557,0.0010883086,0.00006207619],"about_ca_topic_score_codex":0.0008884045,"about_ca_topic_score_gemma":0.0005096423,"teacher_disagreement_score":0.0011529652,"about_ca_system_score_codex":0.00067831296,"about_ca_system_score_gemma":0.00041341598,"threshold_uncertainty_score":0.005703807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130031,0.0005587627,0.98290116,0.00012898506,0.000021752594,0.000038275863,0.00004421629,0.00012009815,0.0031837414],"genre_scores_gemma":[0.79238766,0.0021827596,0.20080101,0.00011048293,0.00006748567,0.00026497565,0.0001441134,0.000115427014,0.003926177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987619,0.00050729746,0.00004108271,0.0000965492,0.0004349708,0.0001582387],"domain_scores_gemma":[0.99811953,0.0009394656,0.00024051064,0.0001331564,0.0005006719,0.00006671546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00202698,0.0015721006,0.0011239193,0.00084175117,0.00056667236,0.0017243942,0.0011805198,0.0009566293,0.0019910254],"category_scores_gemma":[0.0047630416,0.00071602524,0.00090670394,0.0011646448,0.0011997666,0.001418183,0.0009210676,0.0014994186,0.00083582744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069028094,0.000023372546,0.00026083348,0.000099349374,0.000031695814,0.00011601016,0.00009542853,0.90772694,0.0052978983,0.06842308,0.0008273017,0.017029034],"study_design_scores_gemma":[0.0000056604863,0.000025423833,0.000051681487,0.00001144318,0.00000586045,0.000037227444,0.000011510492,0.9941673,0.00070780487,0.004592572,0.00036957697,0.000013945042],"about_ca_topic_score_codex":0.0037839168,"about_ca_topic_score_gemma":0.0025858225,"teacher_disagreement_score":0.0037839168,"about_ca_system_score_codex":0.0019402391,"about_ca_system_score_gemma":0.0018634977,"threshold_uncertainty_score":0.014077485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004809143,0.00009659887,0.9938916,0.0001306772,0.000018320105,0.000022118187,0.000023681514,0.000100804595,0.0009070026],"genre_scores_gemma":[0.35491964,0.00042488106,0.6377057,0.00039322683,0.00008049592,0.00029028096,0.00029229652,0.00013070002,0.005762795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914086,0.0004076519,0.00003707812,0.00011763282,0.0002220304,0.000074808915],"domain_scores_gemma":[0.99831116,0.0010775863,0.00014929376,0.000109625755,0.00029020564,0.000062140134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001634608,0.0010248667,0.00094418804,0.00033871358,0.00026219932,0.0008073462,0.0007451092,0.00092148193,0.002883733],"category_scores_gemma":[0.0040183538,0.00047797777,0.00064428244,0.0004536367,0.0008756191,0.0010702086,0.0010950685,0.0020444004,0.0006633486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027768005,0.00008498836,0.00048629765,0.00022065463,0.000048826078,0.00015367025,0.00016125034,0.8658862,0.011699551,0.051838346,0.0036052568,0.065537244],"study_design_scores_gemma":[0.000012147693,0.000030845964,0.000030189492,0.0000039419474,0.0000017123963,0.000018099443,0.0000041105955,0.9964365,0.00073661824,0.0024083287,0.00031250506,0.000004920321],"about_ca_topic_score_codex":0.0014871767,"about_ca_topic_score_gemma":0.0011317682,"teacher_disagreement_score":0.002883733,"about_ca_system_score_codex":0.0005592366,"about_ca_system_score_gemma":0.0010902424,"threshold_uncertainty_score":0.009647071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01647776,0.0002530756,0.9809013,0.000076614306,0.000025832003,0.000018994284,0.000019192834,0.000112656766,0.0021146233],"genre_scores_gemma":[0.5826897,0.00057030574,0.41157895,0.00013626619,0.00009148601,0.000042932556,0.00007884466,0.00002216127,0.0047894116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999749,0.000070070084,0.000012962256,0.000029628203,0.00010851912,0.000029735118],"domain_scores_gemma":[0.99973685,0.000108138345,0.000030340976,0.00005651826,0.00005382025,0.000014227556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032691134,0.0005900518,0.0003901097,0.00032395494,0.00019990116,0.00053286046,0.00048755863,0.00057405856,0.0017725233],"category_scores_gemma":[0.00066080445,0.00018749558,0.0003878233,0.00047362692,0.00042361554,0.0006706617,0.0005338961,0.00043880352,0.00041664258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045291067,0.00013493763,0.00090670725,0.00022786565,0.00014753299,0.00029720317,0.00015086682,0.49648607,0.07174615,0.05470236,0.0020458302,0.37270153],"study_design_scores_gemma":[0.000046453435,0.000342469,0.00026701097,0.000013997742,0.000033266566,0.00022243192,0.000025384736,0.97461784,0.013727427,0.008384024,0.0023024306,0.000017254022],"about_ca_topic_score_codex":0.0005774788,"about_ca_topic_score_gemma":0.0011871425,"teacher_disagreement_score":0.0017725233,"about_ca_system_score_codex":0.00024548225,"about_ca_system_score_gemma":0.00028880464,"threshold_uncertainty_score":0.0059297085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1024064,0.0008934885,0.8882031,0.00035273557,0.00018176156,0.00006446542,0.000062851854,0.00047454896,0.007360603],"genre_scores_gemma":[0.9433147,0.0003982171,0.0536868,0.00015334228,0.000057803947,0.000051205014,0.000056518795,0.0000070596802,0.0022743791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997949,0.000032544627,0.000008888588,0.00003738576,0.00009363083,0.000032594417],"domain_scores_gemma":[0.9997577,0.00006766065,0.000035062774,0.000035068624,0.00008910889,0.000015387852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283308,0.00035740802,0.00026962822,0.00044408988,0.00044031907,0.0004515247,0.0006661593,0.0004849984,0.0008384755],"category_scores_gemma":[0.0007143162,0.000093116716,0.000278431,0.0004047563,0.0003142216,0.0004075962,0.000370489,0.00046469318,0.0002188739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077139086,0.00033243114,0.005302688,0.00040058483,0.00015835589,0.0008289046,0.0003364344,0.20288539,0.22678421,0.044915434,0.0059697647,0.5113145],"study_design_scores_gemma":[0.000028921728,0.00026068804,0.0007887646,0.000014928404,0.000041837808,0.00027448073,0.000037977465,0.97077334,0.02082225,0.003938495,0.0029964778,0.000021730273],"about_ca_topic_score_codex":0.0020407303,"about_ca_topic_score_gemma":0.0025056347,"teacher_disagreement_score":0.0020407303,"about_ca_system_score_codex":0.0003535729,"about_ca_system_score_gemma":0.0005773178,"threshold_uncertainty_score":0.0040577054},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2267802,0.00044114908,0.74483836,0.00038212127,0.00025267722,0.0007038434,0.000115993826,0.0019638636,0.024521815],"genre_scores_gemma":[0.81828105,0.0002014604,0.17539103,0.000057212827,0.000025518242,0.0002947594,0.00008242883,0.000050366587,0.005616183],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966526,0.000093521245,0.0000133446765,0.000043191503,0.00014048684,0.0000441951],"domain_scores_gemma":[0.9996687,0.00007067839,0.000050823863,0.0000386412,0.00013713454,0.000034051438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129261,0.00028464737,0.00015188857,0.00022166903,0.00019520696,0.00036638742,0.0008243659,0.00025948734,0.0019843008],"category_scores_gemma":[0.0007092509,0.00013632695,0.0001263862,0.00009553764,0.0001644377,0.0004594399,0.00023960847,0.00023201446,0.00038074687],"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.00042229256,0.0003133294,0.0054686936,0.0007355778,0.00007329186,0.0008651508,0.00069701375,0.12932178,0.60365635,0.025864333,0.005939515,0.22664276],"study_design_scores_gemma":[0.00014925326,0.0021846306,0.00452497,0.0000737948,0.000059330014,0.0005922772,0.00018775245,0.6074922,0.31467956,0.0028417772,0.067168966,0.00004551828],"about_ca_topic_score_codex":0.00040547366,"about_ca_topic_score_gemma":0.00067659497,"teacher_disagreement_score":0.0019843008,"about_ca_system_score_codex":0.00031866148,"about_ca_system_score_gemma":0.0003525055,"threshold_uncertainty_score":0.0066381097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007462495,0.00022902373,0.9905336,0.00008079411,0.000022582715,0.000020771164,0.000013534771,0.000041025487,0.0015961477],"genre_scores_gemma":[0.82340187,0.0010721465,0.16926233,0.0001401375,0.000080949576,0.0001882694,0.00007322829,0.00003805067,0.005743051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993056,0.00025828855,0.000032571228,0.00012995196,0.00022718516,0.000046505043],"domain_scores_gemma":[0.9990085,0.0005800993,0.00017243365,0.0000678307,0.00015152643,0.000019651015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649565,0.0010350054,0.0006745472,0.0002472199,0.00023551974,0.0010068724,0.0006572476,0.0010953132,0.0012545635],"category_scores_gemma":[0.0022922505,0.00038876836,0.0005057602,0.00034195225,0.0009003776,0.00082382676,0.0007751627,0.00077710126,0.00044427172],"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.00009537841,0.0000399637,0.00025819824,0.00025575852,0.000064260996,0.00017641054,0.00014865347,0.9158906,0.02211353,0.035995312,0.00047964792,0.024482338],"study_design_scores_gemma":[0.000011872991,0.00013599276,0.000082335086,0.000010304294,0.00001468712,0.000058944002,0.00001551402,0.9915354,0.003669862,0.0036651348,0.0007900991,0.00000973265],"about_ca_topic_score_codex":0.0004981922,"about_ca_topic_score_gemma":0.00043843914,"teacher_disagreement_score":0.0012545635,"about_ca_system_score_codex":0.0005375704,"about_ca_system_score_gemma":0.00067856157,"threshold_uncertainty_score":0.0056321025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028961764,0.00018683008,0.99611557,0.00003070615,0.000025134104,0.000012492089,0.000006913705,0.00005082766,0.0006753405],"genre_scores_gemma":[0.41758168,0.000772634,0.5782451,0.00017229193,0.00014086433,0.00014500343,0.00006253416,0.000039229802,0.0028406112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998804,0.00037845963,0.00005210944,0.00028050103,0.00042449826,0.000060404327],"domain_scores_gemma":[0.9974842,0.0018144645,0.00014132801,0.00019601814,0.00030880893,0.000055051427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019628073,0.00087370526,0.000838497,0.00083252083,0.00031844337,0.00078039797,0.00093780505,0.0009710547,0.0012861504],"category_scores_gemma":[0.0044059763,0.0003824235,0.000777139,0.00091852964,0.0010242586,0.0010424654,0.0011341949,0.0010421353,0.0002914042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003360507,0.0001673876,0.0012520354,0.00043122488,0.00018076439,0.00037062034,0.00027460454,0.5281154,0.033522934,0.20622504,0.0016060545,0.22751783],"study_design_scores_gemma":[0.000010789779,0.00012364132,0.00014027496,0.000007696289,0.000014924269,0.00015553804,0.000010622569,0.97426015,0.0036575764,0.020014204,0.0015899072,0.000014582915],"about_ca_topic_score_codex":0.0005305692,"about_ca_topic_score_gemma":0.0004761558,"teacher_disagreement_score":0.0019628073,"about_ca_system_score_codex":0.0005351135,"about_ca_system_score_gemma":0.0006637685,"threshold_uncertainty_score":0.010380447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058945534,0.000115446404,0.99190736,0.00004878617,0.000019723597,0.00001429741,0.000035126723,0.00040754577,0.0015572445],"genre_scores_gemma":[0.8108686,0.0005744988,0.17429596,0.00013885487,0.000044215503,0.0001703162,0.00029189108,0.0001576469,0.013458032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.00012542096,0.000022711027,0.00009635278,0.0001977587,0.000048181788],"domain_scores_gemma":[0.9995695,0.00015321883,0.000066179484,0.00008069847,0.00011797961,0.000012510241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006710489,0.00080373464,0.0006296382,0.00034898001,0.0002595133,0.00076221325,0.0011920274,0.0011037893,0.0023637197],"category_scores_gemma":[0.0012524078,0.0003672862,0.00061653834,0.00038027568,0.00054899364,0.0010538177,0.00071445276,0.0013851356,0.0011358027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117965996,0.00004120892,0.0006341587,0.0001302773,0.00006538808,0.00013035709,0.00011092463,0.89509016,0.02067288,0.016113358,0.0010569629,0.0658363],"study_design_scores_gemma":[0.000003405793,0.000025604519,0.0001221069,0.0000061687183,0.0000072572498,0.000038901853,0.000003864005,0.99498665,0.002448423,0.0015288932,0.0008179577,0.000010780229],"about_ca_topic_score_codex":0.002508362,"about_ca_topic_score_gemma":0.0024878192,"teacher_disagreement_score":0.002508362,"about_ca_system_score_codex":0.0005055467,"about_ca_system_score_gemma":0.0006740623,"threshold_uncertainty_score":0.007907391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074432686,0.0012000741,0.9017668,0.0008027625,0.00017961774,0.00012766951,0.00009535269,0.00072553166,0.020669516],"genre_scores_gemma":[0.9199627,0.000903855,0.073718496,0.0002078568,0.0001467594,0.00016447391,0.00012002579,0.00011777951,0.0046580676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646974,0.0009171713,0.0001682233,0.0003522495,0.0016149491,0.0004777041],"domain_scores_gemma":[0.994361,0.0025997527,0.000589871,0.0016976793,0.0006016583,0.00015003678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017815899,0.00062716054,0.0008327164,0.0011627361,0.00083729415,0.0019520965,0.0009381125,0.0012176359,0.0025242895],"category_scores_gemma":[0.0059802453,0.00037915856,0.00055687124,0.0012070616,0.002436757,0.0045747044,0.0031666292,0.002228765,0.0009931845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047460414,0.00007884466,0.00055645214,0.0002215574,0.00007416122,0.0003499967,0.00022565872,0.050246686,0.024792805,0.8694322,0.001401008,0.052145932],"study_design_scores_gemma":[0.00014909994,0.00024922105,0.00033055304,0.00012402775,0.00007510791,0.0010729557,0.00007903165,0.37110987,0.075971045,0.5338806,0.016837293,0.00012121462],"about_ca_topic_score_codex":0.0003211088,"about_ca_topic_score_gemma":0.00016522717,"teacher_disagreement_score":0.0025242895,"about_ca_system_score_codex":0.0010059725,"about_ca_system_score_gemma":0.0013663417,"threshold_uncertainty_score":0.009422004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083867274,0.001751157,0.9040663,0.00037739237,0.000090318885,0.000054567707,0.000058537018,0.000127228,0.00960721],"genre_scores_gemma":[0.9524602,0.00074147107,0.045216125,0.00007538992,0.000046338915,0.000033176486,0.000024334668,0.000021385607,0.00138142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994979,0.0001903997,0.000012500961,0.00006533746,0.0001163718,0.00011740628],"domain_scores_gemma":[0.99950635,0.00032037497,0.000061042316,0.000032649557,0.000054810273,0.000024750982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006438813,0.0008478973,0.0006924668,0.0004717471,0.000541584,0.0009729276,0.0006811484,0.00063096767,0.0010089567],"category_scores_gemma":[0.0018243472,0.0002562169,0.00038667372,0.0007370035,0.00077399134,0.0010256036,0.0009044041,0.00047924492,0.00012841568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006825199,0.00003948469,0.0005631633,0.00005033935,0.000028745537,0.00008031496,0.00004128027,0.95320565,0.0025004607,0.013445506,0.00072234747,0.029254511],"study_design_scores_gemma":[0.0000053076587,0.000035454326,0.00020150481,0.0000038351486,0.000008360637,0.00004147372,0.000022470753,0.99383235,0.0008083247,0.0044798856,0.00055572565,0.0000053349913],"about_ca_topic_score_codex":0.0032137488,"about_ca_topic_score_gemma":0.003208602,"teacher_disagreement_score":0.0032137488,"about_ca_system_score_codex":0.0012115984,"about_ca_system_score_gemma":0.00088790985,"threshold_uncertainty_score":0.008790791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4518762,0.0010759096,0.54180354,0.00018369422,0.000045251847,0.000025530453,0.000052345782,0.00014682894,0.0047908123],"genre_scores_gemma":[0.99291694,0.00026676618,0.0063701095,0.00002100048,0.000010204837,0.000009098088,0.000009009877,0.000009133714,0.00038776212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938154,0.00026459625,0.000025765657,0.00008761062,0.00014034,0.00010012931],"domain_scores_gemma":[0.9967906,0.0022340955,0.00035026576,0.00027417947,0.00029542515,0.000055438803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015889208,0.0007782532,0.0008118199,0.0003489479,0.00029965347,0.0006916549,0.0005916181,0.0006226295,0.00051727984],"category_scores_gemma":[0.004510088,0.0002488322,0.00038115782,0.000396703,0.00078878965,0.001397627,0.00075124303,0.00046270702,0.00010541771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108195134,0.000033254837,0.0017406185,0.00005170315,0.000037709196,0.0002544103,0.000060846643,0.96517056,0.008267988,0.013117231,0.00015272471,0.011004799],"study_design_scores_gemma":[0.000003197955,0.00006745468,0.0005753153,0.0000056699355,0.00001976663,0.00011815206,0.000027282189,0.9923173,0.0038380937,0.0028405294,0.00017877607,0.000008381668],"about_ca_topic_score_codex":0.00078398176,"about_ca_topic_score_gemma":0.0005522483,"teacher_disagreement_score":0.0015889208,"about_ca_system_score_codex":0.000586981,"about_ca_system_score_gemma":0.00043854362,"threshold_uncertainty_score":0.008403122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009658088,0.00015290805,0.98910147,0.00008380172,0.000024394993,0.000013050304,0.00001991354,0.00012268359,0.00082367554],"genre_scores_gemma":[0.38922542,0.0006877697,0.6064817,0.00012206981,0.00008028631,0.00008115774,0.0001992069,0.000053538148,0.0030689198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981326,0.00004941293,0.000008332883,0.000021144444,0.00008787772,0.000020075633],"domain_scores_gemma":[0.9993674,0.00039357712,0.000059967264,0.00006172997,0.000102544596,0.0000148434765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044435752,0.00048265484,0.00042283125,0.0003253626,0.00024875582,0.0004939076,0.00042297656,0.00061326585,0.0014567099],"category_scores_gemma":[0.002270039,0.00023615111,0.00032086554,0.00040315688,0.00037265546,0.0009217629,0.00040824388,0.0007872397,0.0003681984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016004879,0.00006347798,0.00078249467,0.00011587712,0.00004389831,0.00009202125,0.00009755766,0.7945207,0.017640349,0.02084087,0.0017187243,0.16392413],"study_design_scores_gemma":[0.000003093763,0.000010328892,0.00006636183,0.0000026494504,0.0000018259035,0.000017637796,0.000004959081,0.9971551,0.0013567327,0.0010652144,0.0003123942,0.0000038013454],"about_ca_topic_score_codex":0.003110673,"about_ca_topic_score_gemma":0.004180963,"teacher_disagreement_score":0.003110673,"about_ca_system_score_codex":0.00037063807,"about_ca_system_score_gemma":0.0006751727,"threshold_uncertainty_score":0.0061851144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013198995,0.00018706021,0.9831949,0.000050851944,0.00003266882,0.000015415066,0.000028442342,0.00019877375,0.0030929362],"genre_scores_gemma":[0.9123096,0.00059600326,0.06770201,0.00008166159,0.000053961172,0.00008967377,0.00011668747,0.00007050157,0.01897997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980944,0.000035530098,0.000008297959,0.000048513564,0.00007194909,0.000026155658],"domain_scores_gemma":[0.9998354,0.000048613056,0.000028736351,0.000025617574,0.00005358054,0.000007958479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002637493,0.0007691331,0.00047937583,0.0002461237,0.00022143708,0.0006647713,0.0009271615,0.00082753453,0.002005804],"category_scores_gemma":[0.0005050578,0.00029514026,0.00054017996,0.00022083808,0.00048941607,0.0009602482,0.0004391569,0.0009530322,0.00065398536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095065494,0.000046689263,0.0005810342,0.00010894886,0.000052292133,0.00022841267,0.00013454544,0.9085899,0.025469149,0.026142016,0.00063524523,0.03791666],"study_design_scores_gemma":[0.0000030071249,0.000030261166,0.00009432507,0.0000034046018,0.000008285694,0.000037247508,0.000005254276,0.99662125,0.0010460971,0.0015258376,0.00061927683,0.000005701374],"about_ca_topic_score_codex":0.0032788976,"about_ca_topic_score_gemma":0.0032984053,"teacher_disagreement_score":0.0032788976,"about_ca_system_score_codex":0.00041066256,"about_ca_system_score_gemma":0.00047969623,"threshold_uncertainty_score":0.006710112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034154933,0.0006625474,0.96153665,0.00018008584,0.00005711962,0.00003550943,0.00006120162,0.000096717224,0.003215206],"genre_scores_gemma":[0.9561213,0.00045159034,0.0411172,0.000056439505,0.000028994746,0.000071300645,0.00005228111,0.000019149686,0.0020817253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992999,0.00031806628,0.00002039951,0.00010874806,0.0001261283,0.00012678835],"domain_scores_gemma":[0.99937767,0.0003790817,0.000090538866,0.000046381323,0.00006668834,0.00003962146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055558956,0.0008825534,0.0009635161,0.00035822843,0.0005019507,0.0010566834,0.00087067066,0.00072446704,0.0011585134],"category_scores_gemma":[0.0014517287,0.00040377415,0.0005093907,0.0007860374,0.0007106284,0.0009614194,0.0009488879,0.000746509,0.00020345878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026909309,0.000016687078,0.0001714357,0.000029948931,0.000011181667,0.000044159242,0.000018930374,0.98925656,0.0008415382,0.0038203795,0.00026497032,0.0054971953],"study_design_scores_gemma":[0.0000022965114,0.000016489405,0.000042810825,0.0000016806606,0.0000023245238,0.000010435414,0.000010653348,0.99873453,0.00015642714,0.00088103465,0.00013898728,0.0000023360158],"about_ca_topic_score_codex":0.0055012438,"about_ca_topic_score_gemma":0.005213825,"teacher_disagreement_score":0.0055012438,"about_ca_system_score_codex":0.0010642102,"about_ca_system_score_gemma":0.0008254766,"threshold_uncertainty_score":0.010938466},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052842095,0.00044120222,0.9429615,0.00016411663,0.000021259317,0.000045305085,0.000040645005,0.00008693472,0.0033969956],"genre_scores_gemma":[0.8403104,0.00052719616,0.15676734,0.000079617945,0.000027313836,0.000092086055,0.00005725272,0.000017373986,0.002121335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900764,0.00039353396,0.00004151302,0.0001523685,0.00031354997,0.00009129934],"domain_scores_gemma":[0.9985592,0.0010293084,0.0001486904,0.00012371359,0.0001148873,0.000024209647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013052201,0.0005676613,0.0006296221,0.00032146167,0.0002922294,0.00095603743,0.00046637212,0.00092974625,0.0006809806],"category_scores_gemma":[0.0035973028,0.0004134584,0.00031487775,0.0003214807,0.0012080185,0.0009673094,0.0006807901,0.00056561496,0.00023560977],"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.00019440574,0.00011963988,0.000992175,0.00024037452,0.00006258911,0.00026017998,0.0003143592,0.68426627,0.0315206,0.20012625,0.0011869866,0.08071612],"study_design_scores_gemma":[0.00002956607,0.00010014548,0.00021272148,0.000012762424,0.000014138307,0.00013554841,0.00003281748,0.9703094,0.0058893603,0.022550723,0.0006942821,0.000018546336],"about_ca_topic_score_codex":0.0009484947,"about_ca_topic_score_gemma":0.001518973,"teacher_disagreement_score":0.0013052201,"about_ca_system_score_codex":0.0005618476,"about_ca_system_score_gemma":0.0010949324,"threshold_uncertainty_score":0.0069027543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03094826,0.0032393797,0.9592453,0.00026184754,0.000120143835,0.000059115973,0.000047981444,0.0002804273,0.0057974593],"genre_scores_gemma":[0.90729743,0.0025299606,0.08735884,0.00020973329,0.00015785848,0.00008847891,0.00007284319,0.000031084357,0.0022536651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999127,0.00033238862,0.000041613235,0.000095746276,0.00027677635,0.00012656805],"domain_scores_gemma":[0.99849594,0.0008258305,0.00020372769,0.00015525741,0.0002603089,0.00005882193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009937132,0.0010715164,0.00074173947,0.00045781993,0.00038810362,0.00087473483,0.0007602369,0.00070733525,0.00091065286],"category_scores_gemma":[0.003287133,0.000403188,0.0004285178,0.0007384384,0.0007465428,0.0008735641,0.0012115759,0.0007420651,0.0003708277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039076994,0.00010685164,0.0013125328,0.00056852645,0.0001738661,0.0006986759,0.0002633801,0.73778605,0.021423664,0.039976638,0.0030433584,0.19425572],"study_design_scores_gemma":[0.000042861564,0.00040073195,0.0006876479,0.000076982724,0.00007054409,0.00035631997,0.000075920594,0.9747414,0.0074675092,0.012109647,0.003937447,0.000032950848],"about_ca_topic_score_codex":0.0011013751,"about_ca_topic_score_gemma":0.000771018,"teacher_disagreement_score":0.0011013751,"about_ca_system_score_codex":0.00033241502,"about_ca_system_score_gemma":0.0008270855,"threshold_uncertainty_score":0.0052553415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10638455,0.00043247084,0.88294977,0.00026514637,0.00008134655,0.00005495309,0.00006783277,0.00015755146,0.009606472],"genre_scores_gemma":[0.97906905,0.00021680117,0.017929742,0.000077642995,0.000020574153,0.000033890745,0.000035630168,0.000023868597,0.002592857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999564,0.00017496376,0.000007864915,0.000058032,0.000063605854,0.00013147316],"domain_scores_gemma":[0.99956983,0.0002458323,0.00004945879,0.000032756798,0.000062139436,0.000039983108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151672,0.0009439182,0.0008633075,0.0003161067,0.0004046369,0.00092144025,0.00086120097,0.0008352339,0.0012089481],"category_scores_gemma":[0.0011064843,0.00037401164,0.0005387407,0.00051327597,0.000674751,0.00082288455,0.00090072857,0.0005532367,0.00016484887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060167178,0.000045070177,0.00042684146,0.000031743417,0.0000276183,0.00009180849,0.000028776994,0.9790288,0.0020577654,0.00877483,0.000601325,0.008825265],"study_design_scores_gemma":[0.0000030567628,0.00001884222,0.000106677515,0.0000017569304,0.000004540498,0.000012951809,0.000015365698,0.99718624,0.00019456685,0.0022982527,0.00015458056,0.0000031732297],"about_ca_topic_score_codex":0.005645189,"about_ca_topic_score_gemma":0.0054067257,"teacher_disagreement_score":0.005645189,"about_ca_system_score_codex":0.0008603725,"about_ca_system_score_gemma":0.00071137433,"threshold_uncertainty_score":0.0112246275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007821976,0.00024847,0.9901125,0.00008214513,0.000034420515,0.00002939679,0.00004464412,0.00016128148,0.001465214],"genre_scores_gemma":[0.71929675,0.0011088846,0.27166665,0.00023408946,0.0001642788,0.00032356157,0.00032922268,0.00007520714,0.0068012755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995347,0.000113711896,0.000021398051,0.00010058802,0.00016228379,0.000067276276],"domain_scores_gemma":[0.9995597,0.00019179328,0.00006822088,0.000042610387,0.00011679416,0.00002077322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005148852,0.001186271,0.00078787503,0.00022824277,0.00028220972,0.00087505317,0.0006714349,0.0009233077,0.0017916126],"category_scores_gemma":[0.0013445312,0.0005058426,0.0004648755,0.000395987,0.0005407752,0.00064608105,0.0006366288,0.0008879881,0.00059080136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109050015,0.000044692024,0.00022081187,0.00015459702,0.00007239759,0.00012256719,0.00008817288,0.90857357,0.01911498,0.01351785,0.0016953427,0.05628597],"study_design_scores_gemma":[0.000016283311,0.00011387229,0.00009346079,0.000010147524,0.000011787017,0.00003841568,0.000010869111,0.9936354,0.0031109613,0.0019914103,0.0009575784,0.000009736376],"about_ca_topic_score_codex":0.0019936895,"about_ca_topic_score_gemma":0.002189345,"teacher_disagreement_score":0.0019936895,"about_ca_system_score_codex":0.00042960083,"about_ca_system_score_gemma":0.0010414063,"threshold_uncertainty_score":0.0059936047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54792535,0.0016048825,0.4354904,0.00045823827,0.00006488809,0.000079849866,0.0001190946,0.0002652596,0.013992125],"genre_scores_gemma":[0.9953212,0.00020009189,0.0040386445,0.000025029205,0.000012317967,0.000012565578,0.000014535819,0.0000084616395,0.00036715085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982948,0.0005537701,0.00005359194,0.00016123915,0.00050181395,0.00043481382],"domain_scores_gemma":[0.9952415,0.0027670495,0.00066565763,0.0002826685,0.00088582316,0.00015728732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020534417,0.0011517555,0.001019246,0.0007271483,0.00072454335,0.0017364731,0.00073500845,0.0008033048,0.0009815366],"category_scores_gemma":[0.006183773,0.0003479261,0.0006051216,0.0010673902,0.0012567694,0.00088756427,0.0010207186,0.0006272018,0.00016488375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018312606,0.000039537634,0.0014494292,0.000067432135,0.000066488516,0.00022376557,0.00008442903,0.9761864,0.00561661,0.009690718,0.00021056624,0.0061814985],"study_design_scores_gemma":[0.000005073381,0.00005687401,0.00050094834,0.0000052993173,0.000024168157,0.00006806636,0.0000294029,0.9970285,0.0011574513,0.0010529795,0.000060525617,0.000010568501],"about_ca_topic_score_codex":0.011659795,"about_ca_topic_score_gemma":0.0060597127,"teacher_disagreement_score":0.011659795,"about_ca_system_score_codex":0.0019731796,"about_ca_system_score_gemma":0.00251382,"threshold_uncertainty_score":0.023183882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9057231,0.0009891102,0.08821886,0.00016123791,0.00002922091,0.000021488671,0.0001005006,0.00015553995,0.0046009654],"genre_scores_gemma":[0.9983399,0.00012857834,0.0012960607,0.000007676389,0.0000036839308,0.000004511305,0.000013658816,0.000003374593,0.00020261302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898726,0.0004883776,0.000052880816,0.00011453137,0.00018176803,0.00017523256],"domain_scores_gemma":[0.9945538,0.0039843745,0.00060401735,0.00028005586,0.00048282326,0.000094881594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018500375,0.0009473333,0.0009871394,0.0006057789,0.0006538283,0.0011595124,0.0005632916,0.00089545007,0.0005537012],"category_scores_gemma":[0.004233489,0.00029608977,0.0005047115,0.00061244227,0.0015496394,0.0013146406,0.0011824713,0.0003647945,0.00016215384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005935602,0.000029394812,0.0029286651,0.00010758083,0.0001507069,0.00056842837,0.0001455048,0.9650938,0.017549207,0.0063946215,0.00015112052,0.006287538],"study_design_scores_gemma":[0.0000207126,0.00032658371,0.0008131022,0.00001088413,0.00007345167,0.00023896793,0.0000979088,0.9867776,0.010024756,0.0014894553,0.00009755928,0.000028948714],"about_ca_topic_score_codex":0.0024238348,"about_ca_topic_score_gemma":0.0014328539,"teacher_disagreement_score":0.0024238348,"about_ca_system_score_codex":0.000855103,"about_ca_system_score_gemma":0.00046909033,"threshold_uncertainty_score":0.009784043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023039635,0.00042476188,0.972192,0.00015628977,0.000033987868,0.000050199495,0.000027559647,0.000111808135,0.003963727],"genre_scores_gemma":[0.926219,0.00041944697,0.07108905,0.000061825645,0.00006176158,0.000102651145,0.000023447978,0.00003975162,0.0019830759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998089,0.000865591,0.000065469125,0.0002094896,0.0004244036,0.0003460434],"domain_scores_gemma":[0.9980659,0.0011947732,0.0002690284,0.00022739853,0.00016050145,0.00008248082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026300424,0.001167108,0.0013280186,0.00063337013,0.0006179891,0.0014281309,0.0014441741,0.0010962344,0.0011122894],"category_scores_gemma":[0.0062604463,0.0004979275,0.0005267286,0.0013720676,0.0012103958,0.0015860919,0.0014347313,0.00066434,0.00018068303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009585913,0.00005495118,0.00036035545,0.000059529488,0.000049902574,0.000070466915,0.000056875528,0.9319954,0.0020095247,0.03650893,0.0006421537,0.028096097],"study_design_scores_gemma":[0.000007344196,0.000021980699,0.000078761936,0.0000032394641,0.0000057537827,0.000023601197,0.000008999567,0.9895567,0.00047050125,0.009541591,0.00027607637,0.0000053529875],"about_ca_topic_score_codex":0.002510792,"about_ca_topic_score_gemma":0.002012965,"teacher_disagreement_score":0.0026300424,"about_ca_system_score_codex":0.0014476996,"about_ca_system_score_gemma":0.0016935508,"threshold_uncertainty_score":0.013909161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58140016,0.002396797,0.39933825,0.00051609374,0.00009190154,0.0001001853,0.00017470194,0.00036225296,0.015619635],"genre_scores_gemma":[0.99542624,0.00028596524,0.003563517,0.000028807879,0.000010998462,0.000017570244,0.000021808544,0.000010326109,0.00063471904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986125,0.00041969676,0.000042050186,0.00014878939,0.00035309268,0.0004239028],"domain_scores_gemma":[0.99477035,0.0036835682,0.0004921622,0.00020137038,0.0007240327,0.00012849562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019475132,0.0016974161,0.0011999462,0.00094014354,0.00080760894,0.0017028295,0.00091161253,0.0010313498,0.001404104],"category_scores_gemma":[0.006390815,0.00034223258,0.0005371527,0.00075550895,0.0015443263,0.0012594044,0.0016383366,0.0005789721,0.0001837702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002853566,0.000046360703,0.0011000979,0.00011154154,0.00006390629,0.00020533579,0.00012449163,0.97266483,0.0065238965,0.009005502,0.00028609778,0.009582587],"study_design_scores_gemma":[0.00000884039,0.00013031073,0.00037983953,0.000008764227,0.000034485107,0.00012968207,0.000075107055,0.99467695,0.0023904194,0.0020502622,0.0000984799,0.000016830147],"about_ca_topic_score_codex":0.0067192395,"about_ca_topic_score_gemma":0.00510879,"teacher_disagreement_score":0.0067192395,"about_ca_system_score_codex":0.0017527739,"about_ca_system_score_gemma":0.0015861334,"threshold_uncertainty_score":0.013360262},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26496443,0.0012371198,0.718071,0.00031328978,0.00012954423,0.00012205342,0.00014394922,0.001558318,0.013460357],"genre_scores_gemma":[0.9738158,0.00018192976,0.024195563,0.000031230986,0.000014519963,0.000018209124,0.000057028123,0.000008219904,0.0016775243],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.000064551634,0.000012450408,0.000045486966,0.00010085317,0.000048097816],"domain_scores_gemma":[0.999747,0.000063352316,0.00003454894,0.000065432,0.00007650105,0.000013147885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002936356,0.000427158,0.00033345612,0.0003356068,0.00026582673,0.0004391682,0.00065087265,0.00048438297,0.0010006008],"category_scores_gemma":[0.00041456503,0.00012974856,0.00024860408,0.00037959692,0.00025005464,0.0005089954,0.0004797255,0.00026667156,0.00028156818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008897632,0.00016361443,0.0031604979,0.00032308095,0.00020751408,0.0010702298,0.00042100606,0.30800408,0.35942405,0.023198845,0.0057652346,0.2973721],"study_design_scores_gemma":[0.00004611479,0.00051347446,0.0007117383,0.000010065333,0.00005092597,0.0006998533,0.00006374355,0.9313047,0.058640987,0.0024040833,0.0055173547,0.000036970618],"about_ca_topic_score_codex":0.0017099483,"about_ca_topic_score_gemma":0.0012290388,"teacher_disagreement_score":0.0017099483,"about_ca_system_score_codex":0.00033574295,"about_ca_system_score_gemma":0.00040468105,"threshold_uncertainty_score":0.0033999681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015208162,0.00030067784,0.981406,0.0000996798,0.00004882007,0.00005033406,0.000058119644,0.0004279134,0.0024002597],"genre_scores_gemma":[0.44686303,0.00069051393,0.54593253,0.00016525698,0.000087669025,0.00013951445,0.00032254757,0.00009663202,0.005702307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998938,0.00029680482,0.00006128466,0.00008110347,0.00053801946,0.00008472039],"domain_scores_gemma":[0.9986878,0.00057372916,0.00012183498,0.00023988477,0.00032247504,0.000054277152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051331683,0.0007649018,0.00087666645,0.0008637794,0.0003838284,0.00081757235,0.00068307196,0.00057989545,0.0011526704],"category_scores_gemma":[0.002499753,0.00027673037,0.00048413323,0.00087562995,0.0007113137,0.0008327207,0.0011364591,0.00085822324,0.0009495265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069661834,0.000115396244,0.0010603549,0.0003318191,0.000110767614,0.00052892376,0.000319142,0.2864946,0.13616282,0.119947724,0.0039463183,0.4502855],"study_design_scores_gemma":[0.000046343244,0.00013071993,0.00025837735,0.000022640454,0.000014520129,0.00029935135,0.000022691123,0.91543144,0.06287101,0.017156253,0.0036995942,0.000047129284],"about_ca_topic_score_codex":0.0013967807,"about_ca_topic_score_gemma":0.0015555129,"teacher_disagreement_score":0.0013967807,"about_ca_system_score_codex":0.0005720221,"about_ca_system_score_gemma":0.0013331935,"threshold_uncertainty_score":0.004150331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21664496,0.0007153901,0.7737275,0.00018336697,0.00006370331,0.000055025514,0.00019657455,0.00093615253,0.0074773487],"genre_scores_gemma":[0.9740666,0.00022210587,0.02240677,0.000036876314,0.000014532875,0.000026071557,0.00015597872,0.000042619686,0.0030284883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965894,0.000041496016,0.000015653393,0.00005890696,0.00019114799,0.000033928514],"domain_scores_gemma":[0.9997181,0.00008991693,0.00004448575,0.000037496287,0.000101101235,0.000008891705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023120646,0.0002766702,0.000288863,0.00041393455,0.00020044454,0.00046383706,0.00042699702,0.00038461055,0.0017274265],"category_scores_gemma":[0.00063033326,0.00015216225,0.00027332816,0.00034110848,0.00014704301,0.00067727844,0.00027740476,0.00025861274,0.00045502864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005889191,0.00007472842,0.020473417,0.0004547595,0.00015441346,0.0008449194,0.00035096414,0.41406628,0.25069132,0.015661398,0.002114062,0.29452485],"study_design_scores_gemma":[0.000006018548,0.00012882391,0.008468953,0.000012648914,0.000028574445,0.00031697223,0.000045474662,0.9470209,0.03924879,0.0014866175,0.003209785,0.000026429685],"about_ca_topic_score_codex":0.0008721805,"about_ca_topic_score_gemma":0.0006357178,"teacher_disagreement_score":0.0017274265,"about_ca_system_score_codex":0.00038425892,"about_ca_system_score_gemma":0.00032177963,"threshold_uncertainty_score":0.005778849},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01995774,0.00027959203,0.9751981,0.00011799366,0.000029363018,0.000024821544,0.000059718368,0.0004096967,0.003922931],"genre_scores_gemma":[0.826815,0.0007283965,0.15799305,0.00010415303,0.000047625465,0.00013331884,0.00019435553,0.0001454995,0.013838616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998265,0.000038013455,0.000005077992,0.000026866112,0.00008442078,0.000019195657],"domain_scores_gemma":[0.9998173,0.00006950376,0.000029012353,0.000040033072,0.000036030022,0.000008168083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021148493,0.0005041427,0.0003087505,0.00022744616,0.00022261027,0.00062902586,0.0008036171,0.0006464479,0.0024445658],"category_scores_gemma":[0.0005603045,0.00023011146,0.00049374497,0.0003106893,0.00035821684,0.0008621427,0.00048328534,0.0007607833,0.00063760584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001352496,0.000059923314,0.0007039899,0.000157786,0.00004464276,0.00030548318,0.00015342138,0.85129404,0.037495032,0.03197667,0.0014315244,0.07624222],"study_design_scores_gemma":[0.0000021840128,0.0000159475,0.000054461212,0.000002959442,0.0000030720987,0.00003209677,0.0000040160567,0.9954471,0.0023333135,0.00096268934,0.0011386871,0.0000034645013],"about_ca_topic_score_codex":0.002283153,"about_ca_topic_score_gemma":0.002735798,"teacher_disagreement_score":0.0024445658,"about_ca_system_score_codex":0.0004343944,"about_ca_system_score_gemma":0.00052316097,"threshold_uncertainty_score":0.0081778765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07033912,0.0007054755,0.9184554,0.00022828749,0.00009802766,0.00030487645,0.00023486838,0.0037155447,0.0059183827],"genre_scores_gemma":[0.47485787,0.00041606196,0.5135356,0.00025911783,0.00007557674,0.00027045206,0.00055745937,0.00012589009,0.009902011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987463,0.00023406594,0.00015408809,0.00016838552,0.00054955395,0.00014763481],"domain_scores_gemma":[0.99798703,0.0003914333,0.00014943884,0.0007099259,0.0006840987,0.00007814545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009768956,0.00053677394,0.00075009983,0.0017478424,0.0008466121,0.0011646304,0.0014586631,0.0008033717,0.0032265948],"category_scores_gemma":[0.0020450135,0.00030891184,0.0004673227,0.0021339355,0.00053219986,0.002744072,0.0012121104,0.00060487166,0.0013782267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013906591,0.00029280025,0.0030051046,0.00023937917,0.00011707905,0.00031116893,0.0004301595,0.019733205,0.221866,0.042424534,0.0067510377,0.7034388],"study_design_scores_gemma":[0.00021530171,0.0008279475,0.0020989857,0.000074884374,0.00016614395,0.0014922427,0.00020562443,0.65423673,0.26207075,0.02879099,0.04967616,0.00014423924],"about_ca_topic_score_codex":0.002813204,"about_ca_topic_score_gemma":0.0030302554,"teacher_disagreement_score":0.0032265948,"about_ca_system_score_codex":0.0014630313,"about_ca_system_score_gemma":0.0015523642,"threshold_uncertainty_score":0.010794103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039724957,0.0002683711,0.9563486,0.00012817876,0.00001836446,0.000020585707,0.000023147672,0.000043198183,0.0034245558],"genre_scores_gemma":[0.9240609,0.0004891375,0.07364708,0.000048321348,0.000028622788,0.00007016828,0.00002804718,0.000018994073,0.0016087528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999385,0.00031600706,0.000020668482,0.000085456726,0.00012094252,0.00007199987],"domain_scores_gemma":[0.9987626,0.0008284052,0.00016563197,0.000107015745,0.0000906565,0.000045742683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010852722,0.0011234467,0.0005956789,0.00031643026,0.0002520485,0.00066099525,0.00057411985,0.0007698448,0.00091647485],"category_scores_gemma":[0.003086348,0.00038158096,0.0004396893,0.00040807112,0.0013047383,0.0013305905,0.0012838476,0.0006579248,0.00018798445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019505578,0.000037203266,0.0003431517,0.00017829456,0.000050708655,0.00010959318,0.0001086924,0.8723602,0.021155596,0.08576112,0.00043874077,0.019261636],"study_design_scores_gemma":[0.000015199928,0.00013697469,0.00017318228,0.000014135703,0.000012885529,0.00006482901,0.000025166424,0.9744322,0.0033947781,0.021092657,0.0006207435,0.000017252909],"about_ca_topic_score_codex":0.00024567006,"about_ca_topic_score_gemma":0.00025708534,"teacher_disagreement_score":0.0011234467,"about_ca_system_score_codex":0.00043581042,"about_ca_system_score_gemma":0.0004287934,"threshold_uncertainty_score":0.00573951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0635222,0.0008544651,0.9311048,0.00025668932,0.000036995796,0.00006352253,0.000050244893,0.00009151755,0.004019519],"genre_scores_gemma":[0.94074833,0.00048302204,0.056769233,0.000058638096,0.000024053299,0.00007904099,0.000028557706,0.000009565269,0.0017996107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.00033287462,0.000018893354,0.0000966162,0.00014411088,0.00009836509],"domain_scores_gemma":[0.99950635,0.00035154258,0.000048167305,0.000026752776,0.000037682188,0.000029554025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007341596,0.0004536056,0.00051066006,0.00042026883,0.00042163115,0.00075196143,0.00063785777,0.00059374294,0.00048432828],"category_scores_gemma":[0.0015226565,0.00031998512,0.00033578492,0.0006335208,0.00065046025,0.0005277032,0.00075814646,0.0004036712,0.00008416104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104161954,0.000088482586,0.0009755647,0.00010131197,0.000040685198,0.00014842753,0.000114402035,0.9168081,0.004429791,0.014839406,0.00093332643,0.061416302],"study_design_scores_gemma":[0.000010645082,0.000036740115,0.00018474279,0.000003777817,0.000008281009,0.000037687183,0.000026882723,0.9929603,0.0008291912,0.0054361518,0.00045916767,0.000006392664],"about_ca_topic_score_codex":0.005179806,"about_ca_topic_score_gemma":0.005443345,"teacher_disagreement_score":0.005179806,"about_ca_system_score_codex":0.0007902345,"about_ca_system_score_gemma":0.0010102739,"threshold_uncertainty_score":0.010299265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119647354,0.00027165937,0.8741515,0.00025679142,0.000021937454,0.000032205004,0.00007257841,0.0004046123,0.005141422],"genre_scores_gemma":[0.97402275,0.00018292504,0.022397263,0.000052141433,0.000017784443,0.000051109528,0.00006357336,0.00009983292,0.0031127373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996019,0.00008331572,0.000017992426,0.00005865426,0.0001605343,0.00007767168],"domain_scores_gemma":[0.99548364,0.0030790989,0.0006066746,0.00025946667,0.00046706453,0.00010402513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012437014,0.0004423224,0.0004912728,0.00094143976,0.0004329046,0.0008707681,0.00075065834,0.00067699805,0.0018986795],"category_scores_gemma":[0.009080629,0.00029079727,0.0004409006,0.0004350923,0.0016066167,0.0016206446,0.00088136847,0.00083292945,0.00022995398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001748951,0.00003879061,0.0030275257,0.00013264421,0.000047900925,0.00050115195,0.00042954905,0.7914916,0.018750042,0.16786204,0.00053927355,0.017004661],"study_design_scores_gemma":[0.0000023031484,0.000009533147,0.00031384383,0.000004792027,0.0000034556979,0.00003338355,0.000017192559,0.9879578,0.0015973403,0.00991639,0.00013667168,0.0000073490396],"about_ca_topic_score_codex":0.003118911,"about_ca_topic_score_gemma":0.0010006612,"teacher_disagreement_score":0.003118911,"about_ca_system_score_codex":0.0012130765,"about_ca_system_score_gemma":0.0008436125,"threshold_uncertainty_score":0.00880152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77738625,0.0013864784,0.2089335,0.00018324368,0.00011539555,0.00004062146,0.00010225926,0.00041011986,0.0114422],"genre_scores_gemma":[0.9939897,0.000093479845,0.005397035,0.000024542973,0.000011610528,0.000010364574,0.000029726298,0.0000064180854,0.0004371144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899143,0.0003123505,0.000041584623,0.000102006336,0.0002669684,0.0002856953],"domain_scores_gemma":[0.99769527,0.0011302886,0.00024103375,0.00021834434,0.0006402098,0.000074799485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010934263,0.0007193914,0.000899965,0.0005092038,0.0007024709,0.001104211,0.00054338784,0.0007522958,0.0011662308],"category_scores_gemma":[0.0025637373,0.00014797851,0.00030363907,0.0005921061,0.00071855035,0.00084684894,0.0008594311,0.00038014827,0.00023757819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010678128,0.000120581804,0.0045563597,0.00020407775,0.00017803781,0.0005423393,0.00024689548,0.88256073,0.028864332,0.009965757,0.0008890445,0.07080413],"study_design_scores_gemma":[0.0000126485,0.00022665686,0.0008337275,0.0000065574886,0.000032710395,0.00014262267,0.000056349614,0.9936805,0.0038802077,0.00086553086,0.0002433903,0.000019152838],"about_ca_topic_score_codex":0.004354174,"about_ca_topic_score_gemma":0.0037493298,"teacher_disagreement_score":0.004354174,"about_ca_system_score_codex":0.00055682956,"about_ca_system_score_gemma":0.0006033484,"threshold_uncertainty_score":0.008657694},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009842785,0.0007679669,0.97945774,0.0004811363,0.0004967504,0.0004450617,0.00008944228,0.0009475197,0.007471629],"genre_scores_gemma":[0.66852444,0.0019649744,0.31223217,0.00097099645,0.00041970192,0.0025146862,0.00049166166,0.00026716932,0.01261426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989372,0.00032682024,0.00009449487,0.00016771538,0.00029281006,0.00018092622],"domain_scores_gemma":[0.99822754,0.0005769369,0.00020454946,0.0004341338,0.0004772128,0.00007970259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016167392,0.00062587287,0.0007181684,0.0010276888,0.00094418484,0.0012191858,0.0016985962,0.0012819256,0.0023035486],"category_scores_gemma":[0.0037463866,0.00031269956,0.00060219195,0.00077803596,0.0011813883,0.002312602,0.0019268235,0.0018288237,0.0008264407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005928516,0.00020374008,0.00095163373,0.00045914104,0.00009674115,0.0005673632,0.0009045474,0.11961613,0.025443396,0.70638305,0.01181853,0.13296278],"study_design_scores_gemma":[0.00019148002,0.00041407085,0.00031472923,0.00012721146,0.00010215784,0.0006076217,0.00013009936,0.856766,0.0068755643,0.08194656,0.052429754,0.00009474331],"about_ca_topic_score_codex":0.00195929,"about_ca_topic_score_gemma":0.001958327,"teacher_disagreement_score":0.0023035486,"about_ca_system_score_codex":0.0010000579,"about_ca_system_score_gemma":0.001800164,"threshold_uncertainty_score":0.008550286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34261453,0.0011199914,0.644625,0.0006762498,0.000080215825,0.00020413061,0.00015917871,0.00051895704,0.010001858],"genre_scores_gemma":[0.9839326,0.0005736362,0.012471234,0.00003133108,0.000025125484,0.00006035078,0.000059176047,0.00002503634,0.0028214625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994641,0.00013363722,0.0000230001,0.00008146859,0.00020342758,0.00009442505],"domain_scores_gemma":[0.9987255,0.0006091,0.00019402699,0.00006538304,0.0003499914,0.000055907483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072446285,0.0006425474,0.0005385605,0.00081620127,0.00062952697,0.0008566452,0.0008232504,0.0013038571,0.00079010235],"category_scores_gemma":[0.00262359,0.00029905615,0.0006414008,0.0005703559,0.0008732766,0.001386318,0.0007240088,0.00088475004,0.00016681734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048741913,0.000048932547,0.0029048268,0.00006238884,0.000029149292,0.00030130474,0.0002031719,0.9717907,0.0048692045,0.011548798,0.00046809218,0.0077247038],"study_design_scores_gemma":[8.107037e-7,0.000007860079,0.00015614984,0.0000013398097,0.0000025877555,0.00001730231,0.0000150939495,0.9988894,0.00020821855,0.0005961029,0.00010279529,0.0000023224356],"about_ca_topic_score_codex":0.014331931,"about_ca_topic_score_gemma":0.0040299105,"teacher_disagreement_score":0.014331931,"about_ca_system_score_codex":0.0011817709,"about_ca_system_score_gemma":0.00080754556,"threshold_uncertainty_score":0.02849704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3146198,0.0004549427,0.67774934,0.00031549556,0.000050684688,0.000027476985,0.00007805541,0.00036088564,0.006343274],"genre_scores_gemma":[0.9611993,0.00013938574,0.03714388,0.000051882977,0.000015963768,0.000015828304,0.000033218977,0.000023818542,0.00137686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994993,0.00012767414,0.000021800515,0.000053925927,0.00020279728,0.00009446341],"domain_scores_gemma":[0.99863225,0.0006212074,0.00030421623,0.0001735229,0.00021074168,0.000058149562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080761866,0.00034601105,0.00044243247,0.0006098354,0.00036945683,0.0007031594,0.00056606287,0.0006621529,0.0004983095],"category_scores_gemma":[0.0034632804,0.00014052339,0.00020379078,0.0005051659,0.0012071811,0.0008336814,0.00078106683,0.0005329435,0.00018729296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005360196,0.00006185192,0.0012069726,0.00014521436,0.000046691217,0.00035174654,0.00031619123,0.4838433,0.09324839,0.3617217,0.00087431975,0.057647727],"study_design_scores_gemma":[0.00002114688,0.000100333455,0.00030319125,0.000017109005,0.000007984185,0.00017461008,0.000028717739,0.94296116,0.027794931,0.027671207,0.000896459,0.000023110058],"about_ca_topic_score_codex":0.0010513334,"about_ca_topic_score_gemma":0.0006858396,"teacher_disagreement_score":0.0010513334,"about_ca_system_score_codex":0.0007292604,"about_ca_system_score_gemma":0.00071778113,"threshold_uncertainty_score":0.0052912235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029770223,0.00029117116,0.9644712,0.00020478616,0.00006487464,0.00008031627,0.000030456516,0.000230012,0.0048568714],"genre_scores_gemma":[0.914437,0.00021310622,0.082307085,0.000085051375,0.000031759926,0.00010282329,0.000033680633,0.000028385208,0.0027611088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993262,0.00019998885,0.00003468954,0.00014061932,0.00016353605,0.00013491152],"domain_scores_gemma":[0.99935955,0.00023361093,0.00010258184,0.0001010324,0.00015111665,0.000052209576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007315783,0.0007780849,0.0009284565,0.000666825,0.00085079187,0.00091620156,0.0016476577,0.00078729674,0.0018908448],"category_scores_gemma":[0.0015152062,0.0003108623,0.0004952604,0.0010284196,0.00085056527,0.0013815232,0.0014272287,0.0007711169,0.00034435253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023646654,0.00011183873,0.0003529223,0.000103868464,0.00006412278,0.00016518687,0.0001532407,0.8681591,0.0135688335,0.05643728,0.002282523,0.05836476],"study_design_scores_gemma":[0.000015676993,0.000038418217,0.000055258217,0.0000034425598,0.0000078797675,0.00004887485,0.0000117248865,0.9936848,0.0013401816,0.0043167914,0.0004647802,0.000012108535],"about_ca_topic_score_codex":0.0017016546,"about_ca_topic_score_gemma":0.0014366502,"teacher_disagreement_score":0.0018908448,"about_ca_system_score_codex":0.0011627044,"about_ca_system_score_gemma":0.0009844018,"threshold_uncertainty_score":0.008436084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007827719,0.00022749737,0.98973304,0.000043276967,0.000015831602,0.00002914989,0.000025467843,0.00010263932,0.0019953763],"genre_scores_gemma":[0.5337731,0.0012362333,0.45323154,0.00012402135,0.000089270296,0.00028210806,0.00015911358,0.00005880071,0.011045829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999724,0.000094726354,0.000014883366,0.000035654986,0.00011181244,0.000018897847],"domain_scores_gemma":[0.99967766,0.00013124156,0.000053087355,0.000024519979,0.000104632796,0.000008965867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051004713,0.00040794045,0.0003337557,0.0001908148,0.00018406674,0.0007102299,0.0004164657,0.00050675595,0.0026095642],"category_scores_gemma":[0.0009326511,0.0002343127,0.00022541614,0.00019204667,0.00018965466,0.00051082583,0.00033672125,0.0003296426,0.00083552283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011701347,0.00007232459,0.0007359906,0.000469369,0.00013012158,0.00025818704,0.00030618568,0.63861436,0.091359265,0.035272107,0.0027210356,0.22994411],"study_design_scores_gemma":[0.00003295723,0.00032539622,0.00039000655,0.000032275482,0.000034538483,0.00026056412,0.000052958927,0.97146827,0.014664227,0.005208726,0.007509569,0.000020520476],"about_ca_topic_score_codex":0.000442119,"about_ca_topic_score_gemma":0.0007158683,"teacher_disagreement_score":0.0026095642,"about_ca_system_score_codex":0.00030000252,"about_ca_system_score_gemma":0.00057101436,"threshold_uncertainty_score":0.0087298155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1883859,0.00088073127,0.80177325,0.00019770708,0.00003836248,0.000049392886,0.000056547357,0.00012645723,0.008491643],"genre_scores_gemma":[0.98309475,0.00013465148,0.015716715,0.000019787434,0.000008967792,0.000018476485,0.0000088910565,0.0000054141974,0.0009922333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997485,0.00006638827,0.000008400628,0.000049496703,0.000053717707,0.000073455136],"domain_scores_gemma":[0.9997422,0.00017133437,0.000026433114,0.000017453218,0.000024602892,0.000017981467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039464296,0.0003758633,0.00049714855,0.00025319643,0.00033537508,0.0008405497,0.0006658695,0.00056822377,0.00080016983],"category_scores_gemma":[0.0010722971,0.0001969802,0.0003151781,0.00042631512,0.0005654015,0.0008020974,0.0010568852,0.00038789134,0.00009479938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001308121,0.000046380563,0.00047984294,0.000054813812,0.000031416977,0.00017117112,0.00013368898,0.9315347,0.0060646436,0.013840204,0.00047571873,0.04703662],"study_design_scores_gemma":[0.0000060014204,0.000037252634,0.00018814864,0.0000026560022,0.000006221533,0.00004228291,0.00003545222,0.993869,0.00082021946,0.004643938,0.00034416077,0.000004685702],"about_ca_topic_score_codex":0.0030862498,"about_ca_topic_score_gemma":0.0038821355,"teacher_disagreement_score":0.0030862498,"about_ca_system_score_codex":0.00056909473,"about_ca_system_score_gemma":0.00057331193,"threshold_uncertainty_score":0.0061365366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28332445,0.001499116,0.70481724,0.00020580602,0.00006879649,0.000065265165,0.000058707545,0.0007526586,0.009207916],"genre_scores_gemma":[0.9006083,0.00026674417,0.09678203,0.00004588609,0.000029352786,0.000031525713,0.00003838869,0.000019712244,0.0021781751],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965703,0.00008032851,0.000009369737,0.000035754576,0.00016694641,0.000050493734],"domain_scores_gemma":[0.9996253,0.0001289057,0.000055132674,0.00006494792,0.00010775128,0.000017898907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034017177,0.00028240593,0.00024221529,0.00036537295,0.00037168828,0.00058302475,0.00040709143,0.00036650605,0.00095188606],"category_scores_gemma":[0.0005254824,0.00010986106,0.0001561011,0.0005870602,0.00033218533,0.00032881086,0.00036476928,0.0004222067,0.00030284605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061170943,0.00015546886,0.0041553755,0.00039239277,0.00006574057,0.00039640852,0.00028036107,0.09092986,0.568421,0.017092632,0.0017528086,0.31574628],"study_design_scores_gemma":[0.00004805764,0.00075263646,0.0025735379,0.000036235495,0.00004943056,0.00051730336,0.000081565646,0.6650202,0.31606454,0.0028718105,0.011933386,0.000051391416],"about_ca_topic_score_codex":0.0011632905,"about_ca_topic_score_gemma":0.0023584387,"teacher_disagreement_score":0.0011632905,"about_ca_system_score_codex":0.00058998517,"about_ca_system_score_gemma":0.00046236374,"threshold_uncertainty_score":0.004280627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10588844,0.0048123384,0.88068897,0.00029069924,0.00017950892,0.000099468925,0.0000505253,0.00049719855,0.0074929367],"genre_scores_gemma":[0.98203146,0.000916052,0.015647296,0.00009789707,0.00007806606,0.000031943062,0.000021530066,0.000007924336,0.0011677875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.00015259528,0.000029605819,0.00011058125,0.0002352136,0.00011040632],"domain_scores_gemma":[0.99943453,0.0002456772,0.00009514195,0.000063642634,0.00012112593,0.000039788203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045402045,0.000676251,0.0004038602,0.0004983608,0.00069297943,0.0007422857,0.00062954554,0.00040549337,0.00042793728],"category_scores_gemma":[0.0011074075,0.0002052185,0.00016655667,0.00077664485,0.00060769235,0.0005263002,0.0004845439,0.0004233289,0.000111438654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042012485,0.00016232296,0.0028588152,0.00030231554,0.00007590219,0.0006961933,0.00029343372,0.5771022,0.05582784,0.037134245,0.0029447603,0.32218185],"study_design_scores_gemma":[0.000027721062,0.0003008529,0.00073776976,0.000017289738,0.00003684094,0.00031773464,0.000059031765,0.9803792,0.0063735284,0.008678627,0.0030528435,0.000018474293],"about_ca_topic_score_codex":0.0061452813,"about_ca_topic_score_gemma":0.006586473,"teacher_disagreement_score":0.0061452813,"about_ca_system_score_codex":0.000783867,"about_ca_system_score_gemma":0.0007691581,"threshold_uncertainty_score":0.012219012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02929343,0.0002827135,0.9692244,0.00008063376,0.000023956922,0.0000141172595,0.000013088895,0.00019181802,0.00087595894],"genre_scores_gemma":[0.8269332,0.000454387,0.17039447,0.00008925516,0.00003776718,0.000060879276,0.00008109712,0.000044138185,0.0019048458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994672,0.00021618031,0.000021465974,0.000061339764,0.00017967686,0.00005414072],"domain_scores_gemma":[0.9991505,0.00047583814,0.00010594162,0.00008098438,0.00015789515,0.000028801334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007510265,0.00057338184,0.000663403,0.0002150181,0.00026793763,0.00048126013,0.0005083285,0.00053905864,0.00049045985],"category_scores_gemma":[0.0025187393,0.00029739653,0.0004100005,0.00031284153,0.00059598364,0.0007450862,0.00057894865,0.000712829,0.00020073488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018374748,0.000048685913,0.0006701721,0.00010328358,0.000042830085,0.000109509056,0.00010113888,0.90505266,0.012607139,0.0052778465,0.0006204051,0.07518265],"study_design_scores_gemma":[0.0000028991901,0.000027765484,0.00009058104,0.0000020769787,0.0000028104546,0.000015363783,0.0000039637093,0.9980702,0.0012680447,0.00040166083,0.00011109773,0.0000035753817],"about_ca_topic_score_codex":0.0030535124,"about_ca_topic_score_gemma":0.0027050467,"teacher_disagreement_score":0.0030535124,"about_ca_system_score_codex":0.0002713592,"about_ca_system_score_gemma":0.000657701,"threshold_uncertainty_score":0.006071508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04167572,0.0013960382,0.93169445,0.0006438581,0.00007519159,0.00010662487,0.00008791584,0.00017084947,0.02414924],"genre_scores_gemma":[0.9590636,0.0012958184,0.03330135,0.000108489105,0.000060235066,0.00015608358,0.00003334662,0.000013891902,0.0059671686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.00014857021,0.000009291662,0.000051077248,0.00009675497,0.00005061364],"domain_scores_gemma":[0.99981385,0.000070159964,0.000035746652,0.00002499136,0.00004484537,0.000010411692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046515896,0.00068873377,0.00047299397,0.0003279665,0.0004421902,0.0011646926,0.0009120778,0.0009323432,0.00097487937],"category_scores_gemma":[0.0006140791,0.0002643321,0.00044632496,0.000551226,0.000944001,0.0009176391,0.0008044047,0.00078962516,0.0003206952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010260094,0.00009472165,0.0006317478,0.00018379984,0.000053457185,0.00038470567,0.00025269514,0.7893367,0.01720863,0.17223096,0.0015246778,0.017995302],"study_design_scores_gemma":[0.000006353959,0.000065823086,0.000113219685,0.0000111317295,0.000016993117,0.000076632525,0.000027136932,0.98758763,0.0010419176,0.00994301,0.0010990695,0.000011117704],"about_ca_topic_score_codex":0.0022160301,"about_ca_topic_score_gemma":0.0021764578,"teacher_disagreement_score":0.0022160301,"about_ca_system_score_codex":0.000839882,"about_ca_system_score_gemma":0.0006912134,"threshold_uncertainty_score":0.0060938597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7832332,0.0014602748,0.2026428,0.00044722392,0.00008280657,0.0000791837,0.00017836291,0.00025847173,0.01161756],"genre_scores_gemma":[0.9960764,0.00017687379,0.00299601,0.000016370379,0.000004594407,0.000015826834,0.000021731885,0.000004594399,0.0006875895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879766,0.00049716246,0.000052177835,0.00014843456,0.0002845841,0.00022005284],"domain_scores_gemma":[0.9963924,0.002372656,0.00039407174,0.00018212858,0.00057652267,0.00008212569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013868165,0.0011907893,0.0007824129,0.0007709975,0.00064849097,0.001359116,0.00068152073,0.0012311003,0.0008821704],"category_scores_gemma":[0.0032967958,0.00023635295,0.000563159,0.00063370436,0.001138166,0.0018458695,0.0011517989,0.0005557187,0.00017737791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033938175,0.00003650065,0.0012816832,0.00009817204,0.000059572805,0.00020608348,0.00007782068,0.98127407,0.0071581006,0.0036405728,0.00016070138,0.005667248],"study_design_scores_gemma":[0.000014104623,0.00025694343,0.0003736373,0.000009259675,0.000033601744,0.00012036541,0.000059819722,0.99219936,0.005646188,0.0011379499,0.00012899144,0.000019767862],"about_ca_topic_score_codex":0.0035618793,"about_ca_topic_score_gemma":0.0018339901,"teacher_disagreement_score":0.0035618793,"about_ca_system_score_codex":0.0015126639,"about_ca_system_score_gemma":0.0007452019,"threshold_uncertainty_score":0.010975182},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05875416,0.0007244652,0.9340985,0.00018568439,0.00003075351,0.000043663473,0.0000400745,0.0000733902,0.006049316],"genre_scores_gemma":[0.93507653,0.0009748627,0.06112034,0.000057916975,0.000028379414,0.000061966006,0.000028022558,0.00002140369,0.0026305295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996338,0.00014144981,0.000019940326,0.000052296073,0.00009749882,0.000055091303],"domain_scores_gemma":[0.99924624,0.0004771762,0.00012846649,0.000034839995,0.00009373897,0.0000195609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006529279,0.00074439886,0.00064961833,0.00031705506,0.00022552126,0.00082933943,0.00063717907,0.0007182607,0.0008278764],"category_scores_gemma":[0.0017316921,0.0003848607,0.0003564935,0.00041330233,0.00048890896,0.0010431702,0.0005190854,0.0004299419,0.00021829699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023781593,0.00007497798,0.000399658,0.00034109657,0.00006238216,0.0002895371,0.00019662439,0.82764965,0.04006718,0.06999838,0.00080133707,0.059881423],"study_design_scores_gemma":[0.000014826375,0.000100215526,0.00009759872,0.000011915964,0.000016776756,0.00006663415,0.00003151251,0.9788957,0.004108603,0.01605031,0.00059634453,0.000009611102],"about_ca_topic_score_codex":0.00049357675,"about_ca_topic_score_gemma":0.0009011998,"teacher_disagreement_score":0.00082933943,"about_ca_system_score_codex":0.00055685954,"about_ca_system_score_gemma":0.0004456498,"threshold_uncertainty_score":0.004040301},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030218376,0.00056975323,0.96629536,0.000096382675,0.00007014089,0.000032757547,0.000021593101,0.00020638845,0.00248933],"genre_scores_gemma":[0.62337637,0.0012279022,0.3702635,0.000073146126,0.00013868931,0.0000729622,0.00008519024,0.00004174049,0.0047206157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997497,0.00006467735,0.000016549764,0.000029040646,0.00012597442,0.000013972524],"domain_scores_gemma":[0.99968815,0.00013588171,0.00004993768,0.000044436423,0.000073304436,0.00000828985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022737005,0.00040044996,0.00029828787,0.0003443612,0.00018018307,0.00036201862,0.0003273686,0.0002445229,0.0014783583],"category_scores_gemma":[0.00081428245,0.00010533029,0.0003576804,0.00036172918,0.00028070592,0.00055835035,0.00030125098,0.0003215806,0.00032280406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004225817,0.00008075922,0.0015286807,0.00050772884,0.00012353894,0.0005943111,0.00030095968,0.20828772,0.24915649,0.03519421,0.0019499091,0.50185317],"study_design_scores_gemma":[0.000030533476,0.000688635,0.0013299052,0.000025827814,0.00006311485,0.0015103498,0.00004885825,0.9076856,0.07334229,0.0047660954,0.01048401,0.000024704279],"about_ca_topic_score_codex":0.0003463472,"about_ca_topic_score_gemma":0.0003897153,"teacher_disagreement_score":0.0014783583,"about_ca_system_score_codex":0.00018191141,"about_ca_system_score_gemma":0.00032196374,"threshold_uncertainty_score":0.004945576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47390202,0.0030155343,0.5073352,0.00050028926,0.0000826948,0.00011475903,0.0004532566,0.0005658353,0.014030393],"genre_scores_gemma":[0.9909965,0.0005556979,0.0077028093,0.000033194407,0.000022274706,0.000030732877,0.00011295342,0.00002335723,0.00052236806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792033,0.0008672508,0.00009163003,0.00019159453,0.00067397684,0.00025514737],"domain_scores_gemma":[0.9925938,0.0056360886,0.0006141396,0.00030635126,0.0007506479,0.00009894879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020479495,0.0008864259,0.0008270284,0.0010709827,0.0003783056,0.00090022624,0.0008818931,0.0008057046,0.001148942],"category_scores_gemma":[0.008603134,0.00024090297,0.00054532656,0.001123481,0.0008406907,0.0010955684,0.000758089,0.0004650415,0.00016392829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001381656,0.00002639176,0.0034037053,0.000099153935,0.00004133572,0.0003064561,0.000071570015,0.979218,0.0031693198,0.0065523195,0.0003735541,0.0065999227],"study_design_scores_gemma":[0.0000040750842,0.0000610583,0.0016052279,0.000011960172,0.00001370409,0.00018070442,0.00003981534,0.994921,0.0018512312,0.0011811423,0.00011640925,0.000013669722],"about_ca_topic_score_codex":0.003171858,"about_ca_topic_score_gemma":0.0014591806,"teacher_disagreement_score":0.003171858,"about_ca_system_score_codex":0.0010903324,"about_ca_system_score_gemma":0.00061209156,"threshold_uncertainty_score":0.01083076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012912518,0.00069242,0.9829405,0.00021050278,0.00006836854,0.000035916815,0.000069646616,0.00047990214,0.0025901906],"genre_scores_gemma":[0.6547204,0.00096059445,0.33610296,0.0005211656,0.00014300924,0.00014045589,0.00022869991,0.000048484366,0.00713418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987068,0.0005241507,0.000059350903,0.00013960485,0.00045285968,0.000117186326],"domain_scores_gemma":[0.9982893,0.0009803959,0.00015492653,0.00015274149,0.00037245662,0.000050157505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015984388,0.0006957949,0.0009830091,0.000703003,0.00041899795,0.001093593,0.00084337854,0.0009830035,0.0017610488],"category_scores_gemma":[0.0032102633,0.00028113794,0.00047601078,0.0007496525,0.0006367587,0.0015319654,0.0012178122,0.00095481816,0.00065771193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010015352,0.00017156142,0.0018809633,0.00043879365,0.00018591035,0.0004118,0.000293898,0.4469762,0.08086871,0.12124549,0.006650868,0.33987427],"study_design_scores_gemma":[0.000024339495,0.00012306744,0.00014008109,0.000011122941,0.000019479006,0.00012456659,0.000014110202,0.98609865,0.0058385665,0.005625453,0.001958295,0.000022295253],"about_ca_topic_score_codex":0.0011176112,"about_ca_topic_score_gemma":0.0016136443,"teacher_disagreement_score":0.0017610488,"about_ca_system_score_codex":0.000715809,"about_ca_system_score_gemma":0.0015610401,"threshold_uncertainty_score":0.008453429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115563504,0.000513122,0.87737393,0.00015207096,0.000047334554,0.00008833515,0.000025638687,0.00015775957,0.006078341],"genre_scores_gemma":[0.972011,0.00015002784,0.027029067,0.00003577496,0.000016375923,0.000045250494,0.0000100182515,0.0000083604,0.00069410494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904126,0.00031332826,0.00004206013,0.00014570465,0.0002846348,0.00017301353],"domain_scores_gemma":[0.99888176,0.00043291357,0.00018162842,0.00007848914,0.00037993296,0.000045295215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014038386,0.00075969845,0.00053718296,0.00035827933,0.00041884184,0.0010218385,0.0007787863,0.00062328734,0.00084700953],"category_scores_gemma":[0.0017346761,0.00033014422,0.0005111624,0.00033749195,0.00056351424,0.0005510687,0.0007294898,0.0004214411,0.00020636639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025678522,0.00008582735,0.0015491605,0.00009872649,0.00015577486,0.0003636074,0.00018161073,0.8929597,0.04732987,0.01827593,0.0004593284,0.038283713],"study_design_scores_gemma":[0.0000074528157,0.00010572297,0.00019179737,0.0000054284133,0.000027635802,0.000060036913,0.0000131479965,0.99623966,0.0024066407,0.00069850497,0.0002366467,0.0000073875713],"about_ca_topic_score_codex":0.002678293,"about_ca_topic_score_gemma":0.0021819305,"teacher_disagreement_score":0.002678293,"about_ca_system_score_codex":0.00075716013,"about_ca_system_score_gemma":0.0009876183,"threshold_uncertainty_score":0.007424295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2848819,0.0027157932,0.6926624,0.0009064003,0.00011153482,0.00004790803,0.00015944662,0.00020585944,0.018308828],"genre_scores_gemma":[0.992725,0.0009604996,0.0043531763,0.000049641993,0.000037932365,0.000013338286,0.00003269824,0.000019180152,0.0018084069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939644,0.0002145282,0.000019532055,0.00006575725,0.00018453969,0.00011916131],"domain_scores_gemma":[0.9980725,0.0011348639,0.00029379773,0.000105613064,0.00034906185,0.00004410651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011268685,0.0007936728,0.0005811407,0.00058809004,0.00034904206,0.0009120713,0.0004694282,0.0006328289,0.00096726243],"category_scores_gemma":[0.0026755852,0.0002819077,0.0004898611,0.00053483713,0.0011467208,0.0012708845,0.00075925153,0.0006355243,0.00018898853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009922863,0.000019463525,0.0013469346,0.00015026893,0.00005814062,0.0003711356,0.00014657002,0.94501424,0.009454518,0.037800673,0.0005121078,0.0050267735],"study_design_scores_gemma":[0.0000016228463,0.000023192115,0.00029244015,0.000006537751,0.000007706506,0.00004639478,0.000030358993,0.9958758,0.0008656522,0.0027226452,0.00012232809,0.0000053428816],"about_ca_topic_score_codex":0.002040003,"about_ca_topic_score_gemma":0.0011097632,"teacher_disagreement_score":0.002040003,"about_ca_system_score_codex":0.0008069655,"about_ca_system_score_gemma":0.00060536794,"threshold_uncertainty_score":0.005959511},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012142057,0.00026048938,0.9849203,0.00021869836,0.000035351,0.00006868523,0.000036519177,0.0005183771,0.0017995257],"genre_scores_gemma":[0.7259437,0.0010370362,0.26934448,0.00024742837,0.00010720057,0.00013678224,0.00023858134,0.000147656,0.0027971969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547404,0.0014686951,0.00029359479,0.00053673703,0.0019824046,0.00024459863],"domain_scores_gemma":[0.99389774,0.0032748363,0.0008866406,0.0007578938,0.0010619778,0.00012105847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003407075,0.0011241495,0.00085921824,0.0020986581,0.00048400104,0.0031557637,0.0014034008,0.0015287953,0.0007150171],"category_scores_gemma":[0.007990523,0.0004984886,0.0016663214,0.0008482044,0.0019047572,0.0036904255,0.0017085668,0.0017621951,0.0003397438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022964845,0.00018690426,0.0094839195,0.00056436274,0.00018133635,0.0012788165,0.0009948512,0.5951348,0.023179391,0.2199659,0.001932232,0.14686781],"study_design_scores_gemma":[0.0000045254837,0.000042573338,0.00038684954,0.00005379665,0.00002056724,0.00018646324,0.00007654787,0.9602885,0.0047811223,0.03211478,0.0020245365,0.000019686791],"about_ca_topic_score_codex":0.0032209102,"about_ca_topic_score_gemma":0.0018108117,"teacher_disagreement_score":0.003407075,"about_ca_system_score_codex":0.0010989729,"about_ca_system_score_gemma":0.0015467264,"threshold_uncertainty_score":0.018018544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039857876,0.001957265,0.9503731,0.00020381634,0.000098495715,0.00005037025,0.000018983255,0.00011111568,0.007328972],"genre_scores_gemma":[0.9409501,0.0011415683,0.055730093,0.00008415546,0.00008063306,0.00005873088,0.000012867387,0.000010386624,0.0019313806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999491,0.00022272163,0.000016593773,0.00006992105,0.00013988966,0.000059887003],"domain_scores_gemma":[0.9991134,0.0005435571,0.00009857475,0.000084178704,0.00013723207,0.00002300517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085127837,0.0006552531,0.00057887187,0.0004305612,0.00055485684,0.0010209996,0.0007796193,0.0006961278,0.00048865017],"category_scores_gemma":[0.0018777845,0.0002147329,0.00045388888,0.00038711354,0.00074274495,0.00063982775,0.0006312976,0.00039778187,0.0001895798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026380317,0.00027790814,0.0016534907,0.00051341864,0.00017331376,0.0011493718,0.0008347233,0.5572473,0.06124535,0.20855638,0.0029991677,0.16508576],"study_design_scores_gemma":[0.000010000859,0.00021282726,0.00023292124,0.00001558931,0.000033371733,0.00031115147,0.000054064087,0.9763106,0.0028447418,0.017086579,0.002870052,0.000018059101],"about_ca_topic_score_codex":0.0010795842,"about_ca_topic_score_gemma":0.0017320169,"teacher_disagreement_score":0.0010795842,"about_ca_system_score_codex":0.00054799166,"about_ca_system_score_gemma":0.0005318982,"threshold_uncertainty_score":0.0045019984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14191218,0.00078009046,0.83097684,0.0004536492,0.00043213513,0.00023423096,0.00048967043,0.0015038099,0.023217399],"genre_scores_gemma":[0.5580991,0.0010128738,0.42666298,0.00025889478,0.00008715666,0.0003002983,0.001161681,0.00025124624,0.012165689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999178,0.00012223424,0.0000589818,0.0001652388,0.0003220271,0.00015342694],"domain_scores_gemma":[0.9985487,0.0003043843,0.00019386463,0.00038473855,0.00042496165,0.0001432405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040694146,0.00058074255,0.0006036547,0.0010460508,0.00083221425,0.0009116738,0.0007404429,0.00074172777,0.002194189],"category_scores_gemma":[0.0020234673,0.00034424927,0.00068292645,0.0010251743,0.0010362733,0.0006161615,0.0019980064,0.0014444861,0.0011663156],"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.00028314823,0.000161463,0.002034776,0.0006643984,0.00006612634,0.0011176644,0.00094639213,0.039262433,0.13876107,0.6025474,0.006326438,0.20782872],"study_design_scores_gemma":[0.00014150505,0.00083900074,0.0013917087,0.00030344096,0.00013879151,0.0023105752,0.00034854302,0.1880177,0.3913933,0.31791174,0.09696918,0.00023452037],"about_ca_topic_score_codex":0.00034141092,"about_ca_topic_score_gemma":0.00036453566,"teacher_disagreement_score":0.002194189,"about_ca_system_score_codex":0.0005570358,"about_ca_system_score_gemma":0.0012804295,"threshold_uncertainty_score":0.007340312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25284654,0.0009936518,0.7384849,0.00019047507,0.000068863366,0.00007272992,0.000078178266,0.00040613025,0.0068585514],"genre_scores_gemma":[0.9737602,0.00018626329,0.025007665,0.000015123853,0.000008675023,0.000017117805,0.000033491684,0.000007017212,0.0009644178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997856,0.00007520645,0.0000067208343,0.000018585952,0.000068894755,0.000045000896],"domain_scores_gemma":[0.9997595,0.0001271304,0.000031104948,0.000022476408,0.000041981373,0.000017828832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041354235,0.00037160487,0.00024015672,0.00043218076,0.0003136673,0.00054695614,0.0004061983,0.00029749578,0.0005345196],"category_scores_gemma":[0.0008946924,0.00013986688,0.00018069509,0.00037755352,0.00026513246,0.00043654945,0.00060372805,0.00020272857,0.00010626125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001376598,0.00006432367,0.0020288948,0.000038931506,0.000030634405,0.000085933185,0.000072070776,0.88770497,0.0074503887,0.0071990513,0.00079662,0.09439052],"study_design_scores_gemma":[0.0000050759145,0.000056363726,0.0005038235,0.0000026010773,0.000004564955,0.000021652186,0.000019018724,0.9964929,0.0012756097,0.0012593612,0.00035423064,0.00000481891],"about_ca_topic_score_codex":0.0046428195,"about_ca_topic_score_gemma":0.0037712457,"teacher_disagreement_score":0.0046428195,"about_ca_system_score_codex":0.00060705707,"about_ca_system_score_gemma":0.0003978623,"threshold_uncertainty_score":0.009231567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031022979,0.00089721096,0.9632241,0.00014328102,0.0000637369,0.0000360243,0.00004775435,0.0002335235,0.0043314234],"genre_scores_gemma":[0.8425802,0.0010575711,0.15103985,0.00011501019,0.00008054997,0.000073111754,0.0001023155,0.00003497268,0.0049163597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993593,0.00021132476,0.00003010842,0.000072528666,0.0002443586,0.00008239372],"domain_scores_gemma":[0.99912196,0.00049321144,0.00008539855,0.00009638627,0.0001815003,0.000021480835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083964906,0.0006743422,0.00067241985,0.00036961623,0.0003485172,0.0007702513,0.00062895246,0.0007230021,0.0012749479],"category_scores_gemma":[0.0022704708,0.00035364926,0.00046157438,0.00065299106,0.0008843413,0.0008862785,0.0008195727,0.0007231885,0.00039400128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002691685,0.000047727408,0.00067449437,0.00017023567,0.00007931445,0.00032312062,0.00019812876,0.87224454,0.015823856,0.03946444,0.001195746,0.06950908],"study_design_scores_gemma":[0.000007405614,0.000072312934,0.00013867562,0.000010930133,0.000012504085,0.00008636471,0.000012323947,0.9908793,0.0042847246,0.0039538345,0.00052795076,0.000013675259],"about_ca_topic_score_codex":0.0021718298,"about_ca_topic_score_gemma":0.0020187018,"teacher_disagreement_score":0.0021718298,"about_ca_system_score_codex":0.00042671952,"about_ca_system_score_gemma":0.0008494767,"threshold_uncertainty_score":0.004440546},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35718137,0.0019000031,0.6142034,0.00065595383,0.000104228595,0.00005565054,0.00025332565,0.0005660613,0.025079964],"genre_scores_gemma":[0.98458165,0.0006512774,0.01313853,0.000061198334,0.000016850323,0.000022464967,0.0000625009,0.000016607779,0.001448972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998432,0.0007206824,0.00007339234,0.0001177329,0.0004060517,0.00025006672],"domain_scores_gemma":[0.99487996,0.0034788472,0.0005750851,0.00042289103,0.00055293215,0.00009026008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018858156,0.0010829902,0.00077721494,0.00039987985,0.00045443285,0.000979928,0.0005802009,0.0008687455,0.001659424],"category_scores_gemma":[0.004590777,0.00029422462,0.0005427623,0.0007639075,0.0012849853,0.001412951,0.0013431644,0.0007510594,0.00041693743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007152148,0.000072669885,0.0025930963,0.00028573038,0.00014608496,0.00041790068,0.00015160127,0.89937717,0.036473144,0.03280521,0.0007905797,0.026171554],"study_design_scores_gemma":[0.000018677212,0.00017047372,0.00055169786,0.000021640773,0.000037529768,0.00021237296,0.000049799673,0.97688645,0.018002719,0.0037354676,0.00028236883,0.000030880772],"about_ca_topic_score_codex":0.0013497652,"about_ca_topic_score_gemma":0.0011062914,"teacher_disagreement_score":0.0018858156,"about_ca_system_score_codex":0.0007007776,"about_ca_system_score_gemma":0.00090053974,"threshold_uncertainty_score":0.009973288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0612542,0.00096436386,0.9131073,0.0013124387,0.0001524875,0.00018273859,0.0003266982,0.0003850911,0.022314746],"genre_scores_gemma":[0.9601866,0.000982971,0.023244027,0.00014722598,0.00006563207,0.00020000269,0.00010200331,0.00007592166,0.014995755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931073,0.00017772282,0.00002044172,0.00009840513,0.0001313812,0.0002613101],"domain_scores_gemma":[0.9981688,0.0011285602,0.00023492101,0.000047343354,0.00033748033,0.000082866616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011937249,0.00095617224,0.0012295481,0.0008407339,0.0007084487,0.002057956,0.0022161987,0.0023097335,0.0057273027],"category_scores_gemma":[0.0033249806,0.0007794077,0.0006303278,0.0011205774,0.0015233982,0.0019150475,0.0009800134,0.001521586,0.00079818437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006589422,0.00003032049,0.00021025048,0.00006222239,0.000013601893,0.00023564367,0.000121396064,0.9330255,0.002017651,0.06054196,0.0011374827,0.0025380708],"study_design_scores_gemma":[0.000006247928,0.000014210532,0.000034699875,0.000005676209,0.0000042378615,0.000019939655,0.000020084988,0.99523216,0.000119944445,0.004326431,0.00021042052,0.000006006202],"about_ca_topic_score_codex":0.013901875,"about_ca_topic_score_gemma":0.0067331456,"teacher_disagreement_score":0.013901875,"about_ca_system_score_codex":0.0042588008,"about_ca_system_score_gemma":0.0021151667,"threshold_uncertainty_score":0.030899882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15837361,0.0009827244,0.8334213,0.00053448,0.000075580436,0.00010363945,0.00006802568,0.00011855666,0.0063220086],"genre_scores_gemma":[0.97957146,0.00012707131,0.01947869,0.000052924497,0.00001517186,0.000020549187,0.000013992362,0.0000069782063,0.0007130812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994413,0.00018690457,0.00001439134,0.00008699193,0.00009170565,0.00017858268],"domain_scores_gemma":[0.9993979,0.0004099111,0.00007837363,0.000021549275,0.000050999763,0.000041218318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800484,0.00056867016,0.0005306714,0.00035001957,0.0005318474,0.0009518262,0.00085926935,0.0005869894,0.0011880599],"category_scores_gemma":[0.0016267395,0.00022909525,0.0003094896,0.0005680172,0.00055274885,0.0005921772,0.00078043813,0.00043117173,0.00008247482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001020623,0.000051100284,0.00057911745,0.00003197765,0.000020158242,0.00013390183,0.000028114498,0.9701507,0.0023388767,0.008208152,0.000533705,0.01782206],"study_design_scores_gemma":[0.0000037888294,0.00000897845,0.00007283945,0.0000011694007,0.0000025027687,0.000007139182,0.000010628711,0.9985461,0.00018547013,0.0010728973,0.00008715671,0.0000013818465],"about_ca_topic_score_codex":0.012839997,"about_ca_topic_score_gemma":0.012940526,"teacher_disagreement_score":0.012839997,"about_ca_system_score_codex":0.001421416,"about_ca_system_score_gemma":0.0012687129,"threshold_uncertainty_score":0.025530517},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53068244,0.0017251588,0.4597212,0.0005959681,0.00009333273,0.00003332607,0.00005277994,0.00013349854,0.0069622565],"genre_scores_gemma":[0.9952081,0.00028710367,0.0037871206,0.00002085182,0.00001644631,0.000007727153,0.0000079080755,0.0000028052273,0.00066184404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936146,0.00020097828,0.000022331751,0.00010642345,0.00012360253,0.0001851843],"domain_scores_gemma":[0.9989207,0.000558969,0.0001627948,0.0001263091,0.00018514288,0.00004611899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171692,0.00078322453,0.00067286787,0.00029602993,0.0006925823,0.00075225165,0.0006823855,0.00080257026,0.0003905089],"category_scores_gemma":[0.0017094641,0.00028847717,0.0003524801,0.0004622009,0.00094771205,0.0011765525,0.00084232684,0.00044373973,0.00012622109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000533442,0.00007302342,0.0058032563,0.0002147553,0.00014836874,0.0039340504,0.0007648115,0.8060656,0.06936447,0.07591699,0.0008122594,0.036368966],"study_design_scores_gemma":[0.000016659551,0.00014305694,0.00068356976,0.000008882645,0.00004391979,0.0009434256,0.00010798751,0.98603034,0.0054485314,0.0057334127,0.00081727037,0.000022904067],"about_ca_topic_score_codex":0.0020500019,"about_ca_topic_score_gemma":0.0015733729,"teacher_disagreement_score":0.0020500019,"about_ca_system_score_codex":0.000836751,"about_ca_system_score_gemma":0.0005893107,"threshold_uncertainty_score":0.006071031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048232086,0.0018263301,0.9394775,0.00042713716,0.00006203658,0.00009366485,0.00016607426,0.0003475392,0.009367576],"genre_scores_gemma":[0.89381135,0.0017416435,0.100105025,0.00016328733,0.00007060352,0.00021186119,0.00013704236,0.00006244225,0.003696675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989454,0.00029716134,0.00003673011,0.00010200659,0.00044182088,0.0001769762],"domain_scores_gemma":[0.9965604,0.0017927284,0.000490657,0.00024353203,0.0008147969,0.00009785272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089271506,0.0007783051,0.0005722446,0.0009795331,0.0006040435,0.0012905477,0.00072270515,0.0009889393,0.0020479506],"category_scores_gemma":[0.00433107,0.00034216818,0.00039734397,0.0011931014,0.0010897903,0.0010251133,0.00084017136,0.0007596395,0.0004196245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003911874,0.00006639314,0.0015907859,0.00030215824,0.00008442975,0.00045950589,0.00032545088,0.7953924,0.01598456,0.12619399,0.0019409491,0.057268325],"study_design_scores_gemma":[0.00001135878,0.00004920262,0.00017658136,0.00003256936,0.000013006524,0.00015999725,0.000026137293,0.9871982,0.002595302,0.008629352,0.0010911208,0.000017088976],"about_ca_topic_score_codex":0.006146193,"about_ca_topic_score_gemma":0.0046280837,"teacher_disagreement_score":0.006146193,"about_ca_system_score_codex":0.0017224705,"about_ca_system_score_gemma":0.0020829064,"threshold_uncertainty_score":0.012497425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009154396,0.00067790935,0.9627386,0.0014465163,0.000093478004,0.00017287694,0.00007899341,0.00022013439,0.025417127],"genre_scores_gemma":[0.4999873,0.0018202241,0.47538635,0.00037407532,0.00017695766,0.0006216792,0.00017895926,0.00021323867,0.02124121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825925,0.00070468814,0.00011330348,0.0001961321,0.0006143059,0.00011237802],"domain_scores_gemma":[0.99834573,0.0007542116,0.00014020134,0.00036891524,0.00027907055,0.000111873815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025923585,0.0005637707,0.000476764,0.0014224985,0.0017435016,0.0030491855,0.0011280763,0.0015490907,0.005311265],"category_scores_gemma":[0.003613195,0.000417206,0.000573018,0.00092750473,0.0053649317,0.0059607467,0.0027991135,0.0021336125,0.0009082261],"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.000017416889,0.000010999505,0.00008718566,0.00004598254,0.0000032844925,0.00009782049,0.00027241063,0.004483206,0.0010575384,0.9841225,0.00053362915,0.009267895],"study_design_scores_gemma":[0.000024327632,0.000079797814,0.00018904443,0.00012117018,0.000018063698,0.00032386553,0.00025350048,0.05742585,0.0032942418,0.88024247,0.057997227,0.00003051904],"about_ca_topic_score_codex":0.0015524568,"about_ca_topic_score_gemma":0.001682845,"teacher_disagreement_score":0.005311265,"about_ca_system_score_codex":0.0016745764,"about_ca_system_score_gemma":0.002155258,"threshold_uncertainty_score":0.017767906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027128564,0.0008065311,0.9656497,0.00014613391,0.00009037227,0.00008482502,0.000043063792,0.0004515981,0.005599165],"genre_scores_gemma":[0.8755012,0.00037366574,0.12159378,0.000101309546,0.00004535642,0.00011492571,0.00009012324,0.00008445474,0.0020951405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988405,0.0004263249,0.0000396598,0.00013086556,0.00022192218,0.00034071205],"domain_scores_gemma":[0.9992384,0.0003516555,0.00008569185,0.00012151285,0.00013225363,0.00007058197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551941,0.0008590946,0.0010053287,0.00036698134,0.00090084097,0.0016664673,0.0013933716,0.00077861303,0.0029344258],"category_scores_gemma":[0.0021367213,0.00030250958,0.0005592449,0.00076206366,0.0006524502,0.0011081378,0.0013880923,0.0009719515,0.0005078035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004790672,0.00011491841,0.00040756963,0.00013204117,0.00004908571,0.00016961455,0.00009017607,0.8658366,0.015235815,0.037051857,0.0030673698,0.07736583],"study_design_scores_gemma":[0.000009596457,0.000056518027,0.00007880302,0.000006175009,0.0000064442065,0.000040559255,0.0000152217635,0.991651,0.002086652,0.004743074,0.0012961668,0.000009828546],"about_ca_topic_score_codex":0.0029880705,"about_ca_topic_score_gemma":0.0032488974,"teacher_disagreement_score":0.0029880705,"about_ca_system_score_codex":0.000884469,"about_ca_system_score_gemma":0.0015995839,"threshold_uncertainty_score":0.009816647},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04943571,0.0008629016,0.94577956,0.0001925594,0.00022477956,0.00013340896,0.00007215573,0.000655212,0.0026437193],"genre_scores_gemma":[0.7437688,0.0004459653,0.25288492,0.00013400186,0.00011605791,0.00016042514,0.00019512932,0.00004201736,0.0022526914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954,0.00009648814,0.00004422506,0.00008117463,0.00014920594,0.000089032495],"domain_scores_gemma":[0.999395,0.00016023389,0.0000796114,0.000055830744,0.00025104015,0.000058259502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430899,0.00047952888,0.00061690155,0.00088736345,0.00070770475,0.0009067476,0.001246467,0.0004150514,0.00073098944],"category_scores_gemma":[0.0011023885,0.00021340029,0.00037124509,0.0007680634,0.00032126467,0.0006794546,0.00039377259,0.00045642338,0.00020119149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010130793,0.00045347313,0.0029146678,0.0003858698,0.00018681165,0.00029268628,0.00038107682,0.41249755,0.06554427,0.029499387,0.0076794527,0.4791516],"study_design_scores_gemma":[0.00008564771,0.00025536344,0.00044982604,0.000012660283,0.00003096425,0.00013029262,0.00004888383,0.9854177,0.0069706645,0.0036936195,0.002880907,0.000023372439],"about_ca_topic_score_codex":0.007612646,"about_ca_topic_score_gemma":0.0058546686,"teacher_disagreement_score":0.007612646,"about_ca_system_score_codex":0.0010928289,"about_ca_system_score_gemma":0.0018396596,"threshold_uncertainty_score":0.015136659},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03251946,0.00070299796,0.9574054,0.000959534,0.00016397706,0.00047507335,0.000074915035,0.0007830877,0.0069155204],"genre_scores_gemma":[0.89558226,0.00048288272,0.09982538,0.0002465524,0.000067548266,0.00021113938,0.00008276164,0.000035782803,0.003465664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819213,0.000542912,0.00016738854,0.0002550867,0.000558889,0.0002835241],"domain_scores_gemma":[0.9975291,0.00064977555,0.0004930256,0.0005816623,0.00045733922,0.00028908034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017731839,0.000501352,0.0007018694,0.0009240175,0.0015379493,0.0015690603,0.0016726444,0.0016311177,0.0012350644],"category_scores_gemma":[0.004623776,0.00025514068,0.0008268566,0.0005511012,0.0015463282,0.004114868,0.0029624712,0.0014571804,0.00031229528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084529555,0.00057083956,0.007013637,0.00075353996,0.00044306478,0.0028953901,0.0027385396,0.17474833,0.052163035,0.40714705,0.013439311,0.33724192],"study_design_scores_gemma":[0.000095369185,0.0007015227,0.0011573612,0.000116010895,0.00014324284,0.0022253876,0.000620341,0.8563299,0.014945299,0.089106776,0.034390125,0.00016857155],"about_ca_topic_score_codex":0.0026899483,"about_ca_topic_score_gemma":0.0022391523,"teacher_disagreement_score":0.0026899483,"about_ca_system_score_codex":0.0013718774,"about_ca_system_score_gemma":0.0017300401,"threshold_uncertainty_score":0.009953678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041136038,0.0014577277,0.93837744,0.00042106115,0.0000950805,0.000046241763,0.000092190865,0.0001228414,0.018251395],"genre_scores_gemma":[0.96192575,0.0011987877,0.028446719,0.00008219652,0.000099386874,0.00009749495,0.000054961496,0.000019948495,0.008074754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.00013108141,0.00001540754,0.00008300596,0.000118494274,0.000057595218],"domain_scores_gemma":[0.999584,0.00025340277,0.00006342299,0.00003654002,0.000051035637,0.000011640619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003961543,0.0006210408,0.0007869671,0.00028437693,0.00033751866,0.0010533745,0.0007160372,0.0008388319,0.0019307258],"category_scores_gemma":[0.00097497413,0.00032816725,0.00038440092,0.00081433874,0.0008376648,0.0010097851,0.00083103037,0.0004447116,0.0004844472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017003885,0.000060351747,0.00045813312,0.00016418062,0.00005448999,0.0006106875,0.00010534257,0.87452596,0.013765966,0.07123213,0.0023108914,0.036541723],"study_design_scores_gemma":[0.000012878158,0.00004916898,0.0001558949,0.000008243962,0.000013732607,0.00014356495,0.00002193046,0.98282146,0.0015143026,0.014280994,0.0009668697,0.000010999283],"about_ca_topic_score_codex":0.00065179885,"about_ca_topic_score_gemma":0.000552197,"teacher_disagreement_score":0.0019307258,"about_ca_system_score_codex":0.0006214026,"about_ca_system_score_gemma":0.0004027368,"threshold_uncertainty_score":0.0064588785},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029686041,0.00018082447,0.96787184,0.00009392876,0.000040577415,0.000024798255,0.00002727483,0.0001703697,0.0019043837],"genre_scores_gemma":[0.57593536,0.00031588506,0.41809914,0.00012592522,0.000070828944,0.00010198202,0.00010843574,0.000028162285,0.0052142264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968207,0.00009484333,0.000015906788,0.00003458909,0.00013409357,0.00003858486],"domain_scores_gemma":[0.9997008,0.00011704694,0.000046268222,0.000050236857,0.000069492606,0.00001625356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032240147,0.0005118196,0.00043699727,0.00022765942,0.00022840344,0.0005642228,0.00042328052,0.00045744627,0.000932856],"category_scores_gemma":[0.0007426915,0.00019452338,0.0002926348,0.0004692115,0.00038353668,0.0005189963,0.00066745444,0.0004688165,0.00028321348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037669795,0.00008714485,0.000631405,0.00013590814,0.00009256338,0.00017386182,0.00014876692,0.62027836,0.06502972,0.035109285,0.0017310086,0.27620524],"study_design_scores_gemma":[0.000013374465,0.00010815062,0.00014928372,0.0000047278177,0.000006028953,0.0000501383,0.000011477444,0.987433,0.0083142575,0.0027463504,0.0011517367,0.000011413045],"about_ca_topic_score_codex":0.000985534,"about_ca_topic_score_gemma":0.0014816188,"teacher_disagreement_score":0.000985534,"about_ca_system_score_codex":0.00021221655,"about_ca_system_score_gemma":0.0004566575,"threshold_uncertainty_score":0.0031206608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08240251,0.00078423455,0.9059581,0.00032547605,0.00007843718,0.00005799795,0.000049678772,0.00020380456,0.0101397],"genre_scores_gemma":[0.93524414,0.0003264789,0.061252177,0.000086222906,0.000027025208,0.000048237915,0.000038881317,0.000032940294,0.0029438708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972075,0.0000787881,0.000010293831,0.00006297965,0.00005456254,0.00007260765],"domain_scores_gemma":[0.9997898,0.000119898345,0.000026716045,0.000020619274,0.000024956797,0.000018123603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039471578,0.0006205107,0.0005408969,0.00031984758,0.00046213839,0.00073332264,0.0006153507,0.00062157406,0.0009898428],"category_scores_gemma":[0.0007952126,0.00025728275,0.00030871163,0.0005754407,0.00045159704,0.000759958,0.00076859834,0.000528071,0.00011245703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088421875,0.00004807455,0.00038697477,0.000052393672,0.00002222717,0.00009496385,0.00003994973,0.9413988,0.0062965266,0.0076518967,0.00085651013,0.0430633],"study_design_scores_gemma":[0.0000037748555,0.00001709866,0.00010938756,0.0000026417026,0.0000034877828,0.000015947207,0.000012851489,0.99632734,0.0007105265,0.0023436008,0.00045059828,0.000002851101],"about_ca_topic_score_codex":0.004405173,"about_ca_topic_score_gemma":0.0049889996,"teacher_disagreement_score":0.004405173,"about_ca_system_score_codex":0.0007881044,"about_ca_system_score_gemma":0.0006709472,"threshold_uncertainty_score":0.008759081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038637068,0.00045372176,0.9541096,0.0001905668,0.00005041228,0.00006821731,0.000077795536,0.00084271317,0.005569877],"genre_scores_gemma":[0.89379156,0.0006126811,0.09760774,0.00012139747,0.00003671297,0.00012727323,0.00010998792,0.00008879682,0.007503719],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996922,0.000055751934,0.000010073169,0.000060938615,0.000150988,0.00003004733],"domain_scores_gemma":[0.999762,0.00008947051,0.000049325085,0.000040365147,0.000050685514,0.000008181149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023493054,0.00063852774,0.00025114033,0.00019985218,0.00024164117,0.00048125547,0.00056701107,0.00062779145,0.0016630612],"category_scores_gemma":[0.00044164155,0.00029827535,0.00048463978,0.00025632637,0.00036107216,0.0006031475,0.00035010048,0.0007450954,0.00077957957],"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.00017039383,0.00012987429,0.0012341453,0.00039243072,0.00008985103,0.00047167623,0.0003321649,0.37303716,0.5342724,0.013062547,0.0017354332,0.07507205],"study_design_scores_gemma":[0.00001213704,0.00026178345,0.000590868,0.00002491131,0.000029176368,0.00035474467,0.00004129178,0.8375526,0.15358257,0.0013871972,0.006134939,0.000027663731],"about_ca_topic_score_codex":0.00076699414,"about_ca_topic_score_gemma":0.0011759654,"teacher_disagreement_score":0.0016630612,"about_ca_system_score_codex":0.0005829486,"about_ca_system_score_gemma":0.00039512914,"threshold_uncertainty_score":0.0055634975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21808974,0.0012196709,0.7746046,0.00022670478,0.00006173642,0.000086321124,0.00014861098,0.00062761427,0.004935034],"genre_scores_gemma":[0.88649595,0.00030330312,0.11054518,0.00005141802,0.00001655599,0.000046052504,0.0001409052,0.000045685403,0.0023548442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977463,0.000041388055,0.000013522324,0.000032943415,0.00008556043,0.000052008083],"domain_scores_gemma":[0.99937975,0.00033869583,0.000056750472,0.00005804798,0.0001374413,0.000029296198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033757885,0.0004661568,0.00052613294,0.0006378596,0.00028844472,0.00060547295,0.0007766244,0.0005046824,0.0011253876],"category_scores_gemma":[0.0016862842,0.00014695582,0.00022271748,0.0009474981,0.0003202717,0.00078796403,0.00049051194,0.00042844936,0.00015424508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038944307,0.000104536804,0.001524732,0.00009906894,0.000021048765,0.0001613521,0.000083174884,0.8127389,0.014449626,0.01196672,0.0019525681,0.15650883],"study_design_scores_gemma":[0.0000081600665,0.000041166244,0.00012683675,0.0000039971346,0.0000036705526,0.00003143094,0.000015887992,0.9952667,0.0025577163,0.0016494301,0.00029153365,0.000003447044],"about_ca_topic_score_codex":0.003138314,"about_ca_topic_score_gemma":0.0029730857,"teacher_disagreement_score":0.003138314,"about_ca_system_score_codex":0.0009015111,"about_ca_system_score_gemma":0.0008107681,"threshold_uncertainty_score":0.0065408945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46651468,0.0012699454,0.52086836,0.0003833091,0.00008825792,0.00009443343,0.00008015822,0.00022466718,0.010476219],"genre_scores_gemma":[0.9913059,0.00014882523,0.007912108,0.000017804787,0.000017158807,0.000016099772,0.000013699477,0.0000093314575,0.00055912894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831057,0.000667739,0.0000413825,0.00011568174,0.00051022874,0.00035445634],"domain_scores_gemma":[0.994787,0.0037065207,0.0004360068,0.00023514389,0.0006833481,0.00015202706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031239204,0.0009413864,0.0010037046,0.0006819278,0.0006949304,0.0013986677,0.000818855,0.00070364884,0.0010468285],"category_scores_gemma":[0.00845514,0.0002534926,0.00042024278,0.00071456644,0.0012009339,0.0007619696,0.0009363832,0.00052066194,0.00010713103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014267063,0.000047249447,0.0008687645,0.00005081255,0.000029262346,0.00012455638,0.000056217443,0.9819742,0.0022809587,0.008425214,0.00020456339,0.0057955533],"study_design_scores_gemma":[0.00000539262,0.00003724664,0.0001892282,0.0000025650452,0.000008787681,0.000021730602,0.000015585862,0.9984322,0.00047150493,0.00076372357,0.000047318423,0.0000046954815],"about_ca_topic_score_codex":0.010094174,"about_ca_topic_score_gemma":0.00624057,"teacher_disagreement_score":0.010094174,"about_ca_system_score_codex":0.00224082,"about_ca_system_score_gemma":0.0022267161,"threshold_uncertainty_score":0.02007085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097492225,0.0006142786,0.89663965,0.00023328542,0.000051624687,0.00004809133,0.000028193892,0.00014984615,0.004742775],"genre_scores_gemma":[0.94426036,0.00023678284,0.053880695,0.000048166774,0.000024779853,0.000031473133,0.000019435913,0.000008743658,0.0014895118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932694,0.00024486205,0.000038747163,0.00009747531,0.0001901202,0.00010184188],"domain_scores_gemma":[0.99918205,0.00038355737,0.00015744091,0.00011527359,0.00014020054,0.000021503158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078653934,0.0006848726,0.00045239128,0.00031382582,0.0005549928,0.0011634605,0.00062661653,0.0007500513,0.00078200403],"category_scores_gemma":[0.0019646978,0.00016136722,0.00032069153,0.00026964053,0.00058499636,0.0011922994,0.0008784851,0.000474604,0.00018846201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009240204,0.00010589996,0.0024633058,0.00029304976,0.00016243423,0.00057489,0.0003907567,0.6267967,0.079782866,0.098989375,0.0014056277,0.18811105],"study_design_scores_gemma":[0.000016925347,0.00017463825,0.0002798117,0.000014698155,0.00003221315,0.00024823679,0.000033390104,0.98173255,0.011299995,0.0049892585,0.0011600422,0.000018322844],"about_ca_topic_score_codex":0.0006752107,"about_ca_topic_score_gemma":0.0008623974,"teacher_disagreement_score":0.0011634605,"about_ca_system_score_codex":0.0005075328,"about_ca_system_score_gemma":0.00074144517,"threshold_uncertainty_score":0.004159689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049077943,0.00030497654,0.99202794,0.0000730852,0.000020009633,0.00002799189,0.000016141734,0.000041444793,0.0025806664],"genre_scores_gemma":[0.63069665,0.002065155,0.3583967,0.00015908146,0.00009411485,0.00044401985,0.000106268424,0.000053963104,0.007983974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946874,0.00020391491,0.000024889228,0.00008474576,0.00017027544,0.000047446352],"domain_scores_gemma":[0.9995234,0.0002443288,0.00007509057,0.000027146947,0.00011709997,0.000012904414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009444808,0.00083947385,0.00059958873,0.0003491028,0.00026133106,0.001065464,0.0006793494,0.0008909039,0.0017712176],"category_scores_gemma":[0.0015622989,0.00044301638,0.00039666842,0.00040634003,0.0004971291,0.00089686667,0.00061112794,0.0006412596,0.0005482913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006123664,0.000047790123,0.00029407637,0.00025243367,0.000053375446,0.0001426181,0.00019182361,0.8594377,0.02026288,0.05663576,0.0016084262,0.061011914],"study_design_scores_gemma":[0.000017198974,0.00009122915,0.000092527865,0.000017108918,0.000015420575,0.00008005177,0.000036698006,0.9857248,0.0021855026,0.009943629,0.0017816634,0.000014189446],"about_ca_topic_score_codex":0.0005536814,"about_ca_topic_score_gemma":0.00071111275,"teacher_disagreement_score":0.0017712176,"about_ca_system_score_codex":0.00062135106,"about_ca_system_score_gemma":0.0007041167,"threshold_uncertainty_score":0.0059252977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0413246,0.00024042487,0.95662147,0.00007012286,0.000022918985,0.000010158365,0.00001085278,0.00013573903,0.0015636906],"genre_scores_gemma":[0.89920104,0.00028689348,0.09828462,0.000043061176,0.000036753438,0.000026832673,0.000028144117,0.00002370456,0.0020687885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979895,0.00006661772,0.00000609014,0.00003815198,0.000063183776,0.000027078404],"domain_scores_gemma":[0.99969864,0.00014954475,0.00005463558,0.00003346639,0.000054593133,0.0000091975535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024509756,0.00041522097,0.00038746966,0.00022392563,0.00020903393,0.00050257257,0.00042503307,0.0004336805,0.00052328117],"category_scores_gemma":[0.00067128136,0.00017403465,0.00023123465,0.00033180742,0.00042434968,0.00059650274,0.00040389042,0.00040882593,0.00017148307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016725251,0.0000441793,0.0008401671,0.0001350473,0.000044411303,0.00015394995,0.00011782979,0.7937282,0.06281722,0.01222735,0.00069804647,0.12902641],"study_design_scores_gemma":[0.0000033910771,0.00004178934,0.0001483471,0.0000027524286,0.000004800124,0.000028099146,0.0000117489535,0.99182945,0.0065538473,0.0008787393,0.000488816,0.0000082859015],"about_ca_topic_score_codex":0.0009318143,"about_ca_topic_score_gemma":0.0008909871,"teacher_disagreement_score":0.0009318143,"about_ca_system_score_codex":0.00022978589,"about_ca_system_score_gemma":0.00031880153,"threshold_uncertainty_score":0.0018527508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039660063,0.0004529074,0.9558448,0.00019590488,0.00006117592,0.00005113253,0.0000185689,0.00006858687,0.0036467873],"genre_scores_gemma":[0.9044235,0.00045155318,0.09102626,0.00017521904,0.0000941496,0.00007072944,0.000033536922,0.000040060193,0.003684997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994266,0.00022850692,0.000021755854,0.00007654366,0.00012282631,0.0001237317],"domain_scores_gemma":[0.9993031,0.0003939942,0.000107511994,0.000036761914,0.00010157562,0.000056989084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016112654,0.00075470086,0.00076075253,0.00044651772,0.00033553786,0.0010357113,0.0007180223,0.0008724145,0.001893624],"category_scores_gemma":[0.002019502,0.0003794558,0.00049934175,0.00060287875,0.0006998889,0.00079530274,0.0010858787,0.0006578699,0.00022937063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010287939,0.000089781795,0.00024557,0.000050716608,0.000046402696,0.000060598722,0.000042000975,0.95619285,0.0054543847,0.014830728,0.00054088584,0.022343209],"study_design_scores_gemma":[0.000005449379,0.000033811466,0.000049268165,0.0000018065546,0.0000051286197,0.00000885092,0.0000063499274,0.99749845,0.00047255578,0.0017685371,0.00014688881,0.0000028370507],"about_ca_topic_score_codex":0.0020711874,"about_ca_topic_score_gemma":0.0011377952,"teacher_disagreement_score":0.0020711874,"about_ca_system_score_codex":0.0010145182,"about_ca_system_score_gemma":0.0012398869,"threshold_uncertainty_score":0.008521259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7161668,0.0013488417,0.27052128,0.00036278125,0.00003498532,0.000055450215,0.00011844076,0.00025919217,0.011132238],"genre_scores_gemma":[0.9970578,0.00020224151,0.0024110025,0.000012978232,0.0000067303986,0.000007924858,0.000013793745,0.0000072332555,0.0002802313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782467,0.0008727541,0.000075003634,0.00017770375,0.0006860449,0.000363694],"domain_scores_gemma":[0.992362,0.0051565873,0.0010363067,0.0005453375,0.00080556085,0.00009407301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018200107,0.0010099174,0.0008841652,0.0005153094,0.00061750604,0.0012737687,0.00055667886,0.0007104662,0.00085603487],"category_scores_gemma":[0.006434678,0.00031118878,0.0005189619,0.0008155206,0.001285065,0.0011841502,0.00080013316,0.0005920604,0.00019307836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019678759,0.000027765356,0.0037897127,0.0000656792,0.000076140765,0.0005682712,0.00009176415,0.96359897,0.013702229,0.010844039,0.00018547018,0.006853183],"study_design_scores_gemma":[0.000006914249,0.00013696044,0.001595179,0.000015305606,0.00005204146,0.00034006345,0.000068308385,0.98896664,0.007296366,0.0013381283,0.0001625543,0.000021651738],"about_ca_topic_score_codex":0.002568602,"about_ca_topic_score_gemma":0.0021189032,"teacher_disagreement_score":0.002568602,"about_ca_system_score_codex":0.0014027635,"about_ca_system_score_gemma":0.001237513,"threshold_uncertainty_score":0.010177851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012889936,0.0008368417,0.97973883,0.00010197506,0.000052611544,0.00004519941,0.000020510835,0.00007032895,0.006243824],"genre_scores_gemma":[0.70208937,0.0018547543,0.28716296,0.00018983363,0.00015755242,0.00017815696,0.000081324484,0.000038937353,0.008247143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996132,0.00013080676,0.00001482319,0.000059994316,0.00013564495,0.000045607285],"domain_scores_gemma":[0.99967015,0.00015025899,0.000043226817,0.000029439418,0.00009196454,0.000014932993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006473094,0.001009862,0.00045628304,0.0003445834,0.00023120666,0.0007738773,0.0005870459,0.0005918401,0.0023737382],"category_scores_gemma":[0.00075119396,0.00032521872,0.00045582574,0.0004476012,0.00047137268,0.001050522,0.00049782713,0.00046228772,0.00054136233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026096412,0.00009973218,0.0010132326,0.00029357427,0.00015426535,0.00019411682,0.00015036679,0.61031735,0.057174254,0.1018198,0.00221014,0.22631219],"study_design_scores_gemma":[0.000018635641,0.00023275953,0.00024933452,0.00001943404,0.000031371517,0.0001146913,0.00003780848,0.98249084,0.0057765055,0.007721011,0.0032893626,0.000018335126],"about_ca_topic_score_codex":0.0005903637,"about_ca_topic_score_gemma":0.00091941527,"teacher_disagreement_score":0.0023737382,"about_ca_system_score_codex":0.0005321225,"about_ca_system_score_gemma":0.00030002254,"threshold_uncertainty_score":0.007940888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01815661,0.00017600729,0.9807529,0.00009496004,0.000021154954,0.000011188094,0.00002683477,0.00011956442,0.0006407368],"genre_scores_gemma":[0.8452932,0.00032165245,0.15181525,0.00009456204,0.000052932155,0.000058529524,0.00011272353,0.000027823016,0.0022233305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995946,0.0001348815,0.000016216687,0.00005890418,0.00015686404,0.00003852758],"domain_scores_gemma":[0.99903023,0.0005813625,0.000108526445,0.000086155946,0.00017450299,0.000019276606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005315355,0.0003891514,0.0005396457,0.00022341084,0.00023925828,0.0005875304,0.0003668801,0.00040501222,0.00085304567],"category_scores_gemma":[0.002607491,0.00019889124,0.0002158543,0.0002881072,0.00028904757,0.00063634344,0.0005978756,0.0005946023,0.000183942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015962377,0.0000409732,0.0013201907,0.00013686497,0.000053131636,0.000085087304,0.000059004273,0.8908626,0.013590871,0.01069342,0.0011698568,0.081828475],"study_design_scores_gemma":[0.000004544649,0.000017899356,0.00019496847,0.0000037488796,0.0000039133597,0.000020527938,0.0000067227465,0.99638015,0.0019285171,0.0012043414,0.00023018227,0.0000044621056],"about_ca_topic_score_codex":0.0017557825,"about_ca_topic_score_gemma":0.0021033399,"teacher_disagreement_score":0.0017557825,"about_ca_system_score_codex":0.0002933032,"about_ca_system_score_gemma":0.00065181404,"threshold_uncertainty_score":0.0034911036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018745905,0.00071098184,0.9766251,0.00035792784,0.0000875921,0.00003260134,0.000051450774,0.0005358268,0.0028525814],"genre_scores_gemma":[0.720741,0.00097135914,0.2680049,0.00055863726,0.00013208763,0.00007507917,0.0002258696,0.00012717981,0.009163996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995727,0.00015492641,0.000020556528,0.0000782717,0.00012099928,0.000052568834],"domain_scores_gemma":[0.9985757,0.000920345,0.00005420216,0.00017481577,0.00022459957,0.000050301875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012513102,0.0010049136,0.0007508762,0.0003152938,0.00025216676,0.00075920054,0.0008160391,0.0009615798,0.0015508233],"category_scores_gemma":[0.0045243795,0.00038842624,0.00038124886,0.0005260936,0.0010622011,0.0013610201,0.0011886967,0.0013458553,0.00048693744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003466982,0.00012837282,0.0010770987,0.0001484517,0.00011172717,0.00012002508,0.00010923429,0.71878356,0.013731407,0.058491673,0.003978884,0.20297286],"study_design_scores_gemma":[0.0000063441275,0.00003071706,0.00012388862,0.000006903345,0.0000062320805,0.000017637894,0.000005339281,0.98605573,0.005354206,0.0074755875,0.0009105462,0.000006888633],"about_ca_topic_score_codex":0.0021110433,"about_ca_topic_score_gemma":0.0023079617,"teacher_disagreement_score":0.0021110433,"about_ca_system_score_codex":0.0006961298,"about_ca_system_score_gemma":0.0006159105,"threshold_uncertainty_score":0.0066176653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034860766,0.000136763,0.9947142,0.00004661548,0.000057296536,0.000017915518,0.000017825125,0.0004714269,0.0010518816],"genre_scores_gemma":[0.14881141,0.00024917454,0.8427293,0.000110920744,0.00008870148,0.00016479596,0.00021076738,0.00015045122,0.007484502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935275,0.00011062046,0.000039639443,0.00015585664,0.00028994103,0.000051127823],"domain_scores_gemma":[0.9995235,0.000089455905,0.000050454262,0.000057321704,0.0002588754,0.000020353196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047331804,0.0007947277,0.0007988429,0.0009693695,0.0004229205,0.0006950649,0.0011576016,0.0007019168,0.0028422216],"category_scores_gemma":[0.0016745867,0.00041150762,0.00068210234,0.0012722567,0.00038535852,0.0011182124,0.0013686606,0.0009148991,0.001866878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001562516,0.000056674136,0.0009466616,0.00011576031,0.000066352295,0.00009381112,0.00015405465,0.2217648,0.036100075,0.0104605965,0.0036607455,0.7264242],"study_design_scores_gemma":[0.000029003204,0.00003947465,0.00036777178,0.000011061171,0.000017826042,0.00010011713,0.000019120156,0.98722744,0.0050755814,0.0021121018,0.004980925,0.000019526165],"about_ca_topic_score_codex":0.0036488113,"about_ca_topic_score_gemma":0.002826888,"teacher_disagreement_score":0.0036488113,"about_ca_system_score_codex":0.00034901995,"about_ca_system_score_gemma":0.0011902528,"threshold_uncertainty_score":0.009508193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014548615,0.0005058071,0.9816337,0.00015309558,0.00008607562,0.00003825612,0.000052032537,0.00019240157,0.0027899314],"genre_scores_gemma":[0.44515833,0.0010796238,0.5478247,0.0002492806,0.00013978948,0.00012961894,0.00019045356,0.0000599765,0.005168277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880815,0.00045758515,0.00006129563,0.00012057843,0.00044959542,0.00010279546],"domain_scores_gemma":[0.99789375,0.00077305146,0.00017721811,0.00029053751,0.000796661,0.000068745765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011255157,0.0007640109,0.0005850063,0.0009713989,0.00039435938,0.00081746647,0.00072733406,0.00079491286,0.0016371983],"category_scores_gemma":[0.004137487,0.00028626615,0.00033739576,0.00081849104,0.0007428886,0.0011542592,0.0011884696,0.0012857665,0.00074019906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013294172,0.000107570246,0.0011243352,0.00041221836,0.00008344583,0.00043456876,0.0003910472,0.30699328,0.07637765,0.201198,0.0029797005,0.40856877],"study_design_scores_gemma":[0.00007171403,0.00014443177,0.00019545159,0.00004899874,0.00002640759,0.00023696083,0.000029710563,0.94051355,0.0321108,0.021659877,0.0049230126,0.000038963324],"about_ca_topic_score_codex":0.0011219848,"about_ca_topic_score_gemma":0.00080870296,"teacher_disagreement_score":0.0016371983,"about_ca_system_score_codex":0.00046762038,"about_ca_system_score_gemma":0.00093866675,"threshold_uncertainty_score":0.0059523582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31696835,0.0008680546,0.6647097,0.0002578908,0.00002459428,0.00004250982,0.00007588152,0.00015355836,0.016899375],"genre_scores_gemma":[0.99313354,0.00017287696,0.0058321585,0.00002445938,0.000008083835,0.000022759697,0.000013394021,0.000010806521,0.00078199466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992036,0.00026256003,0.000020309846,0.00008162068,0.0002587306,0.00017314267],"domain_scores_gemma":[0.99697757,0.00225372,0.00022334057,0.00011844165,0.00038200992,0.000045009856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015480482,0.00069274736,0.0005370565,0.00066976494,0.0004241388,0.0011145396,0.000670685,0.00064979296,0.0011164512],"category_scores_gemma":[0.00498515,0.00021845732,0.0003859177,0.0007401617,0.0011733924,0.0007966916,0.00067421654,0.0003595652,0.0001746444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000784712,0.00002879582,0.00063863694,0.00004800295,0.000033226956,0.00015895293,0.00005425727,0.971849,0.0048234113,0.016657853,0.00015455988,0.0054748855],"study_design_scores_gemma":[0.00000316928,0.000028241102,0.0002204437,0.000005236723,0.000009746795,0.000039328686,0.00002874101,0.99541986,0.0013346871,0.0028138058,0.0000916415,0.0000050883427],"about_ca_topic_score_codex":0.0028124712,"about_ca_topic_score_gemma":0.0016862722,"teacher_disagreement_score":0.0028124712,"about_ca_system_score_codex":0.0013778756,"about_ca_system_score_gemma":0.00066747825,"threshold_uncertainty_score":0.009997249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109967045,0.0010929132,0.87820786,0.0003115862,0.00005539758,0.000037929956,0.000114817885,0.00020369227,0.010008727],"genre_scores_gemma":[0.9821769,0.0007121721,0.015506739,0.000041466556,0.00003965447,0.00004692368,0.00005592342,0.000024118284,0.0013961575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986399,0.00060234295,0.0000435222,0.00009976716,0.00041980876,0.00019466755],"domain_scores_gemma":[0.9952121,0.0035548036,0.0004274862,0.00023269978,0.0005103497,0.00006257298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020649317,0.0009674841,0.0008543004,0.0008450087,0.0004355465,0.0009800157,0.000670825,0.00063864706,0.0010295421],"category_scores_gemma":[0.0056046154,0.00036513392,0.0005537856,0.00083295646,0.0012042159,0.001222868,0.0009363199,0.0005777858,0.00029900027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059449972,0.000010704124,0.0003614501,0.000050634913,0.000026389775,0.000113113565,0.000031525862,0.971836,0.0042569055,0.019673657,0.00022971268,0.0033505417],"study_design_scores_gemma":[0.000002753316,0.000031805146,0.00017558366,0.0000070482197,0.000008904951,0.000042640997,0.00001671941,0.994013,0.001926878,0.0036060514,0.00016172625,0.0000069273824],"about_ca_topic_score_codex":0.0011815003,"about_ca_topic_score_gemma":0.00058306585,"teacher_disagreement_score":0.0020649317,"about_ca_system_score_codex":0.0011111123,"about_ca_system_score_gemma":0.0005835835,"threshold_uncertainty_score":0.010920525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027832616,0.00042626774,0.9668965,0.0002034561,0.000041383526,0.000025220232,0.00005201321,0.00009242833,0.0044302517],"genre_scores_gemma":[0.9183959,0.00065941736,0.0762568,0.00011066837,0.000059407703,0.000097453296,0.000068374786,0.00004401093,0.0043079704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993395,0.0002965152,0.000024821706,0.000100110774,0.00013439811,0.000104683124],"domain_scores_gemma":[0.9991874,0.00056374754,0.00009399169,0.000042217078,0.000082657505,0.000029973527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008419942,0.0009958992,0.00097296055,0.0002632569,0.00027063186,0.0010270796,0.00064123917,0.0006964596,0.0012134353],"category_scores_gemma":[0.0015880467,0.0005268817,0.00040891126,0.00097586267,0.00060478545,0.0009272551,0.00090522476,0.00068028236,0.0003215331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001845409,0.000090545116,0.0006189336,0.00019999236,0.00009688954,0.00025191152,0.000081847524,0.88851947,0.016675754,0.026216667,0.001384701,0.06567874],"study_design_scores_gemma":[0.000009591411,0.00005375573,0.0000961025,0.000005323893,0.000011240188,0.0000303903,0.000023822087,0.9918,0.001823685,0.0057949023,0.00034489064,0.0000063038633],"about_ca_topic_score_codex":0.0011712265,"about_ca_topic_score_gemma":0.0012500868,"teacher_disagreement_score":0.0012134353,"about_ca_system_score_codex":0.00042235164,"about_ca_system_score_gemma":0.00057930936,"threshold_uncertainty_score":0.004452944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028825175,0.00026699028,0.9655263,0.00023390983,0.000064572836,0.000055698612,0.000048223683,0.00015807219,0.004821164],"genre_scores_gemma":[0.93106604,0.0002068319,0.06668293,0.00009296533,0.000054073545,0.00007935398,0.000050171606,0.000029366858,0.001738295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929893,0.00024210317,0.000019545187,0.00015012872,0.00017122967,0.00011805526],"domain_scores_gemma":[0.99911374,0.0004907036,0.00009329456,0.00008486534,0.00012572715,0.00009163285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009916878,0.000749229,0.00095709646,0.0007859291,0.00078874564,0.0014009738,0.001318634,0.0010277296,0.0009982773],"category_scores_gemma":[0.0016609306,0.00034322162,0.0008989795,0.00072437106,0.0009575708,0.00083954225,0.002120519,0.00061023363,0.00015116383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010394642,0.000068438625,0.00090878713,0.00008066818,0.000055019103,0.00030836515,0.00020315731,0.93597716,0.0063233785,0.01994131,0.0010439528,0.03498588],"study_design_scores_gemma":[0.0000035219778,0.000015627438,0.00007795462,0.0000029854912,0.000005447522,0.000019262594,0.0000428906,0.99522614,0.00043664692,0.0038277935,0.00033537822,0.0000064331143],"about_ca_topic_score_codex":0.0060490756,"about_ca_topic_score_gemma":0.004088332,"teacher_disagreement_score":0.0060490756,"about_ca_system_score_codex":0.00096908375,"about_ca_system_score_gemma":0.00090828544,"threshold_uncertainty_score":0.0120277405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71141595,0.0012071563,0.27271926,0.00043053573,0.000041601717,0.000043352236,0.0002131413,0.00045666675,0.013472237],"genre_scores_gemma":[0.9950831,0.00016009093,0.003976475,0.000017192597,0.000009082883,0.000010257037,0.00004625125,0.000013843785,0.0006836268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891174,0.00039008431,0.00002421958,0.00008155133,0.00043858483,0.00015393413],"domain_scores_gemma":[0.99444276,0.0042109396,0.0003200013,0.00021078426,0.0007650564,0.000050456874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012687716,0.0006006563,0.00044651856,0.00080313097,0.000388218,0.00067284703,0.00030762047,0.00059711025,0.0012321431],"category_scores_gemma":[0.0070166443,0.00014619314,0.00022177663,0.00062030257,0.00059689744,0.0006319321,0.0004668536,0.0004601449,0.00018657962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016276457,0.000023751236,0.0015672088,0.000059369057,0.00003578813,0.00013904582,0.000071980234,0.9701255,0.008602903,0.008819271,0.00023943283,0.010153092],"study_design_scores_gemma":[0.000003125421,0.000032352247,0.00050203037,0.000006667495,0.000005893124,0.00004005758,0.000009217733,0.9952943,0.0032371043,0.00076809066,0.00009501484,0.000006192384],"about_ca_topic_score_codex":0.0053905747,"about_ca_topic_score_gemma":0.0025042358,"teacher_disagreement_score":0.0053905747,"about_ca_system_score_codex":0.0014696262,"about_ca_system_score_gemma":0.0007008547,"threshold_uncertainty_score":0.010718405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29346848,0.0012156769,0.69037527,0.00039070586,0.000112069414,0.00007109449,0.00008687558,0.00026131177,0.014018404],"genre_scores_gemma":[0.9846773,0.000120289464,0.013631662,0.00003662927,0.000026558013,0.000023203336,0.000013731876,0.00000484804,0.0014657228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996505,0.00013427016,0.000010917798,0.000060341008,0.00006626493,0.000077685894],"domain_scores_gemma":[0.9997471,0.000101803016,0.000044986205,0.000020844911,0.00006127729,0.000024012856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027375613,0.00046612302,0.0004533378,0.00022482991,0.00039315314,0.0005934377,0.0004324917,0.00026850947,0.0011017412],"category_scores_gemma":[0.00057491113,0.00015643964,0.00017622717,0.00036000885,0.00039477693,0.0003587657,0.00045191072,0.00032301064,0.00020387591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045107698,0.000107863925,0.001809102,0.00013177228,0.00009610345,0.00060131174,0.00020355775,0.87207717,0.036162008,0.016577534,0.0026833534,0.06909919],"study_design_scores_gemma":[0.000011336826,0.00005812861,0.00023387573,0.0000029356472,0.000011571158,0.00006488737,0.00003585879,0.9961204,0.0020895193,0.0008356837,0.0005283039,0.000007515005],"about_ca_topic_score_codex":0.00299128,"about_ca_topic_score_gemma":0.003289785,"teacher_disagreement_score":0.00299128,"about_ca_system_score_codex":0.0003949572,"about_ca_system_score_gemma":0.00053069467,"threshold_uncertainty_score":0.0059477687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13240814,0.0075971214,0.44778678,0.0651857,0.11681762,0.0028010677,0.012115415,0.13075787,0.084530294],"genre_scores_gemma":[0.33496648,0.004499486,0.25997803,0.008676683,0.010114227,0.0009250775,0.03462966,0.01657256,0.32963777],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99441373,0.0012188418,0.0006597104,0.0006793364,0.0026630838,0.0003652977],"domain_scores_gemma":[0.96892893,0.0055607054,0.0010612839,0.0046130363,0.017951196,0.0018848958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009236752,0.0013109634,0.00121558,0.0027932553,0.0014240599,0.0044092904,0.003851787,0.0024451201,0.041087594],"category_scores_gemma":[0.049847867,0.00069092953,0.0011258346,0.0012437116,0.0009330773,0.0054803765,0.0034776689,0.003181142,0.039951578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005183061,0.00023260644,0.008932368,0.00071419973,0.00014857014,0.004660439,0.0016431443,0.002518402,0.014161932,0.0045226114,0.53984386,0.4221035],"study_design_scores_gemma":[0.00013395809,0.0007497872,0.007775351,0.00047227865,0.00017585553,0.00517792,0.0010167605,0.078682356,0.0507731,0.0043360707,0.8504874,0.00021908502],"about_ca_topic_score_codex":0.0023964916,"about_ca_topic_score_gemma":0.0023086031,"teacher_disagreement_score":0.041087594,"about_ca_system_score_codex":0.00094157696,"about_ca_system_score_gemma":0.003500071,"threshold_uncertainty_score":0.13745171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06821138,0.00028921678,0.9270269,0.00029102294,0.000052444837,0.000071575116,0.000028177079,0.00022896045,0.0038003563],"genre_scores_gemma":[0.8408693,0.00019423713,0.15564904,0.00011918096,0.000034603418,0.00013674215,0.00006823724,0.000021506148,0.0029071954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997168,0.00007273863,0.00002008626,0.00005456097,0.00009529479,0.00004035886],"domain_scores_gemma":[0.999546,0.00014186616,0.000049835482,0.000026981394,0.00021474762,0.000020565118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007651191,0.00047092314,0.00040536447,0.0011738619,0.00035998106,0.00066745473,0.00086445664,0.0007050876,0.0006912358],"category_scores_gemma":[0.0015545024,0.00025058948,0.00039903543,0.0007160549,0.00038861495,0.0005443798,0.00039263626,0.0004826576,0.000114775445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002637641,0.00006163769,0.001857281,0.000019999154,0.00003981952,0.000055069555,0.000035379722,0.89376324,0.0024330183,0.0044883043,0.00043435147,0.09678546],"study_design_scores_gemma":[9.1934675e-7,0.0000066878642,0.00010693064,0.0000011969088,0.000002215107,0.000004337937,0.000003201469,0.99922454,0.00019071776,0.00035525233,0.00010278517,0.0000011600725],"about_ca_topic_score_codex":0.0070687705,"about_ca_topic_score_gemma":0.004898904,"teacher_disagreement_score":0.0070687705,"about_ca_system_score_codex":0.00085253175,"about_ca_system_score_gemma":0.00074451056,"threshold_uncertainty_score":0.014055252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065775536,0.00035277152,0.9308712,0.0002237663,0.000073130424,0.00004821242,0.00002038073,0.00022507248,0.002409919],"genre_scores_gemma":[0.9698173,0.0001567976,0.02852696,0.000054800887,0.00004097224,0.000039523424,0.000019852865,0.000011658604,0.0013322376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985252,0.00040033742,0.00006048458,0.0002703136,0.00060777337,0.00013587167],"domain_scores_gemma":[0.9981686,0.0007443371,0.0002767953,0.00041243795,0.0003312926,0.00006659008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079289376,0.00051614287,0.0006403985,0.0005863368,0.0007576744,0.00057865627,0.0009182041,0.00078835187,0.0011041631],"category_scores_gemma":[0.002385352,0.00019952623,0.00039992732,0.00047295654,0.0007964757,0.0016303057,0.001127442,0.00071115687,0.00016351724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010491475,0.00019878926,0.002216464,0.00038153832,0.00020356095,0.001199294,0.0005291844,0.5614604,0.13841483,0.10145676,0.0026098976,0.19028011],"study_design_scores_gemma":[0.0000375917,0.00018893996,0.0003029147,0.000012807155,0.000025887157,0.00031495804,0.00002652654,0.9757701,0.01305458,0.008959485,0.001284061,0.000022054954],"about_ca_topic_score_codex":0.0005920818,"about_ca_topic_score_gemma":0.00044321953,"teacher_disagreement_score":0.0011041631,"about_ca_system_score_codex":0.0007800719,"about_ca_system_score_gemma":0.00047597705,"threshold_uncertainty_score":0.0056598783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03139273,0.00030159327,0.96046597,0.00021731631,0.000053824762,0.000051917013,0.000075348216,0.00014771061,0.007293604],"genre_scores_gemma":[0.85404193,0.00025810447,0.14286886,0.00011494099,0.0000526681,0.0001376498,0.0000613683,0.00001958036,0.0024449907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812657,0.0010328412,0.00007864956,0.00013392222,0.0004589958,0.00016899996],"domain_scores_gemma":[0.9978776,0.0012084068,0.0002838419,0.00022468649,0.00032636334,0.000079115256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013494734,0.00048387353,0.0006001096,0.00050772534,0.0006269756,0.0010333079,0.0007910965,0.0008318598,0.002327355],"category_scores_gemma":[0.003939997,0.00029109602,0.0003774648,0.0006351846,0.00077803305,0.000797721,0.0010232744,0.00066922576,0.0005617844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003906972,0.000089182664,0.0006584323,0.0002204515,0.00005714542,0.000339381,0.0002607924,0.7383484,0.01779537,0.17688414,0.0014391582,0.06351693],"study_design_scores_gemma":[0.000028439834,0.00008526196,0.0001318547,0.000029694129,0.0000115751345,0.00009061499,0.000027252736,0.9745882,0.0031805213,0.02047497,0.0013294229,0.000022134227],"about_ca_topic_score_codex":0.00067629584,"about_ca_topic_score_gemma":0.0010660859,"teacher_disagreement_score":0.002327355,"about_ca_system_score_codex":0.0009583315,"about_ca_system_score_gemma":0.0010740085,"threshold_uncertainty_score":0.007785797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3511082,0.00092070934,0.61859804,0.00048495698,0.00021752749,0.000098749624,0.00027941607,0.0011742666,0.027118145],"genre_scores_gemma":[0.8439098,0.00056683976,0.14733875,0.00016445352,0.000042375963,0.000102952625,0.0003694154,0.00006891062,0.0074365153],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999907,0.00001406355,0.0000058115975,0.000020374484,0.00003347665,0.000019204857],"domain_scores_gemma":[0.9998828,0.000012210571,0.000041998686,0.000016065163,0.000035291305,0.00001167167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009485898,0.00031239982,0.0002922431,0.00021013098,0.0000764988,0.0003903072,0.00044800565,0.0004422655,0.0014098067],"category_scores_gemma":[0.00013767117,0.00016865002,0.000340254,0.0003478588,0.000120668046,0.00021688663,0.0002208724,0.0001630979,0.0011413379],"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.00018628004,0.000060569375,0.002721238,0.00025993053,0.00009577195,0.00044308198,0.00011891058,0.015019958,0.89548624,0.0069871345,0.0032116072,0.0754093],"study_design_scores_gemma":[0.00013521333,0.0012636372,0.010298993,0.00007743403,0.00013597512,0.0028047117,0.00024939366,0.35749912,0.5788419,0.0017449055,0.046854645,0.00009392798],"about_ca_topic_score_codex":0.00021651351,"about_ca_topic_score_gemma":0.00019414705,"teacher_disagreement_score":0.0014098067,"about_ca_system_score_codex":0.0002410877,"about_ca_system_score_gemma":0.00021919636,"threshold_uncertainty_score":0.0047162175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038791366,0.002036837,0.93414366,0.0011748847,0.0008861444,0.0005143697,0.00031039622,0.0015744352,0.020567903],"genre_scores_gemma":[0.53413224,0.0015500124,0.4388306,0.0005472174,0.0005750561,0.00033441986,0.0005186061,0.000102282174,0.02340955],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970715,0.00047497166,0.00023859923,0.00041656318,0.001600306,0.00019805695],"domain_scores_gemma":[0.99838674,0.0002379158,0.0002481918,0.00038503367,0.0005934181,0.00014879463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008507242,0.0005011886,0.000801661,0.0019342335,0.00071290584,0.0016739953,0.0012800558,0.0016256665,0.0031650958],"category_scores_gemma":[0.0022739323,0.0002114599,0.0005083786,0.0019034196,0.0011400519,0.0030375146,0.0014078096,0.0013315819,0.0011750315],"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.0011916509,0.00023116873,0.0012482887,0.000646533,0.00010419442,0.0012833574,0.0003252893,0.027372353,0.19033438,0.33537173,0.0143726,0.42751855],"study_design_scores_gemma":[0.0005079128,0.0008359034,0.0014484302,0.00015822054,0.000107431704,0.0072292658,0.000099826146,0.50617814,0.22887869,0.056625657,0.19756,0.00037051234],"about_ca_topic_score_codex":0.0008316605,"about_ca_topic_score_gemma":0.00059932185,"teacher_disagreement_score":0.0031650958,"about_ca_system_score_codex":0.0011623944,"about_ca_system_score_gemma":0.0015831686,"threshold_uncertainty_score":0.010588288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96128374,0.00031521168,0.035788324,0.0000625042,0.000037356655,0.000028870452,0.00003849201,0.00012893093,0.0023166835],"genre_scores_gemma":[0.99498355,0.00009923414,0.0044639693,0.000007948878,0.000004527316,0.0000086599575,0.000024030765,0.0000040208265,0.0004039394],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995666,0.00011773166,0.000020025196,0.000036616653,0.00021182506,0.000047183225],"domain_scores_gemma":[0.9991115,0.0004325925,0.00012150356,0.000042415802,0.00026462544,0.000027410393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004788853,0.0003608354,0.00030766623,0.00037579666,0.00017193773,0.00037631023,0.00022671607,0.0003386992,0.00062965055],"category_scores_gemma":[0.001703375,0.000074263386,0.00017413391,0.00032579128,0.00023862472,0.00037573182,0.00024272526,0.00017028839,0.00009133212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025570854,0.00050007174,0.018106664,0.00053707586,0.00020927192,0.0016215334,0.0002191999,0.38080567,0.39925098,0.0027782454,0.0007493701,0.19266473],"study_design_scores_gemma":[0.000027329179,0.001976648,0.011290326,0.000016998521,0.00008238607,0.00041905066,0.000107369226,0.82831436,0.15687513,0.00027730648,0.0005882095,0.000024973937],"about_ca_topic_score_codex":0.0014958924,"about_ca_topic_score_gemma":0.0010663744,"teacher_disagreement_score":0.0014958924,"about_ca_system_score_codex":0.00024730974,"about_ca_system_score_gemma":0.00019992005,"threshold_uncertainty_score":0.002974391},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2270396,0.0010648447,0.7416746,0.0007634992,0.00027043355,0.00035898414,0.0007644614,0.02167985,0.006383842],"genre_scores_gemma":[0.94257474,0.00009473527,0.054158308,0.00012101327,0.000033665438,0.000073379786,0.0003617602,0.000050264407,0.0025321315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958724,0.0000723214,0.000040982417,0.000065700406,0.00017283493,0.000061022874],"domain_scores_gemma":[0.9991999,0.00018235388,0.000109799876,0.00024330193,0.00019294825,0.00007161719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063961284,0.0003273102,0.00031821427,0.0007804682,0.00050238677,0.00088474376,0.0011560341,0.0003804628,0.0019951027],"category_scores_gemma":[0.0015162259,0.00013910397,0.00017117332,0.0006629754,0.00034067268,0.0009000272,0.0007611789,0.00038715987,0.00029960836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003531702,0.00075649185,0.02136775,0.00041766852,0.00014258605,0.00066091784,0.00039654257,0.1244863,0.14993271,0.04124405,0.031031962,0.62603134],"study_design_scores_gemma":[0.00014886101,0.00030623906,0.0018543686,0.0000151957165,0.000021307042,0.00026669577,0.000059365993,0.90909326,0.066984855,0.006975848,0.014237468,0.000036445814],"about_ca_topic_score_codex":0.0027207187,"about_ca_topic_score_gemma":0.0026069728,"teacher_disagreement_score":0.0027207187,"about_ca_system_score_codex":0.0012645501,"about_ca_system_score_gemma":0.0009813275,"threshold_uncertainty_score":0.009175062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74608326,0.0011998072,0.24001327,0.00020045816,0.000021062973,0.00004006549,0.00008302483,0.0001186473,0.012240409],"genre_scores_gemma":[0.99463516,0.00013462904,0.0041918126,0.00001247206,0.000007845323,0.000011580977,0.000015635565,0.0000041952994,0.0009866519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946576,0.00020960018,0.00001543915,0.00006289451,0.00016704315,0.00007920974],"domain_scores_gemma":[0.9985668,0.00083808135,0.00019173822,0.00010758524,0.00025119333,0.000044662323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010577142,0.0005756283,0.0005743976,0.00054256443,0.00045428498,0.0009031013,0.0007085007,0.00060869695,0.0012637211],"category_scores_gemma":[0.001944073,0.00020018271,0.0002916669,0.00041046727,0.0005878788,0.0006814367,0.0006932664,0.00034855324,0.00018937077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029468516,0.000055289547,0.002582559,0.000073324605,0.00007574444,0.0005840111,0.00017306622,0.9213156,0.022618113,0.039528973,0.00036579935,0.012332931],"study_design_scores_gemma":[0.0000052101004,0.00005721731,0.0003125379,0.0000032828177,0.000011086307,0.000088166205,0.000021051519,0.9964318,0.0016632546,0.0012486622,0.00015030622,0.000007459139],"about_ca_topic_score_codex":0.002887252,"about_ca_topic_score_gemma":0.0017778694,"teacher_disagreement_score":0.002887252,"about_ca_system_score_codex":0.00092960417,"about_ca_system_score_gemma":0.00064743066,"threshold_uncertainty_score":0.006744802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09830366,0.00066115125,0.89423794,0.0004329275,0.00015105055,0.00015592882,0.00009792474,0.00039896922,0.0055603944],"genre_scores_gemma":[0.8635657,0.000545759,0.13261357,0.00010346709,0.00006601156,0.00015591674,0.00008696541,0.00004202049,0.002820716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870276,0.0003485565,0.000051408704,0.00015035858,0.00059292425,0.00015397502],"domain_scores_gemma":[0.9977276,0.00095533096,0.00031877137,0.00064333243,0.00028139228,0.000073605835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000990681,0.00042852163,0.0005008887,0.00057314715,0.00065664685,0.0007099292,0.000800349,0.00077091844,0.0009909581],"category_scores_gemma":[0.0023593365,0.0002724542,0.00038657975,0.00061848346,0.0015998945,0.0014380716,0.0011545048,0.0010325345,0.00043970539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008535291,0.00014904632,0.0014381898,0.00045237088,0.000094782896,0.00075375015,0.0003966507,0.16769868,0.2396493,0.4843887,0.0018824831,0.10224249],"study_design_scores_gemma":[0.00013933115,0.00044838103,0.00065594376,0.00006103651,0.000078479614,0.001150405,0.000049222417,0.7394773,0.19734956,0.050833467,0.009624442,0.000132466],"about_ca_topic_score_codex":0.0004646234,"about_ca_topic_score_gemma":0.0005128938,"teacher_disagreement_score":0.0009909581,"about_ca_system_score_codex":0.00057439954,"about_ca_system_score_gemma":0.0011627825,"threshold_uncertainty_score":0.0052392483},"labels":[],"label_agreement":null}]}