{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":268,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":268,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"1e5cffde0467","filters":{"venue":"IET Communications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06948129246839965,"gpt":0.2722086962207822,"spread":0.2027274037523825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000192279,0.00009123247,0.0001194643,0.00006403637,0.0002306682,0.00006077957,0.001718326,0.00003210614,0.000001399625],"category_scores_gemma":[0.0000394044,0.00006345763,0.00007515511,0.0001227923,0.0001374632,0.0002301567,0.0002672336,0.000076204,0.000003724332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005110511,"about_ca_system_score_gemma":0.00008468254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002266196,"about_ca_topic_score_gemma":0.0004565329,"domain_scores_codex":[0.9993471,0.00006074981,0.0001739419,0.0001690864,0.00008525381,0.0001638491],"domain_scores_gemma":[0.9975311,0.0004001111,0.0001137925,0.001780214,0.0001166758,0.00005807706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002869094,0.001372438,0.0214678,0.00008457974,0.0006127229,0.00000186079,0.00545329,0.00008614323,0.4387345,0.2849837,0.003085344,0.2438307],"study_design_scores_gemma":[0.03955361,0.01125548,0.06959782,0.003015975,0.0008717395,0.0002544998,0.005284424,0.3717996,0.06217989,0.02613505,0.4035899,0.006462074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3098266,0.0003944882,0.6723698,0.01420119,0.0001970414,0.0005492301,0.0000643932,0.0002357614,0.002161553],"genre_scores_gemma":[0.9657905,0.00005715492,0.03342245,0.0001857083,0.000009999366,0.00006427598,0.000006871689,0.000009169857,0.000453881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.655964,"threshold_uncertainty_score":0.3193106,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1486871354575034,"gpt":0.3923372197399414,"spread":0.243650084282438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007386443,0.0001898746,0.0002375805,0.0001147231,0.0007813476,0.0008474965,0.00829133,0.00006722549,0.0002048986],"category_scores_gemma":[0.0004072525,0.0001673987,0.00005771714,0.000831474,0.0001938886,0.001035631,0.001761518,0.0004428637,0.0007497725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006972966,"about_ca_system_score_gemma":0.0001692221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001425103,"about_ca_topic_score_gemma":0.0007155244,"domain_scores_codex":[0.997323,0.001480363,0.0003851026,0.0003008916,0.0002383797,0.000272295],"domain_scores_gemma":[0.9921856,0.001498027,0.0001552574,0.005157943,0.0008565913,0.000146608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00003810432,0.002296687,0.02663624,0.00001834458,0.0002734402,0.000001861107,0.003752941,0.001041916,0.002425155,0.4804944,0.3200944,0.1629264],"study_design_scores_gemma":[0.002258899,0.0003312753,0.6243046,0.0001971922,0.000009648656,0.000003740953,0.00004524184,0.2298065,0.0009243694,0.002316521,0.1389409,0.0008610202],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00300775,0.001311222,0.6623442,0.1739724,0.0005554352,0.05137886,0.0001141487,0.00181009,0.1055059],"genre_scores_gemma":[0.9756729,0.0003365139,0.004367554,0.003966095,0.00002904674,0.0150059,0.00005594178,0.00001605518,0.0005500178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9726651,"threshold_uncertainty_score":0.9970743,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01654708626391778,"gpt":0.2658394706734405,"spread":0.2492923844095227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006952955,0.0001673467,0.0004588241,0.0006336974,0.0001228411,0.00001496964,0.002040514,0.0001025344,0.00002098166],"category_scores_gemma":[0.0001391304,0.0001819193,0.0001472276,0.001657818,0.0002064888,0.0002829093,0.0005609731,0.000348388,0.000006505816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009712687,"about_ca_system_score_gemma":0.00002643532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003853013,"about_ca_topic_score_gemma":0.001021549,"domain_scores_codex":[0.9983854,0.0002916094,0.0008267442,0.0001303846,0.000161302,0.0002046138],"domain_scores_gemma":[0.9942393,0.0006566957,0.0002635953,0.004533606,0.0002475301,0.00005923333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005715272,0.001097203,0.1567804,0.0005533603,0.001341545,3.78053e-7,0.01161528,0.7801074,0.02817961,0.01302324,0.0002239234,0.00702047],"study_design_scores_gemma":[0.0003815669,0.00002987409,0.1232564,0.0002044684,0.0001715444,8.920156e-7,0.0004109978,0.8741553,0.0007010979,0.00000781954,0.0005248257,0.0001552091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9817643,0.002207348,0.006247243,0.0001261979,0.00005102181,0.0003120544,0.00008717453,0.0001342328,0.009070395],"genre_scores_gemma":[0.9892999,0.001712409,0.008720299,0.00001033485,0.00000422872,0.00007943983,0.0001244521,0.00002397901,0.00002496563],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09404784,"threshold_uncertainty_score":0.7418452,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01981885191089148,"gpt":0.2842534009045642,"spread":0.2644345489936727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001363231,0.0001723054,0.0002140175,0.0001507233,0.0002945036,0.00005536341,0.0008430681,0.00007042899,0.00001048677],"category_scores_gemma":[0.0001364528,0.0001791629,0.00003772994,0.0003687502,0.00009363054,0.0001943693,0.00005150251,0.000317124,0.00001105237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007169283,"about_ca_system_score_gemma":0.0000234402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006086614,"about_ca_topic_score_gemma":0.0000154218,"domain_scores_codex":[0.9992464,0.00007886183,0.0002581294,0.0001232841,0.0001153106,0.0001780025],"domain_scores_gemma":[0.9970902,0.0007427167,0.00005903211,0.001941158,0.00008863224,0.00007829033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001638962,0.001092931,0.002143525,0.0003169556,0.000129619,0.000003330862,0.002975924,0.7895736,0.01618098,0.02525331,0.005953354,0.1562126],"study_design_scores_gemma":[0.001733217,0.0001322451,0.003911184,0.0003588893,0.0000346425,0.000003710703,0.0001244736,0.9080335,0.01350531,0.005221121,0.06631198,0.0006296491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09324951,0.02760129,0.565233,0.02663149,0.0002313244,0.00439208,0.0002012797,0.0167503,0.2657097],"genre_scores_gemma":[0.9817631,0.001580712,0.0161177,0.0003904388,0.00001251918,0.00003558997,0.00004625464,0.00002996871,0.00002368567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8885136,"threshold_uncertainty_score":0.7306052,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05581903104355019,"gpt":0.2826035077074758,"spread":0.2267844766639256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699832,0.0001190923,0.0002240771,0.00007747247,0.0002303312,0.00004722138,0.004329876,0.00005539364,0.000005062393],"category_scores_gemma":[0.0002530653,0.0001046983,0.00007147041,0.0001524817,0.0003746046,0.0002393228,0.0003584457,0.0003701597,0.000008194269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003112833,"about_ca_system_score_gemma":0.00002373776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002751213,"about_ca_topic_score_gemma":0.0002840188,"domain_scores_codex":[0.9987248,0.000273435,0.0005680385,0.00009603677,0.0001690283,0.0001686578],"domain_scores_gemma":[0.9922393,0.0009635005,0.0002566627,0.006448502,0.00006190809,0.00003014353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000148868,0.0005321437,0.7107356,0.0003556231,0.0002448065,0.000002760524,0.01738196,0.1823751,0.006019144,0.004160498,0.0006318709,0.07741173],"study_design_scores_gemma":[0.0009572977,0.00005371097,0.2062587,0.0004715096,0.0000246871,0.00001444017,0.0009036849,0.7583462,0.002595667,0.00009709982,0.02998947,0.0002875308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9719328,0.009176355,0.0006803811,0.0004318861,0.0003261464,0.0006552789,0.00002278694,0.00007566244,0.01669871],"genre_scores_gemma":[0.9852354,0.01342587,0.001154675,0.000008722021,0.00002864719,0.00007206609,0.00003184828,0.00001957761,0.00002319798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5759711,"threshold_uncertainty_score":0.8046058,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01431357955474209,"gpt":0.280014954844481,"spread":0.2657013752897389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723479,0.0001691799,0.000374343,0.0001333869,0.0001256141,0.00004046025,0.003098882,0.0003004309,0.0000104593],"category_scores_gemma":[0.0003850605,0.0001768939,0.0001051239,0.0006718405,0.0004306871,0.0001997038,0.001267668,0.0006299486,0.000004167347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000870539,"about_ca_system_score_gemma":0.00008804189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006738683,"about_ca_topic_score_gemma":0.000358917,"domain_scores_codex":[0.9981514,0.0002481133,0.0006331147,0.000570546,0.0001376583,0.000259214],"domain_scores_gemma":[0.9934317,0.001530475,0.0002015028,0.004581871,0.0001897258,0.00006473516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001558362,0.0008727138,0.101943,0.0001788195,0.00001521307,9.536412e-8,0.00909819,0.00001349241,0.0001489926,0.8779217,0.00002180295,0.009770385],"study_design_scores_gemma":[0.0003686219,0.00009661045,0.01800528,0.00007790045,0.00000894295,0.000002718786,0.0001644753,0.1563251,0.0007249116,0.8227718,0.001254747,0.0001989583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6723905,0.0006404149,0.3118826,0.01295905,0.0000706935,0.001303617,0.00001746937,0.0001878279,0.0005478841],"genre_scores_gemma":[0.8175381,0.00009076177,0.181979,0.0001043797,0.000003202629,0.0002603265,0.000006589971,0.000007004626,0.00001063419],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1563116,"threshold_uncertainty_score":0.7213523,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01141957327038545,"gpt":0.2351951839425563,"spread":0.2237756106721709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799198,0.0001724689,0.0003973783,0.0006905895,0.0002658721,0.00003654216,0.0008486382,0.0001206945,0.000009498553],"category_scores_gemma":[0.00006620681,0.0001966673,0.00007730204,0.001783556,0.0001339814,0.0002796848,0.0003482437,0.0004455202,0.0000061094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000110618,"about_ca_system_score_gemma":0.0000188906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002054453,"about_ca_topic_score_gemma":0.0003693272,"domain_scores_codex":[0.9986101,0.0002850386,0.0006400373,0.000141137,0.0001136549,0.0002100249],"domain_scores_gemma":[0.9971751,0.0004313917,0.0001809372,0.001954864,0.0001913819,0.00006631562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008389911,0.0006852815,0.2254541,0.000383573,0.001824878,4.915231e-7,0.01589003,0.7157604,0.01107377,0.01545784,0.0002019147,0.01318383],"study_design_scores_gemma":[0.0004129838,0.00005711826,0.05996402,0.0001771027,0.0002188107,0.000004491622,0.0004371001,0.9378859,0.0002498346,0.0000195289,0.0003903579,0.000182753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9884316,0.001469844,0.004107209,0.000165443,0.00006816618,0.0002551438,0.00001737557,0.0002525465,0.005232728],"genre_scores_gemma":[0.9949958,0.001506367,0.003147536,0.00001725326,0.00000549547,0.00008658975,0.0001944571,0.00002873189,0.00001779587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2221255,"threshold_uncertainty_score":0.8019859,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02233912906934842,"gpt":0.2744111288277797,"spread":0.2520719997584313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003247529,0.0001021722,0.0001820918,0.0001861359,0.0009431312,0.00008903925,0.002156381,0.00009388554,0.00006450959],"category_scores_gemma":[0.00006032083,0.00009500715,0.00007366324,0.00255843,0.0002340066,0.0004988734,0.001853398,0.0006452617,0.000007277614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002854727,"about_ca_system_score_gemma":0.00008488253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005156199,"about_ca_topic_score_gemma":0.002310806,"domain_scores_codex":[0.9991128,0.0001365917,0.0002330506,0.0001877924,0.0001924807,0.0001373069],"domain_scores_gemma":[0.9968752,0.0002509538,0.0001530095,0.0020745,0.0005782481,0.00006813814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006807333,0.001232392,0.6859955,0.00002178656,0.002493221,0.000001748732,0.01037787,0.02236311,0.01808997,0.2418339,0.001685824,0.01583664],"study_design_scores_gemma":[0.0001918231,0.00005956182,0.3190626,0.00001302402,0.0001448289,0.000002076853,0.00002088572,0.6786621,0.0006099122,0.0000136772,0.00110288,0.0001166605],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7355172,0.00003524109,0.2604161,0.001227572,0.00005048412,0.0001379821,0.00001444577,0.00008321882,0.002517815],"genre_scores_gemma":[0.9789965,0.0003766922,0.02032317,0.0001121875,0.000007427832,0.00001885076,0.00007749769,0.000004606613,0.00008306476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6562989,"threshold_uncertainty_score":0.7253898,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04826678587598079,"gpt":0.2928984349157018,"spread":0.244631649039721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002657906,0.0001346449,0.0001495114,0.000133648,0.0003161231,0.0002142394,0.001912522,0.00005909275,0.0001547057],"category_scores_gemma":[0.00006969833,0.0001238312,0.0000279985,0.0009865223,0.0003187515,0.0006676718,0.000656841,0.0005295901,0.00007666081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000798758,"about_ca_system_score_gemma":0.00008921201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005378894,"about_ca_topic_score_gemma":0.0008591667,"domain_scores_codex":[0.9987571,0.0004047969,0.0002705048,0.0002387867,0.00009772343,0.0002311335],"domain_scores_gemma":[0.9978279,0.0005367098,0.0001062967,0.001134746,0.0003164294,0.00007792782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000286424,0.0009325499,0.04103643,0.00001006292,0.0001528541,0.000003904787,0.00943305,0.006148664,0.001000185,0.2062019,0.006103836,0.7289479],"study_design_scores_gemma":[0.0009015731,0.000148681,0.07058309,0.0003416088,0.000009759806,0.00004863232,0.0004581109,0.9247697,0.0001042561,0.0004705939,0.001760238,0.0004037333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01543501,0.00107782,0.955174,0.004711405,0.00005460608,0.0006461045,0.000001209875,0.0002372796,0.02266258],"genre_scores_gemma":[0.9662842,0.001270726,0.031559,0.0004055057,0.00001171972,0.0002586685,0.00001263598,0.00000870044,0.0001888681],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9508492,"threshold_uncertainty_score":0.5049691,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07969589066284656,"gpt":0.3190004978732516,"spread":0.239304607210405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001450295,0.0001387201,0.0001436846,0.0001425143,0.0002498858,0.0001327058,0.005526125,0.00008360673,0.000001291756],"category_scores_gemma":[0.0002649706,0.0001107351,0.00005895058,0.0008252178,0.0001172267,0.0004237911,0.0006118448,0.0005332868,0.00002089041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007457878,"about_ca_system_score_gemma":0.0001359205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004741772,"about_ca_topic_score_gemma":0.001456615,"domain_scores_codex":[0.9986708,0.0003786485,0.0002713264,0.0002129655,0.0002170784,0.0002491731],"domain_scores_gemma":[0.9954311,0.0007238078,0.00008680444,0.003527225,0.0001667191,0.00006429922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009432299,0.005358965,0.005577221,0.0001245462,0.0001886713,0.00005186966,0.3987718,0.001791033,0.004932924,0.3068675,0.09511362,0.1811275],"study_design_scores_gemma":[0.0009726564,0.0005485381,0.003197036,0.0001575214,0.00002538783,0.00006684312,0.004594817,0.8598064,0.00137111,0.06653262,0.06195005,0.0007770087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01887836,0.005167148,0.6873381,0.1828408,0.001020168,0.002976412,0.00004465829,0.003744845,0.09798956],"genre_scores_gemma":[0.9513708,0.0001988852,0.04729026,0.0007854696,0.00002049533,0.0002210693,0.00001406178,0.00001198086,0.00008694615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9324925,"threshold_uncertainty_score":0.9998544,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0310073026869169,"gpt":0.2804552340733856,"spread":0.2494479313864687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002411218,0.0001356903,0.000140121,0.00009190135,0.0005867473,0.0002708342,0.0009148347,0.0000676174,0.00001615026],"category_scores_gemma":[0.00007323983,0.0001401923,0.00009909611,0.0003551727,0.0001326693,0.0007337118,0.0002761171,0.0002221772,0.0000452273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006022491,"about_ca_system_score_gemma":0.00007235138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001538955,"about_ca_topic_score_gemma":0.0000243128,"domain_scores_codex":[0.9989095,0.0001118344,0.0002345792,0.0002954107,0.0001678063,0.000280917],"domain_scores_gemma":[0.9978277,0.0005861641,0.0001229788,0.0008963895,0.0004754812,0.00009129415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002695572,0.001379161,0.0007187741,0.00003058684,0.0003880843,0.000001195342,0.005869099,0.0008819997,0.0007251101,0.2469065,0.005617604,0.737455],"study_design_scores_gemma":[0.0007130939,0.0001320535,0.007416698,0.00004867567,0.00003692013,0.00005482762,0.0007286196,0.962231,0.00009919579,0.003570531,0.02456888,0.0003994389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003220787,0.0003396076,0.9837145,0.005359557,0.00008442737,0.0009676758,0.000007530706,0.000179057,0.00612687],"genre_scores_gemma":[0.6814498,0.0000266053,0.3176394,0.0001955573,0.00005708951,0.0003590758,0.00009994773,0.00001160934,0.0001609196],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9613491,"threshold_uncertainty_score":0.5716875,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05750960037065371,"gpt":0.3102521886297768,"spread":0.2527425882591231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079423,0.0001740132,0.000256132,0.0001717296,0.0007021942,0.00007315698,0.00438096,0.0001148691,6.213843e-7],"category_scores_gemma":[0.00001371412,0.0001985317,0.00006455593,0.0006689671,0.0002158584,0.0002988479,0.002387508,0.0003959083,0.000005108248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001485498,"about_ca_system_score_gemma":0.00004304924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003615823,"about_ca_topic_score_gemma":0.0003434489,"domain_scores_codex":[0.9980676,0.0003756848,0.0004924452,0.0004432854,0.0002373166,0.0003836481],"domain_scores_gemma":[0.9940476,0.0006060658,0.0001411097,0.00494379,0.0001328702,0.0001285007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004877137,0.0009893132,0.002281049,0.00007345832,0.00006188555,0.000003353218,0.002070219,0.6915131,0.00009326745,0.21269,0.0009901465,0.08918545],"study_design_scores_gemma":[0.0004525284,0.00002003269,0.001993061,0.00002386011,0.000004684657,0.00001693435,0.00002331377,0.9925688,0.00002708584,0.002047132,0.002640708,0.0001818974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04710485,0.003690545,0.9419978,0.003674343,0.00001979194,0.002061445,0.000009481546,0.0002301985,0.001211508],"genre_scores_gemma":[0.9645029,0.00466022,0.02869184,0.0001878103,0.00001297038,0.001706461,0.00006425264,0.00002236564,0.0001512112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.917398,"threshold_uncertainty_score":0.8140988,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01861549012417517,"gpt":0.2484235648953275,"spread":0.2298080747711524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006056512,0.0002571235,0.0004370817,0.00005973917,0.0002446831,0.00008253058,0.003679066,0.0002459545,0.00001686234],"category_scores_gemma":[0.0002727487,0.0002716797,0.0001006342,0.0006702048,0.0007126507,0.0002488597,0.000949566,0.0006306136,0.00006673703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074453,"about_ca_system_score_gemma":0.00002626057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008085247,"about_ca_topic_score_gemma":0.00002876084,"domain_scores_codex":[0.9982205,0.0003539384,0.0007197089,0.0001942763,0.0001880738,0.0003235017],"domain_scores_gemma":[0.9917804,0.001236468,0.0001784857,0.006468892,0.0002369103,0.00009885967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002093281,0.0006143125,0.0008829027,0.0003254738,0.0002998886,4.971516e-7,0.00113396,0.1678115,0.01133502,0.7888375,0.00316525,0.02557279],"study_design_scores_gemma":[0.0003416856,0.00004683308,0.001128178,0.00021633,0.00003288808,0.000004921396,0.0003233828,0.977801,0.002974306,0.001724133,0.0150492,0.0003572069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8780487,0.01912016,0.04202576,0.005926284,0.0007317889,0.001688699,0.00006626213,0.004978586,0.04741377],"genre_scores_gemma":[0.9742765,0.00413705,0.02109321,0.00004143562,0.00001668983,0.0002432339,0.00004656372,0.00006061914,0.00008469461],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8099895,"threshold_uncertainty_score":0.9999735,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01454143419379784,"gpt":0.238419054596575,"spread":0.2238776204027772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001185415,0.0001367443,0.0001798775,0.0001483181,0.0001528917,0.00001550037,0.0004776705,0.00008812702,0.00001056874],"category_scores_gemma":[0.00003133709,0.0001557644,0.00004924328,0.0004639771,0.00003530276,0.0003339282,0.00005485582,0.0002169649,0.00001781042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009480609,"about_ca_system_score_gemma":0.000009850229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001521858,"about_ca_topic_score_gemma":0.0000089783,"domain_scores_codex":[0.9992224,0.00003195827,0.0003655062,0.0001015439,0.00008590378,0.0001926692],"domain_scores_gemma":[0.9986304,0.00008378884,0.0001007685,0.001062746,0.00007467014,0.00004759376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004061,0.00001941621,0.001337062,0.00003829539,0.00003012876,1.972247e-7,0.001333493,0.9639367,0.02818232,0.0003164976,0.0001440279,0.004657746],"study_design_scores_gemma":[0.0002522589,0.0000402747,0.002733854,0.000177152,0.00002230209,0.000004399631,0.00005712889,0.9869478,0.008983348,0.00009042285,0.0004901318,0.0002009105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8310345,0.001384762,0.1486074,0.00008398967,0.0004339274,0.0005050988,0.00001157349,0.0008111725,0.01712757],"genre_scores_gemma":[0.9889466,0.0004543512,0.01039921,0.00001446637,0.00002029599,0.00001486207,0.00003248181,0.00002995778,0.00008776283],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1579121,"threshold_uncertainty_score":0.6351888,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.06384297838110176,"gpt":0.3226781338232272,"spread":0.2588351554421254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001394157,0.00009599962,0.0001200601,0.00004429758,0.0003044776,0.0000800032,0.0006270442,0.000080981,0.00000122283],"category_scores_gemma":[0.00008831199,0.0001110747,0.0000187764,0.0000523208,0.000087349,0.0002918223,0.0001388894,0.0001563689,0.000002509609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006730449,"about_ca_system_score_gemma":0.000008161554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006995122,"about_ca_topic_score_gemma":0.001665111,"domain_scores_codex":[0.9994754,0.00003307852,0.0002114999,0.000120438,0.000025569,0.0001339947],"domain_scores_gemma":[0.9981521,0.0001290497,0.00008125205,0.001546108,0.00006026011,0.00003123256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001623128,0.00008682191,0.004025368,0.0001276696,0.00004572929,3.135935e-7,0.002764601,0.9369357,0.0007517084,0.007484343,0.001411326,0.04635017],"study_design_scores_gemma":[0.0003558964,0.000008413923,0.00205881,0.0001142064,0.000006231606,0.000001303834,0.0002042791,0.9908392,0.00006308991,0.0001214692,0.006111736,0.0001153342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001460898,0.0009571724,0.993959,0.0006320653,0.00009582474,0.0004944522,0.00001392379,0.0001409549,0.002245701],"genre_scores_gemma":[0.9677224,0.0006122154,0.03117538,0.00001927689,0.00002551335,0.0002315805,0.00007486712,0.00002690808,0.0001118449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9662615,"threshold_uncertainty_score":0.4529493,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06440537866338394,"gpt":0.3256830473001573,"spread":0.2612776686367734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004847994,0.0001884954,0.0002858239,0.000367387,0.0001993742,0.00006981773,0.000397371,0.0001541256,0.000007236883],"category_scores_gemma":[0.00002536852,0.0002183226,0.00005542586,0.001595095,0.0001078963,0.0004968063,0.0001195199,0.0005105468,0.000007127604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001771362,"about_ca_system_score_gemma":0.00001022932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000593193,"about_ca_topic_score_gemma":0.001211415,"domain_scores_codex":[0.9988168,0.00007646547,0.0005239269,0.000196053,0.00008286779,0.0003038146],"domain_scores_gemma":[0.9984096,0.0003724338,0.000112353,0.0009221028,0.0001010289,0.00008246945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009130879,0.00002884419,0.1154798,0.000009946673,0.0001252813,4.576904e-7,0.0003326502,0.8648632,0.0001177045,0.00003253452,0.000009100184,0.01899134],"study_design_scores_gemma":[0.0003020519,0.000006222836,0.3463268,0.00003001544,0.00005578435,8.649904e-7,0.00003650388,0.6526613,0.0001179191,0.000005325102,0.0003120407,0.0001452804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4619852,0.0004674882,0.5369043,0.00006336856,0.00006433641,0.0001570069,0.000009736304,0.0001791101,0.0001695076],"genre_scores_gemma":[0.9763771,0.003232985,0.01982829,0.00002215879,0.00005890407,0.00003904449,0.0003456151,0.00004181098,0.00005407765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.517076,"threshold_uncertainty_score":0.8902937,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1029430400698168,"gpt":0.2725995525440849,"spread":0.1696565124742681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002703042,0.0001547922,0.0001571338,0.00008796246,0.0006704891,0.00003953591,0.002679289,0.0001104538,0.00002589795],"category_scores_gemma":[0.0002575761,0.0001084044,0.0001181465,0.0006490957,0.000500972,0.0002237119,0.0002858305,0.0005667024,0.00003448295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008597179,"about_ca_system_score_gemma":0.00003316803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000684389,"about_ca_topic_score_gemma":0.0003842766,"domain_scores_codex":[0.9988593,0.0002031448,0.0004137273,0.00008569888,0.0001390391,0.0002990908],"domain_scores_gemma":[0.9943711,0.0009477424,0.0001152447,0.004432202,0.00007596034,0.00005780355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001458947,0.001962721,0.05374623,0.0001188453,0.001036974,2.309424e-7,0.03604836,0.01283139,0.1964969,0.4493594,0.02351004,0.2248743],"study_design_scores_gemma":[0.001115697,0.00005862483,0.1600621,0.000343984,0.0005009501,0.0000788059,0.009365997,0.01676125,0.07051618,0.01389933,0.7261099,0.001187141],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3588318,0.06197577,0.03125357,0.1013782,0.001538305,0.003661572,0.0001779195,0.002789983,0.4383928],"genre_scores_gemma":[0.9948897,0.001953782,0.002610071,0.0001346824,0.00002321094,0.0002442994,0.00001982797,0.000035312,0.00008911954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7025999,"threshold_uncertainty_score":0.5156928,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05955099436901137,"gpt":0.32680505706811,"spread":0.2672540626990986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309068,0.0002202562,0.0003262141,0.0001573557,0.0007519104,0.0004330755,0.00523064,0.0001022578,0.000009655832],"category_scores_gemma":[0.0004374,0.0002259612,0.0001013431,0.0008305513,0.0001579814,0.0005848788,0.001333708,0.0004521457,0.000009119707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009659669,"about_ca_system_score_gemma":0.0001286805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008228964,"about_ca_topic_score_gemma":0.001677552,"domain_scores_codex":[0.9977126,0.0008583888,0.0005248226,0.0003695537,0.0001451863,0.0003894377],"domain_scores_gemma":[0.9937657,0.002272843,0.0001994416,0.003212182,0.0004321839,0.0001176985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001015383,0.000855191,0.003028275,0.00006057589,0.0001243069,0.000001791758,0.002894966,0.610359,0.001786656,0.09026439,0.005092098,0.2854313],"study_design_scores_gemma":[0.001520979,0.00006572646,0.001181026,0.00009795677,0.000009305263,0.000001778634,0.00001946542,0.919246,0.00006440878,0.0002293712,0.07732286,0.0002411254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004387709,0.00266241,0.9791964,0.01500199,0.0001850614,0.000748742,0.000005673082,0.000190683,0.001570294],"genre_scores_gemma":[0.9517272,0.001155821,0.04284038,0.003496092,0.00005465734,0.000596226,0.00005450292,0.00002296845,0.00005218864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9512884,"threshold_uncertainty_score":0.9719918,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04397928670828304,"gpt":0.2405653305535257,"spread":0.1965860438452427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001369722,0.0001194166,0.0001214214,0.00008107902,0.0001873949,0.00003143391,0.0001331871,0.00007614648,0.00001034782],"category_scores_gemma":[0.0000555804,0.0001118986,0.00004929057,0.0001046296,0.0001010302,0.00008153489,0.0000589735,0.0001192004,0.00001192704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007934396,"about_ca_system_score_gemma":0.00001663663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001392795,"about_ca_topic_score_gemma":0.00007266444,"domain_scores_codex":[0.9993757,0.00005187538,0.0002092369,0.00013032,0.00004499019,0.0001878667],"domain_scores_gemma":[0.9987147,0.0004610836,0.00005408066,0.0006283721,0.00007997856,0.00006180019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00014688,0.0004872975,0.001428606,0.0004333374,0.0005654218,0.000003101562,0.003435947,0.1041864,0.2230143,0.01039233,0.009381769,0.6465245],"study_design_scores_gemma":[0.0008412747,0.00002700701,0.003131887,0.0001308063,0.00004224536,0.000006383319,0.0001108235,0.9807518,0.009998258,0.001586609,0.003134029,0.0002389521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.054291,0.0004178642,0.9380433,0.001998953,0.0002241501,0.0004992817,0.00005108862,0.0003224625,0.004151919],"genre_scores_gemma":[0.971395,0.0002150931,0.02800936,0.00004459205,0.00008523803,0.00004044878,0.00004959486,0.00003787286,0.0001227607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9171041,"threshold_uncertainty_score":0.4563094,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04525479578256403,"gpt":0.2788353855208653,"spread":0.2335805897383013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005323196,0.000169618,0.000247443,0.00008375292,0.0003347809,0.0001560876,0.003016005,0.0001149143,0.00004955115],"category_scores_gemma":[0.00001820606,0.0001705826,0.0001385684,0.0003294726,0.0001255825,0.0001467263,0.000522745,0.0002618042,0.00006223132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004509078,"about_ca_system_score_gemma":0.0003025764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001872855,"about_ca_topic_score_gemma":0.000004393509,"domain_scores_codex":[0.9986392,0.000129166,0.0003396768,0.0003612017,0.0002044661,0.000326265],"domain_scores_gemma":[0.9948536,0.0005519172,0.000154026,0.004082304,0.0001779509,0.0001801963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003274671,0.0009999083,0.001205522,0.0001171646,0.00007082045,0.00000305701,0.0007788361,0.0003462048,0.000074194,0.9197515,0.02541141,0.05120862],"study_design_scores_gemma":[0.0005013807,0.00006261052,0.00007268671,0.0000154486,0.00001866606,0.00000702803,0.00005268032,0.9347479,0.000004475599,0.005009979,0.05929931,0.0002078408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002983526,0.0001381744,0.9349541,0.002312907,0.0001890324,0.0006786481,0.00006752839,0.0002153959,0.06114583],"genre_scores_gemma":[0.7794681,0.00002720743,0.218139,0.001024583,0.00003705108,0.0001687639,0.0002586158,0.00001532177,0.0008612931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9344017,"threshold_uncertainty_score":0.6956158,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02798032762434987,"gpt":0.2854081206070522,"spread":0.2574277929827023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001241705,0.0002785542,0.0003747434,0.0001682011,0.0007006443,0.0002385532,0.003907647,0.0001801336,0.00000785995],"category_scores_gemma":[0.0009606419,0.0002697609,0.0001691588,0.0005878673,0.00009561332,0.0003019393,0.0008726877,0.0007299076,0.00005518311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001117738,"about_ca_system_score_gemma":0.0001615213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004156119,"about_ca_topic_score_gemma":0.0008574191,"domain_scores_codex":[0.9978367,0.0006038416,0.0003708171,0.0004635132,0.0003617766,0.0003633698],"domain_scores_gemma":[0.9931322,0.001131228,0.0002517618,0.005065454,0.0002262743,0.0001930351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005126502,0.004631692,0.01631919,0.0003499009,0.0003523658,0.00001447159,0.01976418,0.002079235,0.03208668,0.614302,0.2191766,0.090411],"study_design_scores_gemma":[0.001619781,0.0001839769,0.003712068,0.0002699581,0.0000270876,0.000009855812,0.00005327088,0.953746,0.01393027,0.01505436,0.0107842,0.0006091193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003194521,0.0000803507,0.9731465,0.01664034,0.0002633231,0.000436788,0.000004670247,0.001529722,0.004703782],"genre_scores_gemma":[0.7608905,0.00003088595,0.2374774,0.001323614,0.00005570115,0.00005391557,0.00002309302,0.00001964813,0.000125218],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9516668,"threshold_uncertainty_score":0.9999754,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Maximum likelihood; Detector; Computer science; Statistics; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05475262002154921,"gpt":0.2990351510182253,"spread":0.244282530996676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006669072,0.0002579186,0.0002959835,0.0001520776,0.001302745,0.0008136908,0.004749648,0.00009607158,0.0000375011],"category_scores_gemma":[0.0001952864,0.0002472634,0.0001168887,0.0006423892,0.0001374081,0.0008826629,0.001535519,0.0003691551,0.0003221918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001220718,"about_ca_system_score_gemma":0.0001231754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001008714,"about_ca_topic_score_gemma":0.0001595104,"domain_scores_codex":[0.997806,0.000616672,0.0005607185,0.0003966327,0.0001645961,0.0004554514],"domain_scores_gemma":[0.9934444,0.001130591,0.0002330615,0.004141604,0.0008639183,0.0001864568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002332297,0.0005608595,0.0005282301,0.00006675207,0.0003761399,0.000001448106,0.006066929,0.002806415,0.05107711,0.7224523,0.01990984,0.1961306],"study_design_scores_gemma":[0.001078886,0.0001998163,0.0007735594,0.0001307317,0.00002713372,0.00001974431,0.0004984735,0.9178485,0.001082134,0.008730744,0.06889655,0.0007137257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01377339,0.003700608,0.9604586,0.01109967,0.0006002865,0.002324987,0.00002305654,0.0006323153,0.007387031],"genre_scores_gemma":[0.9575709,0.00169689,0.03808888,0.0006728315,0.00005954908,0.00154426,0.00005016614,0.00003082708,0.0002857198],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9437975,"threshold_uncertainty_score":0.999998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03840485169406325,"gpt":0.2573126627187509,"spread":0.2189078110246876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002195391,0.0001579216,0.000183068,0.00006936317,0.0003113796,0.000186993,0.0008544134,0.0001080717,0.00009413062],"category_scores_gemma":[0.00000329414,0.0001679353,0.00007950386,0.0002762894,0.0000795587,0.0003140419,0.0002255188,0.0002793353,0.0001376396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008559619,"about_ca_system_score_gemma":0.0000447212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008795616,"about_ca_topic_score_gemma":0.0002113557,"domain_scores_codex":[0.9988187,0.0002380867,0.0004165827,0.0001721516,0.0001310337,0.0002234524],"domain_scores_gemma":[0.9963151,0.00005494595,0.00005051527,0.003262845,0.0002013051,0.0001153077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005292407,0.0009182792,0.0005429738,0.0001121188,0.0005037746,0.000006853763,0.007404716,0.005592853,0.7000003,0.006271444,0.003969122,0.2746722],"study_design_scores_gemma":[0.000510762,0.00003416007,0.001109205,0.00003702908,0.00004201048,0.00004363811,0.001947023,0.687978,0.06416307,0.003393355,0.2402743,0.0004674005],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.010421,0.002653007,0.9656966,0.003622521,0.0002074985,0.0003954571,0.00006335813,0.001339794,0.01560073],"genre_scores_gemma":[0.9302272,0.000713531,0.06783681,0.0002222084,0.00006856218,0.0001045541,0.0004723404,0.00004876859,0.000305994],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9198062,"threshold_uncertainty_score":0.6848202,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02525988174818404,"gpt":0.2506733161598421,"spread":0.225413434411658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000366869,0.00009854654,0.0001258137,0.00004916182,0.0002378302,0.0001381824,0.001522508,0.00005781308,9.468254e-7],"category_scores_gemma":[0.0001066253,0.0001087993,0.00002656957,0.0005413597,0.00006188684,0.0002331587,0.001095994,0.0003000463,0.0000209361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005626848,"about_ca_system_score_gemma":0.00006376253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001033773,"about_ca_topic_score_gemma":0.00004817514,"domain_scores_codex":[0.9990501,0.000145355,0.0002445293,0.0002407066,0.0001112428,0.0002080007],"domain_scores_gemma":[0.9984481,0.0002033137,0.00008515933,0.001104598,0.00005914153,0.00009963852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003586838,0.0005381459,0.05421347,0.0001164711,0.0001209701,0.00001672975,0.09702678,0.01113072,0.00407926,0.1006468,0.2575469,0.4745279],"study_design_scores_gemma":[0.0002002693,0.00002372109,0.005451158,0.00003618069,0.000003770408,0.000004329164,0.00005038986,0.8018585,0.00002817444,0.0004000127,0.1918081,0.0001354661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03819076,0.006933649,0.8300351,0.09003727,0.001177669,0.0005946692,7.588631e-7,0.0007788381,0.03225131],"genre_scores_gemma":[0.9768473,0.0001519657,0.02090807,0.001756364,0.0002500603,0.00001359001,0.00001029647,0.000009523514,0.00005283452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9386566,"threshold_uncertainty_score":0.4436705,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03348406342322219,"gpt":0.2844413529154395,"spread":0.2509572894922174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006724555,0.0002162073,0.0002686305,0.00007782044,0.001328386,0.0002460529,0.001433393,0.00006924449,0.000008382897],"category_scores_gemma":[0.0002358621,0.0001920118,0.00005655595,0.0004367761,0.0005455819,0.000244886,0.0008678083,0.000248694,0.000006705191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004571006,"about_ca_system_score_gemma":0.00009165671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007965408,"about_ca_topic_score_gemma":0.0003054069,"domain_scores_codex":[0.9983307,0.0004912562,0.0003202097,0.0003785935,0.0001408162,0.0003384598],"domain_scores_gemma":[0.995258,0.002203085,0.0001676901,0.001720701,0.0005018759,0.0001486654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003871604,0.0001972746,0.0009072882,0.00001010621,0.0001446478,6.819398e-7,0.00372467,0.006102188,0.0001551051,0.8463002,0.001083929,0.1413352],"study_design_scores_gemma":[0.001673158,0.0001927388,0.001094518,0.0002114924,0.00004222694,0.00002007491,0.0003187844,0.9580772,0.000174455,0.0008454504,0.03693189,0.000418018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003169698,0.001327563,0.9861695,0.002660194,0.00007229421,0.0004906535,0.00001498336,0.0001644885,0.005930695],"genre_scores_gemma":[0.8698859,0.0007593666,0.1279675,0.0008757971,0.00003741088,0.0002952436,0.00004488795,0.00001957044,0.0001144005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.951975,"threshold_uncertainty_score":0.9999717,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Millimetre wave; Millimeter; Computer science; Extremely high frequency; Telecommunications; Astronomy; Physics; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.05770384722302277,"gpt":0.2872472422198286,"spread":0.2295433949968058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004228055,0.0001158096,0.0001260148,0.0001102191,0.0008326893,0.0001150735,0.001446443,0.00005008415,0.00003417002],"category_scores_gemma":[0.0002676542,0.00008924547,0.00009306856,0.0002605859,0.00006776313,0.0002880458,0.0005780815,0.0001729075,0.00009406067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004309367,"about_ca_system_score_gemma":0.00003299685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007599916,"about_ca_topic_score_gemma":0.0000416161,"domain_scores_codex":[0.9989696,0.0002092561,0.0002106606,0.0002363539,0.0001275421,0.0002466004],"domain_scores_gemma":[0.9971752,0.0008123645,0.0001145825,0.001702498,0.0001164381,0.00007896472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001225751,0.000227807,0.003157011,0.00001945952,0.00008347759,0.00000284199,0.00197664,0.000478643,0.006460652,0.1273388,0.004413984,0.8558284],"study_design_scores_gemma":[0.001236313,0.0002244612,0.006955483,0.0001746273,0.00003040704,0.00004235815,0.00005416958,0.4877765,0.0006429519,0.01451369,0.4878511,0.0004979633],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002259288,0.0008735301,0.948806,0.03391559,0.0001147835,0.000178253,0.00001159653,0.0004468928,0.01339404],"genre_scores_gemma":[0.8019311,0.0001432715,0.1936202,0.0002594713,0.0000400746,0.00005886165,0.00002939866,0.00001496239,0.003902667],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8553304,"threshold_uncertainty_score":0.6404457,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04725511285429897,"gpt":0.2938856096689246,"spread":0.2466304968146256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512811,0.0001418433,0.0003502604,0.0003251943,0.00006208835,0.00001060823,0.001172489,0.0001215702,0.00002721562],"category_scores_gemma":[0.00002006401,0.0001738052,0.00006992998,0.0008142866,0.0001899028,0.0002059853,0.0002354983,0.0003311066,0.00003079737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002780067,"about_ca_system_score_gemma":0.00004882348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000391961,"about_ca_topic_score_gemma":0.00009055238,"domain_scores_codex":[0.99853,0.000279941,0.0006941136,0.0001441515,0.0001900021,0.0001617743],"domain_scores_gemma":[0.996671,0.0001419573,0.0001871887,0.002755666,0.0001886469,0.00005551421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002399442,0.000196312,0.001131853,0.0003551338,0.00004585316,8.966843e-8,0.001948448,0.01027959,0.9597796,0.02476016,0.0003522445,0.001126775],"study_design_scores_gemma":[0.0016155,0.0002050774,0.02045196,0.003005147,0.00007120168,0.00007524975,0.008290389,0.04704056,0.9134789,0.002009533,0.002881535,0.000874916],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9826009,0.0002899379,0.003766889,0.0004952155,0.0001579115,0.001455424,0.00005667302,0.0003161901,0.01086088],"genre_scores_gemma":[0.9816098,0.0001007066,0.01784749,0.000003441803,0.00001100488,0.0002977457,0.00005822892,0.00003285183,0.00003871592],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04630062,"threshold_uncertainty_score":0.708757,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01996605115449409,"gpt":0.2488874500016962,"spread":0.2289213988472021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002599385,0.0001136056,0.0001558229,0.0001394822,0.0001255766,0.00005506942,0.0007931589,0.0001126563,0.00002059999],"category_scores_gemma":[0.0000226957,0.0001202198,0.00004092925,0.0003982272,0.00007257166,0.0002613458,0.0001795526,0.0004029919,0.0002656117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001241306,"about_ca_system_score_gemma":0.00002242936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005105937,"about_ca_topic_score_gemma":0.002147053,"domain_scores_codex":[0.9991696,0.0001397209,0.0002775454,0.0001144145,0.0001250016,0.0001736565],"domain_scores_gemma":[0.9976503,0.0001488989,0.0000373756,0.00206597,0.00005430573,0.00004315716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000100159,0.001667663,0.1331857,0.001243408,0.0005252967,0.000009676275,0.0388753,0.5444731,0.05331477,0.1061631,0.009007425,0.1114345],"study_design_scores_gemma":[0.001236677,0.00007932055,0.1571386,0.0005046785,0.00003468309,0.00005109969,0.002612901,0.7042425,0.003777151,0.002283798,0.1271727,0.0008658711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9038668,0.01659861,0.0009983828,0.000929479,0.001636346,0.0009713839,0.00002334861,0.0006730234,0.0743026],"genre_scores_gemma":[0.9953727,0.003780033,0.0005190768,0.00003376999,0.00002878877,0.0001072151,0.00004406059,0.00002045376,0.00009387796],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1597695,"threshold_uncertainty_score":0.4902423,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02653383437104243,"gpt":0.2614994100273818,"spread":0.2349655756563394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003199929,0.0002547101,0.000290362,0.0001796058,0.0005398999,0.00004885438,0.00247089,0.0001845341,0.00001300121],"category_scores_gemma":[0.0002740071,0.0002263166,0.0001243187,0.0003971577,0.0004850377,0.0002963083,0.0003480054,0.0003250737,0.00005944714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000314447,"about_ca_system_score_gemma":0.00003576544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008187621,"about_ca_topic_score_gemma":0.00007176292,"domain_scores_codex":[0.9986446,0.0001661545,0.0005111953,0.0002072075,0.0001118454,0.0003589253],"domain_scores_gemma":[0.9918692,0.002716989,0.0001679838,0.004804417,0.0003671891,0.00007428021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001063554,0.0003798117,0.0005373906,0.0003195457,0.0004892669,0.000001050486,0.0005255009,0.01870887,0.01097986,0.2267227,0.006570913,0.7346587],"study_design_scores_gemma":[0.00461048,0.0001445378,0.001351848,0.002591274,0.0001610477,0.00001947265,0.003020078,0.8659422,0.03609796,0.005213262,0.07922092,0.001626938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001897753,0.004581783,0.9772889,0.003283053,0.000123493,0.001118501,0.0002062505,0.003711525,0.00778875],"genre_scores_gemma":[0.9416066,0.002538254,0.05375823,0.00005919748,0.00002004232,0.001625627,0.0002340456,0.0000862286,0.00007172229],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9397089,"threshold_uncertainty_score":0.9228923,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02813802325236919,"gpt":0.228822275216804,"spread":0.2006842519644348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002121872,0.0001058256,0.0001335446,0.0001246946,0.00009518456,0.00004377465,0.0001677469,0.00005430704,0.000007743864],"category_scores_gemma":[0.00003429853,0.000115958,0.00001369103,0.0002070147,0.00002904087,0.0003347285,0.00006186606,0.0001271633,0.00004123509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000251398,"about_ca_system_score_gemma":0.000009972649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001482928,"about_ca_topic_score_gemma":0.00003298916,"domain_scores_codex":[0.9992635,0.000115089,0.0003234287,0.0001003221,0.00005269631,0.0001450272],"domain_scores_gemma":[0.9990581,0.0001710352,0.00005951331,0.0005933869,0.00006829297,0.0000497335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001073714,0.00002704256,0.00009521515,0.00008795407,0.00001237982,3.795055e-7,0.0009054965,0.9817463,0.01398966,0.0008073158,0.0001445726,0.002182678],"study_design_scores_gemma":[0.0003111139,0.00001045894,0.0002215951,0.0001486811,0.000007493977,0.000003148401,0.001126655,0.9966247,0.001240064,0.00005342143,0.0001321557,0.0001204966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003941377,0.0004632966,0.9929388,0.0001196319,0.00005160313,0.0009490135,0.000004182338,0.0002811167,0.001251024],"genre_scores_gemma":[0.8143981,0.0001028724,0.1849708,0.000007834424,0.000004669081,0.0004247803,0.00003258332,0.00002303102,0.00003534641],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8104568,"threshold_uncertainty_score":0.472863,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1186391054477795,"gpt":0.3594913029328476,"spread":0.2408521974850681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015263,0.0002601586,0.0003297293,0.0001521734,0.001882787,0.0003791559,0.004701349,0.0001196053,0.000009150795],"category_scores_gemma":[0.0001729548,0.0002589564,0.0001145079,0.0004752898,0.0003098842,0.0004331618,0.001940674,0.000445039,0.00003593878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001594694,"about_ca_system_score_gemma":0.0001081748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002505394,"about_ca_topic_score_gemma":0.0001891544,"domain_scores_codex":[0.9975282,0.0008806716,0.0006289404,0.0003993227,0.0002217447,0.0003411066],"domain_scores_gemma":[0.9910333,0.001236793,0.0003685922,0.006754163,0.0004405102,0.0001666236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002227372,0.0003286842,0.0002587806,0.0002449699,0.00003027851,8.192496e-8,0.001015584,0.0001661232,0.0005644191,0.9366358,0.002192133,0.05854085],"study_design_scores_gemma":[0.001647693,0.0001198619,0.001292233,0.0004803273,0.00001605207,0.00000490496,0.000109855,0.8403181,0.0004296344,0.00227268,0.1529197,0.0003888562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001693563,0.00008469041,0.9333931,0.00874212,0.00006846541,0.04692948,0.00001060583,0.0005862706,0.01001589],"genre_scores_gemma":[0.5904045,0.00005713859,0.2277304,0.0006417087,0.00003702142,0.1809423,0.0000766599,0.00003023153,0.00008011816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9343631,"threshold_uncertainty_score":0.9999863,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.142104682693373,"gpt":0.2699197652789648,"spread":0.1278150825855918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003123525,0.0001048329,0.0002305155,0.0001974739,0.000836797,0.00003236799,0.00144771,0.00003463621,0.00001182767],"category_scores_gemma":[0.0000110179,0.00008819441,0.00003788729,0.001164871,0.0002423894,0.0003825518,0.001169715,0.0001638647,0.000001304878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002713776,"about_ca_system_score_gemma":0.00005509258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007741576,"about_ca_topic_score_gemma":0.00006786338,"domain_scores_codex":[0.9990721,0.0002756077,0.000224727,0.0001810671,0.0001353887,0.0001110791],"domain_scores_gemma":[0.9976707,0.0001912701,0.0001506126,0.001582327,0.000322562,0.00008251385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001365887,0.0007775162,0.1037763,0.0000589538,0.002600423,0.000005206452,0.09728889,0.003080099,0.0006178234,0.6916661,0.0001431073,0.09984899],"study_design_scores_gemma":[0.0002207953,0.0001728766,0.05695086,0.00009080302,0.0002727589,0.000003922866,0.0005764291,0.9410468,0.00005026361,0.00002693755,0.0004211088,0.0001664561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08471415,0.002059669,0.8830991,0.0003881341,0.00003531605,0.000423523,0.00001601587,0.0001348838,0.02912924],"genre_scores_gemma":[0.9717011,0.00381809,0.02433192,0.00003397532,0.000001585979,0.00001828037,0.0000128034,0.000004150414,0.00007806437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9379667,"threshold_uncertainty_score":0.6436051,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02479238218581995,"gpt":0.2865946680952486,"spread":0.2618022859094287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007060582,0.0001485211,0.0001987514,0.0001001626,0.0008495411,0.0002114536,0.001019226,0.00006820593,0.000005248712],"category_scores_gemma":[0.0004107443,0.0001420593,0.0001090327,0.0004727056,0.0001262946,0.0002517686,0.0004278942,0.0002182022,0.00002222974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008468013,"about_ca_system_score_gemma":0.00008102757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002949881,"about_ca_topic_score_gemma":0.0002219648,"domain_scores_codex":[0.9986581,0.0002407213,0.0002903266,0.0003635933,0.0001705834,0.0002767369],"domain_scores_gemma":[0.9947993,0.002239036,0.0001030335,0.002476102,0.00029215,0.00009035427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008315331,0.0004380825,0.0002591643,0.00002344347,0.00004052513,0.000001941581,0.001172104,0.004697958,0.01250981,0.3612488,0.004257521,0.6152675],"study_design_scores_gemma":[0.0004824724,0.00009530017,0.0005363347,0.00007619799,0.000007383736,0.000005193143,0.00002027608,0.9539896,0.001384301,0.01662092,0.02659953,0.0001825219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01125186,0.0001126302,0.9773484,0.007491035,0.0001802102,0.000361634,0.000004023314,0.000189201,0.003061023],"genre_scores_gemma":[0.5786703,0.00002675044,0.4207288,0.0004678346,0.00005292237,0.000006039865,0.00001466354,0.000009402702,0.00002326013],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9492916,"threshold_uncertainty_score":0.6534069,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06481629986884274,"gpt":0.3552400905165993,"spread":0.2904237906477565,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005028356,0.000254506,0.0002524686,0.0001082176,0.0003118144,0.00007137607,0.001299007,0.0002684462,0.00001153398],"category_scores_gemma":[0.000114165,0.0002636931,0.0001166187,0.0003367164,0.0002695168,0.000279859,0.0002001735,0.0006248572,0.00001694167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002222212,"about_ca_system_score_gemma":0.00001275728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007338906,"about_ca_topic_score_gemma":0.0001693625,"domain_scores_codex":[0.9984553,0.00005871436,0.0006213525,0.0002071566,0.0001638768,0.0004935287],"domain_scores_gemma":[0.9961678,0.001231846,0.00008259482,0.002290392,0.000122026,0.0001053792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002251453,0.0005779486,0.0001551032,0.0002245819,0.0002440227,0.000001678163,0.001355353,0.7013863,0.008052263,0.1271701,0.002926491,0.1576811],"study_design_scores_gemma":[0.00134362,0.0001379225,0.001363944,0.0002219839,0.00007783655,0.00000763712,0.0003022345,0.8272741,0.002988015,0.01188904,0.153674,0.0007196838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005960143,0.0002087144,0.9621081,0.001247702,0.00007280901,0.03177746,0.0000134893,0.001619454,0.002356214],"genre_scores_gemma":[0.4751112,0.000121086,0.4469962,0.0001303555,0.00005872474,0.07732414,0.0001658241,0.00007808444,0.00001438431],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.515112,"threshold_uncertainty_score":0.9999815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05815915651934499,"gpt":0.2877791287491744,"spread":0.2296199722298294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005177227,0.0001362359,0.0001848495,0.00008477853,0.0002644822,0.00003679637,0.0003316494,0.0001470363,0.000002388909],"category_scores_gemma":[0.000456119,0.0001218816,0.00008704445,0.0002178281,0.0002421238,0.000004833863,0.0002916385,0.0002258572,0.00000559544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001755521,"about_ca_system_score_gemma":0.00005355809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001430412,"about_ca_topic_score_gemma":0.0006563162,"domain_scores_codex":[0.9989034,0.0003137272,0.0002535674,0.0002484299,0.00008682258,0.0001940739],"domain_scores_gemma":[0.9987006,0.0001245859,0.00007913763,0.0008496846,0.0001192393,0.0001268022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.002365587,0.01555027,0.3188381,0.0001877025,0.0004743033,0.00001647006,0.003110079,0.005616623,0.5844674,0.03103826,0.02423253,0.0141026],"study_design_scores_gemma":[0.02573495,0.004530973,0.5672383,0.0007491337,0.0002409677,0.00005774647,0.003113933,0.2109934,0.08090267,0.02189011,0.0810665,0.003481306],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9836712,0.0004636683,0.008256655,0.00441047,0.00006062437,0.0003073371,0.00003697138,0.00004540712,0.002747677],"genre_scores_gemma":[0.9958793,0.0003255873,0.002357628,0.001027634,0.00003598053,0.00005402813,0.0002972844,0.000008510129,0.00001404832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5035647,"threshold_uncertainty_score":0.4970189,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06718930769435565,"gpt":0.3058309046000424,"spread":0.2386415969056867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009231759,0.0001405553,0.000187467,0.0001021748,0.0005947953,0.000224251,0.0008398957,0.00008694181,0.000004321982],"category_scores_gemma":[0.0002182594,0.0001419071,0.000139715,0.0005580186,0.00006246502,0.0003682114,0.0002499599,0.000215753,0.000007413156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006353461,"about_ca_system_score_gemma":0.00003792586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003163231,"about_ca_topic_score_gemma":0.000005889673,"domain_scores_codex":[0.9984702,0.0001352554,0.0005735201,0.0002315015,0.00016416,0.000425297],"domain_scores_gemma":[0.9966698,0.0003468477,0.0005596663,0.002166741,0.0001151249,0.0001417914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002322602,0.008071325,0.009192776,0.0004211475,0.001057551,0.000009754668,0.01250973,0.2366434,0.006456491,0.2137757,0.1166469,0.394983],"study_design_scores_gemma":[0.0003457789,0.00002518211,0.0004338502,0.00001388498,0.00001405406,0.00002424454,0.0000497924,0.9677951,0.0009152656,0.0004544371,0.02973837,0.0001900249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00158226,0.0002089767,0.9913318,0.002232623,0.0004621772,0.0003611454,0.00001160611,0.0003309094,0.003478458],"genre_scores_gemma":[0.6969314,0.000008106497,0.3022196,0.0004577587,0.0001585757,0.00002878535,0.00009554331,0.00001327691,0.0000870264],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7311517,"threshold_uncertainty_score":0.5786804,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Rayleigh fading; Fading; Physical layer; Beamforming; Computer science; Telecommunications; Wireless; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.04798074377345075,"gpt":0.274168628319796,"spread":0.2261878845463453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004469169,0.0002404725,0.0004454287,0.000243223,0.0000978059,0.00004497294,0.001586473,0.0001312556,0.000001358152],"category_scores_gemma":[0.00009723458,0.0002441919,0.00008003962,0.0005919212,0.0002112752,0.0003965488,0.0002415616,0.0006396929,0.000009180339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001919626,"about_ca_system_score_gemma":0.0000568748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007238991,"about_ca_topic_score_gemma":0.001230412,"domain_scores_codex":[0.9984818,0.0002166909,0.0005407222,0.0001748255,0.000296611,0.0002894092],"domain_scores_gemma":[0.996253,0.0006649029,0.0001160618,0.002618183,0.0002184382,0.0001294086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000321618,0.004119823,0.160237,0.002015121,0.001012129,0.00001797907,0.2731499,0.4196656,0.0490832,0.06752311,0.003479653,0.0193748],"study_design_scores_gemma":[0.001735364,0.00008958144,0.001638137,0.0005971096,0.00004539838,0.00001703324,0.003087064,0.9636459,0.01164316,0.0008321575,0.01605932,0.0006097991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9562362,0.002734973,0.0254442,0.000686301,0.0000940693,0.001264883,0.000127911,0.001356625,0.0120548],"genre_scores_gemma":[0.9867482,0.0003275189,0.01245097,0.00001276769,0.00003072939,0.000281607,0.00007458679,0.00006296671,0.00001065819],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5439803,"threshold_uncertainty_score":0.9957858,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.1678194155602357,"gpt":0.3325523289137169,"spread":0.1647329133534813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005836129,0.0001904959,0.0002886863,0.0002346943,0.0008516855,0.00007425823,0.005382373,0.00008543345,0.00005025254],"category_scores_gemma":[0.0001233538,0.0001954415,0.00006997991,0.0009557019,0.0002579217,0.001193895,0.007519722,0.0003950895,0.00001892007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001203033,"about_ca_system_score_gemma":0.00008170416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002340734,"about_ca_topic_score_gemma":0.001389554,"domain_scores_codex":[0.9982874,0.000469863,0.0004685208,0.0003092976,0.0001947882,0.0002700899],"domain_scores_gemma":[0.9962869,0.0003925814,0.0002418241,0.002649899,0.0003422032,0.00008658932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001040546,0.003577772,0.7576309,0.00008028525,0.000184916,0.000006010519,0.1160395,0.02388071,0.004747528,0.03562637,0.0004604779,0.05766154],"study_design_scores_gemma":[0.0009206391,0.00008233745,0.1651728,0.0001443633,0.000006272344,0.000001577179,0.00009461027,0.8308224,0.002207123,0.00002751058,0.0002824023,0.0002379073],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8006206,0.0009212269,0.1931616,0.0004080214,0.0002399262,0.0006999848,0.00001874887,0.0001838035,0.003746079],"genre_scores_gemma":[0.973224,0.002385081,0.02411495,0.0001295093,0.000006211919,0.00005210109,0.0000169113,0.0000115676,0.00005961848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8069417,"threshold_uncertainty_score":0.999999,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Wireless; Range (aeronautics); Channel (broadcasting); Telecommunications; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05515682426771096,"gpt":0.3402924465080507,"spread":0.2851356222403398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008385897,0.0002822593,0.0003165854,0.0004043968,0.0003424652,0.00006467936,0.004448761,0.0002527997,0.000008508574],"category_scores_gemma":[0.0001061955,0.0003490127,0.00009923594,0.0007242397,0.0003657752,0.0007028257,0.000880216,0.0006442982,0.00002289827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004146527,"about_ca_system_score_gemma":0.00002436432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006594013,"about_ca_topic_score_gemma":0.0007360223,"domain_scores_codex":[0.9981472,0.0001446694,0.0008018427,0.0002486292,0.0002204226,0.0004372521],"domain_scores_gemma":[0.9933342,0.0008086141,0.0001284975,0.005506649,0.0000913384,0.0001307507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001829034,0.003933934,0.01748327,0.0005612118,0.0006531017,0.000006797749,0.008007359,0.2131519,0.04377742,0.0353226,0.007416501,0.669503],"study_design_scores_gemma":[0.0007666565,0.00003631924,0.01912746,0.0002269292,0.00005281387,0.000005458969,0.0002660317,0.9266813,0.01001265,0.005130231,0.03697296,0.0007212249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03182727,0.002711325,0.9549088,0.002053623,0.0001135842,0.002246042,0.0001098217,0.001248182,0.004781381],"genre_scores_gemma":[0.9005315,0.007793802,0.08932952,0.0001211884,0.0000157203,0.001194985,0.000874612,0.00009231076,0.00004633],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8687043,"threshold_uncertainty_score":0.9998962,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02850333899350254,"gpt":0.2440264731328885,"spread":0.215523134139386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001160234,0.0002348733,0.0003352929,0.0002076693,0.0005356248,0.00003116425,0.002263613,0.0001946099,0.00003534078],"category_scores_gemma":[0.00003959209,0.0002318168,0.00007159988,0.000636481,0.001256777,0.0003923062,0.0006180225,0.0006056369,0.00002593976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001456611,"about_ca_system_score_gemma":0.00004060652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002828559,"about_ca_topic_score_gemma":0.00004191665,"domain_scores_codex":[0.998603,0.0001050812,0.0005750183,0.0001717456,0.0002709572,0.0002742389],"domain_scores_gemma":[0.994738,0.0003968411,0.0001451053,0.004380647,0.0002617097,0.0000776689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002876368,0.003066151,0.09888706,0.0005725942,0.001229151,0.000005564325,0.004249827,0.02586618,0.5551515,0.2379127,0.001124442,0.07164713],"study_design_scores_gemma":[0.0007241665,0.0001131343,0.1094446,0.0001640428,0.00004988472,0.00003117116,0.0001347952,0.8673983,0.02113703,0.00009849373,0.0003292678,0.0003751697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840898,0.0003836748,0.006330176,0.0008654385,0.00004609421,0.000360327,0.00003155015,0.0009440274,0.00694892],"genre_scores_gemma":[0.9769095,0.00646008,0.01604995,0.00001719797,0.000009625847,0.0001582673,0.0003149809,0.00005331624,0.00002706427],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8415321,"threshold_uncertainty_score":0.9453215,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02759168365020357,"gpt":0.2585596039883402,"spread":0.2309679203381367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001972342,0.0001728706,0.0002628981,0.0001151561,0.0001480397,0.000007263473,0.002534408,0.00009629179,0.000007080429],"category_scores_gemma":[0.0003155459,0.0001055862,0.0001272169,0.0003398178,0.0004356374,0.0001514302,0.0003897565,0.0002563827,0.00003414369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001807245,"about_ca_system_score_gemma":0.00002628083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000265025,"about_ca_topic_score_gemma":0.00002089657,"domain_scores_codex":[0.9989849,0.00009512691,0.0004589555,0.0001088342,0.0001532866,0.000198846],"domain_scores_gemma":[0.9927284,0.00186568,0.0002175866,0.004991386,0.0001666303,0.00003036496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001286995,0.0007073192,0.2953646,0.0005799165,0.0008445559,5.778139e-7,0.00202539,0.1553769,0.3569783,0.06880984,0.002629199,0.1165547],"study_design_scores_gemma":[0.002071975,0.0004791057,0.355924,0.002563908,0.00004661734,0.00001330681,0.00123403,0.4408209,0.1901961,0.0003212339,0.00545212,0.0008767538],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.986847,0.001010554,0.007272662,0.0007001373,0.00005586699,0.0003975394,0.000145825,0.0007327705,0.002837691],"genre_scores_gemma":[0.9929809,0.002903392,0.003875183,0.000005273822,0.000006962617,0.0001426822,0.000008922356,0.00003368193,0.00004300157],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.285444,"threshold_uncertainty_score":0.4709603,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Contamination; MIMO; Computer science; Environmental science; Risk analysis (engineering); Business; Telecommunications; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.03063808207985033,"gpt":0.2878156462683711,"spread":0.2571775641885208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000158169,0.0001097358,0.0001394378,0.0001009805,0.0003148628,0.0002472333,0.0006871592,0.00005017347,0.000003627334],"category_scores_gemma":[0.00009463182,0.0001295839,0.0000199078,0.00008129778,0.00009179613,0.0009651831,0.00007958571,0.0001658742,0.00002929361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000162971,"about_ca_system_score_gemma":0.00002693724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002313775,"about_ca_topic_score_gemma":0.001428456,"domain_scores_codex":[0.9993122,0.00007143457,0.0002945737,0.0001044157,0.00007961708,0.0001378202],"domain_scores_gemma":[0.9979628,0.0001043804,0.0001425426,0.001643316,0.0001145199,0.0000323908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006102719,0.00009181914,0.003831741,0.0001484593,0.00004118308,0.000002329776,0.001529869,0.8333434,0.008640203,0.1497508,0.0005406094,0.002073479],"study_design_scores_gemma":[0.0009506682,0.00004859896,0.0291924,0.0004014834,0.0000186519,0.000005486701,0.002852746,0.9606711,0.0005089209,0.002031542,0.002937012,0.0003813514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05634243,0.004652024,0.7164999,0.001710934,0.002133422,0.002602988,0.00008084864,0.001225691,0.2147518],"genre_scores_gemma":[0.9948674,0.000364304,0.004185821,0.00000474216,0.00003282509,0.0002442975,0.0001012305,0.00002641225,0.0001729479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.938525,"threshold_uncertainty_score":0.5284277,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Secrecy; Relay; Computer science; Computer network; Power (physics); Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02675128170415708,"gpt":0.2849738364231965,"spread":0.2582225547190394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002982141,0.000206773,0.0002770269,0.0001933184,0.0002222359,0.00004864745,0.00132938,0.0001353222,0.00002099187],"category_scores_gemma":[0.00005753607,0.0001828135,0.00004296803,0.000451288,0.0001653204,0.0006318996,0.0003153515,0.0002186558,0.00002505126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002458841,"about_ca_system_score_gemma":0.00007884618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009936599,"about_ca_topic_score_gemma":0.00006199705,"domain_scores_codex":[0.9986478,0.0002333966,0.0005344227,0.0001921369,0.0001753021,0.0002169237],"domain_scores_gemma":[0.9959823,0.0001852118,0.0001334602,0.002973808,0.0006089829,0.0001161926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002112465,0.0001798342,0.0002253875,0.00003958087,0.00009953126,1.566317e-7,0.005008003,0.09522945,0.8885176,0.008393189,0.0002723931,0.002013743],"study_design_scores_gemma":[0.0004385006,0.0003040373,0.0009952694,0.0004179306,0.00003327497,0.000006964625,0.0008002184,0.7465085,0.247388,0.00001480424,0.002611543,0.0004808706],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8713086,0.0003530001,0.1251755,0.000348909,0.000119296,0.0007703778,0.00009982562,0.0003893547,0.001435095],"genre_scores_gemma":[0.9471402,0.0004153129,0.05196122,0.00002727664,0.000020942,0.0002617464,0.00005044083,0.00005214655,0.00007075342],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6512791,"threshold_uncertainty_score":0.7454919,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04402422241974788,"gpt":0.3435526511375032,"spread":0.2995284287177553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121829,0.0001268944,0.0002157841,0.0001134241,0.0003483273,0.0001529171,0.001278117,0.00005816269,0.000002104186],"category_scores_gemma":[0.0003955692,0.0001031522,0.00001631684,0.0006199615,0.0003727195,0.0003957809,0.001085955,0.0004630551,0.000001197022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001538937,"about_ca_system_score_gemma":0.00003833168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004282816,"about_ca_topic_score_gemma":0.0007012037,"domain_scores_codex":[0.9981585,0.000974071,0.0003494186,0.0002347778,0.0001205825,0.0001626327],"domain_scores_gemma":[0.9961651,0.001702655,0.0001250732,0.001842124,0.0001099932,0.00005504739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000388457,0.0008238294,0.006138568,0.00003880307,0.00002564904,0.00000313369,0.05376796,0.0001343097,0.005705933,0.8373413,0.0007310232,0.09525062],"study_design_scores_gemma":[0.008036425,0.0007013683,0.04067795,0.0006923684,0.00003013453,0.0001062959,0.003696491,0.8783178,0.0005273061,0.008153439,0.05824183,0.0008185627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8357852,0.0248243,0.08590142,0.04386261,0.0001173572,0.001554008,0.00003454832,0.0001214905,0.007799106],"genre_scores_gemma":[0.9835455,0.008754854,0.007080101,0.0004996249,0.000008284576,0.00007087269,0.00001088738,0.000005433402,0.00002442872],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8781835,"threshold_uncertainty_score":0.4206426,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02180954393204518,"gpt":0.2699471902241631,"spread":0.248137646292118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002758839,0.0001820987,0.00020698,0.0001576857,0.0001272279,0.0000165879,0.0006241341,0.00009679232,0.00002708838],"category_scores_gemma":[0.00007575599,0.0001393358,0.00004398125,0.0001606117,0.0001303806,0.000459524,0.0002020943,0.000196199,0.00001940908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003375152,"about_ca_system_score_gemma":0.00001822809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002993828,"about_ca_topic_score_gemma":0.0001625997,"domain_scores_codex":[0.9989899,0.00009027547,0.0004253788,0.0001827047,0.0001217805,0.0001899239],"domain_scores_gemma":[0.9973386,0.0002833876,0.0001309005,0.002155344,0.00003915036,0.00005264845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006710673,0.002796481,0.008268544,0.0005522916,0.0003546617,0.000003098161,0.005318784,0.04112663,0.4442543,0.02753898,0.003429323,0.4656858],"study_design_scores_gemma":[0.004170203,0.0005246479,0.06729994,0.001646051,0.00007219799,0.00001301894,0.0001712313,0.788473,0.09935956,0.02136972,0.01554915,0.001351273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02128694,0.0002884186,0.9739993,0.002184483,0.00006624398,0.001069847,0.000156187,0.0005413879,0.0004072557],"genre_scores_gemma":[0.9013414,0.0008885743,0.09649836,0.00002795614,0.000008270898,0.0007964217,0.0003390478,0.00004229964,0.00005768465],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8800544,"threshold_uncertainty_score":0.5681948,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02321723478353066,"gpt":0.2589083349654344,"spread":0.2356911001819037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001894446,0.0002010445,0.0002506315,0.0003999641,0.0002133477,0.00005252927,0.002860793,0.0001851815,0.000008114081],"category_scores_gemma":[0.0001752504,0.0002263338,0.00005813804,0.001076463,0.0002798742,0.0002476058,0.0001492052,0.0007312532,0.00006133325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001331342,"about_ca_system_score_gemma":0.00001951904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002706443,"about_ca_topic_score_gemma":0.0001662517,"domain_scores_codex":[0.9988738,0.00005827101,0.000417517,0.0001847396,0.0001035049,0.0003621431],"domain_scores_gemma":[0.9958436,0.0002928075,0.00005492872,0.003717104,0.0000568352,0.00003473522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003089562,0.001611704,0.007755591,0.0001254077,0.0002410555,0.00003173137,0.01008673,0.04280071,0.2943502,0.277122,0.01545312,0.3503908],"study_design_scores_gemma":[0.004083529,0.0005941669,0.01372494,0.001469097,0.0001601021,0.0005093674,0.01185668,0.08454432,0.1703141,0.2486078,0.459479,0.004656851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3948496,0.06855344,0.02867859,0.1084182,0.0008157844,0.003341422,0.0001055261,0.03309713,0.3621403],"genre_scores_gemma":[0.985509,0.00621338,0.007850339,0.0001514736,0.000006501731,0.0001533158,0.0000306495,0.00002453648,0.00006079177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5906594,"threshold_uncertainty_score":0.9229623,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02846879948617382,"gpt":0.3065655953552354,"spread":0.2780967958690616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005885709,0.00004522934,0.0001196988,0.0001238187,0.0001025122,0.00002241293,0.002833395,0.00003247931,0.00001546252],"category_scores_gemma":[0.00003427117,0.00003398826,0.00005790664,0.001637497,0.0001445795,0.0001729652,0.0003008415,0.0002065846,0.000001692801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003828733,"about_ca_system_score_gemma":0.0000432478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001762128,"about_ca_topic_score_gemma":0.0009211999,"domain_scores_codex":[0.9993122,0.0001404238,0.0002224592,0.00008838588,0.0001560345,0.00008055482],"domain_scores_gemma":[0.9970674,0.0006031889,0.0001235847,0.002082191,0.0001091662,0.00001446111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001969644,0.001211958,0.4914803,0.00005859129,0.0003238463,4.857329e-7,0.009273745,0.02724332,0.005079132,0.3764271,0.001076465,0.08780541],"study_design_scores_gemma":[0.00006730623,0.00001667892,0.4317891,0.00001564094,0.00002206917,0.0000010282,0.000027358,0.5631858,0.0003392673,0.0004924306,0.003993173,0.00005013254],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9318421,0.0001877137,0.03864105,0.004497046,0.0001799927,0.002518096,0.00002582541,0.00005001087,0.02205816],"genre_scores_gemma":[0.9869206,0.00004879513,0.01240572,0.00002960998,0.000007693426,0.0005601457,0.000006099858,0.000001572886,0.00001975049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5359425,"threshold_uncertainty_score":0.5265201,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02756815309725684,"gpt":0.298303040692188,"spread":0.2707348875949311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008875548,0.0001201442,0.0001409852,0.0001188259,0.00009045696,0.00005386779,0.0008193039,0.00008130574,0.00002263728],"category_scores_gemma":[0.00003682495,0.0001403873,0.00002819535,0.0005294743,0.00003470711,0.0004283039,0.0001029126,0.0003130901,0.00003292752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009011254,"about_ca_system_score_gemma":0.00001052681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000177903,"about_ca_topic_score_gemma":0.000136287,"domain_scores_codex":[0.999302,0.00004260517,0.0002623379,0.0001124209,0.0000787476,0.0002019442],"domain_scores_gemma":[0.9985935,0.000107972,0.00003854992,0.001165372,0.00004795349,0.00004665626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000224171,0.00004279694,0.0009994387,0.000003764783,0.000005808017,5.674676e-7,0.0001461916,0.9883021,0.0004295247,0.001629896,0.0001414826,0.008296219],"study_design_scores_gemma":[0.0004164538,0.00000744069,0.01968614,0.00006002829,0.000006475939,0.000001116667,0.00003527632,0.9758429,0.0003512898,0.002023419,0.001367563,0.0002018883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6814294,0.003744141,0.2849117,0.007259264,0.0005141494,0.001172286,0.0000420369,0.002423657,0.01850334],"genre_scores_gemma":[0.9073556,0.001584626,0.09070524,0.0001295385,0.00003882815,0.00001402101,0.0001272398,0.00002306514,0.0000218396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2259261,"threshold_uncertainty_score":0.572483,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01967350818756038,"gpt":0.2685452292999823,"spread":0.2488717211124219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003531276,0.0001848905,0.0001892722,0.000311846,0.000180208,0.00002873021,0.0006357775,0.0001660808,0.000006656902],"category_scores_gemma":[0.00007524014,0.0001714974,0.00005429767,0.0004578217,0.00006274964,0.0002962357,0.0001219123,0.0002654554,0.00005400043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007346139,"about_ca_system_score_gemma":0.00002260437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004623521,"about_ca_topic_score_gemma":0.0001688889,"domain_scores_codex":[0.9987026,0.0001992072,0.0004525154,0.0002072804,0.0001774022,0.0002609279],"domain_scores_gemma":[0.9969428,0.0005990926,0.0001170756,0.002011324,0.0002754694,0.00005430196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001315409,0.0001117412,0.00009659577,0.00004431594,0.00003326945,2.222122e-7,0.0004721986,0.009286722,0.02711294,0.01038012,0.0000628571,0.9523858],"study_design_scores_gemma":[0.001858009,0.0001828298,0.007603963,0.0009927368,0.00002853243,0.000003893819,0.0006112132,0.8893161,0.08713296,0.007366658,0.004218441,0.0006846192],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008277696,0.0002524699,0.9868985,0.001355259,0.0001228527,0.001045871,0.00008019047,0.001023114,0.0009440767],"genre_scores_gemma":[0.8900909,0.0008779191,0.107679,0.00002233401,0.00003146376,0.001089598,0.0000959932,0.00006851616,0.00004422535],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9517012,"threshold_uncertainty_score":0.6993462,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0100223412514506,"gpt":0.231401611673975,"spread":0.2213792704225244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002652798,0.0001633198,0.0001574804,0.00008405535,0.0004700572,0.00008676929,0.001336525,0.0000589728,0.00001499255],"category_scores_gemma":[0.00005521713,0.0001315794,0.00004467902,0.0001716286,0.0001747659,0.0005647934,0.0002591966,0.0004011476,0.0001318874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009552307,"about_ca_system_score_gemma":0.00003720103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006846188,"about_ca_topic_score_gemma":0.0004187772,"domain_scores_codex":[0.9992155,0.00006169639,0.0003001298,0.00008593405,0.0001303035,0.0002063984],"domain_scores_gemma":[0.9960025,0.0004207177,0.0001434091,0.003130673,0.0002456507,0.00005703531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003299442,0.0004956507,0.0004407853,0.0007250171,0.0009786297,0.000001355303,0.01698211,0.4750915,0.06738292,0.09041717,0.2626957,0.08445919],"study_design_scores_gemma":[0.0005000412,0.00004973262,0.0003115176,0.00007770212,0.00002488724,0.00003429426,0.0002330672,0.3274598,0.00814895,0.001143719,0.6616198,0.0003964526],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0973924,0.002588258,0.8187251,0.01666799,0.0006674379,0.008050431,0.001761164,0.00644012,0.04770708],"genre_scores_gemma":[0.9742967,0.0008026315,0.02232543,0.00008637819,0.00001952354,0.0009032754,0.0004757332,0.00005189135,0.001038361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8769044,"threshold_uncertainty_score":0.5365651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}