{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":46,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":46,"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":"8b5305c2e313","filters":{"venue":"European Transactions on Telecommunications"}},"results":[{"id":"W2152740380","doi":"10.1002/ett.1316","title":"Analysis of the effects of Nyquist pulse‐shaping on the performance of OFDM systems with carrier frequency offset","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Telus (Canada)","funders":"","keywords":"Carrier frequency offset; Subcarrier; Orthogonal frequency-division multiplexing; Nyquist–Shannon sampling theorem; Frequency offset; Bit error rate; Pulse shaping; Electronic engineering; Mathematics; Telecommunications; Computer science; Physics; Channel (broadcasting); Engineering; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.0149168462829109,"gpt":0.2116266949376112,"spread":0.1967098486547003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002221555,0.0001591335,0.0002935894,0.0002847296,0.0003639725,0.000005926227,0.001204975,0.00003434713,0.00001941319],"category_scores_gemma":[0.00004214014,0.0001082499,0.0001633376,0.001476811,0.0003687591,0.00009183896,0.000016766,0.0004173221,0.000002543688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005881401,"about_ca_system_score_gemma":0.00002666077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005546492,"about_ca_topic_score_gemma":0.0000554098,"domain_scores_codex":[0.998606,0.0004303957,0.000504999,0.0001128336,0.0002201059,0.0001256787],"domain_scores_gemma":[0.9962307,0.0006216439,0.0002533421,0.002693125,0.0001720088,0.00002922565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003286223,0.0005769723,0.003825408,0.0004615046,0.002099064,8.003831e-7,0.00362339,0.9544809,0.02728876,0.002837102,0.0000985658,0.004674616],"study_design_scores_gemma":[0.001127709,0.001205619,0.2185697,0.003499937,0.002373779,0.00003107159,0.001153755,0.2001429,0.5689861,0.00002958814,0.001714354,0.001165586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9087363,0.001053552,0.07307585,0.0001887085,0.00009175084,0.0009254122,0.0001834017,0.0003045667,0.01544047],"genre_scores_gemma":[0.9962656,0.002119682,0.00139895,0.00001808317,0.000003593264,0.00007202198,0.00001226854,0.000042327,0.00006748838],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7543381,"threshold_uncertainty_score":0.4414302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069085483","doi":"10.1002/ett.1384","title":"Improved OFDMA uplink transmission<i>via</i>cooperative relaying in the presence of frequency offsets—Part I: Ergodic information rate analysis","year":2009,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"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; University of Alberta","funders":"","keywords":"Ergodic theory; Telecommunications link; Relay; Node (physics); Computer science; Transmission (telecommunications); Orthogonal frequency-division multiple access; Frequency offset; Offset (computer science); Computer network; Transmitter power output; Power (physics); Topology (electrical circuits); Orthogonal frequency-division multiplexing; Telecommunications; Mathematics; Transmitter; Physics; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.02107617940242926,"gpt":0.2562649022384948,"spread":0.2351887228360655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547999,0.000216754,0.0002695422,0.0006010049,0.0008298702,0.0001794494,0.002890432,0.0000528138,0.00007777367],"category_scores_gemma":[0.00006253,0.0001768465,0.0002105373,0.003794535,0.0001052334,0.001236122,0.00003180156,0.0007478656,0.0000304518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005912864,"about_ca_system_score_gemma":0.00008654663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003833873,"about_ca_topic_score_gemma":0.0001010429,"domain_scores_codex":[0.9962856,0.002118466,0.0008686644,0.000263697,0.0002133117,0.0002502354],"domain_scores_gemma":[0.9964465,0.0005996235,0.0002822791,0.002301427,0.0002927574,0.00007741647],"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.00003364607,0.001165477,0.0001144988,0.00001370967,0.0002561306,0.000002045783,0.0205943,0.03595233,0.006130145,0.01781736,0.0002767562,0.9176436],"study_design_scores_gemma":[0.001675304,0.0005888167,0.04515257,0.0002735433,0.0003309225,0.00001291278,0.0007134219,0.9333649,0.003336428,0.0007676501,0.01290085,0.0008827461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002022163,0.0005451165,0.9788236,0.01041382,0.00004991615,0.0004617091,0.000008724161,0.0001255065,0.007549436],"genre_scores_gemma":[0.9709331,0.004457333,0.02322456,0.001176488,0.0000087808,0.00006116703,0.00004181488,0.000008787753,0.00008798495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9689109,"threshold_uncertainty_score":0.7211593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007938807","doi":"10.1002/ett.974","title":"Joint compensation of IQ imbalance, frequency offset and phase noise in OFDM receivers","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Radio Frequency Integrated Circuit Design","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Orthogonal frequency-division multiplexing; Phase noise; Carrier frequency offset; Offset (computer science); Compensation (psychology); Computer science; Frequency offset; Electronic engineering; Joint (building); Noise (video); Telecommunications; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02177073605321286,"gpt":0.2329242311085369,"spread":0.211153495055324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002452761,0.0001700991,0.0002022576,0.0003829911,0.0001185831,0.00002121667,0.0002983265,0.00005019834,0.0000733004],"category_scores_gemma":[0.00002473808,0.0001950041,0.00006053762,0.0005547358,0.0001253433,0.0002117735,0.000001038732,0.0004673372,0.00006028887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002186476,"about_ca_system_score_gemma":0.00003766455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001142168,"about_ca_topic_score_gemma":0.0001942132,"domain_scores_codex":[0.9988727,0.0001857616,0.0004836247,0.0001681208,0.0001098531,0.0001799291],"domain_scores_gemma":[0.9990118,0.00006723747,0.0000697728,0.0007154386,0.00006307579,0.00007263992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000347502,0.001857086,0.0003815342,0.0001390998,0.0002426231,0.00002667504,0.006001574,0.4780833,0.4500122,0.007626739,0.0003030904,0.05529128],"study_design_scores_gemma":[0.03282785,0.003032401,0.1817409,0.004358433,0.0006783425,0.0004770973,0.005828634,0.04886094,0.6964231,0.01414748,0.00633697,0.005287969],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5249708,0.001271314,0.2564673,0.0009342599,0.0003356546,0.001091175,0.0003592271,0.0008674148,0.2137029],"genre_scores_gemma":[0.9942404,0.00146262,0.004118653,0.00003438766,0.000007456799,0.00002503074,0.00003953062,0.0000469047,0.0000250339],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4692696,"threshold_uncertainty_score":0.7952037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093444836","doi":"10.1002/ett.1221","title":"Performance analysis of nonlinearly amplified M‐QAM signals in MIMO channels","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Power Amplifier Design","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":"Queen's University","funders":"","keywords":"MIMO; Fading; QAM; Degradation (telecommunications); Quadrature amplitude modulation; Computer science; Nonlinear system; Channel (broadcasting); Amplifier; Electronic engineering; Control theory (sociology); Telecommunications; Mathematics; Bit error rate; Engineering; Physics; Bandwidth (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.02282728331082212,"gpt":0.2560184982806313,"spread":0.2331912149698092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006443611,0.000183376,0.0002859887,0.001162836,0.000121609,0.00001813361,0.0005696974,0.00004792616,0.0001446613],"category_scores_gemma":[0.0000126343,0.0002134422,0.0001504015,0.002422904,0.00007331678,0.0001797121,0.000006605585,0.0004349901,0.00008361078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008393636,"about_ca_system_score_gemma":0.00001269369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001573983,"about_ca_topic_score_gemma":0.0001408064,"domain_scores_codex":[0.9986241,0.0001231554,0.0006245393,0.0001832752,0.0001469581,0.0002979793],"domain_scores_gemma":[0.9983338,0.0003458425,0.00007450565,0.001086622,0.0000732955,0.00008600007],"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.00001785947,0.0002117962,0.0002525164,0.00001630089,0.0003033591,0.000001797367,0.0009457415,0.9670401,0.004781427,0.00003956796,0.00002117592,0.02636838],"study_design_scores_gemma":[0.002220956,0.0004568541,0.2432396,0.0002963408,0.001354008,0.00001289817,0.001189248,0.650625,0.07960983,0.00006952191,0.01903451,0.001891279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1416058,0.0001564815,0.8358374,0.00004890138,0.0001087915,0.0002227032,0.00005084008,0.0002680084,0.02170107],"genre_scores_gemma":[0.9840486,0.0004099587,0.01516136,0.00003809834,0.00001352418,0.00001463961,0.00004267868,0.00005718971,0.000213939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8424428,"threshold_uncertainty_score":0.8703921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994721667","doi":"10.1002/ett.1411","title":"Performance analysis of best‐path selection scheme for multi‐hop amplify‐and‐forward relaying","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"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":"Memorial University of Newfoundland","keywords":"Cumulative distribution function; Rayleigh fading; Probability density function; Outage probability; Path loss; Fading; Channel (broadcasting); Moment-generating function; Expression (computer science); Channel capacity; Probability of error; Mathematics; Computer science; Selection (genetic algorithm); Statistics; Topology (electrical circuits); Hop (telecommunications); Closed-form expression; Algorithm; Telecommunications; Wireless; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05175647231645616,"gpt":0.3003629027905945,"spread":0.2486064304741384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007042841,0.0001574382,0.0002206904,0.0005133235,0.001036858,0.00009277853,0.001185852,0.0000533009,0.00003952074],"category_scores_gemma":[0.00006094248,0.0001652982,0.0001514827,0.001612434,0.000106162,0.0003644062,0.00005551495,0.0005905334,0.0000210578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002889235,"about_ca_system_score_gemma":0.00004312705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008573575,"about_ca_topic_score_gemma":0.0002303894,"domain_scores_codex":[0.9987067,0.0002627511,0.0004197252,0.0002961501,0.0001189818,0.0001956704],"domain_scores_gemma":[0.9976003,0.0003397089,0.0001810414,0.001491543,0.0002962058,0.00009115534],"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.0000480981,0.001962468,0.0044942,0.00006110786,0.001550097,3.49317e-7,0.005543421,0.0167282,0.05957833,0.04115146,0.000194442,0.8686878],"study_design_scores_gemma":[0.0004904707,0.0001450955,0.01623002,0.00003156329,0.0002277929,0.000004751151,0.00007406481,0.9689314,0.001756068,0.00001111761,0.0118372,0.000260448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05559861,0.00009863461,0.9406665,0.0005672979,0.0000892455,0.0002811917,0.00001617635,0.0001655643,0.002516767],"genre_scores_gemma":[0.7204547,0.001332054,0.2777386,0.00008648036,0.000009357004,0.00005070478,0.0000196448,0.00001629215,0.0002921727],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9522032,"threshold_uncertainty_score":0.7974777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990842717","doi":"10.1002/ett.1231","title":"Antenna combining for multi‐antenna multi‐relay channels","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","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":"Carleton University","funders":"","keywords":"Relay; Antenna (radio); Beamforming; Computer science; Maximal-ratio combining; Channel (broadcasting); Antenna diversity; Constraint (computer-aided design); Topology (electrical circuits); Power (physics); Electronic engineering; Diversity gain; Telecommunications; Computer network; Electrical engineering; MIMO; Mathematics; Engineering; Fading; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.09208213444534645,"gpt":0.3212855554996181,"spread":0.2292034210542716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001750836,0.0002775295,0.0002369905,0.0003846673,0.001860878,0.0002368112,0.002906716,0.00006159118,0.00003832228],"category_scores_gemma":[0.00009421543,0.0002925237,0.0002231895,0.0009209497,0.0001314945,0.0004461011,0.0001032538,0.0006376719,0.0002357154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009753349,"about_ca_system_score_gemma":0.00005022671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006274362,"about_ca_topic_score_gemma":0.0001509758,"domain_scores_codex":[0.9977068,0.0005276317,0.0006325231,0.0004571562,0.0001682886,0.0005075481],"domain_scores_gemma":[0.9959338,0.000725485,0.0001914282,0.002582126,0.0003635048,0.0002036249],"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.0001171041,0.006311913,0.000142545,0.00004972879,0.0004880312,0.00001891071,0.01725983,0.005473228,0.02873421,0.06989294,0.001486776,0.8700248],"study_design_scores_gemma":[0.003586574,0.0003494729,0.004530578,0.0002140588,0.00004959005,0.00003511717,0.0005972215,0.9028281,0.00266071,0.00006896819,0.08408567,0.0009939146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004075913,0.0005724772,0.9924837,0.002141962,0.0005064319,0.000604685,0.00001378463,0.0006234721,0.002645907],"genre_scores_gemma":[0.6610067,0.001025945,0.3353473,0.0007867591,0.00003138235,0.00006050474,0.00002311854,0.00004708819,0.001671152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8973549,"threshold_uncertainty_score":0.9999527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101058896","doi":"10.1002/ett.1339","title":"New joint frame synchronisation and carrier frequency offset estimation method for OFDM systems","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","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 Alberta","funders":"","keywords":"Carrier frequency offset; Orthogonal frequency-division multiplexing; Frequency offset; Algorithm; Offset (computer science); Computer science; Frequency domain; Fast Fourier transform; Sequence (biology); Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02954118089429978,"gpt":0.2678893159716706,"spread":0.2383481350773708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003168277,0.0002305699,0.0002334595,0.0002582015,0.0007079773,0.00005441893,0.0004266583,0.00008417929,0.00003571714],"category_scores_gemma":[0.00005579758,0.0002662718,0.00008802712,0.0002842504,0.00007951328,0.0003507692,0.00001188995,0.0004268675,0.0000305627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001853891,"about_ca_system_score_gemma":0.00004985527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008355642,"about_ca_topic_score_gemma":0.00003243177,"domain_scores_codex":[0.998619,0.0002907474,0.0005222781,0.0002234143,0.0001343411,0.0002101823],"domain_scores_gemma":[0.997946,0.0003222547,0.0001115734,0.0013733,0.000114035,0.0001328799],"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.00001792578,0.0002127943,0.00002810931,0.0001950024,0.0002393435,0.000001752932,0.003377161,0.6750284,0.01103837,0.01214485,0.005926953,0.2917893],"study_design_scores_gemma":[0.0009835081,0.000239144,0.001842989,0.0002865386,0.0001271949,0.0001463932,0.0003269524,0.9495754,0.01209091,0.002129776,0.03129599,0.0009552217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005458252,0.0009780058,0.9917971,0.0004431815,0.0001054596,0.000732201,0.0001134992,0.001233634,0.004051086],"genre_scores_gemma":[0.5124813,0.00127095,0.4856384,0.0000370356,0.00002076526,0.0001730109,0.00008194389,0.00007351176,0.000223074],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5119355,"threshold_uncertainty_score":0.999979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073869199","doi":"10.1002/ett.1461","title":"OFDM channel estimation and data detection with superimposed pilots","year":2011,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication 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":"Estimator; Orthogonal frequency-division multiplexing; Algorithm; Mathematics; Channel (broadcasting); Statistics; Detector; Computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0532086311847528,"gpt":0.2502171462316135,"spread":0.1970085150468606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002146469,0.0001915357,0.0001320028,0.000206678,0.0003998467,0.0000380655,0.0009232082,0.00004054393,0.00003928166],"category_scores_gemma":[0.00001164678,0.000196532,0.00002130798,0.000326992,0.0001323872,0.0005752284,0.00003473568,0.0004114576,0.00005241674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000484852,"about_ca_system_score_gemma":0.00001000156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002985907,"about_ca_topic_score_gemma":0.0001809683,"domain_scores_codex":[0.9990512,0.0001749936,0.0002710281,0.000236466,0.00009693477,0.0001694309],"domain_scores_gemma":[0.997023,0.0000867225,0.00005334369,0.002699248,0.00005550053,0.00008219756],"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.00009477781,0.0006956684,0.00002979583,0.00007253839,0.0002368108,0.000004211863,0.004166897,0.03228834,0.01155056,0.0005703499,0.000120362,0.9501697],"study_design_scores_gemma":[0.002082584,0.00102283,0.02825124,0.0003546756,0.0002780012,0.0002022085,0.001060547,0.8075157,0.1453782,0.001137929,0.01073491,0.001981137],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008403261,0.0002091687,0.9736982,0.00006627737,0.00003467446,0.0003160008,0.00005086546,0.00163665,0.01558488],"genre_scores_gemma":[0.8976353,0.00127574,0.1007822,0.00003304863,0.000005581224,0.00005852931,0.00008072254,0.00008442716,0.00004440997],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9481885,"threshold_uncertainty_score":0.8014342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080150587","doi":"10.1002/ett.992","title":"Generation of multiple Rayleigh fading sequences with specified cross‐correlations","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","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":"University of Alberta","funders":"","keywords":"Rayleigh fading; Fading; Toeplitz matrix; Algorithm; Computational complexity theory; Envelope (radar); Mathematics; Rayleigh scattering; Block (permutation group theory); Computer science; Telecommunications; Combinatorics; Physics; Optics; Decoding methods; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08923396043761851,"gpt":0.3016175358699047,"spread":0.2123835754322862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005668323,0.0001998748,0.0001886366,0.0003731558,0.001141243,0.0002362422,0.002637557,0.00005401632,0.00004175036],"category_scores_gemma":[0.00004497813,0.0001901018,0.0001065424,0.001352373,0.0003207373,0.0008206164,0.00006547159,0.0006193599,0.0001313573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001566004,"about_ca_system_score_gemma":0.0001719181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007113097,"about_ca_topic_score_gemma":0.0003132863,"domain_scores_codex":[0.9977817,0.0006068983,0.0005491938,0.0003739634,0.0003935359,0.0002947108],"domain_scores_gemma":[0.9959059,0.000459002,0.0001754429,0.002975426,0.0003576072,0.0001265623],"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.00002076712,0.0006768887,0.0003771562,0.000009259014,0.00008235252,0.000003391886,0.001798601,0.9345208,0.00426233,0.02936502,0.00004514756,0.02883825],"study_design_scores_gemma":[0.009677669,0.002111605,0.1120896,0.0009400685,0.0001598373,0.0002756224,0.001104367,0.6765628,0.1748404,0.003159232,0.01582123,0.003257498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02140801,0.0001746182,0.9643615,0.001757595,0.00008029466,0.0003623448,0.00001487287,0.0002845276,0.01155619],"genre_scores_gemma":[0.8334132,0.0003695447,0.165797,0.0000571458,0.00002940459,0.00005341682,0.0000342178,0.00003110047,0.0002149954],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8120052,"threshold_uncertainty_score":0.8777634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245779315","doi":"10.1002/ett.1385","title":"Improved OFDMA uplink transmission <i>via</i> cooperative relaying in the presence of frequency offsets—Part II: Outage information rate analysis","year":2009,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"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; University of Alberta","funders":"","keywords":"Telecommunications link; Relay; Diversity gain; Computer science; Node (physics); Computer network; Orthogonal frequency-division multiplexing; Transmission (telecommunications); Interference (communication); Electronic engineering; Ergodic theory; Orthogonal frequency-division multiple access; Fading; Telecommunications; Engineering; Mathematics; Power (physics); Channel (broadcasting); Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02122515768203092,"gpt":0.256209461534068,"spread":0.2349843038520371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524592,0.0002140366,0.0002652081,0.000521065,0.00114797,0.0001570861,0.002684297,0.00005281341,0.00005635669],"category_scores_gemma":[0.00005489697,0.0001754365,0.0001972473,0.003338002,0.00009677294,0.001266771,0.00004363089,0.0007227468,0.00001933503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005603188,"about_ca_system_score_gemma":0.00006993844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003541293,"about_ca_topic_score_gemma":0.00009130935,"domain_scores_codex":[0.9966092,0.001844049,0.0008434959,0.0002580604,0.0002049081,0.0002402524],"domain_scores_gemma":[0.9966905,0.0004690495,0.0002907408,0.002191334,0.0002867827,0.00007156479],"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.00004236575,0.001703267,0.0001156136,0.00001518273,0.0002616118,0.000002112906,0.03257654,0.03860572,0.00995318,0.01969751,0.0003045793,0.8967223],"study_design_scores_gemma":[0.001759551,0.0008063189,0.02685539,0.0002693542,0.0003111059,0.00001001641,0.00071957,0.944079,0.004707717,0.00053538,0.01907479,0.0008718098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003868292,0.0004134681,0.9753556,0.0124471,0.00004973296,0.0005000386,0.00001166997,0.0001285949,0.007225533],"genre_scores_gemma":[0.9752492,0.00348679,0.01980203,0.001213556,0.000007940146,0.0000527641,0.00005105025,0.000008705681,0.000127904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9713809,"threshold_uncertainty_score":0.8829375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973580796","doi":"10.1002/ett.1185","title":"Estimating the minimum distance of large‐block turbo codes using iterative multiple‐impulse methods","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Turbo code; Algorithm; Computer science; Dither; Turbo; Impulse (physics); Minimum distance; Turbo equalizer; Concatenated error correction code; Block code; Mathematics; Decoding methods; Mathematical optimization; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02834000237277867,"gpt":0.3383813975324715,"spread":0.3100413951596928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339074,0.0002395877,0.000242816,0.0001999145,0.00072798,0.0000389472,0.001110898,0.0000523143,0.00002589896],"category_scores_gemma":[0.0001159715,0.0002194833,0.0001315979,0.0006582322,0.0002176329,0.0002195665,0.00003466319,0.0007231848,0.00001046729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001235092,"about_ca_system_score_gemma":0.00001684661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001100604,"about_ca_topic_score_gemma":0.00009507057,"domain_scores_codex":[0.997969,0.0006914424,0.0007081703,0.0001830639,0.0001439293,0.0003044487],"domain_scores_gemma":[0.9958947,0.001668505,0.0001918609,0.002014962,0.0001590595,0.00007090038],"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.00003286197,0.0004940045,0.00007366957,0.00007582208,0.000216933,0.000002038556,0.006446633,0.7500396,0.06625824,0.00110254,0.00007803352,0.1751796],"study_design_scores_gemma":[0.0004766033,0.000065479,0.001160559,0.0002733235,0.00008458994,0.00002141825,0.001342275,0.7812158,0.2063158,0.0002967864,0.008203996,0.0005433711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01037429,0.0006108306,0.9819455,0.0001072368,0.00009761699,0.0003551781,0.00007054552,0.000608165,0.00583063],"genre_scores_gemma":[0.5590156,0.0001207596,0.440703,0.00003483399,0.0000126768,0.00001694517,0.00001197671,0.00005322264,0.00003097867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5486413,"threshold_uncertainty_score":0.8950269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168838607","doi":"10.1002/ett.1088","title":"CAC and routing for multi‐service networks with blocked wide‐band calls delayed, Part II: approximative link MDP framework","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Markov decision process; Routing (electronic design automation); Computer science; Markov process; Call Admission Control; Markov chain; Mathematical optimization; Quality of service; Set (abstract data type); Network packet; Computer network; Mathematics; Wireless network; Wireless; Telecommunications; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03488776575646965,"gpt":0.274926402903607,"spread":0.2400386371471374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009267759,0.0003365739,0.0002995322,0.0002149294,0.002724915,0.0003802815,0.00255707,0.0001236327,0.00001581088],"category_scores_gemma":[0.00005605587,0.0003237043,0.00009967328,0.001284706,0.000235776,0.0004595588,0.0001565528,0.001218283,0.00002318359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009871483,"about_ca_system_score_gemma":0.00009549906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001811434,"about_ca_topic_score_gemma":0.0009845744,"domain_scores_codex":[0.9969978,0.0009266527,0.0006175512,0.0005940321,0.0002819561,0.0005820184],"domain_scores_gemma":[0.9940443,0.001955734,0.0002677666,0.00306256,0.0004827359,0.0001869192],"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.0002878388,0.003034387,0.0004365655,0.00008528027,0.0006206936,0.000009805,0.007458932,0.7191603,0.0001447347,0.0532789,0.002389061,0.2130936],"study_design_scores_gemma":[0.001431603,0.0003561365,0.002286694,0.0002645155,0.00006004731,0.00002234021,0.0001915975,0.9767498,0.0002403016,0.0004532128,0.0173375,0.0006062021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002117847,0.0005486383,0.9848476,0.00870028,0.00006460029,0.0009859906,0.00002911813,0.0004256855,0.002280239],"genre_scores_gemma":[0.5990185,0.0004233746,0.3991777,0.0005054176,0.00006626044,0.0002623433,0.0000601007,0.00006481938,0.000421539],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5969006,"threshold_uncertainty_score":0.9999215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036282249","doi":"10.1002/ett.1269","title":"Two‐stage detection of partitioned random CDMA","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":8,"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":"Code division multiple access; Asynchronous communication; Multiuser detection; Computer science; Transmission (telecommunications); Single antenna interference cancellation; Algorithm; Interference (communication); Maximum a posteriori estimation; Decoding methods; Electronic engineering; Mathematics; Telecommunications; Channel (broadcasting); Statistics; Maximum likelihood; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04235289316292023,"gpt":0.2772319239691823,"spread":0.234879030806262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007312153,0.0001736807,0.0002180295,0.0003818771,0.001181354,0.00005843336,0.00264246,0.00004109923,0.000105012],"category_scores_gemma":[0.00005143637,0.0001858048,0.000179265,0.001254421,0.0002844151,0.0004965713,0.00008072122,0.0006118767,0.000336838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007483035,"about_ca_system_score_gemma":0.00008711443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000610566,"about_ca_topic_score_gemma":0.00009800948,"domain_scores_codex":[0.9968973,0.001574037,0.0005752732,0.0003059832,0.0003617711,0.0002856286],"domain_scores_gemma":[0.9951452,0.000646095,0.0002109879,0.003589019,0.0002736276,0.0001350814],"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.0004288828,0.007254104,0.0003392788,0.00009203731,0.0006617915,0.00004742874,0.01054552,0.326476,0.07755853,0.0442431,0.001138841,0.5312145],"study_design_scores_gemma":[0.01837423,0.001475649,0.03246489,0.0003439808,0.0001173283,0.0004279847,0.000760485,0.5340192,0.2897311,0.00131516,0.1183553,0.002614798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008223481,0.0002189955,0.9633368,0.001060499,0.00009098124,0.0003241404,0.00001223826,0.0003836733,0.02634915],"genre_scores_gemma":[0.9659289,0.00154128,0.03113154,0.0001052652,0.00001950562,0.00007754783,0.00001291746,0.00003250035,0.001150606],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9577054,"threshold_uncertainty_score":0.9086139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972491259","doi":"10.1002/ett.1470","title":"Linear combination‐based energy detection algorithm in low signal‐to‐noise ratio for cognitive radios","year":2011,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"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":"National Natural Science Foundation of China","keywords":"Cognitive radio; False alarm; Energy (signal processing); Algorithm; Computer science; Detection theory; Statistical power; SIGNAL (programming language); Noise (video); Signal-to-noise ratio (imaging); Telecommunications; Artificial intelligence; Mathematics; Wireless; Statistics; Detector","retraction":null,"screen_n_in":null,"score":{"opus":0.02399173461659212,"gpt":0.2369225866670555,"spread":0.2129308520504633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004369348,0.0002118591,0.0001894954,0.0005963448,0.0006106804,0.00008887778,0.0006817294,0.00004978362,0.00003760169],"category_scores_gemma":[0.00003498206,0.0002447112,0.0001418549,0.00114188,0.00006336079,0.0003197986,0.00001755917,0.0003070606,0.00005580854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233375,"about_ca_system_score_gemma":0.00007128209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007601779,"about_ca_topic_score_gemma":0.0003835129,"domain_scores_codex":[0.9981203,0.000574437,0.0004108198,0.000425837,0.0001532816,0.0003153073],"domain_scores_gemma":[0.9982058,0.0005469737,0.0001138995,0.0007236875,0.0002705251,0.0001391477],"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.00005695975,0.00119224,0.000006117872,0.000006575926,0.00004790252,0.00000726778,0.001470803,0.005948788,0.0005546829,0.001950516,0.00002555525,0.9887326],"study_design_scores_gemma":[0.001746019,0.0005811849,0.002244759,0.000146373,0.00003378124,0.00001144334,0.000116386,0.9606298,0.03252461,0.0005153243,0.001026322,0.0004240164],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005625826,0.00004125463,0.9941728,0.0005320257,0.0001374238,0.0005223482,0.0000262819,0.0002313372,0.003773926],"genre_scores_gemma":[0.8762324,0.0000451205,0.1227069,0.0006657919,0.00003457808,0.0001214792,0.00002724103,0.00003941079,0.0001271026],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9883085,"threshold_uncertainty_score":0.9979033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017532877","doi":"10.1002/ett.1429","title":"Covariance precoding schemes for MIMO OFDM over transmit‐antenna and path‐correlated channels","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Spinal Cord Injury Alberta; University of Alberta","funders":"","keywords":"Precoding; Orthogonal frequency-division multiplexing; Pairwise error probability; MIMO; MIMO-OFDM; Computer science; Covariance; Bit error rate; Algorithm; Control theory (sociology); Transmitter; Mathematics; Telecommunications; Statistics; Decoding methods; Beamforming; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01376464893858873,"gpt":0.2429961548389397,"spread":0.2292315059003509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003057912,0.0002542888,0.0002097481,0.0002100005,0.0005720754,0.00007854361,0.0007352955,0.00009033182,0.00007571407],"category_scores_gemma":[0.00003800925,0.0002913148,0.0001087602,0.0003246882,0.0001478879,0.0003316026,0.00001431959,0.001031852,0.00002923926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003540912,"about_ca_system_score_gemma":0.00001622144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004214566,"about_ca_topic_score_gemma":0.00003215686,"domain_scores_codex":[0.9988397,0.0001186565,0.0004222541,0.0002510025,0.00009105639,0.0002773125],"domain_scores_gemma":[0.9978574,0.0003867512,0.0000764791,0.001466563,0.0001014912,0.0001113176],"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.00006686516,0.0006771176,0.00005562283,0.000237645,0.0002877759,0.000001478076,0.002349701,0.01022512,0.1676906,0.01337751,0.000708198,0.8043223],"study_design_scores_gemma":[0.002637904,0.000220904,0.002314192,0.0005055176,0.0001976047,0.00004861665,0.00022478,0.3501628,0.05680446,0.002474578,0.5826102,0.001798401],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00773043,0.0007876744,0.9855841,0.0003798808,0.0002551322,0.0006449309,0.0001000926,0.001518003,0.002999722],"genre_scores_gemma":[0.8684037,0.003881772,0.1270078,0.0000631123,0.00003094011,0.0002507057,0.00004857729,0.0001256898,0.0001877976],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8606732,"threshold_uncertainty_score":0.9999539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003155084","doi":"10.1002/ett.1196","title":"Adaptive modulation over nonlinear time‐varying channels","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Link adaptation; Modulation (music); Computer science; Nonlinear system; Quadrature amplitude modulation; Transmission (telecommunications); Bit error rate; Control theory (sociology); Channel (broadcasting); Electronic engineering; Amplifier; QAM; Telecommunications; Bandwidth (computing); Physics; Engineering; Fading; Artificial intelligence; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.0140040556583602,"gpt":0.2291966370762867,"spread":0.2151925814179265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002986291,0.0002006514,0.0001370332,0.0002557964,0.0003899799,0.00003729782,0.0003219432,0.00005752003,0.000210656],"category_scores_gemma":[0.000008805553,0.0002415118,0.00008108371,0.0005867147,0.00004969674,0.0003147986,0.00000762178,0.0004274961,0.0004991129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001460315,"about_ca_system_score_gemma":0.000008429824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003110068,"about_ca_topic_score_gemma":0.00001046715,"domain_scores_codex":[0.9989006,0.0001047945,0.0003698746,0.0001899857,0.0001437759,0.0002909747],"domain_scores_gemma":[0.998831,0.0001926885,0.00006080036,0.0007453561,0.00007218396,0.00009792043],"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.00001166454,0.00006979546,0.000002604217,0.000003270101,0.00003384642,0.00000131501,0.000218922,0.9359263,0.0009083637,0.00006020586,0.00008828251,0.06267544],"study_design_scores_gemma":[0.000340917,0.00004188642,0.0006849492,0.00004222836,0.00002138293,0.000004995719,0.00003679959,0.9921519,0.001914029,0.00004520068,0.004428627,0.0002870421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003356196,0.0001027719,0.9571959,0.00005541254,0.0001915123,0.0002479102,0.00002089716,0.0009374049,0.03789201],"genre_scores_gemma":[0.9068015,0.0002700632,0.09204285,0.00006553596,0.0001024785,0.00001340482,0.00009827189,0.0001196859,0.0004862219],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9034453,"threshold_uncertainty_score":0.9848565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090797353","doi":"10.1002/ett.1430","title":"Pre‐LNA smart soft antenna selection for MIMO spatial multiplexing/diversity system when amplifier/sky noise dominates","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":6,"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":"MIMO; Beamforming; Spatial multiplexing; Antenna (radio); Computer science; Electronic engineering; Diversity gain; Amplifier; Low-noise amplifier; Multiplexing; Noise (video); Antenna diversity; Noise figure; Telecommunications; Engineering; Bandwidth (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.01500165000897104,"gpt":0.2122506517303813,"spread":0.1972490017214102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000379394,0.0002587796,0.0002457274,0.0003091245,0.00140487,0.0001000821,0.0006589309,0.00009467912,0.0001490492],"category_scores_gemma":[0.00003391243,0.0002818794,0.0002787016,0.0003048527,0.00009262945,0.000217494,0.00002274989,0.0006516267,0.0002009651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009171396,"about_ca_system_score_gemma":0.00001967345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002853205,"about_ca_topic_score_gemma":0.001247816,"domain_scores_codex":[0.9987127,0.0001622228,0.0003809894,0.0002851356,0.0001401873,0.0003187219],"domain_scores_gemma":[0.9985139,0.0002490845,0.0000843536,0.0008298579,0.0001797606,0.0001430184],"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.0006671422,0.002821165,0.005833567,0.001032303,0.00319197,0.0000130606,0.01436698,0.04881455,0.7626584,0.001925415,0.004404812,0.1542707],"study_design_scores_gemma":[0.001280483,0.0001303337,0.006610041,0.0001077558,0.0004038909,0.00002771578,0.0007693995,0.9746709,0.003277957,0.00005317195,0.0119719,0.0006964471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01332328,0.00004954563,0.9827445,0.0001954456,0.0003709751,0.0004675385,0.0001498225,0.001005102,0.001693793],"genre_scores_gemma":[0.9811535,0.00007872666,0.0176625,0.00004008403,0.00009928684,0.00006875174,0.00008212132,0.00008401339,0.0007309952],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9678302,"threshold_uncertainty_score":0.9999633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079898523","doi":"10.1002/ett.1295","title":"Accurate closed‐form approximations for the performance of equal gain combining diversity systems in Nakagami fading channels","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"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":"Fading; Nakagami distribution; Closed-form expression; Diversity gain; Mathematics; Envelope (radar); Expression (computer science); Diversity combining; Outage probability; Computer science; Algorithm; Telecommunications; Topology (electrical circuits); Statistics; Mathematical analysis; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04973518360916431,"gpt":0.253217334822959,"spread":0.2034821512137947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005166205,0.0001792311,0.0002149895,0.0002838564,0.001308591,0.0000224492,0.001178961,0.00004902029,0.000009100589],"category_scores_gemma":[0.00002776533,0.0001759951,0.00009908001,0.0005629104,0.0001663998,0.0003498278,0.00005574991,0.0004999012,0.00001370559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001356222,"about_ca_system_score_gemma":0.00002058184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003433192,"about_ca_topic_score_gemma":0.00002282723,"domain_scores_codex":[0.9987506,0.0001964544,0.000532896,0.0001420518,0.0001408333,0.00023716],"domain_scores_gemma":[0.9976308,0.0008025769,0.0001389949,0.001270514,0.0001129232,0.00004412709],"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.00001202967,0.0001392518,0.00007198915,0.00006979145,0.00005064862,2.975681e-7,0.003637272,0.9871746,0.0004594849,0.001170028,0.00006393321,0.007150717],"study_design_scores_gemma":[0.0007225076,0.0001101557,0.002160187,0.0001967836,0.00003084517,0.00001357205,0.001009187,0.9874714,0.005099249,0.00007057691,0.002773829,0.0003417282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06455357,0.0005175298,0.9300781,0.0001483489,0.0001395443,0.0009303823,0.00007604365,0.0005421239,0.003014297],"genre_scores_gemma":[0.9870535,0.00376648,0.008691504,0.00002069941,0.00001214965,0.0002552656,0.00003411941,0.00005461361,0.0001116816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9224999,"threshold_uncertainty_score":0.9999916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4250256434","doi":"10.1002/ett.1056","title":"CAC and routing for multi‐service networks with blocked wide‐band calls delayed, part I: exact link MDP framework","year":2005,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Markov decision process; Routing (electronic design automation); Computer science; Markov process; Computer network; Mathematical optimization; Markov chain; Set (abstract data type); Quality of service; Call Admission Control; Service (business); Clearance; Distributed computing; Mathematics; Wireless network; Telecommunications; Economics; Wireless; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04433834447850925,"gpt":0.2929779859921931,"spread":0.2486396415136838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001040705,0.000329259,0.000284867,0.0002179853,0.00181751,0.0004470956,0.002967836,0.0001260611,0.00003386055],"category_scores_gemma":[0.00007673082,0.00031983,0.0001032576,0.001105408,0.0001782867,0.0005747636,0.0001214509,0.00134015,0.00006803633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001143566,"about_ca_system_score_gemma":0.0001047818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006409419,"about_ca_topic_score_gemma":0.001037211,"domain_scores_codex":[0.9970048,0.0009135916,0.0006016705,0.0005883309,0.0002813121,0.0006103027],"domain_scores_gemma":[0.9932303,0.002229869,0.0002250134,0.003618626,0.0004028355,0.0002932923],"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.0001504206,0.001105874,0.0002202945,0.00003123459,0.0003681797,0.000004087618,0.003704901,0.4490461,0.00007040532,0.005980745,0.00112799,0.5381898],"study_design_scores_gemma":[0.001271539,0.000250116,0.001864802,0.0002239885,0.00005287192,0.00002747893,0.0001271735,0.9318067,0.0001850301,0.00005524428,0.06359413,0.0005408657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001442938,0.0007342226,0.9767647,0.01821088,0.00006564895,0.0007939417,0.00001990243,0.0004389521,0.00152875],"genre_scores_gemma":[0.6099901,0.001383965,0.386696,0.001233344,0.00009450182,0.0001745371,0.00003070603,0.00006808709,0.0003288092],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6085471,"threshold_uncertainty_score":0.9999254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073350441","doi":"10.1002/ett.1169","title":"Vector quantisation for finite‐state Markov channels and application to wireless communications","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Decoding methods; Algorithm; Fading; Channel (broadcasting); Maximum a posteriori estimation; Computer science; Markov chain; Channel state information; Markov process; Markov model; Wireless; Hidden Markov model; Electronic engineering; Speech recognition; Mathematics; Telecommunications; Engineering; Statistics; Maximum likelihood","retraction":null,"screen_n_in":null,"score":{"opus":0.02581371447252368,"gpt":0.3026467157225275,"spread":0.2768330012500038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101385,0.0002186021,0.0001831387,0.0004346995,0.001080905,0.0001689935,0.002621726,0.00004755036,0.000005322879],"category_scores_gemma":[0.00007721979,0.0002430406,0.00007491468,0.0007940754,0.0001215911,0.0005546933,0.0001677877,0.0003260657,0.0000767684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000879344,"about_ca_system_score_gemma":0.00003056717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000226441,"about_ca_topic_score_gemma":0.0001030541,"domain_scores_codex":[0.9981867,0.0002859981,0.0005374003,0.0004853123,0.0001767152,0.0003278814],"domain_scores_gemma":[0.9941814,0.001332767,0.00019248,0.003858596,0.0002279262,0.0002068362],"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.0000342192,0.0003906815,0.000008870266,0.00001678069,0.00002738602,8.164455e-7,0.001192209,0.001168886,0.006025285,0.02729849,0.0004610088,0.9633754],"study_design_scores_gemma":[0.002347791,0.00116686,0.008861292,0.0003757754,0.00009219605,0.00007720331,0.0004861224,0.3516158,0.07033648,0.01296472,0.5493101,0.002365668],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003784129,0.00009382672,0.9916236,0.004234003,0.00009946482,0.00117564,0.00008835561,0.0007606508,0.001546087],"genre_scores_gemma":[0.5619133,0.0002902485,0.4367784,0.0004665069,0.00001537903,0.0002578841,0.00006385279,0.00003456867,0.0001799416],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9610097,"threshold_uncertainty_score":0.9910908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007082708","doi":"10.1002/ett.1168","title":"E‐model based comparison of multiple description coding and layered coding in packet networks","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Automatic repeat request; Network packet; Hybrid automatic repeat request; Packet loss; Go-Back-N ARQ; Computer science; Coding (social sciences); Selective Repeat ARQ; Computer network; Real-time computing; Algorithm; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.083164908306086,"gpt":0.3031603996088944,"spread":0.2199954913028084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371031,0.0001622505,0.0002226515,0.0003841836,0.0005174691,0.00009205061,0.0009913346,0.00004966551,0.00001074581],"category_scores_gemma":[0.00005716563,0.0001825614,0.00006586369,0.0008256359,0.0001070176,0.0003277525,0.00005945196,0.0005373774,0.000006213178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008613304,"about_ca_system_score_gemma":0.00003470574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001067423,"about_ca_topic_score_gemma":0.0008639492,"domain_scores_codex":[0.9981672,0.000549264,0.000620965,0.0002647801,0.0001406722,0.0002571133],"domain_scores_gemma":[0.9975868,0.0007679346,0.0001875699,0.001237158,0.0001247173,0.00009584732],"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.00006941901,0.001384781,0.007065517,0.00002790834,0.00004314336,0.000002425854,0.005218015,0.5470431,0.01081718,0.01838637,0.0001741147,0.409768],"study_design_scores_gemma":[0.0006322792,0.00005393125,0.01709928,0.0001120029,0.000007057685,0.00000169366,0.000160866,0.9798791,0.001444499,0.00003409511,0.000399039,0.0001761957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01095881,0.0003502501,0.9840589,0.0005803574,0.00005772414,0.0002260549,0.000003828414,0.0001342451,0.003629887],"genre_scores_gemma":[0.9168129,0.0007757837,0.08214766,0.0001684033,0.000007105395,0.00001048461,0.0000121986,0.00001915479,0.00004632599],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.905854,"threshold_uncertainty_score":0.7444639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2095362508","doi":"10.1002/ett.1255","title":"Orthogonality‐embedded space‐time codes","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"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":"Space–time block code; Block code; Circulant matrix; Orthogonality; Full Rate; Decoding methods; Mathematics; Space time; Algebraic number; Linear code; Discrete mathematics; Algorithm; Computer science; Combinatorics; Geometry; Engineering; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01222209493047646,"gpt":0.2486076516672964,"spread":0.2363855567368199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007284902,0.0002501573,0.0002046495,0.0003166645,0.0004767973,0.00004737065,0.001048186,0.00006752888,0.0003697757],"category_scores_gemma":[0.00002511018,0.0002905231,0.0001325935,0.0006155263,0.0001562644,0.0002277083,0.00001973714,0.0007214049,0.001054724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001392312,"about_ca_system_score_gemma":0.00001531757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005311547,"about_ca_topic_score_gemma":0.00005527835,"domain_scores_codex":[0.9985134,0.0002516228,0.0005134022,0.000201132,0.0001755007,0.0003449252],"domain_scores_gemma":[0.9969446,0.0004513402,0.00007310456,0.002282703,0.0001004554,0.0001478001],"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.0000846257,0.001644833,0.0001578092,0.00009704184,0.0005506239,0.00002187658,0.003129901,0.1345731,0.07671526,0.01719784,0.00518778,0.7606394],"study_design_scores_gemma":[0.002015362,0.0003580308,0.01688514,0.0003937798,0.0002118914,0.0001219414,0.001209205,0.02802511,0.361053,0.002539211,0.5839012,0.003286126],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003899586,0.0002712408,0.8113208,0.0003325735,0.00005879711,0.0002588191,0.00004140208,0.00304898,0.1807678],"genre_scores_gemma":[0.8978406,0.000948997,0.09972228,0.0001309575,0.00002398967,0.00003252309,0.00006481916,0.000122704,0.001113184],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.893941,"threshold_uncertainty_score":0.9999547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1903268680","doi":"10.1002/ett.1495","title":"On the error exponent of MIMO‐ARQ system over the fast fading channels","year":2011,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"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":"Fading; Hybrid automatic repeat request; Computer science; Automatic repeat request; Algorithm; Exponent; Decoding methods; Code word; Code rate; MIMO; Bit error rate; Channel (broadcasting); Electronic engineering; Mathematics; Computer network; Telecommunications; Engineering; Transmission (telecommunications)","retraction":null,"screen_n_in":null,"score":{"opus":0.08077837576552113,"gpt":0.2586174351081165,"spread":0.1778390593425953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009340739,0.0001806759,0.0001495898,0.0001450109,0.001475201,0.00009693651,0.003858641,0.00002682307,0.0001698727],"category_scores_gemma":[0.00003127733,0.0001164283,0.0001564123,0.0007235366,0.0001721152,0.0001852992,0.0001140938,0.0005381864,0.0002201991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006798216,"about_ca_system_score_gemma":0.00003239373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001872451,"about_ca_topic_score_gemma":0.00003587192,"domain_scores_codex":[0.9973269,0.001587157,0.0004236735,0.0002377104,0.00021057,0.0002140421],"domain_scores_gemma":[0.9952182,0.0007427862,0.0002038009,0.003637303,0.0001353243,0.000062548],"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.00003324669,0.001245476,0.000022024,0.00002359814,0.0002641949,0.00000317913,0.03907013,0.007326187,0.001063827,0.8451793,0.002530656,0.1032382],"study_design_scores_gemma":[0.005400841,0.002850375,0.06332199,0.003822658,0.0005180362,0.0002034508,0.02256774,0.6711937,0.04952614,0.00331788,0.1727738,0.004503389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009099743,0.00031515,0.8836306,0.004845116,0.0003617213,0.0006134911,0.00001188424,0.0003211744,0.1008011],"genre_scores_gemma":[0.9952694,0.0003838493,0.003249701,0.0005112198,0.00001748087,0.00007688921,0.000002594544,0.00002508568,0.0004638509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9861696,"threshold_uncertainty_score":0.9998248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974737638","doi":"10.1002/ett.965","title":"Efficient packet data service in a spread spectrum OFDM cellular system with 2‐dimensional radio resource allocation","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":4,"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":"Computer science; Computer network; Orthogonal frequency-division multiplexing; Link adaptation; Fading; Hybrid automatic repeat request; Network packet; Spectral efficiency; Throughput; Transmission delay; Real-time computing; Telecommunications link; Wireless; Telecommunications; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.01349750270296428,"gpt":0.1999728325211275,"spread":0.1864753298181632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004161838,0.0002453525,0.0001867744,0.0002638085,0.0002935234,0.00004392711,0.0008564473,0.00004538491,0.00001698911],"category_scores_gemma":[0.000006170192,0.0002612875,0.00003127833,0.001100887,0.00005173119,0.0001556492,0.00002555396,0.0005086206,0.0001663423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004680563,"about_ca_system_score_gemma":0.00005237366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005364633,"about_ca_topic_score_gemma":0.0007689434,"domain_scores_codex":[0.9983867,0.0002730658,0.000412497,0.0003604439,0.000270693,0.000296568],"domain_scores_gemma":[0.9973328,0.00009821577,0.00007501465,0.002328476,0.00006783631,0.00009770194],"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.00001856663,0.0001857746,0.000003040285,0.00003018568,0.00003515393,0.00000590675,0.000319689,0.9972247,0.000287137,0.0003604101,0.00002820627,0.001501152],"study_design_scores_gemma":[0.001314331,0.00004603725,0.0007358286,0.0004055879,0.00005220618,0.00003765065,0.0003244236,0.9941904,0.001091447,0.000009571389,0.001422594,0.0003699355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04540164,0.0002858868,0.9459969,0.00089777,0.00008776942,0.0005224248,0.00008480431,0.000852688,0.005870155],"genre_scores_gemma":[0.9717461,0.00006006354,0.02744883,0.00005787137,0.00003274085,0.00003433339,0.0004664336,0.0001218982,0.00003170697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9263445,"threshold_uncertainty_score":0.9999839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052181728","doi":"10.1002/ett.1059","title":"Reinforcement‐learning‐based self‐organisation for cell configuration in multimedia mobile networks","year":2005,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":4,"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":"National Science Council","keywords":"Reinforcement learning; Computer science; Computer network; Scheme (mathematics); Cellular network; Code division multiple access; Power control; Call Admission Control; Resource allocation; Wireless network; Code (set theory); Wireless; Distributed computing; Multimedia; Power (physics); Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01792925647922482,"gpt":0.2653615184961565,"spread":0.2474322620169316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001056326,0.0002165599,0.0001790508,0.0004207597,0.0007811466,0.0002190313,0.002091593,0.00008604833,0.0001486055],"category_scores_gemma":[0.00002969231,0.0002499432,0.0001174149,0.0007169698,0.00006609305,0.0005937581,0.00004368403,0.0008258088,0.0003252404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002902472,"about_ca_system_score_gemma":0.000125433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001456509,"about_ca_topic_score_gemma":0.00008258094,"domain_scores_codex":[0.9972751,0.001035807,0.0006291133,0.0003844954,0.0002676722,0.0004078734],"domain_scores_gemma":[0.9963569,0.001063074,0.0002112564,0.002053956,0.0001845705,0.0001302092],"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.00001284241,0.0005450991,0.00001715199,0.000007210874,0.00001105081,2.529498e-7,0.0009835169,0.9294458,0.0002204092,0.0003814257,0.0002009875,0.06817423],"study_design_scores_gemma":[0.001239448,0.0001975771,0.0004886348,0.00002121189,0.000008787615,9.947753e-7,0.00008871388,0.9556645,0.002309851,0.00001052927,0.03973432,0.0002354152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000536209,0.0001586965,0.9874948,0.00177141,0.00006607642,0.001172877,0.000002844674,0.0005204193,0.008276616],"genre_scores_gemma":[0.8828445,0.0005115281,0.1149746,0.0002877216,0.00004546873,0.0005390448,0.0001325588,0.0000470068,0.0006175185],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8823083,"threshold_uncertainty_score":0.9999953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081672511","doi":"10.1002/ett.1318","title":"Information rates for multi‐dimensional modulation over multiple antenna wireless channels","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"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":"Transmitter; Beamforming; Computer science; Channel (broadcasting); Transmitter power output; Wireless; Signal-to-noise ratio (imaging); Dimension (graph theory); SIGNAL (programming language); Code rate; Antenna (radio); Channel capacity; Power (physics); Telecommunications; Computer network; Topology (electrical circuits); Mathematics; Electrical engineering; Physics; Engineering; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.03757860321777062,"gpt":0.2694978956172095,"spread":0.2319192923994389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002745814,0.0002516067,0.0002036523,0.0003738509,0.0008684834,0.00006285279,0.0006657948,0.00008806226,0.00005556203],"category_scores_gemma":[0.00003784412,0.0002900356,0.0001548187,0.0003838594,0.0001200347,0.0008649581,0.00001875428,0.000422891,0.0001623591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001208886,"about_ca_system_score_gemma":0.0000261745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002532377,"about_ca_topic_score_gemma":0.00003493068,"domain_scores_codex":[0.9986513,0.0001930514,0.0005720033,0.0001423561,0.0001784908,0.0002627495],"domain_scores_gemma":[0.9979819,0.0003176681,0.0001096551,0.001250271,0.0002427865,0.00009770343],"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.0002221382,0.002615676,0.0007852651,0.0002393515,0.0006772715,0.000003431946,0.01738943,0.7839686,0.03730467,0.003240623,0.0101885,0.1433651],"study_design_scores_gemma":[0.001056703,0.00005791159,0.007863461,0.00005881157,0.0000191528,0.0000165254,0.0001112367,0.9655833,0.006972332,0.00004288205,0.01780483,0.0004128238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07788838,0.0001172531,0.91777,0.0002769457,0.0001849071,0.0008276668,0.0001844314,0.00164841,0.001102004],"genre_scores_gemma":[0.9528776,0.0007368154,0.04527007,0.0001693828,0.00002612627,0.0002849868,0.0004410416,0.00007947969,0.000114476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8749892,"threshold_uncertainty_score":0.9999552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083812595","doi":"10.1002/ett.4460120104","title":"Hybrid ARQ and optimal signal—to—interference ratio assignment for high—quality data transmission in DS—CDMA","year":2001,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"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":"Hybrid automatic repeat request; Selective Repeat ARQ; Computer science; Automatic repeat request; Error detection and correction; Go-Back-N ARQ; Code division multiple access; Transmission (telecommunications); Convolutional code; Algorithm; Network packet; Throughput; Bit error rate; Word error rate; Real-time computing; Computer network; Decoding methods; Wireless; Speech recognition; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0980398752711771,"gpt":0.3439451099290364,"spread":0.2459052346578593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001960571,0.0002353439,0.0002539682,0.0003705433,0.0007183501,0.0003209425,0.005341588,0.00004202839,0.00007754494],"category_scores_gemma":[0.00004514002,0.000246928,0.00005805991,0.0007048083,0.0001160552,0.0007247465,0.0002942781,0.0006222429,0.00007002004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233109,"about_ca_system_score_gemma":0.0001049832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009060958,"about_ca_topic_score_gemma":0.000144217,"domain_scores_codex":[0.9963453,0.001518091,0.0006904624,0.0007129458,0.0003085923,0.0004246264],"domain_scores_gemma":[0.9936566,0.001171293,0.0001214246,0.004650794,0.000145115,0.000254721],"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.0001101641,0.001495054,0.00004427589,0.00002224354,0.00005661906,0.000005948341,0.001083962,0.04493876,0.002336057,0.007682542,0.0008948448,0.9413295],"study_design_scores_gemma":[0.00309759,0.0008791737,0.01642263,0.0003781431,0.00004203677,0.00005636668,0.0002545704,0.8597811,0.005723174,0.001201037,0.1109438,0.001220268],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004024335,0.0002199852,0.9798051,0.0132256,0.0000391014,0.0008415964,0.00006726427,0.0001802214,0.001596814],"genre_scores_gemma":[0.8074307,0.001387053,0.1902102,0.0002843987,0.00001707189,0.0001517703,0.0001037812,0.00003151178,0.0003834945],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9401093,"threshold_uncertainty_score":0.9999983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109154295","doi":"10.1002/ett.4460110612","title":"SS‐MC‐MA Systems with Pilot Symbol Aided Channel Estimation in the Asynchronous Uplink","year":2000,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"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":"Telecommunications link; Computer science; Asynchronous communication; Exploit; Channel (broadcasting); Electronic engineering; Spectral efficiency; Boosting (machine learning); Computer network; Telecommunications; Real-time computing; Engineering; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.02879625657969147,"gpt":0.2599143096495778,"spread":0.2311180530698863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001415648,0.0002600494,0.0002197189,0.0003466703,0.00114612,0.0005292619,0.005239479,0.00004807645,0.00008003692],"category_scores_gemma":[0.00001871629,0.0002068547,0.00007112335,0.001801273,0.000189239,0.0006442044,0.00004533468,0.001120675,0.0007817538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001563612,"about_ca_system_score_gemma":0.0001170776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001737544,"about_ca_topic_score_gemma":0.0001897622,"domain_scores_codex":[0.9956962,0.002402764,0.0005642612,0.0004244844,0.0004591794,0.0004530863],"domain_scores_gemma":[0.9939972,0.0008567956,0.0001305983,0.004767987,0.0001352836,0.0001122051],"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.00004711804,0.001482419,0.00001528426,0.00001939817,0.00006138652,0.0000117443,0.003668381,0.8228921,0.00002318372,0.005617894,0.0005613446,0.1655997],"study_design_scores_gemma":[0.00114239,0.0006154419,0.005345094,0.0002087267,0.00002153393,0.0001263495,0.0004240562,0.986721,0.00004240343,0.0002194948,0.004673438,0.0004601176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003209855,0.0004329245,0.9441599,0.007066593,0.00008421991,0.00105686,0.000008214451,0.0004276894,0.04355369],"genre_scores_gemma":[0.9820566,0.001001176,0.01524191,0.0003172552,0.00002149424,0.000371162,0.0000342372,0.00004860701,0.0009076283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9788467,"threshold_uncertainty_score":0.9999962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094148320","doi":"10.1002/ett.1010","title":"Analysis of coherent MPSK schemes with generalized selection diversity in Rayleigh fading","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Medical Research Council; King Fahd University of Petroleum and Minerals","keywords":"Rayleigh fading; Expression (computer science); Phase-shift keying; Fading; Keying; Moment-generating function; Selection (genetic algorithm); Diversity combining; Modulation (music); Algorithm; Computer science; Mathematics; Diversity scheme; Rayleigh scattering; Electronic engineering; Probability density function; Telecommunications; Statistics; Bit error rate; Physics; Engineering; Optics; Artificial intelligence; Decoding methods; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.02162674496828469,"gpt":0.2439785724252331,"spread":0.2223518274569484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001797686,0.0001638759,0.0002568692,0.0008325122,0.0003156104,0.00001578175,0.0005874909,0.00004022145,0.00006578994],"category_scores_gemma":[0.000006407113,0.0001763233,0.0001115018,0.002117563,0.00008766856,0.0001969577,0.0000265286,0.0004014548,0.000009468151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002619324,"about_ca_system_score_gemma":0.00001705746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001302362,"about_ca_topic_score_gemma":0.001321611,"domain_scores_codex":[0.9990203,0.0001768977,0.0003559635,0.0001611593,0.0001208797,0.0001647398],"domain_scores_gemma":[0.9987624,0.00008360788,0.00008369557,0.000936155,0.00008410484,0.00005004028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001605415,0.0002412739,0.001234953,0.00001051014,0.0003938159,5.467113e-7,0.0007542688,0.9865661,0.002901872,0.001064028,0.00000375548,0.006812807],"study_design_scores_gemma":[0.01112785,0.001026677,0.2350344,0.001045136,0.003956186,0.00002966093,0.002324708,0.2342988,0.4967608,0.001615084,0.008904437,0.003876253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2607837,0.0001339843,0.734013,0.00008406501,0.00001336696,0.0002243002,0.00002171219,0.0005545965,0.004171219],"genre_scores_gemma":[0.942257,0.001075099,0.05650217,0.00001973056,0.000002764887,0.00003794934,0.000038228,0.00003780018,0.00002930183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7522673,"threshold_uncertainty_score":0.7190256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047300650","doi":"10.1002/ett.1137","title":"Performance of collaborative codes in CSMA/CD environment","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":2,"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":"Carrier sense multiple access with collision avoidance; Computer science; Throughput; Network packet; Markov chain; Computer network; Channel (broadcasting); Distributed coordination function; Access control; Channel access method; Protocol (science); Collision; Scheme (mathematics); Wireless; Computer security; Mathematics; IEEE 802.11; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.007750151187723384,"gpt":0.1959455362840515,"spread":0.1881953850963281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002925131,0.0001345517,0.0001489135,0.0002302246,0.0002246194,0.00003328539,0.001088702,0.0000305949,0.0000277252],"category_scores_gemma":[0.000003447597,0.0001435692,0.00005195981,0.0007654683,0.0001285445,0.0001939941,0.00002644555,0.0002642134,0.00008508516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007738457,"about_ca_system_score_gemma":0.00002982218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004232824,"about_ca_topic_score_gemma":0.0001197712,"domain_scores_codex":[0.9985383,0.0004410754,0.0004055198,0.0002422095,0.0001736791,0.0001992105],"domain_scores_gemma":[0.9982927,0.0001940824,0.0001338533,0.001294184,0.00004914369,0.00003604041],"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.00000651824,0.0006347466,0.0003604834,0.000004369561,0.000009540719,0.00000155535,0.0002950937,0.9817302,0.0007097955,0.004159888,0.00007085699,0.01201692],"study_design_scores_gemma":[0.001977368,0.0007234599,0.1630808,0.0002664281,0.00003655522,0.00001794679,0.0002756485,0.7666385,0.03155915,0.0001386395,0.03424124,0.001044248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2531301,0.0003307961,0.6598148,0.0009632403,0.0001168166,0.0003332437,0.00002265616,0.0002159993,0.08507231],"genre_scores_gemma":[0.9416153,0.0005373968,0.05722098,0.00003624241,0.000009085691,0.00002001718,0.00001119944,0.00001723044,0.0005325329],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6884852,"threshold_uncertainty_score":0.5854583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997392592","doi":"10.1002/ett.4460120412","title":"Using array signal processing to improve rural area coverage for satellite communications services","year":2001,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Nokia (Canada); Queen's University","funders":"","keywords":"Reflector (photography); Payload (computing); Geostationary orbit; Computer science; Interference (communication); Communications satellite; Electronic engineering; Automatic gain control; Antenna (radio); Parabolic antenna; Satellite; Signal processing; Antenna array; Telecommunications; Engineering; Digital signal processing; Optics; Physics; Aerospace engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.04858372184357386,"gpt":0.2802061869938275,"spread":0.2316224651502536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005598865,0.0003886062,0.0003284554,0.0004185556,0.001253648,0.0002908796,0.002483725,0.00009019802,0.00007372284],"category_scores_gemma":[0.00000966285,0.00044675,0.0002029438,0.0009589464,0.0001101,0.0004645144,0.00004461754,0.0005458884,0.0002688965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002784462,"about_ca_system_score_gemma":0.00004684952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003964403,"about_ca_topic_score_gemma":0.0001770661,"domain_scores_codex":[0.9977604,0.0004067583,0.0008315054,0.0002995945,0.0002154328,0.0004863577],"domain_scores_gemma":[0.9951212,0.0004324946,0.0001540717,0.003753775,0.0002935057,0.0002449966],"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.00008730168,0.0006730384,0.0003161638,0.0002702305,0.0002981005,0.000001637688,0.006622274,0.07019596,0.1001341,0.0002904222,0.00005846112,0.8210524],"study_design_scores_gemma":[0.001435452,0.0001940932,0.001745394,0.0007492431,0.000202483,0.00008016168,0.003127145,0.1037047,0.006942259,0.000181933,0.8801455,0.001491537],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006505229,0.005280362,0.9416738,0.0008500538,0.0001956344,0.001646104,0.0002262661,0.001376622,0.04224592],"genre_scores_gemma":[0.9271861,0.006565248,0.06479944,0.000336934,0.00006312445,0.0003150188,0.0001786421,0.0001988141,0.0003566911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9206809,"threshold_uncertainty_score":0.9997984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127914209","doi":"10.1002/ett.1414","title":"Channel code design with causal side information at the encoder","year":2010,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"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":"Channel (broadcasting); Encoder; Binary symmetric channel; Interference (communication); Computer science; Binary erasure channel; Code (set theory); Hamming code; Additive white Gaussian noise; Binary number; Algorithm; Systematic code; Hamming distance; Binary code; Linear code; Decoding methods; Telecommunications; Mathematics; Channel capacity; Code rate; Block code; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01551497879152948,"gpt":0.2238631872448761,"spread":0.2083482084533466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034321,0.0002085594,0.0001189788,0.0001579655,0.0008904793,0.000076112,0.001017931,0.00005539943,0.0001392695],"category_scores_gemma":[0.00002081072,0.0001660116,0.00005462071,0.0003712812,0.0002105517,0.0005227051,0.00002440195,0.001002637,0.0004719553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008562214,"about_ca_system_score_gemma":0.00002115996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009609656,"about_ca_topic_score_gemma":0.0005984121,"domain_scores_codex":[0.99892,0.0002447967,0.0003364583,0.0001159088,0.0001601353,0.0002227258],"domain_scores_gemma":[0.9971137,0.0003659607,0.00008377974,0.002246814,0.0001114941,0.00007826041],"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.00004563631,0.0001847275,0.000007574509,0.00002027839,0.0001326213,0.000001307173,0.002305986,0.853824,0.009202001,0.001018629,0.003318661,0.1299385],"study_design_scores_gemma":[0.0015103,0.000336784,0.002872738,0.0001299982,0.0001584073,0.0002105387,0.0009447258,0.1371483,0.2052177,0.0005332312,0.6493087,0.001628469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009964401,0.00006089526,0.9488429,0.001081568,0.0000807668,0.0004634708,0.00004984016,0.001327007,0.04709707],"genre_scores_gemma":[0.938808,0.0006872673,0.05911861,0.0002661595,0.00001690445,0.0002611063,0.00007181992,0.00008338283,0.0006867023],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9378116,"threshold_uncertainty_score":0.6848937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134740342","doi":"10.1002/ett.944","title":"Effects of user distribution on the delay performance of downlink packet access in 3GPP WCDMA networks","year":2004,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Telecommunications link; Computer network; Computer science; Code division multiple access; Network packet; W-CDMA; Base station; 3rd Generation Partnership Project 2; Cellular network; Channel (broadcasting); Real-time computing","retraction":null,"screen_n_in":null,"score":{"opus":0.01964118721322894,"gpt":0.2646134727734608,"spread":0.2449722855602319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009635388,0.0001772292,0.0002108033,0.0002212471,0.0004253886,0.00008839134,0.004791239,0.00006135466,0.00001465101],"category_scores_gemma":[0.00006708887,0.0001462884,0.0001189108,0.001772411,0.0002523343,0.0004475222,0.0001621279,0.0009412395,0.00003638376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001434192,"about_ca_system_score_gemma":0.000092325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005520519,"about_ca_topic_score_gemma":0.00008481811,"domain_scores_codex":[0.9973108,0.001239089,0.0005735338,0.0002568776,0.0003230787,0.0002966656],"domain_scores_gemma":[0.9950323,0.001446491,0.0002430117,0.003018994,0.000188557,0.00007065302],"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.00006940933,0.002044341,0.0003283433,0.000061781,0.00007709954,0.000002776497,0.0008165125,0.8914623,0.000359734,0.03250797,0.0002050885,0.07206466],"study_design_scores_gemma":[0.005266933,0.001742835,0.4543498,0.00243388,0.00008401922,0.00002771532,0.0001582238,0.4696087,0.05746741,0.001042564,0.00655161,0.001266333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1965294,0.0002182899,0.7961987,0.003893989,0.00008246749,0.0006808772,0.00001586876,0.0001034991,0.002276873],"genre_scores_gemma":[0.9942606,0.002588583,0.00282085,0.0001350597,0.00001152566,0.00008893963,0.00002756931,0.00002282759,0.00004406594],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7977312,"threshold_uncertainty_score":0.8903394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041772334","doi":"10.1002/ett.1245","title":"Channel estimation for chip‐level Alamouti coded multi‐rate CDMA: blind subspace algorithms and performance analysis","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"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":"Space–time block code; Algorithm; Subspace topology; Channel (broadcasting); Code division multiple access; Block code; Computer science; Mathematics; Statistics; Telecommunications; Decoding methods; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07966493314840496,"gpt":0.3228653944428553,"spread":0.2432004612944503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002768295,0.0002651087,0.0002809484,0.0008804176,0.001587892,0.0002909795,0.002258349,0.0000818777,0.0000131923],"category_scores_gemma":[0.00006949323,0.0002828309,0.0001755123,0.002415322,0.000193354,0.0006507408,0.0001078977,0.0006249625,0.00005995835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00010888,"about_ca_system_score_gemma":0.0000634384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003491213,"about_ca_topic_score_gemma":0.0004082434,"domain_scores_codex":[0.9974975,0.0006188158,0.0005908962,0.0005146285,0.0002714989,0.0005066556],"domain_scores_gemma":[0.9952989,0.001083456,0.0002279629,0.002795995,0.0003646415,0.0002290352],"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.0001705147,0.001625831,0.0002439846,0.00005842552,0.000967995,0.000002922769,0.004765293,0.3077749,0.0004150577,0.003148073,0.0001963244,0.6806307],"study_design_scores_gemma":[0.001092287,0.000118099,0.04674892,0.0000250846,0.0001036021,0.000006330752,0.00009974373,0.9496119,0.001065883,0.0000429297,0.0007860498,0.0002991564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006936042,0.0002274457,0.9885449,0.002154062,0.00007127855,0.0006787733,0.00004364002,0.0003039303,0.001039912],"genre_scores_gemma":[0.7007973,0.000738172,0.2973734,0.000110356,0.00001634627,0.00008445157,0.00007939322,0.00003360457,0.0007669552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6938612,"threshold_uncertainty_score":0.9999624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996462199","doi":"10.1002/ett.4460120210","title":"QoS degradation in cellular systems due to H/O hysteresis","year":2001,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Unavailability; Handover; Hysteresis; Degradation (telecommunications); Computer science; Quality of service; Channel (broadcasting); Computer network; Control theory (sociology); Reliability engineering; Engineering; Telecommunications; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02074390585211909,"gpt":0.222419301427861,"spread":0.2016753955757419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003497207,0.0001902399,0.0001836675,0.0005192227,0.0002661623,0.00008378959,0.0008558021,0.00004416757,0.00009804148],"category_scores_gemma":[0.00001657459,0.000218828,0.00007422134,0.0009700406,0.00002717767,0.0001848516,0.00001563069,0.0004055216,0.0009086588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001502774,"about_ca_system_score_gemma":0.00001509648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008339072,"about_ca_topic_score_gemma":0.0003699544,"domain_scores_codex":[0.9985946,0.0003686089,0.0004716622,0.000183813,0.0001193329,0.0002619803],"domain_scores_gemma":[0.9977427,0.0001567789,0.00003661478,0.001877485,0.00005610603,0.0001303215],"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.00004181864,0.00133496,0.0003084432,0.00007153442,0.0001592058,0.00004732207,0.002307278,0.8528959,0.01202385,0.001702473,0.004395443,0.1247118],"study_design_scores_gemma":[0.001941258,0.0002499717,0.02938274,0.0006036966,0.0001182139,0.0001221751,0.001640841,0.1299121,0.005414859,0.00007191802,0.82871,0.001832217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1381657,0.001474024,0.7369466,0.001556983,0.0005679926,0.0009268479,0.00006950415,0.001100829,0.1191916],"genre_scores_gemma":[0.9932599,0.0009171529,0.004358954,0.00007744937,0.0000339716,0.0001340953,0.00005527925,0.00007736924,0.001085813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8550942,"threshold_uncertainty_score":0.9998692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083075517","doi":"10.1002/ett.1092","title":"Gallager bounds on the performance of maximum‐likelihood decoded linear binary block codes in AWGN interference","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Bounding overwatch; Probability of error; Algorithm; Code word; Decoding methods; Binary number; Mathematics; Complement (music); Upper and lower bounds; Additive white Gaussian noise; Code (set theory); Computer science; Discrete mathematics; Statistics; White noise; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.01361835950195664,"gpt":0.229915113640803,"spread":0.2162967541388463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003750162,0.0002252343,0.0002029972,0.0003142167,0.0002918116,0.00002715734,0.001280266,0.00005469387,0.00007328858],"category_scores_gemma":[0.00001511256,0.0002061607,0.00008914609,0.000620321,0.000181017,0.0001573968,0.00002828821,0.0007728292,0.0001002478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001165563,"about_ca_system_score_gemma":0.00002233278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003352376,"about_ca_topic_score_gemma":0.0001975603,"domain_scores_codex":[0.9985111,0.0003460815,0.0005812524,0.0001750251,0.0001402941,0.0002462431],"domain_scores_gemma":[0.9973468,0.0004277856,0.0001020124,0.002003879,0.00008223494,0.00003729676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001006713,0.002121171,0.0006322917,0.000125186,0.0001204431,0.00000378178,0.001338805,0.8886405,0.04396349,0.003219836,0.001145817,0.05858805],"study_design_scores_gemma":[0.002106339,0.001254088,0.04666985,0.001802212,0.000110891,0.00003655741,0.0009165077,0.3883601,0.525683,0.002106096,0.02882442,0.002129975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.810896,0.0005794654,0.116961,0.001210116,0.0000998843,0.0007526535,0.00007719942,0.00129317,0.06813055],"genre_scores_gemma":[0.9845987,0.002047673,0.01293286,0.00006673652,0.00001145804,0.00009868837,0.00002701097,0.00007554951,0.0001413064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5002804,"threshold_uncertainty_score":0.8406988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978489006","doi":"10.1002/ett.1210","title":"Cohen–Merhav bounds on the symbol error rate of uncoded signalling in AWGN interference","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Additive white Gaussian noise; Algorithm; Mathematics; Upper and lower bounds; Computer science; Bounding overwatch; Channel (broadcasting); Interference (communication); Range (aeronautics); Signalling; Bernoulli's principle; Statistics; Telecommunications; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03098477789728476,"gpt":0.2657665337224378,"spread":0.234781755825153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126036,0.0002130699,0.0002033803,0.0003595272,0.0002750263,0.00002975276,0.0013601,0.00005295633,0.00009913088],"category_scores_gemma":[0.000051291,0.0001968407,0.00009477434,0.0007215007,0.0001817128,0.0001397021,0.00002186948,0.0009662725,0.00007148235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001463695,"about_ca_system_score_gemma":0.00001982265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002346268,"about_ca_topic_score_gemma":0.0002864308,"domain_scores_codex":[0.9983476,0.0004574498,0.0006537741,0.0001709004,0.0001126151,0.0002576799],"domain_scores_gemma":[0.9967411,0.001201051,0.000117374,0.001793657,0.00008937757,0.00005750101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002022268,0.001843699,0.0001641288,0.0001128151,0.0002934471,0.000009121988,0.009300261,0.6589537,0.1249593,0.02316977,0.0005917726,0.1803997],"study_design_scores_gemma":[0.00203471,0.0007587103,0.01385486,0.00199594,0.0001230571,0.00001913384,0.006176256,0.09552883,0.8526309,0.00407093,0.02073865,0.002067983],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05529193,0.0002340166,0.902465,0.00074447,0.00007681645,0.0004788083,0.00002607859,0.0006961641,0.03998666],"genre_scores_gemma":[0.9899362,0.0008645118,0.008761631,0.0001489879,0.000008314452,0.00005687088,0.00001522693,0.00007484418,0.000133438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9346442,"threshold_uncertainty_score":0.8026932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138962228","doi":"10.1002/ett.905","title":"An efficient approach to lattice-based fixed-rate entropy-coded vector quantization","year":2003,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"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":"Vector quantization; Lattice (music); Mathematics; Algorithm; Applied mathematics; Computer science; Mathematical optimization; Statistical physics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02607085722236873,"gpt":0.2755331612221131,"spread":0.2494623039997444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007346408,0.0002541335,0.000184876,0.000390928,0.0008183768,0.0002396084,0.002346799,0.00004641814,0.00004663819],"category_scores_gemma":[0.00008722733,0.0002597577,0.00009210822,0.001197667,0.00006401289,0.0004193092,0.00003004856,0.0003965172,0.0002899416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001059205,"about_ca_system_score_gemma":0.00008158426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007798196,"about_ca_topic_score_gemma":0.00000529189,"domain_scores_codex":[0.9965395,0.001815367,0.0004369314,0.0006122618,0.0002556067,0.0003402915],"domain_scores_gemma":[0.9953087,0.0002488254,0.0001438842,0.003863931,0.0001778423,0.0002568409],"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.00002997475,0.004695419,0.00001421533,0.00002063509,0.00003791387,0.000003116728,0.00108361,0.7471703,0.01959485,0.2004073,0.0006355263,0.02630706],"study_design_scores_gemma":[0.001278599,0.0006039351,0.002160802,0.0001122437,0.00005102342,0.00001679559,0.0001483564,0.7954034,0.129408,0.0006472019,0.06893555,0.001234174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000791693,0.00003123354,0.9875856,0.0005699853,0.0001100723,0.0005566603,0.00003836477,0.001201013,0.009115377],"genre_scores_gemma":[0.5118911,0.00001472503,0.4874024,0.0004588062,0.000006477824,0.00007536211,0.00004203704,0.00003288448,0.00007624091],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5110993,"threshold_uncertainty_score":0.9999855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056846689","doi":"10.1002/ett.4460110402","title":"Service Quality Control in Multimedia Wireless Networks","year":2000,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Opera; Queen (butterfly); Citation; Library science; Service (business); Telecommunications; Art; Engineering; Art history; Computer science; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.02238112790349524,"gpt":0.2720731873445228,"spread":0.2496920594410276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008839537,0.0002039356,0.000232607,0.0001276803,0.000428357,0.0001568954,0.002085152,0.00006719069,0.0003853001],"category_scores_gemma":[0.000005747765,0.0002126395,0.0001018844,0.001064744,0.00005597714,0.0003738715,0.00001684355,0.0007215587,0.0005477361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005822262,"about_ca_system_score_gemma":0.00004203067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002372361,"about_ca_topic_score_gemma":0.0007863336,"domain_scores_codex":[0.9969971,0.001524058,0.000554835,0.0003777032,0.0001746334,0.0003716298],"domain_scores_gemma":[0.9970277,0.0005965623,0.00009643108,0.002064944,0.00007650487,0.0001378347],"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.000030947,0.0005378317,0.0001037699,0.000006399482,0.00002361123,0.000004076142,0.0006020665,0.1807395,0.00002953631,0.0008638123,0.0001932284,0.8168652],"study_design_scores_gemma":[0.001979157,0.00007833003,0.02689771,0.0001053094,0.0000100004,0.000008377855,0.00004062602,0.9396427,0.00003948143,0.0001283593,0.03062021,0.0004497658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0025038,0.00009438367,0.9723755,0.004080734,0.00009256371,0.001748861,0.00001336372,0.0003860371,0.01870474],"genre_scores_gemma":[0.9815446,0.0002937788,0.01442251,0.002554246,0.00004504032,0.0007029487,0.00001234639,0.00003289859,0.0003916369],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9790408,"threshold_uncertainty_score":0.8671186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072629980","doi":"10.1002/ett.1249","title":"Efficient resource management for packet mode cdma2000","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"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":"CDMA2000; Computer science; Computer network; Network packet; Throughput; Wireless; Scheduling (production processes); Real-time computing; Telecommunications; Code division multiple access; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01040498863930278,"gpt":0.2381369657511266,"spread":0.2277319771118239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003178526,0.0001675942,0.0001088381,0.0002118092,0.0004027223,0.00002707929,0.0003838641,0.00003470108,0.00003894644],"category_scores_gemma":[0.000003803308,0.0001965714,0.00008856096,0.0004057687,0.00004323804,0.00004155971,0.000006705881,0.0002360477,0.00009843184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001340295,"about_ca_system_score_gemma":0.000003649245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001262023,"about_ca_topic_score_gemma":0.0000181459,"domain_scores_codex":[0.9990069,0.00006385154,0.0003292984,0.0001807174,0.0001097987,0.0003094748],"domain_scores_gemma":[0.9987376,0.0001868841,0.00004019076,0.0009071863,0.00003997716,0.0000881294],"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.00001495272,0.00009833863,5.957149e-7,0.00001701016,0.00003903716,8.496036e-7,0.0001774128,0.9146939,0.00005616587,0.0006444314,0.0005344661,0.08372282],"study_design_scores_gemma":[0.000845845,0.00005640467,0.0003444741,0.00007042806,0.00007060351,0.000005416225,0.0003965296,0.773072,0.001596957,0.00006712422,0.2230316,0.0004426348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009439107,0.0001212888,0.8861182,0.00009641844,0.00009142537,0.0004474176,0.00003471095,0.0006970693,0.1114495],"genre_scores_gemma":[0.8285117,0.0002966114,0.1695738,0.00009353363,0.00004096653,0.00007116298,0.00008923135,0.0001228645,0.001200237],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8275677,"threshold_uncertainty_score":0.8015949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082166804","doi":"10.1002/ett.4460110204","title":"Analysis of a Dual‐Rate Transmission Scheme for Gaussian Broadcast Channels","year":2000,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Transmission (telecommunications); Computer science; Channel (broadcasting); Transmitter; Gaussian; Broadcasting (networking); Distortion (music); Electronic engineering; Telecommunications; Algorithm; Computer network; Bandwidth (computing); Engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02531960938771341,"gpt":0.2880791669804673,"spread":0.2627595575927539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004686043,0.0001994655,0.0003002645,0.0006159669,0.0005083299,0.00007555648,0.001733251,0.00004606976,0.0004637278],"category_scores_gemma":[0.00001292918,0.0001950743,0.0003133058,0.00188024,0.00008773669,0.0005110592,0.00002228148,0.0002635715,0.00005100182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003241894,"about_ca_system_score_gemma":0.00003356704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001261872,"about_ca_topic_score_gemma":0.000005366171,"domain_scores_codex":[0.9981695,0.000444646,0.0005430873,0.0004239018,0.0001660037,0.0002529056],"domain_scores_gemma":[0.9967524,0.0003171625,0.0001551695,0.002526425,0.0001190958,0.000129713],"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.00003895557,0.0007278714,0.000003263655,0.00001513955,0.0003537818,0.000001547814,0.0008421604,0.02042665,0.005085138,0.002275973,0.0003929274,0.9698366],"study_design_scores_gemma":[0.00135338,0.0005887965,0.001905825,0.0002257827,0.0006133224,0.0000128306,0.00008238129,0.4648912,0.05077108,0.001239758,0.4773584,0.0009572523],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005168431,0.0001298791,0.9909369,0.001164836,0.00003180903,0.0003721706,0.0001412214,0.0004620445,0.006244331],"genre_scores_gemma":[0.461415,0.0009503128,0.5355265,0.0002315098,0.00001175415,0.0001108457,0.0001147064,0.00003761861,0.001601727],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9688793,"threshold_uncertainty_score":0.7954898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054100090","doi":"10.1002/ett.1170","title":"On the effects of interpolator window shape and symbol location on the BER of diversity PSAM 16‐QAM","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"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":"Sinc function; Symbol (formal); Quadrature amplitude modulation; Window (computing); QAM; Bit error rate; Modulation (music); Computer science; Window function; Algorithm; Mathematics; Telecommunications; Channel (broadcasting); Physics; Acoustics; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.01257279118327221,"gpt":0.2237774599668824,"spread":0.2112046687836102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514948,0.000159324,0.0001469322,0.0001706078,0.0005092412,0.00001309685,0.0009137321,0.00004330615,0.00003883632],"category_scores_gemma":[0.0001125751,0.0001206907,0.0000745581,0.0003978847,0.0002431148,0.00009104567,0.0000546396,0.000555047,0.00001825489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008194371,"about_ca_system_score_gemma":0.000007914799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001588892,"about_ca_topic_score_gemma":0.00004454164,"domain_scores_codex":[0.9989385,0.0003222809,0.0003263467,0.0001223074,0.0001539215,0.0001366432],"domain_scores_gemma":[0.9954974,0.002587223,0.0001226084,0.001652979,0.00009785763,0.00004194586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004015665,0.003977339,0.0007161252,0.0007841568,0.001345524,0.000003206768,0.02358244,0.02858305,0.07807995,0.1763547,0.003066378,0.6831056],"study_design_scores_gemma":[0.001697761,0.001527574,0.06899166,0.002202745,0.0003287819,0.00001312318,0.004987565,0.01482882,0.8969869,0.003100402,0.004139063,0.001195621],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5484299,0.0005636047,0.4264064,0.001571951,0.0001232476,0.001248248,0.0000373084,0.0005607025,0.02105871],"genre_scores_gemma":[0.9975111,0.0007302543,0.001452206,0.0001730187,0.000006543985,0.0000265313,0.000006357577,0.00003988149,0.00005407657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8189069,"threshold_uncertainty_score":0.4921623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109823664","doi":"10.1002/ett.1253","title":"Wireless signal‐preamble assisted Mach–Zehnder modulator bias stabilisation in wireless signal transmission over optical fibre","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Photorefractive and Nonlinear Optics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Calgary","funders":"","keywords":"Electro-optic modulator; SIGNAL (programming language); Lithium niobate; Mach–Zehnder interferometer; DC bias; Electronic engineering; Computer science; Pilot signal; Transmission (telecommunications); Preamble; Intermodulation; Bit error rate; Telecommunications; Optical modulator; Physics; Optics; Channel (broadcasting); Electrical engineering; Engineering; Phase modulation; Interferometry; Bandwidth (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.03224614710478685,"gpt":0.2807612522664918,"spread":0.2485151051617049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007510397,0.000312059,0.0002854324,0.0002899432,0.0004598271,0.00008450312,0.000494299,0.00008669979,0.001338466],"category_scores_gemma":[0.000003715196,0.0003169318,0.0002174807,0.0006218902,0.0001346553,0.0003431597,0.00001635445,0.0009082966,0.0001182366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001484622,"about_ca_system_score_gemma":0.0001029263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002066482,"about_ca_topic_score_gemma":0.00009807814,"domain_scores_codex":[0.9977266,0.0004589039,0.0006717539,0.000405295,0.0002970241,0.0004404691],"domain_scores_gemma":[0.998089,0.00057581,0.000162733,0.0008251289,0.0001280519,0.0002192867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006061459,0.009377767,0.006636856,0.00005588355,0.0004033831,0.00001876297,0.003085804,0.005093143,0.2019395,0.003107824,0.0002301066,0.7694448],"study_design_scores_gemma":[0.009027692,0.0009515025,0.2514416,0.0006996867,0.0004847712,0.00002068784,0.004165026,0.1161676,0.5885372,0.001333561,0.02408249,0.003088266],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5619462,0.00002423374,0.4223135,0.000177685,0.0000464964,0.0003484386,0.00008869624,0.00008639832,0.01496839],"genre_scores_gemma":[0.9937523,0.00003181465,0.005259843,0.00007382536,0.00009019248,0.00002748123,0.0002319128,0.00008454023,0.0004480741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7663566,"threshold_uncertainty_score":0.9999283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043859521","doi":"10.1002/ett.1133","title":"The input–output weight enumeration of binary Hamming codes","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"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":"České Vysoké Učení Technické v Praze","keywords":"Hamming(7,4); Hamming graph; Hamming bound; Hamming code; Antipodal point; Hamming weight; Linear code; Algorithm; Hamming distance; Hamming space; Mathematics; Block code; Enumeration; Coding gain; Binary number; Discrete mathematics; Computer science; Decoding methods; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.009488280066091774,"gpt":0.2174941328018628,"spread":0.208005852735771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003061579,0.0001671056,0.0001400996,0.0001656759,0.0007970898,0.00004690385,0.000881014,0.00004169478,0.00002221039],"category_scores_gemma":[0.00001366583,0.0001539124,0.00009622263,0.0004117326,0.0001855403,0.0001960421,0.00001690205,0.0004278421,0.00005738551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007857249,"about_ca_system_score_gemma":0.00001546666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002546251,"about_ca_topic_score_gemma":0.00011074,"domain_scores_codex":[0.9987229,0.0003131514,0.0005170574,0.0001236157,0.000138801,0.0001845292],"domain_scores_gemma":[0.9976248,0.0004425774,0.0001086833,0.0016858,0.0001041905,0.00003395105],"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.0000292109,0.0006733356,0.0001132033,0.00005976398,0.0001789125,0.000001859403,0.0008680941,0.4850197,0.05429239,0.01899129,0.004806629,0.4349657],"study_design_scores_gemma":[0.001012538,0.0002321214,0.01230819,0.0002965937,0.0001302425,0.00002381692,0.0006030066,0.07386474,0.3080297,0.00253998,0.5997542,0.001204921],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009205408,0.002091244,0.9294428,0.0009149972,0.0001310741,0.0004007283,0.00004723566,0.001468746,0.05629776],"genre_scores_gemma":[0.9694463,0.003367245,0.02637605,0.00002317971,0.00002375696,0.00007334572,0.00005212527,0.00006869531,0.0005692792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9602409,"threshold_uncertainty_score":0.6276364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056853597","doi":"10.1002/ett.1114","title":"A new MAP‐based channel estimation technique for multiple input multiple output diversity schemes","year":2006,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"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":"Channel (broadcasting); Computer science; Algorithm; Maximum a posteriori estimation; Intersymbol interference; A priori and a posteriori; Transmission (telecommunications); Diversity combining; Coding (social sciences); Antenna diversity; Maximum likelihood; Mathematics; Telecommunications; Wireless; Statistics; Fading","retraction":null,"screen_n_in":null,"score":{"opus":0.02217296810069358,"gpt":0.2360075648952604,"spread":0.2138345967945668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002589573,0.0002946737,0.0002203562,0.000373548,0.001023977,0.00005565626,0.00105967,0.00009963038,0.00002696666],"category_scores_gemma":[0.00004728864,0.0003609049,0.0001822806,0.0003909869,0.00007934883,0.0003144438,0.00004951576,0.0004761424,0.0000741828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002116323,"about_ca_system_score_gemma":0.00003458441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001171434,"about_ca_topic_score_gemma":0.0002254945,"domain_scores_codex":[0.9986582,0.0001649179,0.0004587346,0.0002630031,0.0001555791,0.0002996001],"domain_scores_gemma":[0.9973974,0.0005297594,0.0001146027,0.001723735,0.0001321005,0.000102401],"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.00004852119,0.0005490855,0.00009984356,0.0001073513,0.00007296672,8.734752e-7,0.000272579,0.9158669,0.008726718,0.0006536776,0.006297172,0.06730429],"study_design_scores_gemma":[0.002105336,0.0001496519,0.001638895,0.0002112518,0.00008837509,0.000005115613,0.00007837451,0.7122871,0.2114519,0.001986984,0.06898288,0.001014139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000258028,0.0001881649,0.9928453,0.000587706,0.00007350498,0.001226335,0.0001522191,0.002439587,0.002229183],"genre_scores_gemma":[0.5902311,0.0000678707,0.4087671,0.00004498902,0.00002044687,0.000299201,0.0002170733,0.00007990613,0.0002722556],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5899731,"threshold_uncertainty_score":0.9998843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998932429","doi":"10.1002/ett.1279","title":"Novel DLC model for QoS enhancement of bursty VBR traffic in wireless ATM networks","year":2008,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"DOD Prostate Cancer Research Program","keywords":"Variable bitrate; Computer science; Quality of service; Computer network; Wireless; Asynchronous Transfer Mode; Data transmission; Transmission (telecommunications); Constant bitrate; Real-time computing; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03266858112907921,"gpt":0.2385318876509543,"spread":0.2058633065218751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003962688,0.000190247,0.0002450614,0.0001804399,0.0004356698,0.00002810503,0.001370483,0.00005290144,0.00001226628],"category_scores_gemma":[0.000008678341,0.0002045019,0.0001635009,0.0005505304,0.0001175974,0.0002180833,0.00002033744,0.0003493128,0.00001597045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006631498,"about_ca_system_score_gemma":0.0001054223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007960662,"about_ca_topic_score_gemma":0.0001090001,"domain_scores_codex":[0.9984537,0.0001873361,0.0005604292,0.000344392,0.0001433955,0.00031073],"domain_scores_gemma":[0.9979672,0.0003256117,0.0001616089,0.001318027,0.0001339451,0.00009362392],"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.00002336163,0.0009059983,0.000004045781,0.000005484957,0.00003165269,7.839719e-7,0.0007417078,0.8025695,0.0002111048,0.003910498,0.000201249,0.1913946],"study_design_scores_gemma":[0.001126198,0.0001066977,0.0002299381,0.00004310981,0.0000156787,0.000008645588,0.00002293913,0.9972413,0.0001520479,0.0000195212,0.0008384695,0.0001954289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009438112,0.0001575343,0.9873006,0.001019511,0.0001592147,0.0005091957,0.00001524534,0.0001586704,0.001241861],"genre_scores_gemma":[0.9275837,0.0006593871,0.07062992,0.0002139856,0.00003225962,0.0001516224,0.0000142014,0.00002705893,0.0006878554],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9181456,"threshold_uncertainty_score":0.8339345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}