{"meta":{"query_hash":"7e8552bd3650","filters":{"venue":"IEEE Communications Letters"},"cohort_total":608,"direct_labels_cover":0,"predictions_cover":608,"exported":608,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7e8552bd3650","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Communications+Letters"},"results":[{"id":"W1581295754","doi":"10.1109/lcomm.2015.2454502","title":"Centralized Adaptation for Parameter Estimation Over Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fading; Computer science; Fusion center; Wireless sensor network; Wireless; Path loss; Noise (video); Channel state information; Algorithm; Wireless network; Channel (broadcasting); Estimation theory; Computer network; Real-time computing; Telecommunications; Artificial intelligence; Cognitive radio","score_opus":0.0693899245847688,"score_gpt":0.29852332739026877,"score_spread":0.22913340280549999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581295754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03917583,0.00009473885,0.9585518,0.00063794805,0.00022993969,0.00044152178,0.000017541071,0.00077951275,0.00007113901],"genre_scores_gemma":[0.5729685,0.000046528483,0.4263571,0.0002372461,0.000034526256,0.00022281361,0.000087484405,0.000036158654,0.000009693516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993031,0.00005366062,0.00022746476,0.000118121,0.00009171157,0.00020591539],"domain_scores_gemma":[0.9986741,0.0002433492,0.000058413138,0.00088911696,0.00006790739,0.00006709502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013221455,0.00014009218,0.00013874462,0.00007372475,0.00007797366,0.000038687158,0.0003861034,0.0000619425,0.000001921882],"category_scores_gemma":[0.000048381415,0.00015987431,0.000053344233,0.00012929598,0.000072981406,0.0002628916,0.000036907302,0.00015063059,0.0000066609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017409433,0.000019435038,0.000040930732,0.000016575805,0.00003421519,3.902045e-7,0.00036674994,0.96809477,0.011262062,0.00070689915,0.008732786,0.010707809],"study_design_scores_gemma":[0.00036164394,0.000014468648,0.0001191568,0.00003339205,0.000017199656,0.0000020408258,0.000030337178,0.9894948,0.0021842828,0.00052443426,0.007031043,0.00018722701],"about_ca_topic_score_codex":0.000013047257,"about_ca_topic_score_gemma":0.000010772907,"teacher_disagreement_score":0.5337926,"about_ca_system_score_codex":0.0001784859,"about_ca_system_score_gemma":0.000007954197,"threshold_uncertainty_score":0.6519485},"labels":[],"label_agreement":null},{"id":"W1607978590","doi":"10.1109/lcomm.2015.2430346","title":"Coverage Probability Analysis of Heterogeneous Cellular Networks in Rician/Rayleigh Fading Environments","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rician fading; Rayleigh fading; Fading; Fading distribution; Rayleigh scattering; Computer science; Algorithm; Statistics; Mathematics; Telecommunications; Physics","score_opus":0.026142346547165712,"score_gpt":0.23070965902974291,"score_spread":0.2045673124825772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607978590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36683083,0.00049466366,0.6320407,0.000054452634,0.00008563456,0.00022826673,0.000008986397,0.000054086264,0.0002024158],"genre_scores_gemma":[0.99215156,0.00012167068,0.0074877306,0.000060576564,0.000011133147,0.00005469562,0.000084787935,0.000023097962,0.000004775035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990152,0.00014056331,0.0004241765,0.00014123107,0.000107668864,0.0001711266],"domain_scores_gemma":[0.99835277,0.00008956003,0.00009795046,0.0013878958,0.00001744091,0.00005441494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023467951,0.00012504567,0.0002659325,0.00025710967,0.00003644628,0.000011833716,0.00047379942,0.00006349114,0.0000036180897],"category_scores_gemma":[0.000019919993,0.00015030625,0.00007511346,0.00077988056,0.0000708716,0.00014258169,0.00006692041,0.00015764606,0.0000047577573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021826265,0.00003571857,0.0058819116,0.00000797075,0.00013333463,0.0000010467621,0.00034260112,0.98414767,0.009141792,0.000009623095,0.000035007044,0.00026113962],"study_design_scores_gemma":[0.00024339641,0.0000072968164,0.0008306534,0.000018897403,0.000122933,6.934813e-7,0.00002601042,0.9962455,0.0019676252,0.000037979597,0.00033289625,0.00016614379],"about_ca_topic_score_codex":0.00004915777,"about_ca_topic_score_gemma":0.00010058637,"teacher_disagreement_score":0.6253207,"about_ca_system_score_codex":0.00034104934,"about_ca_system_score_gemma":0.0000053528333,"threshold_uncertainty_score":0.6129311},"labels":[],"label_agreement":null},{"id":"W1633543472","doi":"10.1109/lcomm.2015.2466105","title":"Approximations for Performance of Energy Detector and <inline-formula> <tex-math notation=\"LaTeX\">$p$</tex-math></inline-formula>-Norm Detector","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Detector; Notation; Norm (philosophy); Mathematics; Gaussian; Energy (signal processing); Algorithm; Discrete mathematics; Applied mathematics; Combinatorics; Computer science; Statistics; Physics; Arithmetic; Quantum mechanics; Telecommunications","score_opus":0.028571767317922075,"score_gpt":0.2509157894916799,"score_spread":0.22234402217375784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1633543472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44637892,0.0010041393,0.54544014,0.00376604,0.001033306,0.0010754745,0.00033413916,0.00056973915,0.00039811057],"genre_scores_gemma":[0.88067275,0.00051453715,0.11622592,0.0010692914,0.0002848062,0.0005156939,0.00034480117,0.00009103928,0.0002811374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955068,0.0002792242,0.001535301,0.0008812329,0.00087147905,0.0009259115],"domain_scores_gemma":[0.9928057,0.00086383615,0.00094244815,0.0038061566,0.0010814787,0.00050035736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001076133,0.0007095963,0.0008200198,0.00060849276,0.0011191723,0.00047611792,0.0030950762,0.0003470184,0.0000075700564],"category_scores_gemma":[0.00027352144,0.0006918353,0.00035239392,0.0016443429,0.00049306895,0.001579823,0.00070072256,0.00051237945,0.000055432014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084401725,0.0030115808,0.00094512664,0.0011534448,0.001811638,0.000031584426,0.009472656,0.10266939,0.2526369,0.17503804,0.032235123,0.4201505],"study_design_scores_gemma":[0.002000393,0.00043730665,0.00054222706,0.000118621145,0.0001037875,0.000075707496,0.00003772176,0.9005423,0.007948401,0.00037652193,0.08701565,0.0008013419],"about_ca_topic_score_codex":0.000054633816,"about_ca_topic_score_gemma":0.00031276775,"teacher_disagreement_score":0.79787296,"about_ca_system_score_codex":0.00034991672,"about_ca_system_score_gemma":0.00026297127,"threshold_uncertainty_score":0.99955326},"labels":[],"label_agreement":null},{"id":"W1670070241","doi":"10.1109/lcomm.2015.2465381","title":"A Novel Interference Alignment Scheme With a Full-Duplex MIMO Relay","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Relay; Computer science; Interference (communication); MIMO; Scheme (mathematics); Interference alignment; Channel (broadcasting); Computer network; Telecommunications; Electronic engineering; Engineering; Mathematics","score_opus":0.05737803414766571,"score_gpt":0.25673869576924047,"score_spread":0.19936066162157476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670070241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8515767,0.0010319689,0.12605667,0.01689029,0.00028087833,0.0006128971,0.00005077783,0.0011299817,0.0023698318],"genre_scores_gemma":[0.84866303,0.00016802133,0.14981529,0.0007165326,0.00003458613,0.00037672065,0.00007814983,0.0000754811,0.000072178154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985752,0.00009836833,0.0004295269,0.00024060624,0.00027794833,0.00037835338],"domain_scores_gemma":[0.99459994,0.00021747548,0.000095399606,0.0047143223,0.00015163155,0.00022121448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025142013,0.00029838478,0.00025751596,0.00018815241,0.00020715591,0.000102927595,0.0026350562,0.00008838645,0.000017342447],"category_scores_gemma":[0.000048349968,0.00029882896,0.00006756228,0.00053728936,0.00035846923,0.0003108299,0.00035857156,0.0005878692,0.00023822316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003454788,0.00029812535,0.00040276544,0.00003580549,0.00025430205,0.0000032347332,0.0035049568,0.59200567,0.37672213,0.0021455905,0.023690013,0.00090287306],"study_design_scores_gemma":[0.0019386673,0.00012341813,0.00048716812,0.00030701488,0.00007859819,0.00012485869,0.0010554779,0.93061686,0.0044272225,0.000005537499,0.05984721,0.0009879865],"about_ca_topic_score_codex":0.00012114984,"about_ca_topic_score_gemma":0.00040908306,"teacher_disagreement_score":0.3722949,"about_ca_system_score_codex":0.00038192354,"about_ca_system_score_gemma":0.00006765211,"threshold_uncertainty_score":0.99994636},"labels":[],"label_agreement":null},{"id":"W1678592670","doi":"10.1109/lcomm.2015.2457435","title":"On a Cognitive Radio Network's Random Access Game With a Poisson Number of Secondary Users","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Cognitive radio; Random access; Computer science; Throughput; Poisson distribution; Game theory; Population; Mathematical optimization; Computer network; Mathematics; Telecommunications; Statistics; Wireless; Mathematical economics","score_opus":0.0372451387084025,"score_gpt":0.2958909741228665,"score_spread":0.258645835414464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678592670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47827494,0.0004017106,0.49606088,0.0121760005,0.00035893754,0.0006250803,0.000012007333,0.00019740468,0.011893042],"genre_scores_gemma":[0.9853554,0.00007944927,0.010414015,0.003968709,0.00008969047,0.00002823514,0.000015600603,0.000022965014,0.00002597448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982876,0.00042630362,0.00030209316,0.00032483015,0.00031037506,0.0003487661],"domain_scores_gemma":[0.9967827,0.0010797728,0.000244401,0.0015086618,0.00023029945,0.00015412935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444142,0.00020676324,0.0003323156,0.00010921665,0.0001734075,0.0001986011,0.0017315645,0.000052495594,0.000009015142],"category_scores_gemma":[0.00005465147,0.00018632076,0.00009104464,0.00075735897,0.00032276483,0.00059165165,0.00029803163,0.00042443216,0.000024060011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007780142,0.003703866,0.053159315,0.00023854397,0.0046144016,0.00067310885,0.045503493,0.104092404,0.0032451318,0.13021201,0.26789978,0.37887782],"study_design_scores_gemma":[0.08468286,0.0024495742,0.048548084,0.007654362,0.0011123553,0.0021945832,0.001889664,0.7787229,0.0072577368,0.029764181,0.02859555,0.007128177],"about_ca_topic_score_codex":0.00012211682,"about_ca_topic_score_gemma":0.00013492082,"teacher_disagreement_score":0.67463046,"about_ca_system_score_codex":0.000092284004,"about_ca_system_score_gemma":0.0001431568,"threshold_uncertainty_score":0.759794},"labels":[],"label_agreement":null},{"id":"W1818073027","doi":"10.1109/lcomm.2015.2430330","title":"An Improved Energy Detector Using Outdated Channel State Information","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Channel state information; Rayleigh fading; Fading; Detector; Computer science; Algorithm; Energy (signal processing); Scheduling (production processes); Channel (broadcasting); Probability density function; Electronic engineering; Real-time computing; Wireless; Telecommunications; Mathematical optimization; Mathematics; Statistics; Engineering","score_opus":0.041053858197802204,"score_gpt":0.2666897636666587,"score_spread":0.22563590546885648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1818073027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07843214,0.00006532285,0.9180541,0.0026366787,0.00032905495,0.00009993802,0.000005455736,0.00021990335,0.00015741197],"genre_scores_gemma":[0.9555117,0.000026689555,0.04108522,0.0032653688,0.00005767763,0.000008070992,0.00003127478,0.0000102395425,0.0000037537457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989284,0.00021136661,0.00027758846,0.00015982542,0.000157247,0.0002655604],"domain_scores_gemma":[0.9976623,0.0000632594,0.00015908277,0.0017536653,0.00020261471,0.0001591016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768446,0.0001343993,0.00012797244,0.00018954407,0.00026781007,0.0003473913,0.0013509992,0.00003784838,6.0854074e-7],"category_scores_gemma":[0.000021858936,0.00014219493,0.000040657575,0.00048095072,0.00008282582,0.0020072395,0.00020038473,0.00015675716,0.0000109173325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009632417,0.00046911748,0.00028336435,0.000021590771,0.00027370822,0.000020292277,0.023749318,0.09290444,0.32583877,0.005986162,0.0061169844,0.54423994],"study_design_scores_gemma":[0.0003213718,0.000037202128,0.00010576822,0.00001259957,0.0000066477396,0.000017182612,0.0000605685,0.99344087,0.0025947094,0.00032210897,0.0028831982,0.00019777646],"about_ca_topic_score_codex":0.0005889562,"about_ca_topic_score_gemma":0.00019704942,"teacher_disagreement_score":0.9005364,"about_ca_system_score_codex":0.00014874959,"about_ca_system_score_gemma":0.000079462065,"threshold_uncertainty_score":0.5798541},"labels":[],"label_agreement":null},{"id":"W1965053718","doi":"10.1109/lcomm.2014.2314679","title":"On the Use of Photon Arrival-Times for Non-Line-of-Sight Solar-Blind UV Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Non-line-of-sight propagation; Channel (broadcasting); Photon; Physics; Keying; Modulation (music); Computer science; Line-of-sight; Optics; Line (geometry); Telecommunications; Computational physics; Mathematics; Acoustics; Wireless; Astrophysics","score_opus":0.07672272058754137,"score_gpt":0.2726960101062848,"score_spread":0.19597328951874343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965053718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492605,0.00027063768,0.21290268,0.0337398,0.0003507587,0.0015013528,0.000074402844,0.0006266614,0.0012731937],"genre_scores_gemma":[0.97007304,0.00030895785,0.02889379,0.00036827,0.000015428028,0.00025929307,0.000020419098,0.000038543127,0.000022266524],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904937,0.000097579716,0.00042062945,0.00011546157,0.00013010444,0.0001868469],"domain_scores_gemma":[0.99258125,0.0032622807,0.0001371803,0.003884394,0.0001064006,0.000028524688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002767465,0.00016080587,0.00025359643,0.00016516056,0.00014828391,0.000033836743,0.0021235107,0.00010440024,0.000010203826],"category_scores_gemma":[0.0004201796,0.00013156305,0.00012092193,0.0002788195,0.0004270175,0.0001254985,0.00019094005,0.00031942778,0.000014956026],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012597033,0.00062512176,0.00019153485,0.00036231568,0.00060484215,2.236163e-7,0.0017289873,0.25356108,0.5347636,0.13737433,0.043395404,0.027266614],"study_design_scores_gemma":[0.00054446846,0.00008767737,0.00006022712,0.00016397978,0.000033664815,6.412071e-7,0.00007023987,0.5762539,0.39790514,0.0020070237,0.022620454,0.0002525695],"about_ca_topic_score_codex":0.000012245705,"about_ca_topic_score_gemma":0.000006769282,"teacher_disagreement_score":0.3226928,"about_ca_system_score_codex":0.00003194142,"about_ca_system_score_gemma":0.000008601171,"threshold_uncertainty_score":0.53649855},"labels":[],"label_agreement":null},{"id":"W1968941631","doi":"10.1109/lcomm.2012.111612.121860","title":"Multi-Ring ERP Network Design: A Traffic Engineering Approach","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network planning and design; Computer network; Ethernet flow control; Ethernet; Network switch; Bandwidth (computing); Distributed computing","score_opus":0.05004710720158148,"score_gpt":0.2454693222463814,"score_spread":0.19542221504479992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968941631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033395505,0.0017836428,0.99035966,0.003027204,0.00055801804,0.0002732085,4.5457807e-7,0.0005414804,0.00011675597],"genre_scores_gemma":[0.5332185,0.00003657504,0.4655207,0.00090035476,0.00018595593,0.00010450908,0.000002442296,0.000012775836,0.000018169138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985742,0.00022466223,0.00026478575,0.00021923883,0.00015712564,0.0005599706],"domain_scores_gemma":[0.9973267,0.00037299018,0.00008701042,0.0020192887,0.0000343133,0.00015974231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064735196,0.00018241645,0.00017580282,0.000087650355,0.00032548187,0.00013095111,0.0023318068,0.00006202502,0.0000020832335],"category_scores_gemma":[0.00002004766,0.00019275339,0.00008621968,0.0005030248,0.00006261908,0.0005491337,0.00023076894,0.00034537105,0.00006482302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021905682,0.0001430072,0.0000991927,0.0000057822813,0.000049431612,6.943685e-7,0.0008073053,0.94070745,0.0010312013,0.004058466,0.0038162246,0.049279045],"study_design_scores_gemma":[0.00030038375,0.0000063857506,0.00040375613,0.000020306485,0.0000150819615,0.000016418173,0.00001113349,0.99091405,0.000019721188,0.0000021743458,0.008064023,0.00022656073],"about_ca_topic_score_codex":0.0000029961284,"about_ca_topic_score_gemma":0.0000012576448,"teacher_disagreement_score":0.529879,"about_ca_system_score_codex":0.00006469056,"about_ca_system_score_gemma":0.000024075744,"threshold_uncertainty_score":0.7860255},"labels":[],"label_agreement":null},{"id":"W1977639277","doi":"10.1109/lcomm.2014.2328588","title":"Rate Optimization for Hybrid SC-FDE/OFDM Decode-and-Forward MIMO Relay Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Precoding; MIMO; Computer science; Orthogonal frequency-division multiplexing; SC-FDE; Relay; Equalization (audio); Bit error rate; Transmitter power output; Multiplexing; Spatial multiplexing; Mathematics; Beamforming; Algorithm; Power (physics); Telecommunications; Decoding methods; Transmitter; Channel (broadcasting)","score_opus":0.03796078662537239,"score_gpt":0.27635513077312385,"score_spread":0.23839434414775146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977639277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023020052,0.0012761375,0.9731381,0.021398509,0.00039833208,0.00054104713,0.000006827438,0.0002463621,0.000692668],"genre_scores_gemma":[0.7332166,0.002320856,0.25995603,0.0038773282,0.00007925216,0.0003560968,0.000069511174,0.000027865082,0.00009647223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802566,0.00076336047,0.00044431663,0.00036329124,0.00011912015,0.00028427196],"domain_scores_gemma":[0.9948477,0.0011385784,0.00022187969,0.0034540275,0.00022100973,0.00011681532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012554023,0.00019781209,0.00024102947,0.00017709871,0.00094474223,0.0004256981,0.002843401,0.000050354935,0.0000036843958],"category_scores_gemma":[0.00018260952,0.00020520331,0.000083007115,0.00036480732,0.00016734489,0.00054682035,0.0006091068,0.00023449917,0.000020689093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025639532,0.00026676035,0.000704088,0.000106442945,0.0002013281,7.4365835e-7,0.0017645374,0.26444626,0.013971905,0.55880684,0.037583627,0.122121796],"study_design_scores_gemma":[0.00043386043,0.00003150928,0.00007948375,0.00006245578,0.000015584537,0.0000058474607,0.000010335137,0.89435905,0.0001742146,0.00017200282,0.104418494,0.00023717977],"about_ca_topic_score_codex":0.000013680175,"about_ca_topic_score_gemma":0.000019771463,"teacher_disagreement_score":0.7309146,"about_ca_system_score_codex":0.00007957414,"about_ca_system_score_gemma":0.000030212723,"threshold_uncertainty_score":0.8367948},"labels":[],"label_agreement":null},{"id":"W1978359440","doi":"10.1109/lcomm.2012.100812.121258","title":"Optimal User Pairing for Asymmetric Multi-Way Relay Channels with Pairwise Relaying","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Pairing; Pairwise comparison; Computer science; Pairwise error probability; Relay channel; Computer network; Channel (broadcasting); Transmission (telecommunications); Upper and lower bounds; Topology (electrical circuits); Telecommunications; Mathematics; Power (physics); MIMO; Physics; Combinatorics","score_opus":0.08821356770550323,"score_gpt":0.30490772575562214,"score_spread":0.2166941580501189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978359440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029936876,0.0020620981,0.9526254,0.013736161,0.00039029738,0.00060282275,0.0000029277332,0.0003481578,0.00029526395],"genre_scores_gemma":[0.6110252,0.00036663323,0.38617942,0.0018929323,0.00007520385,0.00029294795,0.000011525766,0.00002638787,0.00012975278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981532,0.0003905451,0.00037481013,0.00031108008,0.00020627028,0.00056409783],"domain_scores_gemma":[0.9948463,0.00085605256,0.00020226324,0.0037174975,0.00019543499,0.00018244938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010423331,0.00024215573,0.00023129919,0.00033054684,0.0010615971,0.00022828099,0.0033388035,0.000070435424,0.0000042610172],"category_scores_gemma":[0.00011655968,0.00022463544,0.00011411541,0.0011883769,0.00015559855,0.0012209169,0.00077089376,0.0004258956,0.000050838175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019365695,0.00489487,0.06436876,0.0002474574,0.0014031081,0.000012620443,0.059334725,0.121361755,0.05656059,0.18983798,0.10572548,0.396059],"study_design_scores_gemma":[0.003539921,0.00020347549,0.009664897,0.00036144056,0.000103593746,0.0000697429,0.00035435785,0.6694793,0.005713339,0.00001697824,0.30873755,0.0017554294],"about_ca_topic_score_codex":0.0000081638145,"about_ca_topic_score_gemma":0.000013862933,"teacher_disagreement_score":0.5810883,"about_ca_system_score_codex":0.00015093297,"about_ca_system_score_gemma":0.00003701131,"threshold_uncertainty_score":0.9160367},"labels":[],"label_agreement":null},{"id":"W1980034383","doi":"10.1109/lcomm.2013.092813.131290","title":"A Terminal-Assisted Bayesian Broadcasting Algorithm for S-ALOHA Systems with Finite Population of Multi-Buffered Terminals","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Aloha; Computer science; Retransmission; Algorithm; Network packet; Broadcasting (networking); Base station; Terminal (telecommunication); Population; Computer network; Random access; Throughput; Wireless; Telecommunications","score_opus":0.048864659128636405,"score_gpt":0.2950293490713121,"score_spread":0.2461646899426757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980034383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008714155,0.00008378124,0.9837065,0.0019254126,0.000106408486,0.0052995603,0.000015732,0.000113612725,0.000034885834],"genre_scores_gemma":[0.5873353,0.000005573365,0.4067507,0.0002605196,0.00004519786,0.00550458,0.000031726846,0.00001942124,0.000046958645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984406,0.00024977082,0.00053038663,0.00028891844,0.00019259332,0.0002977166],"domain_scores_gemma":[0.9965484,0.0006334548,0.00046954953,0.0020441604,0.00022099329,0.0000834039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000301141,0.00019314977,0.00030947043,0.00016123436,0.00032057392,0.00026217845,0.001758158,0.000075076525,0.0000021633928],"category_scores_gemma":[0.000024096495,0.00016970176,0.00008482514,0.00040471,0.00010138015,0.0005506065,0.00016994012,0.00016531766,0.00000586751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020443771,0.0005095043,0.007493311,0.00034527894,0.00017342059,0.000007353168,0.0014307569,0.010122612,0.010065358,0.0007427175,0.002912236,0.966177],"study_design_scores_gemma":[0.00068001694,0.00008883845,0.012783584,0.00037842587,0.0000181744,0.000027125681,0.000033836273,0.9849874,0.00013591911,0.0000311589,0.00060164346,0.00023389031],"about_ca_topic_score_codex":0.00068948494,"about_ca_topic_score_gemma":0.000033661065,"teacher_disagreement_score":0.9748648,"about_ca_system_score_codex":0.00005149201,"about_ca_system_score_gemma":0.00003196752,"threshold_uncertainty_score":0.6920237},"labels":[],"label_agreement":null},{"id":"W1982972072","doi":"10.1109/lcomm.2012.012412.112327","title":"Joint Relay Assignment and Power Allocation for Multicast Cooperative Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Relay; Unicast; Computer network; Mathematical optimization; Optimization problem; Power (physics); Algorithm; Mathematics","score_opus":0.06813157986102504,"score_gpt":0.30033877152959115,"score_spread":0.23220719166856613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982972072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063088727,0.0021691576,0.9607701,0.02919541,0.00032615184,0.0006034369,0.0000027163944,0.0001255649,0.0004986346],"genre_scores_gemma":[0.91089916,0.0011314921,0.08297563,0.0045099207,0.000059499456,0.0003237,0.000020996793,0.00001603251,0.00006359133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985692,0.0003840036,0.00034091744,0.00023534271,0.00012768472,0.00034283698],"domain_scores_gemma":[0.996796,0.00052359287,0.00013753025,0.0022178504,0.00017498278,0.00015004276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007658569,0.0001760957,0.00017835965,0.00009627156,0.00075572083,0.00018027447,0.0012831325,0.000060293973,0.000007981889],"category_scores_gemma":[0.00008358615,0.00017218528,0.00005911431,0.0003002948,0.00019483987,0.0007109124,0.0005953321,0.00026320826,0.000018013166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041074865,0.0015039714,0.0030472153,0.00003461663,0.00042671917,0.0000010097814,0.02292404,0.020316904,0.12850508,0.6292667,0.07306614,0.12086656],"study_design_scores_gemma":[0.0014060031,0.00012409154,0.009326815,0.00011541861,0.0000460152,0.000024538915,0.00027364035,0.86715657,0.0028238718,0.00006862824,0.11780019,0.00083424547],"about_ca_topic_score_codex":0.0000032948476,"about_ca_topic_score_gemma":0.000011135532,"teacher_disagreement_score":0.90459025,"about_ca_system_score_codex":0.00011628391,"about_ca_system_score_gemma":0.000024624698,"threshold_uncertainty_score":0.7021512},"labels":[],"label_agreement":null},{"id":"W1984869710","doi":"10.1109/lcomm.2009.091354","title":"Oversampled M-sequences for joint data and bit epoch estimation in DSSS transmissions","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algorithm; Computer science; Direct-sequence spread spectrum; Estimator; Binary data; Pseudorandom binary sequence; Binary number; Spread spectrum; Sequence (biology); Modulation (music); Transmission (telecommunications); Synchronization (alternating current); Mathematics; Statistics; Code division multiple access; Telecommunications; Channel (broadcasting); Arithmetic","score_opus":0.14267186318612823,"score_gpt":0.37254482666973343,"score_spread":0.2298729634836052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984869710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011353281,0.0006368824,0.8306038,0.15642728,0.000048310845,0.0005830648,0.000020191605,0.00011098493,0.00021622406],"genre_scores_gemma":[0.65238,0.0005860404,0.34545025,0.0013794817,0.000010621132,0.00007644648,0.00009811708,0.0000068663057,0.000012166509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983011,0.0003448222,0.00042390596,0.00039156128,0.0002351568,0.0003034707],"domain_scores_gemma":[0.9927681,0.00090039114,0.000117642354,0.0060334485,0.00007768788,0.00010271625],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000985062,0.00013800169,0.0001924598,0.0002862532,0.00042774295,0.00025388514,0.0060305498,0.00006288436,0.0000030254741],"category_scores_gemma":[0.00017321615,0.00014082142,0.000036835627,0.00069826056,0.00020013728,0.0010283783,0.00063651457,0.00033149216,0.0000054297857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050679337,0.0010312714,0.0009705307,0.00009086351,0.00009827793,0.000007850554,0.0073024104,0.026158005,0.09833877,0.13121666,0.04187339,0.69286126],"study_design_scores_gemma":[0.00046707763,0.00003276163,0.0032002837,0.0000784152,0.0000058235382,0.000007738881,0.000038315207,0.9849184,0.0002874376,0.0053975843,0.005386296,0.00017987759],"about_ca_topic_score_codex":0.00009220062,"about_ca_topic_score_gemma":0.00013550736,"teacher_disagreement_score":0.9587604,"about_ca_system_score_codex":0.00007830583,"about_ca_system_score_gemma":0.00009628404,"threshold_uncertainty_score":0.9993473},"labels":[],"label_agreement":null},{"id":"W1985009561","doi":"10.1109/4234.864189","title":"Impact of the beat noise on the performance of 2-D optical CDMA systems","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Beat (acoustics); Computer science; Spread spectrum; Noise (video); Telecommunications; Noise measurement; Bit error rate; Speech recognition; Code division multiple access; Acoustics; Electronic engineering; Algorithm; Physics; Noise reduction; Engineering; Artificial intelligence","score_opus":0.015273241714799273,"score_gpt":0.22434181105422651,"score_spread":0.20906856933942725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985009561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99386054,0.00019659795,0.000028200224,0.00051245245,0.00012438917,0.0002049654,0.000016288503,0.000033685104,0.0050228736],"genre_scores_gemma":[0.9997241,0.00009082881,0.000020382815,0.000056703593,0.000018906614,0.000036297373,0.0000019698723,0.000013443919,0.00003738028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993398,0.0001457949,0.00024157917,0.000052589858,0.0001039863,0.00011624925],"domain_scores_gemma":[0.99775535,0.00023512015,0.000044166653,0.0019231803,0.000020793506,0.00002137268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022018905,0.00009300962,0.00012935905,0.000034657205,0.000118803764,0.000012320703,0.0010806068,0.000034565302,0.000025023912],"category_scores_gemma":[0.0000068394966,0.000053210886,0.00013266697,0.00021919061,0.0002234933,0.000049013877,0.000024005265,0.00019580041,0.000025430285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000419259,0.00018778422,0.014499134,0.00018352675,0.00041254927,2.4709044e-7,0.0021186068,0.6540667,0.30263653,0.016746415,0.00643403,0.0026725656],"study_design_scores_gemma":[0.0022801545,0.0006782127,0.26009688,0.0033152949,0.0004035456,0.00009035996,0.00087245647,0.59581435,0.115313984,0.0002745045,0.01918738,0.0016728591],"about_ca_topic_score_codex":0.00003981568,"about_ca_topic_score_gemma":0.000001753247,"teacher_disagreement_score":0.24559775,"about_ca_system_score_codex":0.000034475244,"about_ca_system_score_gemma":0.000007473148,"threshold_uncertainty_score":0.2169877},"labels":[],"label_agreement":null},{"id":"W1985276827","doi":"10.1109/lcomm.2013.012213.122331","title":"Buffer-Aided Half-Duplex Relaying Can Outperform Ideal Full-Duplex Relaying","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Computer science; Transmission (telecommunications); Node (physics); Computer network; Throughput; Duplex (building); Electronic engineering; Topology (electrical circuits); Telecommunications; Wireless; Electrical engineering; Physics; Power (physics); Engineering; Acoustics; Chemistry","score_opus":0.02634561270971328,"score_gpt":0.23426041747480905,"score_spread":0.20791480476509577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985276827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9613879,0.0013394254,0.0031729683,0.028654195,0.00057352625,0.0010262873,0.000035710447,0.0018177558,0.0019922291],"genre_scores_gemma":[0.9634453,0.0010899064,0.03182843,0.0017179096,0.00013502933,0.001086557,0.00027464126,0.00022889719,0.00019334914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966353,0.00030883375,0.0011539768,0.0004694875,0.00045557538,0.0009767966],"domain_scores_gemma":[0.9910308,0.0009273157,0.00022964146,0.0072422647,0.00023519687,0.0003347455],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046810755,0.00061456976,0.0005627468,0.000493503,0.001267514,0.00036140563,0.0042933766,0.00027648997,0.00023414745],"category_scores_gemma":[0.00017110648,0.0007055427,0.0002691011,0.00092314946,0.00051208,0.0008704146,0.0006808778,0.0016884862,0.0011933052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009452878,0.00016761413,0.0016107744,0.00012574113,0.00036197752,0.000006163015,0.003914656,0.5503884,0.38782156,0.0019088543,0.044612873,0.009071952],"study_design_scores_gemma":[0.0010539808,0.000043704527,0.0058924886,0.00025751104,0.000119838805,0.00009495244,0.0010952861,0.961476,0.002775644,0.000029254046,0.025729928,0.0014313553],"about_ca_topic_score_codex":0.0021052023,"about_ca_topic_score_gemma":0.0010056479,"teacher_disagreement_score":0.41108766,"about_ca_system_score_codex":0.0007213102,"about_ca_system_score_gemma":0.000072951174,"threshold_uncertainty_score":0.9995844},"labels":[],"label_agreement":null},{"id":"W1985834029","doi":"10.1109/lcomm.2013.091113.131213","title":"On Probabilistic Weight Distribution of Polar Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Polar code; Probabilistic logic; Computer science; Algorithm; Weight distribution; Hamming code; Polar; Coding (social sciences); Hamming weight; Linear code; Theoretical computer science; Mathematics; Block code; Decoding methods; Statistics","score_opus":0.022063561416369813,"score_gpt":0.2649509028680204,"score_spread":0.2428873414516506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985834029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30418202,0.00007849207,0.66760826,0.025571283,0.00023588481,0.0005585188,0.000014758171,0.00064517325,0.0011056197],"genre_scores_gemma":[0.95138866,0.000016960457,0.0476214,0.00080099015,0.000010487004,0.00011536566,0.000021709171,0.000008001861,0.000016443459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.00020154651,0.00026138974,0.00018843671,0.0001736707,0.00016484759],"domain_scores_gemma":[0.99622023,0.00049351505,0.00015459917,0.0029449938,0.00014421169,0.000042450527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022631949,0.000108048414,0.00013123671,0.00008635719,0.00015985148,0.000061369785,0.0025610263,0.00004219042,0.0000058591663],"category_scores_gemma":[0.0001537241,0.000104389386,0.000058280115,0.00036551422,0.0001814083,0.0003055582,0.00027291727,0.00021607209,0.00007941822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008526062,0.0010304285,0.004836217,0.00008840375,0.00008680967,0.0000022248178,0.0019503969,0.00059533375,0.23481303,0.5460918,0.1803672,0.030129625],"study_design_scores_gemma":[0.0018174847,0.0011750424,0.09862124,0.00133025,0.000120054465,0.00009958079,0.00015615132,0.41667855,0.24021278,0.2035011,0.032980606,0.003307169],"about_ca_topic_score_codex":0.0002665084,"about_ca_topic_score_gemma":0.000018959656,"teacher_disagreement_score":0.6472066,"about_ca_system_score_codex":0.00010020076,"about_ca_system_score_gemma":0.000024909436,"threshold_uncertainty_score":0.47590664},"labels":[],"label_agreement":null},{"id":"W1987787762","doi":"10.1109/lcomm.2014.2332491","title":"An Efficient Binary Locally Repairable Code for Hadoop Distributed File System","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Distributed data store; Overhead (engineering); Code (set theory); Reliability (semiconductor); Locality; Binary number; Distributed computing; File system; Reduction (mathematics); Computational complexity theory; Distributed database; Parallel computing; Operating system; Algorithm; Arithmetic; Mathematics; Set (abstract data type)","score_opus":0.025381863078514245,"score_gpt":0.27268824284696064,"score_spread":0.24730637976844638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987787762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035393464,0.000057875084,0.9851164,0.007372336,0.00019090141,0.0004215692,0.0010448083,0.0021611499,0.00009559252],"genre_scores_gemma":[0.5033386,0.000005271665,0.49495256,0.0007342253,0.000019200425,0.00034665767,0.0005757374,0.000016636155,0.000011130401],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985455,0.00017838198,0.00032557026,0.00043528856,0.00017155166,0.0003436627],"domain_scores_gemma":[0.9916,0.0005786745,0.00018826853,0.0074288268,0.0001282814,0.000075982505],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00043344975,0.00017079197,0.00020358551,0.00013328576,0.0005798156,0.00013508262,0.0057889298,0.0000771541,0.0000028241068],"category_scores_gemma":[0.0001992747,0.00017390605,0.00006937013,0.0004929705,0.0002745336,0.00042600575,0.0006569237,0.0002094809,0.00004830831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035588197,0.0008196055,0.00010309624,0.00020086573,0.00008871064,0.000013422896,0.00054878934,0.26631653,0.060121592,0.24103218,0.40439168,0.026327953],"study_design_scores_gemma":[0.00026235866,0.00009772264,0.00010850495,0.00006587901,0.000008923807,0.000011653663,0.00007805269,0.91423845,0.0014077927,0.00019612035,0.08328299,0.00024152505],"about_ca_topic_score_codex":0.000020037613,"about_ca_topic_score_gemma":0.000016883328,"teacher_disagreement_score":0.6479219,"about_ca_system_score_codex":0.00020792877,"about_ca_system_score_gemma":0.00003498697,"threshold_uncertainty_score":0.9995902},"labels":[],"label_agreement":null},{"id":"W1989781991","doi":"10.1109/lcomm.2002.804251","title":"On the deployment of RED on shared-memory buffers","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Queueing theory; Random early detection; Software deployment; Queue; Computer network; Shared resource; Scheme (mathematics); Resource allocation; Distributed computing; Shared memory; Mathematical optimization; Parallel computing; Network congestion; Mathematics; Active queue management; Operating system","score_opus":0.04059595175612478,"score_gpt":0.23722005548067612,"score_spread":0.19662410372455136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989781991","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09705175,0.00060377916,0.06809145,0.8107913,0.00083659095,0.00089518714,0.000010670766,0.00048057924,0.021238698],"genre_scores_gemma":[0.9816946,0.000081189566,0.0015884088,0.016356329,0.000028271097,0.00007930059,0.0000015167768,0.000008233135,0.00016216976],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989997,0.0002313962,0.00021090049,0.00017580825,0.00022260901,0.00015959465],"domain_scores_gemma":[0.99601024,0.00084423827,0.00011002279,0.0029538013,0.00003888355,0.000042823576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020316188,0.00010619737,0.000109207234,0.00007094745,0.00023956373,0.00005212134,0.002689367,0.000028818939,0.000050392377],"category_scores_gemma":[0.000031643325,0.00008089176,0.0000774763,0.00025757265,0.00013432995,0.000092458526,0.0001229529,0.00023026961,0.00015386724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000174271,0.0005221526,0.00005729634,0.0000059888234,0.000111247,0.0000042911165,0.0014151066,0.01236237,0.0043392647,0.15513061,0.5736894,0.25234485],"study_design_scores_gemma":[0.0018010102,0.00038122374,0.0017578984,0.0002909177,0.00005057127,0.000011435226,0.00011247468,0.93131715,0.002405082,0.0012278147,0.05995023,0.00069420383],"about_ca_topic_score_codex":0.0000070318406,"about_ca_topic_score_gemma":0.0000055932837,"teacher_disagreement_score":0.9189548,"about_ca_system_score_codex":0.000043624474,"about_ca_system_score_gemma":0.000008292059,"threshold_uncertainty_score":0.49975577},"labels":[],"label_agreement":null},{"id":"W1990308389","doi":"10.1109/lcomm.2013.021913.122708","title":"Optimal Power Allocation for Wideband Cognitive Radio Networks Employing SC-FDMA","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive radio; Wideband; Computer science; Interference (communication); Frequency-division multiple access; Orthogonal frequency-division multiple access; Power (physics); Transmitter; Convex optimization; Transmitter power output; Channel allocation schemes; Power budget; Computer network; Mathematical optimization; Orthogonal frequency-division multiplexing; Telecommunications; Electronic engineering; Power control; Regular polygon; Wireless; Mathematics; Engineering; Channel (broadcasting)","score_opus":0.02402828528264387,"score_gpt":0.2619906270203674,"score_spread":0.23796234173772354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990308389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08274181,0.00048020054,0.89820033,0.016670618,0.00035128588,0.0008016384,0.0000029203584,0.00019459391,0.00055658194],"genre_scores_gemma":[0.9213576,0.00011068437,0.073635295,0.0044338577,0.00013669637,0.00021329526,0.00003439989,0.000028993956,0.000049222446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842,0.00019113978,0.00035459275,0.0004014383,0.0001679936,0.00046482412],"domain_scores_gemma":[0.99688923,0.0011301973,0.00017049228,0.0013811971,0.0003090641,0.00011984494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031573317,0.00021764087,0.00022436139,0.00014808172,0.0007098278,0.00048042554,0.0013508726,0.00007893396,0.000013499344],"category_scores_gemma":[0.00007206044,0.00023089477,0.00013565802,0.00044134352,0.00020833043,0.00085946376,0.00023017202,0.00030109807,0.000044097047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014958382,0.0013017688,0.005907571,0.000067946516,0.0016127799,0.000028480932,0.017763933,0.09675025,0.07263661,0.038930736,0.22426812,0.54058224],"study_design_scores_gemma":[0.0011294404,0.00010887335,0.0058084647,0.00019314491,0.00005635817,0.000048553156,0.00018085467,0.9862504,0.0010961607,0.00042286824,0.0040364214,0.0006684698],"about_ca_topic_score_codex":0.0000734201,"about_ca_topic_score_gemma":0.00002928334,"teacher_disagreement_score":0.88950014,"about_ca_system_score_codex":0.00009932351,"about_ca_system_score_gemma":0.000040101262,"threshold_uncertainty_score":0.9415616},"labels":[],"label_agreement":null},{"id":"W1991921359","doi":"10.1109/lcomm.2012.020212.112311","title":"Counting Short Cycles of Quasi Cyclic Protograph LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Circulant matrix; Mathematics; Eigenvalues and eigenvectors; Parity-check matrix; Enhanced Data Rates for GSM Evolution; Block code; Algorithm; Combinatorics; Discrete mathematics; Computer science; Decoding methods; Error floor; Telecommunications","score_opus":0.05082889828456905,"score_gpt":0.32112507672631907,"score_spread":0.27029617844175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991921359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46689793,0.0005159723,0.52099526,0.006718841,0.0003762925,0.0008629813,0.000004407709,0.00114732,0.0024809896],"genre_scores_gemma":[0.81104165,0.00004419968,0.18799756,0.0006466265,0.00004412367,0.00020113845,0.0000035464261,0.000015859725,0.000005315528],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985118,0.00026137868,0.00040852593,0.00019929348,0.0002646826,0.00035434758],"domain_scores_gemma":[0.9958882,0.00042097337,0.00019698335,0.0033122606,0.00010857698,0.000073024225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009067752,0.00015811475,0.00021457097,0.00026377212,0.0002671542,0.000068562855,0.0034848638,0.000061114064,0.0000018059968],"category_scores_gemma":[0.000081341954,0.00016609266,0.00011152088,0.00066659285,0.00026951416,0.0007215339,0.00054950215,0.00029971893,0.000013072568],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064150026,0.0010259628,0.37173754,0.000100937876,0.00012774397,0.0000013599201,0.008341098,0.00004972419,0.54125553,0.02251137,0.0100384625,0.044803843],"study_design_scores_gemma":[0.0008500144,0.00033161623,0.18394683,0.0012508486,0.00020558311,0.00021563168,0.0011034234,0.039509047,0.7061702,0.003248504,0.059872426,0.0032958856],"about_ca_topic_score_codex":0.00018305522,"about_ca_topic_score_gemma":0.00003960483,"teacher_disagreement_score":0.3441437,"about_ca_system_score_codex":0.000052212883,"about_ca_system_score_gemma":0.00002450941,"threshold_uncertainty_score":0.67730623},"labels":[],"label_agreement":null},{"id":"W1992168191","doi":"10.1109/lcomm.2013.062113.130872","title":"Discreteness of Sum-Capacity-Achieving Distributions for Discrete-Time Poisson Multiple Access Channels with Peak Constraints","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Poisson distribution; Channel (broadcasting); Channel capacity; Discrete time and continuous time; Computer science; Wireless; Topology (electrical circuits); Mathematics; Computer network; Telecommunications; Statistics; Combinatorics","score_opus":0.03261636023751335,"score_gpt":0.25673505047547507,"score_spread":0.22411869023796172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992168191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6900208,0.00020967513,0.2919418,0.014304604,0.00011033809,0.0014431592,0.0004444918,0.0009882532,0.0005368912],"genre_scores_gemma":[0.9617955,0.0001421081,0.036658898,0.00007435186,0.00001547717,0.0010082652,0.00024205896,0.000053449407,0.000009863878],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986964,0.00008950747,0.00047745655,0.00020313244,0.00015461985,0.000378893],"domain_scores_gemma":[0.9958355,0.0009853239,0.00014763097,0.0027472228,0.00019751569,0.00008681166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016058404,0.0002574143,0.00036349343,0.00016693081,0.00032635225,0.0001549547,0.0026969477,0.00011657963,0.000035180485],"category_scores_gemma":[0.00019694088,0.0002390206,0.00011021367,0.00043480462,0.0012852446,0.00065129757,0.00035966444,0.0003687967,0.000030068628],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004150712,0.0004897932,0.00910758,0.00055062433,0.00079594005,7.873955e-7,0.0010055385,0.030798303,0.912317,0.020582769,0.0045167226,0.019793456],"study_design_scores_gemma":[0.003881672,0.00027423244,0.033313338,0.0013478603,0.00030604185,0.000031448362,0.0014982712,0.5900187,0.35799998,0.0028777071,0.0055231694,0.0029276137],"about_ca_topic_score_codex":0.0000756236,"about_ca_topic_score_gemma":0.00003653192,"teacher_disagreement_score":0.5592204,"about_ca_system_score_codex":0.00010666282,"about_ca_system_score_gemma":0.000016881051,"threshold_uncertainty_score":0.97469777},"labels":[],"label_agreement":null},{"id":"W1993479987","doi":"10.1109/lcomm.2013.100713.131727","title":"Blind Synchronization in Diffusion-Based Molecular Communication Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Calgary","funders":"","keywords":"Molecular communication; Synchronization (alternating current); Computer science; Channel (broadcasting); Overhead (engineering); Algorithm; Upper and lower bounds; Communications system; Throughput; Diffusion; Computer network; Telecommunications; Transmitter; Mathematics; Wireless","score_opus":0.012262119308370258,"score_gpt":0.22258131820599303,"score_spread":0.21031919889762277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993479987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5896913,0.005744058,0.37000415,0.024231281,0.00039357087,0.0020453616,0.000007421395,0.0009778419,0.0069049974],"genre_scores_gemma":[0.9844438,0.00079203333,0.011948264,0.0019549944,0.000014746041,0.00053697126,0.0002329956,0.000060116505,0.000016083912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857503,0.0003418669,0.00045862395,0.00016419454,0.00017617503,0.00028408182],"domain_scores_gemma":[0.9959204,0.00021194406,0.000079256526,0.0036108864,0.00009041653,0.00008709617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022542248,0.00020862202,0.00019380207,0.00033402015,0.00017986457,0.00012062776,0.0017126373,0.00012897544,0.00010483249],"category_scores_gemma":[0.000030301495,0.00024591555,0.00007528017,0.0007549032,0.00015647142,0.00023892551,0.00015671145,0.00047010503,0.00021493019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011700868,0.00042119075,0.0019432048,0.00007876881,0.000085397354,0.0000037564694,0.00090765266,0.7413969,0.21309292,0.0018320505,0.013752627,0.026473826],"study_design_scores_gemma":[0.0009767667,0.00000910086,0.0012050997,0.00013061512,0.000014141199,0.0000023059765,0.000044881537,0.9886706,0.0032261743,0.00020733324,0.005136492,0.0003764763],"about_ca_topic_score_codex":0.00014163446,"about_ca_topic_score_gemma":0.000080174854,"teacher_disagreement_score":0.39475247,"about_ca_system_score_codex":0.00017601425,"about_ca_system_score_gemma":0.000022805849,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W1993509434","doi":"10.1109/lcomm.2015.2398866","title":"Variable-Length Feedback Codes Under a Strict Delay Constraint","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Constraint (computer-aided design); Coding (social sciences); Upper and lower bounds; Channel (broadcasting); Code rate; Channel code; Variable (mathematics); Computer science; Algorithm; Code (set theory); Mathematics; Telecommunications; Applied mathematics; Statistics; Mathematical analysis","score_opus":0.05252369745064049,"score_gpt":0.27242461534703744,"score_spread":0.21990091789639693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993509434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12325364,0.003945683,0.77367896,0.023905417,0.00069258665,0.0012871752,0.0001913115,0.0066767116,0.06636854],"genre_scores_gemma":[0.8659561,0.000485934,0.13176687,0.0014479012,0.00003437872,0.00014673949,0.0000843693,0.000057359037,0.000020319178],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985141,0.00032358165,0.00044148497,0.00017309407,0.0002374605,0.00031027288],"domain_scores_gemma":[0.99545574,0.00048675877,0.000081889295,0.0036308614,0.00016553375,0.00017924367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062205066,0.00023629669,0.00025504376,0.00020540418,0.00017110631,0.000113063914,0.0021889142,0.00012932818,0.000026125621],"category_scores_gemma":[0.000069483554,0.00027181156,0.00006743037,0.00051623216,0.00038325475,0.00028903887,0.00026868228,0.0006048292,0.00012443769],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045400044,0.0007503277,0.0010947462,0.00014425823,0.0009819727,0.000012021348,0.0068464563,0.13449058,0.1104907,0.26324517,0.4657698,0.016128568],"study_design_scores_gemma":[0.0034458847,0.000130384,0.001246274,0.00046097842,0.00026658372,0.0002485392,0.0034825627,0.27064887,0.01874018,0.014579916,0.6835736,0.0031762405],"about_ca_topic_score_codex":0.0001043683,"about_ca_topic_score_gemma":0.000060090464,"teacher_disagreement_score":0.7427025,"about_ca_system_score_codex":0.0003206404,"about_ca_system_score_gemma":0.00007432023,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W1996025592","doi":"10.1109/lcomm.2005.1496598","title":"Turbo decoding with one bit extrinsic quantization","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Quantization (signal processing); Decoding methods; Computer science; Binary number; Algorithm; Turbo code; Binary symmetric channel; Sequential decoding; Mathematics; Arithmetic; Low-density parity-check code; Block code","score_opus":0.030838028790928423,"score_gpt":0.2532335434877121,"score_spread":0.22239551469678367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996025592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14348693,0.0016049715,0.83492607,0.012121203,0.00006972505,0.00048754827,0.000008604066,0.002953228,0.0043417183],"genre_scores_gemma":[0.69910556,0.0013462394,0.29874733,0.0005548344,0.00003450372,0.000110947134,0.000033919987,0.000049341226,0.000017336706],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991248,0.0000709256,0.0003025512,0.00013961828,0.00014806718,0.00021402173],"domain_scores_gemma":[0.997043,0.00016167146,0.00007769515,0.002594193,0.000066898516,0.00005650173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011982057,0.00016916706,0.00016291527,0.00021629063,0.00022661332,0.00005145832,0.0011739858,0.00005758458,0.000017006872],"category_scores_gemma":[0.000013846741,0.00018764642,0.000037723217,0.00045962704,0.00015098396,0.00047640954,0.000099131394,0.0003432609,0.00007432092],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016785449,0.00024336047,0.0010748901,0.00006875851,0.00017100299,0.0000013538751,0.0012505298,0.19626823,0.48316526,0.010282506,0.0057759145,0.3016814],"study_design_scores_gemma":[0.0014244566,0.00006849288,0.002884425,0.00056158553,0.00011462952,0.00004072625,0.0002224696,0.3879153,0.45268863,0.0004106632,0.15184516,0.001823449],"about_ca_topic_score_codex":0.000008999039,"about_ca_topic_score_gemma":0.000100395155,"teacher_disagreement_score":0.55561864,"about_ca_system_score_codex":0.00018951653,"about_ca_system_score_gemma":0.000011166907,"threshold_uncertainty_score":0.7651999},"labels":[],"label_agreement":null},{"id":"W1997847569","doi":"10.1109/lcomm.2012.020212.112560","title":"Turbo Receiver for DS-SS Systems Employing Parity Bit Selected Spreading Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Turbo code; Additive white Gaussian noise; Algorithm; Parity bit; Computer science; Bit error rate; Turbo; Fading; Decoding methods; Turbo equalizer; Low-density parity-check code; Electronic engineering; Telecommunications; Mathematics; Block code; Concatenated error correction code; Channel (broadcasting); Engineering","score_opus":0.08667197456054516,"score_gpt":0.3329946082431082,"score_spread":0.24632263368256307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997847569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09241401,0.0046420074,0.87111205,0.02572084,0.0016887396,0.0019592321,0.000031078358,0.0010856703,0.0013463657],"genre_scores_gemma":[0.932153,0.0003989881,0.06572144,0.0006870783,0.00016375048,0.000622237,0.000057402303,0.000037669204,0.00015847568],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693245,0.0010412347,0.00050790573,0.00033024827,0.00038188437,0.0008062562],"domain_scores_gemma":[0.9911195,0.0022891138,0.0002407568,0.0056807427,0.00043357897,0.00023630068],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0015880683,0.00023028399,0.00030372295,0.00028034818,0.0010963118,0.00046399437,0.0067382273,0.00012877712,0.00000381882],"category_scores_gemma":[0.0002474346,0.00024464147,0.000105217674,0.0013245917,0.00024500623,0.0012423386,0.0010861462,0.0006434186,0.00008000535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009748187,0.0023496968,0.103767395,0.00054835225,0.0011791206,0.0000041662497,0.018212,0.022651045,0.20193832,0.16532224,0.4218719,0.062058277],"study_design_scores_gemma":[0.0014058899,0.000072731025,0.019401196,0.00041660471,0.00006907733,0.00006005486,0.00024194746,0.7466445,0.006877276,0.00026016118,0.22310935,0.001441227],"about_ca_topic_score_codex":0.00023298516,"about_ca_topic_score_gemma":0.000048334718,"teacher_disagreement_score":0.83973897,"about_ca_system_score_codex":0.0003014507,"about_ca_system_score_gemma":0.00008458728,"threshold_uncertainty_score":0.99863577},"labels":[],"label_agreement":null},{"id":"W2000901063","doi":"10.1109/lcomm.2011.122211.111737","title":"Efficient Stochastic Decoding of Non-Binary LDPC Codes with Degree-Two Variable Nodes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Degree (music); Algorithm; Binary number; Node (physics); Variable (mathematics); Computer science; List decoding; Mathematics; Block code; Concatenated error correction code; Arithmetic","score_opus":0.04324977171945868,"score_gpt":0.29854484533774245,"score_spread":0.25529507361828374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000901063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21819316,0.00016459983,0.7791109,0.0008938707,0.00017535026,0.0002154781,0.000002650139,0.00029161441,0.000952371],"genre_scores_gemma":[0.6035073,0.0000033434458,0.396093,0.00030259104,0.00001829826,0.000051304425,0.0000021850594,0.000014002737,0.000007996961],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860704,0.00017925611,0.00032062444,0.00023085305,0.0002625315,0.00039972394],"domain_scores_gemma":[0.9957396,0.00073903764,0.0002507903,0.0030390185,0.0001359584,0.0000956045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073326845,0.00018589628,0.00023386984,0.00023780974,0.0003283179,0.000056607183,0.0028057701,0.00004372202,0.0000032756095],"category_scores_gemma":[0.00006249302,0.00017407867,0.0000538904,0.00071709533,0.00024267347,0.00028627765,0.0006048541,0.00030021905,0.000015957508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052050036,0.0017830757,0.020017948,0.00014735805,0.00024848361,0.0000058009696,0.013259846,0.19742323,0.72287554,0.024895526,0.0046077445,0.014683409],"study_design_scores_gemma":[0.00060919585,0.00012370347,0.0047986344,0.00053202995,0.00007612759,0.00008578227,0.00017835946,0.9735651,0.019030523,0.00013755227,0.00020002147,0.00066299643],"about_ca_topic_score_codex":0.0002281639,"about_ca_topic_score_gemma":0.000021876727,"teacher_disagreement_score":0.7761418,"about_ca_system_score_codex":0.0001172789,"about_ca_system_score_gemma":0.0000637534,"threshold_uncertainty_score":0.70987225},"labels":[],"label_agreement":null},{"id":"W2001564922","doi":"10.1109/lcomm.2013.043013.130264","title":"On Robust Weighted Sum Rate Maximization for MIMO Interfering Broadcast Channels with Imperfect Channel Knowledge","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transceiver; Maximization; Computer science; MIMO; Channel (broadcasting); Imperfect; Base station; Constraint (computer-aided design); Computer network; Mathematical optimization; Telecommunications; Mathematics; Wireless","score_opus":0.023348248623106405,"score_gpt":0.2355392871781733,"score_spread":0.21219103855506688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001564922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02921388,0.0002693468,0.9661306,0.0010304637,0.00058695645,0.001478216,0.000018553177,0.0005781911,0.0006937854],"genre_scores_gemma":[0.9760998,0.00013740054,0.021487823,0.00023706577,0.000118030825,0.0014621847,0.0001817931,0.00014350197,0.00013242483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888796,0.0000967035,0.00035019193,0.00024860626,0.000067954235,0.00034860912],"domain_scores_gemma":[0.9980665,0.00028650602,0.00010010376,0.0012775606,0.0001853987,0.00008391959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014573307,0.0002887365,0.0002496844,0.00027219253,0.00025974074,0.00011314762,0.0006113383,0.00008761473,0.000015552092],"category_scores_gemma":[0.000027599752,0.00028302797,0.00006269692,0.0003874047,0.00007934571,0.0004960373,0.00005839621,0.00022722011,0.00010847576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016138309,0.000047374662,0.000010680536,0.00008944333,0.000069791335,2.7001596e-7,0.0007390921,0.97414577,0.018989686,0.00014652159,0.004502624,0.0012426202],"study_design_scores_gemma":[0.00083470624,0.00008131283,0.000030217125,0.00027461955,0.000028327842,0.0000067726364,0.000111769776,0.98913676,0.007861183,0.0000617767,0.0011561987,0.0004163593],"about_ca_topic_score_codex":0.000024852416,"about_ca_topic_score_gemma":0.000033462362,"teacher_disagreement_score":0.9468859,"about_ca_system_score_codex":0.00022101121,"about_ca_system_score_gemma":0.000012386901,"threshold_uncertainty_score":0.9999622},"labels":[],"label_agreement":null},{"id":"W2004317249","doi":"10.1109/lcomm.2015.2474402","title":"Communication Neighbors Comparison in a Poisson Field of Nodes","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Poisson distribution; Node (physics); Fading; Poisson point process; Point process; Poisson process; Statistics; Computer science; Point (geometry); Statistical physics; Mathematics; Algorithm; Physics; Geometry","score_opus":0.03871194973627854,"score_gpt":0.30153800219957555,"score_spread":0.262826052463297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004317249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4326156,0.006041542,0.5346691,0.009141224,0.0005332101,0.00095908804,0.000019508554,0.00066844234,0.015352283],"genre_scores_gemma":[0.96367437,0.00019014509,0.035798904,0.00020452653,0.0000100455,0.000053210828,0.000036638503,0.000024040482,0.000008114199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991073,0.00013086668,0.00044819206,0.00008322904,0.00009630423,0.00013410806],"domain_scores_gemma":[0.9979168,0.00025206813,0.00010264256,0.0016111421,0.000070556765,0.000046768077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023077845,0.00010809621,0.00020766049,0.00018478901,0.00003801768,0.00001410668,0.00077277416,0.000065990294,0.0000029719677],"category_scores_gemma":[0.00005986635,0.00012843667,0.00003106208,0.0003837219,0.000070659225,0.0002417066,0.00007487205,0.00023121022,0.0000131637025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013494793,0.00011362212,0.016409624,0.000050416405,0.000034486035,4.0447736e-7,0.004294771,0.948,0.019677091,0.0009147771,0.008172655,0.0023186677],"study_design_scores_gemma":[0.0018509593,0.00005978548,0.0029700256,0.00046767195,0.000045249573,0.000007136018,0.0022543937,0.95600086,0.028198654,0.000529325,0.006963295,0.000652642],"about_ca_topic_score_codex":0.000250748,"about_ca_topic_score_gemma":0.00027848076,"teacher_disagreement_score":0.5310588,"about_ca_system_score_codex":0.00014126035,"about_ca_system_score_gemma":0.000014213321,"threshold_uncertainty_score":0.52374953},"labels":[],"label_agreement":null},{"id":"W2004771101","doi":"10.1109/lcomm.2013.010313.121837","title":"Sphere Decoding for MIMO Systems with Newton Iterative Matrix Inversion","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Initialization; Decoding methods; Algorithm; Computer science; Phase-shift keying; Inversion (geology); Iterative method; QAM; Quadrature amplitude modulation; Lossless compression; Mathematics; Control theory (sociology); Mathematical optimization; Telecommunications; Bit error rate; Data compression; Channel (broadcasting)","score_opus":0.02058201734073479,"score_gpt":0.26454890623530186,"score_spread":0.24396688889456708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004771101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09991342,0.0016784288,0.8860746,0.00675569,0.0001899481,0.0021436831,0.000027809107,0.0016546369,0.0015618082],"genre_scores_gemma":[0.8144642,0.00043472697,0.18326615,0.0002826968,0.0000291443,0.0012742315,0.00006623575,0.00006411679,0.000118500255],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991663,0.000078529716,0.00028755664,0.00014197975,0.00010196195,0.00022367222],"domain_scores_gemma":[0.99735993,0.0003344415,0.00009358014,0.0020146496,0.00013254299,0.0000648767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008700785,0.00018682635,0.0001915906,0.000115417155,0.00027693028,0.00011867828,0.0010926923,0.000068172005,0.000012424857],"category_scores_gemma":[0.000013150698,0.00018256115,0.00004973325,0.00023366183,0.00012085644,0.00061921374,0.000094580915,0.00024842858,0.00005226945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031694697,0.00014524671,0.0012568763,0.00050912524,0.00034829014,0.0000014377438,0.0030933018,0.20999129,0.47613972,0.009219945,0.27485353,0.024409568],"study_design_scores_gemma":[0.00084222504,0.00007471437,0.00013414177,0.00049752323,0.00004713147,0.000012951822,0.0011193926,0.8870304,0.027380954,0.0003124373,0.0817439,0.00080418505],"about_ca_topic_score_codex":0.000084573,"about_ca_topic_score_gemma":0.000035111305,"teacher_disagreement_score":0.7145508,"about_ca_system_score_codex":0.00018613203,"about_ca_system_score_gemma":0.000011092549,"threshold_uncertainty_score":0.7444628},"labels":[],"label_agreement":null},{"id":"W2005574940","doi":"10.1109/lcomm.2015.2407878","title":"Fountain Code Design for the Y-Network","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Western Canada Research Grid","keywords":"Fountain code; Fountain; Computer science; Factorization; Code (set theory); Raptor code; Polynomial; Degree (music); Luby transform code; Theoretical computer science; Degree distribution; Algorithm; Decoding methods; Linear code; Mathematics; Block code; Complex network; Programming language","score_opus":0.17796921615290862,"score_gpt":0.3433045544443416,"score_spread":0.165335338291433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005574940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002050397,0.0003754681,0.93627304,0.061209418,0.00048420028,0.00055071607,0.0000013455584,0.00056056224,0.00034020896],"genre_scores_gemma":[0.22414011,0.00003322664,0.7679623,0.0072132475,0.00010245983,0.0004671039,0.0000022050183,0.000016442455,0.00006293625],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988778,0.00031511098,0.00020025289,0.00018857975,0.0001606252,0.00025762894],"domain_scores_gemma":[0.99382234,0.0021215715,0.00011396062,0.0037454574,0.00013840653,0.00005826399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016557311,0.00011011443,0.00010349052,0.000037511825,0.00046621353,0.00015664061,0.0053696246,0.00003830505,4.477641e-7],"category_scores_gemma":[0.00018674805,0.00008927725,0.00006273786,0.00038744623,0.00013968277,0.0002341657,0.0004447201,0.0002083781,0.000024640396],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011482448,0.00005331144,0.00030484042,0.0000038116004,0.00004592572,9.615459e-7,0.002163201,0.016143622,0.001517321,0.03238181,0.9317785,0.015595253],"study_design_scores_gemma":[0.00042054302,0.000109514134,0.00018361062,0.000045242694,0.000034490586,0.000028661312,0.000111326226,0.6696085,0.0021855931,0.019577453,0.30729055,0.0004045256],"about_ca_topic_score_codex":0.000052849657,"about_ca_topic_score_gemma":0.00007288641,"teacher_disagreement_score":0.65346485,"about_ca_system_score_codex":0.00010847845,"about_ca_system_score_gemma":0.000078531186,"threshold_uncertainty_score":0.99781877},"labels":[],"label_agreement":null},{"id":"W2006142981","doi":"10.1109/lcomm.2013.111113.131881","title":"Lowering the Error Floor of LDPC Codes Using Multi-Step Quantization","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Error floor; Quantization (signal processing); Computer science; Forward error correction; Error detection and correction; Decoding methods; Algorithm; Turbo code; Theoretical computer science","score_opus":0.08758308685031735,"score_gpt":0.3365748962485317,"score_spread":0.24899180939821436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006142981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12519214,0.000061948296,0.8697174,0.0042033787,0.00025670222,0.00016427442,9.712619e-7,0.00029141453,0.00011175029],"genre_scores_gemma":[0.64235735,0.000010379872,0.3569304,0.00065575284,0.000014518956,0.000013462471,0.0000015052476,0.000010748069,0.00000587908],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880654,0.00032085407,0.0003239626,0.00019564928,0.00017667643,0.00017629775],"domain_scores_gemma":[0.9960641,0.00036187132,0.00025603952,0.003165963,0.00012308804,0.000028923976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161712,0.00012070204,0.00015045042,0.00013089132,0.0003656563,0.000079546175,0.0033194995,0.00004318702,0.0000011729269],"category_scores_gemma":[0.00015757377,0.000104778796,0.00007023216,0.0004831195,0.00021001702,0.00030112203,0.00049214065,0.00021809869,0.000009010702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058279365,0.0002651246,0.0050555156,0.000058610272,0.00006469765,8.406171e-7,0.0057938835,0.0099932,0.9293122,0.012411853,0.0012239957,0.035814214],"study_design_scores_gemma":[0.00013466763,0.00001800945,0.0015022092,0.00009119906,0.000014816838,0.000009030801,0.00005732844,0.9651894,0.031865187,0.00009556142,0.0008582036,0.0001643651],"about_ca_topic_score_codex":0.0004079912,"about_ca_topic_score_gemma":0.00019159382,"teacher_disagreement_score":0.9551962,"about_ca_system_score_codex":0.000053523487,"about_ca_system_score_gemma":0.000025557913,"threshold_uncertainty_score":0.6168511},"labels":[],"label_agreement":null},{"id":"W2006167292","doi":"10.1109/lcomm.2012.042312.120382","title":"Low-Complexity Channel-Likelihood Estimation for Non-Binary Codes and QAM","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Additive white Gaussian noise; Quadrature amplitude modulation; QAM; Binary number; Algorithm; Channel (broadcasting); Low-density parity-check code; Decoding methods; Computer science; Mathematics; Bit error rate; Telecommunications; Arithmetic","score_opus":0.05337486829965723,"score_gpt":0.315533758078992,"score_spread":0.26215888977933477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006167292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10311895,0.00014624301,0.8801417,0.015047425,0.00033946385,0.0004927115,0.000007857378,0.0005144828,0.0001912085],"genre_scores_gemma":[0.6510106,0.000024417923,0.34752098,0.0011922247,0.0000381231,0.00018146448,0.000014875369,0.000011743897,0.000005595553],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894845,0.00012026643,0.00023920221,0.0002182417,0.0001261177,0.0003477146],"domain_scores_gemma":[0.9972265,0.00045012363,0.0001437678,0.0020008725,0.000080035265,0.000098724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006434673,0.00015320396,0.0001599627,0.00014826481,0.0004732865,0.00010420019,0.0016439435,0.000058108966,7.899042e-7],"category_scores_gemma":[0.00007418802,0.00016670563,0.0000564165,0.00024933292,0.00019062764,0.0008164691,0.00045994713,0.00019254329,0.00001334702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073420866,0.0031365757,0.009177773,0.00082022836,0.0002602291,0.0000039558804,0.045301788,0.001008915,0.46421614,0.08639958,0.13880475,0.25079665],"study_design_scores_gemma":[0.0007051141,0.0001651889,0.015442873,0.0002443153,0.000052899675,0.00005590865,0.00014480292,0.931176,0.038050603,0.010358836,0.0026783072,0.00092513394],"about_ca_topic_score_codex":0.00006246442,"about_ca_topic_score_gemma":0.000028219247,"teacher_disagreement_score":0.9301671,"about_ca_system_score_codex":0.00007718087,"about_ca_system_score_gemma":0.00002235881,"threshold_uncertainty_score":0.6798058},"labels":[],"label_agreement":null},{"id":"W2009200796","doi":"10.1109/4234.922761","title":"Decoding of the IS-95A uplink code","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Telecommunications link; Algorithm; Code (set theory); Real-time computing; Telecommunications","score_opus":0.034915873139434034,"score_gpt":0.28132017803810166,"score_spread":0.24640430489866763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009200796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40501645,0.0028865852,0.521117,0.052095264,0.00040252192,0.00087263377,0.000032560816,0.0019678464,0.015609164],"genre_scores_gemma":[0.95817024,0.0024810005,0.037632044,0.0015491137,0.000013454608,0.00006818739,0.000005476907,0.000034553814,0.0000459067],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928,0.00006658537,0.00031354217,0.00008458392,0.00010460062,0.00015070445],"domain_scores_gemma":[0.99583715,0.00018952349,0.00008868564,0.0038058343,0.000050411734,0.000028411843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012358998,0.00011424095,0.00013190901,0.00007934,0.00018976023,0.000014917306,0.0023622594,0.00005073419,0.000017807228],"category_scores_gemma":[0.00001984626,0.000105937885,0.00008215248,0.0003872553,0.00022478492,0.00013845364,0.00021743936,0.00032125498,0.000017698476],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008176025,0.00015212514,0.0099785635,0.0000767422,0.00016695671,9.291606e-7,0.0027337775,0.030403154,0.8334509,0.008345924,0.062296495,0.05238626],"study_design_scores_gemma":[0.00059426087,0.0000159576,0.0049582208,0.00037421988,0.000065179906,0.00003394614,0.00022503988,0.17156124,0.44235086,0.0025190085,0.3764829,0.0008191786],"about_ca_topic_score_codex":0.0000128234215,"about_ca_topic_score_gemma":0.000029704821,"teacher_disagreement_score":0.5531538,"about_ca_system_score_codex":0.0000806735,"about_ca_system_score_gemma":0.000008805986,"threshold_uncertainty_score":0.4389705},"labels":[],"label_agreement":null},{"id":"W2009686316","doi":"10.1109/lcomm.2014.2345671","title":"Exact Outage Probability for a Wireless Diversity Network With Spatially Random Mobile Relays","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Relay; Outage probability; Node (physics); Wireless network; Computer network; Wireless; Coverage probability; Probability distribution; Random variable; Topology (electrical circuits); Quality of service; Fading; Channel (broadcasting); Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.03775288137458517,"score_gpt":0.25917808943687987,"score_spread":0.2214252080622947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009686316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04262615,0.0001625101,0.9455007,0.009047203,0.00016751596,0.0015210967,0.0000045696243,0.00027106004,0.0006992325],"genre_scores_gemma":[0.86177844,0.00021980953,0.13497828,0.002195386,0.00007583015,0.0006676102,0.000022896145,0.00001626647,0.000045500277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793947,0.00075543247,0.00033370726,0.00040151595,0.00021236665,0.0003575338],"domain_scores_gemma":[0.9935662,0.0013139772,0.00021732754,0.0045504933,0.0002416204,0.00011037519],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012664989,0.00021209304,0.00030107048,0.0000683119,0.0018065455,0.00018335332,0.004324504,0.000059960756,0.0000062004096],"category_scores_gemma":[0.000061465056,0.00019324783,0.00011883763,0.00049695314,0.00028951926,0.0004414144,0.001729772,0.00032312478,0.000015514983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081486494,0.0019654343,0.044455465,0.00023121579,0.0007379221,0.0000050142535,0.019900134,0.15018277,0.011457522,0.27728847,0.047685,0.44527617],"study_design_scores_gemma":[0.0066072536,0.00051602576,0.004837267,0.0002622638,0.000105712366,0.00001457563,0.000053176893,0.8216515,0.000567634,0.0033818348,0.16069467,0.0013080693],"about_ca_topic_score_codex":0.000024140567,"about_ca_topic_score_gemma":0.00044224234,"teacher_disagreement_score":0.8191523,"about_ca_system_score_codex":0.00010895772,"about_ca_system_score_gemma":0.00005438363,"threshold_uncertainty_score":0.99949294},"labels":[],"label_agreement":null},{"id":"W2010020841","doi":"10.1109/lcomm.2015.2416175","title":"Outage Analysis of ZFB-MRT/MRC Underlay Two-Way Relay Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Underlay; Relay; Maximal-ratio combining; Fading; Beamforming; Transmission (telecommunications); Topology (electrical circuits); Computer science; Path loss; Antenna (radio); Outage probability; Signal-to-noise ratio (imaging); Telecommunications; Computer network; Mathematics; Power (physics); Physics; Wireless; Combinatorics; Decoding methods","score_opus":0.0646439897331056,"score_gpt":0.2834362863107833,"score_spread":0.21879229657767774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010020841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9180778,0.0044238446,0.06323102,0.004613957,0.0006935846,0.00055561826,0.0001999024,0.0009446741,0.0072595654],"genre_scores_gemma":[0.99147314,0.0002850315,0.0074715624,0.0001892713,0.00003472431,0.00014594193,0.0002444344,0.00006470988,0.00009119578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812937,0.0003497084,0.0007322259,0.00020210013,0.00028291834,0.00030365083],"domain_scores_gemma":[0.99262536,0.00052803836,0.00018612774,0.0062955734,0.00019893602,0.00016598364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054365216,0.00024585982,0.00050528854,0.0007166555,0.0001720818,0.00007420048,0.0026675682,0.000101356476,0.000013689654],"category_scores_gemma":[0.00007726417,0.0002768042,0.00022108211,0.001947486,0.00032644952,0.00024571226,0.0002678781,0.00046781893,0.00009147228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020788266,0.00006533846,0.0013630075,0.000021497654,0.00094395876,5.7378674e-7,0.0013150674,0.9691739,0.018800762,0.004287273,0.0038176444,0.00020891686],"study_design_scores_gemma":[0.00047472856,0.000012819003,0.0010139438,0.000052565818,0.0007013192,0.0000031911234,0.000568076,0.9836192,0.00055116013,0.000012784142,0.012618091,0.00037209335],"about_ca_topic_score_codex":0.0008113885,"about_ca_topic_score_gemma":0.00061054004,"teacher_disagreement_score":0.0733953,"about_ca_system_score_codex":0.00031491107,"about_ca_system_score_gemma":0.0000390205,"threshold_uncertainty_score":0.9999684},"labels":[],"label_agreement":null},{"id":"W2012683364","doi":"10.1109/lcomm.2013.112713.132078","title":"Outage Probability Analysis for Multi-User Single-Relay OFDMA DF Networks in Frequency Selective Rayleigh Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rayleigh fading; Fading; Computer science; Relay; Fading distribution; Orthogonal frequency-division multiple access; Probability density function; Channel (broadcasting); Cumulative distribution function; Relay channel; Orthogonal frequency-division multiplexing; Computer network; Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Statistics; Physics","score_opus":0.0875628406979625,"score_gpt":0.3045806306989202,"score_spread":0.21701779000095772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012683364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02994416,0.00046689852,0.9573129,0.010747037,0.00024492524,0.0008176045,0.000004839436,0.00020246848,0.00025917136],"genre_scores_gemma":[0.8150968,0.00021485104,0.18205884,0.0018957311,0.00005235299,0.0005801971,0.000030264519,0.000019400388,0.000051536892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969657,0.0011509937,0.000649339,0.0005787457,0.00017105775,0.0004841519],"domain_scores_gemma":[0.99431646,0.0011677566,0.00028774576,0.0038063219,0.00031347715,0.00010824059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014254403,0.00027570224,0.0004484642,0.00049428036,0.0006681257,0.00026091156,0.0039724796,0.0001175778,0.000006690501],"category_scores_gemma":[0.00024849264,0.00029000462,0.00025344474,0.002713945,0.00020749496,0.0005949615,0.00063080015,0.00053186296,0.0000077126915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000463001,0.002354058,0.08832638,0.00006256424,0.001373724,0.000001962262,0.015821248,0.6864126,0.03961219,0.116775945,0.0022948906,0.04691815],"study_design_scores_gemma":[0.0007273002,0.00004376122,0.007048988,0.00006034969,0.00007923842,9.590342e-7,0.000018568004,0.98823386,0.0007379703,0.00042001024,0.0022050461,0.0004239476],"about_ca_topic_score_codex":0.00006725605,"about_ca_topic_score_gemma":0.0012075942,"teacher_disagreement_score":0.7851527,"about_ca_system_score_codex":0.0003189277,"about_ca_system_score_gemma":0.000039389328,"threshold_uncertainty_score":0.99995524},"labels":[],"label_agreement":null},{"id":"W2014416934","doi":"10.1109/lcomm.2012.090312.121198","title":"Information Guided Channel Hopping with an Arbitrary Number of Transmit Antennas","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Decoding methods; Channel (broadcasting); Modulation (music); Constellation; Transmitter power output; Topology (electrical circuits); Algorithm; Electronic engineering; Mathematics; Telecommunications; Transmitter","score_opus":0.029877593861503786,"score_gpt":0.2674873319849612,"score_spread":0.23760973812345743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014416934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6181749,0.000622639,0.37316534,0.0028370756,0.00013798411,0.0003519386,0.000024678871,0.0013739603,0.003311464],"genre_scores_gemma":[0.90510386,0.0006230171,0.093704246,0.0003625814,0.000015223297,0.00009487313,0.00006746085,0.00002667049,0.0000020667253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991594,0.00005422204,0.00036516113,0.00005221186,0.00012720036,0.0002418153],"domain_scores_gemma":[0.9973118,0.00008991608,0.000109996916,0.0023628213,0.00007039089,0.00005510974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014637956,0.00015172041,0.00017284257,0.0001642022,0.00012297825,0.000019325329,0.0011938526,0.000073532785,0.000007826248],"category_scores_gemma":[0.000014418624,0.00015284335,0.000039065428,0.00038082097,0.00024144333,0.0019761394,0.00006919806,0.00030866795,0.000029470035],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021798511,0.0019713175,0.04075892,0.00176143,0.0018146387,0.0000028581533,0.079649,0.26707616,0.26645327,0.09420108,0.01560878,0.23048458],"study_design_scores_gemma":[0.009028175,0.00038615125,0.07467467,0.0024380265,0.00048737501,0.00064288685,0.030399112,0.32440197,0.37580326,0.008560738,0.16521844,0.007959183],"about_ca_topic_score_codex":0.00001927038,"about_ca_topic_score_gemma":0.000007952174,"teacher_disagreement_score":0.28692892,"about_ca_system_score_codex":0.000058293368,"about_ca_system_score_gemma":0.0000091427455,"threshold_uncertainty_score":0.62327707},"labels":[],"label_agreement":null},{"id":"W2015948168","doi":"10.1109/lcomm.2014.2349973","title":"Taxing the Queue: Hindering Middleboxes From Unauthorized Large-Scale Traffic Relaying","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Collusion; Computer network; Computer science; Queue; Computer security; Default gateway; Gateway (web page); Private network; Internet privacy; Business; World Wide Web","score_opus":0.022380901886181862,"score_gpt":0.24608939946276823,"score_spread":0.22370849757658637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015948168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26410773,0.00022717453,0.7192303,0.0153703615,0.0003594459,0.00010571792,0.000002784689,0.00024471857,0.00035175149],"genre_scores_gemma":[0.9497718,0.000025997606,0.046909932,0.003029598,0.0001453895,0.000030479954,0.000016757322,0.000019626079,0.000050410996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787736,0.0006023207,0.00045524092,0.00038733293,0.0002908364,0.00038691735],"domain_scores_gemma":[0.9965874,0.00085406745,0.00022513997,0.0021975716,0.00006419071,0.00007160674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011130298,0.00019886417,0.0002481583,0.00010896314,0.0009930445,0.00041706997,0.0044025355,0.000072376955,0.0000104158835],"category_scores_gemma":[0.00007894722,0.00016000886,0.00020112592,0.00041247407,0.00013037484,0.00034412,0.0005315628,0.00057443045,0.00007764604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025548568,0.00065748807,0.0011311907,0.00004793347,0.0009770169,0.000012688979,0.11717767,0.32552263,0.045977034,0.37148115,0.019120563,0.11786909],"study_design_scores_gemma":[0.0002459786,0.000008205239,0.00020766845,0.000057641682,0.00003271025,0.000003637573,0.0004204478,0.9832411,0.00013417647,0.000036000405,0.015397348,0.00021508774],"about_ca_topic_score_codex":0.00007270019,"about_ca_topic_score_gemma":0.00044503517,"teacher_disagreement_score":0.68566406,"about_ca_system_score_codex":0.00006774506,"about_ca_system_score_gemma":0.000021093914,"threshold_uncertainty_score":0.81810796},"labels":[],"label_agreement":null},{"id":"W2019352729","doi":"10.1109/lcomm.2015.2418260","title":"Multiple-Votes Parallel Symbol-Flipping Decoding Algorithm for Non-Binary LDPC Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Université Européenne de Bretagne; Research and Development Corporation of Newfoundland and Labrador; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Computer science; Binary number; Parity-check matrix; Code (set theory); Berlekamp–Welch algorithm; Sequential decoding; Error detection and correction; Mathematics; Block code; Arithmetic; Error floor","score_opus":0.07857282465175856,"score_gpt":0.3242857446273224,"score_spread":0.24571291997556383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019352729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01285585,0.0002186381,0.97325194,0.0111934915,0.0005572033,0.00059847266,0.00000845723,0.0010217312,0.0002942019],"genre_scores_gemma":[0.34369427,0.000036243648,0.65425354,0.0015832812,0.000064497755,0.00029648733,0.000016207083,0.000025089645,0.000030375895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828166,0.00019527251,0.00041949245,0.0004255443,0.0002442943,0.0004337381],"domain_scores_gemma":[0.99477696,0.0014018215,0.00022595943,0.0031827164,0.00025966874,0.0001528799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092651224,0.00024085007,0.00027425858,0.0002576358,0.00053460454,0.00023273389,0.0043682316,0.00009289505,5.6848205e-7],"category_scores_gemma":[0.00030411975,0.00026622516,0.00013572554,0.00044489728,0.00016951167,0.0007068002,0.0008135239,0.00034895455,0.000026755595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000436156,0.0010285067,0.01035439,0.00013423518,0.0003835162,0.00003477201,0.025030142,0.0058502387,0.16983622,0.005947761,0.19502571,0.5863309],"study_design_scores_gemma":[0.00055911334,0.00007337373,0.0002463941,0.00012175628,0.000017511842,0.000024530687,0.00023213592,0.9878349,0.0046808207,0.0007348615,0.0050451932,0.00042943627],"about_ca_topic_score_codex":0.0001552169,"about_ca_topic_score_gemma":0.00006827076,"teacher_disagreement_score":0.9819846,"about_ca_system_score_codex":0.00020596346,"about_ca_system_score_gemma":0.00009686705,"threshold_uncertainty_score":0.999979},"labels":[],"label_agreement":null},{"id":"W2020023512","doi":"10.1109/lcomm.2012.092112.121280","title":"New Simple Approximations for Error Probability and Outage in Fading","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Bit error rate; Probability density function; Taylor series; Transmission (telecommunications); Signal-to-noise ratio (imaging); Mathematics; Computer science; Channel state information; Fading distribution; Telecommunications; Channel (broadcasting); Wireless; Algorithm; Statistics; Rayleigh fading; Mathematical analysis","score_opus":0.059693152365519905,"score_gpt":0.3104121381388337,"score_spread":0.2507189857733138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020023512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10195472,0.00093441823,0.89120317,0.0034546012,0.0000664276,0.0010091952,0.00002567538,0.00066145614,0.0006903589],"genre_scores_gemma":[0.67058283,0.00010969919,0.3287071,0.00014248183,0.00001718707,0.0003781847,0.00002914114,0.00002316528,0.000010232186],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992612,0.000060053346,0.00028535232,0.000096281554,0.000055083285,0.00024204605],"domain_scores_gemma":[0.9980006,0.0003317559,0.00004644527,0.0015214891,0.000022272952,0.00007739906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026704356,0.00012121896,0.00014485898,0.0001344363,0.0001376165,0.000024660263,0.00059593987,0.00005406996,0.0000051909983],"category_scores_gemma":[0.00006109103,0.00014332017,0.000034744826,0.00021750554,0.00008372248,0.0004601356,0.00011290832,0.00021778984,0.0000040408045],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037866444,0.0008073803,0.06828379,0.0011391066,0.00022391681,4.1113344e-7,0.029859988,0.06770099,0.3857991,0.1387076,0.04361807,0.26382178],"study_design_scores_gemma":[0.003464604,0.000072187155,0.042131335,0.00038250056,0.00011775256,0.000026283347,0.0016038999,0.4065913,0.059020687,0.051972695,0.43154386,0.0030728974],"about_ca_topic_score_codex":0.00003115167,"about_ca_topic_score_gemma":0.00009416446,"teacher_disagreement_score":0.5686281,"about_ca_system_score_codex":0.00013527584,"about_ca_system_score_gemma":0.000009187339,"threshold_uncertainty_score":0.58444273},"labels":[],"label_agreement":null},{"id":"W2021659659","doi":"10.1109/lcomm.2012.120312.121420","title":"Variable-Length Constrained Sequence Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Code word; Sequence (biology); Extension (predicate logic); Variable (mathematics); Mathematics; Set (abstract data type); Simple (philosophy); Code (set theory); Algorithm; Computer science; Discrete mathematics; Combinatorics; Decoding methods","score_opus":0.05890675649039083,"score_gpt":0.2978091330885597,"score_spread":0.23890237659816888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021659659","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003007696,0.00034683003,0.9837414,0.008802851,0.0004903717,0.000139568,0.000030816424,0.00026558602,0.003174872],"genre_scores_gemma":[0.47235632,0.000058515114,0.52448785,0.0029499999,0.000052756164,0.000029510556,0.00002911073,0.00000684386,0.000029088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889874,0.00018504295,0.00021733278,0.0001829158,0.00018032377,0.00033565395],"domain_scores_gemma":[0.9962327,0.00031631938,0.00009834453,0.0031641347,0.000054956454,0.00013356228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040789117,0.00012607485,0.00012741366,0.00007750344,0.00038462415,0.00013004326,0.0031420954,0.000044715864,0.000018058749],"category_scores_gemma":[0.000036466765,0.000118299475,0.000037956605,0.00034494748,0.00022184436,0.001207472,0.00066213805,0.00022748874,0.000121896905],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044877215,0.00044929993,0.0019602322,0.000021572456,0.00008090431,0.000004140019,0.0019697524,0.00027226686,0.17989062,0.7111655,0.0499529,0.054228358],"study_design_scores_gemma":[0.0013310547,0.00006744505,0.0038378055,0.00022691123,0.000061270664,0.00026665366,0.00019319926,0.3030779,0.00826499,0.00480131,0.6762887,0.0015827224],"about_ca_topic_score_codex":0.00008638021,"about_ca_topic_score_gemma":0.0000026943355,"teacher_disagreement_score":0.70636415,"about_ca_system_score_codex":0.000050397077,"about_ca_system_score_gemma":0.000046345434,"threshold_uncertainty_score":0.5838848},"labels":[],"label_agreement":null},{"id":"W2021979706","doi":"10.1109/lcomm.2015.2390648","title":"On Characterization and Efficient Exhaustive Search of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Complement (music); Simple (philosophy); Variable (mathematics); Tanner graph; Code (set theory); Mathematics; Characterization (materials science); Decoding methods; Graph; Set (abstract data type); Computer science; Algorithm; Theoretical computer science; Discrete mathematics; Error floor","score_opus":0.05075294354137328,"score_gpt":0.30113989423923276,"score_spread":0.2503869506978595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021979706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55576575,0.000028616849,0.44198427,0.0017800357,0.00006091193,0.00019360876,0.000009003565,0.000075427706,0.000102414226],"genre_scores_gemma":[0.90529084,0.000017887392,0.09422039,0.0004093882,0.000005574939,0.000021130581,0.00002209389,0.00000812095,0.000004547868],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889386,0.00022300241,0.00029617985,0.00019084677,0.00025787836,0.00013825404],"domain_scores_gemma":[0.997922,0.00024126246,0.00018422361,0.001413084,0.00018690928,0.00005249637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074621045,0.000100772,0.00016692554,0.00022527765,0.00009202236,0.00002472513,0.001160008,0.000035827634,0.000001057699],"category_scores_gemma":[0.000043603828,0.000107101696,0.000026361238,0.0004433428,0.00018574821,0.00015206444,0.00033096163,0.00015869961,0.0000011708403],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025474643,0.00033551527,0.0019962755,0.00006254544,0.00006300089,0.000001162448,0.008443725,0.0037371481,0.95907307,0.015696201,0.00066301547,0.009902857],"study_design_scores_gemma":[0.0011893692,0.00053763407,0.012533258,0.00080670376,0.000058696638,0.000022867762,0.0007242689,0.48020688,0.5017475,0.0010259923,0.0005551501,0.00059167296],"about_ca_topic_score_codex":0.0001102633,"about_ca_topic_score_gemma":0.0000036473323,"teacher_disagreement_score":0.47646973,"about_ca_system_score_codex":0.000068521644,"about_ca_system_score_gemma":0.000054369757,"threshold_uncertainty_score":0.43674803},"labels":[],"label_agreement":null},{"id":"W2024542872","doi":"10.1109/lcomm.2014.2349978","title":"Connectivity Analysis for Cooperative Vehicular Ad Hoc Networks Under Nakagami Fading Channel","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Fading; Independent and identically distributed random variables; Nakagami distribution; Computer science; Wireless ad hoc network; Vehicular ad hoc network; Interference (communication); Channel (broadcasting); Computer network; Scheduling (production processes); Wireless; Telecommunications; Mathematical optimization; Mathematics; Statistics; Random variable","score_opus":0.021803605597007107,"score_gpt":0.24393005988729566,"score_spread":0.22212645429028854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024542872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.145824,0.0018937323,0.84835875,0.002572154,0.00027860244,0.00046713318,0.000018518891,0.00038066803,0.00020646455],"genre_scores_gemma":[0.9928927,0.00049485086,0.0041051586,0.0017199228,0.0001420096,0.0003187787,0.00022828786,0.00007556776,0.000022762584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984219,0.0002847988,0.00034211972,0.00030277343,0.00014854726,0.00049985637],"domain_scores_gemma":[0.9968476,0.0008208554,0.00008403799,0.0020029363,0.00011704269,0.00012747734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005720071,0.00029101732,0.00044490234,0.00023926272,0.00044654164,0.00010982391,0.00090305187,0.00014965213,0.000008905253],"category_scores_gemma":[0.000048569233,0.00032403116,0.0002901754,0.00091672025,0.00015829333,0.00020840522,0.00010408253,0.00046269668,0.000019544408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051668,0.00002645053,0.000089238456,0.000011305534,0.00090342824,5.164596e-7,0.00020543934,0.99280626,0.002172582,0.00034813405,0.002480094,0.0009513779],"study_design_scores_gemma":[0.00041688117,0.00002124547,0.0008291362,0.000027229114,0.00039605174,0.0000027296198,0.000057085294,0.9860693,0.0002667969,0.00006186744,0.01147675,0.0003749167],"about_ca_topic_score_codex":0.000010241839,"about_ca_topic_score_gemma":0.00041281554,"teacher_disagreement_score":0.84706867,"about_ca_system_score_codex":0.0002064883,"about_ca_system_score_gemma":0.000011604218,"threshold_uncertainty_score":0.9999212},"labels":[],"label_agreement":null},{"id":"W2029615805","doi":"10.1109/lcomm.2013.010313.122072","title":"Blind Compensation of Frequency-Dependent I/Q Imbalance in Direct Conversion OFDM Receivers","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Communications Research Centre Canada","funders":"","keywords":"Orthogonal frequency-division multiplexing; Kurtosis; Computer science; Minification; Interference (communication); Compensation (psychology); Algorithm; Phase-shift keying; Electronic engineering; Telecommunications; Control theory (sociology); Mathematics; Bit error rate; Statistics; Engineering; Artificial intelligence","score_opus":0.022957755910449035,"score_gpt":0.2412877552428636,"score_spread":0.21832999933241456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029615805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9517636,0.00067572534,0.031417977,0.0026476793,0.0005977822,0.0009921608,0.000025354337,0.00032514983,0.011554607],"genre_scores_gemma":[0.98647696,0.00036053153,0.012807331,0.00020521227,0.000010418185,0.00006759693,0.000024143485,0.000023484992,0.000024296],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991443,0.0000994152,0.0003175288,0.00012849715,0.00013361871,0.00017663284],"domain_scores_gemma":[0.99845684,0.00022325848,0.00007711384,0.0011433833,0.000057522317,0.000041907108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013306824,0.00012461322,0.00018039467,0.00018036214,0.000048614493,0.000015488513,0.00064916734,0.000056203506,0.00005808509],"category_scores_gemma":[0.000018697101,0.00014711362,0.00003816025,0.00027407936,0.00012711376,0.0003265454,0.00004285934,0.00023365836,0.00012444911],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011284492,0.00008287978,0.018819211,0.000071179704,0.000058133355,0.0000019877527,0.0014238689,0.05902252,0.9116769,0.00024997012,0.007123011,0.0014590785],"study_design_scores_gemma":[0.011462155,0.00020873538,0.33490035,0.0012495209,0.00017189671,0.00003404234,0.0021449148,0.24698688,0.38189673,0.003399252,0.013919966,0.0036255463],"about_ca_topic_score_codex":0.00030792278,"about_ca_topic_score_gemma":0.000069825954,"teacher_disagreement_score":0.52978015,"about_ca_system_score_codex":0.00018586245,"about_ca_system_score_gemma":0.000011352086,"threshold_uncertainty_score":0.5999119},"labels":[],"label_agreement":null},{"id":"W2030719027","doi":"10.1109/lcomm.2012.112812.121785","title":"A Rate-Compatible Puncturing Scheme for Finite-Length LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Puncturing; Low-density parity-check code; Additive white Gaussian noise; Algorithm; Computer science; Forward error correction; Turbo code; Bit error rate; Concatenated error correction code; Mathematics; Code (set theory); Decoding methods; Channel (broadcasting); Theoretical computer science; Block code; Telecommunications","score_opus":0.06853258175673221,"score_gpt":0.3152987726318352,"score_spread":0.246766190875103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030719027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037168574,0.00030659436,0.9466765,0.012586607,0.0006740814,0.0005025565,0.0000063239936,0.001115865,0.00096291915],"genre_scores_gemma":[0.5942802,0.000025375191,0.403135,0.0021802543,0.00006948593,0.0002452302,0.000009013702,0.00001816428,0.000037317106],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985864,0.00022180319,0.00031441962,0.00025132016,0.00014890586,0.00047713015],"domain_scores_gemma":[0.99469423,0.0016366551,0.00017472613,0.0032783053,0.000109121385,0.00010697408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957469,0.00019714203,0.00020516763,0.00020011964,0.00049361645,0.00015685843,0.0033930978,0.000063945634,0.0000037396399],"category_scores_gemma":[0.0002597914,0.0001994246,0.00011935775,0.0004193414,0.00009394091,0.0008625689,0.00054067804,0.00030663915,0.000053741027],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049187795,0.0016392382,0.0321642,0.00027808434,0.00038632762,0.000003548289,0.021651745,0.0014245657,0.5725167,0.12611282,0.19614369,0.04762992],"study_design_scores_gemma":[0.0016239529,0.00020669839,0.006198317,0.00042230208,0.00009955284,0.000039704246,0.00032481592,0.33172053,0.35111713,0.004490968,0.30130517,0.0024508564],"about_ca_topic_score_codex":0.000052566862,"about_ca_topic_score_gemma":0.00002695413,"teacher_disagreement_score":0.55711156,"about_ca_system_score_codex":0.00011199931,"about_ca_system_score_gemma":0.00003544338,"threshold_uncertainty_score":0.8132299},"labels":[],"label_agreement":null},{"id":"W2033185214","doi":"10.1109/lcomm.2015.2472531","title":"Capacity Bounds for a Class of Diamond Networks With Conferencing Relays","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Upper and lower bounds; Channel capacity; Relay; Wireless network; Gaussian; Channel (broadcasting); Wireless; Backhaul (telecommunications); Telecommunications; Mathematics","score_opus":0.11803532122572682,"score_gpt":0.2908637812203323,"score_spread":0.17282845999460547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033185214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028325574,0.0005095804,0.95384395,0.014673351,0.00015145705,0.00046299488,0.0000042218467,0.00011337748,0.0019155174],"genre_scores_gemma":[0.876051,0.00019526311,0.12208188,0.0014023951,0.000029567718,0.00017922583,0.0000135951,0.0000126567,0.000034382127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987807,0.00028333097,0.00032749012,0.00021322614,0.00016544077,0.00022980558],"domain_scores_gemma":[0.9955282,0.00052275654,0.00022114834,0.0031649629,0.00044620575,0.00011668656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063864526,0.00014449013,0.0002236802,0.00010899071,0.00032338212,0.00011802526,0.0028635226,0.000053043586,0.0000011967124],"category_scores_gemma":[0.00007229854,0.0001334659,0.000062730454,0.00051904225,0.00031710666,0.0003649387,0.0004222951,0.00027534584,0.0000032932853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016230375,0.0008811039,0.012937897,0.00008249866,0.0005429046,0.0000033214305,0.02630732,0.0694907,0.028452298,0.70726216,0.08349215,0.07038536],"study_design_scores_gemma":[0.0017504584,0.00021810296,0.0014369944,0.00016771749,0.000040397594,0.000016520587,0.00017844343,0.92642105,0.001565084,0.0006393641,0.06705768,0.0005081697],"about_ca_topic_score_codex":0.000025040295,"about_ca_topic_score_gemma":0.0002626262,"teacher_disagreement_score":0.8569304,"about_ca_system_score_codex":0.000102306156,"about_ca_system_score_gemma":0.00012452037,"threshold_uncertainty_score":0.5442582},"labels":[],"label_agreement":null},{"id":"W2035154204","doi":"10.1109/lcomm.2011.111011.111729","title":"Capacity of the Gaussian Relay Channel with Correlated Noises to Within a Constant Gap","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Relay channel; Topology (electrical circuits); Gaussian; Quantization (signal processing); Constant (computer programming); Channel (broadcasting); Computer science; Mathematics; Coding (social sciences); Channel capacity; Linear network coding; Corollary; Algorithm; Telecommunications; Computer network; Network packet; Discrete mathematics; Statistics; Combinatorics; Physics","score_opus":0.10624464929136626,"score_gpt":0.2608317638905518,"score_spread":0.15458711459918553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035154204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38123852,0.00045060908,0.51628727,0.07657186,0.00083817675,0.0016549048,0.000019024264,0.00042922853,0.022510424],"genre_scores_gemma":[0.9519071,0.000082172795,0.044196773,0.0036728524,0.0000068394484,0.00006295551,0.0000015224117,0.000011732184,0.000058044217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856955,0.0004594295,0.00035596793,0.00022054893,0.00019562908,0.00019888488],"domain_scores_gemma":[0.9947307,0.00016920848,0.0002455177,0.004567377,0.00019426366,0.00009289941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369133,0.00015500221,0.00018082258,0.00011593552,0.00050814485,0.000047216177,0.0045066793,0.00004186815,0.000009407433],"category_scores_gemma":[0.000053532673,0.00010906428,0.00006138237,0.0010969002,0.00048487456,0.00022968517,0.0008043007,0.00037647525,0.000022580307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016208562,0.001502339,0.01277996,0.000052718395,0.0005576711,0.000010296594,0.18964215,0.0075032096,0.14920314,0.61035484,0.019797316,0.008434281],"study_design_scores_gemma":[0.0098849,0.0020355189,0.17428741,0.0065529696,0.00059270405,0.0006941651,0.0046143616,0.48570797,0.26193136,0.005603951,0.040802583,0.0072920877],"about_ca_topic_score_codex":0.0000879392,"about_ca_topic_score_gemma":0.00054231385,"teacher_disagreement_score":0.6047509,"about_ca_system_score_codex":0.000059682763,"about_ca_system_score_gemma":0.00008012711,"threshold_uncertainty_score":0.83746064},"labels":[],"label_agreement":null},{"id":"W2041176458","doi":"10.1109/lcomm.2012.050912.120103","title":"Two-Way Amplify-and-Forward Relaying with Gaussian Imperfect Channel Estimations","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Relay; Computer science; Channel (broadcasting); Gaussian; Reliability (semiconductor); Upper and lower bounds; Signal-to-noise ratio (imaging); Bounded function; Imperfect; Probability density function; Selection (genetic algorithm); Topology (electrical circuits); Algorithm; Telecommunications; Mathematics; Statistics; Power (physics)","score_opus":0.04853330916029852,"score_gpt":0.29870221642690065,"score_spread":0.2501689072666021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041176458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04001729,0.0027798205,0.8985759,0.05031246,0.00029268584,0.00051306793,0.00000535514,0.0005061912,0.006997243],"genre_scores_gemma":[0.8910787,0.0007789617,0.10475713,0.003095122,0.000060833827,0.00014461111,0.000018362503,0.00002072936,0.000045519686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845433,0.00039562793,0.00029427386,0.00024699792,0.00018752179,0.00042126907],"domain_scores_gemma":[0.9957947,0.00047094407,0.00014835906,0.0032939704,0.00008744104,0.00020455093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059715676,0.00021267959,0.0001978436,0.0001971436,0.0011880053,0.0002419235,0.0021638344,0.000046925266,0.000008930217],"category_scores_gemma":[0.000043859804,0.00019006722,0.000050190145,0.00067419966,0.0002598898,0.0011552152,0.00075572636,0.00046963696,0.00008207504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031130614,0.0009205171,0.013789335,0.000065194276,0.0004868079,0.0000058082046,0.033920694,0.0046964865,0.047119487,0.74031615,0.017462775,0.14118563],"study_design_scores_gemma":[0.0070760907,0.00043948286,0.07417611,0.0011320871,0.00040131438,0.0009678986,0.0016775609,0.7475255,0.006896258,0.0017002563,0.15255122,0.0054561878],"about_ca_topic_score_codex":0.000026422746,"about_ca_topic_score_gemma":0.00005972704,"teacher_disagreement_score":0.85106146,"about_ca_system_score_codex":0.00008908175,"about_ca_system_score_gemma":0.00003517564,"threshold_uncertainty_score":0.91372967},"labels":[],"label_agreement":null},{"id":"W2042973944","doi":"10.1109/4234.917106","title":"Credit-based processor sharing for decoupled delay and bandwidth allocation","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamic bandwidth allocation; Bandwidth (computing); Computer science; Processor sharing; Computer network; Bandwidth allocation; Channel allocation schemes; Telecommunications; Queueing theory; Wireless","score_opus":0.029587377245606967,"score_gpt":0.26967762565543313,"score_spread":0.24009024840982615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042973944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04402839,0.00040186298,0.90799695,0.046700794,0.00015667385,0.00037959652,0.0000018449532,0.00020739897,0.0001264678],"genre_scores_gemma":[0.92853713,0.00009898912,0.06608678,0.004737183,0.00008072739,0.0003725241,0.00001735103,0.000011302156,0.000058026155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913263,0.00004337024,0.0002204107,0.00028122787,0.00011220108,0.000210183],"domain_scores_gemma":[0.9980184,0.00036725926,0.00010064153,0.001314727,0.00012398763,0.000074983196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031048383,0.000115485156,0.000119947676,0.000092645074,0.0004146688,0.00018396275,0.0015064444,0.00004359687,0.0000025868064],"category_scores_gemma":[0.000038089678,0.0001194822,0.000043821663,0.00026724135,0.00008988791,0.00033040723,0.00010014992,0.00011344741,0.00000738954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001494516,0.00057731406,0.009842526,0.00011539827,0.00020857237,0.00000900524,0.0015315925,0.038826846,0.014228745,0.061866317,0.027531404,0.8451128],"study_design_scores_gemma":[0.00082068954,0.000027002088,0.00061594736,0.000031815744,0.000018641147,0.000008991357,0.000008137003,0.9777461,0.00010842213,0.0003071631,0.020142691,0.00016438594],"about_ca_topic_score_codex":0.000013757275,"about_ca_topic_score_gemma":0.00008318257,"teacher_disagreement_score":0.93891925,"about_ca_system_score_codex":0.000037097005,"about_ca_system_score_gemma":0.00004871023,"threshold_uncertainty_score":0.48723426},"labels":[],"label_agreement":null},{"id":"W2046842299","doi":"10.1109/lcomm.2012.082012.121066","title":"All-Optical Amplify-and-Forward Relaying System for Atmospheric Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Ciena (Canada)","funders":"","keywords":"Relay; Computer science; Channel state information; Channel (broadcasting); Transmission (telecommunications); Signal-to-noise ratio (imaging); Free-space optical communication; Noise (video); Amplifier; Topology (electrical circuits); Electronic engineering; Outage probability; Telecommunications; Optical communication; Physics; Wireless; Fading; Electrical engineering; Bandwidth (computing); Artificial intelligence; Engineering","score_opus":0.03665492067292079,"score_gpt":0.2646080133560589,"score_spread":0.2279530926831381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046842299","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4964561,0.012796067,0.4433643,0.029568573,0.0018369919,0.0018767468,0.000045547902,0.0078086876,0.0062470133],"genre_scores_gemma":[0.8856726,0.0006592558,0.112645626,0.00035808005,0.000057391295,0.0005161155,0.000023691797,0.000057200854,0.0000100161515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988856,0.000055889766,0.00035603982,0.00013319652,0.00011210413,0.00045719938],"domain_scores_gemma":[0.996849,0.0007067452,0.000054146156,0.0022252542,0.000040185074,0.00012467211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003217527,0.00019762114,0.0002433567,0.00004167715,0.00025378473,0.00007067326,0.001206382,0.00016146712,0.000002650515],"category_scores_gemma":[0.000083209474,0.00020877185,0.00007339112,0.00021145496,0.00026169632,0.00028673693,0.00028345635,0.00041088933,0.00007010263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057601195,0.00059940666,0.0054946374,0.0017097014,0.0016134805,0.0000024467313,0.0052104318,0.02322122,0.23294185,0.54530305,0.040283233,0.14356293],"study_design_scores_gemma":[0.002420264,0.00011265939,0.0029580514,0.0005473778,0.00044092519,0.00012958076,0.0046183453,0.51178306,0.044917624,0.0006256181,0.42856526,0.0028812208],"about_ca_topic_score_codex":0.0000069962316,"about_ca_topic_score_gemma":0.0000016507573,"teacher_disagreement_score":0.54467744,"about_ca_system_score_codex":0.00018445645,"about_ca_system_score_gemma":0.000005285468,"threshold_uncertainty_score":0.8513469},"labels":[],"label_agreement":null},{"id":"W2046943920","doi":"10.1109/lcomm.2014.2331070","title":"Fast and Accurate Error Floor Estimation of Quantized Iterative Decoders for Variable-Regular LDPC Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Variable (mathematics); Computer science; Error floor; Error detection and correction; Code (set theory); Random variable; Iterative method; Concatenated error correction code; Theoretical computer science; Mathematics; Block code; Statistics; Set (abstract data type)","score_opus":0.0358510518894255,"score_gpt":0.31529368093715215,"score_spread":0.27944262904772665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046943920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041427545,0.00006162159,0.950898,0.0065955943,0.00014047622,0.00045658826,0.00001130486,0.0002836154,0.00012524822],"genre_scores_gemma":[0.49124137,0.000009842051,0.5080457,0.00057418057,0.000007849775,0.00008836802,0.000012336382,0.000010407983,0.000009973347],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986534,0.0003236145,0.0003912888,0.00028902633,0.00014029813,0.00020235364],"domain_scores_gemma":[0.9965162,0.0009839582,0.00031146075,0.0019427002,0.00019386043,0.00005177786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080750085,0.00016576554,0.00026188284,0.00018724508,0.00031167417,0.00013099994,0.0016540297,0.00006350344,0.0000011306912],"category_scores_gemma":[0.00034703052,0.0001710688,0.000060194838,0.00034238104,0.00022766567,0.0005576546,0.00027158434,0.00015156023,0.0000029607124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011346992,0.00048450884,0.0007706429,0.00042275118,0.0003313723,9.4807973e-7,0.017748175,0.04857741,0.5419356,0.24015373,0.012272973,0.13718842],"study_design_scores_gemma":[0.00042842198,0.00007176031,0.00023928366,0.00010898614,0.000026397778,0.00000632903,0.000054276217,0.9749773,0.019723019,0.00356345,0.00059393427,0.00020683814],"about_ca_topic_score_codex":0.00007675548,"about_ca_topic_score_gemma":0.00004063433,"teacher_disagreement_score":0.9263999,"about_ca_system_score_codex":0.00004095849,"about_ca_system_score_gemma":0.00003844023,"threshold_uncertainty_score":0.6975983},"labels":[],"label_agreement":null},{"id":"W2051270424","doi":"10.1109/lcomm.2011.101811.111480","title":"A Simplified Successive-Cancellation Decoder for Polar Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":457,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Computer science; Block code; Algorithm; Latency (audio); Soft-decision decoder; Polar; Bit error rate; Concatenated error correction code; Linear code; Polar code; Telecommunications","score_opus":0.09236214429013771,"score_gpt":0.3130310112581669,"score_spread":0.22066886696802918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051270424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012233958,0.00011387105,0.9784964,0.0059349174,0.00026470236,0.00042591343,0.000008908242,0.0006988197,0.0018225098],"genre_scores_gemma":[0.63087904,0.000019563291,0.36717623,0.001692589,0.000020594569,0.0001581468,0.000009050444,0.000013902051,0.000030855408],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998925,0.00013875261,0.0002804617,0.00028183885,0.00012340293,0.00025058354],"domain_scores_gemma":[0.9963715,0.00049601676,0.0001972191,0.0027228976,0.0001550281,0.000057347956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035713986,0.0001413695,0.00014670785,0.0001619318,0.00038406468,0.00008803119,0.0031549581,0.000061106606,0.00000529271],"category_scores_gemma":[0.000093463124,0.00015228636,0.00008646347,0.00032477,0.00011866369,0.00048619986,0.0002808084,0.00017637631,0.000021646114],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011144101,0.0010656586,0.020697499,0.00015770199,0.0003463132,0.000009207194,0.038434274,0.0003896856,0.413162,0.27101654,0.12986758,0.12474211],"study_design_scores_gemma":[0.0025602144,0.0005063617,0.016086744,0.00040729804,0.00018949097,0.000068833724,0.00045004216,0.4810406,0.3466175,0.055957273,0.09277444,0.0033412257],"about_ca_topic_score_codex":0.00028558393,"about_ca_topic_score_gemma":0.00027578734,"teacher_disagreement_score":0.6186451,"about_ca_system_score_codex":0.00008179357,"about_ca_system_score_gemma":0.00004406562,"threshold_uncertainty_score":0.6210058},"labels":[],"label_agreement":null},{"id":"W2055352979","doi":"10.1109/lcomm.2004.835348","title":"Downlink Scheduling Optimization in CDMA Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Computer science; Scheduling (production processes); Code division multiple access; Computer network; Mathematical optimization; Mathematics","score_opus":0.03602031398417922,"score_gpt":0.29543541199820617,"score_spread":0.25941509801402696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055352979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071949037,0.0007075575,0.9372068,0.053495597,0.00016003587,0.0003081869,6.849248e-7,0.00024364416,0.00068261265],"genre_scores_gemma":[0.6153808,0.00092563004,0.38187066,0.0016440953,0.000036824094,0.00009863091,0.000020955604,0.000015456242,0.000006919397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979985,0.0004227565,0.0004855681,0.00034392232,0.00030168096,0.0004475907],"domain_scores_gemma":[0.99387974,0.0003755216,0.0001447722,0.0053647305,0.00012596148,0.000109270484],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007440276,0.00017233558,0.00018959823,0.00038190602,0.0003985655,0.00028817749,0.0067486623,0.000108944434,0.0000058922424],"category_scores_gemma":[0.00006610426,0.0001955755,0.000070376416,0.0017925396,0.00022749153,0.0008537389,0.0011646474,0.0008233883,0.000052974483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022265835,0.00010219009,0.0002714764,0.0000026779019,0.00000886344,0.000002592639,0.00030419193,0.98102844,0.00041094722,0.012942688,0.00012536181,0.004798346],"study_design_scores_gemma":[0.0005961805,0.000011209471,0.0006808303,0.0000803637,0.0000023486607,0.000008048933,0.000022244296,0.9972292,0.00011150172,0.0003711077,0.00066909334,0.00021786621],"about_ca_topic_score_codex":0.00013832016,"about_ca_topic_score_gemma":0.000156957,"teacher_disagreement_score":0.60818595,"about_ca_system_score_codex":0.00033992098,"about_ca_system_score_gemma":0.000112440255,"threshold_uncertainty_score":0.9986253},"labels":[],"label_agreement":null},{"id":"W2057542493","doi":"10.1109/lcomm.2006.1714538","title":"Parallel processing for fast iterative decoding of orthogonal convolutional codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Decoding methods; Sequential decoding; Computer science; Algorithm; Serial concatenated convolutional codes; List decoding; Berlekamp–Welch algorithm; Concatenated error correction code; Theoretical computer science; Block code","score_opus":0.038993725407732806,"score_gpt":0.3071188366573375,"score_spread":0.2681251112496047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057542493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025400372,0.00021168371,0.9679207,0.005246464,0.00008721013,0.00026851922,0.000014836342,0.00025458896,0.0005955949],"genre_scores_gemma":[0.55234253,0.000004390089,0.44716862,0.00031992124,0.00002368173,0.000097023694,0.000017062635,0.0000068023605,0.000019976793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895257,0.00010390044,0.0003600053,0.00022071689,0.00016572447,0.00019711076],"domain_scores_gemma":[0.99800277,0.00047337794,0.00026192336,0.0009830107,0.00025316974,0.00002574375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273579,0.0001227217,0.0001637358,0.00015068137,0.00036596265,0.000086860244,0.0016806045,0.000042067804,0.0000011993704],"category_scores_gemma":[0.000041991545,0.0001315243,0.00008540947,0.00029973406,0.00022146819,0.00042355637,0.00020569019,0.00014872524,0.0000021936132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050799288,0.0007923632,0.020909775,0.00019971607,0.00010847935,0.0000032290206,0.0046786903,0.008555257,0.40887794,0.47708756,0.032510087,0.04622612],"study_design_scores_gemma":[0.0011656347,0.00013290819,0.010651331,0.00047400876,0.000047225065,0.00005820568,0.0001513852,0.9179973,0.041100446,0.020302827,0.0069913585,0.0009273526],"about_ca_topic_score_codex":0.00004623792,"about_ca_topic_score_gemma":0.00009630683,"teacher_disagreement_score":0.90944207,"about_ca_system_score_codex":0.00007468595,"about_ca_system_score_gemma":0.00008294257,"threshold_uncertainty_score":0.5363405},"labels":[],"label_agreement":null},{"id":"W2057929897","doi":"10.1109/lcomm.2011.103111.111420","title":"MGF Based Analysis of Area under the ROC Curve in Energy Detection","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Receiver operating characteristic; Nakagami distribution; Moment-generating function; Maximal-ratio combining; Energy (signal processing); Detector; Signal-to-noise ratio (imaging); Detection theory; Computer science; Area under curve; Function (biology); Noise (video); Algorithm; Moment (physics); Diversity combining; Statistics; Telecommunications; Mathematics; Topology (electrical circuits); Probability density function; Channel (broadcasting); Physics; Artificial intelligence","score_opus":0.04853804823375149,"score_gpt":0.24661296499188148,"score_spread":0.19807491675813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057929897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10573825,0.0001228269,0.8898683,0.003480657,0.000065474385,0.000047859787,0.0000011492806,0.000031544452,0.00064391695],"genre_scores_gemma":[0.993381,0.00005345278,0.0045764414,0.0019591246,0.000008255657,0.000010502916,0.0000036805034,0.000004733632,0.0000027627602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990678,0.00030613109,0.00022122274,0.00015485415,0.00011115714,0.00013887508],"domain_scores_gemma":[0.9977637,0.00037921668,0.00011921649,0.0016605903,0.00005416134,0.00002311548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026926206,0.0000803868,0.00014263042,0.00036540726,0.0001451927,0.000031716805,0.0011210012,0.000029048362,0.0000054054976],"category_scores_gemma":[0.000009506658,0.00006736395,0.00011301224,0.001894603,0.00012815683,0.00013201381,0.00010822429,0.0001390415,0.0000011611937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010202001,0.0017532251,0.04135926,0.000019000046,0.0033802837,0.000026562695,0.015296276,0.34597525,0.12795332,0.1247186,0.00108708,0.33832914],"study_design_scores_gemma":[0.0001237659,0.000012655827,0.057622515,0.0000126194855,0.000086826425,0.0000013584804,0.000060896375,0.93767333,0.0036951846,0.00037923834,0.00022895112,0.00010266062],"about_ca_topic_score_codex":0.0010531442,"about_ca_topic_score_gemma":0.008490802,"teacher_disagreement_score":0.8876428,"about_ca_system_score_codex":0.000060692706,"about_ca_system_score_gemma":0.000020470701,"threshold_uncertainty_score":0.47380668},"labels":[],"label_agreement":null},{"id":"W2059000027","doi":"10.1109/lcomm.2014.012114.132638","title":"Optimum Bit-Sensor Assignment for Distributed Estimation in Inhomogeneous Sensor Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless sensor network; Fusion center; Computer science; Quantization (signal processing); Sensor fusion; Transmission (telecommunications); Context (archaeology); Real-time computing; Sensor node; Algorithm; Key distribution in wireless sensor networks; Wireless network; Wireless; Computer network; Telecommunications; Artificial intelligence; Cognitive radio","score_opus":0.019345595114381716,"score_gpt":0.2556748496758345,"score_spread":0.23632925456145276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059000027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037501005,0.0000734888,0.9839304,0.0107524935,0.0005553954,0.0005323852,0.000038938066,0.00026600805,0.000100772355],"genre_scores_gemma":[0.7168337,0.00005050613,0.28064466,0.0018745204,0.00009181156,0.0002230477,0.00023033364,0.000022607057,0.000028807417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980925,0.00031060705,0.0005187276,0.00041162292,0.00021358451,0.00045300912],"domain_scores_gemma":[0.9966402,0.00067197013,0.0002149039,0.0022317816,0.000115125644,0.00012600214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005370597,0.00022539377,0.00025941015,0.00017705017,0.0003765293,0.00026501136,0.0015445356,0.00012050577,0.0000031864033],"category_scores_gemma":[0.00010087165,0.00024048999,0.00011937744,0.00072099676,0.000117395095,0.0002646491,0.00021355177,0.00029625764,0.000024030713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012965554,0.00015183102,0.000092106195,0.0000075400535,0.000028958972,0.0000026604225,0.00008131896,0.95230895,0.0012388849,0.0019312028,0.0053841188,0.03875948],"study_design_scores_gemma":[0.0006523731,0.000056019097,0.00043497153,0.000027685852,0.000011892297,0.000017588614,0.000015797834,0.98189265,0.0003658688,0.00021643762,0.016033811,0.00027490908],"about_ca_topic_score_codex":0.000031207404,"about_ca_topic_score_gemma":0.000024554738,"teacher_disagreement_score":0.7130836,"about_ca_system_score_codex":0.00019957036,"about_ca_system_score_gemma":0.000022486269,"threshold_uncertainty_score":0.9806897},"labels":[],"label_agreement":null},{"id":"W2059437848","doi":"10.1109/lcomm.2013.060513.130403","title":"An Accurate Approximation of the Exponential Integral Function Using a Sum of Exponentials","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hybrid automatic repeat request; Exponential function; Computer science; Interference (communication); Automatic repeat request; Function (biology); Signal-to-noise ratio (imaging); Algorithm; Applied mathematics; Expression (computer science); Moment-generating function; Mathematics; Mathematical optimization; Channel (broadcasting); Probability density function; Telecommunications link; Statistics; Telecommunications; Mathematical analysis","score_opus":0.0771026503211399,"score_gpt":0.30266393527125296,"score_spread":0.22556128495011307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059437848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4613435,0.00014006712,0.53552556,0.0023002722,0.0002344007,0.00031986262,0.0000016644988,0.000040952833,0.000093730676],"genre_scores_gemma":[0.9704813,0.000088025015,0.028906716,0.00042227548,0.000022709179,0.000053682426,0.000009194623,0.000008700329,0.000007396549],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822557,0.00076418155,0.00049572985,0.00016570573,0.00020551903,0.00014329476],"domain_scores_gemma":[0.9955405,0.00013961337,0.00043290824,0.0035510163,0.0002965672,0.00003936893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000385325,0.00011741394,0.00016866802,0.00013230319,0.00032449956,0.00009921388,0.0033237855,0.000043552896,0.000023422313],"category_scores_gemma":[0.000036420377,0.000095753545,0.00010259996,0.00062873604,0.0002557507,0.0010684035,0.0005449676,0.0001939433,0.0000070992496],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035850355,0.00012886223,0.00034980354,0.000008229881,0.000028724266,1.8905043e-8,0.0011723256,0.0011963813,0.97497666,0.011478896,0.00037126167,0.010285259],"study_design_scores_gemma":[0.00057069835,0.000066417975,0.017525427,0.00016891873,0.000058023517,0.0000058174787,0.00030849286,0.8752272,0.104095116,0.0010230402,0.0006278653,0.00032295706],"about_ca_topic_score_codex":0.00012445403,"about_ca_topic_score_gemma":0.000036574704,"teacher_disagreement_score":0.8740308,"about_ca_system_score_codex":0.000039703093,"about_ca_system_score_gemma":0.000047205765,"threshold_uncertainty_score":0.6176476},"labels":[],"label_agreement":null},{"id":"W2059790685","doi":"10.1109/lcomm.2014.021814.132488","title":"A Multiple-Ring Model for Cognitive Radio Aggregate Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Cognitive radio; Fading; Path loss; Interference (communication); Computer science; Log-distance path loss model; Shadow mapping; Guard (computer science); Telecommunications; Topology (electrical circuits); Statistical physics; Algorithm; Mathematics; Wireless; Physics; Artificial intelligence; Combinatorics","score_opus":0.04436874777889503,"score_gpt":0.27530224178901064,"score_spread":0.2309334940101156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059790685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033271965,0.00012313292,0.957858,0.0074678333,0.00017284081,0.00030983944,0.000006743583,0.00018389826,0.0006057309],"genre_scores_gemma":[0.8801326,0.000060179056,0.11689774,0.0027046613,0.00007307908,0.00006988625,0.00001095335,0.000017321228,0.000033540404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877167,0.00015864748,0.00026090344,0.00035261107,0.00011352637,0.00034262837],"domain_scores_gemma":[0.99676394,0.0014694534,0.00013757308,0.0014006994,0.000140891,0.00008743231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000349278,0.00017241082,0.00019837552,0.00013024773,0.00045832986,0.00020352825,0.0016209717,0.000043216787,6.0790353e-7],"category_scores_gemma":[0.00018457301,0.00018319908,0.000115367984,0.00024395405,0.00017204096,0.0003680428,0.00030993088,0.00024541435,0.000014392143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100003024,0.00035124295,0.0010784224,0.00006386289,0.0002995512,0.0000057534,0.010959316,0.029394373,0.059088863,0.07462843,0.0037056531,0.82032454],"study_design_scores_gemma":[0.0006150288,0.000027522703,0.00015905638,0.00014485998,0.000017114273,0.000011120981,0.000022360471,0.99589795,0.0012942107,0.0011186171,0.00045788713,0.0002342734],"about_ca_topic_score_codex":0.00002053111,"about_ca_topic_score_gemma":0.00011938587,"teacher_disagreement_score":0.96650356,"about_ca_system_score_codex":0.00006358531,"about_ca_system_score_gemma":0.000028938694,"threshold_uncertainty_score":0.7470642},"labels":[],"label_agreement":null},{"id":"W2060598730","doi":"10.1109/lcomm.2012.040912.120236","title":"Accurate Outage Approximation of MRC Receivers in Arbitrarily Fading Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Maximal-ratio combining; Diversity combining; Outage probability; Computer science; Signal-to-noise ratio (imaging); Moment-generating function; Moment (physics); Fading distribution; Algorithm; Diversity gain; Mathematics; Topology (electrical circuits); Mathematical optimization; Telecommunications; Probability density function; Statistics; Channel (broadcasting); Physics; Rayleigh fading; Combinatorics","score_opus":0.04097429130748426,"score_gpt":0.2827026336198165,"score_spread":0.24172834231233226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060598730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6004176,0.0017676895,0.38544717,0.0024323924,0.00047432783,0.0008657788,0.000026527976,0.0011548317,0.007413627],"genre_scores_gemma":[0.95403945,0.0009082664,0.044656154,0.00015311912,0.000021299515,0.00014154038,0.0000375211,0.000035764315,0.000006887294],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989886,0.00012289744,0.00042517885,0.000090757625,0.00011307776,0.0002594599],"domain_scores_gemma":[0.9977655,0.00021768945,0.00012623826,0.0018023149,0.000037199155,0.000051078896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003211909,0.0001465808,0.00020065896,0.0003095642,0.00007623702,0.00001602581,0.0010512904,0.000075613585,0.00000759798],"category_scores_gemma":[0.000036840196,0.00017824017,0.000052261894,0.00046326182,0.00013061636,0.0007397761,0.00010984235,0.00036806602,0.000016353019],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001740956,0.00032678785,0.0068611326,0.00024897626,0.00011036511,7.5443734e-7,0.013791373,0.28105378,0.66878927,0.009204654,0.0025408533,0.017054629],"study_design_scores_gemma":[0.0017753239,0.000044682885,0.016904147,0.0009014799,0.00007772149,0.000017869239,0.0018647832,0.412155,0.536385,0.0018250821,0.025997965,0.0020509674],"about_ca_topic_score_codex":0.00003186145,"about_ca_topic_score_gemma":0.000014844224,"teacher_disagreement_score":0.3536218,"about_ca_system_score_codex":0.00016680686,"about_ca_system_score_gemma":0.000007054448,"threshold_uncertainty_score":0.7268423},"labels":[],"label_agreement":null},{"id":"W2066331953","doi":"10.1109/lcomm.2011.100611.111690","title":"Performance Analysis of Space Shift Keying with Amplify and Forward Relaying","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"University of Tabuk","keywords":"Transmitter; Relay; Computer science; Antenna (radio); Topology (electrical circuits); Monte Carlo method; Algorithm; Keying; Upper and lower bounds; Expression (computer science); Telecommunications; Detector; Electronic engineering; Mathematics; Statistics; Physics; Power (physics); Engineering; Channel (broadcasting); Combinatorics","score_opus":0.03183447438235305,"score_gpt":0.22988046370937903,"score_spread":0.198045989327026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066331953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89110386,0.00056552474,0.10566134,0.00051957875,0.000017414735,0.00011997486,0.00000685547,0.00044998343,0.0015554808],"genre_scores_gemma":[0.9042783,0.0017607938,0.09381999,0.000052005802,0.0000016791107,0.0000506706,0.0000111594945,0.000022419588,0.0000030017918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99937,0.00003235705,0.00023906695,0.00011575585,0.00008737671,0.00015545251],"domain_scores_gemma":[0.9973312,0.00015569295,0.00009991139,0.0023518545,0.000031758325,0.000029572835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011161171,0.00012855012,0.00022999661,0.00040464423,0.00015013573,0.000011543683,0.00093591074,0.00005793988,0.000005400216],"category_scores_gemma":[0.000014050731,0.00012733138,0.000038344326,0.00086488924,0.00035162253,0.00024277894,0.00016886397,0.00029566142,0.0000029983369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006439925,0.00018970459,0.3987239,0.00035116106,0.0045343693,0.000003024353,0.025408106,0.42372862,0.08310185,0.012364628,0.0003586012,0.051171627],"study_design_scores_gemma":[0.0010511718,0.00013957063,0.47352317,0.0003869822,0.0014995172,0.000013533961,0.0031956823,0.45460644,0.060585167,0.0003617944,0.0031000967,0.0015368904],"about_ca_topic_score_codex":0.000040257153,"about_ca_topic_score_gemma":0.00007582225,"teacher_disagreement_score":0.07479925,"about_ca_system_score_codex":0.0000402056,"about_ca_system_score_gemma":0.0000049571145,"threshold_uncertainty_score":0.51924235},"labels":[],"label_agreement":null},{"id":"W2066459959","doi":"10.1109/lcomm.2013.060513.130802","title":"Artificial-Noise Alignment for Secure Multicast using Multiple Antennas","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Artificial noise; Computer science; Secure multicast; Transmitter; Noise (video); Channel (broadcasting); Generalization; Degrees of freedom (physics and chemistry); Theoretical computer science; Multicast; Upper and lower bounds; Topology (electrical circuits); Algorithm; Computer network; Artificial intelligence; Mathematics; Physics","score_opus":0.05689635463289886,"score_gpt":0.28558247761475164,"score_spread":0.22868612298185279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066459959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5212351,0.0006808942,0.46308553,0.010026445,0.00037691375,0.0024153797,0.00009042133,0.0017263998,0.00036291603],"genre_scores_gemma":[0.8667988,0.00018151483,0.13128664,0.00069995376,0.00005725154,0.0008327304,0.000064414875,0.00007179099,0.0000069008634],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987626,0.00010099118,0.00048214302,0.0001790866,0.0001424492,0.00033269773],"domain_scores_gemma":[0.9963329,0.00042285037,0.00008611453,0.002923351,0.00013975776,0.00009504964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019058533,0.00022193018,0.00022444507,0.00016964391,0.00031770888,0.00012425511,0.0014450254,0.000102688224,0.000022567783],"category_scores_gemma":[0.000052528907,0.00025609595,0.00011787193,0.00022850737,0.00019377923,0.00033955174,0.0001831982,0.000283602,0.00007445968],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034335958,0.00014738711,0.0003417388,0.00005923403,0.00008956334,3.4690652e-7,0.0013747192,0.006594611,0.96825325,0.00092821184,0.015488978,0.0067185382],"study_design_scores_gemma":[0.0002364198,0.000012611359,0.00032164704,0.000086809436,0.000035074765,0.000004688712,0.0002897687,0.92395484,0.052782197,0.00045510245,0.021368923,0.000451907],"about_ca_topic_score_codex":0.00014925917,"about_ca_topic_score_gemma":0.00007110068,"teacher_disagreement_score":0.91736025,"about_ca_system_score_codex":0.0002211536,"about_ca_system_score_gemma":0.000013737749,"threshold_uncertainty_score":0.99998915},"labels":[],"label_agreement":null},{"id":"W2069527340","doi":"10.1109/lcomm.2012.111412.121948","title":"Novel Estimator for the Location Parameter of the Generalized Gaussian Distribution","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Computer science; Estimation theory; Applied mathematics; Gaussian process; Mathematics; Gaussian; Statistics; Algorithm; Mathematical optimization; Physics","score_opus":0.05208177939276664,"score_gpt":0.2892585797711645,"score_spread":0.23717680037839783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069527340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063155782,0.0003396332,0.962493,0.029668493,0.0007704544,0.00029821467,0.000047032692,0.000047732145,0.000019842417],"genre_scores_gemma":[0.8767329,0.0000307314,0.1215469,0.0014357578,0.000077621306,0.000103894665,0.000052051906,0.000006805162,0.000013355901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991934,0.00011488393,0.00023955297,0.000111117384,0.0001452943,0.00019580395],"domain_scores_gemma":[0.9959091,0.0008843061,0.00017758545,0.002906876,0.00008620815,0.00003595587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041395222,0.00008612119,0.000087032975,0.000019503701,0.0005545999,0.00006505429,0.0024499968,0.00003983388,0.000001658201],"category_scores_gemma":[0.00012772165,0.000052327003,0.000083180734,0.00034183214,0.00019829698,0.00026131503,0.00026218142,0.0001392882,0.000005480659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003621299,0.00097260164,0.0076046963,0.00007209065,0.00023100212,8.49462e-8,0.0030902524,0.031393018,0.08843347,0.5297948,0.27990782,0.05846391],"study_design_scores_gemma":[0.00094889797,0.000020606954,0.049185507,0.000100025165,0.000112847185,0.000025681533,0.000064424115,0.7444496,0.009932252,0.0006224614,0.19414517,0.00039249862],"about_ca_topic_score_codex":0.000054667635,"about_ca_topic_score_gemma":0.000007684525,"teacher_disagreement_score":0.8704173,"about_ca_system_score_codex":0.000033131037,"about_ca_system_score_gemma":0.000020090283,"threshold_uncertainty_score":0.45527443},"labels":[],"label_agreement":null},{"id":"W2069794613","doi":"10.1109/lcomm.2012.011312.112462","title":"Decode-Compress-and-Forward with Selective-Cooperation for Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Block Error Rate; Decoding methods; Transmission (telecommunications); Relay channel; Coding (social sciences); Algorithm; Computer network; Real-time computing; Telecommunications link; Telecommunications; Mathematics; Statistics","score_opus":0.03800262803668755,"score_gpt":0.2854847177944032,"score_spread":0.24748208975771566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069794613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117579475,0.0023279677,0.97183514,0.012500825,0.00017775537,0.0005380886,0.000002102931,0.00019853479,0.00066163176],"genre_scores_gemma":[0.8482415,0.0011281809,0.14693594,0.003160574,0.00009056488,0.00033729017,0.00002364763,0.000020069267,0.000062204315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986776,0.0003084074,0.0002709685,0.00024870466,0.00011830183,0.00037599666],"domain_scores_gemma":[0.9967244,0.00059427915,0.00012837147,0.0022166735,0.00020157549,0.00013466648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005574031,0.00018661671,0.00018766391,0.0001102482,0.00093130884,0.00020422722,0.0017157139,0.00006052606,0.0000033438278],"category_scores_gemma":[0.000038782408,0.00016889245,0.000050811595,0.00048369673,0.00016737264,0.0010065201,0.0003933919,0.00030489973,0.0000103238835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015770987,0.0010955838,0.026718311,0.000059164016,0.0006695019,0.0000012558263,0.015681066,0.043682076,0.030513648,0.515594,0.081075594,0.28475207],"study_design_scores_gemma":[0.001538568,0.00014875525,0.009745448,0.000107705055,0.00006903905,0.00005156086,0.000055991866,0.85316634,0.0020559265,0.0001007136,0.13209563,0.00086431304],"about_ca_topic_score_codex":0.0000062690888,"about_ca_topic_score_gemma":0.00006491165,"teacher_disagreement_score":0.8364836,"about_ca_system_score_codex":0.00007990307,"about_ca_system_score_gemma":0.000032400152,"threshold_uncertainty_score":0.71629685},"labels":[],"label_agreement":null},{"id":"W2071536164","doi":"10.1109/lcomm.2012.042512.112350","title":"Which Vehicle To Select?","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network","score_opus":0.026284027826074818,"score_gpt":0.2627422847735626,"score_spread":0.2364582569474878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071536164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9483356,0.00010552499,0.026433462,0.017185323,0.00040589616,0.00024566206,0.000020388516,0.0006332169,0.0066349623],"genre_scores_gemma":[0.9901281,0.000018558914,0.007243509,0.0023749024,0.000047053447,0.000101936705,0.000039243296,0.000018691942,0.0000279946],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994884,0.000019551026,0.00016773383,0.000055109733,0.00007198937,0.00019718424],"domain_scores_gemma":[0.9989229,0.000048705166,0.000011269364,0.00087691424,0.0000556859,0.00008456991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011030236,0.00007352519,0.00006421207,0.000098318254,0.00010989629,0.000016974467,0.0003534478,0.000028237375,0.0000339798],"category_scores_gemma":[0.000012108395,0.000086810855,0.000021561105,0.0006571701,0.000022773587,0.0001715275,0.000012077172,0.00014727103,0.00034281687],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038097605,0.00021924477,0.030614913,0.00003341639,0.000111697154,1.4070517e-7,0.0064939195,0.028494468,0.8130916,0.011531356,0.10393641,0.005469021],"study_design_scores_gemma":[0.0004437863,0.000016245114,0.3882146,0.000031366297,0.00005319014,0.000004875263,0.00027560798,0.0056845094,0.030744184,0.00003988899,0.573833,0.0006587325],"about_ca_topic_score_codex":0.00001509023,"about_ca_topic_score_gemma":0.0001929359,"teacher_disagreement_score":0.78234744,"about_ca_system_score_codex":0.00005009624,"about_ca_system_score_gemma":0.00000692307,"threshold_uncertainty_score":0.44063315},"labels":[],"label_agreement":null},{"id":"W2072100797","doi":"10.1109/lcomm.2013.021213.121633","title":"Increasing the Throughput of Polar Decoders","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Throughput; Decoding methods; Computer science; Algorithm; Polar; Sequential decoding; Error detection and correction; Telecommunications; Wireless; Block code","score_opus":0.03240705621641109,"score_gpt":0.2830047920305757,"score_spread":0.2505977358141646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072100797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33067587,0.0003207686,0.58451533,0.08044262,0.00024034583,0.0004411426,0.0000012595716,0.00054121064,0.0028214746],"genre_scores_gemma":[0.7550795,0.00003803184,0.24171136,0.0030943423,0.000011558248,0.000047529753,9.932187e-7,0.00000844613,0.000008212854],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988329,0.00039979295,0.00026261195,0.00015706693,0.00016687693,0.00018076343],"domain_scores_gemma":[0.9949432,0.00081080536,0.00017379601,0.003928918,0.00011145432,0.000031803553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276391,0.000100629586,0.000115012794,0.00009022461,0.00030250233,0.00010664134,0.0047635194,0.000034985875,0.000005343904],"category_scores_gemma":[0.0001224241,0.00008021966,0.00007026523,0.0004302812,0.00027260094,0.0005165646,0.00061670394,0.00025962348,0.000048639544],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005483642,0.00033754023,0.03041721,0.00004025685,0.00017077551,0.0000020295631,0.015936842,0.0003274723,0.7090913,0.049125217,0.10692165,0.08762419],"study_design_scores_gemma":[0.00187179,0.0003955623,0.13628383,0.00094686414,0.00018098258,0.0007015371,0.0030432951,0.4754778,0.23125233,0.05692336,0.08908021,0.0038424456],"about_ca_topic_score_codex":0.0023030804,"about_ca_topic_score_gemma":0.0000786061,"teacher_disagreement_score":0.477839,"about_ca_system_score_codex":0.00004836024,"about_ca_system_score_gemma":0.000031171923,"threshold_uncertainty_score":0.88518834},"labels":[],"label_agreement":null},{"id":"W2074028341","doi":"10.1109/4234.991150","title":"On the planning of the S-PVC overlay in ATM networks","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Private Network-to-Network Interface; Asynchronous Transfer Mode; Computer science; Tabu search; Planner; Computer network; Overlay; Network planning and design; Routing (electronic design automation); Heuristic; Overlay network; Integer programming; Distributed computing; Mathematical optimization; Routing protocol; Static routing; Algorithm; The Internet","score_opus":0.031051113438070772,"score_gpt":0.23189015633023125,"score_spread":0.20083904289216048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074028341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8871884,0.0041734064,0.033769246,0.0583943,0.00056693156,0.0006824937,0.000006054576,0.0007701434,0.014449076],"genre_scores_gemma":[0.99613374,0.00024885338,0.0026192518,0.0009212024,0.000012599678,0.000037348014,5.9310935e-7,0.000015193531,0.000011242564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994898,0.000049723098,0.00016658226,0.000062368934,0.00007415296,0.0001573854],"domain_scores_gemma":[0.9975316,0.000777823,0.000032609492,0.0016413239,0.000007184987,0.000009444754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007956335,0.000083387196,0.00008766433,0.000035766905,0.000093251045,0.000009250784,0.0011985035,0.000051002724,0.000009270889],"category_scores_gemma":[0.000061502535,0.000055107237,0.000038877548,0.0003675929,0.00023778084,0.0000426209,0.00011943643,0.0005206571,0.000008881266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1315714e-7,0.000013316674,0.00049798546,0.000002142086,0.000009951726,3.7496312e-7,0.00012744074,0.9809224,0.0007963205,0.004855855,0.011220241,0.0015532417],"study_design_scores_gemma":[0.00015616739,0.000009932586,0.0039338986,0.00017621204,0.000007936116,0.000001817815,0.00009847635,0.9876721,0.0004285424,0.0010255582,0.0063264924,0.00016286099],"about_ca_topic_score_codex":0.0000026102653,"about_ca_topic_score_gemma":0.000010162788,"teacher_disagreement_score":0.10894537,"about_ca_system_score_codex":0.00005024371,"about_ca_system_score_gemma":8.3550594e-7,"threshold_uncertainty_score":0.2262025},"labels":[],"label_agreement":null},{"id":"W2076020410","doi":"10.1109/lcomm.2013.070113.131039","title":"Optimal Tx-BF for MIMO SC-FDE Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"MIMO; Beamforming; Computer science; Single antenna interference cancellation; SC-FDE; Transmitter power output; Bit error rate; Equalization (audio); Algorithm; Interference (communication); Minimum mean square error; Control theory (sociology); Mathematics; Mathematical optimization; Telecommunications; Channel (broadcasting); Decoding methods; Transmitter; Statistics","score_opus":0.021945446751604876,"score_gpt":0.24623596401993975,"score_spread":0.22429051726833488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076020410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011777066,0.0010934628,0.9815396,0.0016968502,0.0007115723,0.0012884649,0.000032719472,0.0005971369,0.0012631371],"genre_scores_gemma":[0.8387647,0.00012255265,0.15864187,0.00023701559,0.00013741438,0.001726998,0.00010834041,0.00008520474,0.00017590185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991204,0.00005066304,0.00034884334,0.00014428524,0.00006915552,0.0002666602],"domain_scores_gemma":[0.9979648,0.00020788379,0.00006979527,0.0015777642,0.00011004338,0.00006972968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110164154,0.00016444878,0.00018274979,0.00011675217,0.00018503607,0.00009987295,0.0007606586,0.00007245048,0.000010401752],"category_scores_gemma":[0.000028220447,0.00018498243,0.00006465774,0.00018088905,0.00007148624,0.0004002877,0.00004885905,0.00015212917,0.0001770119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010004392,0.000015079361,0.000063666506,0.000063990556,0.000045254947,9.554272e-8,0.0002070478,0.92228556,0.048254807,0.0008207679,0.02760874,0.00063400134],"study_design_scores_gemma":[0.00043437068,0.000013642188,0.000046063105,0.00009077868,0.000025898038,0.000006525489,0.00015797924,0.9565748,0.0014320483,0.000039633094,0.040817324,0.0003609189],"about_ca_topic_score_codex":0.000085768064,"about_ca_topic_score_gemma":0.000008055758,"teacher_disagreement_score":0.8269876,"about_ca_system_score_codex":0.00014016316,"about_ca_system_score_gemma":0.000008915747,"threshold_uncertainty_score":0.7543365},"labels":[],"label_agreement":null},{"id":"W2076469583","doi":"10.1109/lcomm.2014.2371014","title":"Optimal Model for the Controller Placement Problem in Software Defined Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Solver; Controller (irrigation); Software-defined networking; Cloud computing; Set (abstract data type); Plan (archaeology); Distributed computing; Software; Mathematical optimization; Mathematics","score_opus":0.029556190388681215,"score_gpt":0.25412746890377974,"score_spread":0.22457127851509853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076469583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007315127,0.00044667826,0.9708886,0.02682897,0.00014655833,0.0007285689,0.000003132667,0.00016961963,0.00005632513],"genre_scores_gemma":[0.48934177,0.00010031842,0.50060767,0.00890421,0.00006272073,0.0008993705,0.000011237434,0.000019413574,0.000053285654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986639,0.00015058469,0.00035606508,0.00028456756,0.0001533709,0.00039148022],"domain_scores_gemma":[0.99541867,0.002158429,0.00013204667,0.0021656882,0.00007025791,0.000054881195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773721,0.00017129903,0.00020301175,0.000078407575,0.00044091407,0.00016477819,0.0030016568,0.00006748862,0.0000012077018],"category_scores_gemma":[0.000071886796,0.00013362269,0.00010637969,0.0003146197,0.00011215509,0.00019239979,0.00038886556,0.00028973678,0.0000076818105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014953202,0.000048696536,0.00025560468,0.0000034031973,0.000020931586,1.0048376e-7,0.0002840117,0.96643144,0.000027350632,0.008829968,0.014744609,0.009338948],"study_design_scores_gemma":[0.0010238537,0.00002589575,0.00021485034,0.00002516259,0.000013292253,0.000001623661,0.0000073479746,0.99164593,0.0000038736525,0.00070703647,0.0061646267,0.00016653004],"about_ca_topic_score_codex":0.00003212911,"about_ca_topic_score_gemma":0.00007900909,"teacher_disagreement_score":0.48861024,"about_ca_system_score_codex":0.00006679612,"about_ca_system_score_gemma":0.000033146574,"threshold_uncertainty_score":0.55778754},"labels":[],"label_agreement":null},{"id":"W2078075297","doi":"10.1109/lcomm.2013.090313.131535","title":"On the Performance of Interference-Aware Cognitive Ad-Hoc Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Interference (communication); Computer network; Cognitive radio; Mobile ad hoc network; Cognition; Telecommunications; Wireless; Network packet; Psychology; Channel (broadcasting); Neuroscience","score_opus":0.02583139113370437,"score_gpt":0.24235767739351183,"score_spread":0.21652628625980747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078075297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7356368,0.00045258005,0.24086411,0.020922713,0.00023007154,0.0003967647,0.0000021211947,0.00008458623,0.0014102824],"genre_scores_gemma":[0.9931428,0.0006569017,0.0013499005,0.0047321455,0.000030180365,0.000049365728,0.000004489797,0.000010104833,0.000024101813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894106,0.00022912945,0.00024737723,0.00019877897,0.00014430405,0.00023935444],"domain_scores_gemma":[0.99675125,0.0013544958,0.00014867508,0.0015342131,0.00016564372,0.000045726792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019603015,0.00013816412,0.0001480713,0.000079505284,0.0003399337,0.00012380474,0.0018259505,0.000037847458,0.000027367634],"category_scores_gemma":[0.000028535755,0.00010304993,0.000072940784,0.0004110215,0.00030678985,0.00029150202,0.00031040472,0.0003969489,0.000074614596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000586676,0.00052410504,0.0021098026,0.0000323469,0.00037486313,0.0000056890603,0.0059493072,0.0069493908,0.0071838447,0.031318843,0.039030813,0.9064623],"study_design_scores_gemma":[0.0002556072,0.00016371177,0.006199921,0.00039030355,0.000015454556,0.000010674972,0.00016402663,0.9905551,0.0012362537,0.00032827188,0.00042481904,0.00025584383],"about_ca_topic_score_codex":0.000017248025,"about_ca_topic_score_gemma":0.00002015196,"teacher_disagreement_score":0.98360574,"about_ca_system_score_codex":0.000036467663,"about_ca_system_score_gemma":0.000020555599,"threshold_uncertainty_score":0.4202254},"labels":[],"label_agreement":null},{"id":"W2078250388","doi":"10.1109/lcomm.2011.110711.111195","title":"ML Detection with Successive Group Interference Cancellation for Interleaved OFDMA Uplink","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Single antenna interference cancellation; Telecommunications link; Interference (communication); Computer science; Minimum mean square error; Algorithm; Orthogonal frequency-division multiplexing; Frequency-division multiple access; Decoding methods; Multiuser detection; Multiplexing; Frequency domain; Electronic engineering; Channel (broadcasting); Mathematics; Telecommunications; Code division multiple access; Statistics; Engineering","score_opus":0.03942410910410303,"score_gpt":0.2527048922235443,"score_spread":0.21328078311944126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078250388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042666618,0.0002574214,0.95442015,0.00040697443,0.00012911185,0.0005531412,0.000011877164,0.0008592144,0.00069547474],"genre_scores_gemma":[0.9133951,0.00048696995,0.084653445,0.0001816978,0.00002293476,0.0011515081,0.000036672194,0.000057200723,0.0000144438445],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991946,0.000059343456,0.0003070098,0.00017171568,0.00007004759,0.00019727589],"domain_scores_gemma":[0.9977319,0.00020219473,0.00013413382,0.0017599863,0.00012391627,0.000047817473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010422007,0.0001867151,0.000168548,0.00016860128,0.00020300888,0.00003107436,0.0011631134,0.00007280046,0.000011939614],"category_scores_gemma":[0.000016085703,0.00019200191,0.000051492643,0.00024801376,0.00018333666,0.00037539113,0.00009009815,0.0003016031,0.000007665588],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015965584,0.00015708034,0.0008909855,0.0001561535,0.00022806885,8.492053e-7,0.004877681,0.004935142,0.7802986,0.0022285073,0.0008690469,0.20519821],"study_design_scores_gemma":[0.0010717906,0.0002499764,0.0018215746,0.00050671917,0.00010796394,0.000009882498,0.00045001035,0.24979104,0.737373,0.0011535678,0.0064054835,0.0010589856],"about_ca_topic_score_codex":0.00009380785,"about_ca_topic_score_gemma":0.00069946115,"teacher_disagreement_score":0.8707285,"about_ca_system_score_codex":0.00017870723,"about_ca_system_score_gemma":0.000008800502,"threshold_uncertainty_score":0.7829611},"labels":[],"label_agreement":null},{"id":"W2085305001","doi":"10.1109/lcomm.2011.110711.111382","title":"Availability Analytical Model for Permanent Dedicated Path Protection in WDM Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Unavailability; Blocking (statistics); Path protection; Computer science; Wavelength-division multiplexing; Path (computing); Computer network; Connection (principal bundle); Distributed computing; Reliability engineering; Mathematics; Engineering","score_opus":0.06751356478369025,"score_gpt":0.2608173208535491,"score_spread":0.19330375606985883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085305001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08706794,0.00014672305,0.909481,0.0014032361,0.00007578484,0.0006770407,0.0000056447607,0.00073057745,0.00041205142],"genre_scores_gemma":[0.896271,0.00014836181,0.10282547,0.00015723937,0.0000145107015,0.0005361982,0.0000141927,0.000026609847,0.0000064454794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913096,0.000032244887,0.0003093014,0.00017015127,0.00006841152,0.00028895005],"domain_scores_gemma":[0.9985077,0.000095689684,0.000031800675,0.0012850941,0.00003460635,0.000045155433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018543347,0.00013580582,0.00015800746,0.00009913598,0.00008454232,0.000010514565,0.000655538,0.00012978989,0.000004796213],"category_scores_gemma":[0.000058991423,0.00014320826,0.000055429908,0.00030113372,0.00024162327,0.00012525391,0.00008998301,0.0004586765,0.000009219869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000235075,0.00012698842,0.0006361714,0.000031499683,0.00003072697,9.335216e-7,0.00027853588,0.98449063,0.0016555501,0.0018784497,0.0016175563,0.009229472],"study_design_scores_gemma":[0.00017206604,0.000013439973,0.0010405898,0.000021160195,0.000012643509,0.0000011274336,0.000020910938,0.9969417,0.000093360184,0.001290835,0.00024078031,0.00015137592],"about_ca_topic_score_codex":0.000013011528,"about_ca_topic_score_gemma":0.000062886465,"teacher_disagreement_score":0.809203,"about_ca_system_score_codex":0.00017588379,"about_ca_system_score_gemma":0.0000070105966,"threshold_uncertainty_score":0.58398634},"labels":[],"label_agreement":null},{"id":"W2085720813","doi":"10.1109/lcomm.2012.030512.120075","title":"Selection Combining of Signals with Different Modulation Levels in Nakagami-m Fading","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Nakagami distribution; Fading; Relay; Modulation (music); Rayleigh fading; Maximal-ratio combining; Selection (genetic algorithm); Expression (computer science); Computer science; Channel (broadcasting); Closed-form expression; Algorithm; Telecommunications; Signal-to-noise ratio (imaging); Topology (electrical circuits); Mathematics; Physics; Artificial intelligence; Combinatorics; Acoustics; Power (physics)","score_opus":0.08409197153466429,"score_gpt":0.30190056198818777,"score_spread":0.21780859045352347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085720813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5968983,0.00025148946,0.3985528,0.003526943,0.00008100987,0.00020239047,8.5574885e-7,0.00007554726,0.00041064547],"genre_scores_gemma":[0.98021495,0.00012564212,0.01911511,0.0004410697,0.000019316702,0.000051716877,0.0000064336978,0.0000111304325,0.000014652468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986074,0.00045619239,0.00035618935,0.00015205867,0.00018059355,0.00024755427],"domain_scores_gemma":[0.99798614,0.00029374642,0.00020064999,0.001362252,0.00009861609,0.000058613958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046931396,0.00013480514,0.00019235912,0.0002637062,0.00023223444,0.00005380032,0.0013406657,0.000038259663,0.000007432023],"category_scores_gemma":[0.000024702438,0.00012610873,0.00003887,0.0008143035,0.00009258409,0.0007580313,0.00028343225,0.0002629968,0.00000480131],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020305086,0.0009450644,0.17569911,0.00003904831,0.00011598958,5.6638464e-7,0.016247272,0.022885099,0.6571777,0.06632425,0.00064239645,0.059903204],"study_design_scores_gemma":[0.001279385,0.000095251526,0.43857628,0.00039657208,0.00002109565,0.000016858234,0.00016444876,0.5261781,0.031283338,0.00023232606,0.001150462,0.0006058293],"about_ca_topic_score_codex":0.0000139240365,"about_ca_topic_score_gemma":0.000077947814,"teacher_disagreement_score":0.62589437,"about_ca_system_score_codex":0.00012688844,"about_ca_system_score_gemma":0.000021640051,"threshold_uncertainty_score":0.5142565},"labels":[],"label_agreement":null},{"id":"W2087510489","doi":"10.1109/lcomm.2014.2334318","title":"Throughput Scaling of MIMO Channels With Imperfect CSIT in the Low-SNR Regime","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Throughput; Channel (broadcasting); Transmitter; Signal-to-noise ratio (imaging); Channel state information; Computer science; Algorithm; Scaling; Topology (electrical circuits); Mathematics; Control theory (sociology); Telecommunications; Wireless; Combinatorics","score_opus":0.013959493449627552,"score_gpt":0.23357096637020663,"score_spread":0.2196114729205791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087510489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2806164,0.00041728202,0.7126204,0.0028062754,0.00020247439,0.0005662174,0.000004774367,0.00019333528,0.002572885],"genre_scores_gemma":[0.986005,0.00007988801,0.013406023,0.0003336624,0.00004418765,0.0000778567,0.000013795662,0.00003204135,0.000007521337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992078,0.00016309445,0.00025917788,0.00010550892,0.00010061816,0.00016379387],"domain_scores_gemma":[0.9979974,0.0002881641,0.00007545577,0.0015846458,0.000035975012,0.000018333949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003198384,0.00012107185,0.00016671815,0.000100159436,0.00008329622,0.000022641694,0.0007767843,0.000042634754,0.0000017141649],"category_scores_gemma":[0.000026281516,0.00009687018,0.000033655462,0.00037391947,0.00010722792,0.00017917456,0.000034288187,0.00020749614,0.000009554683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041086987,0.000025519108,0.00027058617,0.00006011549,0.000022572725,4.704823e-7,0.0023558785,0.9688743,0.026735682,0.00046486405,0.0005241766,0.00066175306],"study_design_scores_gemma":[0.0019795448,0.000100716825,0.0013438641,0.00123383,0.00008283899,0.000053750304,0.0013365208,0.9573224,0.028285276,0.00022120224,0.0071201622,0.00091986236],"about_ca_topic_score_codex":0.00005133884,"about_ca_topic_score_gemma":0.000056075678,"teacher_disagreement_score":0.7053886,"about_ca_system_score_codex":0.00005297111,"about_ca_system_score_gemma":0.000005937888,"threshold_uncertainty_score":0.39502513},"labels":[],"label_agreement":null},{"id":"W2090966880","doi":"10.1109/lcomm.2015.2477816","title":"On Network Coding for Funnel Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Multicast; Funnel; Computer science; Computer network; Coding (social sciences); Unicast; Theoretical computer science; Distributed computing; Mathematics","score_opus":0.1172964217603071,"score_gpt":0.3171593812931596,"score_spread":0.19986295953285252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090966880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064455066,0.0009415963,0.96117723,0.032466598,0.0007744603,0.00041207453,0.0000018252348,0.00029445626,0.0032871906],"genre_scores_gemma":[0.85447097,0.00069662475,0.12638353,0.017685546,0.00027161598,0.0002898902,0.000032198506,0.000027082157,0.0001425431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984441,0.0003579234,0.00033117898,0.00029784453,0.00017711149,0.0003918509],"domain_scores_gemma":[0.99445486,0.0010929989,0.00014856468,0.003912829,0.00021713786,0.00017361961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094510644,0.00018376212,0.00019820863,0.000098848,0.0007151464,0.00024199889,0.0041976706,0.000061793726,0.000003147874],"category_scores_gemma":[0.00012923357,0.00018953906,0.000101491256,0.000639872,0.00012391339,0.0003364463,0.0006551888,0.0003374496,0.000050204424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018135834,0.0000979998,0.00009825997,0.0000032241824,0.00004285474,8.142786e-7,0.000585469,0.10129251,0.0003982036,0.5372364,0.33848956,0.021736586],"study_design_scores_gemma":[0.00079408544,0.00008380131,0.00014142852,0.000073988136,0.000011304928,0.0000054399525,0.000025302938,0.85303265,0.00006174474,0.0025657804,0.14284751,0.00035699722],"about_ca_topic_score_codex":0.000003508078,"about_ca_topic_score_gemma":0.000030878164,"teacher_disagreement_score":0.8538264,"about_ca_system_score_codex":0.00013744802,"about_ca_system_score_gemma":0.000072795665,"threshold_uncertainty_score":0.78003865},"labels":[],"label_agreement":null},{"id":"W2091604413","doi":"10.1109/lcomm.2012.032612.112567","title":"Outage Capacity Analysis for OFDM Decode-and-Forward Systems in Frequency Selective Rayleigh Fading Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Rayleigh fading; Independent and identically distributed random variables; Fading; Relay; Computer science; Cumulative distribution function; Probability density function; Multiplexing; Gaussian; Telecommunications; Topology (electrical circuits); Random variable; Mathematics; Statistics; Decoding methods; Channel (broadcasting); Physics","score_opus":0.08384391929300251,"score_gpt":0.3051105766789817,"score_spread":0.22126665738597923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091604413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15453759,0.0028646109,0.83442223,0.0063261567,0.00038320766,0.0007012253,0.000012808652,0.00014459634,0.000607564],"genre_scores_gemma":[0.9526993,0.0006179372,0.045248464,0.00092481135,0.00005737327,0.0003994121,0.000018605002,0.000013554811,0.00002052223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980574,0.0005972198,0.0004555503,0.00029476674,0.00014917659,0.00044587822],"domain_scores_gemma":[0.99640673,0.00081694976,0.00019716573,0.0022877264,0.0001590417,0.00013236755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114028,0.0001974319,0.00036021974,0.0005530476,0.0005646027,0.00020703887,0.0021388112,0.000074142576,0.000002424222],"category_scores_gemma":[0.00010375252,0.00020713666,0.00013340975,0.0017172478,0.00013513041,0.0008870033,0.00042757016,0.0003332077,0.000009252134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025890778,0.0010302282,0.297579,0.00014101806,0.0023765888,0.0000021421429,0.074123845,0.024626622,0.06139061,0.517772,0.00413919,0.016792845],"study_design_scores_gemma":[0.0019139209,0.0000918012,0.072228275,0.00022247953,0.00042650424,0.0000258046,0.0005984417,0.9051331,0.002269179,0.0014799976,0.013851297,0.0017591676],"about_ca_topic_score_codex":0.0001646493,"about_ca_topic_score_gemma":0.00032703736,"teacher_disagreement_score":0.8805065,"about_ca_system_score_codex":0.00023905253,"about_ca_system_score_gemma":0.000027857786,"threshold_uncertainty_score":0.84467876},"labels":[],"label_agreement":null},{"id":"W2092865206","doi":"10.1109/lcomm.2014.2377156","title":"A Stochastic Game-Theoretic Approach for Interference Mitigation in Small Cell Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Nash equilibrium; Computer science; Potential game; Small cell; Game theory; Regret; Interference (communication); Mathematical optimization; Selection (genetic algorithm); Channel (broadcasting); Distributed algorithm; Distributed computing; Equilibrium selection; Computer network; Cellular network; Repeated game; Mathematical economics; Mathematics; Artificial intelligence","score_opus":0.015962378740599432,"score_gpt":0.22059628341953405,"score_spread":0.2046339046789346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092865206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00844787,0.0001624162,0.98966616,0.00016696395,0.00013899061,0.0005751807,0.000004244057,0.00017625291,0.00066189485],"genre_scores_gemma":[0.89594895,0.000026787127,0.10317612,0.0001456988,0.00004211855,0.0005018326,0.00010565188,0.00004142878,0.0000113917995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.00009759137,0.00029582836,0.00015031834,0.00003393079,0.00020636934],"domain_scores_gemma":[0.9986016,0.00030289206,0.00006483819,0.00095274334,0.00003941129,0.000038483147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021356407,0.00013754252,0.00015400037,0.00013177164,0.000057094985,0.000031354128,0.0005536755,0.00006829797,0.0000011514289],"category_scores_gemma":[0.0000412093,0.0001620541,0.000038817205,0.0002130284,0.00008301725,0.00010603828,0.000037006695,0.00020762214,0.000004799236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031322338,0.00001990699,0.000032091415,0.000053145934,0.0000046453583,2.5644871e-8,0.0003556375,0.9941544,0.0035796866,0.00086602994,0.00013220478,0.0007991153],"study_design_scores_gemma":[0.0003465132,0.000012042106,0.000028211722,0.00006055726,0.000011080454,0.0000012780195,0.000056112207,0.9987346,0.0002952139,0.00022555413,0.000065285894,0.00016353013],"about_ca_topic_score_codex":0.000008245159,"about_ca_topic_score_gemma":0.00003198431,"teacher_disagreement_score":0.8875011,"about_ca_system_score_codex":0.00011244763,"about_ca_system_score_gemma":0.0000052392293,"threshold_uncertainty_score":0.6608375},"labels":[],"label_agreement":null},{"id":"W2093201673","doi":"10.1109/lcomm.2015.2418780","title":"Fundamental Relations Between Reactive and Proactive Relay-Selection Strategies","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Selection (genetic algorithm); Relay channel; Computer science; Equivalence (formal languages); Additive white Gaussian noise; Channel (broadcasting); Computer network; Telecommunications; Mathematics; Artificial intelligence; Power (physics)","score_opus":0.10626306626282875,"score_gpt":0.3214321035000524,"score_spread":0.21516903723722366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093201673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30621126,0.0012266366,0.6263363,0.05129615,0.0002451793,0.00077048637,0.00000916075,0.0005877311,0.013317123],"genre_scores_gemma":[0.9491296,0.00017337405,0.04991523,0.00051062956,0.000045870558,0.000090776,0.000021203918,0.000011622233,0.00010172343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99856853,0.00051883917,0.00026394514,0.00027405075,0.00018343733,0.00019119788],"domain_scores_gemma":[0.997735,0.0003527744,0.00014661276,0.0014399334,0.0001915269,0.00013412989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004554783,0.00014995459,0.00015113331,0.0001692629,0.00063798757,0.0003269982,0.0013201307,0.00005826113,0.0000032062792],"category_scores_gemma":[0.000056654837,0.0001588175,0.00003819885,0.0006216126,0.00025037816,0.0015493949,0.00054262334,0.00044472233,0.000047162343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063911364,0.0008345437,0.09604605,0.000021295595,0.0009437394,0.0000057618995,0.068421826,0.0039661694,0.06005836,0.576827,0.049920794,0.14289056],"study_design_scores_gemma":[0.006697313,0.0010195753,0.3871589,0.00040001262,0.0003651757,0.00022423868,0.012919157,0.3197652,0.009660207,0.017215416,0.24047634,0.004098444],"about_ca_topic_score_codex":0.000042530406,"about_ca_topic_score_gemma":0.000093972914,"teacher_disagreement_score":0.64291835,"about_ca_system_score_codex":0.00024998793,"about_ca_system_score_gemma":0.00014614215,"threshold_uncertainty_score":0.647639},"labels":[],"label_agreement":null},{"id":"W2095598902","doi":"10.1109/lcomm.2007.071016","title":"Self-fault isolation in transparent p-cycle networks: p-cycles as their own m-cycles","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Span (engineering); Computer science; Fault detection and isolation; Set (abstract data type); Fault (geology); Locality; Real-time computing; Engineering; Artificial intelligence; Structural engineering","score_opus":0.020894153066906777,"score_gpt":0.26504968998180933,"score_spread":0.24415553691490255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095598902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5712356,0.0029563943,0.41551408,0.004043333,0.00031900193,0.0005088292,0.0000067992573,0.0025455717,0.0028704146],"genre_scores_gemma":[0.9230678,0.002542702,0.07378868,0.00039871113,0.00005868249,0.00006204179,0.000025626987,0.000052221283,0.0000035015248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864495,0.00005240424,0.00047979926,0.00020599492,0.00012594581,0.0004909338],"domain_scores_gemma":[0.9978496,0.0005247446,0.000057703885,0.0014763958,0.000026227697,0.00006535059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027415444,0.00024094814,0.00023033252,0.00021466342,0.00015335926,0.000037425936,0.0010370761,0.00016963406,0.000007606396],"category_scores_gemma":[0.000026567453,0.000249066,0.000075202945,0.0005966259,0.00019427002,0.00027397778,0.000085711814,0.0006176591,0.00003230521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013628409,0.000108354,0.0019443106,0.000023237819,0.000054383843,0.000005926594,0.0006875918,0.9462335,0.005326849,0.0014557132,0.00052767136,0.0436188],"study_design_scores_gemma":[0.0007200422,0.0000361301,0.015437107,0.00016286534,0.000032956472,0.000013584611,0.00070069835,0.9593682,0.002430826,0.0027804489,0.017531244,0.000785869],"about_ca_topic_score_codex":0.00001927236,"about_ca_topic_score_gemma":0.00044054084,"teacher_disagreement_score":0.35183227,"about_ca_system_score_codex":0.00023041686,"about_ca_system_score_gemma":0.0000065973677,"threshold_uncertainty_score":0.9999962},"labels":[],"label_agreement":null},{"id":"W2096268803","doi":"10.1109/lcomm.2008.080471","title":"A new sub-optimal decoder for quasi-orthogonal space-time block codes","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Block code; Algorithm; Computer science; Metric (unit); Sequential decoding; Block (permutation group theory); List decoding; Reliability (semiconductor); Simple (philosophy); Mathematics; Concatenated error correction code; Combinatorics","score_opus":0.025077051250580205,"score_gpt":0.2617987288955455,"score_spread":0.2367216776449653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096268803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14019926,0.0012451597,0.84945506,0.0057751727,0.00009801092,0.00066812546,0.000057791844,0.0018632936,0.0006380977],"genre_scores_gemma":[0.55761796,0.00140278,0.43985882,0.00046520916,0.00005933052,0.00029296076,0.000087538916,0.00008239349,0.0001330102],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882406,0.00007897574,0.00040334155,0.00019651862,0.00015679565,0.00034033443],"domain_scores_gemma":[0.9963782,0.0005135865,0.00009221356,0.0027939463,0.000091854854,0.00013019457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013536526,0.00025463174,0.000295633,0.0001859042,0.00041615253,0.00003148629,0.001618933,0.00010611491,0.000017796512],"category_scores_gemma":[0.00003901564,0.000305875,0.00014939245,0.0002764535,0.0002313692,0.0002716556,0.0001549318,0.00036233757,0.00009339834],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000449309,0.00026010972,0.0005559386,0.000062533494,0.00030555236,0.000004337629,0.0016031112,0.109004825,0.56386095,0.003381858,0.30705988,0.013855965],"study_design_scores_gemma":[0.0022120224,0.00016027447,0.0014859841,0.00020869449,0.00013676539,0.00023116435,0.00009828379,0.4090733,0.2523079,0.0010461598,0.33076185,0.002277626],"about_ca_topic_score_codex":0.000018207831,"about_ca_topic_score_gemma":0.00002875014,"teacher_disagreement_score":0.4174187,"about_ca_system_score_codex":0.00014002952,"about_ca_system_score_gemma":0.00004735136,"threshold_uncertainty_score":0.9999393},"labels":[],"label_agreement":null},{"id":"W2096694463","doi":"10.1109/lcomm.2010.082310.100322","title":"Performance Analysis of Modified IEEE 802.11-Based Cognitive Radio Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cognitive radio; Computer science; Throughput; Computer network; Network packet; Exploit; Wireless; Telecommunications; Computer security","score_opus":0.023120232087737953,"score_gpt":0.2580508180808155,"score_spread":0.23493058599307753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096694463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4988742,0.000046889094,0.4984882,0.0015500012,0.00028434957,0.00013492844,0.0000060933658,0.00008167864,0.0005336755],"genre_scores_gemma":[0.9836994,0.00007726715,0.014466201,0.0015879534,0.00008239971,0.000022006989,0.000038464066,0.000015861495,0.000010457839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983851,0.00021317137,0.00042841083,0.00036031482,0.00025389332,0.00035916275],"domain_scores_gemma":[0.9960398,0.00094303116,0.00027959194,0.0024005256,0.00023077673,0.000106247506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004581488,0.00020779895,0.00038759309,0.0005290262,0.00038176496,0.00011196048,0.0019284881,0.00009549442,0.000009653268],"category_scores_gemma":[0.00003402372,0.00021806393,0.00025811896,0.002299075,0.0004280223,0.00032115483,0.00014083188,0.0005655215,0.000005654982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009062588,0.00093355717,0.05870513,0.00003550651,0.002849814,0.000022965123,0.002291248,0.72023356,0.08297708,0.00574002,0.003014747,0.123105764],"study_design_scores_gemma":[0.00036627732,0.000022455915,0.02885397,0.000039402585,0.00031047413,0.0000040446953,0.000010446013,0.9678233,0.0021730503,0.00000866089,0.00014399081,0.0002439143],"about_ca_topic_score_codex":0.00009756475,"about_ca_topic_score_gemma":0.00054969644,"teacher_disagreement_score":0.4848252,"about_ca_system_score_codex":0.000040210103,"about_ca_system_score_gemma":0.000061319144,"threshold_uncertainty_score":0.8892389},"labels":[],"label_agreement":null},{"id":"W2096727622","doi":"10.1109/lcomm.2009.081635","title":"A proof of wavelength conversion not improving the lagrangian bound of the static RWA problem","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"Routing and wavelength assignment; Wavelength-division multiplexing; Computer science; Wavelength; Routing (electronic design automation); Formal proof; Multiplexing; Upper and lower bounds; Mathematical optimization; Computer network; Telecommunications; Mathematics; Optics; Physics; Mathematical proof","score_opus":0.01400876084951385,"score_gpt":0.22449359570647917,"score_spread":0.2104848348569653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096727622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9065514,0.00076594244,0.04009992,0.0495876,0.00017542607,0.0014245043,0.000024019644,0.000437635,0.0009335582],"genre_scores_gemma":[0.965486,0.00008920328,0.033947885,0.0004284085,0.0000066759653,0.000019904004,0.0000020248417,0.000012157249,0.000007735745],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993187,0.000049481627,0.00026704764,0.000075855445,0.00012735503,0.00016156223],"domain_scores_gemma":[0.9980008,0.00025847007,0.00010066322,0.001583076,0.00004269283,0.0000143117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013887537,0.0000987033,0.00013256211,0.000043394062,0.00012794255,0.000010652942,0.0012395757,0.0000461021,0.000001779309],"category_scores_gemma":[0.000046247125,0.00006485018,0.00006156581,0.0003220257,0.00040934596,0.00008750558,0.00011268392,0.00030978967,0.0000013796677],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018208186,0.00014860136,0.0001557511,0.00025272943,0.00010894766,6.8232373e-7,0.0018053771,0.07219242,0.75996566,0.006264542,0.004141709,0.15494539],"study_design_scores_gemma":[0.0016000902,0.0002665505,0.0085438285,0.00078042166,0.0002749995,0.000019615894,0.0016074323,0.48550078,0.48411387,0.008081382,0.008289029,0.0009220014],"about_ca_topic_score_codex":0.000009930004,"about_ca_topic_score_gemma":0.000012382753,"teacher_disagreement_score":0.41330835,"about_ca_system_score_codex":0.000049785358,"about_ca_system_score_gemma":0.000011055935,"threshold_uncertainty_score":0.26445135},"labels":[],"label_agreement":null},{"id":"W2096999262","doi":"10.1109/lcomm.2004.825725","title":"Reduced ICI in OFDM Systems Using the “Better Than” Raised-Cosine Pulse","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Raised-cosine filter; Pulse shaping; Carrier frequency offset; Frequency offset; Offset (computer science); Pulse (music); Interference (communication); Discrete cosine transform; Computer science; Telecommunications; Multiplexing; Electronic engineering; Power (physics); Bandwidth (computing); Physics; Engineering; Channel (broadcasting); Low-pass filter","score_opus":0.04476392765290198,"score_gpt":0.27734483043330377,"score_spread":0.23258090278040178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096999262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755964,0.0008448947,0.004653065,0.01563777,0.0009644848,0.0004174089,0.000009540121,0.00023516154,0.0016412699],"genre_scores_gemma":[0.9962869,0.00009422699,0.0025738012,0.0006799222,0.00015814033,0.00012257861,0.000017997105,0.000048814694,0.000017572356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988843,0.00013039188,0.00039021447,0.00014697107,0.00016190253,0.00028617017],"domain_scores_gemma":[0.9976781,0.00010524671,0.00006556482,0.002070344,0.00003389828,0.00004682053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023872248,0.00017669635,0.00017503624,0.0001978368,0.00020772348,0.00008510524,0.001073923,0.00007059809,0.000012157432],"category_scores_gemma":[0.00002292724,0.00016190986,0.000066090295,0.0005182271,0.00019043076,0.00022584936,0.00007798591,0.00047879023,0.00004675432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003219181,0.000041524032,0.00024507364,0.000025576206,0.000045696095,0.000003338356,0.00095370074,0.5463591,0.4489842,0.00021273631,0.00294637,0.00017942018],"study_design_scores_gemma":[0.011124598,0.00009647494,0.027484907,0.0040883673,0.00040838373,0.0013590633,0.005924034,0.58153623,0.21226764,0.0011924158,0.14892472,0.005593195],"about_ca_topic_score_codex":0.00034016347,"about_ca_topic_score_gemma":0.00003773112,"teacher_disagreement_score":0.23671657,"about_ca_system_score_codex":0.00040364327,"about_ca_system_score_gemma":0.000025342702,"threshold_uncertainty_score":0.66024923},"labels":[],"label_agreement":null},{"id":"W2097445533","doi":"10.1109/lcomm.2005.1461669","title":"Outage probability of MRC with equi-power cochannel interferers in correlated rayleigh fading","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Maximal-ratio combining; Fading; Interference (communication); Outage probability; Mathematics; Fading distribution; Power (physics); Computer science; Statistics; Topology (electrical circuits); Telecommunications; Electronic engineering; Physics; Decoding methods; Combinatorics; Engineering; Channel (broadcasting)","score_opus":0.04363277417628072,"score_gpt":0.2896327144887581,"score_spread":0.24599994031247738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097445533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64211184,0.00044849108,0.30821955,0.044725653,0.00012631332,0.00094399333,0.0000062980575,0.0002546393,0.0031632243],"genre_scores_gemma":[0.94053656,0.00010178712,0.058579247,0.00057807745,0.000010735063,0.00012475335,0.000010409674,0.00002058707,0.000037856065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746865,0.00069224264,0.0006411407,0.00038228146,0.00038682626,0.00042885053],"domain_scores_gemma":[0.9927261,0.0007513106,0.0002587438,0.005939668,0.00022038021,0.00010380402],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010099479,0.00020360247,0.0003105832,0.0003864228,0.00019206035,0.00010472629,0.0064907484,0.00009397708,0.000018467043],"category_scores_gemma":[0.00007662802,0.00019449685,0.000073582174,0.0013684585,0.000582896,0.0007512731,0.0013077578,0.00082930754,0.000039394337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047071237,0.0053973724,0.08009196,0.0002443232,0.0006102775,0.000029371975,0.060385734,0.56169665,0.117526755,0.09354165,0.0116609465,0.06834421],"study_design_scores_gemma":[0.002854782,0.0002505459,0.015680868,0.0007460959,0.000020788117,0.000035731806,0.0004219265,0.96496403,0.007495751,0.00069933047,0.0058176965,0.001012464],"about_ca_topic_score_codex":0.00012672108,"about_ca_topic_score_gemma":0.00050902227,"teacher_disagreement_score":0.40326735,"about_ca_system_score_codex":0.00031283408,"about_ca_system_score_gemma":0.00010659435,"threshold_uncertainty_score":0.9988846},"labels":[],"label_agreement":null},{"id":"W2097812145","doi":"10.1109/lcomm.2002.805515","title":"A memetic algorithm for assigning cells to switches in cellular mobile networks","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Memetic algorithm; Tabu search; Computer science; Heuristics; Cellular network; Heuristic; Context (archaeology); Memetics; Algorithm; Local search (optimization); Mathematical optimization; Artificial intelligence; Mathematics; Computer network","score_opus":0.05095501752109461,"score_gpt":0.28878967703718994,"score_spread":0.23783465951609534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097812145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003335328,0.0013077296,0.97994,0.013598979,0.00020201848,0.0011646642,0.0000036615318,0.00017161288,0.00027598554],"genre_scores_gemma":[0.58812374,0.00043651485,0.40717703,0.002228581,0.00006643025,0.0017908395,0.000010316525,0.00003367266,0.00013285379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976938,0.00043512558,0.00051062217,0.00043716424,0.0003071251,0.00061621214],"domain_scores_gemma":[0.992942,0.001285097,0.00012514707,0.0053328085,0.0001379045,0.00017706734],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009260216,0.0002091789,0.0002687444,0.00042788754,0.0004206838,0.00029379714,0.0072614765,0.00009643148,0.000014735187],"category_scores_gemma":[0.000035895944,0.00023646896,0.00010977005,0.0015766461,0.00013709418,0.00039748984,0.0011865724,0.0005531884,0.000104851526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004405324,0.0006425164,0.0001439187,0.000021180433,0.000064230524,0.000006461968,0.0034282634,0.28847155,0.071097605,0.001183914,0.046741713,0.58819425],"study_design_scores_gemma":[0.0003359183,0.000044738,0.000039661707,0.00005174223,0.000004631917,0.0000018457446,0.00004954876,0.9727579,0.0036530674,0.000051863775,0.022743577,0.0002655453],"about_ca_topic_score_codex":0.000054851782,"about_ca_topic_score_gemma":0.000049301772,"teacher_disagreement_score":0.6842863,"about_ca_system_score_codex":0.00020350936,"about_ca_system_score_gemma":0.00002464893,"threshold_uncertainty_score":0.9981097},"labels":[],"label_agreement":null},{"id":"W2098209061","doi":"10.1109/lcomm.2006.1633327","title":"A class of irregular ldpc codes with low error floor and low encoding complexity","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"CMC Microsystems","keywords":"Low-density parity-check code; Encoder; Computer science; Encoding (memory); Algorithm; Error floor; Decoding methods; Parity-check matrix; Diagonal; Error detection and correction; Concatenated error correction code; Block code; Mathematics","score_opus":0.03349696006564392,"score_gpt":0.27283999888355537,"score_spread":0.23934303881791144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098209061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6170311,0.00017809543,0.37011966,0.010828352,0.000085044696,0.00030957715,0.000008261621,0.0005110219,0.00092890183],"genre_scores_gemma":[0.76253605,0.000012499067,0.23683254,0.00053319975,0.00001535286,0.000034162593,0.000006260635,0.000013112713,0.000016832211],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998699,0.00021089458,0.0003228059,0.0002976588,0.00023030478,0.00023930891],"domain_scores_gemma":[0.99678755,0.0002424352,0.00023410264,0.0025612724,0.00012597951,0.000048663795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035633787,0.00017367056,0.00024621925,0.00018286731,0.00029190813,0.000095101794,0.0021368666,0.000051849987,0.0000017621508],"category_scores_gemma":[0.000024583811,0.00016767552,0.000051380503,0.00047363737,0.00067347457,0.00035224014,0.00043491556,0.0002594381,0.0000043549367],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049792452,0.0010395463,0.022189151,0.00035301715,0.00015753706,0.000028636456,0.0046267463,0.0020465686,0.8604639,0.082709484,0.014676513,0.011659082],"study_design_scores_gemma":[0.0025874022,0.0004936136,0.07464543,0.0020075268,0.00014937561,0.00037492043,0.0004539276,0.5769106,0.32340077,0.011407989,0.005093956,0.0024745122],"about_ca_topic_score_codex":0.00064484635,"about_ca_topic_score_gemma":0.0006506814,"teacher_disagreement_score":0.57486403,"about_ca_system_score_codex":0.00006734405,"about_ca_system_score_gemma":0.00004404824,"threshold_uncertainty_score":0.68376094},"labels":[],"label_agreement":null},{"id":"W2098968166","doi":"10.1109/lcomm.2007.061887","title":"Comparison of symmetric and asymmetric routing for fixed two-hop cellular relaying network","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SAIT Polytechnic","funders":"","keywords":"Telecommunications link; Computer science; Computer network; Spectral efficiency; Routing (electronic design automation); Dynamic Source Routing; Hop (telecommunications); Cellular network; Routing protocol; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.07953254613723926,"score_gpt":0.3476981624333589,"score_spread":0.2681656162961196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098968166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042215846,0.0059339893,0.94570214,0.003834095,0.00026969606,0.0004386357,0.0000016011172,0.0001265379,0.0014774445],"genre_scores_gemma":[0.7950543,0.00034679656,0.20370734,0.00076437904,0.00006120551,0.000025418449,0.000010259392,0.000014531993,0.000015788815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981251,0.00027325415,0.00071489945,0.0002910663,0.00019955981,0.0003961418],"domain_scores_gemma":[0.9935052,0.0033182674,0.0004097392,0.002449035,0.0002190512,0.00009871355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020434984,0.00017605105,0.0003350469,0.0004648713,0.0008199316,0.00011729705,0.0025085597,0.00006102144,0.0000012410377],"category_scores_gemma":[0.00027147814,0.00019173702,0.00009931333,0.0026396466,0.00016921855,0.00028897324,0.0008219771,0.00035040625,0.0000039899182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030150186,0.0003947163,0.038635522,0.00006288894,0.00018138095,0.00000165579,0.0041599027,0.0059752525,0.07257771,0.4117206,0.0073540756,0.45890614],"study_design_scores_gemma":[0.0021687383,0.00017040761,0.011288565,0.00027202655,0.00009199072,0.00001078614,0.00034680153,0.9407995,0.01869824,0.0009082677,0.024333641,0.0009110365],"about_ca_topic_score_codex":0.000015614303,"about_ca_topic_score_gemma":0.00004537525,"teacher_disagreement_score":0.9348242,"about_ca_system_score_codex":0.0000823244,"about_ca_system_score_gemma":0.00002976138,"threshold_uncertainty_score":0.7818809},"labels":[],"label_agreement":null},{"id":"W2099211592","doi":"10.1109/lcomm.2009.090999","title":"Lock step: an algorithm to reduce wi-fi jitter","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Jitter; Exponential backoff; Computer network; Lock (firearm); Algorithm; Collision; Idle; Transmission (telecommunications); Key (lock); Network packet; Real-time computing; Throughput; Wireless; Telecommunications; Computer security","score_opus":0.038978927919089246,"score_gpt":0.3201264449432478,"score_spread":0.2811475170241586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099211592","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004520582,0.000059632428,0.87669736,0.11547426,0.00020062872,0.0020072255,0.0000045011816,0.00027645184,0.00075934967],"genre_scores_gemma":[0.19855045,0.000022449363,0.73799145,0.061763566,0.0002977112,0.0011792084,0.00001642218,0.000019936893,0.00015880032],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998555,0.0002478361,0.00028216603,0.00035139066,0.00021613202,0.00034744135],"domain_scores_gemma":[0.995053,0.00008905657,0.00008643397,0.004504055,0.00007563497,0.00019185229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030382216,0.00016703199,0.00016657433,0.00012003988,0.0003496957,0.00031166786,0.0045601157,0.000059800142,0.0000073626256],"category_scores_gemma":[0.0000066837156,0.00017021224,0.000063793355,0.00057082524,0.00006254051,0.0005871724,0.00028803424,0.0002914128,0.0001599618],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005576811,0.00022128511,0.000039774564,0.0000028110253,0.00001562999,0.000007067542,0.0010481842,0.0013250469,0.010378753,0.0040097944,0.1481939,0.8347522],"study_design_scores_gemma":[0.0009597075,0.0005097279,0.006628377,0.00017513573,0.000018285089,0.00005677898,0.000051296272,0.2648747,0.004813285,0.001736832,0.71896565,0.0012102243],"about_ca_topic_score_codex":0.00003571442,"about_ca_topic_score_gemma":0.000014024706,"teacher_disagreement_score":0.8335419,"about_ca_system_score_codex":0.00006052522,"about_ca_system_score_gemma":0.000034355424,"threshold_uncertainty_score":0.84739053},"labels":[],"label_agreement":null},{"id":"W2100598284","doi":"10.1109/lcomm.2005.03030","title":"A simple, intuitive expression for the BER of a jointly optimal single cochannel interferer BPSK receiver","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Phase-shift keying; Additive white Gaussian noise; Interference (communication); Bit error rate; Computer science; Expression (computer science); Algorithm; Binary number; Keying; Mathematics; Electronic engineering; Telecommunications; White noise; Decoding methods; Engineering","score_opus":0.03602808058808123,"score_gpt":0.2824834797602303,"score_spread":0.2464553991721491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100598284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056552716,0.0012148807,0.9329389,0.006889932,0.000093550705,0.0008644381,0.0000712034,0.0005037227,0.0008706938],"genre_scores_gemma":[0.895842,0.0005081832,0.10236143,0.00060961756,0.000043274304,0.0005231763,0.00003657659,0.00004996079,0.000025749961],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990697,0.00008936109,0.00040390113,0.000129615,0.00010777443,0.00019968579],"domain_scores_gemma":[0.99652576,0.0008514453,0.00012437337,0.0023201609,0.00014141717,0.00003681853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018516886,0.00016920386,0.0001974577,0.0001181135,0.00020306953,0.000025254243,0.0015394633,0.00007028601,0.000020505084],"category_scores_gemma":[0.00006244014,0.00014874198,0.00011010196,0.0001891811,0.0002927065,0.0002797444,0.00025485197,0.00031437213,0.0000099583895],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002882821,0.0001494065,0.000024114845,0.00003645292,0.000098462624,8.591774e-8,0.0035719718,0.06749708,0.86987585,0.00079043006,0.028763514,0.0291638],"study_design_scores_gemma":[0.00056753546,0.00006562959,0.00017846942,0.00022853883,0.000048773527,0.0000036452607,0.00075158855,0.106708474,0.80034286,0.00033339855,0.09038264,0.00038842394],"about_ca_topic_score_codex":0.000010000272,"about_ca_topic_score_gemma":0.000029005181,"teacher_disagreement_score":0.8392893,"about_ca_system_score_codex":0.00014088185,"about_ca_system_score_gemma":0.000009016747,"threshold_uncertainty_score":0.6065522},"labels":[],"label_agreement":null},{"id":"W2100757816","doi":"10.1109/lcomm.2006.060431","title":"A general method to decode ABBA quasi-orthogonal space-time block codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Block code; Space–time block code; Decoding methods; Computer science; Algorithm; Theoretical computer science; Linear code; BCJR algorithm; Mathematics","score_opus":0.014557210781022253,"score_gpt":0.28572738052036745,"score_spread":0.2711701697393452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100757816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07425545,0.00057909766,0.90888757,0.0096420515,0.00007988654,0.00049687794,0.00006737894,0.0020773108,0.003914375],"genre_scores_gemma":[0.36671954,0.0001286633,0.6314882,0.0009796772,0.000068217916,0.00028889143,0.00008089721,0.0000737857,0.00017213888],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984275,0.00026201888,0.00048947165,0.00023926291,0.0002040372,0.0003776929],"domain_scores_gemma":[0.9958957,0.00039276353,0.000085316,0.0034258857,0.000089227455,0.00011111843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032120495,0.00028278536,0.00031077286,0.0002956276,0.00027871248,0.00007063329,0.0019583618,0.00010003521,0.000024282608],"category_scores_gemma":[0.000020849035,0.0003378757,0.00011863696,0.0005173313,0.00013045868,0.0002070383,0.0002169687,0.00042352697,0.00021590108],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005675491,0.00011651605,0.00019250542,0.000014543755,0.000053080978,0.0000017216133,0.0001628336,0.21244316,0.73103714,0.0045027137,0.044988744,0.00648137],"study_design_scores_gemma":[0.00066124526,0.00006276722,0.0024921196,0.00014863904,0.00008444274,0.000064371605,0.00004678929,0.26613498,0.34548742,0.0027589044,0.38035104,0.0017072785],"about_ca_topic_score_codex":0.00014107124,"about_ca_topic_score_gemma":0.000119863624,"teacher_disagreement_score":0.3855497,"about_ca_system_score_codex":0.00021271911,"about_ca_system_score_gemma":0.000017262344,"threshold_uncertainty_score":0.9999073},"labels":[],"label_agreement":null},{"id":"W2101499617","doi":"10.1109/lcomm.2013.13.0621130828","title":"Optimal and Efficient Algorithms for Projection-Based Compressive Data Gathering","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Compressed sensing; Computer science; Wireless sensor network; Data aggregator; Algorithm; Integer programming; Linear programming; Approximation algorithm; Mathematical optimization; Computer network; Mathematics","score_opus":0.07220159110532873,"score_gpt":0.2935396447795668,"score_spread":0.22133805367423806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101499617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2797655,0.00045704911,0.71509343,0.002365625,0.00018988758,0.0009746583,0.000050630606,0.0008515678,0.00025165855],"genre_scores_gemma":[0.78764236,0.00003530732,0.211653,0.00031104035,0.00003244911,0.00022633087,0.00006613467,0.000029280622,0.0000040976265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945235,0.000028115766,0.000146054,0.00015638069,0.00006260556,0.00015447199],"domain_scores_gemma":[0.99806654,0.00018969818,0.000034166947,0.0016195965,0.000053376225,0.000036592737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069553054,0.00011334356,0.00010868688,0.0000744719,0.00017474347,0.000083845654,0.0007121985,0.00003607146,0.000003554276],"category_scores_gemma":[0.000012677056,0.00011761512,0.000024037046,0.00008272894,0.000108245855,0.00010242717,0.00013786464,0.00012770468,0.000006245462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096119375,0.00014611892,0.00018533888,0.0000791173,0.00018387845,0.0000015121391,0.00071368634,0.4665899,0.4129367,0.00012187815,0.07455397,0.044478316],"study_design_scores_gemma":[0.00016906588,0.000009626023,0.00018828158,0.00004837315,0.000015663632,0.0000030625374,0.000038880822,0.9834263,0.011021159,0.000011420852,0.0049274946,0.00014068089],"about_ca_topic_score_codex":0.00010273174,"about_ca_topic_score_gemma":0.0000062398526,"teacher_disagreement_score":0.5168364,"about_ca_system_score_codex":0.000028043745,"about_ca_system_score_gemma":0.000007976466,"threshold_uncertainty_score":0.47962055},"labels":[],"label_agreement":null},{"id":"W2102195563","doi":"10.1109/lcomm.2006.1665134","title":"A long-range dependent model for internet traffic with power transformation","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Internet traffic; Range (aeronautics); Marginal distribution; Computer science; Gaussian; Noise (video); TRACE (psycholinguistics); Gaussian network model; Gaussian noise; Transformation (genetics); Statistical physics; Autocorrelation; The Internet; Mathematics; Statistics; Algorithm; Physics; Artificial intelligence; Random variable; Engineering","score_opus":0.017565668647540292,"score_gpt":0.2300306056734196,"score_spread":0.21246493702587932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102195563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043955985,0.00015785742,0.9360575,0.01857702,0.00009172227,0.00048453122,0.0000072847915,0.00023749143,0.00043061955],"genre_scores_gemma":[0.96101534,0.000012033413,0.036607303,0.0018011342,0.000028619832,0.0003029385,0.000025818652,0.000013742926,0.00019306845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903566,0.000063668725,0.0002684207,0.00021584489,0.00017844255,0.00023795557],"domain_scores_gemma":[0.99849904,0.0001297121,0.00009407225,0.001140993,0.00008886449,0.000047299585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019071561,0.00014490206,0.0001349336,0.00009989732,0.00017846252,0.0001528567,0.0015347139,0.00004629575,0.0000025143813],"category_scores_gemma":[0.0000022599868,0.00013169125,0.00007692898,0.0001824771,0.00008446169,0.00048611857,0.000038940765,0.00014857059,0.000017373603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008986689,0.0004238265,0.00019158865,0.000024018824,0.00009266577,0.0000035826424,0.0034023358,0.7927873,0.0005453136,0.100878015,0.016271183,0.08529029],"study_design_scores_gemma":[0.00090567133,0.00003962359,0.00017062464,0.000021768345,0.00002029156,0.000012425215,0.000012194866,0.99692047,0.000036887544,0.00010860767,0.001570494,0.00018092722],"about_ca_topic_score_codex":0.000016940796,"about_ca_topic_score_gemma":0.00045740497,"teacher_disagreement_score":0.91705936,"about_ca_system_score_codex":0.00006206458,"about_ca_system_score_gemma":0.000041702046,"threshold_uncertainty_score":0.53702134},"labels":[],"label_agreement":null},{"id":"W2102292102","doi":"10.1109/lcomm.2011.011811.102279","title":"Improved Algorithm for Constructing Constrained Codes with State-Independent Decoding","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Sequential decoding; BCJR algorithm; Sequence (biology); State (computer science); List decoding; Berlekamp–Welch algorithm; Block code; Concatenated error correction code","score_opus":0.04387124985788549,"score_gpt":0.26809577302622856,"score_spread":0.22422452316834307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102292102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052560256,0.000055755605,0.9927358,0.00053952035,0.00022996981,0.0004152992,0.00004963629,0.0002006836,0.00051732204],"genre_scores_gemma":[0.15403609,0.00001784042,0.84515655,0.000646399,0.000023801345,0.00007289942,0.000022509656,0.000014774936,0.000009108327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874276,0.00007521483,0.0003297124,0.00033850258,0.00016331591,0.00035049816],"domain_scores_gemma":[0.9971832,0.00037058556,0.00022787077,0.0019585988,0.00014959867,0.000110115536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528592,0.00017684224,0.00019022496,0.00013717105,0.00045943575,0.00014944113,0.002243694,0.000045260473,0.0000047695376],"category_scores_gemma":[0.000014756129,0.00015446813,0.00005735888,0.00022496415,0.00030241563,0.0006011026,0.00041804803,0.00021940628,0.000004674989],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025936935,0.00016905022,0.0004889613,0.00001930403,0.00014057104,0.000012258202,0.0025807335,0.000021677684,0.034895957,0.006770304,0.0005294746,0.95434576],"study_design_scores_gemma":[0.0030564056,0.00028095313,0.00041659892,0.00018642365,0.000058080626,0.0002383497,0.0011141176,0.92924076,0.059083678,0.0013622596,0.003908971,0.0010533965],"about_ca_topic_score_codex":0.0001330357,"about_ca_topic_score_gemma":0.000060966777,"teacher_disagreement_score":0.95329237,"about_ca_system_score_codex":0.000053421296,"about_ca_system_score_gemma":0.000076438315,"threshold_uncertainty_score":0.6299027},"labels":[],"label_agreement":null},{"id":"W2102981938","doi":"10.1109/lcomm.2002.803481","title":"Bootstrap decoding of low-density parity-check codes","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Erasure; Computer science; Algorithm; Parity bit; List decoding; Sequential decoding; Mathematics; Arithmetic; Theoretical computer science; Concatenated error correction code; Block code","score_opus":0.08314543522971805,"score_gpt":0.30421547431048007,"score_spread":0.221070039080762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102981938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39553994,0.0003429895,0.58035123,0.0189899,0.00033600195,0.00026993087,0.0000037156628,0.0010154007,0.0031509148],"genre_scores_gemma":[0.82335925,0.00012876539,0.175296,0.0011481838,0.0000147040955,0.00001777293,0.0000014814599,0.000010058656,0.00002376743],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987495,0.00021731756,0.00035053582,0.0002465644,0.00020687889,0.00022921902],"domain_scores_gemma":[0.99566525,0.00041622034,0.00020973518,0.0035419972,0.00010805768,0.000058731952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039771615,0.00013667348,0.00020188655,0.000168047,0.00026523857,0.00007398415,0.0034693712,0.000061692284,0.000008728342],"category_scores_gemma":[0.00009561645,0.00015469281,0.00009931814,0.0004593736,0.00022835261,0.00036447635,0.0005272459,0.0003408035,0.000039862032],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008526131,0.0012757311,0.034765065,0.00017909768,0.00018929626,0.000024439565,0.011993897,0.0003669134,0.72575986,0.060909793,0.091957636,0.07256976],"study_design_scores_gemma":[0.0009709441,0.00017851288,0.016760036,0.00075325987,0.00008038493,0.00016241962,0.0002416469,0.42906925,0.53380257,0.0047642062,0.011387258,0.001829515],"about_ca_topic_score_codex":0.00014774443,"about_ca_topic_score_gemma":0.00009692862,"teacher_disagreement_score":0.42870232,"about_ca_system_score_codex":0.00009375437,"about_ca_system_score_gemma":0.000013041077,"threshold_uncertainty_score":0.6447013},"labels":[],"label_agreement":null},{"id":"W2103638442","doi":"10.1109/lcomm.2005.1461677","title":"Practical capacity calculation for time-hopping ultra-wide band multiple-access communications","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Time-hopping; Computer science; Cutoff; Synchronization (alternating current); Frequency-hopping spread spectrum; Communications system; Channel capacity; Spread spectrum; Computer network; Telecommunications; Channel (broadcasting); Physics; Detector","score_opus":0.06602013569802985,"score_gpt":0.31575568439023566,"score_spread":0.24973554869220582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103638442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14130692,0.0013818458,0.6192806,0.2204889,0.00038843963,0.003102246,0.0002587333,0.0040118825,0.009780479],"genre_scores_gemma":[0.82645255,0.00071265135,0.16979365,0.0016082812,0.000062533865,0.0009425816,0.0002988896,0.000083904,0.00004493733],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798185,0.000264229,0.00076444494,0.0002981388,0.00019114613,0.00050019793],"domain_scores_gemma":[0.9888932,0.0033926198,0.00018273797,0.0072009102,0.00020398464,0.00012653491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047930854,0.00033167755,0.0003552724,0.0003536594,0.00089756283,0.00017992861,0.0040743886,0.0002475256,0.00002303792],"category_scores_gemma":[0.0005882483,0.0003958988,0.00018316583,0.00060588645,0.00064931996,0.0009696279,0.0002449098,0.00084982143,0.00016896866],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048106223,0.0009954532,0.007241509,0.0001487148,0.0007375269,9.82011e-7,0.0018237008,0.045236126,0.7528614,0.007133309,0.16270836,0.021064859],"study_design_scores_gemma":[0.0015598726,0.00003526016,0.0022448248,0.00012288439,0.00021470808,0.000051841642,0.00010132121,0.4466457,0.048884198,0.0003569322,0.4986701,0.0011123528],"about_ca_topic_score_codex":0.00006108663,"about_ca_topic_score_gemma":0.0005727649,"teacher_disagreement_score":0.70397717,"about_ca_system_score_codex":0.00039736315,"about_ca_system_score_gemma":0.000047123525,"threshold_uncertainty_score":0.99984926},"labels":[],"label_agreement":null},{"id":"W2104091737","doi":"10.1109/lcomm.2013.052413.130298","title":"A Moment Matching Technique to Estimate the Achievable Ergodic Rate for Limited Feedback Distributed Antenna Systems in the Presence of Out-of-Cell Interference","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Ergodic theory; Precoding; Path loss; Moment (physics); Zero-forcing precoding; Interference (communication); Quantization (signal processing); Topology (electrical circuits); Control theory (sociology); Fading; Computer science; Antenna (radio); Mathematics; Telecommunications; Algorithm; MIMO; Wireless; Mathematical analysis; Physics; Beamforming; Decoding methods","score_opus":0.024210007556347262,"score_gpt":0.27842991963385705,"score_spread":0.25421991207750977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104091737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05186944,0.00015909437,0.943326,0.0018387744,0.00012090431,0.0025293117,0.00004773228,0.00006606655,0.0000426927],"genre_scores_gemma":[0.9742186,0.000039949944,0.02327931,0.00006388183,0.000007809356,0.0023212743,0.00003569216,0.000022932041,0.000010535645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998921,0.00021082044,0.0004831732,0.0001134198,0.000081529375,0.00019005944],"domain_scores_gemma":[0.99762106,0.0006429334,0.00015144398,0.0014496754,0.000110323825,0.00002458379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048875355,0.00013411799,0.00019809019,0.00010080259,0.000088532164,0.000047757418,0.0013165385,0.000040936524,7.604071e-7],"category_scores_gemma":[0.000050119634,0.000096971846,0.000039805844,0.0003756495,0.00008053113,0.00020907802,0.000101566366,0.00018793531,0.000005382112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005075571,0.000030332732,0.00003390367,0.00014400105,0.000011887763,8.135725e-8,0.0016666517,0.526876,0.47052255,0.00014113625,0.00050306134,0.000065315704],"study_design_scores_gemma":[0.00042596154,0.00006169855,0.00035577212,0.0010561582,0.000031320003,0.000005970577,0.001760936,0.9655471,0.029884692,0.000171169,0.00041162837,0.0002875801],"about_ca_topic_score_codex":0.00019331284,"about_ca_topic_score_gemma":0.000051816914,"teacher_disagreement_score":0.92234915,"about_ca_system_score_codex":0.00008068797,"about_ca_system_score_gemma":0.000009925685,"threshold_uncertainty_score":0.3954397},"labels":[],"label_agreement":null},{"id":"W2104322921","doi":"10.1109/lcomm.2011.071311.111110","title":"Channel Coding Diversity with Mismatched Decoding Metrics","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Computer science; Baud; Diversity scheme; Algorithm; Channel (broadcasting); Coding (social sciences); Antenna diversity; Diversity gain; Telecommunications; Bit error rate; Theoretical computer science; Electronic engineering; Mathematics; Fading; Wireless; Statistics; Engineering","score_opus":0.08239428994472643,"score_gpt":0.23167216561803033,"score_spread":0.14927787567330392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104322921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6137415,0.0015236504,0.34590524,0.0063984916,0.00034931116,0.00061260007,0.000021353699,0.005503924,0.025943888],"genre_scores_gemma":[0.9380064,0.0010149532,0.06061802,0.00026797,0.000006686368,0.000041123625,0.0000075207668,0.00003072657,0.000006580623],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999212,0.000049757975,0.00020953422,0.0001327166,0.00014191197,0.00025405447],"domain_scores_gemma":[0.997182,0.00023296748,0.000056834586,0.0024041408,0.00006076405,0.000063254345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016395454,0.00016314386,0.0001756139,0.00027572425,0.0004532031,0.000032363383,0.0022861976,0.000084060215,0.000013824118],"category_scores_gemma":[0.0000448796,0.00016556427,0.000047827303,0.0006930613,0.00029462774,0.00024324247,0.00075382483,0.00041808462,0.000057355443],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032486703,0.0035467043,0.09888701,0.0013406065,0.0059047653,0.00015823953,0.10335345,0.048067514,0.28724262,0.1920723,0.06594729,0.19315465],"study_design_scores_gemma":[0.0045916624,0.00030908687,0.027724583,0.0007933787,0.0005665859,0.000109816225,0.011655861,0.5601236,0.37151653,0.00424678,0.012765925,0.0055961823],"about_ca_topic_score_codex":0.000049544138,"about_ca_topic_score_gemma":0.000039466067,"teacher_disagreement_score":0.5120561,"about_ca_system_score_codex":0.00012667553,"about_ca_system_score_gemma":0.0000062403237,"threshold_uncertainty_score":0.6751515},"labels":[],"label_agreement":null},{"id":"W2104741227","doi":"10.1109/4234.966033","title":"Blind iterative decision-feedback multiuser detection of FEC-coded CDMA signals","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Code division multiple access; Multiuser detection; Forward error correction; Detection theory; Spread spectrum; Algorithm; Decoding methods; Telecommunications; Detector","score_opus":0.05986884682284031,"score_gpt":0.3324633427567524,"score_spread":0.27259449593391205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104741227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2340092,0.0005554429,0.7535595,0.01025076,0.00018415533,0.0005191988,0.0000049772984,0.00016857631,0.0007481615],"genre_scores_gemma":[0.9099521,0.0008532645,0.08799591,0.0008833825,0.000041356205,0.00014999343,0.000011402684,0.000023769233,0.00008884341],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704945,0.0008871046,0.00070383254,0.00039396645,0.0005742973,0.00039134355],"domain_scores_gemma":[0.99011195,0.0022909997,0.0003329372,0.006610923,0.00051286694,0.00014034356],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00086229254,0.00022334905,0.0003021953,0.00048038762,0.00054296874,0.0002333886,0.006845768,0.00011777407,0.000027373777],"category_scores_gemma":[0.00017451656,0.00022703756,0.00015328746,0.0018553436,0.0004097322,0.000935146,0.0012737301,0.0006180213,0.00016315382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020575422,0.0009984866,0.0018572079,0.000024071165,0.00024243766,0.000011364966,0.0048067085,0.025663698,0.66610974,0.0034712544,0.006164768,0.29044452],"study_design_scores_gemma":[0.0033289408,0.00015932054,0.009782601,0.00031235456,0.000030565152,0.00006480704,0.00018590786,0.8762792,0.07986473,0.0014848149,0.027644858,0.000861917],"about_ca_topic_score_codex":0.00010072669,"about_ca_topic_score_gemma":0.00020438695,"teacher_disagreement_score":0.8506155,"about_ca_system_score_codex":0.00014645775,"about_ca_system_score_gemma":0.00007255725,"threshold_uncertainty_score":0.99852765},"labels":[],"label_agreement":null},{"id":"W2105224268","doi":"10.1109/lcomm.2005.1576581","title":"Maximum likelihood estimation of the K factor in ricean fading channels","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Weibull fading; Fading distribution; Estimator; Channel state information; Envelope (radar); Channel (broadcasting); Statistics; Mathematics; Algorithm; Computer science; Telecommunications; Rayleigh fading; Wireless","score_opus":0.020590725174684202,"score_gpt":0.2648693817319885,"score_spread":0.2442786565573043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105224268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7359354,0.00084711425,0.24749152,0.012522146,0.00021960982,0.0006873433,0.000022577611,0.00073144987,0.0015428648],"genre_scores_gemma":[0.9510474,0.00031767203,0.048220538,0.00027291014,0.000016024916,0.000083796236,0.000008226635,0.000028856679,0.000004584161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991685,0.00009524862,0.0003653814,0.000086056,0.00011537212,0.00016940052],"domain_scores_gemma":[0.9974819,0.00016362536,0.00009683897,0.002203009,0.000029071283,0.0000255671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012491686,0.00012086409,0.00013948239,0.00016539883,0.00009922188,0.000016466316,0.0015511576,0.000053991553,0.000006816126],"category_scores_gemma":[0.000028736891,0.00011648647,0.000056576573,0.00042736888,0.00011101744,0.00028425717,0.00016262465,0.00033725996,0.000012414885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002255654,0.00010180222,0.0009694881,0.00004721398,0.00002957191,1.4100713e-7,0.003069792,0.69916373,0.15330145,0.00067213207,0.0010772356,0.14156517],"study_design_scores_gemma":[0.0004928718,0.000011593647,0.0073029385,0.0003307883,0.00001737072,0.0000051641177,0.00013480564,0.72789145,0.25265,0.0018971098,0.008770793,0.00049513776],"about_ca_topic_score_codex":0.00001980965,"about_ca_topic_score_gemma":0.00006741829,"teacher_disagreement_score":0.21511202,"about_ca_system_score_codex":0.0001880636,"about_ca_system_score_gemma":0.000009400345,"threshold_uncertainty_score":0.47501805},"labels":[],"label_agreement":null},{"id":"W2105568424","doi":"10.1109/lcomm.2004.825722","title":"Performance Analysis of<tex>$L$</tex>-Branch Equal Gain Combiners in Equally Correlated Rayleigh Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Rayleigh fading; Fading distribution; Mathematics; Cumulative distribution function; Signal-to-noise ratio (imaging); Statistics; Telecommunications; Probability density function; Computer science","score_opus":0.041926867515884085,"score_gpt":0.28730908979215874,"score_spread":0.24538222227627465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105568424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6597962,0.0015079306,0.3338951,0.0015555396,0.00025633175,0.00064723985,0.00006485857,0.0010775562,0.0011993009],"genre_scores_gemma":[0.940508,0.0032808615,0.053988546,0.0005204237,0.000033763452,0.0003509215,0.0010406817,0.00016444048,0.00011235525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957579,0.0004650957,0.0017721229,0.0005535216,0.0005776016,0.0008737547],"domain_scores_gemma":[0.9916596,0.00088252674,0.00055729976,0.006419652,0.00027566118,0.00020528138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010204223,0.0006889334,0.0011228945,0.0020555183,0.00044673705,0.00009988429,0.0037572852,0.00037603718,0.00008086803],"category_scores_gemma":[0.00019711483,0.0008374823,0.00039234647,0.004651623,0.00059740426,0.0007695854,0.0005236299,0.0014128749,0.00016904704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026872924,0.00023019065,0.0011895733,0.00007552354,0.00056944176,8.298388e-7,0.003549257,0.7936515,0.19605288,0.0009525035,0.0008157605,0.0028856602],"study_design_scores_gemma":[0.019892823,0.00047589868,0.027564146,0.008052059,0.0059697474,0.00013743473,0.00089453696,0.6228341,0.101588786,0.004649291,0.1913159,0.016625285],"about_ca_topic_score_codex":0.00017510534,"about_ca_topic_score_gemma":0.0014246682,"teacher_disagreement_score":0.28071186,"about_ca_system_score_codex":0.00087573146,"about_ca_system_score_gemma":0.00007189266,"threshold_uncertainty_score":0.9994076},"labels":[],"label_agreement":null},{"id":"W2106022791","doi":"10.1109/lcomm.2010.05.100202","title":"Performance of PPM on terrestrial FSO links with turbulence and pointing errors","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":169,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pulse-position modulation; Modulation (music); Keying; Turbulence; Computer science; Free-space optical communication; On-off keying; Range (aeronautics); Probability of error; Optical communication; Position (finance); Atmospheric turbulence; Electronic engineering; Algorithm; Bit error rate; Telecommunications; Quadrature amplitude modulation; Physics; Pulse (music); Pulse-amplitude modulation; Optics; Decoding methods; Acoustics; Materials science","score_opus":0.014470811681710919,"score_gpt":0.22610045778976254,"score_spread":0.21162964610805163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106022791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99338365,0.000080791455,0.00023419755,0.0042702486,0.000098970406,0.00013093404,0.000002858611,0.0003423997,0.0014559347],"genre_scores_gemma":[0.9676499,0.00044074934,0.03170849,0.000120498305,0.00001473493,0.00003427857,0.000004655747,0.000021891836,0.0000048027377],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938273,0.000022976856,0.00023033512,0.00010568915,0.00010756392,0.0001507144],"domain_scores_gemma":[0.9975379,0.00025350103,0.0000673708,0.0020816142,0.000026006304,0.00003358138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013132236,0.00012422499,0.0001445072,0.0001231148,0.00012876836,0.000024038822,0.0011058382,0.00012373093,0.0000043189834],"category_scores_gemma":[0.000053412787,0.000113806906,0.000022421345,0.00020429825,0.00056041626,0.00013592272,0.00014652354,0.0010590018,0.000009023457],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009717173,0.0002563014,0.027267052,0.0001960148,0.00014994032,0.0000019979072,0.0014284499,0.021203483,0.81251335,0.004970669,0.0014038497,0.13051173],"study_design_scores_gemma":[0.0020800347,0.00042190458,0.039975636,0.00074784004,0.000072635055,0.00004071288,0.00047707942,0.6644407,0.28086755,0.00011606097,0.009490728,0.0012691163],"about_ca_topic_score_codex":0.000012152529,"about_ca_topic_score_gemma":0.000029184497,"teacher_disagreement_score":0.64323723,"about_ca_system_score_codex":0.000016226808,"about_ca_system_score_gemma":0.000008715321,"threshold_uncertainty_score":0.4640911},"labels":[],"label_agreement":null},{"id":"W2106030111","doi":"10.1109/lcomm.2010.04.091992","title":"Diversity-multiplexing tradeoff in MIMO relay channels for a broad class of fading distributions","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Relay; MIMO; Multiplexing; Computer science; Transmitter; Relay channel; Spatial multiplexing; Topology (electrical circuits); Telecommunications; Electronic engineering; Channel (broadcasting); Mathematics; Physics; Engineering","score_opus":0.06711446176027135,"score_gpt":0.3006092035798336,"score_spread":0.23349474181956226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106030111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27588058,0.00023471177,0.683215,0.038800664,0.00059988385,0.0006397634,0.000034416164,0.00014195265,0.00045301887],"genre_scores_gemma":[0.94385237,0.00019286697,0.055197764,0.000564602,0.000030747393,0.000098098004,0.00003182714,0.000009007612,0.000022711332],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.00020521469,0.00039037113,0.00024565135,0.00013497677,0.00027049982],"domain_scores_gemma":[0.99630153,0.0008294923,0.00017674865,0.0024812885,0.00014082606,0.000070085734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068244,0.00013781994,0.00020824859,0.0002408755,0.0012519339,0.00006594041,0.0037696364,0.00007487964,0.0000047678723],"category_scores_gemma":[0.0001657763,0.00015631475,0.000117969634,0.0007664022,0.000236298,0.00044589865,0.0018044513,0.0005245791,0.000004345712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025672696,0.00077581673,0.010601699,0.000052810607,0.00011072935,0.0000023406633,0.025147172,0.004933267,0.5688879,0.34938663,0.00660069,0.03347529],"study_design_scores_gemma":[0.0032785642,0.00009885154,0.015454311,0.00032078184,0.00004237478,0.000019944448,0.00036314916,0.852045,0.02117962,0.0017680698,0.10433456,0.0010947706],"about_ca_topic_score_codex":0.000044253626,"about_ca_topic_score_gemma":0.0005201168,"teacher_disagreement_score":0.84711176,"about_ca_system_score_codex":0.00007560024,"about_ca_system_score_gemma":0.00004174238,"threshold_uncertainty_score":0.96289897},"labels":[],"label_agreement":null},{"id":"W2106983168","doi":"10.1109/lcomm.2008.080488","title":"Characterizing the traffic distribution in linear wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless sensor network; Computer network; Computer science; Traffic generation model; Relay; Wireless network; Key distribution in wireless sensor networks; Hop (telecommunications); Wireless; Distributed computing; Telecommunications","score_opus":0.027252770313479058,"score_gpt":0.24204049825084514,"score_spread":0.21478772793736609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106983168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69619894,0.00017313755,0.2783037,0.024321333,0.000513991,0.0001989773,0.0000034993209,0.00022263313,0.00006374711],"genre_scores_gemma":[0.9899334,0.000575516,0.0060136626,0.0031818205,0.0001253389,0.000055004017,0.000065545784,0.000018354618,0.000031397547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814963,0.00046146865,0.0004027115,0.000320364,0.00023202164,0.00043377458],"domain_scores_gemma":[0.996246,0.0005094551,0.00016581226,0.00295401,0.000059342365,0.00006537154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000373568,0.00018820964,0.00019232971,0.00008686417,0.00069635274,0.000080071644,0.0031393482,0.000090420835,0.000001201974],"category_scores_gemma":[0.000018729466,0.00016294052,0.00009173548,0.0010115231,0.00038273638,0.0002992446,0.0003479659,0.000640941,0.000025693158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064898836,0.00018182161,0.00088969234,0.0000034241043,0.000019385448,0.000028591752,0.0013036508,0.98162603,0.004798726,0.0016073823,0.0021634484,0.007371351],"study_design_scores_gemma":[0.0002221351,0.000009113284,0.0062342673,0.00003830318,0.0000040619548,0.000058927595,0.000025840442,0.98602486,0.00027594407,0.0000011863987,0.0068948367,0.00021053446],"about_ca_topic_score_codex":0.000043306856,"about_ca_topic_score_gemma":0.000051143037,"teacher_disagreement_score":0.2937344,"about_ca_system_score_codex":0.00014463742,"about_ca_system_score_gemma":0.00003296061,"threshold_uncertainty_score":0.66445214},"labels":[],"label_agreement":null},{"id":"W2107152779","doi":"10.1109/lcomm.2007.061985","title":"Optimal 100% Excess Bandwidth Signaling in Cochannel Interference","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Raised-cosine filter; Bandwidth (computing); Transmitter; Interference (communication); Mathematics; Matched filter; Computer science; Control theory (sociology); Adjacent-channel interference; Gaussian noise; Algorithm; Filter (signal processing); Topology (electrical circuits); Telecommunications; Root-raised-cosine filter; Digital filter","score_opus":0.0653685383714268,"score_gpt":0.3356819902457752,"score_spread":0.2703134518743484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107152779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1664056,0.00055374217,0.81550795,0.015375576,0.00018775191,0.00027779432,0.0000015035488,0.00019177687,0.0014982981],"genre_scores_gemma":[0.9008441,0.00024727447,0.097437695,0.0012945603,0.00004206194,0.00006025931,0.00001054309,0.000018150695,0.00004533555],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997579,0.00047034657,0.00059828436,0.00037835882,0.00037262146,0.00060141506],"domain_scores_gemma":[0.99317354,0.001355857,0.00016132061,0.0050018695,0.00015916054,0.00014826978],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.002028901,0.00019317362,0.00022749398,0.0005474078,0.00034663704,0.00026511645,0.0098906355,0.00009151616,0.000012206797],"category_scores_gemma":[0.000077232085,0.00021256576,0.000073344316,0.0015012345,0.00032548577,0.0007201549,0.0017670685,0.0008933228,0.00008478803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019152774,0.0025426317,0.015414418,0.00013443206,0.00024908784,0.00016684365,0.030151337,0.20547436,0.4011594,0.09033921,0.01640648,0.23777024],"study_design_scores_gemma":[0.0023110304,0.00015161271,0.014104931,0.00073217676,0.00001490576,0.000075774195,0.0008516493,0.93347454,0.03334058,0.0011806083,0.012080306,0.0016818901],"about_ca_topic_score_codex":0.00016729988,"about_ca_topic_score_gemma":0.00030808692,"teacher_disagreement_score":0.73443854,"about_ca_system_score_codex":0.00021800416,"about_ca_system_score_gemma":0.0000786034,"threshold_uncertainty_score":0.99546635},"labels":[],"label_agreement":null},{"id":"W2107283447","doi":"10.1109/lcomm.2005.11014","title":"Distance-based-decoding of block turbo codes","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Reduction (mathematics); Algorithm; Decoding methods; Sequence (biology); Computational complexity theory; Computation; Computer science; Mathematics; Multiplexing; Mathematical optimization; Telecommunications; Channel (broadcasting)","score_opus":0.024227696667276293,"score_gpt":0.25552170814896313,"score_spread":0.23129401148168685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107283447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91694856,0.0026336357,0.03833219,0.024337647,0.0008322826,0.00035492904,0.000058189406,0.0010212429,0.015481344],"genre_scores_gemma":[0.9747672,0.00013221597,0.02458115,0.00034389907,0.000075409174,0.00003482548,0.000009944042,0.000024482735,0.000030891624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937695,0.000037566657,0.00025814967,0.00008079982,0.00010328941,0.00014325476],"domain_scores_gemma":[0.99846345,0.00013459462,0.000050542927,0.0012807726,0.000031547537,0.000039065668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009257376,0.000100084326,0.0001247283,0.00010815236,0.0000906253,0.000016343225,0.00065758824,0.000035077534,0.000023031966],"category_scores_gemma":[0.000015036133,0.000116524796,0.00006024265,0.00019704728,0.00016293945,0.0001105083,0.00002938684,0.00017859065,0.000040974126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052119854,0.0000963704,0.0013693093,0.00007287675,0.00009260734,5.473566e-7,0.0005820012,0.5500737,0.38910133,0.00075066823,0.047776483,0.010078938],"study_design_scores_gemma":[0.0006444433,0.000015054991,0.0012162509,0.00020392888,0.00006576415,0.000013372292,0.00013668701,0.27397278,0.3357605,0.00006318352,0.38728186,0.00062616804],"about_ca_topic_score_codex":0.000008336845,"about_ca_topic_score_gemma":0.000026129821,"teacher_disagreement_score":0.33950537,"about_ca_system_score_codex":0.00011525752,"about_ca_system_score_gemma":0.0000100897505,"threshold_uncertainty_score":0.47517434},"labels":[],"label_agreement":null},{"id":"W2107363488","doi":"10.1109/lcomm.2010.07.100407","title":"Amplify-and-Forward Relaying in Channel-Noise-Assisted Cooperative Networks with Relay Selection","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Ergodic theory; Relay; Cumulative distribution function; Probability density function; Channel (broadcasting); Expression (computer science); Computer science; Topology (electrical circuits); Signal-to-noise ratio (imaging); Upper and lower bounds; Closed-form expression; Selection (genetic algorithm); Channel capacity; Noise (video); Relay channel; Outage probability; Mathematics; Algorithm; Applied mathematics; Telecommunications; Statistics; Fading; Mathematical analysis; Physics; Combinatorics; Artificial intelligence","score_opus":0.02841809767530662,"score_gpt":0.26936046351339593,"score_spread":0.2409423658380893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107363488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23900576,0.0004889726,0.7275905,0.029706737,0.00036236306,0.0005210197,0.0000016549662,0.0003554948,0.00196749],"genre_scores_gemma":[0.96163934,0.0006379786,0.03508139,0.0023631388,0.000037906833,0.00016125252,0.000014195667,0.000019542078,0.00004525363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985222,0.00039377125,0.0003164284,0.00033764675,0.00014345185,0.0002864688],"domain_scores_gemma":[0.997314,0.00042299606,0.00013760287,0.00188551,0.00014268677,0.000097233875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005550892,0.0001852745,0.00018502523,0.00021764601,0.0007318438,0.0002524203,0.001693319,0.00010501181,0.000007805696],"category_scores_gemma":[0.000053219996,0.00017967424,0.000032858905,0.0011299659,0.00025340685,0.00058195763,0.00047699548,0.0012081873,0.000011396919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018518994,0.0011662149,0.03073236,0.000046979832,0.00041858276,0.000030429948,0.017507032,0.24569996,0.2362396,0.30391866,0.01313622,0.1509188],"study_design_scores_gemma":[0.0008716231,0.00007536584,0.016824258,0.00010314016,0.000015414262,0.00007449939,0.0000858953,0.97247064,0.00063050736,0.000033978336,0.008337477,0.00047718946],"about_ca_topic_score_codex":0.00004088991,"about_ca_topic_score_gemma":0.0018688923,"teacher_disagreement_score":0.7267707,"about_ca_system_score_codex":0.00006486219,"about_ca_system_score_gemma":0.000057212288,"threshold_uncertainty_score":0.73269033},"labels":[],"label_agreement":null},{"id":"W2108170890","doi":"10.1109/4234.996038","title":"Generalized moment estimators for the Nakagami fading parameter","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Moment (physics); Nakagami distribution; Mathematics; Fading; Applied mathematics; Integer (computer science); Estimation theory; Statistics; Mathematical optimization; Computer science; Physics","score_opus":0.05782479819659659,"score_gpt":0.2860994234128695,"score_spread":0.2282746252162729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108170890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019200508,0.0034550757,0.9578594,0.016558435,0.0002324515,0.0008838651,0.000020589072,0.0012444652,0.00054522103],"genre_scores_gemma":[0.774188,0.0028350714,0.21990952,0.001461944,0.00003068711,0.0014295378,0.000017645907,0.00006129033,0.00006628858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991729,0.0000663062,0.00030267358,0.000118742486,0.00010571864,0.00023365805],"domain_scores_gemma":[0.9959625,0.0008951724,0.00006321072,0.0029961634,0.000040070623,0.000042861782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014983783,0.00016425502,0.00015104473,0.000095122385,0.00039638142,0.000058805323,0.001708216,0.00004911739,0.000022431814],"category_scores_gemma":[0.00003532045,0.00014503927,0.000102184036,0.00021235038,0.00017723296,0.00016526475,0.00011537687,0.00024890545,0.000031417967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010879799,0.00021816058,0.00032369824,0.000113368216,0.0005579441,0.0000011868725,0.0036306314,0.37126383,0.14526522,0.020125592,0.26107672,0.19741277],"study_design_scores_gemma":[0.00027728247,0.00000856311,0.000046659366,0.000029305775,0.000032655014,0.0000039511356,0.000035734403,0.77381617,0.010419121,0.00037908278,0.21468543,0.00026607508],"about_ca_topic_score_codex":0.000009900742,"about_ca_topic_score_gemma":0.000007843422,"teacher_disagreement_score":0.7549875,"about_ca_system_score_codex":0.00013093089,"about_ca_system_score_gemma":0.000002302949,"threshold_uncertainty_score":0.591453},"labels":[],"label_agreement":null},{"id":"W2109240745","doi":"10.1109/lcomm.2003.817333","title":"Performance of OFDM with modified RA codes and clipping","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Clipping (morphology); Computer science; Turbo code; Telecommunications; Block code; Computer network; Electronic engineering; Algorithm; Decoding methods; Channel (broadcasting)","score_opus":0.02519692990375993,"score_gpt":0.2318556266756219,"score_spread":0.20665869677186197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109240745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99092025,0.00031411456,0.0026142397,0.00041219968,0.00007528235,0.00008887296,0.000002807241,0.00009288942,0.0054793614],"genre_scores_gemma":[0.98917,0.0004435784,0.010229286,0.0000859593,0.000007768301,0.000026061058,0.000002783076,0.000015417441,0.000019134974],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995818,0.000039410137,0.00014760307,0.00006448814,0.00006546109,0.00010123448],"domain_scores_gemma":[0.9990951,0.000065830725,0.000034538218,0.00075217185,0.00002494585,0.000027411912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098524986,0.00007657875,0.000101578524,0.000076911645,0.00008775191,0.000011069243,0.00023135697,0.000023945873,0.0000038451903],"category_scores_gemma":[0.000008673383,0.000077084966,0.0000140882,0.00015285841,0.00018641203,0.00011221979,0.00001575739,0.0001292267,0.000003310546],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002285831,0.000088792825,0.019839989,0.00032945714,0.00028559763,0.0000012189729,0.0025943983,0.33096668,0.6334526,0.003441306,0.0037838342,0.005193291],"study_design_scores_gemma":[0.0041751415,0.00021373788,0.04434519,0.0009966064,0.0002748262,0.0004141006,0.0014948911,0.56393814,0.3169346,0.0001497026,0.06487966,0.0021833826],"about_ca_topic_score_codex":0.0000064763512,"about_ca_topic_score_gemma":0.0000041000876,"teacher_disagreement_score":0.31651798,"about_ca_system_score_codex":0.000026841306,"about_ca_system_score_gemma":0.000007315253,"threshold_uncertainty_score":0.31434336},"labels":[],"label_agreement":null},{"id":"W2110037800","doi":"10.1109/lcomm.2010.08.100773","title":"Simple Expressions for the SER of Dual MRC in Correlated Nakagami-q (Hoyt) Fading","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Decorrelation; Nakagami distribution; Independent and identically distributed random variables; Maximal-ratio combining; Mathematics; Transformation (genetics); Simple (philosophy); Modulation (music); Algorithm; Applied mathematics; Random variable; Statistics; Decoding methods; Physics","score_opus":0.023359017311388376,"score_gpt":0.28840911520128726,"score_spread":0.26505009788989886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110037800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6246079,0.00089788553,0.36261758,0.00707713,0.00053852325,0.0016768622,0.00010307854,0.0010949994,0.0013860184],"genre_scores_gemma":[0.9695833,0.0003284783,0.029275304,0.00021609601,0.00001759702,0.00048123786,0.000040919705,0.000043595042,0.000013478832],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991633,0.000063431595,0.0003943837,0.00010287206,0.0000905666,0.00018538978],"domain_scores_gemma":[0.9957107,0.0013282767,0.00009526575,0.00276598,0.00006668107,0.000033142263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002523573,0.00013210668,0.00016470285,0.00014781234,0.00020990071,0.0000179474,0.0014611444,0.00009282091,0.000011875769],"category_scores_gemma":[0.00010332011,0.00012015913,0.000069733906,0.00032831472,0.0002322943,0.00017753187,0.00017793242,0.0006533423,0.0000048664233],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052028086,0.00005073856,0.00063151104,0.00001950123,0.000031043404,2.0675677e-7,0.0007719344,0.043739762,0.9444233,0.0024196864,0.0044198264,0.003487265],"study_design_scores_gemma":[0.0014834058,0.000033722186,0.0075441813,0.00026111052,0.00006703934,0.000013663552,0.0010107212,0.58449435,0.28694385,0.0027800153,0.11447579,0.000892165],"about_ca_topic_score_codex":0.000047633923,"about_ca_topic_score_gemma":0.00022946727,"teacher_disagreement_score":0.65747947,"about_ca_system_score_codex":0.000044002478,"about_ca_system_score_gemma":0.000013493949,"threshold_uncertainty_score":0.4899947},"labels":[],"label_agreement":null},{"id":"W2110460416","doi":"10.1109/lcomm.2006.1613731","title":"Estimation of typical sum of lognormal random variables using log shifted gamma approximation","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Log-normal distribution; Random variable; Statistics; Mathematics; Gamma distribution; Applied mathematics; Algorithm; Computer science","score_opus":0.11597238649689245,"score_gpt":0.35636383721052595,"score_spread":0.2403914507136335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110460416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51683,0.00007470317,0.48105583,0.0015053744,0.00006228881,0.00018350608,0.000015559708,0.000017287543,0.00025543204],"genre_scores_gemma":[0.897406,0.000008961427,0.10241446,0.000090161964,0.000018522333,0.00001197335,0.000031900145,0.00000649094,0.000011543166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739873,0.0006156207,0.001072546,0.00020606894,0.00055093056,0.00015608578],"domain_scores_gemma":[0.9955487,0.0017808926,0.00056865654,0.0018144301,0.0002556989,0.000031598018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022770434,0.00010912782,0.00032253593,0.00027150637,0.00018763027,0.000049540122,0.0012843555,0.00009625366,0.00002461673],"category_scores_gemma":[0.0006767357,0.00009115285,0.0001224221,0.0007031977,0.0005801637,0.0004616206,0.00015490504,0.00015575533,0.000008884159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028806558,0.0006167789,0.0075480007,0.000044569686,0.000039690716,4.47301e-7,0.0007226594,0.8701764,0.07122428,0.037540138,0.0013667875,0.010432215],"study_design_scores_gemma":[0.00081533927,0.000015807473,0.0071838824,0.000040256644,0.000038877715,0.0000041566577,0.00005161508,0.92967236,0.0093585905,0.052546684,0.00015243191,0.00012002087],"about_ca_topic_score_codex":0.00032545236,"about_ca_topic_score_gemma":0.0000679932,"teacher_disagreement_score":0.38057595,"about_ca_system_score_codex":0.000046789537,"about_ca_system_score_gemma":0.00006951466,"threshold_uncertainty_score":0.37171054},"labels":[],"label_agreement":null},{"id":"W2112428909","doi":"10.1109/lcomm.2003.817289","title":"A heuristic algorithm for the point of presence design problem in IP networks","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristic; Node (physics); Computer network; Algorithm; Set (abstract data type); The Internet; Protocol (science); Point (geometry); Internet topology; Distributed computing; Network topology; Mathematics; Artificial intelligence","score_opus":0.031571328017999147,"score_gpt":0.2538452842160285,"score_spread":0.22227395619802934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112428909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000472143,0.0011224418,0.98606,0.0116770575,0.00018506915,0.0007641193,0.0000012989425,0.000045685734,0.00009708458],"genre_scores_gemma":[0.52996105,0.00017558681,0.46807116,0.0012450125,0.000020846339,0.00048839103,0.0000010738531,0.000007794967,0.000029063338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987519,0.00042598962,0.00030476417,0.00017929691,0.000112161724,0.00022589049],"domain_scores_gemma":[0.9951761,0.0028643187,0.0001291936,0.0017160997,0.00007977778,0.000034517914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008934368,0.00009970656,0.00013721369,0.000059793554,0.00018301644,0.000056526504,0.0021133355,0.00003580692,0.0000015517503],"category_scores_gemma":[0.000071458206,0.00008093751,0.000059758022,0.00042140897,0.00015988263,0.00014827895,0.00008735993,0.00019426855,0.0000025287495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000772969,0.00016230425,0.00006767701,0.000007852131,0.000049270486,0.0000015347409,0.0006548497,0.33169806,0.00017522991,0.052898213,0.012315597,0.6019617],"study_design_scores_gemma":[0.00037450698,0.000025424968,0.0000821066,0.00003467559,0.000010995895,0.0000054114635,0.000020710413,0.9948823,0.000043020314,0.0010605516,0.0033673039,0.00009300272],"about_ca_topic_score_codex":0.000018577524,"about_ca_topic_score_gemma":0.000015368625,"teacher_disagreement_score":0.6631842,"about_ca_system_score_codex":0.000029304523,"about_ca_system_score_gemma":0.0000576472,"threshold_uncertainty_score":0.39271384},"labels":[],"label_agreement":null},{"id":"W2112488846","doi":"10.1109/lcomm.2003.821332","title":"Exact bit error rate analysis of TH-PPM UWB systems in the presence of multiple-access interference","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Bit error rate; Interference (communication); Pulse-position modulation; Computer science; Time-hopping; Binary number; Algorithm; Ultra-wideband; Probability of error; Modulation (music); Bit (key); Electronic engineering; Telecommunications; Decoding methods; Pulse (music); Mathematics; Pulse-amplitude modulation; Computer network; Physics; Channel (broadcasting); Detector; Arithmetic; Engineering","score_opus":0.046964423970874004,"score_gpt":0.2906716196120993,"score_spread":0.2437071956412253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112488846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97548336,0.0017215275,0.018969009,0.0016757289,0.000105045314,0.00044754974,0.000035626068,0.00012372695,0.0014384218],"genre_scores_gemma":[0.99772775,0.0006411429,0.0012816549,0.00009096894,0.000002063312,0.00021457174,0.000020547428,0.000015576014,0.0000057139905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983242,0.00063034974,0.0006049723,0.00013472128,0.00011815531,0.0001875738],"domain_scores_gemma":[0.99356323,0.001611217,0.00017909221,0.0045450865,0.0000810421,0.000020341831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060748484,0.00014517129,0.0003457398,0.0006525697,0.00007844865,0.000034328936,0.004179317,0.00007918714,0.000008058932],"category_scores_gemma":[0.00024349005,0.00012704806,0.000104019695,0.002358569,0.00034903735,0.00018830113,0.00014056114,0.0003884423,0.0000037038926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015749796,0.00046972095,0.09813244,0.00018970679,0.0013954203,0.0000018302505,0.005877479,0.5241162,0.35917494,0.0077691143,0.0016039729,0.0012533977],"study_design_scores_gemma":[0.0015090689,0.00009447768,0.14010893,0.0006544495,0.0013332114,0.000020866019,0.00614177,0.77920806,0.05820082,0.00031710914,0.01118926,0.0012219911],"about_ca_topic_score_codex":0.0006791701,"about_ca_topic_score_gemma":0.0012079454,"teacher_disagreement_score":0.3009741,"about_ca_system_score_codex":0.00005405715,"about_ca_system_score_gemma":0.000018032135,"threshold_uncertainty_score":0.776628},"labels":[],"label_agreement":null},{"id":"W2113217811","doi":"10.1109/lcomm.2005.1576587","title":"Construction of low-density parity-check convolutional codes through progressive edge-growth","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Computer science; Serial concatenated convolutional codes; Algorithm; Turbo code; Convolutional code; Enhanced Data Rates for GSM Evolution; Parity-check matrix; Parity bit; Decoding methods; Theoretical computer science; Concatenated error correction code; Block code; Telecommunications","score_opus":0.027529556562433923,"score_gpt":0.28936615693695206,"score_spread":0.2618366003745181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113217811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22556041,0.0004548269,0.73367333,0.036832456,0.00044356813,0.0004706686,0.000013264014,0.00090253074,0.0016489337],"genre_scores_gemma":[0.5911902,0.000053023017,0.40767136,0.0009790383,0.000044469478,0.000038616432,0.000008357509,0.000007680294,0.000007245671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846625,0.0002797762,0.00042226797,0.00030497863,0.00028800886,0.00023871908],"domain_scores_gemma":[0.99664897,0.00034209646,0.0003687709,0.002188897,0.0004014964,0.000049792896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034065198,0.00016690705,0.00022967017,0.00012272177,0.00034588503,0.000064732,0.002339112,0.0000888683,0.0000059650506],"category_scores_gemma":[0.00011939359,0.0001836773,0.00010327735,0.0004617116,0.00082068704,0.0007490857,0.00051074027,0.00038785778,0.000028537195],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049561277,0.0015586728,0.038353615,0.00019742425,0.0003335058,0.000011294733,0.009836971,0.0003781761,0.20741932,0.6533933,0.056572076,0.03189609],"study_design_scores_gemma":[0.0017724244,0.00023104649,0.022476302,0.0008450244,0.00012648279,0.0005996934,0.00045604337,0.06755404,0.8576879,0.034041807,0.01230601,0.0019032152],"about_ca_topic_score_codex":0.00011577746,"about_ca_topic_score_gemma":0.000057892394,"teacher_disagreement_score":0.6502686,"about_ca_system_score_codex":0.00016090545,"about_ca_system_score_gemma":0.00010239395,"threshold_uncertainty_score":0.7490143},"labels":[],"label_agreement":null},{"id":"W2113395889","doi":"10.1109/lcomm.2010.08.100691","title":"Error Probability Analysis of Bidirectional Relay Systems Using Alamouti Scheme","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Phase-shift keying; Space–time block code; Computer science; Relay channel; Node (physics); Block code; Linear network coding; Topology (electrical circuits); Algorithm; Diversity gain; Bit error rate; Telecommunications; Computer network; Mathematics; Fading; Decoding methods; Power (physics); Engineering; Physics; Combinatorics","score_opus":0.10009192749369676,"score_gpt":0.32879543597080146,"score_spread":0.2287035084771047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113395889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7545127,0.0004280899,0.2372012,0.0057085035,0.00066514214,0.00035356978,0.000013472955,0.00020167202,0.0009156371],"genre_scores_gemma":[0.87577796,0.0000798228,0.12373458,0.0002826513,0.000025125804,0.0000399224,0.000020271676,0.00000786905,0.00003182049],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983072,0.00046743633,0.00052004954,0.00028029634,0.00023916722,0.00018584859],"domain_scores_gemma":[0.99418604,0.00044393644,0.00028021692,0.0047051487,0.00031085405,0.00007380054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009195874,0.00013836838,0.0002837219,0.00042109558,0.00045768853,0.00011212558,0.0030730283,0.00007675161,0.000021999242],"category_scores_gemma":[0.00010784638,0.00014163717,0.00015683867,0.0023667405,0.00032020124,0.00036516416,0.0005889065,0.0005194031,0.0000087976005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070099086,0.0004924657,0.029548408,0.000024712874,0.0010877363,7.54104e-7,0.0017025032,0.0359884,0.807318,0.119057596,0.0015117003,0.0032607247],"study_design_scores_gemma":[0.0001438237,0.000007890631,0.010544099,0.000020399639,0.00011948309,0.0000055990163,0.00002092498,0.9801754,0.000847804,0.00003463381,0.007872646,0.00020734462],"about_ca_topic_score_codex":0.00010724554,"about_ca_topic_score_gemma":0.0003350818,"teacher_disagreement_score":0.9441869,"about_ca_system_score_codex":0.000077891214,"about_ca_system_score_gemma":0.000088940964,"threshold_uncertainty_score":0.5775796},"labels":[],"label_agreement":null},{"id":"W2114000865","doi":"10.1109/lcomm.2006.060849","title":"A Noise Reduction Amplify-and-Forward Relay Protocol for Distributed Spatial Diversity","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Transmission (telecommunications); Computer science; Noise (video); Antenna diversity; Wireless; Protocol (science); Computer network; Signal-to-noise ratio (imaging); Relay channel; Telecommunications; Electronic engineering; Physics; Engineering","score_opus":0.055038625517106705,"score_gpt":0.30707717325257716,"score_spread":0.25203854773547046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114000865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022191943,0.000028127755,0.94500345,0.026866129,0.000112778165,0.025178576,0.000021497362,0.00025470465,0.0003155357],"genre_scores_gemma":[0.7988502,0.00006236597,0.09987161,0.0013770113,0.00018373472,0.09931347,0.00017925714,0.00002342207,0.00013892936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988123,0.00024384155,0.00029584317,0.00028290617,0.00014570226,0.0002193686],"domain_scores_gemma":[0.9972606,0.00021237112,0.00016678436,0.0021380025,0.00015951664,0.00006274633],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00035073006,0.00014940568,0.00015012744,0.00010240177,0.0015496239,0.00017376168,0.0019991226,0.00005990249,0.000004460492],"category_scores_gemma":[0.00003278298,0.00015590081,0.00007195856,0.00034587327,0.00019467607,0.00040758718,0.0014149396,0.00023778199,0.000010586183],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003020053,0.00199241,0.009333636,0.00018600111,0.0002589633,0.0000044647536,0.0047174315,0.007575302,0.12838769,0.25776875,0.40798774,0.1814856],"study_design_scores_gemma":[0.005543868,0.00019238295,0.023990909,0.00017838713,0.000066932706,0.000049311402,0.00007394384,0.25054845,0.004604751,0.0030145661,0.71044886,0.0012876343],"about_ca_topic_score_codex":0.00016564953,"about_ca_topic_score_gemma":0.00014638566,"teacher_disagreement_score":0.8451318,"about_ca_system_score_codex":0.000116409705,"about_ca_system_score_gemma":0.000032377855,"threshold_uncertainty_score":0.9997502},"labels":[],"label_agreement":null},{"id":"W2114327466","doi":"10.1109/lcomm.2005.05017","title":"Novel Nakagami-m parameter estimator for noisy channel samples","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Nakagami distribution; Fading; Moment (physics); Channel (broadcasting); Estimation theory; Applied mathematics; Algorithm; Computer science; Statistics; Mathematics; Minimax estimator; Consistent estimator; Minimum-variance unbiased estimator; Mathematical optimization; Telecommunications; Physics","score_opus":0.054738616849675625,"score_gpt":0.29640299537463655,"score_spread":0.24166437852496092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114327466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007723766,0.00065711245,0.97870135,0.010192256,0.00011055599,0.0005782896,0.000096946096,0.0014790776,0.000460649],"genre_scores_gemma":[0.49723288,0.00026733108,0.5004769,0.0010965134,0.00005271399,0.00071813463,0.00007516475,0.000061735765,0.000018628512],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899757,0.000033399225,0.00038766235,0.00017282853,0.00010828206,0.0003002555],"domain_scores_gemma":[0.9960423,0.0007171245,0.00008013004,0.003008806,0.00007693709,0.00007472047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015419805,0.00021860105,0.00021840786,0.0001641723,0.00027767027,0.00005187275,0.0017452405,0.00008597547,0.0000075191033],"category_scores_gemma":[0.00007786232,0.00025341343,0.000110870846,0.00020066724,0.0001852252,0.00034434066,0.00014198595,0.00028572688,0.00004041237],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018548708,0.0003572558,0.00007019826,0.00013295752,0.0002190219,2.970892e-7,0.0011417666,0.1455684,0.7161506,0.008767705,0.050283477,0.07728982],"study_design_scores_gemma":[0.00088369654,0.000028722185,0.00033425516,0.00012549835,0.000053397016,0.000017719176,0.00009513022,0.5872002,0.10166785,0.0009813238,0.30767125,0.0009409203],"about_ca_topic_score_codex":0.000011579484,"about_ca_topic_score_gemma":0.000045366574,"teacher_disagreement_score":0.6144827,"about_ca_system_score_codex":0.00016403115,"about_ca_system_score_gemma":0.000011596816,"threshold_uncertainty_score":0.99999183},"labels":[],"label_agreement":null},{"id":"W2114630153","doi":"10.1109/lcomm.2009.12.091590","title":"Power allocation for coded OFDM via linear programming","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Quadrature amplitude modulation; Phase-shift keying; Modulation (music); Transmission (telecommunications); Convex optimization; Algorithm; Bit error rate; Electronic engineering; Mathematical optimization; Telecommunications; Mathematics; Decoding methods; Regular polygon; Channel (broadcasting)","score_opus":0.024506183608850277,"score_gpt":0.2818062619390977,"score_spread":0.25730007833024743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114630153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10561527,0.00067842385,0.8493384,0.03716704,0.0011355899,0.0014646448,0.000018471024,0.001832917,0.0027492382],"genre_scores_gemma":[0.89660573,0.000048799546,0.10191477,0.0009961063,0.00009108907,0.00019705556,0.00006286587,0.000031196636,0.0000523847],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992815,0.000031618252,0.0002569492,0.00012078321,0.00009681869,0.00021231367],"domain_scores_gemma":[0.99853593,0.000081335274,0.000046860117,0.0012120749,0.00007028304,0.00005349729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014105029,0.00012675901,0.000116443414,0.00011111312,0.00017649739,0.00003553004,0.0005960496,0.000060012342,0.000008244143],"category_scores_gemma":[0.000025493999,0.00015005052,0.00007217684,0.00021890031,0.00007065914,0.0001718791,0.000017208973,0.00017748245,0.000044210075],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016765625,0.00021003827,0.00006298037,0.000044119748,0.00013127657,6.541361e-7,0.0015694813,0.042388737,0.8399066,0.0014067595,0.049270313,0.06499227],"study_design_scores_gemma":[0.0012128527,0.000115301256,0.0011641192,0.00008788223,0.00007530523,0.000031249336,0.00018250641,0.21707949,0.04531929,0.0005374409,0.73331594,0.00087862276],"about_ca_topic_score_codex":0.0000036328252,"about_ca_topic_score_gemma":0.0000029207777,"teacher_disagreement_score":0.7945873,"about_ca_system_score_codex":0.000107572785,"about_ca_system_score_gemma":0.000009076011,"threshold_uncertainty_score":0.61188823},"labels":[],"label_agreement":null},{"id":"W2114703162","doi":"10.1109/lcomm.2006.1613746","title":"Optimal downlink resource allocation for non-realtime traffic in cellular CDMA/TDMA networks","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Time division multiple access; Computer science; Cellular network; Computer network; Telecommunications link; Base station; Code division multiple access; Scheduling (production processes); Resource allocation; Network packet; Mathematical optimization","score_opus":0.009276069348611304,"score_gpt":0.2182251940281604,"score_spread":0.2089491246795491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114703162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101429395,0.0006657012,0.89433086,0.0019710811,0.00016477877,0.0007295825,0.000010051307,0.00037407508,0.00032448722],"genre_scores_gemma":[0.9011648,0.00018258125,0.09691254,0.00025595378,0.00018433963,0.00036741683,0.0008104402,0.00008387631,0.00003802025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987626,0.000067584624,0.00047799564,0.00022073695,0.000087862594,0.00038321977],"domain_scores_gemma":[0.99830174,0.0002827505,0.00009084687,0.001232344,0.000045245026,0.000047073438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021128412,0.0002158034,0.00021714137,0.00019060214,0.00017845299,0.00004581817,0.00068490714,0.00013699682,0.0000036091428],"category_scores_gemma":[0.0000089229,0.00027239945,0.00007668819,0.0005048481,0.000096997755,0.00021149931,0.00004274768,0.00032649166,0.000011473335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009159238,0.000044202978,0.00004657864,0.000015927702,0.000011676459,6.7595664e-7,0.00009957986,0.9845657,0.004841447,0.00009918624,0.0072419997,0.0030238654],"study_design_scores_gemma":[0.00054081343,0.000010651117,0.00022522942,0.000051077637,0.00001672386,0.0000014122286,0.000023058003,0.9916396,0.0006042116,0.000013504544,0.0066043744,0.00026934908],"about_ca_topic_score_codex":0.000029076014,"about_ca_topic_score_gemma":0.00015778537,"teacher_disagreement_score":0.7997354,"about_ca_system_score_codex":0.00023049627,"about_ca_system_score_gemma":0.000011964195,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W2114732083","doi":"10.1109/lcomm.2005.10012","title":"A simple and fast carrier recovery algorithm for high-order QAM","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Algorithm; Simple (philosophy); QAM; Quadrature amplitude modulation; Telecommunications; Decoding methods; Bit error rate","score_opus":0.021339691162014975,"score_gpt":0.2845591375098508,"score_spread":0.26321944634783584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114732083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004940408,0.00013236063,0.94255626,0.051454525,0.0000631277,0.00031649767,0.000028108094,0.00027620053,0.0002325408],"genre_scores_gemma":[0.16173463,0.00010758585,0.8239539,0.013772479,0.000060190683,0.00021150701,0.000030074585,0.000014704483,0.0001149286],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991543,0.00011407654,0.00021879395,0.00022774436,0.000107326276,0.00017773094],"domain_scores_gemma":[0.9977504,0.0002558588,0.00009020008,0.0017408503,0.00010489131,0.0000577897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002891596,0.00011298381,0.00012292709,0.0001256045,0.00028681313,0.00019115733,0.0012722437,0.00005487025,0.0000035179994],"category_scores_gemma":[0.000023567876,0.00012114494,0.000041395568,0.00024932256,0.000107047425,0.0006303265,0.00026284857,0.00015380856,0.000010022025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027634926,0.00012293688,0.000045755056,0.000007300338,0.000053391068,4.7097242e-7,0.0021635292,0.00039531675,0.009825971,0.028608836,0.0648165,0.89395726],"study_design_scores_gemma":[0.0009341402,0.00012316903,0.0007511829,0.00002557736,0.000026718038,0.000019525896,0.0000827695,0.29230207,0.01590836,0.005978629,0.6831913,0.00065657956],"about_ca_topic_score_codex":0.000056381232,"about_ca_topic_score_gemma":0.00007456025,"teacher_disagreement_score":0.89330065,"about_ca_system_score_codex":0.00004960264,"about_ca_system_score_gemma":0.000038472666,"threshold_uncertainty_score":0.4940147},"labels":[],"label_agreement":null},{"id":"W2114884310","doi":"10.1109/lcomm.2007.070062","title":"Capacity Analysis for Transmit Antenna Selection Using Orthogonal Space-Time Block Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Block code; Antenna (radio); Transmitter; Computer science; Rayleigh fading; Transmission (telecommunications); Selection (genetic algorithm); Topology (electrical circuits); Channel capacity; Algorithm; Mathematics; Fading; Telecommunications; Channel (broadcasting); Decoding methods; Combinatorics","score_opus":0.038464268895967164,"score_gpt":0.28420994195111876,"score_spread":0.2457456730551516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114884310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28806257,0.00016025317,0.70989984,0.0007130519,0.000031932486,0.00028935628,0.00003743528,0.00067858753,0.00012697619],"genre_scores_gemma":[0.73560077,0.00014133855,0.26389742,0.0001664863,0.000027747743,0.000057947964,0.00005597519,0.000040994684,0.000011335721],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988063,0.000085218104,0.0004458742,0.00018405392,0.00014547828,0.0003330684],"domain_scores_gemma":[0.99764204,0.00044496745,0.000109118046,0.0015738939,0.00015218949,0.00007780253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049484643,0.00021035365,0.00030325755,0.00053165667,0.00039298387,0.00003965698,0.0009081008,0.00010759458,0.000009604252],"category_scores_gemma":[0.000024773495,0.00025503794,0.00022404683,0.0012156247,0.00019502877,0.00024900268,0.000044448174,0.00034315386,0.0000065559266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012800089,0.000060947423,0.0017992752,0.00002513372,0.00050304533,2.461376e-7,0.0002863869,0.11644044,0.87891173,0.0004346033,0.00027659378,0.0012488118],"study_design_scores_gemma":[0.00029447422,0.000018177032,0.0028772438,0.00003909286,0.00042160644,0.000011495394,0.00004358624,0.9045965,0.086177684,0.00019745826,0.0048212768,0.00050142093],"about_ca_topic_score_codex":0.000047679612,"about_ca_topic_score_gemma":0.00032707895,"teacher_disagreement_score":0.792734,"about_ca_system_score_codex":0.00026457486,"about_ca_system_score_gemma":0.00001340311,"threshold_uncertainty_score":0.99999017},"labels":[],"label_agreement":null},{"id":"W2115113441","doi":"10.1109/lcomm.2008.080394","title":"Modified Transition Matrix Simulations of Communication Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fading; Computer science; Stochastic matrix; Matrix (chemical analysis); Probability distribution; Communications system; Statistical physics; Transition (genetics); Algorithm; Bit error rate; Mathematics; Decoding methods; Telecommunications; Statistics; Physics; Markov chain; Materials science","score_opus":0.05535200371156912,"score_gpt":0.30480203582616416,"score_spread":0.24945003211459504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115113441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066633224,0.0003627461,0.9209393,0.010151276,0.00006041182,0.0003658739,0.000017390234,0.00038822286,0.0010815416],"genre_scores_gemma":[0.8915532,0.00024619058,0.10743309,0.0005990893,0.000009337418,0.000058808917,0.00006116802,0.000011616375,0.000027464914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841315,0.00056567177,0.00049452187,0.00017566215,0.00021483318,0.00013619519],"domain_scores_gemma":[0.99542034,0.0003752495,0.0002592006,0.003686395,0.00021195991,0.000046885332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035363444,0.0001205846,0.00018375285,0.00028044297,0.00041458398,0.0000600243,0.0024192003,0.00007293589,0.0000021539277],"category_scores_gemma":[0.000023978366,0.0001363129,0.000080889695,0.0006140747,0.00025004894,0.0007369593,0.00015887679,0.00022615967,0.000011920957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007376477,0.00042313104,0.00017458573,0.00002278134,0.00006716556,9.3004917e-7,0.013009166,0.36572713,0.066999614,0.54832506,0.004556393,0.0006866517],"study_design_scores_gemma":[0.00043734483,0.000032064654,0.00043524627,0.000060007074,0.000016340873,0.00002464165,0.000058584646,0.98942626,0.003976324,0.0018984216,0.0033582957,0.0002764926],"about_ca_topic_score_codex":0.00020633427,"about_ca_topic_score_gemma":0.000012750271,"teacher_disagreement_score":0.82492,"about_ca_system_score_codex":0.000057727775,"about_ca_system_score_gemma":0.0000581429,"threshold_uncertainty_score":0.55586785},"labels":[],"label_agreement":null},{"id":"W2115286596","doi":"10.1109/lcomm.2008.080209","title":"IEEE 802.11a Throughput Performance with Hidden Nodes","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Throughput; Distributed coordination function; Hidden node problem; Node (physics); Wireless network; Wireless; Wireless lan; IEEE 802.11; Distributed computing; Telecommunications; Wi-Fi array; Engineering","score_opus":0.049971643190645426,"score_gpt":0.26239671111487695,"score_spread":0.21242506792423152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115286596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47784707,0.0003471108,0.47349307,0.037251145,0.0004102435,0.003385,0.000005399685,0.00071416807,0.0065467833],"genre_scores_gemma":[0.8884238,0.00032766475,0.10550954,0.004117265,0.000110970446,0.0013405019,0.0000049368564,0.000019975796,0.00014533682],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871486,0.00014022015,0.0002494075,0.00029436083,0.0002649915,0.00033613588],"domain_scores_gemma":[0.9960149,0.00017267239,0.00013348424,0.00351753,0.000081324906,0.00008011318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017704927,0.0001842425,0.00018815414,0.000080158716,0.0008036213,0.000113200964,0.0036413195,0.000054440014,0.0000063427724],"category_scores_gemma":[0.000003453927,0.00015766291,0.000057077636,0.00052080624,0.00036391712,0.00077368005,0.00026405422,0.00034319423,0.00012927776],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020828327,0.0018759093,0.12012346,0.00030192005,0.000697733,0.00022250976,0.025625093,0.045763902,0.033552602,0.030400053,0.46896946,0.2722591],"study_design_scores_gemma":[0.0046789744,0.0007946841,0.09145423,0.0009896259,0.00007646378,0.0012372911,0.00010857799,0.46536714,0.022125639,0.0005664623,0.4089537,0.0036472038],"about_ca_topic_score_codex":0.0000577232,"about_ca_topic_score_gemma":0.000020941594,"teacher_disagreement_score":0.41960326,"about_ca_system_score_codex":0.000054530294,"about_ca_system_score_gemma":0.000076542055,"threshold_uncertainty_score":0.6766538},"labels":[],"label_agreement":null},{"id":"W2115835796","doi":"10.1109/4234.917103","title":"Optical CDMA using 2-D codes: the optimal single-user detector","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Detector; Code division multiple access; Computer science; Bit error rate; Code (set theory); Upper and lower bounds; Dimension (graph theory); Code rate; Algorithm; Channel (broadcasting); Electronic engineering; Mathematics; Telecommunications; Decoding methods","score_opus":0.038797689614729756,"score_gpt":0.24606031573158815,"score_spread":0.2072626261168584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115835796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9572506,0.00045084418,0.037660066,0.0017037468,0.00038719372,0.00019647533,0.000005580766,0.00030480232,0.0020406877],"genre_scores_gemma":[0.99445313,0.00005185811,0.004746281,0.00053753005,0.00009760439,0.00004013271,0.000005043055,0.00003807708,0.000030352468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.00014670065,0.00024930065,0.00011111887,0.00011910026,0.00026336656],"domain_scores_gemma":[0.99794084,0.00026946285,0.0000334052,0.0016694387,0.000027258002,0.000059602233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023894469,0.00014973886,0.00013901539,0.000073662864,0.0003296683,0.000087860564,0.0010507919,0.0000626723,0.000022907036],"category_scores_gemma":[0.000017330487,0.00012602961,0.00009208981,0.00029963045,0.0002534659,0.00013590392,0.00006989874,0.00030123655,0.00007500363],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016740405,0.00009536755,0.00058154087,0.000024949357,0.00018901407,0.000010866177,0.001254238,0.11887381,0.8695231,0.0034802367,0.0033149375,0.0026351854],"study_design_scores_gemma":[0.0018783712,0.000117452524,0.0027327305,0.00044324587,0.0004224341,0.00092598854,0.0027710842,0.48471877,0.06826665,0.00041612118,0.43501085,0.0022962824],"about_ca_topic_score_codex":0.000014383269,"about_ca_topic_score_gemma":0.000025463298,"teacher_disagreement_score":0.8012565,"about_ca_system_score_codex":0.000075964956,"about_ca_system_score_gemma":0.0000066420016,"threshold_uncertainty_score":0.51393384},"labels":[],"label_agreement":null},{"id":"W2116551454","doi":"10.1109/lcomm.2006.061048","title":"A closed-form expression for the outage probability of decode-and-forward relaying in dissimilar Rayleigh fading channels","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":332,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Rayleigh fading; Computer science; Relay; Outage probability; Expression (computer science); Transmission (telecommunications); Computer network; Wireless; Fading distribution; Closed-form expression; Telecommunications; Channel (broadcasting); Topology (electrical circuits); Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.054201976055747676,"score_gpt":0.2942957767705044,"score_spread":0.24009380071475672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116551454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2417888,0.001869109,0.7210186,0.03337959,0.00019928522,0.0012353647,0.000007753214,0.00010775075,0.0003937205],"genre_scores_gemma":[0.9495674,0.0005775906,0.048906993,0.0005822397,0.000025935273,0.00029623174,0.000008471128,0.000011013044,0.000024165993],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860483,0.0002655693,0.00049691787,0.00025443686,0.00014216384,0.00023606484],"domain_scores_gemma":[0.99571395,0.0013864863,0.00020695051,0.0025625871,0.0000944174,0.000035596197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010094143,0.0001463465,0.00020769877,0.0001293302,0.00060809264,0.00010661023,0.0024766827,0.00005198826,0.0000019250233],"category_scores_gemma":[0.00009980911,0.00011605669,0.00008893323,0.00044977985,0.00022165422,0.00039349025,0.00075045205,0.000269258,0.000001130836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013332264,0.001384707,0.042440698,0.0003439142,0.00015418619,0.000003271,0.036668766,0.048003968,0.37868407,0.27594528,0.012401002,0.20383681],"study_design_scores_gemma":[0.0025350964,0.00009472709,0.03441607,0.00073931995,0.000050220562,0.000009621011,0.00037107436,0.8857872,0.029113151,0.015159125,0.030781148,0.00094328175],"about_ca_topic_score_codex":0.000038542756,"about_ca_topic_score_gemma":0.00017066975,"teacher_disagreement_score":0.8377832,"about_ca_system_score_codex":0.000082328384,"about_ca_system_score_gemma":0.000029684586,"threshold_uncertainty_score":0.47326544},"labels":[],"label_agreement":null},{"id":"W2116690606","doi":"10.1109/lcomm.2004.835306","title":"Error Rate Performance of Coded Free-Space Optical Links Over Strong Turbulence Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":169,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Fading; Bit error rate; Turbulence; Free-space optical communication; Pairwise error probability; Coding gain; Word error rate; Code rate; Computer science; Algorithm; Probability of error; Coding (social sciences); Mathematics; Optical communication; Telecommunications; Physics; Decoding methods; Statistics; Optics; Mathematical analysis; Speech recognition; Meteorology","score_opus":0.02645264710275825,"score_gpt":0.2539638878593999,"score_spread":0.22751124075664164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116690606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9677986,0.0007626559,0.013616689,0.015333197,0.00019221219,0.000276155,0.000022969762,0.00084201706,0.0011555356],"genre_scores_gemma":[0.96081644,0.001404109,0.037369043,0.00022944217,0.000017383245,0.00009057342,0.000018674922,0.000040965286,0.000013376571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885005,0.0000584399,0.00042687598,0.00016562373,0.00017862894,0.0003203648],"domain_scores_gemma":[0.9951868,0.00029431123,0.000089596564,0.004287708,0.00007315858,0.00006842628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021816304,0.0002111195,0.0002662374,0.00016354758,0.00015638504,0.000038854,0.0030869297,0.00023392183,0.000011765842],"category_scores_gemma":[0.000113096175,0.00022744307,0.00007173938,0.0004086862,0.00068278064,0.00029528185,0.00048606165,0.0010671644,0.000051701238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026269461,0.00027251843,0.0004026634,0.00018080628,0.00017684432,0.0000023263337,0.0008916349,0.6868552,0.26500452,0.040020205,0.0019247599,0.0042422805],"study_design_scores_gemma":[0.0024284415,0.00017767792,0.004635711,0.0006323387,0.000078609184,0.000013191912,0.00040062272,0.4699624,0.5144464,0.0011108068,0.0048824255,0.0012314306],"about_ca_topic_score_codex":0.000022612452,"about_ca_topic_score_gemma":0.00001674018,"teacher_disagreement_score":0.24944185,"about_ca_system_score_codex":0.00015393413,"about_ca_system_score_gemma":0.000024549707,"threshold_uncertainty_score":0.92748594},"labels":[],"label_agreement":null},{"id":"W2116922668","doi":"10.1109/4234.913146","title":"On error probabilities of DS-CDMA systems with arbitrary chip waveforms","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Waveform; Gaussian; Asynchronous communication; Computer science; Algorithm; Chip; Signature (topology); Code division multiple access; Approximation theory; Mathematics; Telecommunications; Physics","score_opus":0.05047919857789464,"score_gpt":0.28548388369211514,"score_spread":0.2350046851142205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116922668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72889096,0.0012089211,0.17693381,0.06794443,0.00034810026,0.001996092,0.00001599793,0.0006693501,0.02199233],"genre_scores_gemma":[0.976372,0.0002495318,0.021954287,0.00087662524,0.000029787656,0.00028307652,0.000016592126,0.000025077847,0.0001929952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775714,0.00051386986,0.00048195675,0.0003091164,0.00055192027,0.0003860252],"domain_scores_gemma":[0.99079555,0.00085614546,0.0002412251,0.007789967,0.00020752662,0.00010961088],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005886321,0.00020306505,0.0002787497,0.00029054855,0.00036397504,0.00016579253,0.0066846246,0.00006931496,0.0000061338405],"category_scores_gemma":[0.000040757473,0.00016163159,0.00007771261,0.0009978177,0.0006166913,0.00057218614,0.0006384888,0.00056825916,0.000044866687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025059588,0.0024241721,0.00810348,0.00035371506,0.00049347914,0.000031146494,0.008746055,0.092701696,0.009197689,0.83506966,0.01961833,0.023010008],"study_design_scores_gemma":[0.003213196,0.0011027189,0.014772594,0.0017445774,0.000048460082,0.0003246127,0.001135825,0.9264759,0.0029614267,0.006829778,0.039439704,0.001951227],"about_ca_topic_score_codex":0.00017552338,"about_ca_topic_score_gemma":0.000067751076,"teacher_disagreement_score":0.8337742,"about_ca_system_score_codex":0.00013406582,"about_ca_system_score_gemma":0.00011711797,"threshold_uncertainty_score":0.9986897},"labels":[],"label_agreement":null},{"id":"W2116946664","doi":"10.1109/lcomm.2007.061291","title":"Traffic models for medical wireless sensor networks","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Wireless sensor network; Computer science; Computer network; Wireless; Key distribution in wireless sensor networks; Wireless network; Telecommunications","score_opus":0.02251400689620991,"score_gpt":0.25474157147236387,"score_spread":0.23222756457615396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116946664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15199666,0.0005932126,0.841848,0.0030040632,0.00057165674,0.00036213055,0.00000842784,0.00069300825,0.00092283584],"genre_scores_gemma":[0.98551863,0.00040273767,0.012103631,0.0013217117,0.0003710634,0.00010877529,0.00006866123,0.00008618722,0.000018584808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986136,0.000048456994,0.00042847786,0.00017346714,0.0002272975,0.0005087093],"domain_scores_gemma":[0.9973783,0.000848941,0.000045250978,0.0014890118,0.000051640633,0.00018687325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065409066,0.00019760316,0.00022083355,0.00011559674,0.0002197297,0.00003854225,0.0012180534,0.00021135797,0.000009989025],"category_scores_gemma":[0.000016099766,0.00022304502,0.00011458879,0.00027719067,0.0001981258,0.00015170214,0.00006910133,0.0005142003,0.000012890031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008604764,0.000032577806,0.000015563564,0.00001723801,0.000057444035,0.0000040253913,0.00019880946,0.95409966,0.0006845328,0.0006107314,0.01726647,0.027004367],"study_design_scores_gemma":[0.00036287308,0.00000665965,0.00005416115,0.000055169796,0.000020542002,0.0000131057495,0.000044326018,0.9936231,0.00013965699,0.00002550302,0.0054088435,0.0002460673],"about_ca_topic_score_codex":0.0000065911318,"about_ca_topic_score_gemma":0.00016908914,"teacher_disagreement_score":0.83352196,"about_ca_system_score_codex":0.000115803974,"about_ca_system_score_gemma":0.000016778682,"threshold_uncertainty_score":0.9095512},"labels":[],"label_agreement":null},{"id":"W2117747200","doi":"10.1109/lcomm.2008.071518","title":"A Statistical Pruning Strategy for Schnorr-Euchner Sphere Decoding","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Computer science; Soft-decision decoder; MIMO; Algorithm; Computational complexity theory; Code division multiple access; Metric (unit); Pruning; Set (abstract data type); Theoretical computer science; Computer network","score_opus":0.07061129790910933,"score_gpt":0.310117688175241,"score_spread":0.23950639026613166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117747200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03965513,0.00070149486,0.95412374,0.001093073,0.00008176023,0.0004844478,0.000048929687,0.0014926487,0.0023187557],"genre_scores_gemma":[0.6597927,0.0007251057,0.3387234,0.00023547094,0.000024112336,0.00034809325,0.00006675136,0.000054527725,0.000029798464],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897504,0.00006582972,0.0003756771,0.0001630111,0.00011800378,0.0003024192],"domain_scores_gemma":[0.9970797,0.00053704856,0.000066784436,0.0021620083,0.000077171026,0.00007733713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012949518,0.00019132068,0.00020755122,0.00011578398,0.00048867596,0.000035248602,0.0013102272,0.00008261512,0.000021617652],"category_scores_gemma":[0.00005605527,0.00022540151,0.000064215805,0.0002371474,0.00029371367,0.00028445537,0.0001167343,0.00039609443,0.000028309418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046710316,0.00037124575,0.002860418,0.0003429827,0.00038925707,0.000018856816,0.0024796387,0.22033559,0.3759998,0.07772383,0.15017152,0.16926013],"study_design_scores_gemma":[0.0020509858,0.00013517063,0.0026342769,0.00036182528,0.00011002457,0.00016469021,0.00069013215,0.7123713,0.06390869,0.0047469595,0.21040213,0.002423834],"about_ca_topic_score_codex":0.000014307248,"about_ca_topic_score_gemma":0.000034468332,"teacher_disagreement_score":0.62013763,"about_ca_system_score_codex":0.00014554904,"about_ca_system_score_gemma":0.000028069144,"threshold_uncertainty_score":0.9191607},"labels":[],"label_agreement":null},{"id":"W2117822800","doi":"10.1109/lcomm.2007.070336","title":"FIR Beamforming for Frequency-Selective Channels with Linear Equalization","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Beamforming; Finite impulse response; Computer science; Infinite impulse response; Equalization (audio); Linear filter; Intersymbol interference; Algorithm; Telecommunications; Control theory (sociology); Digital filter; Channel (broadcasting); Filter (signal processing); Bandwidth (computing)","score_opus":0.028625179253277594,"score_gpt":0.29485448305777245,"score_spread":0.26622930380449483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117822800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013857916,0.00025241091,0.9822484,0.0008822072,0.00008935588,0.0006305387,0.000013467764,0.0010272968,0.0009983957],"genre_scores_gemma":[0.63477355,0.00018949399,0.36419323,0.0003706541,0.00004631171,0.00028097475,0.00007549897,0.000058922822,0.00001139391],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990586,0.000035860296,0.0003405553,0.0001451662,0.00012084701,0.00029897096],"domain_scores_gemma":[0.9975636,0.00044704834,0.00010004737,0.0016700528,0.00016100437,0.00005825387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033483093,0.0001796162,0.00016661052,0.00021575644,0.0003095837,0.000025763815,0.000962189,0.000079486876,0.0000024229453],"category_scores_gemma":[0.000040092742,0.00019136858,0.000050230134,0.00046128465,0.00014176668,0.00035710828,0.00005564769,0.00026809462,0.0000069997686],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058339134,0.00017758133,0.00045390322,0.00017181304,0.00026769284,0.0000018470622,0.0035537316,0.17880626,0.7705283,0.017691875,0.004268637,0.024019983],"study_design_scores_gemma":[0.0013842852,0.00020795851,0.000346821,0.0003653641,0.00008985344,0.000022166429,0.0005226801,0.18495932,0.7595005,0.00317348,0.04791258,0.0015150033],"about_ca_topic_score_codex":0.000017436283,"about_ca_topic_score_gemma":0.00008210329,"teacher_disagreement_score":0.6209156,"about_ca_system_score_codex":0.00022143504,"about_ca_system_score_gemma":0.00001587902,"threshold_uncertainty_score":0.78037846},"labels":[],"label_agreement":null},{"id":"W2118387281","doi":"10.1109/4234.957373","title":"Average level crossing rate and average fade duration of selection diversity","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fade; Fading; Level crossing; Rayleigh fading; Envelope (radar); Diversity combining; Nakagami distribution; Selection (genetic algorithm); Telecommunications; Mathematics; Statistics; Fading distribution; Diversity gain; Computer science; Diversity scheme; Diversity (politics); Algorithm; Channel (broadcasting); Engineering; Radar; Artificial intelligence","score_opus":0.043122792558576664,"score_gpt":0.2687448413554378,"score_spread":0.22562204879686115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118387281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5124221,0.00020246136,0.48543617,0.0007694284,0.0000445264,0.00016338057,0.00001110506,0.00038435936,0.0005664967],"genre_scores_gemma":[0.9736271,0.0016903668,0.024370762,0.0001941882,0.000013458282,0.000022817467,0.000026215324,0.000022586195,0.000032509557],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923587,0.00012289539,0.00029043786,0.00011484955,0.000093678,0.00014225728],"domain_scores_gemma":[0.99863535,0.00015828692,0.00010653831,0.0009914712,0.000070427835,0.000037953865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002028244,0.00012838248,0.00014686164,0.0001522798,0.00066647114,0.000054324348,0.0005637299,0.00006395904,0.000009799302],"category_scores_gemma":[0.000026336047,0.00015882216,0.000037634138,0.00030198455,0.00024555644,0.00045920815,0.00027123833,0.00026913075,0.00000452265],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001494846,0.000059123893,0.006768729,0.00005012072,0.000059358015,0.0000012057872,0.0021277845,0.05652224,0.91795707,0.0008633602,0.00081606937,0.014759981],"study_design_scores_gemma":[0.001474488,0.00006175938,0.10874106,0.00028222718,0.00007004503,0.000072989955,0.00022548957,0.4213897,0.4475153,0.0015252427,0.017423589,0.0012180941],"about_ca_topic_score_codex":0.00008463193,"about_ca_topic_score_gemma":0.00008040359,"teacher_disagreement_score":0.47044176,"about_ca_system_score_codex":0.00011902727,"about_ca_system_score_gemma":0.0000093143535,"threshold_uncertainty_score":0.647658},"labels":[],"label_agreement":null},{"id":"W2119783159","doi":"10.1109/lcomm.2009.090121","title":"On the impact of mobility and soft vertical handoff on voice admission control in loosely coupled 3G/WLAN networks","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Handover; Quality of service; Call Admission Control; Call blocking; Network packet; Packet loss; Wireless network; Wireless; Telecommunications","score_opus":0.03125786359377396,"score_gpt":0.3194286225840486,"score_spread":0.2881707589902746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119783159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7638987,0.0005904424,0.16549742,0.068808086,0.000045681136,0.00083750463,0.0000030841175,0.00008851426,0.00023057243],"genre_scores_gemma":[0.9957479,0.00022004385,0.0007022852,0.0032409301,0.000016423473,0.00005406312,0.000004634767,0.000009272361,0.000004449141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741805,0.0011743958,0.00043223152,0.00029097614,0.0003316162,0.00035270772],"domain_scores_gemma":[0.99045694,0.004495884,0.000107956286,0.0046896855,0.000109265,0.00014028694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012544054,0.000183955,0.00027548216,0.00016105128,0.0003119601,0.00012608706,0.003441864,0.00009195475,0.000005880971],"category_scores_gemma":[0.00031105295,0.00013068522,0.00010567131,0.0006695591,0.00035297757,0.00019663412,0.0003089333,0.00087461347,0.000010732278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018113297,0.007513225,0.017353233,0.00004021969,0.00034402646,0.00001753191,0.0037242705,0.69615203,0.10732908,0.07723126,0.020656664,0.06782712],"study_design_scores_gemma":[0.0008534079,0.00022259177,0.07751948,0.000101432764,0.0000040866207,0.0000024398946,0.000007873776,0.9204084,0.000088265755,0.00062372844,0.000045745895,0.00012254006],"about_ca_topic_score_codex":0.00015714257,"about_ca_topic_score_gemma":0.000037704707,"teacher_disagreement_score":0.23184921,"about_ca_system_score_codex":0.00016369399,"about_ca_system_score_gemma":0.00008528298,"threshold_uncertainty_score":0.63958967},"labels":[],"label_agreement":null},{"id":"W2120681317","doi":"10.1109/lcomm.2003.812177","title":"Comparison of MOE and blind LMS","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Convergence (economics); Code division multiple access; Algorithm; Least mean squares filter; Adaptive filter; Steady state (chemistry); Computer science; Interference (communication); Mean squared error; Stability (learning theory); Sequence (biology); Mathematics; Telecommunications; Statistics; Channel (broadcasting)","score_opus":0.0692333979795927,"score_gpt":0.33584932802560985,"score_spread":0.26661593004601714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120681317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6608598,0.0015053577,0.33101904,0.00061392045,0.000116054485,0.00024586832,0.000011852812,0.00053344644,0.0050946414],"genre_scores_gemma":[0.8749435,0.0001374828,0.1248127,0.000056479137,0.000003927442,0.000020788872,0.0000029894495,0.000015471913,0.0000066391726],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996006,0.000035422727,0.00016661972,0.000061227416,0.000047936424,0.00008817484],"domain_scores_gemma":[0.99903846,0.000086790846,0.000032990883,0.0007993753,0.00001823364,0.000024126588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006457501,0.000074854855,0.00012183404,0.00006684948,0.000047018388,0.000007641059,0.00028221268,0.00002737067,0.0000040902078],"category_scores_gemma":[0.000017460437,0.000085604086,0.00001860485,0.00010164696,0.00013335093,0.000075549644,0.000035320692,0.00014206569,0.0000033761266],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004100827,0.0000693024,0.0048476118,0.0000531742,0.00005442376,4.63221e-7,0.00089687825,0.011916032,0.9647293,0.008552063,0.0046857544,0.0041909018],"study_design_scores_gemma":[0.00087740476,0.00007074224,0.004873565,0.00018260653,0.000049855626,0.000015547219,0.00029943846,0.03580203,0.81774443,0.0019355923,0.13741262,0.00073614984],"about_ca_topic_score_codex":0.0000031332493,"about_ca_topic_score_gemma":0.0000047857343,"teacher_disagreement_score":0.21408372,"about_ca_system_score_codex":0.000023702843,"about_ca_system_score_gemma":0.0000025096997,"threshold_uncertainty_score":0.34908333},"labels":[],"label_agreement":null},{"id":"W2120709141","doi":"10.1109/lcomm.2015.2411591","title":"Accurate One-Way Delay Estimation With Reduced Client Trustworthiness","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canada Research Chairs","keywords":"Computer science; Server; Synchronization (alternating current); Trustworthiness; Clock synchronization; Real-time computing; Probability distribution; Client–server model; Algorithm; Network Time Protocol; Time synchronization; Computer network; Distributed computing; Computer security","score_opus":0.07258303302495243,"score_gpt":0.2979948296452297,"score_spread":0.22541179662027727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120709141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15083335,0.00008097152,0.7453327,0.10149536,0.00026549582,0.00036496934,0.0000027217698,0.00094447244,0.0006799457],"genre_scores_gemma":[0.61444825,0.0000108312015,0.38321173,0.00211823,0.000019690695,0.00013339063,0.000012183107,0.000013017367,0.00003268642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983897,0.00016101585,0.00032451018,0.00037404773,0.00039944155,0.00035124685],"domain_scores_gemma":[0.99453753,0.00016554624,0.00018266476,0.004720233,0.00023529673,0.0001587536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050290633,0.00019899009,0.00020416506,0.00025729963,0.00026311478,0.00025441372,0.00490692,0.00007417582,9.715669e-7],"category_scores_gemma":[0.00011933111,0.00018415756,0.000038031652,0.0013323827,0.00019981171,0.0007292561,0.0008525312,0.00034408472,0.00014322043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009503631,0.00074538944,0.0014307406,0.000029278175,0.00027330386,0.000048571044,0.009013102,0.5142936,0.0144135235,0.04458203,0.1576709,0.2574045],"study_design_scores_gemma":[0.0016948364,0.0003513196,0.0059807277,0.00026937618,0.00007395811,0.00014310282,0.00023615462,0.9420809,0.007846603,0.0038091925,0.036044087,0.0014697376],"about_ca_topic_score_codex":0.00006386596,"about_ca_topic_score_gemma":0.000090439215,"teacher_disagreement_score":0.46361488,"about_ca_system_score_codex":0.00020145466,"about_ca_system_score_gemma":0.000096231655,"threshold_uncertainty_score":0.9118359},"labels":[],"label_agreement":null},{"id":"W2121556819","doi":"10.1109/lcomm.2005.03016","title":"Maximum likelihood estimation of local average SNR in Rician fading channels","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Estimator; Mean squared error; Minimum-variance unbiased estimator; Mathematics; Statistics; Fading; Bias of an estimator; Efficient estimator; Estimation theory; Minimum mean square error; Minimax estimator; Probability density function; Consistent estimator; Applied mathematics","score_opus":0.0153671912494804,"score_gpt":0.26039886275304386,"score_spread":0.24503167150356345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121556819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06530375,0.0007405048,0.92824847,0.0031959838,0.00009754479,0.00028141373,0.0000065370837,0.0005102395,0.0016155335],"genre_scores_gemma":[0.895025,0.0006058546,0.103853874,0.0003100243,0.000018683608,0.00011146814,0.00003186519,0.000038101727,0.0000051071006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989437,0.00009285661,0.00048804688,0.00011861179,0.00012694752,0.0002298216],"domain_scores_gemma":[0.9977532,0.00017231208,0.00009754235,0.0018957886,0.000037334754,0.000043843622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021204431,0.00015573419,0.00020830116,0.0003422307,0.00008374206,0.000017935517,0.0011568142,0.00007963366,0.000009921697],"category_scores_gemma":[0.000016469221,0.00019577092,0.00005404381,0.00045283156,0.00015300237,0.00038971895,0.00013100017,0.00038058532,0.00003103088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019902302,0.00005734326,0.000050334347,0.000021734797,0.00001253202,3.8508696e-7,0.0007752608,0.80634993,0.020751545,0.00049039436,0.00050864037,0.17097989],"study_design_scores_gemma":[0.00032741105,0.000012193804,0.00031238756,0.00018056163,0.000008616616,0.0000044411568,0.00010519497,0.9085024,0.08302365,0.0011392602,0.006079462,0.00030443096],"about_ca_topic_score_codex":0.00003476869,"about_ca_topic_score_gemma":0.00011055521,"teacher_disagreement_score":0.8297213,"about_ca_system_score_codex":0.00027460864,"about_ca_system_score_gemma":0.000010980712,"threshold_uncertainty_score":0.79833066},"labels":[],"label_agreement":null},{"id":"W2121821424","doi":"10.1109/lcomm.2002.807433","title":"Spreading code construction for CDMA","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hadamard transform; Computer science; Hadamard code; Diagonal; Code division multiple access; Code (set theory); Construct (python library); Trellis (graph); Algorithm; Block code; Set (abstract data type); Convolutional code; Hadamard matrix; Theoretical computer science; Decoding methods; Telecommunications; Mathematics; Computer network","score_opus":0.06818355025977502,"score_gpt":0.3262687245303268,"score_spread":0.2580851742705518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121821424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004933959,0.00031936972,0.9660475,0.023544392,0.00033745187,0.00048598836,0.000006263294,0.00025436725,0.004070702],"genre_scores_gemma":[0.51822734,0.00021796292,0.47997853,0.0011544891,0.000026503172,0.00028288542,0.000012124581,0.000017117027,0.00008306424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983264,0.00049871276,0.00032529543,0.00028300917,0.00021538998,0.00035119988],"domain_scores_gemma":[0.9934892,0.001066484,0.00013511865,0.00502749,0.00018288505,0.00009884542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075572246,0.00013514611,0.0001550243,0.00019302133,0.00071460067,0.00024038655,0.0043188133,0.00006396543,0.0000078062685],"category_scores_gemma":[0.00016884522,0.00015162965,0.000093035305,0.00062510424,0.00031104617,0.0005224223,0.00033553102,0.00031456127,0.00005418963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055472965,0.00012889618,0.0008108191,0.00001896481,0.00006419413,7.3510313e-7,0.00060915825,0.0023583565,0.02417881,0.913155,0.020915577,0.037753917],"study_design_scores_gemma":[0.0015021656,0.000060001737,0.00043737565,0.000098208184,0.000023936871,0.00009800781,0.00018231384,0.32195714,0.018133376,0.010221973,0.6464848,0.00080070586],"about_ca_topic_score_codex":0.000012231852,"about_ca_topic_score_gemma":0.000024470937,"teacher_disagreement_score":0.90293306,"about_ca_system_score_codex":0.0001264194,"about_ca_system_score_gemma":0.00008289012,"threshold_uncertainty_score":0.8025502},"labels":[],"label_agreement":null},{"id":"W2122501450","doi":"10.1109/lcomm.2005.1576588","title":"A family of low-complexity binary linear codes for bluetooth and BLAST signaling applications","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bluetooth; Computer network; Theoretical computer science; Telecommunications; Wireless","score_opus":0.04715343231336983,"score_gpt":0.2871259003855308,"score_spread":0.239972468072161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122501450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18791609,0.00038593682,0.8026133,0.0083682835,0.00002928725,0.0003779955,0.000028390177,0.000121053126,0.00015967015],"genre_scores_gemma":[0.71061975,0.00005287899,0.28762087,0.0014940597,0.00003852486,0.00015289501,0.000009136411,0.0000072932053,0.0000045572197],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991694,0.00010101114,0.000264772,0.00021201593,0.00009364875,0.00015914827],"domain_scores_gemma":[0.9976428,0.0005033863,0.00012843477,0.0015863596,0.00008524703,0.0000537847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003483467,0.00010805843,0.00014830702,0.00015760878,0.0003740499,0.00004945955,0.0015930379,0.00003410717,0.0000014281568],"category_scores_gemma":[0.000012071748,0.00011576038,0.00008644721,0.00038809242,0.00042463263,0.00030506798,0.00024594166,0.000121659985,0.000004882939],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002988054,0.00051204,0.0004612411,0.00012420752,0.000084125786,2.6396765e-7,0.0018286855,0.001963284,0.52916163,0.4286094,0.0014376673,0.035787538],"study_design_scores_gemma":[0.0044643055,0.0005873305,0.009622508,0.00064235955,0.00026471863,0.00003820131,0.00086655066,0.60050297,0.0845987,0.07504801,0.22084214,0.0025222222],"about_ca_topic_score_codex":0.000009956341,"about_ca_topic_score_gemma":0.00000893212,"teacher_disagreement_score":0.59853965,"about_ca_system_score_codex":0.000016467946,"about_ca_system_score_gemma":0.000022857519,"threshold_uncertainty_score":0.4720571},"labels":[],"label_agreement":null},{"id":"W2122968563","doi":"10.1109/lcomm.2010.06.100176","title":"A QoS-aware vertical handoff algorithm based on service history information","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"TRIUMF; University of British Columbia Hospital","funders":"","keywords":"Computer science; Handover; Vertical handover; Quality of service; Computer network; Bandwidth (computing); Algorithm; Wireless network; Wireless; Heterogeneous network; Telecommunications","score_opus":0.012736642549518368,"score_gpt":0.2104719862817878,"score_spread":0.19773534373226942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122968563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5317474,0.00077422435,0.37921715,0.040985618,0.021598531,0.0031139352,0.0002641436,0.0050769756,0.017222011],"genre_scores_gemma":[0.980455,0.000023931725,0.008191551,0.010680786,0.00021168076,0.0001785527,0.00021212336,0.00003965112,0.000006719866],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888635,0.000094738025,0.00034873158,0.00013393414,0.00024411321,0.00029211713],"domain_scores_gemma":[0.9970876,0.00028409177,0.000040268005,0.00236313,0.000111034846,0.00011388141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002741003,0.0002052252,0.0001779585,0.00015321173,0.00015853197,0.000054344877,0.00089392567,0.00015752057,0.00008665652],"category_scores_gemma":[0.000035538294,0.00023523925,0.000080392994,0.00023438243,0.0001437287,0.0004743655,0.0000828867,0.00096183835,0.00029535638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023087385,0.0014511404,0.0011992289,0.00088163075,0.0003715819,0.000014974465,0.010951463,0.21474929,0.07998155,0.0017974133,0.5904753,0.09789555],"study_design_scores_gemma":[0.0006569629,0.000013596216,0.0009624127,0.000029106566,0.000027680853,0.0000030496187,0.000021658283,0.7985652,0.00066052395,0.000013863574,0.19878982,0.0002561215],"about_ca_topic_score_codex":0.00010397637,"about_ca_topic_score_gemma":0.00034100687,"teacher_disagreement_score":0.58381593,"about_ca_system_score_codex":0.00039650756,"about_ca_system_score_gemma":0.0000462914,"threshold_uncertainty_score":0.9592778},"labels":[],"label_agreement":null},{"id":"W2123138508","doi":"10.1109/lcomm.2005.1461687","title":"Estimating the minimum distance of turbo-codes using double and triple impulse methods","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Turbo code; Algorithm; Dither; Computer science; Minimum distance; Turbo; Distance measurement; Decoding methods; Mathematics; Statistics; Telecommunications; Bandwidth (computing); Artificial intelligence","score_opus":0.04260657935844516,"score_gpt":0.3528862874106217,"score_spread":0.3102797080521766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123138508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15663382,0.0029597885,0.83667094,0.0026159848,0.000073947704,0.00028876058,0.00000899941,0.0003213747,0.00042637918],"genre_scores_gemma":[0.51267225,0.00017173695,0.48696178,0.000112702284,0.000015893538,0.000038734368,0.0000037009077,0.000018778748,0.0000044333055],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991102,0.00015782566,0.00038312873,0.00010609146,0.000084046915,0.00015866208],"domain_scores_gemma":[0.99713343,0.00045363852,0.00012800579,0.0022055642,0.000046816665,0.00003251788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004050222,0.00013755566,0.00019191999,0.00008131878,0.00025317972,0.00003267349,0.0011120137,0.000043089283,0.0000033428503],"category_scores_gemma":[0.000031831936,0.00012487144,0.000046170633,0.0002613936,0.0003481957,0.0002538494,0.00018882635,0.00028361153,0.0000011630078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011746395,0.000048496055,0.00027900873,0.00007269131,0.00007177106,1.6057564e-7,0.0020016911,0.21314141,0.66236264,0.0013203665,0.00070304505,0.11998694],"study_design_scores_gemma":[0.00023835506,0.000004966935,0.000109850465,0.000081363585,0.0000278374,0.000007323557,0.00008836912,0.8577907,0.1360806,0.0002917569,0.0050850506,0.00019380254],"about_ca_topic_score_codex":0.00003623206,"about_ca_topic_score_gemma":0.00003555215,"teacher_disagreement_score":0.6446493,"about_ca_system_score_codex":0.00008231043,"about_ca_system_score_gemma":0.000008915078,"threshold_uncertainty_score":0.50921094},"labels":[],"label_agreement":null},{"id":"W2123330494","doi":"10.1109/lcomm.2003.822499","title":"Improving Belief Propagation on Graphs With Cycles","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Belief propagation; Factor graph; Multiplicative function; Decoding methods; Computer science; Algorithm; Reliability (semiconductor); Offset (computer science); Random variable; Mathematics; Statistics","score_opus":0.022298739402374534,"score_gpt":0.26110804394342946,"score_spread":0.23880930454105492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123330494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.160232,0.000038277118,0.81159854,0.025464483,0.00012706057,0.0003553176,9.515745e-7,0.0012185867,0.0009648085],"genre_scores_gemma":[0.7353005,0.000011645447,0.26237637,0.0021920505,0.000011789121,0.00008505536,0.0000030507654,0.000013585079,0.000005964112],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990095,0.00009321491,0.00018707415,0.0002803099,0.00022528095,0.0002046075],"domain_scores_gemma":[0.99673057,0.000116842144,0.00015178573,0.0028771397,0.00007675595,0.000046937443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023292119,0.00014124598,0.000102779384,0.00021702626,0.00038798255,0.00013755799,0.0023572824,0.00003863142,4.397702e-7],"category_scores_gemma":[0.00003220309,0.0001275122,0.00004275636,0.00053407054,0.00014203203,0.0004536303,0.00021220386,0.00030913393,0.000027720416],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034201024,0.00095929776,0.0023733163,0.000058894224,0.00009281364,0.000028126668,0.007159437,0.008296469,0.49424893,0.32157636,0.0022656554,0.1629065],"study_design_scores_gemma":[0.004450567,0.0023889747,0.020561028,0.0019288522,0.00012531348,0.00039843528,0.00041925185,0.05459465,0.86375386,0.042323913,0.0050040814,0.0040510464],"about_ca_topic_score_codex":0.00023691815,"about_ca_topic_score_gemma":0.0001495569,"teacher_disagreement_score":0.5750685,"about_ca_system_score_codex":0.0001447033,"about_ca_system_score_gemma":0.000056701097,"threshold_uncertainty_score":0.5199797},"labels":[],"label_agreement":null},{"id":"W2123504866","doi":"10.1109/lcomm.2004.823392","title":"An Accurate Model for Evaluating Blocking Probabilities in Multi-Class OBS Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Blocking (statistics); Optical burst switching; Computer science; Class (philosophy); Computer network; Optical performance monitoring; Physics; Artificial intelligence; Wavelength-division multiplexing","score_opus":0.12611610898730014,"score_gpt":0.3493031818722805,"score_spread":0.22318707288498035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123504866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28789747,0.000483252,0.70887256,0.0010699014,0.00010442775,0.000709467,0.000013849205,0.00081022806,0.00003885516],"genre_scores_gemma":[0.65580744,0.00005139132,0.34341875,0.00006826308,0.000010572093,0.0005966487,0.000012586448,0.000031592732,0.0000027737985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899614,0.000042095104,0.0003674644,0.00017919386,0.00008665094,0.00032846341],"domain_scores_gemma":[0.99808866,0.00026948974,0.000050707793,0.0014987275,0.0000578853,0.000034535162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026835268,0.0001626901,0.0001876741,0.00011735634,0.00015150137,0.00006128698,0.00096201396,0.00009295726,2.0131539e-7],"category_scores_gemma":[0.00012856921,0.00017959837,0.000040623865,0.00022642399,0.00016008706,0.00031699182,0.000076392964,0.0003214798,0.000002831991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018538032,0.000032620897,0.000044968285,0.00004539236,0.00001018141,1.651703e-7,0.0005049759,0.9727025,0.021553118,0.00413425,0.000013414563,0.000956586],"study_design_scores_gemma":[0.00047682176,0.000016632333,0.000018194985,0.0001231638,0.000009037029,0.0000010229064,0.0003214716,0.99583167,0.00037284673,0.002572437,0.00005420624,0.00020251526],"about_ca_topic_score_codex":0.000020368987,"about_ca_topic_score_gemma":0.0001328303,"teacher_disagreement_score":0.36790994,"about_ca_system_score_codex":0.00035726323,"about_ca_system_score_gemma":0.000020324162,"threshold_uncertainty_score":0.7323809},"labels":[],"label_agreement":null},{"id":"W2124040569","doi":"10.1109/lcomm.2009.090704","title":"On joint estimation and decoding for channels with noise memory","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decodes; Decoding methods; Computer science; Interference (communication); Noise (video); Transmission (telecommunications); Markov chain; Joint (building); Algorithm; Markov process; Channel (broadcasting); Speech recognition; Telecommunications; Statistics; Artificial intelligence; Mathematics; Machine learning","score_opus":0.0273518727772227,"score_gpt":0.26864052810981487,"score_spread":0.24128865533259217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124040569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094972,0.00027882477,0.89440465,0.0081428075,0.00004683569,0.0005766018,0.0000068196164,0.0008133237,0.000758107],"genre_scores_gemma":[0.76706207,0.00023953615,0.23149689,0.0009673908,0.0000108490985,0.00017190445,0.000022230652,0.000022399232,0.000006721223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994617,0.000030102274,0.0001866883,0.00011011817,0.00007051657,0.00014084915],"domain_scores_gemma":[0.9983034,0.00021371915,0.000053715114,0.0013496117,0.0000372705,0.000042266383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115720126,0.0001311874,0.00013241901,0.00014170111,0.00020484976,0.000040752868,0.00041873267,0.00003864674,0.0000011819327],"category_scores_gemma":[0.000026366259,0.0001337048,0.00002606034,0.00012457819,0.000078334306,0.00020508136,0.000026690377,0.00017366406,0.000003647738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003831176,0.00012199693,0.000014017807,0.00007827228,0.000059559257,8.579482e-7,0.001364096,0.46271223,0.18365979,0.016097572,0.007306653,0.32854664],"study_design_scores_gemma":[0.0006396777,0.00013840043,0.00027626022,0.0002568026,0.000026444326,0.000010691719,0.00006073819,0.91586035,0.07656994,0.0044896486,0.0012282945,0.00044277546],"about_ca_topic_score_codex":0.0000019888903,"about_ca_topic_score_gemma":0.0000034229815,"teacher_disagreement_score":0.67209005,"about_ca_system_score_codex":0.000079217854,"about_ca_system_score_gemma":0.000004829399,"threshold_uncertainty_score":0.54523236},"labels":[],"label_agreement":null},{"id":"W2125088789","doi":"10.1109/lcomm.2014.2349989","title":"Tier Association Probability and Spectrum Partitioning for Maximum Rate Coverage in Multi-Tier Heterogeneous Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mathematical optimization; Optimization problem; Convex optimization; Outage probability; Wireless network; Fraction (chemistry); Resource allocation; Frequency allocation; Spectrum (functional analysis); Relation (database); Resource management (computing); Wireless; Fading; Mathematics; Regular polygon; Channel (broadcasting); Distributed computing; Computer network; Telecommunications","score_opus":0.019682093285593276,"score_gpt":0.2375875493859888,"score_spread":0.21790545610039552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125088789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057003506,0.00018072787,0.9407973,0.0009862543,0.00021946557,0.000589082,0.000010365184,0.00014747027,0.0000658273],"genre_scores_gemma":[0.9713852,0.0001382604,0.027696617,0.00029327293,0.00004498864,0.00031895548,0.00006512242,0.000035280602,0.0000223075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905884,0.00019859473,0.00030486385,0.00015709802,0.00004818325,0.00023243166],"domain_scores_gemma":[0.9988427,0.0003569517,0.00009379032,0.00063434924,0.000035121204,0.000037064216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005748973,0.00012473445,0.00016461447,0.00006909682,0.00013820964,0.000052721534,0.00018984283,0.00008458559,0.0000020985656],"category_scores_gemma":[0.00011254438,0.00015150732,0.000035260724,0.00013760965,0.000034824716,0.0001997221,0.000034663757,0.0001728074,0.0000038392304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037155696,0.000019763453,0.0051301,0.000026878568,0.000017663815,1.08887065e-7,0.00014336979,0.9922896,0.001321054,0.000061577084,0.00017227928,0.0008138858],"study_design_scores_gemma":[0.0005773772,0.000010043102,0.001978341,0.000037127764,0.0000123333275,0.0000014301712,0.000006237479,0.9941699,0.00042921214,0.0005250966,0.0020749334,0.00017798971],"about_ca_topic_score_codex":0.000015139891,"about_ca_topic_score_gemma":0.00031589152,"teacher_disagreement_score":0.9143817,"about_ca_system_score_codex":0.00034063528,"about_ca_system_score_gemma":0.000004589977,"threshold_uncertainty_score":0.61782897},"labels":[],"label_agreement":null},{"id":"W2125280768","doi":"10.1109/lcomm.2009.090979","title":"Output characterization of constant bit rate traffic in FIFO networks","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; FIFO (computing and electronics); Constant (computer programming); Constant bitrate; Computer network; Packet switching; Characterization (materials science); Bit rate; Algorithm; Network packet; Variable bitrate; Computer hardware","score_opus":0.01749958778141531,"score_gpt":0.23177171644539957,"score_spread":0.21427212866398426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125280768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36066726,0.00024132291,0.59392625,0.044011507,0.00030563405,0.00034081223,0.000004022326,0.00017940819,0.0003237848],"genre_scores_gemma":[0.99222255,0.00025899458,0.0030233148,0.004378336,0.000037780763,0.000021916912,0.000021665124,0.0000059626955,0.000029498617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875355,0.0002868376,0.00042730008,0.0002100537,0.000098241515,0.0002239914],"domain_scores_gemma":[0.99799436,0.00019389868,0.00019418572,0.0014982496,0.0000665699,0.00005274025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037340468,0.00012684095,0.00020673369,0.00017090929,0.00010301079,0.000064904416,0.0015762671,0.000059405604,0.0000029383484],"category_scores_gemma":[0.000013565066,0.000133867,0.000060902883,0.000639696,0.00011134427,0.00030663278,0.00006436981,0.00022971487,0.000010339445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028570037,0.00038631257,0.0003941539,0.0000065533077,0.00003323142,0.000009192137,0.0009873351,0.09547151,0.041293193,0.03263182,0.0014941363,0.827264],"study_design_scores_gemma":[0.00066828355,0.000045142184,0.0096843,0.00007275013,0.000009601199,0.000005094166,0.000010507962,0.9863406,0.00014347277,0.00009092919,0.0027183713,0.00021098691],"about_ca_topic_score_codex":0.000004312591,"about_ca_topic_score_gemma":0.000017866332,"teacher_disagreement_score":0.8908691,"about_ca_system_score_codex":0.00004106799,"about_ca_system_score_gemma":0.000042658456,"threshold_uncertainty_score":0.5458937},"labels":[],"label_agreement":null},{"id":"W2125669974","doi":"10.1109/lcomm.2008.080739","title":"Spatial modulation: optimal detection and performance analysis","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":913,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Concordia University","funders":"","keywords":"Detector; Spatial modulation; Computer science; Modulation (music); Algorithm; Bit error rate; Wireless; Antenna (radio); Probability of error; Electronic engineering; Telecommunications; MIMO; Channel (broadcasting); Decoding methods; Physics","score_opus":0.02177888912411954,"score_gpt":0.2281418422577608,"score_spread":0.20636295313364125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125669974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60898286,0.0002637152,0.38952,0.00045072183,0.00003497351,0.00007044467,0.000002416908,0.000535136,0.00013974724],"genre_scores_gemma":[0.968481,0.0031366637,0.028182624,0.000065735156,0.0000141247465,0.00007455703,0.000018206785,0.000018306471,0.000008751798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939984,0.00003544881,0.00021454736,0.00012023309,0.00009384668,0.00013606939],"domain_scores_gemma":[0.99804366,0.000081950806,0.000048826907,0.0017587834,0.00003662433,0.000030141146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005950943,0.000118803735,0.00014734564,0.00030125136,0.00039026173,0.00001659012,0.00059927156,0.00006165448,0.0000055708474],"category_scores_gemma":[0.000012520683,0.00013890698,0.00004761623,0.0006503298,0.0002956818,0.00026983488,0.0001203912,0.0002562285,0.000013372637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005656647,0.00002205832,0.011122349,0.00001298495,0.000228315,7.1267056e-7,0.00043338607,0.8662495,0.041818228,0.00005710288,0.00009078874,0.07995892],"study_design_scores_gemma":[0.0001296767,0.00001123877,0.0845683,0.000005100658,0.000038782673,0.000012967062,0.000033261473,0.90408516,0.009784139,0.000010207841,0.0011394904,0.00018166972],"about_ca_topic_score_codex":0.00002422986,"about_ca_topic_score_gemma":0.000058524933,"teacher_disagreement_score":0.36133736,"about_ca_system_score_codex":0.00007054087,"about_ca_system_score_gemma":0.000004026803,"threshold_uncertainty_score":0.56644624},"labels":[],"label_agreement":null},{"id":"W2125673305","doi":"10.1109/4234.901808","title":"An improved hashing function for IS-2000 quick paging channel","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Paging; Computer science; Hash function; Channel (broadcasting); Function (biology); Algorithm; Computer network; Computer security","score_opus":0.04138638801021296,"score_gpt":0.29202286080559026,"score_spread":0.2506364727953773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125673305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008388737,0.00018488645,0.9726242,0.017678166,0.00047859145,0.00027298526,0.000012686624,0.00024888758,0.000110891226],"genre_scores_gemma":[0.758085,0.00012821192,0.22574928,0.015343399,0.00026169597,0.00019946911,0.00011348225,0.000028517363,0.00009094425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989207,0.00009116218,0.00023868207,0.00033564866,0.00013068534,0.00028315492],"domain_scores_gemma":[0.99636394,0.00013203632,0.00012296229,0.0032062216,0.000082832026,0.00009200706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003152654,0.00013708432,0.00012217865,0.0001245192,0.0007440976,0.00032087922,0.0025967876,0.000050589013,0.0000050923427],"category_scores_gemma":[0.000011649395,0.00013742267,0.00006580847,0.00029237475,0.00005439621,0.0015143394,0.00028844713,0.00018554476,0.000020528425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008666874,0.0008504236,0.0005808421,0.000048022153,0.00013459785,0.0000051441743,0.012348608,0.0020724044,0.3706816,0.005313589,0.0696721,0.538206],"study_design_scores_gemma":[0.00046569676,0.000074144984,0.0005395979,0.000033529075,0.000013625066,0.000010681284,0.00010213179,0.93009794,0.0009559789,0.0008878542,0.066552065,0.0002667505],"about_ca_topic_score_codex":0.00013879027,"about_ca_topic_score_gemma":0.000030758274,"teacher_disagreement_score":0.92802554,"about_ca_system_score_codex":0.0000735849,"about_ca_system_score_gemma":0.000042673437,"threshold_uncertainty_score":0.5723072},"labels":[],"label_agreement":null},{"id":"W2126162457","doi":"10.1109/lcomm.2006.1633335","title":"A fast class-of-service oriented packet scheduling scheme for EPON access networks","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Lakehead University","funders":"","keywords":"Computer science; Computer network; Dynamic bandwidth allocation; Bandwidth allocation; Scheduling (production processes); Channel allocation schemes; Pooling; Passive optical network; Network packet; Access network; Bandwidth management; Bandwidth (computing); Telecommunications; Wireless; Wavelength-division multiplexing","score_opus":0.035484359996776044,"score_gpt":0.2952300942784935,"score_spread":0.25974573428171743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126162457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17588623,0.0018083786,0.81282026,0.004658679,0.00051300775,0.0010779465,0.000069015965,0.0006357473,0.002530717],"genre_scores_gemma":[0.92405075,0.00012885653,0.07436848,0.00054426055,0.00008699615,0.00049456774,0.00023078045,0.00007473847,0.000020584852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861425,0.000095177784,0.00065434026,0.00018176076,0.00014573378,0.00030870887],"domain_scores_gemma":[0.9955495,0.0007085402,0.00021347297,0.003250433,0.00022392542,0.000054122724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025593842,0.00021176474,0.00028941635,0.00015413747,0.00022511392,0.000058549005,0.0021101718,0.00010150361,0.00000847635],"category_scores_gemma":[0.000037312493,0.0002512602,0.000106357074,0.00074436807,0.00011135937,0.00034616276,0.00024896505,0.00034657455,0.000009862463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018780966,0.00009102509,0.00086551043,0.00014883025,0.00010179135,2.97043e-7,0.00031573683,0.90273774,0.08748104,0.0032563198,0.003941451,0.0010415091],"study_design_scores_gemma":[0.000731461,0.000008445387,0.00038577887,0.00017093706,0.000027670305,0.0000051686716,0.00018196771,0.9369677,0.0052492865,0.00011315115,0.05580143,0.00035701593],"about_ca_topic_score_codex":0.00012934709,"about_ca_topic_score_gemma":0.00034344904,"teacher_disagreement_score":0.7481645,"about_ca_system_score_codex":0.0001545587,"about_ca_system_score_gemma":0.000023731252,"threshold_uncertainty_score":0.999994},"labels":[],"label_agreement":null},{"id":"W2126970322","doi":"10.1109/lcomm.2006.1638627","title":"New control algorithms in an optical packet switch with limited-range wavelength converters","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Converters; Computer science; Wavelength-division multiplexing; Packet switching; Optical switch; Optical burst switching; Network packet; Algorithm; Burst switching; Wavelength; Fast packet switching; Packet loss; Transmission delay; Matching (statistics); Circuit switching; Optical performance monitoring; Electronic engineering; Processing delay; Computer network; Mathematics; Optics; Physics; Power (physics); Engineering","score_opus":0.0136399264725889,"score_gpt":0.22752364426519314,"score_spread":0.21388371779260423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126970322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30787835,0.00053661107,0.67374057,0.013660841,0.00016976186,0.0006466974,0.000018129867,0.0020125313,0.0013365009],"genre_scores_gemma":[0.76970196,0.000094358096,0.22947605,0.0005248714,0.00005361622,0.000066581975,0.000025781826,0.000047691254,0.000009069539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998854,0.00004473732,0.0003089306,0.00021336561,0.00015197168,0.00042701975],"domain_scores_gemma":[0.9979244,0.00028859286,0.00003435066,0.001630689,0.000032546654,0.00008942407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008646537,0.00023155617,0.0002632965,0.00016043126,0.000077001605,0.00005107679,0.0009491796,0.0001254567,0.000006966625],"category_scores_gemma":[0.000013581419,0.00022282974,0.000039078575,0.0004365926,0.0002633225,0.00030723793,0.00005191379,0.0005732742,0.00002914878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016916642,0.00063078717,0.03160983,0.00008099033,0.00027826554,0.0001529186,0.0006415201,0.5667251,0.039667428,0.016791152,0.023500917,0.31975192],"study_design_scores_gemma":[0.0038417564,0.00016750139,0.022186419,0.00013121542,0.00007356238,0.000034554647,0.00023255542,0.964672,0.0009851765,0.0011486835,0.0054457146,0.0010808555],"about_ca_topic_score_codex":0.000065337365,"about_ca_topic_score_gemma":0.00052703725,"teacher_disagreement_score":0.46182364,"about_ca_system_score_codex":0.00014949017,"about_ca_system_score_gemma":0.0000144041105,"threshold_uncertainty_score":0.9086733},"labels":[],"label_agreement":null},{"id":"W2127155545","doi":"10.1109/lcomm.2007.061696","title":"Accurate Upper Bound of SINR-based Call Admission Threshold in CDMA Systems with Imperfect Power Control","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Memorial University of Newfoundland","funders":"","keywords":"Signal-to-interference-plus-noise ratio; Computer science; Value (mathematics); Interference (communication); Signal-to-noise ratio (imaging); Discrete mathematics; Algorithm; Mathematics; Computer network; Power (physics); Telecommunications; Physics; Machine learning","score_opus":0.02831401848733707,"score_gpt":0.30290685051193733,"score_spread":0.2745928320246003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127155545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40773454,0.0015897781,0.5649843,0.022427633,0.0002012643,0.0011932909,0.000009546696,0.00018882344,0.0016708007],"genre_scores_gemma":[0.989465,0.00007007546,0.009254172,0.0010604784,0.000017985067,0.00006606156,0.000011834326,0.000027316251,0.000027087468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972634,0.00061989937,0.00068363134,0.00034271812,0.00055885623,0.0005315051],"domain_scores_gemma":[0.99175066,0.0015500719,0.0003013182,0.0059419894,0.00028064978,0.0001752954],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001921138,0.00022394449,0.00034805466,0.00050111447,0.00027085192,0.00019610752,0.0054217447,0.00011667938,0.0000059571703],"category_scores_gemma":[0.00006366208,0.00019486899,0.00008409859,0.001283073,0.00040483422,0.0004865542,0.00041608422,0.00070273975,0.000018017636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012537794,0.0043958724,0.10241809,0.0003505745,0.0005491216,0.00017056038,0.0064925356,0.44172087,0.36826885,0.034821477,0.02254304,0.017015247],"study_design_scores_gemma":[0.005036007,0.00040945527,0.0445017,0.00084956543,0.000025024932,0.000047720016,0.00019408044,0.9360556,0.0045837536,0.000052167255,0.0073656146,0.0008792947],"about_ca_topic_score_codex":0.00030035278,"about_ca_topic_score_gemma":0.00028453945,"teacher_disagreement_score":0.5817304,"about_ca_system_score_codex":0.00022746388,"about_ca_system_score_gemma":0.00024011725,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W2127226621","doi":"10.1109/4234.901815","title":"Using the Fourier transform to compute the weight distribution of a binary linear block code","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Traverse; Trellis (graph); Code (set theory); Weight distribution; Algorithm; Computer science; Fourier transform; Discrete Fourier transform (general); Binary number; Block (permutation group theory); Polynomial code; Linear code; Fourier analysis; Cyclic code; Mathematics; Block code; Fractional Fourier transform; Decoding methods; Arithmetic; Mathematical analysis; Geometry; Programming language","score_opus":0.0436192396430849,"score_gpt":0.30059551405098933,"score_spread":0.25697627440790444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127226621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17550299,0.00062430697,0.7906476,0.03167497,0.00010218712,0.0006441894,0.00006423775,0.00040204392,0.00033744442],"genre_scores_gemma":[0.94866705,0.0011500679,0.049195234,0.00076109625,0.000037715967,0.00010229182,0.000043200296,0.000033149678,0.000010190937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990769,0.00013286046,0.00035115704,0.0000948095,0.00015567378,0.00018862584],"domain_scores_gemma":[0.9965282,0.00029247132,0.00007041525,0.0029871652,0.000081462975,0.000040274717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000254035,0.00014326106,0.00014934539,0.000063229716,0.00039380955,0.000019341787,0.0019776726,0.000048682163,0.0000031117038],"category_scores_gemma":[0.000014470671,0.000106282765,0.00008234368,0.0005860099,0.00026636876,0.00012751947,0.00015714033,0.0003660309,0.0000068188633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029176206,0.00016762438,0.00032409208,0.000040170093,0.00018946674,0.0000018970923,0.0027245353,0.72840065,0.22824669,0.0033226425,0.015175721,0.021377327],"study_design_scores_gemma":[0.0002253948,0.000023373443,0.0006306395,0.00011321879,0.000054193933,0.000029769948,0.00013753911,0.6945318,0.023892999,0.00020003607,0.27987158,0.00028946128],"about_ca_topic_score_codex":0.000038667025,"about_ca_topic_score_gemma":0.000056646095,"teacher_disagreement_score":0.77316403,"about_ca_system_score_codex":0.00011986649,"about_ca_system_score_gemma":0.0000129278715,"threshold_uncertainty_score":0.43340853},"labels":[],"label_agreement":null},{"id":"W2127283113","doi":"10.1109/lcomm.2006.1665120","title":"Mutual information statistics for dual MIMO systems in correlated Rayleigh fading","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"MIMO; Rayleigh fading; Kurtosis; Fading; Mathematics; Higher-order statistics; Antenna (radio); Statistics; Skewness; Mutual information; Wireless; Algorithm; Topology (electrical circuits); Telecommunications; Computer science; Signal processing; Beamforming; Combinatorics","score_opus":0.013083826746172963,"score_gpt":0.22983443669775178,"score_spread":0.2167506099515788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127283113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012300509,0.0002550151,0.9848249,0.00017562581,0.0006458198,0.0007286532,0.00018172793,0.000290643,0.000597137],"genre_scores_gemma":[0.9476465,0.000046486617,0.05075223,0.00007132268,0.000057029447,0.00030409577,0.001053192,0.000035257613,0.000033868993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990063,0.000051260475,0.0005632022,0.00007902541,0.0000864113,0.0002138546],"domain_scores_gemma":[0.9988808,0.00027568088,0.00011096199,0.00062229205,0.00008410512,0.000026182059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015779003,0.00013670979,0.00016337459,0.00024351841,0.000117080075,0.00006927871,0.0002742762,0.00008059533,0.0000015854583],"category_scores_gemma":[0.000036651316,0.00016759905,0.000025463645,0.00028480202,0.000045520323,0.00058164855,0.000023788694,0.0001706918,0.00003653644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003841741,0.000011448537,0.00017008929,0.00006358572,0.000011355528,4.332478e-7,0.00032091187,0.98031765,0.0046159746,0.0024746135,0.011676197,0.00033389285],"study_design_scores_gemma":[0.00067826716,0.000008696174,0.00021699157,0.00007838682,0.000014183762,0.0000075974167,0.00016167927,0.9863857,0.00026409508,0.000055091834,0.011907314,0.00022199286],"about_ca_topic_score_codex":0.00017334406,"about_ca_topic_score_gemma":0.000113113514,"teacher_disagreement_score":0.935346,"about_ca_system_score_codex":0.00027042977,"about_ca_system_score_gemma":0.000012342648,"threshold_uncertainty_score":0.6834491},"labels":[],"label_agreement":null},{"id":"W2127389695","doi":"10.1109/lcomm.2012.12.121706","title":"True ML Estimator for the Location Parameter of the Generalized Gaussian Distribution with p = 4","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Mathematics; Efficient estimator; Mean squared error; Trimmed estimator; Minimax estimator; Consistent estimator; Bias of an estimator; Cramér–Rao bound; Minimum-variance unbiased estimator; Estimation theory; Statistics; Moment (physics); Stein's unbiased risk estimate; Applied mathematics; Upper and lower bounds; Maximum likelihood sequence estimation; Mathematical analysis; Physics","score_opus":0.024065932969750216,"score_gpt":0.26869135593065163,"score_spread":0.24462542296090142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127389695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019799706,0.000044846598,0.9449932,0.034043223,0.00010800325,0.00085407833,0.000010837097,0.000092023256,0.00005409784],"genre_scores_gemma":[0.7978046,0.000011122275,0.20108362,0.00047252505,0.000008101795,0.00058541744,0.000012843993,0.00000726154,0.0000145348795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913394,0.00014595257,0.00029944326,0.00013231156,0.00017525975,0.00011309244],"domain_scores_gemma":[0.9962566,0.0006070205,0.0003210682,0.0025054337,0.00028659726,0.000023286504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024109338,0.00009510442,0.00011865295,0.00004340681,0.00029178648,0.00007464855,0.0021084284,0.000033243727,0.000003074355],"category_scores_gemma":[0.00013729821,0.000056075307,0.00006869428,0.00051469903,0.00033576103,0.00037355203,0.0001369703,0.00009756415,0.0000038512894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060460232,0.0008655227,0.005653745,0.0002919707,0.0005012498,1.730686e-7,0.003530603,0.021702632,0.1509178,0.52090985,0.11366149,0.18190454],"study_design_scores_gemma":[0.0006755478,0.000100035504,0.033629123,0.00019098743,0.00008936958,0.000010349317,0.000052223466,0.7857879,0.16631559,0.0071562883,0.0056760837,0.00031652808],"about_ca_topic_score_codex":0.0002778396,"about_ca_topic_score_gemma":0.0000213401,"teacher_disagreement_score":0.7780049,"about_ca_system_score_codex":0.00005105586,"about_ca_system_score_gemma":0.000052869702,"threshold_uncertainty_score":0.39180195},"labels":[],"label_agreement":null},{"id":"W2127731639","doi":"10.1109/lcomm.2006.1613728","title":"Code detection in turbo source coding","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Turbo code; Constant-weight code; Lossless compression; Systematic code; Concatenated error correction code; Variable-length code; Algorithm; Decoding methods; Code (set theory); Data compression; Low-density parity-check code; Turbo equalizer; Distributed source coding; Theoretical computer science; Block code; Programming language","score_opus":0.015595747481673769,"score_gpt":0.24531682663447127,"score_spread":0.2297210791527975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127731639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24966681,0.00076718355,0.7406398,0.002199849,0.00013012759,0.00033982046,0.0000076351325,0.0021072275,0.0041415463],"genre_scores_gemma":[0.98005235,0.00039558756,0.019038858,0.00022276468,0.00002842708,0.00016441235,0.000023062981,0.00004548969,0.000029047795],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918616,0.00008932126,0.00032277696,0.00011358278,0.00009109045,0.00019706922],"domain_scores_gemma":[0.99789834,0.00017659638,0.00005318609,0.0018229558,0.000025140935,0.000023807053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014448227,0.00013274529,0.00013233536,0.00023855586,0.00013939479,0.000032585187,0.00093413424,0.000065659806,0.0000041228705],"category_scores_gemma":[0.000012820985,0.0001685029,0.000041509178,0.00040052124,0.000113100214,0.00027964608,0.00009243243,0.0004019728,0.000026957245],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035415974,0.00006397143,0.0007917878,0.000025065667,0.000012461857,0.0000010598278,0.0002562067,0.13787223,0.81961954,0.0010029502,0.001981774,0.03836943],"study_design_scores_gemma":[0.0007340725,0.000015595846,0.0064881966,0.0001822569,0.000018871928,0.000020632315,0.00014796412,0.32511604,0.55767775,0.0017546457,0.10691487,0.0009290934],"about_ca_topic_score_codex":0.0001489235,"about_ca_topic_score_gemma":0.0009599404,"teacher_disagreement_score":0.73038554,"about_ca_system_score_codex":0.00024093548,"about_ca_system_score_gemma":0.0000044295684,"threshold_uncertainty_score":0.68713486},"labels":[],"label_agreement":null},{"id":"W2127795551","doi":"10.1109/lcomm.2004.823401","title":"Pairwise Error Probability of Space-Time Codes in Rician–Nakagami Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rician fading; Nakagami distribution; Pairwise error probability; Mathematics; Channel (broadcasting); Computer science; Algorithm; Fading; Telecommunications","score_opus":0.0279572835197417,"score_gpt":0.2650912062831952,"score_spread":0.23713392276345352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127795551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84699833,0.0014009611,0.13048278,0.015119992,0.00014441012,0.0013700775,0.000050448733,0.0017047722,0.0027282038],"genre_scores_gemma":[0.90931994,0.0003490166,0.0898232,0.00018711164,0.000010175856,0.000233649,0.00002637406,0.00004040507,0.000010113412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988146,0.00014212573,0.0005048266,0.00015891748,0.00013831064,0.00024126205],"domain_scores_gemma":[0.9964092,0.00020843046,0.00011036515,0.003153616,0.00006832241,0.0000501041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030472095,0.00018775385,0.000302632,0.00025218824,0.00008144543,0.000015258663,0.0015341475,0.00008978452,0.00000909775],"category_scores_gemma":[0.000060809554,0.00021983679,0.000077992125,0.000591217,0.00035494624,0.00025264584,0.00018187163,0.0003941939,0.00003201828],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013861424,0.00049701706,0.00096569327,0.00016727323,0.000061963554,0.000002121223,0.0025375343,0.5295378,0.45519093,0.0049885334,0.0011893236,0.0048479442],"study_design_scores_gemma":[0.0036404426,0.00017865215,0.011704024,0.0017592233,0.00008730081,0.000023544737,0.0005048629,0.10177093,0.8192495,0.041922245,0.016539095,0.0026201683],"about_ca_topic_score_codex":0.00010616706,"about_ca_topic_score_gemma":0.00011306195,"teacher_disagreement_score":0.4277669,"about_ca_system_score_codex":0.00033429955,"about_ca_system_score_gemma":0.000026009764,"threshold_uncertainty_score":0.8964684},"labels":[],"label_agreement":null},{"id":"W2128691106","doi":"10.1109/lcomm.2012.032612.112408","title":"Joint Optimal Threshold-Based Relaying and ML Detection in Cooperative Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Phase-shift keying; Computer science; Relay; Algorithm; Signal-to-noise ratio (imaging); Binary number; Bit error rate; Node (physics); Detector; Thresholding; Decoding methods; Joint (building); Mathematics; Telecommunications; Artificial intelligence; Physics","score_opus":0.058470119564286556,"score_gpt":0.2830607856514662,"score_spread":0.22459066608717965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128691106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17021859,0.0027250198,0.815386,0.010419894,0.00025043153,0.0003129943,6.5717103e-7,0.0001559031,0.0005305394],"genre_scores_gemma":[0.97431564,0.0008777978,0.02141583,0.003198292,0.00004767117,0.00011443108,0.0000063242455,0.00001400859,0.000010007971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848956,0.00047525315,0.000339143,0.00022735572,0.00012357086,0.00034513566],"domain_scores_gemma":[0.9974194,0.00029627973,0.00010990121,0.0019862938,0.0000788476,0.00010923292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000788431,0.0001685197,0.00017994935,0.00021322753,0.00056920963,0.00016690814,0.0012258289,0.00006741114,0.0000051475195],"category_scores_gemma":[0.000044587356,0.00017574121,0.000044688404,0.00072171295,0.00018703741,0.0008040757,0.000554846,0.00055012427,0.00001318818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065123284,0.0013584072,0.033505954,0.000042984448,0.00016554876,0.000009384627,0.014629846,0.42701712,0.20791797,0.07448515,0.004178858,0.23662364],"study_design_scores_gemma":[0.0005127885,0.000027183221,0.009518529,0.00006891291,0.0000071703153,0.0000108747245,0.00006570934,0.98349226,0.0032209118,0.000011258688,0.0027679517,0.0002964571],"about_ca_topic_score_codex":0.00001466077,"about_ca_topic_score_gemma":0.000111688234,"teacher_disagreement_score":0.80409706,"about_ca_system_score_codex":0.00013639704,"about_ca_system_score_gemma":0.000027510036,"threshold_uncertainty_score":0.71665186},"labels":[],"label_agreement":null},{"id":"W2128730223","doi":"10.1109/lcomm.2003.820094","title":"Cryptanalysis of scalable multicast security protocol","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Multicast; Computer network; Scalability; Collusion; Cryptanalysis; Protocol (science); Computer security; IP multicast; Xcast; Encryption; Operating system","score_opus":0.026952232434693687,"score_gpt":0.2964751144259913,"score_spread":0.2695228819912976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128730223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014597508,0.000085331914,0.95243305,0.0063908007,0.00014564715,0.01806816,0.00004560238,0.00026309473,0.007970801],"genre_scores_gemma":[0.71589893,0.000013102594,0.2733763,0.00080242293,0.000009425139,0.009880043,0.0000085167885,0.000008553154,0.000002716528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857837,0.0003679385,0.00036424623,0.00025216237,0.00022330761,0.00021396844],"domain_scores_gemma":[0.9951161,0.00021143995,0.00017102572,0.0043033394,0.000117114665,0.00008096912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048613924,0.00012452155,0.00019094748,0.00019708283,0.00024054603,0.000083473715,0.0026519608,0.000046210294,0.000030135125],"category_scores_gemma":[0.00008071463,0.00012476361,0.00014866778,0.0011519667,0.00027581237,0.00048239372,0.00027299314,0.00021559112,0.000026976506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014831978,0.0017708008,0.008834879,0.00012202631,0.00023347886,0.000004897243,0.0030432586,0.00020673375,0.040135644,0.9246167,0.016808188,0.004208587],"study_design_scores_gemma":[0.0049068728,0.00021592171,0.0063992594,0.00023056804,0.00021970597,0.000059649286,0.0004661027,0.09204615,0.11163469,0.060495812,0.7212209,0.0021043518],"about_ca_topic_score_codex":0.00007385963,"about_ca_topic_score_gemma":0.000050269726,"teacher_disagreement_score":0.86412084,"about_ca_system_score_codex":0.000025068879,"about_ca_system_score_gemma":0.000040379306,"threshold_uncertainty_score":0.50877124},"labels":[],"label_agreement":null},{"id":"W2128898597","doi":"10.1109/lcomm.2006.06432","title":"A general combinatorial sphere decoder and its application","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Decoding methods; Theoretical computer science; Algorithm; Mathematical optimization; Mathematics","score_opus":0.008638400910580976,"score_gpt":0.21003532911912678,"score_spread":0.20139692820854582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128898597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98905253,0.0013180729,0.0048375293,0.00069874246,0.00038018226,0.00023339981,0.000008594493,0.0002606797,0.0032102708],"genre_scores_gemma":[0.99895453,0.000050281935,0.0005187674,0.00014574375,0.00012874063,0.000118467346,0.000027914668,0.000020553427,0.000035015804],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995006,0.00005851246,0.0001668077,0.000090767535,0.00006099051,0.00012235456],"domain_scores_gemma":[0.9992207,0.000047229503,0.000026695008,0.0006565441,0.000019336932,0.000029476245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000939284,0.00009405745,0.00009251611,0.000041116222,0.00013713447,0.00003037058,0.00032494974,0.00004917491,0.000005033846],"category_scores_gemma":[0.0000020347575,0.000105324514,0.000029556084,0.0001269876,0.000048026643,0.00009537303,0.00002836767,0.000118581775,0.00003067838],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008068285,0.00009189078,0.0017524036,0.00006652336,0.00007311715,0.000001358308,0.0003077714,0.01263903,0.6264904,0.337107,0.018645898,0.0028165183],"study_design_scores_gemma":[0.003975582,0.00005208301,0.024000527,0.00013263526,0.00018446658,0.00009646668,0.00021137149,0.431175,0.055420663,0.031742007,0.45087734,0.0021318702],"about_ca_topic_score_codex":0.000050815503,"about_ca_topic_score_gemma":0.00005567665,"teacher_disagreement_score":0.5710697,"about_ca_system_score_codex":0.000026566282,"about_ca_system_score_gemma":0.000003133817,"threshold_uncertainty_score":0.42950088},"labels":[],"label_agreement":null},{"id":"W2128924388","doi":"10.1109/lcomm.2012.111612.121941","title":"A New Solution for the SEP of MPSK","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Phase-shift keying; Gaussian; Bivariate analysis; Probability density function; Applied mathematics; Function (biology); Gaussian process; Mathematics; Computer science; Probability distribution; Algorithm; Statistics; Bit error rate; Physics; Decoding methods","score_opus":0.04167245821970374,"score_gpt":0.29366479127552303,"score_spread":0.2519923330558193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128924388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016141704,0.003524096,0.9878325,0.0055864085,0.00014176464,0.0003529782,0.0000094058805,0.00033011014,0.00060855155],"genre_scores_gemma":[0.78359115,0.000864837,0.21498689,0.00026273562,0.00004795556,0.00018681686,0.000012553106,0.000024049496,0.000023011075],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994673,0.000039859322,0.0002151966,0.0000433475,0.00006792038,0.0001663805],"domain_scores_gemma":[0.9972139,0.0005107656,0.00006367107,0.0021366097,0.000036829948,0.00003825111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019159308,0.00008476402,0.00009698164,0.00005808213,0.0001475295,0.000008713258,0.0011346203,0.000037710495,0.000007566597],"category_scores_gemma":[0.000025896334,0.00007616723,0.000065919965,0.00016486767,0.00010008486,0.00020724398,0.00008981954,0.00015397457,0.000008416424],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010750233,0.00009184341,0.0006006992,0.000074135576,0.0001781915,1.8569828e-8,0.0025917434,0.010307792,0.571631,0.018714292,0.13878806,0.25701144],"study_design_scores_gemma":[0.0007179584,0.000030224266,0.003896227,0.000120522236,0.00014296747,0.000008112155,0.00022286395,0.13628778,0.20575194,0.0012733142,0.6509207,0.0006274059],"about_ca_topic_score_codex":0.000034384393,"about_ca_topic_score_gemma":0.000017035341,"teacher_disagreement_score":0.781977,"about_ca_system_score_codex":0.000059865488,"about_ca_system_score_gemma":0.000008724263,"threshold_uncertainty_score":0.31060094},"labels":[],"label_agreement":null},{"id":"W2130325251","doi":"10.1109/lcomm.2012.072012.120989","title":"BER Analysis of Three-Phase XOR-and-Forward Relaying Using Alamouti STBC","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Space–time block code; Relay; Rayleigh fading; Computer science; Block code; Bit error rate; Phase-shift keying; Bitwise operation; Algorithm; Channel (broadcasting); Transmit diversity; Relay channel; Decoding methods; Fading; Telecommunications; Physics","score_opus":0.11645400058538272,"score_gpt":0.35553385086152733,"score_spread":0.23907985027614462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130325251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36728048,0.0025943203,0.62387544,0.005394938,0.00012762877,0.00016009087,0.0000050509034,0.00008576672,0.00047625753],"genre_scores_gemma":[0.91789865,0.000605913,0.08027109,0.0011496221,0.000023671015,0.000017150904,0.000012935126,0.000010536246,0.0000104561],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853206,0.0003510802,0.00044016316,0.00019653125,0.00019380018,0.00028638012],"domain_scores_gemma":[0.9956327,0.00041893453,0.00024542448,0.0034585958,0.0001238374,0.000120528675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007544926,0.00015354234,0.00030559703,0.0004600167,0.00050407765,0.000086015556,0.0021527603,0.00005061549,0.000016434415],"category_scores_gemma":[0.000048081918,0.00015712487,0.00014846344,0.0018183453,0.00023890349,0.0007183495,0.0009844803,0.00026720777,0.000007713234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003153762,0.0018373491,0.19843568,0.000052959633,0.004992265,0.0000026163784,0.024211904,0.009552839,0.30839813,0.19627124,0.0037297895,0.2524837],"study_design_scores_gemma":[0.00072731025,0.000027103695,0.022881187,0.00006485283,0.0007673878,0.000009062726,0.00011452599,0.9640839,0.0017482067,0.00008526249,0.008994832,0.00049634674],"about_ca_topic_score_codex":0.000043042866,"about_ca_topic_score_gemma":0.00008345122,"teacher_disagreement_score":0.9545311,"about_ca_system_score_codex":0.000076240874,"about_ca_system_score_gemma":0.000027200867,"threshold_uncertainty_score":0.6407366},"labels":[],"label_agreement":null},{"id":"W2130371801","doi":"10.1109/lcomm.2010.111910.101902","title":"Performance Analysis of Wireless Systems from the MGF of the Reciprocal of the Signal-to-Noise Ratio","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reciprocal; Fading; Bit error rate; Wireless; Signal-to-noise ratio (imaging); Computer science; Moment-generating function; Probability of error; Algorithm; Mathematics; Applied mathematics; Topology (electrical circuits); Probability density function; Telecommunications; Statistics; Combinatorics; Decoding methods","score_opus":0.03266951009892366,"score_gpt":0.26018275821849657,"score_spread":0.2275132481195729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130371801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9484919,0.00020416094,0.030769145,0.019546434,0.00031930584,0.00038620803,0.000018708677,0.000017810413,0.0002463438],"genre_scores_gemma":[0.99709326,0.00016857675,0.0016085446,0.0010222475,0.000020569883,0.000048278842,0.0000039819597,0.0000061866604,0.000028334043],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818087,0.00071344484,0.0005225167,0.00015615243,0.0003069208,0.00012012361],"domain_scores_gemma":[0.99151623,0.0010217418,0.0004519355,0.006681333,0.0002986342,0.000030147301],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006873173,0.00011045732,0.0002520074,0.00009206663,0.00046230401,0.000048152542,0.008708681,0.00004244317,0.000007345831],"category_scores_gemma":[0.00005947433,0.00006203978,0.00018638397,0.0023300194,0.0004900803,0.00014485093,0.0012632511,0.0004096061,0.0000025155216],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010844686,0.00017942302,0.05316939,0.000015964513,0.00055572524,3.9601638e-8,0.009227031,0.031150449,0.87317747,0.016758265,0.0027912683,0.012964152],"study_design_scores_gemma":[0.00019919219,0.000017466078,0.18327437,0.00015904295,0.00023133989,8.538906e-7,0.00015788598,0.7783405,0.034303036,0.000019268145,0.0031291188,0.00016788956],"about_ca_topic_score_codex":0.00017848218,"about_ca_topic_score_gemma":0.0006620761,"teacher_disagreement_score":0.8388744,"about_ca_system_score_codex":0.000024051726,"about_ca_system_score_gemma":0.00007932846,"threshold_uncertainty_score":0.9966547},"labels":[],"label_agreement":null},{"id":"W2130999595","doi":"10.1109/lcomm.2004.827449","title":"Performance Analysis of M-PAM Signaling With Tomlinson–Harashima Precoding Over ISI Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Precoding; Intersymbol interference; Computer science; Interference (communication); Zero-forcing precoding; Symbol (formal); Algorithm; Pulse-amplitude modulation; Telecommunications; Modulation (music); Control theory (sociology); Electronic engineering; Mathematics; MIMO; Channel (broadcasting); Pulse (music); Physics; Artificial intelligence; Engineering; Acoustics","score_opus":0.020765398589498,"score_gpt":0.25639608974730116,"score_spread":0.23563069115780316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130999595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85492396,0.00030360138,0.1429556,0.00050761783,0.000039813523,0.0002024684,0.0000132782225,0.0005029474,0.0005507311],"genre_scores_gemma":[0.928114,0.0010122143,0.070477635,0.00017235854,0.000014102394,0.00011505358,0.000046952144,0.000042569984,0.000005108182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989875,0.000048869853,0.0004090423,0.00015579199,0.00017949993,0.00021932348],"domain_scores_gemma":[0.9970779,0.00015217556,0.0001471391,0.0024862671,0.00008571679,0.00005081541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017071704,0.00018877418,0.00032001015,0.0005186724,0.00019705728,0.00003016232,0.0013281114,0.000060140796,0.000013831758],"category_scores_gemma":[0.000009968573,0.0001979075,0.00010466721,0.001502253,0.00017775185,0.00039784322,0.00010743794,0.0003072094,0.000005642943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056809668,0.00004222105,0.0023238384,0.00003249264,0.00040430418,3.11718e-7,0.000739686,0.90049297,0.093522124,0.00022990395,0.000034133973,0.002172331],"study_design_scores_gemma":[0.0010460181,0.000094552845,0.01210517,0.0006198717,0.00086476386,0.0000065647628,0.00021471905,0.41248563,0.5685887,0.00009430383,0.0027923184,0.0010874025],"about_ca_topic_score_codex":0.00003100908,"about_ca_topic_score_gemma":0.000048387796,"teacher_disagreement_score":0.48800734,"about_ca_system_score_codex":0.0001819132,"about_ca_system_score_gemma":0.000013970489,"threshold_uncertainty_score":0.8070434},"labels":[],"label_agreement":null},{"id":"W2131239166","doi":"10.1109/lcomm.2006.060570","title":"Stochastic decoding of LDPC codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Berlekamp–Welch algorithm; Algorithm; Factor graph; List decoding; Sequential decoding; Code (set theory); Throughput; Theoretical computer science; Concatenated error correction code; Error floor; Block code; Telecommunications; Wireless","score_opus":0.029272283280820148,"score_gpt":0.2840308639770852,"score_spread":0.25475858069626506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131239166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061376292,0.00014209641,0.93120754,0.0050906832,0.00014863769,0.00012473675,0.0000019161675,0.0004608367,0.0014472557],"genre_scores_gemma":[0.7457871,0.000005877932,0.25378335,0.00035513157,0.000016297232,0.000023576604,0.0000025528245,0.000007828023,0.000018303333],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990972,0.00011776501,0.00029064016,0.00017098352,0.00015400017,0.00016940084],"domain_scores_gemma":[0.99675566,0.000450228,0.00017277164,0.0025157838,0.00008115445,0.000024410616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029016743,0.000099207755,0.00013869566,0.00017851844,0.00017055687,0.00005089707,0.0028820545,0.000033711927,0.0000016815845],"category_scores_gemma":[0.000047277877,0.00010905904,0.00006216306,0.00041198215,0.0001546331,0.00024119377,0.00036658917,0.00017090482,0.000013446566],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006079799,0.0004375806,0.004067803,0.000044372988,0.000054486078,0.0000049971286,0.0018674906,0.008934187,0.7647808,0.15685554,0.038984057,0.023962611],"study_design_scores_gemma":[0.0012032256,0.0002007886,0.013679189,0.0007383364,0.00010362489,0.00015144222,0.0001787322,0.6786799,0.26295868,0.032672,0.0073963804,0.0020377396],"about_ca_topic_score_codex":0.00032415075,"about_ca_topic_score_gemma":0.00012826583,"teacher_disagreement_score":0.6844108,"about_ca_system_score_codex":0.000057826317,"about_ca_system_score_gemma":0.000025894344,"threshold_uncertainty_score":0.5355622},"labels":[],"label_agreement":null},{"id":"W2131499054","doi":"10.1109/4234.824751","title":"Comparison of four SNR estimators for QPSK modulations","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences; Queen's University","funders":"","keywords":"Phase-shift keying; Estimator; Signal-to-noise ratio (imaging); Keying; Statistics; Computer science; Algorithm; Mathematics; Bit error rate; Telecommunications; Decoding methods","score_opus":0.0643241708514943,"score_gpt":0.3480600403440812,"score_spread":0.2837358694925869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131499054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20883955,0.0008306357,0.7808556,0.0033877671,0.00010566566,0.0008656093,0.00008342609,0.001361022,0.0036707283],"genre_scores_gemma":[0.7634566,0.00025907243,0.23576817,0.00011014716,0.00001172222,0.00026920045,0.000057589226,0.000037975413,0.000029507986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990996,0.000052597807,0.00047044412,0.00010606007,0.000100577876,0.00017068083],"domain_scores_gemma":[0.9969969,0.0003689904,0.000082003906,0.0024383783,0.00006914036,0.00004461541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010477498,0.00014060411,0.000239312,0.00013361634,0.00019257967,0.00001658676,0.0012247212,0.0000627984,0.000037225218],"category_scores_gemma":[0.000022149403,0.0001705396,0.00009172634,0.000269912,0.00017904767,0.00019273923,0.000045185832,0.00020064418,0.000020489186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012252515,0.00021146894,0.0023036785,0.00010010617,0.000117365445,1.3061185e-7,0.0011671394,0.75535864,0.09688994,0.0045585297,0.020617573,0.118663184],"study_design_scores_gemma":[0.0004096713,0.00002948484,0.0018940611,0.000096975484,0.000046399076,0.0000029341008,0.000070090675,0.8767727,0.04651061,0.001385473,0.07235571,0.00042586197],"about_ca_topic_score_codex":0.00001148952,"about_ca_topic_score_gemma":0.00001770428,"teacher_disagreement_score":0.55461705,"about_ca_system_score_codex":0.00007180576,"about_ca_system_score_gemma":0.000009474493,"threshold_uncertainty_score":0.6954403},"labels":[],"label_agreement":null},{"id":"W2131955292","doi":"10.1109/lcomm.2011.031411.101672","title":"A QoE-Oriented Strategy for OFDMA Radio Resource Allocation Based on Min-MOS Maximization","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Maximization; Resource allocation; Novelty; Resource management (computing); Resource (disambiguation); Computer network; Mathematical optimization","score_opus":0.04031740105178782,"score_gpt":0.24239542213875495,"score_spread":0.20207802108696712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131955292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073018484,0.00013838764,0.98836106,0.0012671361,0.00018949111,0.00076748704,0.000028811788,0.000534076,0.0014116935],"genre_scores_gemma":[0.8771162,0.00014299034,0.12040667,0.0008401233,0.000076622804,0.00071256346,0.00056022516,0.00010018767,0.000044386783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989805,0.00009126263,0.0003355457,0.00020817194,0.00013432816,0.0002501771],"domain_scores_gemma":[0.99813396,0.00019625216,0.00010904212,0.0013972583,0.00009863025,0.00006486745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013486945,0.00020073488,0.00016125254,0.00019359156,0.00021611399,0.000026102238,0.0005514538,0.00009477955,0.000019612016],"category_scores_gemma":[0.000031039537,0.00023875573,0.00006628064,0.0004299067,0.000086627966,0.00020806736,0.000021538219,0.00018567863,0.0000131420675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003519718,0.00007426873,0.000088807225,0.000024419662,0.000026606298,2.742963e-7,0.0002822445,0.9852528,0.003751391,0.00073252455,0.0042000636,0.005531426],"study_design_scores_gemma":[0.0006049604,0.00004004534,0.00032675732,0.00006860463,0.000035236037,7.7998016e-7,0.000049191884,0.9870017,0.004034127,0.000041713538,0.0075433645,0.0002534729],"about_ca_topic_score_codex":0.00000943941,"about_ca_topic_score_gemma":0.00001890579,"teacher_disagreement_score":0.8698144,"about_ca_system_score_codex":0.00016521459,"about_ca_system_score_gemma":0.000018429366,"threshold_uncertainty_score":0.9736176},"labels":[],"label_agreement":null},{"id":"W2132274836","doi":"10.1109/lcomm.2005.1506716","title":"Optimum power allocation for a V-BLAST system with two antennas at the transmitter","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Transmitter; Probability of error; Computer science; Propagation of uncertainty; Realization (probability); Power (physics); Outage probability; Channel (broadcasting); Topology (electrical circuits); Electronic engineering; Telecommunications; Mathematics; Algorithm; Physics; Fading; Statistics; Engineering","score_opus":0.014924807697328691,"score_gpt":0.25131819187152676,"score_spread":0.23639338417419808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132274836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033864032,0.000824891,0.9190535,0.041309785,0.000075898184,0.0011954027,0.000034051427,0.0013793178,0.0022631069],"genre_scores_gemma":[0.90491986,0.00017133326,0.091809034,0.0017340771,0.000037207134,0.0011300028,0.00005173154,0.00007344768,0.00007328268],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905324,0.00008730343,0.00032082232,0.00015739376,0.00013474117,0.0002464942],"domain_scores_gemma":[0.99643666,0.0002952576,0.00008202507,0.0030425494,0.00009751423,0.000046003748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019931534,0.00019917234,0.00016537259,0.00009237432,0.00042116293,0.00004842133,0.0014442463,0.00004828111,0.000009427761],"category_scores_gemma":[0.0000051105117,0.0001585455,0.000077068136,0.00022230558,0.00024009838,0.0002679732,0.00007929262,0.00025547345,0.000044415767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013851498,0.00023233239,0.00020104491,0.00023704031,0.0005034416,0.0000014412785,0.0059470525,0.4195311,0.463172,0.013682034,0.062882856,0.033471137],"study_design_scores_gemma":[0.0024641266,0.000102001286,0.00042914262,0.000502293,0.00014647743,0.00011222377,0.00094986364,0.47099635,0.11546902,0.0000682414,0.40747142,0.0012888423],"about_ca_topic_score_codex":0.000009844945,"about_ca_topic_score_gemma":0.00022096024,"teacher_disagreement_score":0.87105584,"about_ca_system_score_codex":0.0003534835,"about_ca_system_score_gemma":0.000013127266,"threshold_uncertainty_score":0.6465298},"labels":[],"label_agreement":null},{"id":"W2132861470","doi":"10.1109/lcomm.2008.081335","title":"Cryptanalysis of the parameterized improved fast encryption algorithm for multimedia","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Parameterized complexity; Block cipher; Differential cryptanalysis; Encryption; Cryptanalysis; Cipher; Algorithm; Advanced Encryption Standard; Linear cryptanalysis; Cryptography; Computational complexity theory; Theoretical computer science; Computer network","score_opus":0.03265020932997684,"score_gpt":0.2626054062503536,"score_spread":0.22995519692037678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132861470","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028831523,0.00006854798,0.9628006,0.0073448243,0.00026266385,0.00053256244,0.000026262029,0.00010147626,0.000031532094],"genre_scores_gemma":[0.34596077,0.000063494714,0.65257496,0.0011037647,0.00003700461,0.00019377797,0.000021351183,0.000013618359,0.000031303407],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847996,0.0002754665,0.00046089324,0.00028694887,0.00026115394,0.00023554623],"domain_scores_gemma":[0.99556434,0.00057805085,0.0003604338,0.003218229,0.00021959895,0.00005932774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003502463,0.0001645066,0.0002377563,0.00016935545,0.00045326987,0.000046121608,0.0030745745,0.00005990617,0.0000049836594],"category_scores_gemma":[0.00011211161,0.00013868554,0.0003025113,0.00075852114,0.00041668527,0.00042732302,0.0003180089,0.00020608444,0.000012593827],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083610375,0.00015866332,0.00009581838,0.000009733794,0.00008355727,5.399103e-7,0.0010150112,0.00034860554,0.91317296,0.0001939459,0.0012925138,0.083620265],"study_design_scores_gemma":[0.0008592263,0.000038681297,0.001758618,0.000021254351,0.000051698793,0.000012010989,0.000024962757,0.9533,0.042381547,0.00021672627,0.0011325722,0.00020271516],"about_ca_topic_score_codex":0.00012744084,"about_ca_topic_score_gemma":0.000017281038,"teacher_disagreement_score":0.9529514,"about_ca_system_score_codex":0.00010957448,"about_ca_system_score_gemma":0.000078874866,"threshold_uncertainty_score":0.5713375},"labels":[],"label_agreement":null},{"id":"W2133071357","doi":"10.1109/lcomm.2006.1576565","title":"Rateless coding over fading channels","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fading; Computer science; Fountain code; Channel state information; Transmitter; Robustness (evolution); Coding (social sciences); Forward error correction; Computer network; Channel (broadcasting); Decoding methods; Binary erasure channel; Algorithm; Theoretical computer science; Channel capacity; Telecommunications; Block code; Wireless; Concatenated error correction code; Mathematics; Statistics","score_opus":0.03528169430475773,"score_gpt":0.2894447272929726,"score_spread":0.25416303298821485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133071357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109646715,0.00011905649,0.87300265,0.011422907,0.00064182264,0.00019958113,0.0000013517258,0.0012982726,0.003667626],"genre_scores_gemma":[0.90904206,0.000022123986,0.088997535,0.001692136,0.00008059919,0.000055493183,0.000004871734,0.000016819946,0.00008833203],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883837,0.00016348327,0.00026799852,0.00026632095,0.00017956622,0.0002842438],"domain_scores_gemma":[0.99677515,0.0002884808,0.00013912942,0.0026990685,0.000060304796,0.000037850496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036324575,0.0001434963,0.00014208005,0.0002076546,0.0004104698,0.00024088836,0.0033533939,0.00004975351,0.0000034997963],"category_scores_gemma":[0.000022953422,0.00016041665,0.00007107216,0.00055017177,0.00010256963,0.0005222591,0.00051689806,0.00028320725,0.000041177285],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004256498,0.00027534502,0.005099367,0.000033493456,0.00004728134,0.000026451708,0.0027823213,0.003824314,0.70972335,0.1447831,0.11597817,0.01742257],"study_design_scores_gemma":[0.0012866848,0.00009613397,0.009716863,0.00057068805,0.000052694675,0.00018365285,0.00012770793,0.5323104,0.34606332,0.014828357,0.092048414,0.0027150735],"about_ca_topic_score_codex":0.00032881033,"about_ca_topic_score_gemma":0.00005906543,"teacher_disagreement_score":0.7993954,"about_ca_system_score_codex":0.00012360764,"about_ca_system_score_gemma":0.000021182785,"threshold_uncertainty_score":0.6541601},"labels":[],"label_agreement":null},{"id":"W2133621140","doi":"10.1109/lcomm.2005.1437356","title":"An approximate maximum likelihood estimator for SNR jointly using pilot and data symbols","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Computer science; Algorithm; Signal-to-noise ratio (imaging); Binary number; Binary data; Maximum likelihood; Frame (networking); Minimax estimator; Statistics; Phase-shift keying; Minimum-variance unbiased estimator; Mathematics; Bit error rate; Telecommunications; Decoding methods","score_opus":0.09703711736270326,"score_gpt":0.3518302817827887,"score_spread":0.2547931644200854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133621140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041901167,0.0013024256,0.95037615,0.003927829,0.000064764165,0.0007813262,0.000186346,0.0012867075,0.00017329262],"genre_scores_gemma":[0.4611114,0.00047505973,0.5375658,0.00040943793,0.000040756073,0.00013876526,0.0001942578,0.0000631675,0.0000013265377],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885106,0.0000805199,0.00039420536,0.00027075058,0.000102414866,0.00030103177],"domain_scores_gemma":[0.99301445,0.00020558771,0.00009241627,0.0065199016,0.000059463706,0.000108203654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032443888,0.00021820853,0.00022891344,0.00015025643,0.00036761258,0.00011006015,0.0027567989,0.000059812923,0.0000036728259],"category_scores_gemma":[0.00003235879,0.00025875453,0.000028334967,0.00016899135,0.00019712352,0.0010012031,0.00041991577,0.00028331115,0.000006543995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022732684,0.00033905375,0.00020491524,0.00018892108,0.00012742217,6.116918e-7,0.0005816205,0.025392301,0.83186644,0.0022859087,0.0068797846,0.1321103],"study_design_scores_gemma":[0.0003762254,0.000033411678,0.00007692219,0.00007716451,0.000042174233,0.000015550266,0.000059322796,0.9702066,0.0139010865,0.0010121227,0.013805437,0.00039395742],"about_ca_topic_score_codex":0.000019365209,"about_ca_topic_score_gemma":0.000045426637,"teacher_disagreement_score":0.9448143,"about_ca_system_score_codex":0.000112298876,"about_ca_system_score_gemma":0.000018195247,"threshold_uncertainty_score":0.99998647},"labels":[],"label_agreement":null},{"id":"W2134625654","doi":"10.1109/4234.846499","title":"Effective forward-channel capacity of non-dedicated CDPD networks","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Channel (broadcasting); Computer science; Channel capacity; Cellular network; Network packet; Telephone network; Telecommunications; Digital radio; Mobile telephone","score_opus":0.025654047313533712,"score_gpt":0.28019100714254386,"score_spread":0.25453695982901015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134625654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14733653,0.00046525276,0.8296343,0.01533913,0.00020360822,0.0011220741,0.00001023295,0.00034131683,0.0055475393],"genre_scores_gemma":[0.96700513,0.00089875795,0.03034589,0.0012514306,0.000054128122,0.0003105387,0.000023537845,0.000026575237,0.00008402372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972848,0.00087294646,0.0005446627,0.00037518537,0.00043296235,0.0004894184],"domain_scores_gemma":[0.9910454,0.0011030037,0.00021602162,0.0072248327,0.00023708545,0.0001736461],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008872214,0.00022764302,0.00034544864,0.00024033207,0.0004824616,0.00010725125,0.008454912,0.00013689944,0.00003762784],"category_scores_gemma":[0.000045962963,0.00023792856,0.00016464308,0.0014890154,0.0007136365,0.0005495166,0.00085026026,0.0008225129,0.000116167525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012355222,0.0020990793,0.0016872335,0.00012292643,0.00084397424,0.000011841832,0.011659232,0.34167182,0.04320765,0.011027477,0.062073562,0.5254716],"study_design_scores_gemma":[0.0006415946,0.00006496918,0.0050399965,0.0001080881,0.000016685575,0.00001177325,0.00002653971,0.98565096,0.0017225731,0.0003030604,0.006070403,0.00034334938],"about_ca_topic_score_codex":0.00026607706,"about_ca_topic_score_gemma":0.00006676317,"teacher_disagreement_score":0.8196686,"about_ca_system_score_codex":0.00013046192,"about_ca_system_score_gemma":0.000055607332,"threshold_uncertainty_score":0.9969098},"labels":[],"label_agreement":null},{"id":"W2135626675","doi":"10.1109/lcomm.2010.08.100548","title":"Trapping Sets of Fountain Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Binary erasure channel; Low-density parity-check code; Computer science; Luby transform code; Raptor code; Decoding methods; Tornado code; Online codes; Binary number; Erasure; Fountain; Trapping; Algorithm; Channel (broadcasting); Theoretical computer science; Mathematics; Channel capacity; Error floor; Arithmetic; Telecommunications; Biology","score_opus":0.0342706017425371,"score_gpt":0.30884369090483943,"score_spread":0.27457308916230233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135626675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38347483,0.0000507723,0.5910037,0.021208491,0.00049663655,0.00021679724,0.000003051107,0.0007221236,0.0028235707],"genre_scores_gemma":[0.710949,0.000011868828,0.28813797,0.00084957405,0.00001066387,0.000024443598,0.0000017347228,0.000007138052,0.0000075735884],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991529,0.000120112294,0.00024975956,0.0001710584,0.00014569677,0.00016046151],"domain_scores_gemma":[0.99596775,0.0003824019,0.00015125175,0.0033758148,0.00008414265,0.000038644062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047704365,0.00009574972,0.00012994208,0.00016237547,0.00017030934,0.00005153404,0.0037461866,0.000050477956,0.0000033410483],"category_scores_gemma":[0.000077246055,0.00010373517,0.000064153945,0.00038096233,0.00020542032,0.0002841704,0.000354705,0.0004072091,0.000011653781],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010389672,0.00007220047,0.0016417141,0.000010026862,0.000016191241,0.0000010446055,0.0015479287,0.000019554755,0.95481825,0.017700996,0.004669917,0.019501165],"study_design_scores_gemma":[0.0008904586,0.00016237726,0.018750584,0.00032109406,0.00005688897,0.00018420153,0.00029332042,0.14716193,0.7643055,0.013578849,0.052679602,0.0016152052],"about_ca_topic_score_codex":0.00011685467,"about_ca_topic_score_gemma":0.0002026675,"teacher_disagreement_score":0.32747418,"about_ca_system_score_codex":0.000021231685,"about_ca_system_score_gemma":0.000034526787,"threshold_uncertainty_score":0.6961409},"labels":[],"label_agreement":null},{"id":"W2135885202","doi":"10.1109/lcomm.2005.05011","title":"A tabu search heuristic for the routing and wavelength assignment problem in optical networks","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Routing and wavelength assignment; Heuristic; Computer science; Routing (electronic design automation); Mathematical optimization; Blocking (statistics); Guided Local Search; Set (abstract data type); Wavelength-division multiplexing; Local search (optimization); Algorithm; Mathematics; Wavelength; Computer network","score_opus":0.024577168069845744,"score_gpt":0.2628061420187564,"score_spread":0.23822897394891066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135885202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031006483,0.0013843428,0.9401356,0.0259047,0.00005745286,0.00079355075,0.000003184941,0.00037975435,0.00033496172],"genre_scores_gemma":[0.7913355,0.00077556545,0.20730905,0.00026397142,0.00004541914,0.00024070308,0.0000032311793,0.000021481721,0.0000050506055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921346,0.000028822109,0.00022851051,0.00012363818,0.00007683308,0.00032874648],"domain_scores_gemma":[0.9978468,0.0012934299,0.000017806851,0.0007936215,0.000015726433,0.00003264356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027008948,0.00011395341,0.0001201507,0.00004859365,0.00016930117,0.00004139613,0.00058809423,0.000063907624,0.0000011906681],"category_scores_gemma":[0.000049415317,0.00009553215,0.000025724894,0.00018569586,0.00024211778,0.00008242465,0.00016267765,0.00049093185,0.0000030694366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003364192,0.000020236906,0.00014761742,0.000010367047,0.000019795216,4.2877963e-7,0.00016599511,0.8861085,0.00048207724,0.00494677,0.00053158804,0.10756322],"study_design_scores_gemma":[0.00020696342,0.000010194482,0.00056454376,0.000036323014,0.000010750985,0.0000031293032,0.00012872438,0.99598944,0.00006466224,0.00015648651,0.0027108162,0.00011799231],"about_ca_topic_score_codex":0.0000031800669,"about_ca_topic_score_gemma":0.00002956915,"teacher_disagreement_score":0.76032907,"about_ca_system_score_codex":0.0001283106,"about_ca_system_score_gemma":0.0000047894778,"threshold_uncertainty_score":0.3895688},"labels":[],"label_agreement":null},{"id":"W2136379375","doi":"10.1109/lcomm.2006.1638618","title":"Impact of receive diversity on the performance of amplify-and-forward relaying under APS and IPS power constraints","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Terminal (telecommunication); Power (physics); Diversity gain; Mode (computer interface); Diversity combining; Scaling; Telecommunications; Topology (electrical circuits); Mathematics; Fading; Physics; Decoding methods; Combinatorics","score_opus":0.045405994252301164,"score_gpt":0.2777678915224783,"score_spread":0.23236189727017717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136379375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848417,0.00024887713,0.006928055,0.0063769026,0.00003132256,0.00014812428,0.0000059353506,0.0000240208,0.0013950758],"genre_scores_gemma":[0.99614936,0.0007426364,0.0024822517,0.00059719814,0.000004504388,0.0000056279814,0.0000031355019,0.0000042987635,0.000010956634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991314,0.0002601256,0.00022349064,0.00013593453,0.00012783892,0.00012124376],"domain_scores_gemma":[0.9974487,0.00070231827,0.00017601547,0.0015441797,0.00009813557,0.000030683263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040219945,0.000102107944,0.00014270474,0.0000866572,0.0005886517,0.00003694147,0.0013295726,0.000033651017,0.000008729843],"category_scores_gemma":[0.000023724931,0.000078254096,0.000051733674,0.00026906838,0.00069497543,0.0001953478,0.00097216316,0.00024759077,0.0000025383306],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009015024,0.00071904453,0.37640288,0.00005281198,0.0005260051,0.000001492364,0.015633196,0.007164476,0.107082516,0.43769613,0.0115809655,0.043050334],"study_design_scores_gemma":[0.0009304851,0.00027127788,0.9649056,0.00026707829,0.000038730563,0.000021105998,0.00032555062,0.029137312,0.0022967395,0.0007324222,0.0006319954,0.00044170217],"about_ca_topic_score_codex":0.000060080736,"about_ca_topic_score_gemma":0.000019297886,"teacher_disagreement_score":0.5885027,"about_ca_system_score_codex":0.00004626354,"about_ca_system_score_gemma":0.000025916654,"threshold_uncertainty_score":0.45274925},"labels":[],"label_agreement":null},{"id":"W2137526725","doi":"10.1109/4234.991144","title":"New compound upper bound on MIMO channel capacity","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; University of Ottawa","funders":"","keywords":"MIMO; Channel capacity; Upper and lower bounds; Channel (broadcasting); Ergodic theory; Precoding; Computer science; Spatial correlation; Capacity loss; Mathematics; Reduction (mathematics); Telecommunications; Topology (electrical circuits); Physics; Combinatorics; Mathematical analysis","score_opus":0.04479898048445852,"score_gpt":0.2388109162698474,"score_spread":0.1940119357853889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137526725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079189174,0.0015715327,0.8625953,0.01761195,0.0020576923,0.0009910569,0.000049323175,0.0018840072,0.03404997],"genre_scores_gemma":[0.974624,0.0002590186,0.023381367,0.0011438208,0.0001390332,0.00004822906,0.000024662097,0.00006215358,0.00031775635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999218,0.00005760099,0.000246296,0.0001434836,0.00010779363,0.000226841],"domain_scores_gemma":[0.9980675,0.00011752717,0.00004804596,0.0016486453,0.000028864444,0.00008944549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060940496,0.00017151306,0.00015570613,0.00012960301,0.0002127742,0.00005648383,0.0006406229,0.00006522317,0.000057959318],"category_scores_gemma":[0.000014461445,0.00019886713,0.00005647895,0.00023506039,0.00007603731,0.00022901999,0.00003631227,0.00027932122,0.00045050657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027471483,0.000071902425,0.00008301167,0.000033322438,0.000080553684,0.000001995308,0.0017921743,0.7987886,0.020037407,0.00096926367,0.1760343,0.0021046933],"study_design_scores_gemma":[0.0013878986,0.000049241662,0.00038135212,0.00024662845,0.000055252272,0.000049436345,0.0001479831,0.82845354,0.0057034157,0.0004021619,0.1619455,0.0011775972],"about_ca_topic_score_codex":0.000054209668,"about_ca_topic_score_gemma":0.00005576243,"teacher_disagreement_score":0.8954348,"about_ca_system_score_codex":0.00018361217,"about_ca_system_score_gemma":0.000003550993,"threshold_uncertainty_score":0.8109566},"labels":[],"label_agreement":null},{"id":"W2139435153","doi":"10.1109/lcomm.2008.071513","title":"Non-Coherent Mutual Information of Multipath Rician Fading Channels in the Low SNR Regime","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rician fading; Fading; Fading distribution; Multipath propagation; Channel state information; Rayleigh fading; Computer science; Mutual information; Channel (broadcasting); Telecommunications; Algorithm; Electronic engineering; Wireless; Engineering; Artificial intelligence","score_opus":0.025304638038225618,"score_gpt":0.2510603076440834,"score_spread":0.22575566960585777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139435153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85467386,0.00041331883,0.1355762,0.0034747983,0.0001850339,0.0010475022,0.000019411775,0.0004973367,0.0041125375],"genre_scores_gemma":[0.9867343,0.0009848634,0.011374352,0.0005565959,0.000016319762,0.0002585906,0.000050681447,0.00001941018,0.000004911806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899733,0.00010087174,0.00047882606,0.00006971698,0.00016974827,0.00018352446],"domain_scores_gemma":[0.99733126,0.00022740735,0.00013593181,0.0022238132,0.00005632904,0.000025236648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023421709,0.00014233646,0.00017559627,0.00026619545,0.00017119972,0.000017562546,0.0017531463,0.000063553925,0.0000028808913],"category_scores_gemma":[0.000029228695,0.00013503291,0.000058613303,0.00048749612,0.00020058859,0.0005766887,0.00011128303,0.00040813393,0.000025579753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039488903,0.000680032,0.0049658893,0.0003908712,0.0001720255,0.000009016756,0.14875792,0.55433196,0.19604908,0.0034541273,0.034665853,0.056483764],"study_design_scores_gemma":[0.0025185815,0.00011806525,0.020170428,0.0010025449,0.000046383982,0.00009514037,0.0043336456,0.739714,0.16758904,0.0004460857,0.062261634,0.0017044238],"about_ca_topic_score_codex":0.000063972664,"about_ca_topic_score_gemma":0.00002525683,"teacher_disagreement_score":0.18538208,"about_ca_system_score_codex":0.00011451705,"about_ca_system_score_gemma":0.000012688992,"threshold_uncertainty_score":0.5506482},"labels":[],"label_agreement":null},{"id":"W2139699600","doi":"10.1109/lcomm.2004.837657","title":"Highly Accurate Simple Closed-Form Approximations to Lognormal Sum Distributions and Densities","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Log-normal distribution; Mathematics; Random variable; Applied mathematics; Simple (philosophy); Probability distribution; Closed-form expression; Distribution (mathematics); Statistical physics; Statistics; Mathematical analysis; Physics","score_opus":0.031548846296782895,"score_gpt":0.25211255857736004,"score_spread":0.22056371228057714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139699600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40556964,0.00010250506,0.5873657,0.006071495,0.0000799008,0.0001977754,0.000084164145,0.00023453831,0.00029427154],"genre_scores_gemma":[0.9755145,0.00015373042,0.022838151,0.0010904212,0.000035657005,0.000109288645,0.00022406384,0.000023889577,0.000010336002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992245,0.000029099001,0.0002816971,0.00012809905,0.00009733064,0.00023930735],"domain_scores_gemma":[0.9989115,0.000069691625,0.000032614953,0.0008054439,0.0000662537,0.00011449985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118453165,0.00014556498,0.00012893384,0.00014444429,0.00041221734,0.00009955263,0.00034873435,0.000047348258,0.000006305999],"category_scores_gemma":[0.000025502986,0.00016121774,0.00004436831,0.00023281129,0.00009644319,0.0002710092,0.00010503457,0.00020015988,0.00004789062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013342024,0.00016545861,0.00029993462,0.00014075644,0.00022600866,0.000004624662,0.007126002,0.4944165,0.4612886,0.015368709,0.011133088,0.009816976],"study_design_scores_gemma":[0.0044446355,0.00018479725,0.008780435,0.0004052259,0.00041245655,0.00018424545,0.0028843763,0.60042703,0.28692275,0.013842998,0.077714205,0.0037968182],"about_ca_topic_score_codex":0.000059721995,"about_ca_topic_score_gemma":0.00016945731,"teacher_disagreement_score":0.5699448,"about_ca_system_score_codex":0.00012904493,"about_ca_system_score_gemma":0.000019152922,"threshold_uncertainty_score":0.6574269},"labels":[],"label_agreement":null},{"id":"W2140138271","doi":"10.1109/4234.823539","title":"Worst-case performance of a buffer with independent shaped arrival processes","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous Transfer Mode; Computer network; Quality of service; Byte; Asynchronous communication; Network packet; Internet traffic; Buffer overflow; Bandwidth (computing); Buffer (optical fiber); Distributed computing; The Internet; Telecommunications","score_opus":0.016391208593807258,"score_gpt":0.2234987777729246,"score_spread":0.20710756917911732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140138271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9083123,0.00026482073,0.082401514,0.0077329655,0.000054583536,0.00024287883,0.0000025783759,0.00015788112,0.00083045283],"genre_scores_gemma":[0.9839026,0.00014683233,0.014398347,0.0013249652,0.000029753617,0.000079400044,0.0000026509974,0.000009180222,0.000106294705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907386,0.00007711744,0.00024056435,0.00020732904,0.00020659892,0.00019450422],"domain_scores_gemma":[0.99787253,0.00016769792,0.00009900493,0.0016830346,0.00011257651,0.00006513642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015151409,0.00012669127,0.00015016954,0.000073573145,0.00022568539,0.00006645054,0.0016980403,0.00003433885,0.000033328128],"category_scores_gemma":[0.000006357667,0.00010879471,0.000033020915,0.000504978,0.00017761912,0.0003879517,0.000080373684,0.0002027406,0.000040756033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023913821,0.00084263843,0.005742678,0.00015561774,0.0002769036,0.00018223922,0.0049361233,0.022588247,0.0027059785,0.005336476,0.0023025759,0.9546914],"study_design_scores_gemma":[0.0042114635,0.0006107675,0.0050538466,0.00055704144,0.00014991013,0.0025428925,0.0001754072,0.9625369,0.0015176899,0.00014246679,0.021157125,0.0013445346],"about_ca_topic_score_codex":0.000022123373,"about_ca_topic_score_gemma":0.00006893953,"teacher_disagreement_score":0.95334685,"about_ca_system_score_codex":0.000023334644,"about_ca_system_score_gemma":0.00009077828,"threshold_uncertainty_score":0.44365194},"labels":[],"label_agreement":null},{"id":"W2140824304","doi":"10.1109/lcomm.2009.081457","title":"COVQ for MAP hard-decision demodulated channels","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Maximum a posteriori estimation; Demodulation; Rayleigh fading; Algorithm; Channel (broadcasting); Computer science; Decoding methods; Phase-shift keying; Additive white Gaussian noise; Fading; Mathematics; Maximum likelihood; Telecommunications; Statistics; Bit error rate","score_opus":0.03210266269810044,"score_gpt":0.29000529196823815,"score_spread":0.25790262927013774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140824304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023489743,0.0010829224,0.9590989,0.0127117345,0.00030842132,0.00074721803,0.000026336636,0.002062524,0.00047224746],"genre_scores_gemma":[0.7471805,0.0006493174,0.25024432,0.0015311011,0.00003976777,0.00019315115,0.00008577012,0.000042167554,0.000033868484],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.999043,0.000050834005,0.00037053062,0.00016081853,0.00011729849,0.00025754518],"domain_scores_gemma":[0.99631304,0.0003374732,0.00006781142,0.0031223858,0.00009245361,0.0000668263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018483103,0.00018761665,0.00020507899,0.00018389225,0.0002631543,0.00005352743,0.0017245488,0.00009515816,0.0000071744194],"category_scores_gemma":[0.000037656166,0.00021664625,0.00009808362,0.00025806052,0.000088592205,0.00026658815,0.000071737275,0.00027919427,0.000048136808],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031054667,0.00017059037,0.00004177256,0.000042626114,0.00008126416,9.848872e-7,0.00055288896,0.10109885,0.58348674,0.0059577767,0.13383634,0.17469914],"study_design_scores_gemma":[0.0014311814,0.0001178726,0.001251485,0.0003437,0.000056769346,0.000012531631,0.000056902638,0.40975296,0.14156272,0.021142017,0.42299706,0.001274811],"about_ca_topic_score_codex":0.000002845733,"about_ca_topic_score_gemma":0.0000032989672,"teacher_disagreement_score":0.7236908,"about_ca_system_score_codex":0.00013419721,"about_ca_system_score_gemma":0.000007799745,"threshold_uncertainty_score":0.8834578},"labels":[],"label_agreement":null},{"id":"W2141168821","doi":"10.1109/lcomm.2007.070364","title":"Orthonormal Diversity-Multiplexing Precoding in MIMO Systems at Finite SNR","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Precoding; Orthonormal basis; MIMO; Multiplexing; Symbol rate; Computer science; Spatial multiplexing; Symbol (formal); Grassmannian; Signal-to-noise ratio (imaging); Linear subspace; Telecommunications; Mathematics; Algorithm; Decoding methods; Bit error rate; Beamforming; Combinatorics; Physics","score_opus":0.03760171715427947,"score_gpt":0.2645441590748419,"score_spread":0.22694244192056245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141168821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57486105,0.0020588832,0.4129784,0.0010132097,0.00045147873,0.0007512141,0.000029369401,0.0018730147,0.005983366],"genre_scores_gemma":[0.975134,0.00078677846,0.02366605,0.00019599347,0.000024470102,0.00006233134,0.000049122802,0.000042120533,0.00003914324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987505,0.00010891829,0.00047228698,0.00015666496,0.00015032562,0.0003613047],"domain_scores_gemma":[0.99690986,0.00074266753,0.00009731872,0.0021353017,0.000041528612,0.00007330377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005586727,0.00018301969,0.00020378653,0.00037709292,0.00046150127,0.0000347456,0.0015863765,0.000095378375,0.0000063239418],"category_scores_gemma":[0.000040793566,0.00023295682,0.000060976483,0.00044417847,0.00013155938,0.00037888155,0.00091313093,0.00048814437,0.000039846862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039171267,0.00015764823,0.13688846,0.00020122726,0.00011946318,0.000020416974,0.0062937546,0.68266803,0.15055415,0.001872402,0.0027287512,0.018456558],"study_design_scores_gemma":[0.002198589,0.000044761717,0.037115835,0.0010112303,0.000054625867,0.000051214935,0.0014532305,0.81643033,0.0555095,0.00016672538,0.083504245,0.0024597237],"about_ca_topic_score_codex":0.00012022695,"about_ca_topic_score_gemma":0.00061230734,"teacher_disagreement_score":0.40027294,"about_ca_system_score_codex":0.0005583969,"about_ca_system_score_gemma":0.0000057900643,"threshold_uncertainty_score":0.94997036},"labels":[],"label_agreement":null},{"id":"W2141762353","doi":"10.1109/lcomm.2013.091913.131127","title":"Impact of Beacon Misdetection on Aggregate Interference for Hybrid Underlay-Interweave Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Underlay; Path loss; Computer science; Interference (communication); Rayleigh fading; Computer network; Node (physics); Topology (electrical circuits); Telecommunications; Cognitive radio; Fading; Wireless; Signal-to-noise ratio (imaging); Mathematics; Physics; Channel (broadcasting)","score_opus":0.029197540819946986,"score_gpt":0.28204130301568,"score_spread":0.252843762195733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141762353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26632437,0.000086994114,0.729733,0.0028441965,0.00022936804,0.00036232756,0.0000035253822,0.00007691524,0.0003393353],"genre_scores_gemma":[0.99039274,0.000088094836,0.008584774,0.000750649,0.00007983791,0.000055586104,0.000010449482,0.000015847954,0.000022002656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888253,0.00014176816,0.00031366665,0.00027158592,0.00009931476,0.0002911031],"domain_scores_gemma":[0.9973042,0.00062969275,0.00022693828,0.0016047327,0.00016199704,0.00007241056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016291747,0.00017327623,0.00021601713,0.00016121003,0.0002095504,0.00015593231,0.0010520105,0.0000400375,0.000007693006],"category_scores_gemma":[0.000032163895,0.00016037235,0.0002239484,0.00025182264,0.0001433996,0.00033269575,0.00015749583,0.00025889766,0.000014695487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009267022,0.0004019262,0.0005166228,0.000024176317,0.00047070152,0.0000032320343,0.0010429102,0.029457314,0.08090278,0.0033455507,0.021687957,0.86205417],"study_design_scores_gemma":[0.00044944114,0.00043720414,0.0032997457,0.00019598471,0.000018299843,0.000029710622,0.000019886103,0.98724985,0.0069208755,0.0008975764,0.00020930856,0.00027208647],"about_ca_topic_score_codex":0.00024348657,"about_ca_topic_score_gemma":0.00003962072,"teacher_disagreement_score":0.9577926,"about_ca_system_score_codex":0.00015959975,"about_ca_system_score_gemma":0.000025695099,"threshold_uncertainty_score":0.6539794},"labels":[],"label_agreement":null},{"id":"W2142011291","doi":"10.1109/lcomm.2005.02029","title":"Accurate closed-form approximations to Ricean sum distributions and densities","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Random variable; Range (aeronautics); Mathematics; Closed-form expression; Probability density function; Variable (mathematics); Applied mathematics; Distribution (mathematics); Expression (computer science); Probability distribution; Function (biology); Statistical physics; Mathematical analysis; Statistics; Computer science","score_opus":0.02109765643562821,"score_gpt":0.2692523569204903,"score_spread":0.2481547004848621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142011291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18609606,0.0008152448,0.7700919,0.03724939,0.000089709014,0.0006858428,0.0001676841,0.002136253,0.0026679204],"genre_scores_gemma":[0.8531454,0.00080836855,0.14462566,0.00092363823,0.000035547608,0.0002771877,0.00011551277,0.000034542452,0.000034128334],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991072,0.00006080205,0.00033803176,0.00014083469,0.00010595906,0.00024716783],"domain_scores_gemma":[0.99737656,0.00021991726,0.00005311275,0.002161142,0.0000773114,0.00011197785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013660139,0.00017905269,0.00016264911,0.00019063229,0.00045166505,0.000085143365,0.0009553877,0.000057876183,0.0000075909857],"category_scores_gemma":[0.00003527664,0.0002095281,0.000044414905,0.0003776352,0.00019692912,0.00047944355,0.00023757305,0.0003151149,0.000071297814],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023782732,0.0005492743,0.001022002,0.00022419554,0.00045293276,0.0000029110215,0.014131139,0.10810154,0.34153584,0.13550434,0.16810338,0.23034869],"study_design_scores_gemma":[0.0008505213,0.000050564326,0.010245037,0.00024738323,0.00012495818,0.00006201185,0.0011075771,0.28851864,0.061177317,0.0027801888,0.63280535,0.0020304692],"about_ca_topic_score_codex":0.000015175932,"about_ca_topic_score_gemma":0.00014568212,"teacher_disagreement_score":0.66704935,"about_ca_system_score_codex":0.00020407487,"about_ca_system_score_gemma":0.000011165571,"threshold_uncertainty_score":0.8544308},"labels":[],"label_agreement":null},{"id":"W2142157709","doi":"10.1109/lcomm.2006.1665117","title":"A new symbol-alphabet-aware multi-user detection scheme","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Detector; Minimum mean square error; Computer science; Estimator; Algorithm; Interference (communication); Matched filter; Single antenna interference cancellation; SIGNAL (programming language); Alphabet; Filter (signal processing); Symbol (formal); Mathematics; Telecommunications; Statistics; Computer vision","score_opus":0.036119246830950164,"score_gpt":0.2950477409977816,"score_spread":0.2589284941668314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142157709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010477222,0.0006339508,0.95947933,0.027622744,0.00022676883,0.0003725316,0.0000026338491,0.0006092808,0.0005755463],"genre_scores_gemma":[0.7450862,0.00015247901,0.2522909,0.0011120008,0.00012061066,0.00013680937,0.000023958517,0.000032838,0.0010441854],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766934,0.00049815176,0.00049005536,0.00041948067,0.00043009373,0.00049286475],"domain_scores_gemma":[0.99181014,0.00042432258,0.00018120628,0.0072358865,0.00019162823,0.00015681637],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00044655206,0.00023088504,0.00021071975,0.00032375084,0.0007292205,0.0003930758,0.007551304,0.00011898056,0.000017189845],"category_scores_gemma":[0.00003286005,0.00025517485,0.0001280125,0.0012966845,0.0002032394,0.00085839565,0.001326872,0.0007137542,0.00036309825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029792489,0.0013333526,0.008688521,0.00005968848,0.0002495854,0.000019160989,0.0014788763,0.011756216,0.48832133,0.062137995,0.1991556,0.22676988],"study_design_scores_gemma":[0.0024101543,0.000059494687,0.0246439,0.0001427044,0.000024905366,0.000054111755,0.00008271963,0.71527517,0.024869204,0.0007084065,0.23046121,0.0012679894],"about_ca_topic_score_codex":0.0009554967,"about_ca_topic_score_gemma":0.0008786398,"teacher_disagreement_score":0.734609,"about_ca_system_score_codex":0.0002215688,"about_ca_system_score_gemma":0.0001271946,"threshold_uncertainty_score":0.99999005},"labels":[],"label_agreement":null},{"id":"W2142402258","doi":"10.1109/lcomm.2013.090213.131493","title":"Opportunistic Cooperative Communication in the Presence of Co-Channel Interferences and Outdated Channel Information","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Channel state information; Computer science; Channel (broadcasting); Interference (communication); Co-channel interference; Cooperative diversity; Signal-to-noise ratio (imaging); Energy (signal processing); Coding (social sciences); Fading; Diversity scheme; Telecommunications; Probability of error; Maximal-ratio combining; Topology (electrical circuits); Algorithm; Mathematics; Wireless; Statistics","score_opus":0.0674425059535089,"score_gpt":0.29579081058897616,"score_spread":0.22834830463546726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142402258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17153502,0.0028093152,0.5945027,0.21458508,0.00032946674,0.004016912,0.000047831894,0.00031524533,0.011858443],"genre_scores_gemma":[0.99082196,0.0030357712,0.002969116,0.0027873958,0.0000058027586,0.00028804096,0.000073576666,0.00000478482,0.000013543571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790233,0.0010250715,0.0005471169,0.00014881074,0.0001944795,0.00018218499],"domain_scores_gemma":[0.9956356,0.00096305774,0.00027679754,0.0027687058,0.00030593728,0.00004987779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080107717,0.00015285771,0.00019078731,0.00022275862,0.00040733506,0.00031609423,0.004207048,0.00004907221,0.000010145111],"category_scores_gemma":[0.00016196963,0.00012271143,0.0000316287,0.0006568188,0.0004971954,0.0019075561,0.00066273747,0.00037236832,0.000029944757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005119023,0.0013797203,0.0027890059,0.00020630198,0.0002802132,0.0000028822735,0.31430563,0.0049742577,0.02909471,0.41147685,0.08236666,0.15307255],"study_design_scores_gemma":[0.0015912427,0.00023508935,0.025089014,0.00064547244,0.000030471727,0.00004121602,0.009446643,0.94715995,0.0016302221,0.0037702394,0.009416442,0.0009439803],"about_ca_topic_score_codex":0.00018946259,"about_ca_topic_score_gemma":0.00015167383,"teacher_disagreement_score":0.9421857,"about_ca_system_score_codex":0.000034505883,"about_ca_system_score_gemma":0.00004859778,"threshold_uncertainty_score":0.7817812},"labels":[],"label_agreement":null},{"id":"W2142456386","doi":"10.1109/lcomm.2006.1576558","title":"Power delay profile and noise variance estimation for OFDM","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cyclic prefix; Estimator; Orthogonal frequency-division multiplexing; Algorithm; Minimum mean square error; Computer science; Channel (broadcasting); Mathematics; Noise (video); Mean squared error; Heuristic; Noise power; Variance (accounting); Statistics; Power (physics); Telecommunications; Mathematical optimization; Artificial intelligence","score_opus":0.011481205378399553,"score_gpt":0.25593058540971475,"score_spread":0.2444493800313152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142456386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024263293,0.0008023041,0.9676271,0.0032013997,0.00006857021,0.00060397346,0.000039665552,0.0008755275,0.0025181368],"genre_scores_gemma":[0.6515343,0.00013948693,0.34749362,0.000208713,0.000011718916,0.00047514506,0.000073973424,0.000030741096,0.00003227036],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936503,0.00003806703,0.00025625914,0.000117103984,0.00006712613,0.00015639319],"domain_scores_gemma":[0.99806935,0.00022865605,0.000062115985,0.001554629,0.0000570475,0.000028225282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117399344,0.00012811345,0.00012245418,0.000093193354,0.00019950827,0.000040624418,0.00059823506,0.000056154822,0.000005646871],"category_scores_gemma":[0.00001973501,0.00015084872,0.000033679076,0.00015226832,0.00013124887,0.0002756032,0.00007021516,0.00015658396,0.000010760439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023625344,0.00023691489,0.0005582874,0.00021026458,0.0000955067,0.0000011425935,0.0007043665,0.1558974,0.65236557,0.06018049,0.089712866,0.040013596],"study_design_scores_gemma":[0.0008373029,0.000038769347,0.0033460055,0.00013762376,0.000040254818,0.000019557468,0.000041052746,0.8369067,0.059752412,0.0068662055,0.091197796,0.00081636437],"about_ca_topic_score_codex":0.0000164359,"about_ca_topic_score_gemma":0.000013309751,"teacher_disagreement_score":0.6810093,"about_ca_system_score_codex":0.000074810625,"about_ca_system_score_gemma":0.000007047218,"threshold_uncertainty_score":0.61514324},"labels":[],"label_agreement":null},{"id":"W2142618516","doi":"10.1109/lcomm.2003.822524","title":"Exact BER Analyses of Nakagami/Nakagami CCI BPSK and Nakagami/Rayleigh CCI QPSK Systems in Slow Fading","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Nakagami distribution; Phase-shift keying; Fading; Rayleigh fading; Bit error rate; Keying; Fading distribution; Computer science; Mathematics; Algorithm; Telecommunications; Decoding methods","score_opus":0.04193846555332781,"score_gpt":0.30884684247469363,"score_spread":0.2669083769213658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142618516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91586643,0.009659022,0.068034254,0.0021259033,0.00022567401,0.0009111987,0.000031547475,0.001101417,0.0020445772],"genre_scores_gemma":[0.9661229,0.0051876353,0.028035132,0.00024005279,0.000024168488,0.00022991584,0.00005277134,0.00008889496,0.000018529912],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99792993,0.00022514614,0.0009081615,0.00029525653,0.00025207823,0.00038942238],"domain_scores_gemma":[0.9956513,0.0004495999,0.00023676362,0.0034561562,0.000104100654,0.00010207003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035317507,0.00035497558,0.0005577109,0.00066374993,0.00019096764,0.00007154399,0.0016850202,0.00015676918,0.0000050969825],"category_scores_gemma":[0.00006679552,0.0004034282,0.00011087064,0.00089162687,0.0003682066,0.00054094044,0.00029629425,0.00064936606,0.000019255032],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014775919,0.00025673112,0.0033209648,0.0003594648,0.00027171816,0.000009243341,0.0022615658,0.2847976,0.6954894,0.0039679967,0.0007195317,0.008530966],"study_design_scores_gemma":[0.01036085,0.00033943134,0.05782621,0.0075025987,0.0006868163,0.000257654,0.004760412,0.17888339,0.6815613,0.005010875,0.045778308,0.007032153],"about_ca_topic_score_codex":0.00056392513,"about_ca_topic_score_gemma":0.00015991616,"teacher_disagreement_score":0.10591422,"about_ca_system_score_codex":0.0003946077,"about_ca_system_score_gemma":0.000032113207,"threshold_uncertainty_score":0.99984175},"labels":[],"label_agreement":null},{"id":"W2142907745","doi":"10.1109/lcomm.2014.030114.132728","title":"A Distributed Method for Compressive Data Gathering in Wireless Sensor Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless sensor network; Computer science; Computer network; Data aggregator; Key distribution in wireless sensor networks; Compressed sensing; Data collection; Mobile wireless sensor network; Distributed computing; Overhead (engineering); Sink (geography); Routing (electronic design automation); Efficient energy use; Node (physics); Wireless; Wireless network; Telecommunications; Algorithm; Engineering","score_opus":0.04680214158078516,"score_gpt":0.30914324775365903,"score_spread":0.2623411061728739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142907745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005294879,0.00010488724,0.9844665,0.009124166,0.00031924332,0.0003419221,0.000032208583,0.00021558888,0.00010058506],"genre_scores_gemma":[0.5215794,0.000051341704,0.47638953,0.0015355372,0.00006761014,0.000091789625,0.00025294468,0.000024429108,0.000007426362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976506,0.00067271735,0.00043491033,0.0005858312,0.00017594297,0.0004799616],"domain_scores_gemma":[0.990277,0.0022705093,0.00022294425,0.0070560765,0.00008338294,0.000090084286],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00094358623,0.00021414195,0.00030712681,0.0001326761,0.00030186577,0.00018026166,0.007425152,0.00009834458,8.891433e-7],"category_scores_gemma":[0.0000834668,0.00022965099,0.00006698378,0.00064043334,0.00013612713,0.00035906522,0.0014344722,0.00038859932,0.0000046367527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009014902,0.00012326046,0.000266834,0.00001120129,0.000033319695,0.0000021955284,0.00021402848,0.9572278,0.0063140313,0.010340111,0.0031848736,0.022273282],"study_design_scores_gemma":[0.0004997073,0.000012088015,0.0003077838,0.00008753356,0.000010385883,0.000006829713,0.000016341864,0.9894871,0.00024311987,0.000054816115,0.009016945,0.00025732158],"about_ca_topic_score_codex":0.00012838225,"about_ca_topic_score_gemma":0.00021919457,"teacher_disagreement_score":0.5162845,"about_ca_system_score_codex":0.000081569044,"about_ca_system_score_gemma":0.000019627249,"threshold_uncertainty_score":0.99794513},"labels":[],"label_agreement":null},{"id":"W2143548806","doi":"10.1109/lcomm.2011.092011.111200","title":"A New Loop-Free Proactive Source Routing Scheme for Opportunistic Data Forwarding in Wireless Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Wireless Routing Protocol; Static routing; Link-state routing protocol; Zone Routing Protocol; Distributed computing; Policy-based routing; Routing protocol; Multipath routing; Geographic routing; Routing (electronic design automation)","score_opus":0.1282827549936118,"score_gpt":0.2937703879894708,"score_spread":0.165487632995859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143548806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015419275,0.0000892298,0.99292725,0.0034715086,0.00024834496,0.00083034,0.00001039229,0.00019538165,0.00068561576],"genre_scores_gemma":[0.5334367,0.000050022667,0.4645019,0.0014514856,0.00013211062,0.0002274306,0.000080409256,0.00003890078,0.00008103918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795663,0.00019881807,0.0004983974,0.0006088959,0.00018349585,0.0005537639],"domain_scores_gemma":[0.9892348,0.00063873274,0.0002823073,0.009619357,0.00006769534,0.00015709327],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009116346,0.00022552867,0.00028009154,0.00014275032,0.00033500214,0.00016128807,0.012309106,0.00010119666,0.000004245425],"category_scores_gemma":[0.00012179302,0.00025457644,0.000072745686,0.0006129327,0.00012436148,0.0009867059,0.0034548633,0.0005096624,0.0000070552996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117721516,0.00074479333,0.00819024,0.000078128396,0.000572429,0.000034235218,0.01034932,0.0061549447,0.0032866544,0.19596407,0.12947151,0.6450359],"study_design_scores_gemma":[0.0006349401,0.000023006922,0.00034041295,0.00009678918,0.000023874312,0.000010246756,0.000080288264,0.9957819,0.00006794582,0.0005497764,0.0020806587,0.0003101843],"about_ca_topic_score_codex":0.00039582842,"about_ca_topic_score_gemma":0.0002971082,"teacher_disagreement_score":0.98962694,"about_ca_system_score_codex":0.0001324916,"about_ca_system_score_gemma":0.00014841431,"threshold_uncertainty_score":0.99999064},"labels":[],"label_agreement":null},{"id":"W2143657748","doi":"10.1109/lcomm.2005.1461684","title":"Improving power allocation to MIMO eigenbeams under imperfect channel estimation","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"MIMO; Computer science; Transmitter; Spatial multiplexing; Channel (broadcasting); Interference (communication); Multiplexing; Transmitter power output; Orthogonal frequency-division multiplexing; Transmission (telecommunications); Telecommunications; Antenna diversity; Electronic engineering; Algorithm; Wireless; Engineering","score_opus":0.014170234121119347,"score_gpt":0.24757296541203602,"score_spread":0.23340273129091668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143657748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029051958,0.00027242475,0.963358,0.0052308156,0.00031709927,0.0005238611,0.000007231508,0.0006060523,0.0006325989],"genre_scores_gemma":[0.8882455,0.000041309446,0.11005621,0.0012084335,0.000078859644,0.00020104588,0.000063172265,0.00006604204,0.00003939353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899036,0.000059286285,0.0003640876,0.0001938265,0.00012469965,0.00026776694],"domain_scores_gemma":[0.99821717,0.000088153276,0.00007291825,0.0014505993,0.00007841697,0.00009276223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018601437,0.00019368045,0.00015049038,0.00022289161,0.00020553143,0.00006483037,0.00057006255,0.00007675433,0.000012297241],"category_scores_gemma":[0.00003783884,0.00023094068,0.00005087593,0.0003879925,0.000039217288,0.0005494128,0.000066318345,0.00019037853,0.00028560357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017405176,0.000016768721,0.0000054711104,0.000012070896,0.000017133203,9.3993116e-8,0.0006075029,0.8759976,0.11555311,0.00014253984,0.0014892748,0.006156689],"study_design_scores_gemma":[0.00025810878,0.000017288925,0.00014544243,0.00005253191,0.000020604943,0.000007806239,0.00013869823,0.9824906,0.01431843,0.000028689066,0.0021536278,0.0003682021],"about_ca_topic_score_codex":0.000037830898,"about_ca_topic_score_gemma":0.00008282287,"teacher_disagreement_score":0.85919356,"about_ca_system_score_codex":0.00042396775,"about_ca_system_score_gemma":0.00001494476,"threshold_uncertainty_score":0.94174874},"labels":[],"label_agreement":null},{"id":"W2144688966","doi":"10.1109/lcomm.2010.080210.100569","title":"Spectrum Sensing in Cognitive Radio Using a Markov-Chain Monte-Carlo Scheme","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cognitive radio; Markov chain Monte Carlo; Computer science; Markov chain; Overhead (engineering); Monte Carlo method; Scheme (mathematics); Mathematical optimization; Markov process; Algorithm; Mathematics; Wireless; Machine learning; Telecommunications; Statistics","score_opus":0.03206890999571101,"score_gpt":0.277545346821312,"score_spread":0.24547643682560097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144688966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77306336,0.00017353774,0.2125438,0.01240949,0.00052077166,0.00030601083,0.0000035826888,0.0001550552,0.0008243797],"genre_scores_gemma":[0.8632232,0.000047059653,0.13475674,0.0017753862,0.00015141274,0.000004411325,0.0000032361634,0.000025622812,0.000012926121],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980074,0.00029910036,0.0004242576,0.00047888287,0.00023820467,0.00055213773],"domain_scores_gemma":[0.9970357,0.0006864005,0.00016892931,0.0019048009,0.00008374961,0.00012044667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061799487,0.00025506574,0.00029185004,0.0003987202,0.0004445478,0.00028778307,0.0013002456,0.00010113474,0.0000063845396],"category_scores_gemma":[0.000106493666,0.00029363364,0.00012020203,0.0009907293,0.0003240153,0.00052051,0.00042909995,0.0011004593,0.000014088651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000907872,0.0006762018,0.019483756,0.00003669467,0.00033777842,0.0006131162,0.010291554,0.0025192678,0.79391325,0.012177811,0.0017357123,0.15812404],"study_design_scores_gemma":[0.00077930395,0.000017424229,0.004507423,0.00018667015,0.000018155004,0.00024660135,0.0001381581,0.9906226,0.0021487195,0.00038659747,0.00045278802,0.0004955625],"about_ca_topic_score_codex":0.00043552695,"about_ca_topic_score_gemma":0.002658726,"teacher_disagreement_score":0.98810333,"about_ca_system_score_codex":0.00014577736,"about_ca_system_score_gemma":0.000088415916,"threshold_uncertainty_score":0.9999516},"labels":[],"label_agreement":null},{"id":"W2145104339","doi":"10.1109/lcomm.2004.835301","title":"Exact BER Analysis of Bandlimited BPSK With EGC and SC Diversity in Cochannel Interference and Nakagami Fading","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Phase-shift keying; Nakagami distribution; Fading distribution; Bandlimiting; Mathematics; Bit error rate; Diversity scheme; Diversity combining; Algorithm; Maximal-ratio combining; Interference (communication); Diversity gain; Computer science; Rayleigh fading; Telecommunications; Statistics; Fourier transform; Decoding methods","score_opus":0.027167260927686582,"score_gpt":0.2527275775047903,"score_spread":0.2255603165771037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145104339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.908352,0.000553433,0.08991661,0.00074093393,0.000008037227,0.00012781001,0.000012313629,0.00013047084,0.00015840231],"genre_scores_gemma":[0.9810443,0.0016273716,0.017126659,0.0001451328,0.0000015544814,0.000021785714,0.000019005522,0.000012793725,0.0000013803319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99942815,0.000051442115,0.00020518608,0.00012296942,0.00007437807,0.000117869145],"domain_scores_gemma":[0.9986156,0.00016672196,0.000066269036,0.0010729668,0.00004028565,0.000038153397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011145192,0.00011796988,0.00023205957,0.0004816313,0.00012834916,0.000016987222,0.0005431802,0.000042543554,0.000001772451],"category_scores_gemma":[0.000012940663,0.00012501625,0.00002661184,0.00074201537,0.00027532352,0.00022528417,0.00035216787,0.00022978277,3.9101465e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008929529,0.00034764604,0.26881635,0.00022013884,0.0020704644,0.000008459421,0.027328445,0.48946038,0.19376667,0.0036950535,0.00016190272,0.014035172],"study_design_scores_gemma":[0.0048056664,0.0002386815,0.67144334,0.0018641159,0.0015938067,0.000029004803,0.002907749,0.23577175,0.07674872,0.0017615661,0.0005310986,0.0023045156],"about_ca_topic_score_codex":0.00024949986,"about_ca_topic_score_gemma":0.0007903764,"teacher_disagreement_score":0.40262696,"about_ca_system_score_codex":0.00009246012,"about_ca_system_score_gemma":0.00000526676,"threshold_uncertainty_score":0.50980145},"labels":[],"label_agreement":null},{"id":"W2145729990","doi":"10.1109/lcomm.2004.833813","title":"SER of Threshold-Based HybridSelection/ Maximal-Ratio Combining in Equicorrelated Nakagami Fading","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Nakagami distribution; Maximal-ratio combining; Mathematics; Modulation (music); Phase-shift keying; Algorithm; Statistics; Bit error rate; Signal-to-noise ratio (imaging); Keying; Selection (genetic algorithm); Fading distribution; Telecommunications; Computer science; Decoding methods; Physics; Artificial intelligence","score_opus":0.023098605057893438,"score_gpt":0.2617106268390924,"score_spread":0.23861202178119897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145729990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5307106,0.0006354012,0.46258742,0.0024263114,0.00014962003,0.0004698868,0.000009790722,0.0011407102,0.001870312],"genre_scores_gemma":[0.9618763,0.0002655369,0.03721321,0.00035949372,0.000007924033,0.00016042916,0.00005303012,0.000059398848,0.0000046768696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99876034,0.00007733512,0.0005872794,0.00015925753,0.00015680563,0.00025896603],"domain_scores_gemma":[0.99748725,0.0001777067,0.00012890874,0.0020809346,0.00007917592,0.000046004643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022032385,0.00019764979,0.00025770505,0.0004422314,0.00014700442,0.000026959564,0.0011982548,0.00009188634,0.000007951757],"category_scores_gemma":[0.000029770432,0.00025025615,0.000073575655,0.0008581058,0.00020070681,0.00032754365,0.00010244125,0.00060563086,0.000014941426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006532536,0.00009062989,0.00080978236,0.000028141381,0.000022952992,0.0000013537731,0.0003905503,0.7537625,0.2418873,0.0021300563,0.0001419034,0.000728313],"study_design_scores_gemma":[0.0024647268,0.00007359725,0.0030094108,0.0008172593,0.000035387406,0.000016584248,0.00020691914,0.48309848,0.5054095,0.002806485,0.0011270463,0.00093462685],"about_ca_topic_score_codex":0.0000654893,"about_ca_topic_score_gemma":0.00010460743,"teacher_disagreement_score":0.43116575,"about_ca_system_score_codex":0.0003832988,"about_ca_system_score_gemma":0.00004047205,"threshold_uncertainty_score":0.999995},"labels":[],"label_agreement":null},{"id":"W2146303957","doi":"10.1109/lcomm.2003.812170","title":"Comparison of diverse optical CDMA codes using a normalized throughput metric","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Metric (unit); Code division multiple access; Computer science; Throughput; Bit error rate; Measure (data warehouse); Code (set theory); Range (aeronautics); Algorithm; Mathematics; Telecommunications; Data mining; Wireless; Decoding methods; Engineering","score_opus":0.0742782014756051,"score_gpt":0.3219493300186769,"score_spread":0.24767112854307183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146303957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9518815,0.0011422242,0.041222576,0.00009491088,0.0003336358,0.00018367682,0.000011293152,0.00014019368,0.004989992],"genre_scores_gemma":[0.9854876,0.000050162012,0.014337126,0.000068277135,0.000011197866,0.000014196264,0.0000065678328,0.000019771156,0.000005097699],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900573,0.0002203353,0.0003659871,0.00009205591,0.00013075353,0.0001851272],"domain_scores_gemma":[0.99846303,0.00025727425,0.000070339716,0.0011201906,0.000039060393,0.000050091712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027564805,0.00012689049,0.00028152156,0.00018886727,0.0001536732,0.00002150861,0.00055584824,0.00005917544,0.000019634997],"category_scores_gemma":[0.00003947075,0.00013505909,0.00009900852,0.00058912823,0.00019977179,0.00012848912,0.00004110079,0.0001975492,0.000020717533],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022197773,0.00042691722,0.024945755,0.00023452852,0.00054944906,0.000004089907,0.004621172,0.17758006,0.7198314,0.06702578,0.0036850618,0.0010735489],"study_design_scores_gemma":[0.004867099,0.00015736524,0.0050248387,0.0005888628,0.0009626795,0.00012657366,0.009214988,0.3935841,0.5226487,0.0013929765,0.058910895,0.0025209032],"about_ca_topic_score_codex":0.000029631423,"about_ca_topic_score_gemma":0.000012854378,"teacher_disagreement_score":0.21600404,"about_ca_system_score_codex":0.000051480725,"about_ca_system_score_gemma":0.000008876508,"threshold_uncertainty_score":0.55075496},"labels":[],"label_agreement":null},{"id":"W2146516326","doi":"10.1109/lcomm.2002.1010873","title":"Improved models for the generation of multiple uncorrelated Rayleigh fading waveforms","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":350,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rayleigh fading; Fading; Algorithm; Uncorrelated; Mathematics; Computer science; Waveform; Statistics; Telecommunications; Decoding methods; Radar","score_opus":0.07360447148231299,"score_gpt":0.2573257716440019,"score_spread":0.18372130016168892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146516326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01540563,0.0014770475,0.9793055,0.0021063206,0.00014818659,0.00073646556,0.000026398004,0.00048370083,0.0003107405],"genre_scores_gemma":[0.92531127,0.0021286695,0.071681805,0.0002158545,0.000028245817,0.0005117344,0.0000485433,0.00004500763,0.00002885539],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992035,0.00004409778,0.00039399855,0.000103613645,0.00008389054,0.00017091341],"domain_scores_gemma":[0.9968753,0.00055038015,0.000114054084,0.0023355815,0.000097125085,0.000027592956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016084005,0.00014043365,0.00015280234,0.000097745695,0.00029262548,0.000023523458,0.0012279823,0.00007120238,0.000006096093],"category_scores_gemma":[0.00004000634,0.00011894775,0.000090110494,0.00023974893,0.00014126097,0.00031810277,0.00008638722,0.00024753442,0.0000034722566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027263713,0.000037471993,0.000016675627,0.000020093274,0.00006835767,3.3636812e-8,0.0008895035,0.48558614,0.4886674,0.0010101285,0.0036372943,0.020064192],"study_design_scores_gemma":[0.00024139404,0.000009086045,0.000007661206,0.000018211573,0.000018377405,0.0000011391265,0.000045562356,0.93693405,0.06002674,0.00017212986,0.0023959293,0.00012974617],"about_ca_topic_score_codex":0.000027620714,"about_ca_topic_score_gemma":0.00004578875,"teacher_disagreement_score":0.9099057,"about_ca_system_score_codex":0.000101406054,"about_ca_system_score_gemma":0.000003655006,"threshold_uncertainty_score":0.48505482},"labels":[],"label_agreement":null},{"id":"W2146908812","doi":"10.1109/lcomm.2004.823370","title":"Characterization of Jitter and Admission Control in Multiservice Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Jitter; Computer science; Computer network; Bandwidth (computing); Probabilistic logic; Network packet; Admission control; Quality of service; Telecommunications","score_opus":0.011030276273553812,"score_gpt":0.2257467526964682,"score_spread":0.2147164764229144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146908812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2862542,0.00013953357,0.685287,0.027953431,0.00010014562,0.0001876497,0.000001457749,0.00004893403,0.000027665828],"genre_scores_gemma":[0.9873275,0.00016581723,0.0065520094,0.0058724675,0.000026409374,0.000036575395,0.000008148185,0.0000062173476,0.0000048600873],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992185,0.00012223524,0.00026198087,0.0001655999,0.00008930861,0.00014234467],"domain_scores_gemma":[0.99872494,0.00011412146,0.00012064488,0.0009384011,0.000047339436,0.00005454987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017867638,0.00009098166,0.00014230915,0.00009719462,0.000083047526,0.000040123734,0.0008367449,0.000049314247,0.0000016245333],"category_scores_gemma":[0.000007887504,0.00009249262,0.000026801396,0.00028453665,0.00007127881,0.0003071116,0.00009846048,0.00015682254,0.0000036251843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007464662,0.00057099067,0.011780291,0.00004320518,0.00007767688,0.000012169014,0.003168445,0.0816524,0.53914076,0.023705544,0.00022881782,0.33954504],"study_design_scores_gemma":[0.0033997952,0.000036759677,0.048515473,0.00017893482,0.000016186292,0.000010588414,0.00001583889,0.9450857,0.00068064075,0.00016893668,0.0016317571,0.00025941356],"about_ca_topic_score_codex":0.00003604052,"about_ca_topic_score_gemma":0.000046597503,"teacher_disagreement_score":0.8634333,"about_ca_system_score_codex":0.000029923982,"about_ca_system_score_gemma":0.000024086294,"threshold_uncertainty_score":0.37717396},"labels":[],"label_agreement":null},{"id":"W2147230218","doi":"10.1109/4234.929605","title":"Soft-decision COVQ for turbo-coded AWGN and Rayleigh fading channels","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Additive white Gaussian noise; Rayleigh fading; Turbo code; Computer science; Fading; Demodulation; Turbo equalizer; Algorithm; Turbo; Decoding methods; Bit error rate; Convolutional code; Electronic engineering; Channel (broadcasting); Telecommunications; Concatenated error correction code; Engineering; Block code","score_opus":0.033495348741612696,"score_gpt":0.28949627322626714,"score_spread":0.25600092448465445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147230218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10692129,0.0016138543,0.8848143,0.0040287157,0.00020683267,0.0006653313,0.000019250872,0.0012039362,0.00052646594],"genre_scores_gemma":[0.8645149,0.0034732297,0.13072789,0.0006811651,0.00004602279,0.00041765827,0.000043130654,0.00006498237,0.000031035775],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990223,0.000055714783,0.00035684597,0.00018296002,0.000110432455,0.00027172413],"domain_scores_gemma":[0.99671084,0.00080335257,0.00007461004,0.0022608908,0.00007248923,0.0000778066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022769667,0.00020108816,0.00022488018,0.0002033958,0.0003612123,0.00007265347,0.0011957042,0.00009249645,0.0000067638175],"category_scores_gemma":[0.00006682634,0.00022846428,0.00006831798,0.00027374297,0.00016540088,0.0003311106,0.00018413733,0.00028672893,0.0000130871495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008362569,0.00017514532,0.0007098487,0.0001449938,0.00020141213,0.000003764198,0.002879654,0.0893825,0.4820275,0.00416652,0.037671633,0.3825534],"study_design_scores_gemma":[0.0024136333,0.00009291224,0.00063792744,0.00051019667,0.000092175884,0.00008485078,0.00029018862,0.5011768,0.10395395,0.012159965,0.3768804,0.0017070177],"about_ca_topic_score_codex":0.000009278601,"about_ca_topic_score_gemma":0.000014984724,"teacher_disagreement_score":0.7575936,"about_ca_system_score_codex":0.000113482434,"about_ca_system_score_gemma":0.000007001738,"threshold_uncertainty_score":0.93165034},"labels":[],"label_agreement":null},{"id":"W2147861990","doi":"10.1109/lcomm.2004.839612","title":"Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Turbo code; PEG ratio; Block code; Block (permutation group theory); Construct (python library); Simple (philosophy); Mathematics; Decoding methods; Telecommunications; Combinatorics; Computer network","score_opus":0.019341330794251294,"score_gpt":0.2719253126176138,"score_spread":0.2525839818233625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147861990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15708879,0.00038417114,0.81986594,0.020073479,0.0004515593,0.00052040466,0.0000058140795,0.0010123835,0.0005974773],"genre_scores_gemma":[0.58580726,0.00003567968,0.41362274,0.0004302443,0.000018372517,0.00006541564,0.0000044696917,0.000011598604,0.0000042527536],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866503,0.00016890922,0.00040584308,0.0003050109,0.0002094875,0.00024570548],"domain_scores_gemma":[0.9961009,0.00015284914,0.00036058412,0.0030514658,0.0002714916,0.00006273466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000318635,0.00017422324,0.00022254532,0.00023243125,0.00026778408,0.00008264431,0.0031991645,0.00007967734,0.0000018019291],"category_scores_gemma":[0.00009380833,0.00018356513,0.00010469243,0.00064080296,0.00059769454,0.00049022195,0.00046403552,0.00030937244,0.0000086506625],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001495824,0.00046938853,0.0020259407,0.00008577254,0.00012475347,0.0000084385865,0.0033942729,0.00017462562,0.83093816,0.13152117,0.0015121014,0.029730437],"study_design_scores_gemma":[0.0013099634,0.00025788235,0.0020856068,0.00046870112,0.00006673548,0.0002623136,0.0002200055,0.012625519,0.95795554,0.022441547,0.0013968204,0.0009093805],"about_ca_topic_score_codex":0.00017938613,"about_ca_topic_score_gemma":0.00003283288,"teacher_disagreement_score":0.42871845,"about_ca_system_score_codex":0.00014571889,"about_ca_system_score_gemma":0.00010397607,"threshold_uncertainty_score":0.7485569},"labels":[],"label_agreement":null},{"id":"W2148516786","doi":"10.1109/lcomm.2012.092812.121649","title":"Toward an Efficient and Reliable Nonlinearity Measure","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Power Amplifier Design","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Nonlinear distortion; Measure (data warehouse); Bit error rate; Telecommunications link; Nonlinear system; Computer science; Distortion (music); Exponential function; Expression (computer science); Modulation (music); Signal-to-noise ratio (imaging); Power (physics); Algorithm; Sequence (biology); Amplifier; Mathematics; Telecommunications; Decoding methods; Bandwidth (computing)","score_opus":0.05785692033865946,"score_gpt":0.2749355930935896,"score_spread":0.21707867275493015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148516786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53251296,0.0051542474,0.4521905,0.0033707249,0.0009848762,0.00048801154,0.000035842004,0.0010877138,0.00417515],"genre_scores_gemma":[0.938453,0.00010219821,0.060915023,0.00037814546,0.00006432927,0.000030241888,0.000013305041,0.000030046343,0.000013674335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936575,0.000050823677,0.00014311231,0.000091419104,0.0000985627,0.00025035953],"domain_scores_gemma":[0.99845976,0.00006941287,0.000019815823,0.0012982097,0.000026280362,0.00012653627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022183808,0.00011330057,0.000104412546,0.000057035864,0.00012628034,0.00002743494,0.00042389982,0.00004564306,0.0000074868058],"category_scores_gemma":[0.000013517709,0.00012468208,0.000022026326,0.00013198504,0.00009956656,0.00022163252,0.0000571875,0.0002532811,0.00004053727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003119295,0.0008966065,0.011697801,0.00026785774,0.00026165255,0.000004264925,0.01978724,0.464413,0.43635696,0.004567642,0.038721636,0.02299416],"study_design_scores_gemma":[0.0016788504,0.00007214457,0.017189603,0.00016464507,0.00016952668,0.000121826175,0.00086732215,0.52317446,0.024640527,0.0002527403,0.42946246,0.0022058773],"about_ca_topic_score_codex":0.00001814138,"about_ca_topic_score_gemma":0.0000053064427,"teacher_disagreement_score":0.41171643,"about_ca_system_score_codex":0.00006141152,"about_ca_system_score_gemma":0.000005446145,"threshold_uncertainty_score":0.50843877},"labels":[],"label_agreement":null},{"id":"W2148975063","doi":"10.1109/lcomm.2010.01.091797","title":"Design of spreading permutations for MIMO-CDMA based on space-time block codes","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"MIMO; Code division multiple access; Bit error rate; Computer science; Block code; Block (permutation group theory); Space–time block code; Algorithm; Code (set theory); Theoretical computer science; Mathematics; Telecommunications; Decoding methods; Combinatorics; Channel (broadcasting)","score_opus":0.024962654863778754,"score_gpt":0.2754073634889876,"score_spread":0.25044470862520885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148975063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025622483,0.00006345113,0.9670296,0.004515547,0.000113046975,0.00087983545,0.00007010838,0.00083625544,0.000869699],"genre_scores_gemma":[0.6564089,0.000044648477,0.3428294,0.00022182186,0.000014969487,0.00036935427,0.000046545334,0.0000481023,0.000016229944],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909216,0.00010062713,0.0003455135,0.0001400383,0.00012140105,0.00020024164],"domain_scores_gemma":[0.99514866,0.0017621372,0.00011512531,0.0027978031,0.00012137617,0.00005491862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002660812,0.00018111142,0.00022029252,0.00026643657,0.00023707832,0.000027921125,0.0013214443,0.00009222869,0.000013858407],"category_scores_gemma":[0.00011737682,0.00021027353,0.00008641598,0.00025683208,0.00024160881,0.00014479843,0.00005219001,0.00039097454,0.000020123724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006678035,0.000056028573,0.00001989073,0.000021100604,0.000021213207,8.9332644e-8,0.00015889651,0.26587516,0.72945213,0.00096774206,0.0026145517,0.0008065037],"study_design_scores_gemma":[0.00029127073,0.00003273076,0.00006137567,0.00007073997,0.00002798921,0.0000016212838,0.000021772586,0.7590564,0.23539974,0.0003186188,0.004471008,0.00024676105],"about_ca_topic_score_codex":0.000007543438,"about_ca_topic_score_gemma":0.000010857733,"teacher_disagreement_score":0.6307864,"about_ca_system_score_codex":0.00006273772,"about_ca_system_score_gemma":0.000026023905,"threshold_uncertainty_score":0.8574706},"labels":[],"label_agreement":null},{"id":"W2149169325","doi":"10.1109/lcomm.2012.120312.121675","title":"Social Groupcasting Algorithm for Wireless Cellular Multicast Services","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Dissemination; Wireless ad hoc network; Upload; Wireless; Wireless network; Distributed computing; World Wide Web; Telecommunications","score_opus":0.05540864212330869,"score_gpt":0.2932850428698417,"score_spread":0.237876400746533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149169325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009277928,0.000212003,0.98348576,0.005705165,0.00048416157,0.00023726009,0.000011590795,0.00016981603,0.00041631248],"genre_scores_gemma":[0.7523169,0.000013192332,0.24479666,0.0023169306,0.00039944577,0.00007587479,0.0000378114,0.000015868876,0.000027324308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875206,0.0001184942,0.00029219262,0.00020155369,0.00017021813,0.0004654565],"domain_scores_gemma":[0.9980071,0.00036507804,0.00015766101,0.001263854,0.00008159528,0.00012467813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041595893,0.00015631448,0.00017852314,0.00006864839,0.00079413515,0.00014954222,0.0020791849,0.00007573339,0.000002661996],"category_scores_gemma":[0.0000014392991,0.00016514889,0.00010153819,0.00022708278,0.00013160432,0.0005651679,0.00038366028,0.0002065203,0.000033126915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000414446,0.00035636255,0.00054066227,0.00005350265,0.00008653751,0.0000036321378,0.006135828,0.000021789614,0.007780962,0.013734802,0.006263493,0.9650183],"study_design_scores_gemma":[0.0003055736,0.000009731256,0.000107793494,0.000021825224,0.000024853209,0.000008756744,0.0001251378,0.98633873,0.00022068112,0.000111958514,0.012486699,0.0002382465],"about_ca_topic_score_codex":0.00002934533,"about_ca_topic_score_gemma":0.0000040016603,"teacher_disagreement_score":0.986317,"about_ca_system_score_codex":0.00004270647,"about_ca_system_score_gemma":0.00001938683,"threshold_uncertainty_score":0.6734576},"labels":[],"label_agreement":null},{"id":"W2149697964","doi":"10.1109/lcomm.2009.090935","title":"Asymptotic analysis of space-time codes in generalized fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Nakagami distribution; Fading; Rayleigh fading; Weibull fading; Mathematics; Weibull distribution; Fading distribution; Computer science; Algorithm; Topology (electrical circuits); Statistics; Decoding methods; Combinatorics","score_opus":0.019563208299403844,"score_gpt":0.2741684912215894,"score_spread":0.2546052829221856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149697964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8280343,0.0013847371,0.16207829,0.0050956183,0.00006182035,0.00042006717,0.000025428531,0.00094997947,0.0019497523],"genre_scores_gemma":[0.943558,0.0010315946,0.054943044,0.0003141028,0.000007632712,0.000045303255,0.00006378759,0.000020802689,0.000015727517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896294,0.00014244388,0.00045118478,0.00012479213,0.00011808769,0.00020054552],"domain_scores_gemma":[0.9971989,0.00022042899,0.00010347257,0.0023921593,0.00004520042,0.00003983498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021304739,0.00015478182,0.00040221697,0.00091436936,0.000068779955,0.000020171627,0.0012611101,0.00006457485,0.000015722575],"category_scores_gemma":[0.000025761241,0.0001854106,0.0001246587,0.0016928698,0.00010737003,0.00018779741,0.0000678124,0.00023838975,0.00000939347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000303432,0.00006023245,0.00044335533,0.0000079180145,0.00020347253,5.4736205e-7,0.00065074326,0.5954666,0.39825097,0.0012401523,0.0004939629,0.0031789923],"study_design_scores_gemma":[0.0003653692,0.000019612295,0.0061544436,0.000100892044,0.00022463068,0.0000013724798,0.0000425874,0.93556046,0.055405594,0.00050044386,0.0011950248,0.00042958008],"about_ca_topic_score_codex":0.000033223256,"about_ca_topic_score_gemma":0.000035149482,"teacher_disagreement_score":0.34284538,"about_ca_system_score_codex":0.00014207,"about_ca_system_score_gemma":0.000006661243,"threshold_uncertainty_score":0.7560825},"labels":[],"label_agreement":null},{"id":"W2149720966","doi":"10.1109/lcomm.2011.060111.102186","title":"Reduced Complexity MIMO Concatenated Code in Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Space–time block code; Block code; Convolutional code; Algorithm; Fading; Coding gain; Transmit diversity; Concatenated error correction code; Computer science; Diversity gain; MIMO; Theoretical computer science; Telecommunications; Mathematics; Decoding methods; Channel (broadcasting)","score_opus":0.13174961928710568,"score_gpt":0.2995867597786104,"score_spread":0.1678371404915047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149720966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8182895,0.0012751344,0.14364329,0.0054293824,0.00062733353,0.0013689944,0.00006212879,0.005010908,0.0242933],"genre_scores_gemma":[0.94392407,0.00059578946,0.054664686,0.00044810635,0.000012676292,0.00023515165,0.000049503564,0.00005652523,0.000013497745],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881274,0.00016360628,0.00045348133,0.0001687819,0.00009849269,0.00030288644],"domain_scores_gemma":[0.9970087,0.00013568506,0.00008394666,0.0026531701,0.00005093223,0.000067584406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021826217,0.00019804938,0.00024164855,0.00028608792,0.00015065623,0.000023124112,0.0019583292,0.00008740156,0.00003057968],"category_scores_gemma":[0.00002685075,0.00024039278,0.000054932487,0.0005068728,0.00035225094,0.0002930721,0.0001977275,0.00052561634,0.00005163242],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032809116,0.00043428005,0.0021777512,0.00010345872,0.00017038174,0.000013556136,0.015139094,0.017049981,0.9232943,0.015985092,0.009936187,0.015663076],"study_design_scores_gemma":[0.0021201463,0.00006684633,0.012766341,0.00063098315,0.000055366134,0.000044918423,0.0009175537,0.30018464,0.6463694,0.009961915,0.024413941,0.0024679708],"about_ca_topic_score_codex":0.00014767956,"about_ca_topic_score_gemma":0.00016354314,"teacher_disagreement_score":0.28313464,"about_ca_system_score_codex":0.00024025532,"about_ca_system_score_gemma":0.000010675466,"threshold_uncertainty_score":0.9802933},"labels":[],"label_agreement":null},{"id":"W2150109714","doi":"10.1109/lcomm.2011.030911.110078","title":"Diversity-Multiplexing Tradeoff in the Low-SNR Regime","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiplexing; Diversity gain; Rayleigh fading; Fading; Computer science; Channel (broadcasting); Outage probability; Wideband; Signal-to-noise ratio (imaging); Telecommunications; Electronic engineering; Mathematics; Topology (electrical circuits); Engineering; Combinatorics","score_opus":0.07115638452558336,"score_gpt":0.25234004732606524,"score_spread":0.18118366280048187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150109714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7864026,0.0018738635,0.15530892,0.0135364,0.0003331266,0.0015189688,0.000026898739,0.0030901409,0.03790912],"genre_scores_gemma":[0.9718621,0.00067866157,0.026209887,0.0010731618,0.000013003288,0.00011559146,0.000012618678,0.000026739093,0.000008258622],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9991095,0.00019146988,0.0002513254,0.00011144663,0.00012610751,0.00021016008],"domain_scores_gemma":[0.99660826,0.0002529956,0.00005206385,0.003035815,0.000020954649,0.000029896739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027646284,0.00013918386,0.0001281842,0.00016251486,0.0005130113,0.000017057737,0.0032724603,0.000058007554,0.000012276885],"category_scores_gemma":[0.000019302284,0.00013376035,0.000058571215,0.0003860592,0.00021344364,0.00029092014,0.0005178305,0.0005273591,0.000027222379],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008332834,0.001991958,0.04252095,0.00035845352,0.0004655364,0.000071081224,0.4074069,0.028328303,0.31931594,0.06184909,0.06494612,0.07266236],"study_design_scores_gemma":[0.0067371204,0.0002412552,0.25846493,0.001951529,0.00028366115,0.0002116945,0.01897708,0.18293948,0.25225347,0.023633575,0.24641824,0.007887986],"about_ca_topic_score_codex":0.00011333028,"about_ca_topic_score_gemma":0.00013740936,"teacher_disagreement_score":0.3884298,"about_ca_system_score_codex":0.00009753135,"about_ca_system_score_gemma":0.000005016908,"threshold_uncertainty_score":0.60810995},"labels":[],"label_agreement":null},{"id":"W2150125601","doi":"10.1109/lcomm.2005.1461671","title":"Bonferroni-type bounds for CDMA systems with nonuniform signalling","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Bonferroni correction; Code division multiple access; Upper and lower bounds; Signal-to-noise ratio (imaging); Bit error rate; Mathematics; Multiuser detection; Signalling; Spread spectrum; Computer science; Detector; Topology (electrical circuits); Algorithm; Computer network; Statistics; Telecommunications; Combinatorics; Decoding methods","score_opus":0.0586626524623277,"score_gpt":0.3083369425704199,"score_spread":0.24967429010809217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150125601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011059493,0.0014609668,0.9245998,0.059186686,0.00020302381,0.0009713857,0.000005729118,0.00041070353,0.0021021788],"genre_scores_gemma":[0.8133942,0.0002921496,0.18417686,0.0013082149,0.00013216157,0.00036767535,0.000033903645,0.000033408338,0.00026142035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980461,0.0002529183,0.0004264202,0.00034535595,0.0004071968,0.00052198506],"domain_scores_gemma":[0.9929403,0.0008228011,0.00019555907,0.005472109,0.0004253991,0.00014385424],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00078246946,0.00021011897,0.00023829585,0.00023531972,0.00088748406,0.0006216079,0.0072169844,0.00008111846,0.000004205394],"category_scores_gemma":[0.000030398412,0.00019725427,0.00007421887,0.0008236472,0.00027424173,0.0008821147,0.0006186879,0.0004660778,0.000084255524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017446229,0.0011618548,0.0010633558,0.00020355913,0.0005844863,0.000006679304,0.0054939194,0.51446754,0.042214286,0.263594,0.08599397,0.0850419],"study_design_scores_gemma":[0.0005375139,0.00008093004,0.00009062903,0.00008455408,0.00001170444,0.000019946068,0.000060388968,0.8043909,0.0005264009,0.00006194334,0.19382286,0.0003122231],"about_ca_topic_score_codex":0.000068155685,"about_ca_topic_score_gemma":0.00017056998,"teacher_disagreement_score":0.8023347,"about_ca_system_score_codex":0.0002698701,"about_ca_system_score_gemma":0.00018860563,"threshold_uncertainty_score":0.99815446},"labels":[],"label_agreement":null},{"id":"W2150494733","doi":"10.1109/lcomm.2004.825728","title":"On Construction of Rate-Compatible Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Low-density parity-check code; Mathematics; Algorithm; Decoding methods","score_opus":0.026675926263548474,"score_gpt":0.2780708074728517,"score_spread":0.2513948812093032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150494733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5683506,0.000021680578,0.4209811,0.008937588,0.00027355,0.00018065887,0.000002623963,0.0004627035,0.0007894853],"genre_scores_gemma":[0.77583396,0.000028261968,0.2228776,0.0012131535,0.000010516064,0.000019047295,0.000004410802,0.000008626393,0.0000044317762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879843,0.00024250979,0.00032879226,0.0002551288,0.00018948705,0.00018566851],"domain_scores_gemma":[0.99618524,0.0003777365,0.0002404628,0.003006325,0.00014027824,0.000049924616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044088942,0.00014217972,0.00020779425,0.0001987681,0.00026644193,0.000062060884,0.002173986,0.00006241162,0.0000021281746],"category_scores_gemma":[0.00010477413,0.00015509881,0.00008065102,0.0005067338,0.00033526646,0.000300455,0.0002913405,0.00035140768,0.00003511686],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034527122,0.00092551636,0.0053524147,0.00008036241,0.00010095904,0.000008953057,0.0037353677,0.00534877,0.46221817,0.5069918,0.0060004448,0.009202725],"study_design_scores_gemma":[0.0010019315,0.00021710906,0.00917176,0.0004919808,0.00003198911,0.000062249834,0.00012342872,0.008992659,0.9170201,0.061647575,0.00053835387,0.0007008643],"about_ca_topic_score_codex":0.00041566778,"about_ca_topic_score_gemma":0.00014316311,"teacher_disagreement_score":0.45480192,"about_ca_system_score_codex":0.00014510081,"about_ca_system_score_gemma":0.00006843944,"threshold_uncertainty_score":0.6324746},"labels":[],"label_agreement":null},{"id":"W2150588967","doi":"10.1109/lcomm.2009.081471","title":"Resource allocation for non-real-time services in OFDM-based cognitive radio systems","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive radio; Orthogonal frequency-division multiplexing; Computer science; Resource allocation; Throughput; Resource management (computing); Real-time computing; Computer network; Telecommunications; Wireless; Channel (broadcasting)","score_opus":0.011015170029863467,"score_gpt":0.24081327119715937,"score_spread":0.2297981011672959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150588967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112559415,0.00057173846,0.8781585,0.0038079838,0.0001686635,0.0019199966,0.00005595429,0.000715802,0.0020419494],"genre_scores_gemma":[0.98052096,0.00014138213,0.017788207,0.0005124793,0.00006370637,0.00028950555,0.0006263299,0.000042374173,0.000015060638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999146,0.00007357802,0.00031348295,0.00015701573,0.00008555116,0.00022435823],"domain_scores_gemma":[0.9986641,0.00036429593,0.000083389416,0.0007766657,0.00006877492,0.000042766704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015903037,0.00015714273,0.00018874562,0.00018167803,0.000117805626,0.00004538071,0.00049237505,0.00007519634,0.0000013690649],"category_scores_gemma":[0.000009517199,0.00019461139,0.00004122093,0.0003756977,0.000043323635,0.000204811,0.000013082592,0.00014357561,0.000014129758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012870827,0.000035055462,0.00007148144,0.000043886645,0.000013554694,2.3013969e-7,0.00027228618,0.973536,0.023351183,0.00010555343,0.00061261974,0.0019452474],"study_design_scores_gemma":[0.0006876343,0.000018963277,0.00058643287,0.00027309195,0.000019603855,6.2633615e-7,0.000074870215,0.99599415,0.000979907,0.00001881879,0.0011441443,0.00020173482],"about_ca_topic_score_codex":0.0000260373,"about_ca_topic_score_gemma":0.000023543847,"teacher_disagreement_score":0.8679615,"about_ca_system_score_codex":0.00017115992,"about_ca_system_score_gemma":0.000012572095,"threshold_uncertainty_score":0.7936022},"labels":[],"label_agreement":null},{"id":"W2150855628","doi":"10.1109/lcomm.2010.02.091897","title":"An autonomous power control for achieving the maximum uniform SIR in wireless networks","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Power control; Tracing; Wireless; Wireless network; Signal-to-interference ratio; Process (computing); Power (physics); State (computer science); Interference (communication); Computer network; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.022154474638119724,"score_gpt":0.29455887654878804,"score_spread":0.27240440191066834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150855628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10411269,0.00013132804,0.8170241,0.07639856,0.00043917875,0.0011595025,0.000007037974,0.00024240992,0.00048518603],"genre_scores_gemma":[0.9664115,0.00008555028,0.028616112,0.0042839954,0.00008184773,0.0004483567,0.000022422813,0.000034494748,0.00001574846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756867,0.0006469156,0.00051729317,0.00037862945,0.0002674056,0.00062106503],"domain_scores_gemma":[0.9881801,0.0021441544,0.00020321498,0.009152501,0.0001807323,0.00013928898],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020206454,0.00022144474,0.00024927413,0.00021918898,0.00091113016,0.0005074573,0.013320378,0.0001458206,0.0000063357184],"category_scores_gemma":[0.00006735371,0.00018950696,0.000113935355,0.0008064524,0.00049876765,0.0008175722,0.00073065725,0.001534107,0.00001499089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012194817,0.0018029946,0.009204269,0.00003447167,0.00023339686,0.000010350594,0.007782617,0.1750854,0.120090276,0.3826617,0.00788517,0.29508743],"study_design_scores_gemma":[0.0007051041,0.0000394408,0.0063589443,0.000020082747,0.000005930822,0.0000101563055,0.00007292175,0.98226476,0.00008584663,0.00049397064,0.0096763,0.00026652226],"about_ca_topic_score_codex":0.000118177035,"about_ca_topic_score_gemma":0.0012120965,"teacher_disagreement_score":0.8622988,"about_ca_system_score_codex":0.000111476984,"about_ca_system_score_gemma":0.00012307028,"threshold_uncertainty_score":0.99201804},"labels":[],"label_agreement":null},{"id":"W2151332859","doi":"10.1109/lcomm.2005.03021","title":"Outage and BER of MRC diversity in bandlimited micro-cellular systems with CCI","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Rayleigh fading; Maximal-ratio combining; Phase-shift keying; Fading distribution; Nakagami distribution; Diversity combining; Bit error rate; Algorithm; Interference (communication); Bandlimiting; Gaussian; Computer science; Mathematics; Statistics; Telecommunications; Physics; Decoding methods; Mathematical analysis","score_opus":0.02060753652320981,"score_gpt":0.22363323631441787,"score_spread":0.20302569979120805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151332859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9693967,0.0016203236,0.026719693,0.0011481041,0.000021270702,0.0002915674,0.000011310254,0.00026226506,0.00052876864],"genre_scores_gemma":[0.97106785,0.0009270115,0.027817637,0.00008871065,0.0000072325633,0.00003808718,0.000017548822,0.000022091115,0.00001381541],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993567,0.00007896018,0.00024456362,0.000100532205,0.00008858864,0.00013067493],"domain_scores_gemma":[0.9981599,0.00012973606,0.000068245994,0.0015697539,0.00003826829,0.00003411094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001267056,0.000118227596,0.0001877573,0.00017631108,0.00010806198,0.000014689446,0.0007586657,0.00005050342,0.0000025839588],"category_scores_gemma":[0.000004945558,0.00012622481,0.000021220743,0.000227113,0.0001897957,0.00020579943,0.0002723798,0.00024776484,0.0000042504457],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035339865,0.0003296883,0.10477938,0.00029185342,0.00019593099,0.0000050630024,0.0064929607,0.15100506,0.72506005,0.0013926267,0.0018879889,0.008524076],"study_design_scores_gemma":[0.007399394,0.00018776617,0.084094405,0.0021572139,0.00027798524,0.000074446645,0.0023062015,0.392538,0.44011074,0.00023426843,0.0670576,0.0035619456],"about_ca_topic_score_codex":0.00013284839,"about_ca_topic_score_gemma":0.00015719535,"teacher_disagreement_score":0.28494927,"about_ca_system_score_codex":0.0000939616,"about_ca_system_score_gemma":0.000004539577,"threshold_uncertainty_score":0.51472986},"labels":[],"label_agreement":null},{"id":"W2151536027","doi":"10.1109/lcomm.2005.1437363","title":"Low-frequency performance of guided scrambling DC-free codes","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scrambling; Computer science; Algorithm; Coding (social sciences); Mathematics; Statistics","score_opus":0.04577684230644586,"score_gpt":0.2944407753261159,"score_spread":0.24866393301967005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151536027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42331132,0.00046640917,0.5361214,0.037899688,0.00014544846,0.00022398657,0.000021983073,0.0008067916,0.0010029274],"genre_scores_gemma":[0.5353623,0.00026016857,0.46342385,0.00088798674,0.00001475999,0.000025235162,0.0000064968854,0.0000075195762,0.000011643926],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987596,0.00006489158,0.0004236859,0.00025696272,0.00022929364,0.0002655423],"domain_scores_gemma":[0.9913731,0.00019643769,0.00023485516,0.008040482,0.000117170435,0.00003795719],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00027597693,0.00014892028,0.00018881548,0.00023796152,0.000248141,0.00005347003,0.009554368,0.00005978419,0.0000037263628],"category_scores_gemma":[0.0001834659,0.00015545634,0.000054533328,0.0006508852,0.00045765474,0.0013493827,0.00152229,0.00028823217,0.000051670544],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007133322,0.00038027053,0.0022140038,0.000087437606,0.00007956918,0.000005217275,0.0013429028,0.0127312,0.72684366,0.088822156,0.02968892,0.13779755],"study_design_scores_gemma":[0.0019467559,0.00019626759,0.0029500783,0.0005166419,0.00004560246,0.00009729756,0.00017945645,0.22212163,0.73411703,0.0069493554,0.029312475,0.0015674146],"about_ca_topic_score_codex":0.000024121215,"about_ca_topic_score_gemma":0.000030247438,"teacher_disagreement_score":0.20939043,"about_ca_system_score_codex":0.00011256331,"about_ca_system_score_gemma":0.000040875977,"threshold_uncertainty_score":0.9958044},"labels":[],"label_agreement":null},{"id":"W2151900023","doi":"10.1109/lcomm.2009.082047","title":"Error performances of multi shift-register convolutional self-doubly-orthogonal codes","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Decoding methods; Algorithm; Sequential decoding; Computer science; Serial concatenated convolutional codes; List decoding; Encoder; Turbo code; Berlekamp–Welch algorithm; Concatenated error correction code; Theoretical computer science; Block code","score_opus":0.053560968813009764,"score_gpt":0.3154537368189577,"score_spread":0.26189276800594796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151900023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40105665,0.00054675544,0.5527523,0.041363087,0.0005023573,0.000508108,0.000019412164,0.0016402547,0.0016110335],"genre_scores_gemma":[0.7211241,0.000035043115,0.2767624,0.001993081,0.000024052537,0.000024868794,0.000010310343,0.000007092162,0.000019020916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985052,0.00019193297,0.0004428489,0.00028292564,0.00030881504,0.0002683031],"domain_scores_gemma":[0.99680734,0.0002491817,0.00028524327,0.0024597284,0.00013224619,0.00006625027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004853419,0.00018013039,0.0002211973,0.00021641147,0.00030797417,0.00006805066,0.0034847788,0.000072824914,0.0000053133094],"category_scores_gemma":[0.00003115999,0.00018364283,0.00011080375,0.00041178972,0.00025463008,0.0006192715,0.00028330414,0.00036331243,0.000026008684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015790484,0.007336651,0.11352583,0.00030228324,0.00075280067,0.000037681628,0.045243982,0.004999702,0.27555192,0.3847228,0.093777224,0.07359123],"study_design_scores_gemma":[0.002559063,0.0006413463,0.28447482,0.0005016515,0.00012487816,0.00019566716,0.00016239785,0.6321929,0.030305952,0.0048365323,0.041765314,0.0022394797],"about_ca_topic_score_codex":0.000049084836,"about_ca_topic_score_gemma":0.000063764535,"teacher_disagreement_score":0.6271932,"about_ca_system_score_codex":0.000086578795,"about_ca_system_score_gemma":0.00008563466,"threshold_uncertainty_score":0.7488737},"labels":[],"label_agreement":null},{"id":"W2152076414","doi":"10.1109/lcomm.2005.1496587","title":"Outage probability at arbitrary SNR with cooperative diversity","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":221,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Independent and identically distributed random variables; Computer science; Outage probability; Signal-to-noise ratio (imaging); Cooperative diversity; Diversity combining; Wireless; Wireless network; Topology (electrical circuits); Random variable; Fading; Computer network; Algorithm; Channel (broadcasting); Telecommunications; Mathematics; Statistics; Combinatorics","score_opus":0.058431341688053036,"score_gpt":0.26648860455035905,"score_spread":0.20805726286230602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152076414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.500511,0.0011594164,0.29993567,0.18236527,0.00020692917,0.00116206,0.00001673337,0.0008457326,0.013797213],"genre_scores_gemma":[0.90845245,0.00039409622,0.08239065,0.008335596,0.000042739313,0.00006492113,0.000017666007,0.0000113973265,0.00029046004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982959,0.00051228877,0.0002728556,0.00038398348,0.0002507521,0.0002842304],"domain_scores_gemma":[0.9948577,0.00030253205,0.00012776825,0.0043952377,0.00019304547,0.00012368718],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003929405,0.00020641112,0.00019969065,0.00009614492,0.0019523307,0.00014425407,0.004377146,0.000047268695,0.000044507146],"category_scores_gemma":[0.000027029559,0.00018572659,0.00006979236,0.00059695914,0.0004349018,0.0008793636,0.0037082473,0.00041386142,0.00014562477],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003093981,0.00465647,0.11289336,0.00009988537,0.0010874105,0.000046347945,0.087267205,0.022685735,0.05749501,0.35579202,0.14208294,0.21558422],"study_design_scores_gemma":[0.0056507527,0.0004890713,0.06816094,0.0003506796,0.00014141423,0.00017506383,0.00030611694,0.25321314,0.018851101,0.0010622669,0.6477823,0.003817095],"about_ca_topic_score_codex":0.000016099597,"about_ca_topic_score_gemma":0.00077374605,"teacher_disagreement_score":0.5056994,"about_ca_system_score_codex":0.00033721613,"about_ca_system_score_gemma":0.000062940395,"threshold_uncertainty_score":0.999347},"labels":[],"label_agreement":null},{"id":"W2152339012","doi":"10.1109/lcomm.2006.1638613","title":"Global expansion model for mobile networks","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"UMTS frequency bands; Computer science; Core network; Cellular network; Generalization; Mathematical optimization; Network planning and design; Mobile telephony; Computer network; Network model; Distributed computing; Core (optical fiber); Telecommunications; Mobile radio; Artificial intelligence; Mathematics","score_opus":0.015425792949159179,"score_gpt":0.2512800604742272,"score_spread":0.235854267525068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152339012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005938058,0.0006019885,0.9915786,0.00020384807,0.00019401885,0.00046380254,0.000034726734,0.00040568362,0.0005793143],"genre_scores_gemma":[0.8971228,0.00007742162,0.10181564,0.00016246834,0.00007607368,0.0005246202,0.00014613864,0.000031241874,0.000043570442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942654,0.000018421897,0.00022504792,0.00010347434,0.00004835955,0.00017814366],"domain_scores_gemma":[0.99885404,0.000055881697,0.00003799075,0.0009848609,0.0000417374,0.000025467862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006126519,0.000109904795,0.00010581439,0.000035156274,0.00013508236,0.000024037112,0.00039526063,0.00005777879,9.623413e-7],"category_scores_gemma":[0.0000034729576,0.00012927108,0.000050491155,0.00016844709,0.00004102116,0.0001609984,0.000030468222,0.0000677353,0.000005459447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014861928,0.000012577323,0.000054776774,0.000008731107,0.000005998767,6.529177e-8,0.000022260645,0.98277706,0.0025034328,0.0003918483,0.013500734,0.0007210586],"study_design_scores_gemma":[0.00018997217,0.0000036043655,0.000025585425,0.000015083513,0.000009832322,0.0000015906717,0.000010173213,0.99747187,0.00009358474,0.00016897602,0.0018786958,0.00013103294],"about_ca_topic_score_codex":0.000019940146,"about_ca_topic_score_gemma":0.000093205774,"teacher_disagreement_score":0.89118475,"about_ca_system_score_codex":0.0001626917,"about_ca_system_score_gemma":0.000006231776,"threshold_uncertainty_score":0.5271522},"labels":[],"label_agreement":null},{"id":"W2152682756","doi":"10.1109/lcomm.2002.806444","title":"Symbol error probability of low-order orthogonal signalings in Rayleigh fading with general diversity combining","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Rayleigh fading; Computer science; Symbol (formal); Probability of error; Diversity (politics); Diversity scheme; Telecommunications; Order (exchange); Algorithm; Mathematics; Decoding methods","score_opus":0.04129030506385535,"score_gpt":0.23129325578749454,"score_spread":0.1900029507236392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152682756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947021,0.00011523256,0.0025550162,0.001156686,0.00011637014,0.00022649587,0.000008715266,0.00014117252,0.0009781938],"genre_scores_gemma":[0.98873264,0.000029587583,0.010992758,0.0001367523,0.00001949247,0.00003779002,0.000008883239,0.000021610902,0.000020501611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990535,0.00009761201,0.00030455456,0.00015350863,0.00017764285,0.000213228],"domain_scores_gemma":[0.9987735,0.0001156054,0.00006945263,0.00092468486,0.0000671259,0.000049615952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018239056,0.0001428424,0.00020044435,0.00016313631,0.00018869489,0.000015195312,0.0006685674,0.00005402044,0.00006698512],"category_scores_gemma":[0.000020985046,0.00015607581,0.000047360976,0.00048379638,0.0002591796,0.00020385855,0.00016540498,0.00034976978,0.000011556931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024606235,0.00041134201,0.15934277,0.00022439544,0.00020136125,0.000006636185,0.009159336,0.68161535,0.14483759,0.00057164574,0.0027601838,0.00084481103],"study_design_scores_gemma":[0.0063335616,0.00016856623,0.087878354,0.00112645,0.00021235133,0.00009120529,0.0015563704,0.8621396,0.03516178,0.00062192767,0.0021893084,0.002520527],"about_ca_topic_score_codex":0.00006231515,"about_ca_topic_score_gemma":0.000054837477,"teacher_disagreement_score":0.18052427,"about_ca_system_score_codex":0.00014826031,"about_ca_system_score_gemma":0.000009394142,"threshold_uncertainty_score":0.6364587},"labels":[],"label_agreement":null},{"id":"W2152683668","doi":"10.1109/lcomm.2002.808378","title":"A rate adaptation algorithm for multicast sources in priority-based IP networks","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; IP multicast; Quality of service; Source-specific multicast; Distributed computing; Protocol Independent Multicast; Pragmatic General Multicast; Multicast address; Adaptation (eye); Distance Vector Multicast Routing Protocol; Inter-domain; Algorithm","score_opus":0.028575925008132833,"score_gpt":0.2583156522136632,"score_spread":0.22973972720553038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152683668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029718478,0.00032605758,0.986065,0.009650448,0.00028796954,0.0004947991,0.0000027396018,0.00013669582,0.00006449125],"genre_scores_gemma":[0.6445995,0.000028672206,0.3516724,0.003334229,0.000038248945,0.00028588623,0.000011030585,0.0000107542755,0.000019271441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985339,0.00048091673,0.0003109029,0.00027012546,0.00010585526,0.00029829622],"domain_scores_gemma":[0.99742156,0.0009619586,0.00012247018,0.0013345518,0.00009133186,0.000068152156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071081525,0.00014145559,0.00016291972,0.00013552295,0.00027099965,0.0001409203,0.0012177809,0.00006360418,0.0000018810125],"category_scores_gemma":[0.000053776148,0.0001533171,0.00007880062,0.0004585579,0.000103466,0.00024191388,0.00004295997,0.0002310359,0.000009766709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008157671,0.00018458709,0.00021850206,0.0000054216603,0.000024578056,0.0000024371432,0.0005873723,0.29401287,0.00020279695,0.013443299,0.0007724976,0.69053745],"study_design_scores_gemma":[0.0010783047,0.00002125578,0.00029568572,0.000024445519,0.000009607674,0.0000016443169,0.000037326114,0.986376,0.000044877987,0.00012786014,0.01181317,0.00016981359],"about_ca_topic_score_codex":0.000020664213,"about_ca_topic_score_gemma":0.00009769362,"teacher_disagreement_score":0.69236314,"about_ca_system_score_codex":0.00006381183,"about_ca_system_score_gemma":0.00008169629,"threshold_uncertainty_score":0.62520903},"labels":[],"label_agreement":null},{"id":"W2153147836","doi":"10.1109/lcomm.2012.111412.122095","title":"On Gaussian Interference Channels with Constellation-Based Transmitters","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interference (communication); Upper and lower bounds; Topology (electrical circuits); Gaussian noise; Transmitter; Constellation; Gaussian; Computer science; Channel (broadcasting); Telecommunications; Algorithm; Multiplexing; Noise (video); Mathematics; Physics; Combinatorics; Mathematical analysis; Artificial intelligence","score_opus":0.02518670509392166,"score_gpt":0.2554933746075786,"score_spread":0.23030666951365694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153147836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081334725,0.0004676801,0.8959148,0.008409554,0.0002666596,0.0005974252,0.000018829154,0.0018159172,0.011174407],"genre_scores_gemma":[0.96986496,0.00011249981,0.02795428,0.0018272396,0.000025598118,0.0001132403,0.000039732302,0.000055576966,0.0000068447034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990987,0.00010751018,0.00025007318,0.00011569306,0.00013283365,0.000295159],"domain_scores_gemma":[0.99711293,0.0004145617,0.00006174487,0.0022748515,0.000032791413,0.00010311665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012697816,0.00020847445,0.00016476194,0.0002015551,0.00016996832,0.00003611369,0.0010278814,0.00005813607,0.000031219824],"category_scores_gemma":[0.0000066318125,0.00020290793,0.00004803642,0.00028992904,0.00027646843,0.0002780774,0.000029461078,0.00038454108,0.000055071334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013667649,0.0008594364,0.0064643454,0.000246248,0.00038770374,0.0000034085338,0.0058219363,0.7129286,0.15486343,0.023473911,0.0222242,0.07259009],"study_design_scores_gemma":[0.0038857434,0.00042630857,0.0033638214,0.002185691,0.0002128761,0.000054058735,0.0007369994,0.37079015,0.52157295,0.0009996819,0.091222174,0.0045495224],"about_ca_topic_score_codex":0.0000068321656,"about_ca_topic_score_gemma":0.0000066085117,"teacher_disagreement_score":0.88853025,"about_ca_system_score_codex":0.00014966345,"about_ca_system_score_gemma":0.00001331584,"threshold_uncertainty_score":0.82743454},"labels":[],"label_agreement":null},{"id":"W2153537785","doi":"10.1109/lcomm.2002.803478","title":"System performance comparison of optical CDMA and WDMA in a broadcast local area network","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Code division multiple access; Wavelength-division multiplexing; Computer network; Network packet; Throughput; Electronic engineering; Wavelength; Telecommunications; Optics; Wireless; Engineering; Physics","score_opus":0.029233353584602658,"score_gpt":0.22064663134310156,"score_spread":0.1914132777584989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153537785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888141,0.0023315635,0.005104609,0.00022800973,0.00015622143,0.00014930083,0.0000028989523,0.00010380835,0.00310947],"genre_scores_gemma":[0.99906456,0.00013073774,0.00068171695,0.000039757775,0.00002284073,0.00003640786,0.0000033145063,0.00001515908,0.0000055179903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992045,0.00008599783,0.000353478,0.0000885376,0.000082243125,0.00018519831],"domain_scores_gemma":[0.9989799,0.0001387528,0.000042561296,0.0007801911,0.000014022471,0.000044534656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017611425,0.00010868429,0.00023402256,0.00008268988,0.00008163211,0.000015969228,0.00039102713,0.000058215363,0.0000047033313],"category_scores_gemma":[0.000003090714,0.0001157052,0.000032571734,0.00025915066,0.00020322039,0.00008525543,0.000045372115,0.00023683693,0.000016648535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039046736,0.00029449104,0.093922265,0.001274314,0.00019437868,0.000008838077,0.008060316,0.7923114,0.014531208,0.012667233,0.01175728,0.064939275],"study_design_scores_gemma":[0.00032682365,0.000023320137,0.0038098083,0.00039277948,0.000015757025,0.000024420284,0.0005951527,0.9921236,0.00052896864,0.0000060810817,0.0019808034,0.00017245483],"about_ca_topic_score_codex":0.000010509872,"about_ca_topic_score_gemma":0.000022113109,"teacher_disagreement_score":0.19981228,"about_ca_system_score_codex":0.000046887864,"about_ca_system_score_gemma":0.0000015464069,"threshold_uncertainty_score":0.4718321},"labels":[],"label_agreement":null},{"id":"W2153626693","doi":"10.1109/lcomm.2007.061618","title":"A New Routing-Based Admission Control for MPLS Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Computer network; Blocking (statistics); Routing (electronic design automation); Admission control; Quality of service","score_opus":0.0209120449120827,"score_gpt":0.2711381835548053,"score_spread":0.2502261386427226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153626693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042380698,0.00034535272,0.95018345,0.047513865,0.00048731477,0.0005020091,0.000001957374,0.00032765666,0.00021455991],"genre_scores_gemma":[0.84839594,0.000009413238,0.1353626,0.015806705,0.00025108882,0.000056329798,0.000009778948,0.000014879017,0.00009325886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986266,0.00011624593,0.00037527928,0.00028442102,0.00016560362,0.0004318859],"domain_scores_gemma":[0.99595433,0.0014466817,0.00017466812,0.0020878082,0.00010532704,0.00023118962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008335873,0.00016495933,0.00018974266,0.00010561313,0.00042791115,0.00014199219,0.002385003,0.00008480104,0.000005946094],"category_scores_gemma":[0.000058640806,0.00016463058,0.00014497264,0.00035709958,0.00006341525,0.0001971637,0.00008063579,0.000242812,0.000017243072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096735566,0.00012051424,0.00047119512,0.000005556477,0.00006706397,0.000003836285,0.0001780896,0.0705723,0.0021246944,0.043283276,0.07098507,0.81209165],"study_design_scores_gemma":[0.0018732013,0.000044532826,0.00041114795,0.000036454934,0.000024116534,0.0000033899446,0.0000060592047,0.94648486,0.000102566875,0.00013609024,0.050663732,0.00021384053],"about_ca_topic_score_codex":0.000022511531,"about_ca_topic_score_gemma":0.00005090943,"teacher_disagreement_score":0.87591255,"about_ca_system_score_codex":0.00006930789,"about_ca_system_score_gemma":0.00012631241,"threshold_uncertainty_score":0.671344},"labels":[],"label_agreement":null},{"id":"W2153710761","doi":"10.1109/lcomm.2006.060496.","title":"Closed-form BER analysis for antenna selection using orthogonal space-time block codes","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bit error rate; Block code; MIMO; Rayleigh fading; Algorithm; Mathematics; Phase-shift keying; Antenna (radio); Computer science; Transmission (telecommunications); Fading; Topology (electrical circuits); Channel (broadcasting); Telecommunications; Combinatorics; Decoding methods","score_opus":0.02066636143318601,"score_gpt":0.2683825703416671,"score_spread":0.24771620890848112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153710761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32079196,0.00033876311,0.6755383,0.001323334,0.000045024597,0.00043305792,0.000067035195,0.0010802668,0.0003822405],"genre_scores_gemma":[0.8039205,0.00014031034,0.19524723,0.00014970658,0.00005185819,0.00016223152,0.00021290776,0.000055128774,0.00006011137],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884677,0.00007702449,0.0004431454,0.00018891045,0.00014472088,0.00029940548],"domain_scores_gemma":[0.99765486,0.00027799557,0.00013587809,0.0017343854,0.00015168439,0.0000452071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019812731,0.00022379016,0.0003068326,0.00048438204,0.00041857242,0.00006239483,0.0008947133,0.00010129436,0.000012012799],"category_scores_gemma":[0.000015157153,0.0002656544,0.0002192078,0.0011000619,0.00015837997,0.00028589737,0.00008970915,0.0002769517,0.000012641358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090677,0.00008978996,0.003570005,0.00002556552,0.000444359,2.6693573e-7,0.00009771083,0.32864213,0.6624444,0.001171422,0.0027360169,0.0007692334],"study_design_scores_gemma":[0.00025515334,0.000012476904,0.003020839,0.000030870964,0.00033995922,0.000006292463,0.000019615078,0.9612277,0.026038751,0.0005381509,0.008070939,0.00043925963],"about_ca_topic_score_codex":0.000111984606,"about_ca_topic_score_gemma":0.00030205844,"teacher_disagreement_score":0.6364057,"about_ca_system_score_codex":0.0002735354,"about_ca_system_score_gemma":0.00001751241,"threshold_uncertainty_score":0.99997956},"labels":[],"label_agreement":null},{"id":"W2153722101","doi":"10.1109/lcomm.2007.070097","title":"Outage Probability of Selection Cooperation in the Low to Medium SNR Regime","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Outage probability; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Computer science; Diversity combining; Maximal-ratio combining; Channel (broadcasting); Diversity gain; Diversity (politics); Mathematical optimization; Algorithm; Statistics; Applied mathematics; Mathematics; Telecommunications; Fading; Artificial intelligence","score_opus":0.052521437649329726,"score_gpt":0.3080261926892231,"score_spread":0.2555047550398934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153722101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23087983,0.00013509514,0.6800568,0.086604625,0.00016551785,0.00080320763,0.0000012649336,0.00009085275,0.0012628037],"genre_scores_gemma":[0.9617646,0.00009864618,0.032879047,0.005126334,0.000029222747,0.00006781288,0.000006866009,0.0000061392584,0.000021357664],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99827147,0.0006220816,0.00046042257,0.0002146828,0.00022141178,0.00020996502],"domain_scores_gemma":[0.9962917,0.00059325,0.00012394227,0.0027318588,0.00021125059,0.00004800491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025437858,0.00011228198,0.00013978459,0.00020303225,0.0002961577,0.000086015345,0.0033482823,0.000043682347,0.0000060054335],"category_scores_gemma":[0.00016886598,0.00009555943,0.000045814864,0.001643101,0.00013079833,0.00033373846,0.00033814652,0.0003239457,0.00001967247],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006651294,0.001580949,0.011111556,0.00005914335,0.000060982155,0.000003871793,0.049744356,0.008042253,0.6400486,0.17255916,0.023726437,0.09299615],"study_design_scores_gemma":[0.004032204,0.000800369,0.41784325,0.000875323,0.00007140633,0.000107394,0.0015460057,0.20378426,0.19109805,0.003190131,0.17389195,0.0027596653],"about_ca_topic_score_codex":0.000038086997,"about_ca_topic_score_gemma":0.0016534711,"teacher_disagreement_score":0.73088473,"about_ca_system_score_codex":0.00012352917,"about_ca_system_score_gemma":0.000058957125,"threshold_uncertainty_score":0.6221997},"labels":[],"label_agreement":null},{"id":"W2153846560","doi":"10.1109/lcomm.2005.1413619","title":"Precise BER analysis of dual-channel reception of QPSK in Nakagami fading and cochannel interference","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Phase-shift keying; Nakagami distribution; Keying; Bit error rate; Quadrature amplitude modulation; Computer science; Electronic engineering; Quadrature (astronomy); Fading distribution; Amplitude and phase-shift keying; Interference (communication); Channel (broadcasting); Telecommunications; Rayleigh fading; Engineering","score_opus":0.026613628615788202,"score_gpt":0.27929205513735184,"score_spread":0.25267842652156364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153846560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84658056,0.0013287019,0.15000537,0.0011476926,0.00003221745,0.00024317169,0.000031313233,0.00018092855,0.00045001414],"genre_scores_gemma":[0.9714221,0.0036853673,0.024696577,0.000057087578,0.00000578094,0.000072328585,0.000035179688,0.000019199924,0.000006427742],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990461,0.00010094384,0.00051643915,0.0001202965,0.000091016256,0.00012524133],"domain_scores_gemma":[0.9979764,0.00025781494,0.00014722513,0.0015183327,0.00006959539,0.000030594532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002215028,0.00012345648,0.00030337344,0.0007149247,0.000040774274,0.0000086987975,0.00057062425,0.00006390187,0.000007555879],"category_scores_gemma":[0.000032520173,0.00014807358,0.000064861095,0.00086567283,0.00019207157,0.00025392132,0.0001586743,0.00023006144,0.0000015766082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015514195,0.00016660457,0.0021294318,0.00008107819,0.00039814107,2.7546795e-7,0.00842865,0.43678823,0.52008176,0.0006419498,0.00044847684,0.030819867],"study_design_scores_gemma":[0.0005766662,0.000039929124,0.014914054,0.00052615226,0.00031414986,0.0000034359246,0.0006480642,0.7952157,0.18600482,0.00039161125,0.00080182945,0.00056356104],"about_ca_topic_score_codex":0.000058228532,"about_ca_topic_score_gemma":0.00031796985,"teacher_disagreement_score":0.3584275,"about_ca_system_score_codex":0.00009462817,"about_ca_system_score_gemma":0.0000043882833,"threshold_uncertainty_score":0.6038265},"labels":[],"label_agreement":null},{"id":"W2153875891","doi":"10.1109/lcomm.2005.1496590","title":"CRLBs for NDA ML estimation of UWB channels","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Computer science; Bandwidth (computing); Maximum likelihood; Channel (broadcasting); Algorithm; Cramér–Rao bound; Estimation theory; Statistics; Electronic engineering; Telecommunications; Mathematics; Engineering","score_opus":0.021453627363610662,"score_gpt":0.26126894758816344,"score_spread":0.23981532022455276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153875891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3263054,0.0025385367,0.6067408,0.05768073,0.00046125992,0.0013087274,0.00008779998,0.0017669571,0.0031098241],"genre_scores_gemma":[0.87529546,0.0002781946,0.123550795,0.00037201657,0.000028428038,0.0003477721,0.00006489907,0.000032973127,0.00002947752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992212,0.000039155188,0.00037198493,0.000102579215,0.000076915705,0.00018814452],"domain_scores_gemma":[0.996849,0.0003274041,0.00007900142,0.0026482167,0.00006543559,0.000030945732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015853187,0.00012773175,0.00017532868,0.00021689331,0.00014975414,0.000018674433,0.001484735,0.000092509086,0.000010659049],"category_scores_gemma":[0.000055674245,0.00015044693,0.00007949287,0.00028673507,0.00018442057,0.00018734777,0.00007531,0.0002077773,0.00003839824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010326607,0.00022218516,0.00010424564,0.00010292224,0.00019007438,1.2091562e-7,0.0014314231,0.60561854,0.19604474,0.010062036,0.035583794,0.15062961],"study_design_scores_gemma":[0.00075233425,0.000040882365,0.00020921536,0.000078398436,0.000074492404,0.000010526957,0.00010529378,0.72950727,0.10642564,0.0010909217,0.16127962,0.0004253736],"about_ca_topic_score_codex":0.000012367306,"about_ca_topic_score_gemma":0.000033694076,"teacher_disagreement_score":0.5489901,"about_ca_system_score_codex":0.00009172496,"about_ca_system_score_gemma":0.000012429554,"threshold_uncertainty_score":0.61350477},"labels":[],"label_agreement":null},{"id":"W2154002584","doi":"10.1109/lcomm.2007.070656","title":"Mixture Lognormal Approximations to Lognormal Sum Distributions","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); Memorial University of Newfoundland; Université de Moncton","funders":"","keywords":"Log-normal distribution; Mathematics; Applied mathematics; Statistical physics; Statistics; Physics","score_opus":0.0346912753115039,"score_gpt":0.31139384785856244,"score_spread":0.27670257254705855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154002584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008795711,0.00020140997,0.90462345,0.08165826,0.00024824915,0.00054064504,0.000028572207,0.00042228986,0.003481404],"genre_scores_gemma":[0.7777534,0.00007756892,0.21819603,0.0034235963,0.000094012925,0.00017593967,0.00013560444,0.000021691114,0.00012216465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971769,0.0003979809,0.000635774,0.00042288916,0.0005325464,0.0008339292],"domain_scores_gemma":[0.99074495,0.0010179805,0.00015883797,0.0073236055,0.00035920204,0.00039539664],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015353379,0.00024807377,0.00022867597,0.00048293185,0.001281799,0.00035815025,0.009477413,0.00012986886,0.000018394954],"category_scores_gemma":[0.00017246677,0.00026912094,0.00013743414,0.002388982,0.0003674658,0.0008860365,0.0022548193,0.0008924134,0.00025837024],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047517507,0.0016199121,0.0049770786,0.000046782792,0.00024386407,0.00003129263,0.004996757,0.015675317,0.047514293,0.59083325,0.21686155,0.11715239],"study_design_scores_gemma":[0.0018658194,0.0002008976,0.04916987,0.00021212928,0.000064975,0.00022446254,0.00045959398,0.23992285,0.014657076,0.0023570906,0.6883038,0.0025614111],"about_ca_topic_score_codex":0.000073590025,"about_ca_topic_score_gemma":0.00033593934,"teacher_disagreement_score":0.7689577,"about_ca_system_score_codex":0.00026978666,"about_ca_system_score_gemma":0.00011610685,"threshold_uncertainty_score":0.9999761},"labels":[],"label_agreement":null},{"id":"W2154612888","doi":"10.1109/lcomm.2008.080713","title":"LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Ergodic theory; Channel (broadcasting); Binary symmetric channel; Channel code; Binary number; Algorithm; Computer science; List decoding; Mathematics; Low-density parity-check code; Sequential decoding; Linear programming; Joint (building); Coding (social sciences); Channel capacity; Telecommunications; Concatenated error correction code; Block code; Statistics; Arithmetic; Engineering; Mathematical analysis","score_opus":0.09762366274818501,"score_gpt":0.3042148243508912,"score_spread":0.20659116160270619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154612888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0157267,0.00045183065,0.9493926,0.032859296,0.00028364605,0.00084152794,0.0000082032975,0.00037676413,0.000059412574],"genre_scores_gemma":[0.8033619,0.00030413302,0.19171934,0.0037438062,0.00007507131,0.0007010426,0.0000049976707,0.000025586918,0.00006411074],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889046,0.000076828255,0.00028298923,0.00029909858,0.00012692956,0.00032367848],"domain_scores_gemma":[0.9958772,0.0015920338,0.00016867857,0.0021851046,0.000114071874,0.000062909596],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006201901,0.00017193989,0.00019273409,0.00015514634,0.0015775235,0.000112925416,0.0023392853,0.00005988157,3.179882e-7],"category_scores_gemma":[0.00015415646,0.00014882101,0.00012451538,0.0002347244,0.00029258462,0.00024996352,0.0004879739,0.00021512929,0.0000031099548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001234939,0.000879445,0.0017254015,0.00039733123,0.00072752766,0.000010648056,0.10778334,0.0068139154,0.22690591,0.017289601,0.49345255,0.14389083],"study_design_scores_gemma":[0.0005627463,0.000113620044,0.000632246,0.00010283181,0.000038484217,0.00011366604,0.00030389044,0.9718678,0.015249369,0.0017114485,0.008859506,0.00044441991],"about_ca_topic_score_codex":0.00012795028,"about_ca_topic_score_gemma":0.0000868649,"teacher_disagreement_score":0.96505386,"about_ca_system_score_codex":0.00006317076,"about_ca_system_score_gemma":0.000041655072,"threshold_uncertainty_score":0.9997223},"labels":[],"label_agreement":null},{"id":"W2155986179","doi":"10.1109/4234.848407","title":"An analytical model for performance evaluation of parallel interference cancellers in CDMA systems","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Interference (communication); Variance (accounting); Computer science; Bit error rate; Code division multiple access; Noise (video); Single antenna interference cancellation; Variable (mathematics); Gaussian noise; Gaussian; Algorithm; Telecommunications; Mathematics; Decoding methods; Artificial intelligence","score_opus":0.1629419556172209,"score_gpt":0.38217888463259736,"score_spread":0.21923692901537645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155986179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4020323,0.0004484983,0.59036946,0.0049089473,0.00006490765,0.0009780461,0.000009364932,0.00006895008,0.0011195408],"genre_scores_gemma":[0.96214163,0.00054921303,0.036439225,0.00016947952,0.000013682334,0.00060661824,0.00002701267,0.000012571637,0.000040579947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977601,0.0006726504,0.000542193,0.00029751257,0.0004241997,0.00030330915],"domain_scores_gemma":[0.9946081,0.00033524394,0.00013020958,0.0044876304,0.00035536868,0.000083449784],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0019899106,0.00013307248,0.00022029021,0.00024180987,0.00017806294,0.00010399345,0.005419489,0.00006682551,0.00000937867],"category_scores_gemma":[0.000031300064,0.00014294796,0.000054399974,0.00063811056,0.00023246456,0.0007035499,0.00018394466,0.0002936713,0.000009375357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152111525,0.00013392705,0.00055939425,0.000013673167,0.0000123980835,3.9406473e-8,0.0008590108,0.94052345,0.0006677211,0.00420214,0.00038553818,0.052627474],"study_design_scores_gemma":[0.0005386769,0.000035007284,0.000856545,0.0000779827,0.000009091818,8.938462e-7,0.000029102424,0.99789596,0.00005312327,0.00016097672,0.00020026509,0.00014237227],"about_ca_topic_score_codex":0.00018783938,"about_ca_topic_score_gemma":0.00017380535,"teacher_disagreement_score":0.5601093,"about_ca_system_score_codex":0.00025296092,"about_ca_system_score_gemma":0.00021988591,"threshold_uncertainty_score":0.9999617},"labels":[],"label_agreement":null},{"id":"W2156370355","doi":"10.1109/lcomm.2005.1496583","title":"NDA estimation of SINR for QAM signals","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Quadrature amplitude modulation; QAM; Fading; Statistics; Signal-to-noise ratio (imaging); Signal-to-interference-plus-noise ratio; Interference (communication); Mean squared error; Computer science; Moment (physics); Quadrature (astronomy); Amplitude; Mathematics; Algorithm; Modulation (music); Noise (video); Channel (broadcasting); Telecommunications; Bit error rate; Electronic engineering; Acoustics; Physics; Artificial intelligence; Engineering","score_opus":0.027880137308777128,"score_gpt":0.29854312938339034,"score_spread":0.2706629920746132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156370355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03482333,0.0008402413,0.95432425,0.007709332,0.000055331533,0.0005380309,0.000037727383,0.000783142,0.0008886079],"genre_scores_gemma":[0.65929496,0.00029654673,0.33982345,0.0002705979,0.00001638825,0.00021755522,0.00004383148,0.00002632375,0.000010359045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992703,0.00004468459,0.00037462582,0.00008407921,0.00008758114,0.00013868418],"domain_scores_gemma":[0.99745965,0.00038272908,0.00009751338,0.001954109,0.000074536576,0.000031467458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016139209,0.000115191506,0.00016018217,0.00013653771,0.00010830837,0.000014685669,0.0010350858,0.00005227863,0.0000083807645],"category_scores_gemma":[0.00003919314,0.00013770202,0.000070023685,0.00018684681,0.00013209967,0.00027242023,0.00006330428,0.00014576629,0.000014450209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042195793,0.0000631354,0.00001538062,0.000053884567,0.00003825876,3.0190378e-8,0.0003698802,0.55625916,0.31840703,0.0026334785,0.009920826,0.11223469],"study_design_scores_gemma":[0.00027651098,0.000017631919,0.00008327699,0.000076164906,0.000022526929,0.0000017909897,0.0000304144,0.5897029,0.35684642,0.0006793888,0.05201538,0.00024759962],"about_ca_topic_score_codex":0.000004780043,"about_ca_topic_score_gemma":0.000010896573,"teacher_disagreement_score":0.6244716,"about_ca_system_score_codex":0.00009428262,"about_ca_system_score_gemma":0.000009284796,"threshold_uncertainty_score":0.56153256},"labels":[],"label_agreement":null},{"id":"W2156715130","doi":"10.1109/lcomm.2007.070842","title":"Lognormal Sum Approximation with Type IV Pearson Distribution","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"","keywords":"Kurtosis; Mathematics; Log-normal distribution; Heavy-tailed distribution; Pearson product-moment correlation coefficient; Skewness; Statistics; Random variable; Ratio distribution; Compound probability distribution; Type (biology); Distribution (mathematics); Probability distribution; Distribution fitting; Asymptotic distribution; Mathematical analysis","score_opus":0.02576260187283272,"score_gpt":0.2594602796849786,"score_spread":0.23369767781214587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156715130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056237742,0.000089107365,0.93781775,0.004366781,0.00032279923,0.00013743913,0.0000090440635,0.00027396783,0.0007453505],"genre_scores_gemma":[0.9056618,0.000049914473,0.09288529,0.0009806098,0.0000713009,0.000007442505,0.0003063106,0.000009640011,0.000027686507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989412,0.00009488951,0.0002334749,0.00022271066,0.00022916321,0.00027859522],"domain_scores_gemma":[0.9973964,0.00020775576,0.00012072453,0.0020793073,0.00012204308,0.00007378078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052529376,0.00011715374,0.000099029836,0.000074727446,0.00038186417,0.00014029654,0.0015735665,0.000057681675,0.0000047152535],"category_scores_gemma":[0.000024635345,0.00010654328,0.00003060808,0.00061912916,0.00013633455,0.0004992692,0.00019379059,0.0002852793,0.000056005676],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041586292,0.0017119007,0.025096055,0.0001076688,0.00027047785,0.00009996903,0.0055750986,0.02088694,0.06949197,0.2197634,0.3179526,0.33862808],"study_design_scores_gemma":[0.0025051897,0.0005428174,0.081983306,0.0003219892,0.000097860626,0.00035363736,0.00037777933,0.4546856,0.00998279,0.00077157246,0.44630688,0.0020705604],"about_ca_topic_score_codex":0.00004219244,"about_ca_topic_score_gemma":0.000044589524,"teacher_disagreement_score":0.84942406,"about_ca_system_score_codex":0.00006508438,"about_ca_system_score_gemma":0.000022429833,"threshold_uncertainty_score":0.4344709},"labels":[],"label_agreement":null},{"id":"W2157324791","doi":"10.1109/4234.984695","title":"Turbo codes for nonuniform memoryless sources over noisy channels","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Encoder; Computer science; Turbo code; Distributed source coding; Independent and identically distributed random variables; Algorithm; Redundancy (engineering); Decoding methods; Channel code; Binary number; Bit error rate; Coding (social sciences); Theoretical computer science; Mathematics; Random variable; Arithmetic; Statistics","score_opus":0.03532930867483095,"score_gpt":0.26705548204240737,"score_spread":0.23172617336757642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157324791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38069826,0.010018047,0.562009,0.021941444,0.001124904,0.003347326,0.00029001577,0.008016453,0.012554555],"genre_scores_gemma":[0.9488553,0.002012225,0.046973895,0.0010514149,0.00007771806,0.00073701673,0.00005785072,0.00008847475,0.00014615268],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989522,0.00005649733,0.0003688232,0.00016878644,0.00013699898,0.00031670384],"domain_scores_gemma":[0.99635434,0.00041334814,0.00009217885,0.0029929765,0.00007324045,0.00007391668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015226516,0.00023140489,0.00024636427,0.00019291285,0.00035017112,0.000076058655,0.0020076279,0.000095717965,0.000051156345],"category_scores_gemma":[0.000027383,0.0002623658,0.00011683855,0.00026747474,0.0002306308,0.00034314027,0.00015515015,0.00032492433,0.000049604627],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029303505,0.00071038265,0.0007528519,0.0005396,0.00063477503,0.000003503152,0.010780909,0.13508382,0.4576961,0.009488576,0.25421616,0.13006401],"study_design_scores_gemma":[0.00092228374,0.000049093516,0.00024222047,0.00018893716,0.000070807524,0.000013997999,0.00030178315,0.46801692,0.17004411,0.0010863286,0.3577994,0.0012640846],"about_ca_topic_score_codex":0.000016358385,"about_ca_topic_score_gemma":0.000043541924,"teacher_disagreement_score":0.568157,"about_ca_system_score_codex":0.00013202726,"about_ca_system_score_gemma":0.000003918765,"threshold_uncertainty_score":0.99998283},"labels":[],"label_agreement":null},{"id":"W2157915296","doi":"10.1109/lcomm.2008.071408","title":"BER Performance of FSO Links over Strong Atmospheric Turbulence Channels with Pointing Errors","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":376,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fading; Bit error rate; Free-space optical communication; Keying; Modulation (music); Channel (broadcasting); Computer science; Turbulence; Electronic engineering; Atmospheric turbulence; Fading distribution; Telecommunications; Optical communication; Optics; Physics; Acoustics; Engineering; Rayleigh fading","score_opus":0.020952274860098867,"score_gpt":0.22345177658476814,"score_spread":0.20249950172466927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157915296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99011594,0.0007128578,0.005445836,0.0017163005,0.00007648249,0.00017689096,0.0000036206034,0.00061260024,0.0011394982],"genre_scores_gemma":[0.93552244,0.0017072504,0.062470492,0.00014320663,0.000012682959,0.000067527784,0.0000083932855,0.000042196138,0.000025801612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989933,0.0000442491,0.00035846882,0.00014334032,0.00018688291,0.00027379228],"domain_scores_gemma":[0.99690944,0.00018771281,0.00011111644,0.002673562,0.00007474844,0.000043405784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103577026,0.00018937037,0.0002318515,0.000050716437,0.00024172723,0.000016536096,0.0017110746,0.00013149047,0.000015168847],"category_scores_gemma":[0.000026080015,0.00018487337,0.000053475964,0.0005224502,0.00067908736,0.00030662245,0.00023608105,0.0007703209,0.000024246849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005263392,0.0004353292,0.068467975,0.00040309486,0.00045358937,0.00000952701,0.004818523,0.8096319,0.077081084,0.0025069374,0.0044799075,0.031659532],"study_design_scores_gemma":[0.0007800768,0.00013109866,0.024678476,0.00044089186,0.000042798645,0.00004821619,0.0003916893,0.92914176,0.03962581,0.000022218259,0.0038391477,0.0008577998],"about_ca_topic_score_codex":0.000025664176,"about_ca_topic_score_gemma":0.000008210472,"teacher_disagreement_score":0.11950991,"about_ca_system_score_codex":0.00007898516,"about_ca_system_score_gemma":0.000017459148,"threshold_uncertainty_score":0.7538917},"labels":[],"label_agreement":null},{"id":"W2158083640","doi":"10.1109/lcomm.2008.080597","title":"Stability analysis of an improved min-sum decoder","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Low-density parity-check code; Computer science; Algorithm; Scaling; Sequential decoding; Code (set theory); Linear code; Stability (learning theory); Block code; Mathematics; Set (abstract data type)","score_opus":0.06365815239553399,"score_gpt":0.30744223798587444,"score_spread":0.24378408559034045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158083640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5955967,0.000043517884,0.4011667,0.002405965,0.00007351877,0.0001313158,0.000005207144,0.00033501344,0.00024205807],"genre_scores_gemma":[0.71833676,0.000020738658,0.28089815,0.0006858303,0.000005580674,0.000029803188,0.000009497488,0.0000069651946,0.00000669845],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985575,0.00034533857,0.00039887804,0.0003150607,0.00018630669,0.00019691249],"domain_scores_gemma":[0.9928706,0.0003573322,0.00021861482,0.006306323,0.00017640546,0.000070710885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006686,0.00012714365,0.00026732677,0.0003561869,0.0002584748,0.00003070953,0.003935052,0.000052574374,0.0000069616453],"category_scores_gemma":[0.000075838696,0.00013574412,0.0001694809,0.0016421027,0.00029803466,0.00048165856,0.0004186657,0.00021944178,0.000004087366],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021560681,0.0016541887,0.060958575,0.00003027167,0.001166907,0.00000947452,0.020093484,0.0009569499,0.8859948,0.0021130487,0.0036445996,0.023356147],"study_design_scores_gemma":[0.0002906874,0.0001157851,0.06847737,0.000016298192,0.00029963517,0.000020184636,0.00011515738,0.8170429,0.111636445,0.00027382257,0.0011215576,0.00059018965],"about_ca_topic_score_codex":0.00052945653,"about_ca_topic_score_gemma":0.000803315,"teacher_disagreement_score":0.81608593,"about_ca_system_score_codex":0.00008289111,"about_ca_system_score_gemma":0.00005585581,"threshold_uncertainty_score":0.7312372},"labels":[],"label_agreement":null},{"id":"W2158711336","doi":"10.1109/lcomm.2008.080708","title":"Adaptive MIMO Beamforming Algorithm Based on Gradient Search of the Channel Capacity in OFDM-SDMA Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Orthogonal frequency-division multiplexing; Beamforming; Space-division multiple access; Computer science; MIMO; MIMO-OFDM; WSDMA; Algorithm; Telecommunications link; Precoding; Channel (broadcasting); Multiplexing; Wireless broadband; Adaptive beamformer; Wireless; Electronic engineering; Telecommunications; Wireless network; Engineering","score_opus":0.12357879578727983,"score_gpt":0.2806870369061372,"score_spread":0.1571082411188574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158711336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106058836,0.0004511344,0.8548907,0.03457701,0.0004876153,0.0016517501,0.000037637863,0.00015402949,0.0016912755],"genre_scores_gemma":[0.9617375,0.00014003353,0.03718955,0.00067171274,0.000023859931,0.00019424382,0.000006114788,0.000016894352,0.000020082984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967048,0.001416963,0.0004947587,0.0003076945,0.00065061706,0.00042516473],"domain_scores_gemma":[0.99197,0.0010219327,0.00019486583,0.0065012635,0.0002200415,0.00009187662],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0010677789,0.00017760911,0.00025560553,0.00039245666,0.0006438776,0.000054236905,0.007826516,0.000076955825,0.0000011031111],"category_scores_gemma":[0.000051538846,0.00015201986,0.00012068499,0.001638513,0.0007202536,0.0002864421,0.0010330658,0.000886924,0.000012674889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003672249,0.001973876,0.004145012,0.00008501665,0.00011974383,0.000010993561,0.014310007,0.9090198,0.006503769,0.036487974,0.0047819735,0.022525078],"study_design_scores_gemma":[0.00036316045,0.000041461713,0.002819955,0.00017532625,0.000002243678,0.000008252203,0.00009111567,0.99460196,0.0010146371,0.000043169635,0.00068444177,0.00015424915],"about_ca_topic_score_codex":0.001272306,"about_ca_topic_score_gemma":0.00011560149,"teacher_disagreement_score":0.8556787,"about_ca_system_score_codex":0.0003369587,"about_ca_system_score_gemma":0.00016433868,"threshold_uncertainty_score":0.9975416},"labels":[],"label_agreement":null},{"id":"W2160196265","doi":"10.1109/lcomm.2010.092310.100293","title":"A Two-Hop Segment Protecting Paradigm that Unifies Node and Span Failure Recovery under p-Cycles","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Survivability; Span (engineering); Computer science; Computer network; Network topology; Node (physics); Topology (electrical circuits); Mathematics; Engineering; Structural engineering","score_opus":0.022533945517857302,"score_gpt":0.24830375048724684,"score_spread":0.22576980496938953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160196265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8807274,0.0005153442,0.08942809,0.026446113,0.00026855676,0.00047816496,0.00000828168,0.0015056392,0.0006223765],"genre_scores_gemma":[0.81802857,0.00031175633,0.18108892,0.00037578022,0.000033950095,0.00011278071,0.0000060877796,0.000035121702,0.000007021596],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992527,0.000039210492,0.00017699428,0.0001670702,0.00009119455,0.000272851],"domain_scores_gemma":[0.99808997,0.00035321084,0.00004488156,0.0014515743,0.000013010573,0.00004735563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012534308,0.00017814877,0.00015538503,0.00009820994,0.00028239534,0.000080184655,0.0006193621,0.00010087026,0.0000053155395],"category_scores_gemma":[0.000042416934,0.00018155758,0.00003780863,0.00017839337,0.00033842004,0.00023528776,0.00019471599,0.0009645781,0.000012842345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147945675,0.00008274125,0.0028295806,0.000118368174,0.00025778392,0.000007171962,0.00079539965,0.35770118,0.5741728,0.013855757,0.002937538,0.047226895],"study_design_scores_gemma":[0.0067750523,0.0002884775,0.026225928,0.0017196207,0.00055878534,0.000571946,0.015002657,0.48710456,0.1857568,0.12897387,0.13784681,0.009175484],"about_ca_topic_score_codex":0.000018897,"about_ca_topic_score_gemma":0.00040870826,"teacher_disagreement_score":0.38841596,"about_ca_system_score_codex":0.000053718635,"about_ca_system_score_gemma":0.0000057942966,"threshold_uncertainty_score":0.74037033},"labels":[],"label_agreement":null},{"id":"W2160434410","doi":"10.1109/lcomm.2008.080726","title":"Native Multicasting in a 2D-OCDMA PON","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Multicast; Code division multiple access; Computer science; Computer network; Code (set theory); Provisioning; Passive optical network; Wavelength-division multiplexing; Wavelength; Physics; Optoelectronics; Set (abstract data type)","score_opus":0.03859797013882393,"score_gpt":0.24261718218485823,"score_spread":0.2040192120460343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160434410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910762,0.00030487808,0.0018189086,0.00075840624,0.00018598993,0.00015534814,0.000004717361,0.00021128984,0.0054842806],"genre_scores_gemma":[0.9980819,0.00007304762,0.0014600867,0.00024380695,0.000024278017,0.00006834474,0.0000063050034,0.00002027335,0.000021929725],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999322,0.00012530245,0.0002186747,0.00008775712,0.00007395154,0.0001722928],"domain_scores_gemma":[0.99888396,0.00023120895,0.000026670437,0.0008064096,0.000017572384,0.000034160134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015985951,0.00010013279,0.0001208085,0.00015755228,0.00014942535,0.000010691355,0.0005054452,0.000039177812,0.0000064977503],"category_scores_gemma":[0.000029091132,0.000112096146,0.0000430116,0.00031842737,0.0001246828,0.00011932582,0.0000371698,0.00026076136,0.00005829319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000428459,0.00052931544,0.03736708,0.00023944533,0.00036683917,0.00016867783,0.0730774,0.14523888,0.70342106,0.013353755,0.016555771,0.009638914],"study_design_scores_gemma":[0.0066077835,0.000121591285,0.12407785,0.0015255619,0.00010256499,0.0007521419,0.0070316973,0.7353886,0.04471633,0.001730343,0.073952615,0.0039929315],"about_ca_topic_score_codex":0.000041405958,"about_ca_topic_score_gemma":0.00005493678,"teacher_disagreement_score":0.65870476,"about_ca_system_score_codex":0.00006292498,"about_ca_system_score_gemma":0.0000055564838,"threshold_uncertainty_score":0.45711482},"labels":[],"label_agreement":null},{"id":"W2161143075","doi":"10.1109/lcomm.2008.080262","title":"Iterative Interference Cancellation and Channel Estimation for Mobile SC-FDE Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Single antenna interference cancellation; Space-division multiple access; Telecommunications link; Interference (communication); Iterative method; Equalization (audio); Algorithm; Channel (broadcasting); Orthogonal frequency-division multiplexing; Electronic engineering; Telecommunications; Engineering","score_opus":0.037181115507819024,"score_gpt":0.28018965547644353,"score_spread":0.2430085399686245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161143075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048886355,0.0020076951,0.94662845,0.0005213917,0.00013091536,0.0008591327,0.000040656196,0.00058396504,0.0003414612],"genre_scores_gemma":[0.94164765,0.0020088502,0.054538473,0.000096560594,0.000022619975,0.0015299773,0.00009877587,0.000032189648,0.00002489592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932307,0.0000623988,0.00028013682,0.00013129618,0.000060656297,0.00014244826],"domain_scores_gemma":[0.99836195,0.000282217,0.00008311599,0.0011372152,0.00009420293,0.000041305837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009858359,0.00014154923,0.00015710374,0.00012808191,0.0003218148,0.000038554004,0.0005073939,0.000054512988,0.0000011122113],"category_scores_gemma":[0.00002072398,0.0001635097,0.000028797735,0.00015231957,0.00017806576,0.00033463183,0.000068117595,0.0001693841,0.0000044117323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020531019,0.000094320145,0.00036762177,0.00026103682,0.000119662385,6.315302e-7,0.009610061,0.7889481,0.15581656,0.0065459204,0.0094289435,0.028786615],"study_design_scores_gemma":[0.0002235478,0.00003045477,0.00012635722,0.00012015075,0.000010585856,0.000010703928,0.000095998555,0.9827578,0.011239433,0.00034759968,0.0047885193,0.00024883778],"about_ca_topic_score_codex":0.000030710922,"about_ca_topic_score_gemma":0.0000140797665,"teacher_disagreement_score":0.8927613,"about_ca_system_score_codex":0.00013324058,"about_ca_system_score_gemma":0.000010805274,"threshold_uncertainty_score":0.6667732},"labels":[],"label_agreement":null},{"id":"W2161331137","doi":"10.1109/lcomm.2008.080260","title":"Decoding with Early Termination for Raptor Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Raptor code; List decoding; Computer science; Sequential decoding; Fountain code; Algorithm; Berlekamp–Welch algorithm; Online codes; Theoretical computer science; Concatenated error correction code; Block code","score_opus":0.05489997568744488,"score_gpt":0.2923545659697088,"score_spread":0.23745459028226396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161331137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21244231,0.00003430601,0.7787966,0.0073941606,0.00010092633,0.00031052137,0.0000020732975,0.00057392893,0.00034518485],"genre_scores_gemma":[0.5939554,0.000019632034,0.40508038,0.0007224537,0.000017012504,0.00015489059,0.0000033125382,0.0000103497905,0.000036573263],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917305,0.000085543055,0.00018339185,0.00022232674,0.00014411587,0.00019159679],"domain_scores_gemma":[0.9972936,0.00044181917,0.00013012179,0.0019623793,0.0001307702,0.00004131792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023706039,0.000113873015,0.000118557386,0.00016682534,0.0005671311,0.00007644002,0.0021495451,0.000036346355,6.060091e-7],"category_scores_gemma":[0.000047786372,0.00011076085,0.000050190836,0.00031716283,0.00015599838,0.00052970357,0.00015463913,0.00014854957,0.00000840873],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001085086,0.0009712548,0.06732933,0.00012778807,0.0003004216,0.00004654273,0.039979953,0.00061305915,0.5709124,0.05840243,0.101150125,0.16005819],"study_design_scores_gemma":[0.0050116326,0.0017324487,0.08788608,0.00092559546,0.00016641025,0.0011936459,0.00034624472,0.4012634,0.40851843,0.0044468115,0.08401027,0.00449905],"about_ca_topic_score_codex":0.0000536878,"about_ca_topic_score_gemma":0.000044821318,"teacher_disagreement_score":0.40065032,"about_ca_system_score_codex":0.00007864661,"about_ca_system_score_gemma":0.000044956807,"threshold_uncertainty_score":0.45166963},"labels":[],"label_agreement":null},{"id":"W2161495911","doi":"10.1109/lcomm.2007.060662","title":"</title> </titles> <publication_date> <year>0</year> </publication_date> <pages> <first_page></first_page> <last_page></last_page> </pages> <publisher_item> <item_number item_number_type='arNumber'></item_number> </publisher_item> <doi_data> <doi>10.1109/LCOM.2007.357451</doi> <resource>http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber= </resource> </doi_data> </journal_article> <journal_article> <titles> <title><![CDATA[</title> </titles> <publication_date> <year>0</year> </publication_date> <pages> <first_page></first_page> <last_page></last_page> </pages> <publisher_item> <item_number item_number_type='arNumber'></item_number> </publisher_item> <doi_data> <doi> </doi> <resource>http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber= </resource> </doi_data> </journal_article> <journal_article> <titles> <title><![CDATA[</title> </titles> <publication_date> </publication_date> <pages> <first_page></first_page> <last_page></last_page> </pages> <publisher_item> <item_number item_number_type='arNumber'></item_number> </publisher_item> <doi_data> <doi> </doi> <resource>http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber= </resource> </doi_data> </journal_article> <journal_article> <titles> <title><![CDATA[Asymptotic performance of collaborative spectrum sensing under correlated log-normal shadowing","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Upper and lower bounds; Mathematics","score_opus":0.02611023167110787,"score_gpt":0.24783187729430936,"score_spread":0.22172164562320149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161495911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2741071,0.09946334,0.02612964,0.059320968,0.06358832,0.07615184,0.09771515,0.045193247,0.2583304],"genre_scores_gemma":[0.55010563,0.067129694,0.029100103,0.022402326,0.043204516,0.017911233,0.10429905,0.028531507,0.13731591],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.73932976,0.03384021,0.06315077,0.052581128,0.05482571,0.056272406],"domain_scores_gemma":[0.7771631,0.02602029,0.05152983,0.06830385,0.03586892,0.041114014],"candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaresearch","metaepi_narrow","metaepi_broad","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.07139081,0.062238898,0.05448491,0.046555426,0.039679844,0.06304285,0.0933397,0.03558512,0.07287544],"category_scores_gemma":[0.03209949,0.06877214,0.033795096,0.08566998,0.036018014,0.07838408,0.05233673,0.04953969,0.12011131],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.012964841,0.02487384,0.0039779893,0.0066763307,0.023792127,0.0093107885,0.009943168,0.009360798,0.24490263,0.031545624,0.60438293,0.018268948],"study_design_scores_gemma":[0.05277955,0.007194728,0.009163121,0.014118744,0.018996714,0.016748039,0.0025343164,0.042953737,0.011034921,0.0030389111,0.7658836,0.05555358],"about_ca_topic_score_codex":0.0012669603,"about_ca_topic_score_gemma":0.0234589,"teacher_disagreement_score":0.27599856,"about_ca_system_score_codex":0.038830433,"about_ca_system_score_gemma":0.025578953,"threshold_uncertainty_score":0.99436045},"labels":[],"label_agreement":null},{"id":"W2161770683","doi":"10.1109/lcomm.2008.080630","title":"Analysis of Maximum Traffic Intensity and Optimal Channel Reservation Under QoS Constraints in LEO-MSS","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reservation; Quality of service; Traffic intensity; Computer science; Computer network; Channel (broadcasting); Handover; Blocking (statistics); Low earth orbit; Intensity (physics); Communications satellite; Channel allocation schemes; Call blocking; Real-time computing; Satellite; Telecommunications; Wireless; Engineering; Aerospace engineering","score_opus":0.08792774958377911,"score_gpt":0.30648175094610086,"score_spread":0.21855400136232175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161770683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8416897,0.00021656115,0.13855554,0.019059042,0.000052834755,0.00022720177,0.000005904377,0.00006435561,0.00012884606],"genre_scores_gemma":[0.9794029,0.0006287512,0.019060832,0.00079842564,0.0000103125385,0.00004253945,0.000035401565,0.00000931162,0.000011500549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980731,0.00051202095,0.0005027834,0.0003069296,0.00032544695,0.00027973976],"domain_scores_gemma":[0.99535084,0.0006181575,0.00019150284,0.0035020942,0.0002529944,0.00008442858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351022,0.00014053006,0.00034934992,0.00091388845,0.00029178843,0.00005447935,0.0030835918,0.00008259758,0.000005383838],"category_scores_gemma":[0.000064211206,0.00015649857,0.00009302483,0.0028105057,0.0011134082,0.0004818834,0.0008995933,0.00046490654,0.000004854917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066338034,0.00096187,0.029737689,0.000038775976,0.0010269462,0.000021134332,0.013800082,0.9171422,0.009901745,0.0071736337,0.003082135,0.017047448],"study_design_scores_gemma":[0.00038763566,0.00001978604,0.12551795,0.000031078718,0.000032309144,0.000014793052,0.00022521259,0.8732637,0.0001767822,0.00005879714,0.00009288279,0.00017904356],"about_ca_topic_score_codex":0.00014154363,"about_ca_topic_score_gemma":0.00031824756,"teacher_disagreement_score":0.13771321,"about_ca_system_score_codex":0.00010356938,"about_ca_system_score_gemma":0.0000777412,"threshold_uncertainty_score":0.6381827},"labels":[],"label_agreement":null},{"id":"W2162362718","doi":"10.1109/lcomm.2011.032811.110321","title":"Mismatched Bit-Interleaved Coded Noncoherent Orthogonal Modulation","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Metric (unit); Computer science; Algorithm; Modulation (music); Transmission (telecommunications); Theoretical computer science; Mathematics; Telecommunications","score_opus":0.05527386360790987,"score_gpt":0.26085154157975,"score_spread":0.20557767797184012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162362718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36143446,0.0004313671,0.6229845,0.001505253,0.00030235277,0.00064972637,0.000025471596,0.0029608766,0.009705967],"genre_scores_gemma":[0.8674422,0.0003749395,0.13137676,0.0003791589,0.00002201928,0.00024717287,0.00007396321,0.000060912786,0.000022865677],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998874,0.00012503266,0.00044918383,0.00016583856,0.0001460247,0.00023990466],"domain_scores_gemma":[0.9965798,0.00011023835,0.00010425535,0.0030454185,0.00008093949,0.000079305784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014506083,0.00021450833,0.00020453156,0.00017988533,0.00016928537,0.000026884734,0.0015824692,0.000089866415,0.000068144866],"category_scores_gemma":[0.000014041831,0.00024656972,0.000093165516,0.00027812767,0.00018544478,0.00030015004,0.00016136847,0.00039066467,0.0001076787],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004276046,0.0004291461,0.0018756726,0.00009870157,0.00028675373,0.00000445009,0.007493421,0.017360486,0.86971486,0.006534764,0.011141083,0.08501788],"study_design_scores_gemma":[0.0019347627,0.000105912106,0.019147344,0.00045259667,0.0001236902,0.00004829407,0.00067928544,0.5424541,0.39576617,0.008384074,0.028410943,0.0024928257],"about_ca_topic_score_codex":0.00003378464,"about_ca_topic_score_gemma":0.00007370065,"teacher_disagreement_score":0.5250936,"about_ca_system_score_codex":0.00015593904,"about_ca_system_score_gemma":0.000011624408,"threshold_uncertainty_score":0.9999986},"labels":[],"label_agreement":null},{"id":"W2163291063","doi":"10.1109/lcomm.2007.070065","title":"Performance Analysis of Decode-and-Forward Relaying with Selection Combining","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Selection (genetic algorithm); Relay; Outage probability; Diversity combining; Maximal-ratio combining; Signal-to-noise ratio (imaging); Expression (computer science); Antenna diversity; Cooperative diversity; Performance improvement; Algorithm; Telecommunications; Decoding methods; Fading; Wireless; Artificial intelligence; Power (physics); Engineering","score_opus":0.03319653540750594,"score_gpt":0.2830231413289397,"score_spread":0.24982660592143374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163291063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5339061,0.00017795633,0.46289027,0.0018152192,0.000027430193,0.00008121746,3.8401666e-7,0.000074549425,0.0010268423],"genre_scores_gemma":[0.9193729,0.0007408258,0.07916945,0.0006709873,0.0000058045375,0.000011084548,0.000006209202,0.0000068039485,0.00001591144],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900734,0.00013362335,0.00032635164,0.00018807329,0.00016052753,0.0001840727],"domain_scores_gemma":[0.99759394,0.00040804336,0.00019599132,0.0015863945,0.00015794444,0.00005767326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348817,0.00010851637,0.00020327154,0.00049628323,0.00047958293,0.000058717105,0.0013489953,0.000032444437,0.0000032985288],"category_scores_gemma":[0.000019208579,0.00010335846,0.000052892876,0.0024273428,0.00016558658,0.00039591372,0.00031512164,0.0002383755,0.0000025137745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007026634,0.00033823622,0.5320838,0.00004293487,0.0021514297,0.000002248537,0.012424439,0.028037269,0.087899715,0.0511343,0.00065292354,0.28516245],"study_design_scores_gemma":[0.00042854212,0.00008412274,0.18383346,0.000079234196,0.00024587507,0.000012547692,0.00010924874,0.8092628,0.0036165358,0.000012835408,0.0020082893,0.00030650845],"about_ca_topic_score_codex":0.000015619074,"about_ca_topic_score_gemma":0.0002537679,"teacher_disagreement_score":0.7812255,"about_ca_system_score_codex":0.0000577781,"about_ca_system_score_gemma":0.00002440556,"threshold_uncertainty_score":0.4214836},"labels":[],"label_agreement":null},{"id":"W2163537708","doi":"10.1109/lcomm.2008.071397","title":"Partial Selective Mapping OFDM with Low Complexity IFFTs","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computational complexity theory; Fast Fourier transform; Reduction (mathematics); Computer science; Algorithm; Multiplexing; Computation; Inverse; SIGNAL (programming language); Mathematics; Telecommunications; Channel (broadcasting)","score_opus":0.05691865674489551,"score_gpt":0.24920854922916078,"score_spread":0.19228989248426526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163537708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9494672,0.00019295684,0.03714952,0.00435054,0.0003699665,0.00031984865,0.000015816984,0.000901161,0.0072329976],"genre_scores_gemma":[0.9837506,0.000092113674,0.0154224085,0.0004428427,0.00010077296,0.00009609766,0.000021001335,0.000036408797,0.000037747493],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991807,0.0000788181,0.00020662457,0.0001409029,0.00014803794,0.00024492925],"domain_scores_gemma":[0.9985102,0.00008067451,0.000045754965,0.0012368513,0.000056333127,0.00007017461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006680035,0.00015147025,0.00015444095,0.000121966055,0.0003895768,0.000020239173,0.00061042095,0.000045231784,0.000019817662],"category_scores_gemma":[0.000010429903,0.00016185353,0.000044947268,0.00040834924,0.0004799543,0.00018377346,0.0000489074,0.0003770236,0.00010195016],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006911026,0.00056609313,0.018455695,0.00020003851,0.0009761288,0.00005418488,0.018663201,0.21080644,0.48099533,0.0018287069,0.26325518,0.0041299043],"study_design_scores_gemma":[0.0067452257,0.00023824324,0.19448715,0.0007228754,0.00024718692,0.0022571888,0.0017065193,0.2756686,0.20974156,0.00066840235,0.30216098,0.0053560827],"about_ca_topic_score_codex":0.000042364525,"about_ca_topic_score_gemma":0.000027801925,"teacher_disagreement_score":0.27125376,"about_ca_system_score_codex":0.00016320756,"about_ca_system_score_gemma":0.00002347611,"threshold_uncertainty_score":0.6600196},"labels":[],"label_agreement":null},{"id":"W2164283282","doi":"10.1109/lcomm.2004.827437","title":"A New Hybrid Constraint-Based Approach for 3G Network Planning","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Computer science; Constraint (computer-aided design); Mathematical optimization; Range (aeronautics); Hybrid algorithm (constraint satisfaction); Network planning and design; Constraint satisfaction; Artificial intelligence; Mathematics; Local consistency; Computer network","score_opus":0.04587738194204006,"score_gpt":0.2900443951567786,"score_spread":0.24416701321473855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164283282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021850339,0.00026953543,0.99280727,0.0024173553,0.00017829685,0.0003658993,0.000012625074,0.0005907522,0.0011732299],"genre_scores_gemma":[0.24629357,0.000007240608,0.7522261,0.0011379593,0.000113187634,0.00008146332,0.000086763546,0.000045225028,0.000008478617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911165,0.00007140954,0.00027584928,0.00014926336,0.00009129969,0.00030050403],"domain_scores_gemma":[0.998396,0.0003007313,0.00005717855,0.0011187798,0.000034511562,0.000092832364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033471812,0.00015491227,0.00016790199,0.00008524638,0.00023520328,0.00006324124,0.00069705886,0.000049755126,0.0000048226707],"category_scores_gemma":[0.00004505083,0.00018783864,0.00008405674,0.0002527456,0.000089810856,0.00008820097,0.00003275691,0.0002446044,0.000006327437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031877357,0.00001261157,0.00008285264,0.000018778635,0.000030885803,4.3184838e-7,0.00011760543,0.98804176,0.0023554673,0.00048324474,0.006732383,0.0021207968],"study_design_scores_gemma":[0.0012204947,0.000013439995,0.000076986245,0.000076940545,0.0000394459,0.0000110121855,0.00003912471,0.9882444,0.0025501817,0.00021635722,0.007182404,0.00032922198],"about_ca_topic_score_codex":0.0000124779235,"about_ca_topic_score_gemma":0.0000011880102,"teacher_disagreement_score":0.24410854,"about_ca_system_score_codex":0.00012410522,"about_ca_system_score_gemma":0.000063592095,"threshold_uncertainty_score":0.76598376},"labels":[],"label_agreement":null},{"id":"W2164320797","doi":"10.1109/lcomm.2009.081641","title":"Improved Iterative Joint Detection and Decoding of Coded V-BLAST Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Computer science; Joint (building); Detector; Algorithm; Iterative method; List decoding; Scheme (mathematics); Theoretical computer science; Telecommunications; Concatenated error correction code; Mathematics; Block code","score_opus":0.022374334647765483,"score_gpt":0.2547106647319382,"score_spread":0.23233633008417273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164320797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15520659,0.0014980959,0.8401961,0.00086381915,0.00010190318,0.00045764894,0.0000149653715,0.000702704,0.0009582107],"genre_scores_gemma":[0.9685656,0.0008383821,0.030370627,0.000111632,0.000012646438,0.00006931457,0.000009068,0.000018922912,0.000003843292],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927604,0.000088596746,0.00035219002,0.000100501886,0.000058479396,0.00012416019],"domain_scores_gemma":[0.9983266,0.000116546435,0.0001103279,0.0013375727,0.00007068114,0.000038275408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013595667,0.00012680145,0.00018795695,0.00016060984,0.00013699681,0.000036520698,0.00044184268,0.000053216987,8.276696e-7],"category_scores_gemma":[0.000022739767,0.00014353535,0.00003526679,0.00019503341,0.00011291649,0.00023351601,0.000055984387,0.00023596032,0.0000012327293],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000217411,0.000015061375,0.00001364971,0.000018690824,0.000016614129,6.170479e-8,0.00036807865,0.002436737,0.9791937,0.0008019198,0.000055762666,0.017077565],"study_design_scores_gemma":[0.00032402255,0.00005540154,0.00052561157,0.00016896424,0.000020051584,0.000008775285,0.00017349735,0.5212713,0.4757209,0.0003092138,0.001127985,0.00029428248],"about_ca_topic_score_codex":0.000019334262,"about_ca_topic_score_gemma":0.000015395339,"teacher_disagreement_score":0.81335896,"about_ca_system_score_codex":0.00009015569,"about_ca_system_score_gemma":0.0000043792693,"threshold_uncertainty_score":0.5853202},"labels":[],"label_agreement":null},{"id":"W2164764855","doi":"10.1109/lcomm.2004.835303","title":"On the Code and Interleaver Design of Broadband OFDM Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Interleaving; Block code; Orthogonal frequency-division multiplexing; Hamming code; Hamming distance; Trellis modulation; Computer science; Hamming bound; Coding gain; Algorithm; Concatenated error correction code; Forward error correction; Coding (social sciences); Space–time block code; Code division multiple access; Linear code; Telecommunications; Mathematics; Decoding methods; Fading; Channel (broadcasting); Statistics","score_opus":0.03737878108093929,"score_gpt":0.2560923013321117,"score_spread":0.2187135202511724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164764855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060741022,0.0014265715,0.9324111,0.0036376282,0.00007053554,0.00048151845,0.00001599309,0.0003653343,0.0008502963],"genre_scores_gemma":[0.9810429,0.0012655677,0.017185075,0.0003273981,0.0000061099136,0.00013547906,0.000004339537,0.000026255091,0.0000068474014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940467,0.00011527287,0.00022982435,0.00007585486,0.000074132906,0.00010025254],"domain_scores_gemma":[0.997322,0.0005149469,0.0000627491,0.0020424167,0.000033959288,0.000023895154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018119476,0.00010554994,0.00012447564,0.000080477264,0.000114213864,0.000024471932,0.00096645963,0.000038055685,0.0000018596994],"category_scores_gemma":[0.000027635399,0.0000888891,0.00002466263,0.00013866986,0.00026088464,0.00009063596,0.000086434775,0.00024282893,0.0000069102316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012538523,0.000094388924,0.00007526012,0.00007661327,0.00012212335,4.855821e-7,0.0020127017,0.5922734,0.2678312,0.12807663,0.0057983943,0.0036262579],"study_design_scores_gemma":[0.00408822,0.0004483862,0.0012329575,0.0038536391,0.00020323857,0.00010397514,0.0017737993,0.39482352,0.4980575,0.04680177,0.045903184,0.002709774],"about_ca_topic_score_codex":0.00002633272,"about_ca_topic_score_gemma":0.0000059117183,"teacher_disagreement_score":0.9203019,"about_ca_system_score_codex":0.000074484786,"about_ca_system_score_gemma":0.000006738786,"threshold_uncertainty_score":0.36247924},"labels":[],"label_agreement":null},{"id":"W2166194781","doi":"10.1109/lcomm.2014.2347951","title":"Closed Form SER Expressions for QPSK OFDM Systems With Frequency Offset in Rayleigh Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Phase-shift keying; Orthogonal frequency-division multiplexing; Frequency offset; Rayleigh fading; Fading; Rayleigh scattering; Offset (computer science); Fading distribution; Closed-form expression; Carrier frequency offset; Mathematics; Computer science; Bit error rate; Telecommunications; Algorithm; Electronic engineering; Physics; Mathematical analysis; Channel (broadcasting); Engineering; Optics","score_opus":0.023693747905702906,"score_gpt":0.2582153194076122,"score_spread":0.2345215715019093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166194781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08824226,0.00058534177,0.9032725,0.0025779298,0.0002688141,0.0015738949,0.0000557691,0.0012779187,0.0021455842],"genre_scores_gemma":[0.9271391,0.00024027418,0.07022697,0.00028268437,0.000045059223,0.0018682204,0.000090715155,0.00008247384,0.000024512803],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872786,0.00013698467,0.00047179326,0.00019682579,0.00014019356,0.000326357],"domain_scores_gemma":[0.99622196,0.0005672814,0.00011834431,0.002932603,0.00008695385,0.00007282926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003116612,0.00023629233,0.00030274878,0.00029598997,0.00026369444,0.00006006567,0.001573583,0.00010728366,0.0000028106551],"category_scores_gemma":[0.00005456125,0.00023405359,0.00006114526,0.00036450694,0.00013119062,0.0004039167,0.00010781128,0.0003981018,0.000009290827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004075228,0.00028610526,0.0027953396,0.00053091923,0.00018129572,0.0000018967428,0.0042649847,0.43412548,0.5060883,0.03350783,0.0117435325,0.0064335573],"study_design_scores_gemma":[0.0030630366,0.00017777734,0.0012789867,0.0029725973,0.000076273885,0.000024091647,0.0008776565,0.86692804,0.060682543,0.0047653127,0.056916773,0.0022369127],"about_ca_topic_score_codex":0.000062599036,"about_ca_topic_score_gemma":0.00011314416,"teacher_disagreement_score":0.8388968,"about_ca_system_score_codex":0.00020414691,"about_ca_system_score_gemma":0.000014056366,"threshold_uncertainty_score":0.9544428},"labels":[],"label_agreement":null},{"id":"W2166203438","doi":"10.1109/lcomm.2005.02003","title":"Accurate simple closed-form approximations to rayleigh sum distributions and densities","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Simple (philosophy); Argument (complex analysis); Range (aeronautics); Mathematics; Closed-form expression; Expression (computer science); Rayleigh distribution; Random variable; Rayleigh scattering; Applied mathematics; Probability density function; Distribution (mathematics); Approximations of π; Statistical physics; Mathematical analysis; Computer science; Statistics; Physics; Quantum mechanics","score_opus":0.0337097687263119,"score_gpt":0.2603652421811814,"score_spread":0.2266554734548695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166203438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37325355,0.00020263906,0.6147977,0.010374952,0.00006844011,0.0002498113,0.00009249146,0.00029397427,0.0006664178],"genre_scores_gemma":[0.96669316,0.00020651903,0.03128269,0.0014068384,0.00006100159,0.00011637679,0.00017720606,0.000024322964,0.000031854925],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923927,0.00003843049,0.00028332497,0.00012574112,0.00009264548,0.00022058636],"domain_scores_gemma":[0.9988269,0.000103684986,0.000031293217,0.0008665585,0.00006220146,0.00010932042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013246729,0.0001389019,0.00012619319,0.00013784553,0.00037999675,0.00009830156,0.00034360262,0.000042808515,0.000019316547],"category_scores_gemma":[0.00002625764,0.00015373768,0.000043231565,0.00020601747,0.00007688161,0.0002675392,0.0000954075,0.00018548213,0.00009155463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014106875,0.00019126922,0.00037606183,0.00013942331,0.00028474003,0.0000017785244,0.0093656415,0.24153581,0.5998028,0.007054038,0.086708955,0.054525387],"study_design_scores_gemma":[0.0005717373,0.00002036824,0.0013440364,0.000057914687,0.00007980711,0.000023399498,0.0004927164,0.8289202,0.04474593,0.0006032902,0.122380584,0.0007600412],"about_ca_topic_score_codex":0.000018580922,"about_ca_topic_score_gemma":0.0001438997,"teacher_disagreement_score":0.59343964,"about_ca_system_score_codex":0.000105361396,"about_ca_system_score_gemma":0.000010809515,"threshold_uncertainty_score":0.62692404},"labels":[],"label_agreement":null},{"id":"W2166966812","doi":"10.1109/lcomm.2002.1010862","title":"Optimal detection of a BPSK signal contaminated by interference and noise","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Phase-shift keying; Additive white Gaussian noise; Interference (communication); Bit error rate; Gaussian noise; Detector; SIGNAL (programming language); Noise (video); Matched filter; Computer science; Keying; Signal-to-noise ratio (imaging); Binary number; Telecommunications; Algorithm; White noise; Mathematics; Decoding methods; Artificial intelligence","score_opus":0.035445552460241204,"score_gpt":0.26450211780664634,"score_spread":0.22905656534640514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166966812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25530913,0.0023695475,0.728537,0.012821338,0.000059401034,0.00028179414,0.0000075451508,0.00014378632,0.00047045646],"genre_scores_gemma":[0.9831831,0.0010393128,0.015289335,0.00034442078,0.000007315361,0.00006485509,0.0000052339074,0.0000102639215,0.00005616996],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985848,0.0004386439,0.000326117,0.00022900588,0.00020390221,0.00021750017],"domain_scores_gemma":[0.9964712,0.00051185134,0.00015581111,0.002630424,0.00014660339,0.00008406136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029547137,0.00012318783,0.00016553432,0.00016989905,0.00024469843,0.00011127522,0.0032730976,0.000059386177,0.000015217149],"category_scores_gemma":[0.000031626067,0.0001326,0.00004116397,0.0005571973,0.00044057143,0.00044084573,0.0008437066,0.00038983527,0.000022519394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001048257,0.00028023045,0.00032538545,0.000019029598,0.0000570284,0.0000012993316,0.00196503,0.0006140851,0.83956504,0.0009823018,0.0071967673,0.14898333],"study_design_scores_gemma":[0.0005103679,0.00010049447,0.00074854464,0.00006311324,0.000008907773,0.000019051658,0.00005742505,0.94541806,0.048048224,0.000026639438,0.0047634267,0.0002357264],"about_ca_topic_score_codex":0.00008351555,"about_ca_topic_score_gemma":0.00002895187,"teacher_disagreement_score":0.944804,"about_ca_system_score_codex":0.000057052384,"about_ca_system_score_gemma":0.000010773203,"threshold_uncertainty_score":0.6082284},"labels":[],"label_agreement":null},{"id":"W2167038527","doi":"10.1109/lcomm.2004.827438","title":"Hybrid Hard-Decision Iterative Decoding of Regular Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Decoding methods; Low-density parity-check code; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Binary number; Sequential decoding; Theoretical computer science; Mathematics; Concatenated error correction code; Error floor; Block code; Arithmetic","score_opus":0.034253676307169266,"score_gpt":0.293368421581066,"score_spread":0.2591147452738968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167038527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4067875,0.00008421648,0.58721894,0.005095429,0.00017160182,0.00016571731,0.0000035125693,0.0003210427,0.00015201056],"genre_scores_gemma":[0.60182655,0.000053705397,0.3972572,0.0008092163,0.000013344528,0.000018351999,0.0000044322574,0.000010558296,0.000006602736],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833614,0.000241532,0.00047478586,0.00037302778,0.00032181144,0.00025272608],"domain_scores_gemma":[0.9948061,0.0005263067,0.0002912788,0.004062725,0.00024084799,0.00007273087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071509404,0.00018991291,0.00028662875,0.00023893415,0.0003978968,0.00013317964,0.0035131965,0.000057224555,0.0000019175216],"category_scores_gemma":[0.00021887905,0.00020426388,0.00013419459,0.00043457316,0.00027399443,0.0006119181,0.00081889523,0.0004028645,0.00002542471],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004085869,0.00086778763,0.0042900043,0.000081747065,0.00015828546,0.000049576884,0.009489023,0.0032604213,0.8636025,0.059301138,0.014535531,0.04432309],"study_design_scores_gemma":[0.00078713393,0.000109067165,0.0058210935,0.00085371075,0.00003419043,0.000105555184,0.000085621345,0.017339602,0.9424487,0.030533968,0.0011855343,0.00069584354],"about_ca_topic_score_codex":0.00018015882,"about_ca_topic_score_gemma":0.00007730753,"teacher_disagreement_score":0.19503903,"about_ca_system_score_codex":0.0002087105,"about_ca_system_score_gemma":0.00006427933,"threshold_uncertainty_score":0.8329639},"labels":[],"label_agreement":null},{"id":"W2167278060","doi":"10.1109/4234.922767","title":"SIR performance evaluation of a multirate OFFH-CDMA system","year":2001,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Code division multiple access; Computer science; Process gain; Spread spectrum; Interference (communication); Transmission (telecommunications); Signal-to-interference ratio; Electronic engineering; Chip; Telecommunications; Algorithm; Engineering; Physics","score_opus":0.044356240088648545,"score_gpt":0.25416118328838505,"score_spread":0.2098049431997365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167278060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908769,0.00050432474,0.0010879309,0.00017089379,0.00030858314,0.00028186693,0.000005766348,0.00020405458,0.0065596784],"genre_scores_gemma":[0.9993066,0.00010255501,0.0003443361,0.000046568723,0.000029860323,0.00012110655,0.0000132956,0.00001996173,0.00001567417],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990242,0.00023042668,0.00030964534,0.00008384124,0.00021198596,0.0001398994],"domain_scores_gemma":[0.9983645,0.000072329494,0.00007265083,0.0013521304,0.00010637798,0.000031985124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077977363,0.00010534717,0.00014297155,0.000120638564,0.00011566153,0.000014780281,0.0005741401,0.000044128206,0.000009579],"category_scores_gemma":[0.000009950786,0.00011023253,0.000055763318,0.0002950459,0.00008069305,0.00015254258,0.000025862806,0.0001270459,0.00006212762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032822732,0.00014681967,0.009390478,0.00059915823,0.00035973362,0.000002287328,0.0042242156,0.4445798,0.49338225,0.0035140994,0.0031796882,0.040588625],"study_design_scores_gemma":[0.0007132529,0.000018158928,0.006421386,0.00030808127,0.00010248857,0.000028180324,0.0005696753,0.97693396,0.0097667,0.00001779744,0.0048546977,0.00026565147],"about_ca_topic_score_codex":0.000017593435,"about_ca_topic_score_gemma":0.000014095608,"teacher_disagreement_score":0.5323541,"about_ca_system_score_codex":0.00009973906,"about_ca_system_score_gemma":0.000010489406,"threshold_uncertainty_score":0.44951522},"labels":[],"label_agreement":null},{"id":"W2167535669","doi":"10.1109/lcomm.2002.805516","title":"Spectral efficiency of the feedback receiver for two sets of orthogonal sequences","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Spectral efficiency; Fading; Algorithm; Mathematics; Code division multiple access; Matched filter; Gaussian; Computer science; Channel (broadcasting); Topology (electrical circuits); Scheme (mathematics); Filter (signal processing); Telecommunications; Decoding methods; Combinatorics","score_opus":0.06971778206201197,"score_gpt":0.31574287281954594,"score_spread":0.24602509075753398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167535669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6416854,0.0021282702,0.20977291,0.13780694,0.0005852064,0.0017792688,0.000060154893,0.00015985117,0.006021991],"genre_scores_gemma":[0.9509354,0.00021797809,0.0482507,0.00043925713,0.000017057006,0.000063029765,0.0000033347235,0.0000092885075,0.00006395948],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998265,0.00045172698,0.0004397562,0.00020092781,0.0003794871,0.00026305582],"domain_scores_gemma":[0.9937652,0.0009887116,0.00030151242,0.00466519,0.00023195858,0.000047429217],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00054285454,0.00011418489,0.00018451143,0.00011948575,0.00033421448,0.00004507969,0.008614146,0.00003946524,0.000019285015],"category_scores_gemma":[0.00008254976,0.00009255471,0.00016028964,0.0009620663,0.00081334147,0.00028477734,0.00076701585,0.00028736147,0.000011094033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005110995,0.0026225306,0.015275186,0.00025849012,0.0004372428,0.0000019901177,0.014812526,0.07134339,0.41552198,0.27543154,0.08656737,0.117676616],"study_design_scores_gemma":[0.0013436979,0.000113048874,0.009876273,0.00021848165,0.000029113415,0.000020913694,0.000103177255,0.9424783,0.03611645,0.0020875635,0.0071660858,0.0004469177],"about_ca_topic_score_codex":0.000047280228,"about_ca_topic_score_gemma":0.00006222506,"teacher_disagreement_score":0.8711349,"about_ca_system_score_codex":0.000056343844,"about_ca_system_score_gemma":0.000055380227,"threshold_uncertainty_score":0.9967497},"labels":[],"label_agreement":null},{"id":"W2168359139","doi":"10.1109/4234.852929","title":"On timing offset estimation for OFDM systems","year":2000,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":469,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Estimator; Intersymbol interference; Additive white Gaussian noise; Computer science; Channel (broadcasting); Offset (computer science); Multiplexing; Carrier frequency offset; Algorithm; UTC offset; Statistics; Frequency offset; Telecommunications; Mathematics","score_opus":0.03405987405489248,"score_gpt":0.28993561950088576,"score_spread":0.2558757454459933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168359139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03325833,0.00065425056,0.95227027,0.0029009797,0.00019052009,0.0010384634,0.00007962585,0.0021363394,0.0074712373],"genre_scores_gemma":[0.9064325,0.00046334998,0.09156494,0.0004451353,0.00002402336,0.000753847,0.0001768109,0.000053761756,0.000085609456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925715,0.00006300542,0.00030101623,0.00011763478,0.00008776928,0.00017342826],"domain_scores_gemma":[0.9971601,0.00042528773,0.00004919082,0.0022868058,0.000038598067,0.000040068095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014415942,0.0001428857,0.00014621404,0.00012231061,0.00024151162,0.000050180824,0.0009883507,0.000060526676,0.000018706747],"category_scores_gemma":[0.000022297458,0.00016650802,0.000055359935,0.00017281515,0.00007831404,0.00020209985,0.000025981175,0.00020608836,0.000085376334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008798311,0.000055329678,0.0000075722587,0.000060278217,0.000038522106,1.2554169e-7,0.00024647496,0.81579316,0.0153824845,0.014826729,0.0250981,0.12848245],"study_design_scores_gemma":[0.00022734748,0.000019255145,0.000020610667,0.00012095712,0.000013514959,0.0000023071016,0.000016477232,0.93307215,0.003937282,0.0011073496,0.061215643,0.00024713555],"about_ca_topic_score_codex":0.000012535137,"about_ca_topic_score_gemma":0.000003252855,"teacher_disagreement_score":0.8731742,"about_ca_system_score_codex":0.000142386,"about_ca_system_score_gemma":0.000006030952,"threshold_uncertainty_score":0.679},"labels":[],"label_agreement":null},{"id":"W2168412250","doi":"10.1109/lcom.2006.224417","title":"On the capacity of indoor optical wireless communications","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Pulse-position modulation; Multipath propagation; Channel capacity; Modulation (music); Pulse-amplitude modulation; Optical wireless communications; Wireless; Telecommunications; Position (finance); Computer science; Optical communication; Amplitude modulation; Dispersion (optics); Electronic engineering; Optical wireless; Pulse (music); Channel (broadcasting); Computer network; Physics; Optics; Radio frequency; Frequency modulation; Engineering; Acoustics; Business","score_opus":0.033707985786346276,"score_gpt":0.23886432775426267,"score_spread":0.20515634196791638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168412250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91272193,0.00063357124,0.008116356,0.0555001,0.000118251184,0.00048191915,0.000044926244,0.0010225372,0.02136042],"genre_scores_gemma":[0.98386174,0.0005855559,0.014793475,0.00044953165,0.00001365826,0.00021569128,0.000028481883,0.000039469684,0.000012411399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865925,0.00019319505,0.00053289084,0.00013298099,0.00022306023,0.00025860165],"domain_scores_gemma":[0.98909575,0.0022178085,0.00010501748,0.008448173,0.00009678611,0.000036482994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003064182,0.00020128126,0.00024415372,0.000157357,0.00034906456,0.00004700027,0.0053348634,0.00012651927,0.000014171931],"category_scores_gemma":[0.0001085393,0.00017083233,0.000112064656,0.0005551931,0.0017981557,0.000115107425,0.0005105834,0.00084174017,0.00009099476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044624267,0.00030267474,0.00034740966,0.00002290672,0.00007425373,2.8726475e-7,0.00014529025,0.0024965256,0.122198954,0.8595314,0.010980217,0.0038956155],"study_design_scores_gemma":[0.0019753021,0.00018279161,0.019096037,0.00065423606,0.00020907186,0.000031197236,0.0011125389,0.3145529,0.55609775,0.046894863,0.05668953,0.00250378],"about_ca_topic_score_codex":0.00007556153,"about_ca_topic_score_gemma":0.00011131637,"teacher_disagreement_score":0.81263655,"about_ca_system_score_codex":0.00011553154,"about_ca_system_score_gemma":0.000013898177,"threshold_uncertainty_score":0.99135923},"labels":[],"label_agreement":null},{"id":"W2169280771","doi":"10.1109/lcomm.2010.04.092086","title":"Analysis of BER performance in presence of nonlinear distortion due to PD-HPA in downlink DS-CDMA signals","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Baseband; Nonlinear distortion; Code division multiple access; Bit error rate; Telecommunications link; Distortion (music); Electronic engineering; Computer science; Intermodulation; Near-far problem; Amplifier; Telecommunications; Decoding methods; Engineering; Bandwidth (computing)","score_opus":0.029371517501780825,"score_gpt":0.3092674796580496,"score_spread":0.2798959621562688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169280771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95980316,0.00007849506,0.029159108,0.010253477,0.000074754586,0.0003452356,0.000010541563,0.000028056544,0.00024716213],"genre_scores_gemma":[0.953659,0.00015175022,0.045764316,0.00025721008,0.000011873616,0.000107794665,0.000024907598,0.00000931671,0.000013823736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774325,0.00044960662,0.0008007109,0.00029300863,0.00042575854,0.00028768356],"domain_scores_gemma":[0.99306065,0.00088597205,0.0002750326,0.0054572616,0.00023702794,0.00008408553],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0012936102,0.00013415852,0.0003915118,0.0013444744,0.00009289958,0.000042213484,0.0060005696,0.00008610208,0.00001368943],"category_scores_gemma":[0.00016463477,0.00014385757,0.000102663595,0.0049615055,0.00033079382,0.00049641205,0.001043847,0.0006916025,0.000012409271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005640595,0.0013854046,0.29745567,0.00007990438,0.00024658217,0.000005128085,0.007886077,0.316725,0.30620927,0.002403196,0.0005423218,0.06700504],"study_design_scores_gemma":[0.00022147213,0.000025429657,0.34151673,0.00007204064,0.000018502633,0.0000012102956,0.000025003617,0.651759,0.005431773,0.000020402773,0.0007431195,0.00016525999],"about_ca_topic_score_codex":0.00061087694,"about_ca_topic_score_gemma":0.0054314914,"teacher_disagreement_score":0.33503407,"about_ca_system_score_codex":0.00008224773,"about_ca_system_score_gemma":0.00008586618,"threshold_uncertainty_score":0.9993774},"labels":[],"label_agreement":null},{"id":"W2169474794","doi":"10.1109/lcomm.2011.061011.110276","title":"Closed-Form BER Analysis of Non-Coherent FSK in MISO Double Rayleigh Fading/RFID Channel","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"RFID technology advancements","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Frequency-shift keying; Rayleigh fading; Channel (broadcasting); Fading; Computer science; Rayleigh scattering; Telecommunications; Electronic engineering; Mathematics; Algorithm; Topology (electrical circuits); Physics; Engineering; Demodulation; Combinatorics; Optics","score_opus":0.04248868270789637,"score_gpt":0.26669005956925185,"score_spread":0.22420137686135547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169474794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98702294,0.00025438325,0.0072412384,0.0005082404,0.00016598805,0.0002980884,0.000016123644,0.00019339487,0.0042996076],"genre_scores_gemma":[0.9927077,0.00024139602,0.0066403276,0.00014997457,0.0000060746393,0.00015992083,0.000039129674,0.000027701619,0.000027756785],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903595,0.000021016738,0.00041919944,0.0001555523,0.000109524706,0.0002587247],"domain_scores_gemma":[0.9977729,0.000047020378,0.00009379434,0.002014495,0.000035995028,0.000035842237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013695784,0.00016053829,0.00030759728,0.000821391,0.00006233135,0.000006628806,0.0012143105,0.000103863444,0.000053360985],"category_scores_gemma":[0.000005648706,0.00018313329,0.000106288644,0.00126695,0.00016295364,0.00016953632,0.0001273747,0.00032317036,0.000031433225],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016106441,0.0019920461,0.21419984,0.00030367312,0.010556664,0.000029443641,0.028366504,0.19091046,0.52619916,0.0034807879,0.009569514,0.014230841],"study_design_scores_gemma":[0.007185111,0.00012865601,0.35095054,0.0003405309,0.0020610462,0.000006425068,0.0011258415,0.2564588,0.36961308,0.0013433346,0.008533874,0.0022527487],"about_ca_topic_score_codex":0.00023095509,"about_ca_topic_score_gemma":0.0006254767,"teacher_disagreement_score":0.15658607,"about_ca_system_score_codex":0.00013940399,"about_ca_system_score_gemma":0.000006427808,"threshold_uncertainty_score":0.7467959},"labels":[],"label_agreement":null},{"id":"W2169842461","doi":"10.1109/lcomm.2011.051011.101684","title":"Long Term Cluster-Based Channel Envelope and Phase Prediction for Dynamic Link Adaptation","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Channel (broadcasting); Computer science; Multipath propagation; Envelope (radar); Phase (matter); Term (time); Cluster (spacecraft); Electronic engineering; Algorithm; Telecommunications; Physics; Computer network; Engineering","score_opus":0.04224296458206092,"score_gpt":0.26723413493404174,"score_spread":0.22499117035198082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169842461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023993338,0.0002551848,0.97368044,0.0005811598,0.0002765627,0.0007158046,0.000057904996,0.00034415125,0.00009542989],"genre_scores_gemma":[0.92021555,0.00013983925,0.07863536,0.00017791489,0.00003659354,0.0004175264,0.00031719345,0.000048505735,0.000011551815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.00004405005,0.00027803562,0.00014292079,0.000053361066,0.00015409695],"domain_scores_gemma":[0.9989962,0.0000960333,0.00007642461,0.00072274037,0.000059942693,0.000048642727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012317834,0.00013628714,0.00011882458,0.00015309521,0.00016997599,0.000023251025,0.00025876935,0.00006937855,0.0000023466807],"category_scores_gemma":[0.000018470568,0.00016179733,0.000033644166,0.00013067159,0.000069591515,0.00030150855,0.000022669648,0.00011686645,0.0000047278886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001122691,0.00023063035,0.000565997,0.0004672378,0.00016532485,0.0000014696035,0.007987535,0.8698572,0.0519031,0.000115534844,0.00083638245,0.06775732],"study_design_scores_gemma":[0.0013027784,0.000042568794,0.0008748129,0.000076951095,0.000036772657,0.0000037632674,0.00005986645,0.9959636,0.0012634572,0.000031022417,0.0001760817,0.00016836086],"about_ca_topic_score_codex":0.000008107391,"about_ca_topic_score_gemma":0.000052988937,"teacher_disagreement_score":0.8962222,"about_ca_system_score_codex":0.000104312865,"about_ca_system_score_gemma":0.000010677109,"threshold_uncertainty_score":0.65979034},"labels":[],"label_agreement":null},{"id":"W2169948709","doi":"10.1109/lcom.2007.348292","title":"Performance Analysis of Cooperative Diversity Wireless Networks over Nakagami-m Fading Channel","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":517,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Nakagami distribution; Fading; Moment-generating function; Probability density function; Signal-to-noise ratio (imaging); Outage probability; Diversity combining; Computer science; Wireless; Channel (broadcasting); Maximal-ratio combining; Bit error rate; Probability of error; Algorithm; Statistics; Mathematics; Wireless network; Topology (electrical circuits); Telecommunications; Combinatorics","score_opus":0.04499486000545759,"score_gpt":0.2818834896058828,"score_spread":0.23688862960042517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169948709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44042385,0.00027492663,0.55677074,0.0012028352,0.0001428637,0.00014240525,0.0000030079525,0.00009002885,0.0009493103],"genre_scores_gemma":[0.99313056,0.0016960573,0.0034327107,0.0016273529,0.000026342539,0.000011076175,0.000027188238,0.000009343209,0.000039348663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983747,0.00027534194,0.000461108,0.00029415436,0.0002633007,0.00033137042],"domain_scores_gemma":[0.99570787,0.0005756082,0.00027304498,0.0030572913,0.00028593856,0.00010027543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044019,0.00018676989,0.00034661012,0.00055845006,0.001167061,0.00007336534,0.0040934915,0.000068900896,0.000013219584],"category_scores_gemma":[0.000021995857,0.0001974701,0.0001690062,0.0034355423,0.0003001747,0.0005953256,0.0023491026,0.0003757625,0.0000053656513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011894776,0.0013175479,0.20678735,0.00005828311,0.0057757637,0.000015272859,0.044641674,0.4775948,0.040290017,0.058282983,0.007243758,0.15787362],"study_design_scores_gemma":[0.00025089772,0.0000227509,0.07811908,0.00003740239,0.00012815227,0.0000012637313,0.00007043206,0.9197542,0.0008198137,0.0000044994654,0.00054217974,0.0002493429],"about_ca_topic_score_codex":0.000037443468,"about_ca_topic_score_gemma":0.00031365326,"teacher_disagreement_score":0.55333805,"about_ca_system_score_codex":0.00013720902,"about_ca_system_score_gemma":0.00002646893,"threshold_uncertainty_score":0.89762086},"labels":[],"label_agreement":null},{"id":"W2170470734","doi":"10.1109/lcomm.2008.080977","title":"Robust LDPC decoding using irregular decoders","year":2008,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Low-density parity-check code; Decoding methods; Robustness (evolution); Computer science; Algorithm; Channel code; Channel (broadcasting); Error detection and correction; Minification; Forward error correction; Parity bit; Convergence (economics); Code (set theory); Telecommunications","score_opus":0.1719205382265378,"score_gpt":0.3057297130795647,"score_spread":0.1338091748530269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170470734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17226985,0.00019027587,0.81974334,0.005725012,0.0003240894,0.00016448738,8.003454e-7,0.0009131433,0.0006689869],"genre_scores_gemma":[0.49127927,0.00007164678,0.50691414,0.0016541616,0.000024847028,0.000018642182,0.0000018134181,0.000017167033,0.000018287596],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847746,0.0002321584,0.00033515444,0.00035407604,0.00024696306,0.00035416507],"domain_scores_gemma":[0.99532235,0.0002883221,0.00017279756,0.004028869,0.000097868826,0.00008982027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037243846,0.00018656645,0.00018479867,0.00028039297,0.0009505156,0.000101278376,0.0043187435,0.00006905651,0.000003963653],"category_scores_gemma":[0.00007298895,0.00021636793,0.000111772635,0.0006966193,0.00027200315,0.00069967675,0.0006822501,0.00036338443,0.000035884903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017727589,0.0008445613,0.04359532,0.00007563468,0.00032622312,0.00023435794,0.021107696,0.059359968,0.702398,0.019303393,0.107066244,0.045670863],"study_design_scores_gemma":[0.00042756944,0.00003756441,0.0020165297,0.00015995503,0.000026636417,0.0007879329,0.00010805696,0.9594716,0.027539153,0.0006894876,0.0077043795,0.0010311414],"about_ca_topic_score_codex":0.00016867276,"about_ca_topic_score_gemma":0.000051420426,"teacher_disagreement_score":0.9001116,"about_ca_system_score_codex":0.000213165,"about_ca_system_score_gemma":0.000078953635,"threshold_uncertainty_score":0.88232285},"labels":[],"label_agreement":null},{"id":"W2170748328","doi":"10.1109/lcomm.2014.011214.132606","title":"Probability Distribution of End-to-End Delay in a Highway VANET","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Vehicular ad hoc network; Wireless ad hoc network; Computer science; Computer network; End-to-end principle; Probability distribution; End-to-end delay; Wireless; Telecommunications; Network packet; Mathematics; Statistics","score_opus":0.018255898296978396,"score_gpt":0.2258865226153494,"score_spread":0.20763062431837098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170748328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93609434,0.00012657848,0.05894781,0.0034354639,0.00016014178,0.0004011454,0.000050175124,0.000196488,0.00058785634],"genre_scores_gemma":[0.9934701,0.000029544804,0.005875803,0.00026953602,0.00003097249,0.00009464992,0.0002032324,0.000022240501,0.000003923039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988766,0.00020589819,0.0003674672,0.00015093843,0.00013950349,0.00025963745],"domain_scores_gemma":[0.99775755,0.00024426923,0.0000470476,0.0018387721,0.00003823203,0.000074146614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050024124,0.00013508521,0.00020148564,0.00008373777,0.000053817967,0.000017162372,0.00075912685,0.00006905378,0.0000124195],"category_scores_gemma":[0.00005998657,0.00015251225,0.000054916065,0.0003993261,0.00011720576,0.00009923479,0.000095025905,0.0002964413,0.000038270893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046833193,0.00006267078,0.0017045925,0.000036776073,0.00002342489,5.59333e-7,0.00022646315,0.96956503,0.017369803,0.0009646808,0.006286748,0.0037545622],"study_design_scores_gemma":[0.0006407637,0.000045400175,0.041323904,0.00014872984,0.0000383899,0.0000110775445,0.000017544284,0.8432154,0.0043147597,0.00046011218,0.109279096,0.00050479284],"about_ca_topic_score_codex":0.00012563886,"about_ca_topic_score_gemma":0.0008055182,"teacher_disagreement_score":0.12634961,"about_ca_system_score_codex":0.00019884076,"about_ca_system_score_gemma":0.000011392059,"threshold_uncertainty_score":0.6219269},"labels":[],"label_agreement":null},{"id":"W2171470636","doi":"10.1109/lcomm.2005.1431159","title":"An efficient generalized sphere decoder for rank-deficient MIMO systems","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":147,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Colorado Boulder","keywords":"MIMO; Decoding methods; Mathematics; Metric (unit); Rank (graph theory); Factorization; Topology (electrical circuits); Algorithm; Constant (computer programming); Channel (broadcasting); Constellation; Control theory (sociology); Applied mathematics; Combinatorics; Telecommunications; Computer science; Statistics; Beamforming","score_opus":0.02588018842045876,"score_gpt":0.2917234236327531,"score_spread":0.26584323521229436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171470636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11263368,0.0036099853,0.8779832,0.002214197,0.00022568533,0.0009882695,0.000059584,0.0016269246,0.00065846695],"genre_scores_gemma":[0.7713526,0.00041988265,0.22654814,0.00051770004,0.00006908871,0.00089086103,0.00010549513,0.00007499128,0.000021230879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870867,0.00013908306,0.00048452383,0.0002081308,0.00013689422,0.00032268444],"domain_scores_gemma":[0.9954973,0.00020690121,0.000095114796,0.0039904155,0.00011217715,0.00009813332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027297536,0.0002262085,0.00024301978,0.00013673813,0.00032538504,0.000091073845,0.0019050823,0.00008933511,0.000011012918],"category_scores_gemma":[0.000014994763,0.00025255364,0.000102113925,0.00023124543,0.00012998452,0.00018796846,0.000084000276,0.00024275639,0.000026922307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050291314,0.00010677113,0.000018007313,0.000024595218,0.000029520796,7.678867e-8,0.00030595702,0.89097404,0.08923634,0.0062978067,0.004903177,0.008098668],"study_design_scores_gemma":[0.00046415185,0.000013604251,0.000029798184,0.000039485778,0.000021000902,0.0000030976678,0.00007449555,0.84222347,0.011236678,0.00003807233,0.145534,0.00032214637],"about_ca_topic_score_codex":0.000031307052,"about_ca_topic_score_gemma":0.000053703894,"teacher_disagreement_score":0.65871894,"about_ca_system_score_codex":0.00026843496,"about_ca_system_score_gemma":0.000015090326,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W2171960942","doi":"10.1109/lcomm.2006.060953","title":"Efficient detection algorithm for 2Nx2N MIMO systems using alamouti code and QR decomposition","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"QR decomposition; MIMO; Algorithm; Computer science; Code (set theory); Space–time code; Bit error rate; Spectral efficiency; Interference (communication); Mathematics; Channel (broadcasting); Telecommunications; Decoding methods; Eigenvalues and eigenvectors","score_opus":0.01975360251592932,"score_gpt":0.2793027100334707,"score_spread":0.25954910751754134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171960942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12525165,0.0013010949,0.8716761,0.00025786762,0.00015633475,0.00056112424,0.00004550011,0.0006595689,0.000090754664],"genre_scores_gemma":[0.790106,0.00012737644,0.20928122,0.00005831011,0.00004680942,0.00027546403,0.000054864817,0.00004533309,0.000004625503],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991096,0.00008685946,0.00035244215,0.00015326364,0.000095996715,0.00020182575],"domain_scores_gemma":[0.998317,0.00021230515,0.00009662823,0.0012574834,0.00007907477,0.000037522965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017187964,0.00016506219,0.00016975965,0.00017853423,0.00039094262,0.00007244336,0.00046196778,0.000080124075,5.0957175e-7],"category_scores_gemma":[0.000005658134,0.00020129666,0.000051247865,0.00019372425,0.00013111938,0.00010534886,0.00007306864,0.00018366758,0.0000024347016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025778631,0.000047031204,0.000024723817,0.000044580465,0.000024952009,2.3380218e-7,0.00007679769,0.42945227,0.5506737,0.00037424773,0.00032198548,0.018956868],"study_design_scores_gemma":[0.00022338508,0.000009795242,0.00011063514,0.000060246573,0.00002565147,0.000017119273,0.000037607526,0.95672286,0.039624162,0.00007501178,0.0028835966,0.00020992731],"about_ca_topic_score_codex":0.000111321104,"about_ca_topic_score_gemma":0.000050525887,"teacher_disagreement_score":0.66485435,"about_ca_system_score_codex":0.0002521351,"about_ca_system_score_gemma":0.000006051771,"threshold_uncertainty_score":0.8208639},"labels":[],"label_agreement":null},{"id":"W2172080750","doi":"10.1109/lcomm.2007.061133","title":"Unitary signal constellations for differential space-time modulation","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Constellation; Unitary state; Modulation (music); Unitary matrix; Transmitter; Constellation diagram; Mathematics; Differential (mechanical device); Upper and lower bounds; SIGNAL (programming language); Topology (electrical circuits); Telecommunications; Algorithm; Quadrature amplitude modulation; Differential coding; Computer science; Decoding methods; Bit error rate; Combinatorics; Physics; Mathematical analysis; Channel (broadcasting)","score_opus":0.021397714947829233,"score_gpt":0.26578482778154383,"score_spread":0.2443871128337146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172080750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0640751,0.00017231598,0.9298605,0.0018328596,0.00010909535,0.000606259,0.00004209849,0.0011176509,0.002184179],"genre_scores_gemma":[0.88384044,0.00012715375,0.11526305,0.00022596617,0.00006206523,0.000104135,0.0002787931,0.000055669294,0.000042705982],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899924,0.000060193554,0.00040679757,0.00013818723,0.00012511706,0.00027048824],"domain_scores_gemma":[0.9972608,0.0006852819,0.000083134655,0.0017898431,0.000106401414,0.00007451161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022996587,0.00018205149,0.00018259055,0.00026295954,0.0003408696,0.0000344411,0.00088960683,0.00009450697,0.000037959646],"category_scores_gemma":[0.000015395211,0.00022244574,0.0000936729,0.00029554995,0.00021077332,0.0002493397,0.000088897934,0.00026142606,0.0000364864],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019940197,0.00009908771,0.00030093527,0.000037959133,0.000110438,5.1901213e-7,0.00040551487,0.058184423,0.88177216,0.008151582,0.009101361,0.041816097],"study_design_scores_gemma":[0.000996812,0.00004477382,0.0031773876,0.000097108765,0.00008636966,0.000013310525,0.0001312357,0.83271927,0.09988284,0.0026773508,0.059187375,0.0009861883],"about_ca_topic_score_codex":0.000008690137,"about_ca_topic_score_gemma":0.00001618301,"teacher_disagreement_score":0.8197654,"about_ca_system_score_codex":0.00015804134,"about_ca_system_score_gemma":0.000011931919,"threshold_uncertainty_score":0.9071074},"labels":[],"label_agreement":null},{"id":"W2172263489","doi":"10.1109/lcomm.2011.041811.110399","title":"On LLR Clipping in BICM-IDD Non-Coherent MIMO Communications","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Clipping (morphology); Computer science; MIMO; Decoding methods; Block (permutation group theory); Channel (broadcasting); Algorithm; Telecommunications; Mathematics","score_opus":0.0615066694518891,"score_gpt":0.2821110643058144,"score_spread":0.2206043948539253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172263489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4565792,0.005253616,0.27689794,0.017176872,0.0011182396,0.004515377,0.00011591976,0.0074550607,0.23088779],"genre_scores_gemma":[0.91035813,0.002554227,0.08507031,0.00111045,0.000014678431,0.00071245595,0.00006070105,0.00008847797,0.00003057246],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828017,0.0002449986,0.0006825404,0.00023504312,0.00017069245,0.0003865817],"domain_scores_gemma":[0.9900722,0.00047313783,0.00013477568,0.009158244,0.00006600872,0.00009561356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031568314,0.00030259695,0.0003102114,0.00051456766,0.00029348265,0.000038095077,0.004831921,0.00013072017,0.000042037318],"category_scores_gemma":[0.000039861465,0.00036007317,0.000106734915,0.00070311077,0.0004030295,0.0003451111,0.00054260157,0.0010055462,0.00015025036],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014228454,0.005000594,0.012787887,0.00044808077,0.00075647654,0.00002681174,0.03607783,0.03187081,0.5690172,0.10108506,0.0757116,0.16707541],"study_design_scores_gemma":[0.006839151,0.00051334954,0.061049648,0.0045542154,0.00025979066,0.00007039022,0.0031890783,0.43474594,0.17432207,0.023694647,0.28219914,0.008562562],"about_ca_topic_score_codex":0.00015745788,"about_ca_topic_score_gemma":0.0005522104,"teacher_disagreement_score":0.45377892,"about_ca_system_score_codex":0.00033548058,"about_ca_system_score_gemma":0.000020632939,"threshold_uncertainty_score":0.99988514},"labels":[],"label_agreement":null},{"id":"W2196290691","doi":"10.1109/lcomm.2015.2496235","title":"Allocation for Heterogeneous Storage Nodes","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Computer science; Node (physics); Distributed data store; Set (abstract data type); Computer data storage; Distributed computing; Storage efficiency; Limit (mathematics); Computer network; Mathematical optimization; Database; Mathematics","score_opus":0.08255395868495606,"score_gpt":0.31217187219852766,"score_spread":0.22961791351357158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196290691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008160166,0.0003740934,0.9716865,0.018396782,0.00024577105,0.00028525674,0.000015462509,0.0007350713,0.000100926045],"genre_scores_gemma":[0.5573292,0.000023855713,0.44093424,0.001460572,0.000017846525,0.00017934733,0.000029451716,0.000010197772,0.000015318781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999136,0.00006531398,0.00019631977,0.00025719416,0.00013579085,0.00020941785],"domain_scores_gemma":[0.9953724,0.00019547423,0.00011317753,0.0041256873,0.00013024604,0.00006301468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025106137,0.00011801583,0.00011552056,0.00012215298,0.00018737114,0.0000999922,0.004063657,0.000049892256,4.2130668e-7],"category_scores_gemma":[0.00017312648,0.00012493471,0.000044936613,0.00028576684,0.00018343562,0.00067198643,0.0005733602,0.00012648437,0.000048282756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049031496,0.00075834955,0.0004949182,0.000071868286,0.0002257805,0.00002655951,0.005087768,0.11216144,0.18460912,0.26539993,0.18004252,0.2510727],"study_design_scores_gemma":[0.0022210781,0.0002622211,0.00019949315,0.000056354165,0.000047397854,0.00012992439,0.0003476001,0.59817624,0.05674738,0.047043033,0.2932769,0.0014923689],"about_ca_topic_score_codex":0.000015713289,"about_ca_topic_score_gemma":0.000017423641,"teacher_disagreement_score":0.549169,"about_ca_system_score_codex":0.00015490843,"about_ca_system_score_gemma":0.00003730678,"threshold_uncertainty_score":0.7551353},"labels":[],"label_agreement":null},{"id":"W2243174701","doi":"10.1109/lcomm.2015.2496955","title":"On the Impact of Network State Collection on the Performance of SDN Applications","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Emulation; Computer science; State (computer science); Data collection; Load balancing (electrical power); Computer network; Controller (irrigation); Real-time computing; Distributed computing","score_opus":0.046512282450007124,"score_gpt":0.27736955539030694,"score_spread":0.2308572729402998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243174701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84725046,0.00021700686,0.121824205,0.027741363,0.00019215379,0.0008736385,0.00001066777,0.000108841145,0.0017816382],"genre_scores_gemma":[0.99599713,0.00012469798,0.002284003,0.0013421319,0.000033520853,0.00017483352,0.000003598869,0.000008335726,0.000031729505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990203,0.0002463965,0.000245014,0.00012500981,0.00020012172,0.00016316373],"domain_scores_gemma":[0.9953875,0.0013990153,0.00023324406,0.0028136682,0.00012725365,0.00003929649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006273838,0.00010206644,0.00011869407,0.000057857964,0.0003453764,0.00003873728,0.0022113863,0.00002581193,0.0000033610404],"category_scores_gemma":[0.00003890567,0.000059224196,0.00008674092,0.00097261346,0.00020085608,0.00009621331,0.00016661172,0.00023575686,0.00002280588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055299075,0.00032177992,0.004714848,0.000007109069,0.00013965055,1.4791492e-7,0.0021600113,0.61751497,0.00080453855,0.049832262,0.31765515,0.006794244],"study_design_scores_gemma":[0.001042232,0.0013248943,0.03856417,0.00028746284,0.00004771194,0.0000125599845,0.00014022362,0.93060577,0.003104577,0.012399461,0.011857109,0.00061382295],"about_ca_topic_score_codex":0.00011626194,"about_ca_topic_score_gemma":0.000013014591,"teacher_disagreement_score":0.31309083,"about_ca_system_score_codex":0.000077890254,"about_ca_system_score_gemma":0.00007965565,"threshold_uncertainty_score":0.41093427},"labels":[],"label_agreement":null},{"id":"W2244101296","doi":"10.1109/lcomm.2015.2496940","title":"A Hybrid WiFi/Magnetic Matching/PDR Approach for Indoor Navigation With Smartphone Sensors","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Dead reckoning; Real-time computing; Pedestrian; Matching (statistics); Mobile device; Computer vision; Dependency (UML); Embedded system; Artificial intelligence; Simulation; Global Positioning System; Telecommunications; Engineering; Mathematics","score_opus":0.026539597774921493,"score_gpt":0.23264777604058065,"score_spread":0.20610817826565916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244101296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5819084,0.0002464623,0.41341466,0.0010174223,0.00014684655,0.0006114477,0.000039347622,0.0010828488,0.0015325452],"genre_scores_gemma":[0.93280184,0.000028105931,0.066097625,0.00024420256,0.000037455175,0.00036253448,0.00030159674,0.000056334186,0.00007028812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991457,0.000044157303,0.00024828667,0.00016153159,0.00015734689,0.00024302072],"domain_scores_gemma":[0.99848616,0.00008120707,0.00005768249,0.0011985103,0.00010757739,0.000068863854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018410572,0.000181758,0.00017628836,0.00019049417,0.0001622385,0.0000673982,0.0006587272,0.000069599264,0.0000020374089],"category_scores_gemma":[0.000025274525,0.00017373671,0.00004694414,0.00033413878,0.0002413312,0.00018751078,0.000049775063,0.00024084665,0.00001868482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013481661,0.0003572372,0.003965809,0.00047528296,0.00033554796,0.000010136389,0.008135558,0.84237427,0.041832205,0.0055718278,0.083302915,0.013504414],"study_design_scores_gemma":[0.0070180735,0.00044308865,0.0016686581,0.00030388785,0.00031324453,0.00020788136,0.0045199697,0.8472834,0.08464307,0.0025817708,0.04851817,0.0024987643],"about_ca_topic_score_codex":0.000028860999,"about_ca_topic_score_gemma":0.0000068816257,"teacher_disagreement_score":0.35089344,"about_ca_system_score_codex":0.00011237765,"about_ca_system_score_gemma":0.000021276006,"threshold_uncertainty_score":0.70847774},"labels":[],"label_agreement":null},{"id":"W2293887361","doi":"10.1109/lcomm.2016.2517142","title":"A Relaxed Min-Sum LDPC Decoder With Simplified Check Nodes","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Decoding methods; Computer science; Algorithm; Soft-decision decoder; Offset (computer science); Very-large-scale integration; Computation; Quantization (signal processing); Mathematics","score_opus":0.03398902868233804,"score_gpt":0.2744875879805364,"score_spread":0.24049855929819836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293887361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099976495,0.00008586836,0.8303607,0.06575547,0.0001525766,0.0002830342,0.000003291862,0.0012933803,0.002089149],"genre_scores_gemma":[0.72699547,0.00004243806,0.2694894,0.0030820444,0.000022283279,0.00011880524,0.0000016727543,0.00002501732,0.00022287977],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847573,0.00021640894,0.0003005152,0.0004036746,0.00024771361,0.00035596764],"domain_scores_gemma":[0.9937026,0.00067190186,0.00018586553,0.0052145333,0.0001324107,0.00009268635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036713385,0.00020843075,0.00019103769,0.00018222388,0.0003218636,0.00012216478,0.0043551936,0.00007162475,0.0000069564967],"category_scores_gemma":[0.00008784509,0.00014926244,0.00007350674,0.00048932346,0.00028559015,0.00058148813,0.00056705956,0.00024815885,0.0001285317],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043618536,0.0004031841,0.01350392,0.000027822167,0.00017634407,0.000026207563,0.0030522635,0.000046577534,0.8028745,0.02041009,0.09095448,0.068480976],"study_design_scores_gemma":[0.0072167534,0.0008815364,0.05025136,0.0026490293,0.00026082684,0.00083553826,0.0004504597,0.027220324,0.6177677,0.013192911,0.27251258,0.0067609726],"about_ca_topic_score_codex":0.000076442026,"about_ca_topic_score_gemma":0.00015111301,"teacher_disagreement_score":0.627019,"about_ca_system_score_codex":0.00014081295,"about_ca_system_score_gemma":0.00006749959,"threshold_uncertainty_score":0.8093106},"labels":[],"label_agreement":null},{"id":"W2294378931","doi":"10.1109/lcomm.2015.2503277","title":"Per-Node Traffic Load in Cooperative Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Wireless sensor network; Fading; Key distribution in wireless sensor networks; Sink (geography); Node (physics); Wireless network; Cooperative diversity; Multipath routing; Wireless; Routing protocol; Distributed computing; Routing (electronic design automation); Channel (broadcasting); Dynamic Source Routing; Telecommunications; Engineering","score_opus":0.06853717599742386,"score_gpt":0.29738751054898604,"score_spread":0.22885033455156217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294378931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26035157,0.0043461756,0.6314132,0.0958288,0.00086930784,0.00090093655,0.0000048321904,0.0006785902,0.0056065368],"genre_scores_gemma":[0.9706296,0.0013376062,0.021800637,0.0058913226,0.000059371465,0.00011691751,0.000015863949,0.000021350435,0.00012736444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974514,0.0010009056,0.00046922037,0.00038526306,0.00029889893,0.00039431098],"domain_scores_gemma":[0.99502856,0.00040218997,0.00013112478,0.0038907963,0.00036241682,0.00018493504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009124438,0.00024009528,0.00028532417,0.0001826141,0.0003176336,0.00026119524,0.004239088,0.00008547838,0.000008289605],"category_scores_gemma":[0.00007564769,0.0002481873,0.00007277332,0.0011060075,0.0002752736,0.00059334276,0.00083245477,0.00066970347,0.00012644901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049480182,0.0009951508,0.0020794966,0.000012994641,0.0001200493,0.00003246022,0.02434435,0.7634819,0.010892865,0.028148869,0.058479913,0.111362465],"study_design_scores_gemma":[0.001023514,0.0000350611,0.0006712796,0.000072309485,0.0000069842663,0.000020158623,0.00028931221,0.96673083,0.00016594896,0.000017973594,0.030518038,0.0004486054],"about_ca_topic_score_codex":0.000031417305,"about_ca_topic_score_gemma":0.0005885986,"teacher_disagreement_score":0.710278,"about_ca_system_score_codex":0.00043344343,"about_ca_system_score_gemma":0.00022942721,"threshold_uncertainty_score":0.999997},"labels":[],"label_agreement":null},{"id":"W2295334956","doi":"10.1109/lcomm.2015.2513775","title":"BER Upper Bound Expressions in Coded Two-Transmission Schemes With Arbitrarily Spaced Signal Constellations","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Economic Development and Innovation","keywords":"Fading; Transmission (telecommunications); Upper and lower bounds; Algorithm; Trellis (graph); Computer science; Mathematics; Nakagami distribution; Convolutional code; Expression (computer science); Signal-to-noise ratio (imaging); Trellis modulation; Decoding methods; Constellation diagram; Topology (electrical circuits); Bit error rate; Telecommunications; Combinatorics; Mathematical analysis","score_opus":0.0645962669066422,"score_gpt":0.30417380889149725,"score_spread":0.23957754198485504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295334956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1107107,0.0019997696,0.8063885,0.06605078,0.00016509733,0.00077671267,0.0000061247306,0.00039721848,0.01350508],"genre_scores_gemma":[0.85301113,0.000292552,0.14386922,0.0025473002,0.000024911653,0.00008976057,0.000026118778,0.000019452975,0.00011954181],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795383,0.0006108792,0.00041412425,0.00035838972,0.00032327176,0.00033950544],"domain_scores_gemma":[0.9959411,0.00046525252,0.00014482993,0.0029834772,0.00023034964,0.00023501017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047177263,0.0002329063,0.00024533682,0.00029234198,0.00056796765,0.00027133583,0.0026125992,0.000065489614,0.0000304567],"category_scores_gemma":[0.00002988546,0.00020941964,0.00006423916,0.0010574711,0.0003824492,0.0007613078,0.0004722223,0.00057873677,0.00004854389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024803088,0.002415698,0.030467859,0.000044364446,0.00035278714,0.000052102416,0.037421405,0.04171836,0.5080003,0.24523564,0.056690786,0.077352636],"study_design_scores_gemma":[0.01060655,0.00023262137,0.0052995514,0.0013025275,0.00008325431,0.00012914512,0.0011784299,0.5709162,0.020900073,0.002371211,0.38454047,0.0024399888],"about_ca_topic_score_codex":0.00004179425,"about_ca_topic_score_gemma":0.00021592157,"teacher_disagreement_score":0.74230045,"about_ca_system_score_codex":0.00014259937,"about_ca_system_score_gemma":0.00027904543,"threshold_uncertainty_score":0.8539885},"labels":[],"label_agreement":null},{"id":"W2295912450","doi":"10.1109/lcomm.2015.2498151","title":"Joint Power Control and Time Switching for SWIPT Systems With Heterogeneous QoS Requirements","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Power control; Quality of service; Wireless; Computer network; Power (physics); Dynamic demand; Joint (building); Transmission (telecommunications); Heterogeneous network; Power consumption; Wireless network; Real-time computing; Distributed computing; Telecommunications; Engineering","score_opus":0.0348594923052213,"score_gpt":0.23527533012931645,"score_spread":0.20041583782409517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295912450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62752587,0.0032869487,0.3612099,0.002705826,0.0011219468,0.001351539,0.000034343153,0.0010929815,0.0016706843],"genre_scores_gemma":[0.99206036,0.00002370461,0.0071012476,0.00045280036,0.00008950973,0.00016242788,0.00001653023,0.000067383044,0.000026018735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991261,0.00007914944,0.00026522577,0.0001474333,0.00013086303,0.0002512675],"domain_scores_gemma":[0.99850255,0.00017858892,0.000073116666,0.0010579147,0.00007112167,0.00011670867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028616798,0.0001692513,0.0002134209,0.00007010611,0.00013418964,0.000102218575,0.00040536202,0.000057300887,6.259043e-7],"category_scores_gemma":[0.000025368327,0.000163541,0.000030345243,0.00008387229,0.00006762232,0.00014547288,0.00004676246,0.00016947345,0.00001086589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017385324,0.000024238465,0.00025080767,0.000041366482,0.00020749004,0.0000037578347,0.0004078404,0.9520438,0.038668763,0.00016940925,0.0078471145,0.00031805914],"study_design_scores_gemma":[0.0018379288,0.00009335795,0.000107146014,0.0003050465,0.00007680505,0.00007193243,0.00006219893,0.9866835,0.00060980563,0.000019408386,0.009683093,0.00044980098],"about_ca_topic_score_codex":0.000029117225,"about_ca_topic_score_gemma":0.000012715476,"teacher_disagreement_score":0.36453453,"about_ca_system_score_codex":0.00011437432,"about_ca_system_score_gemma":0.000013194131,"threshold_uncertainty_score":0.6669009},"labels":[],"label_agreement":null},{"id":"W2315852694","doi":"10.1109/lcomm.2016.2544830","title":"Power Allocation for SC-FDE-Based CR Systems Under Explicit Primary User Protection","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transmitter; Maximization; Mathematical optimization; Constraint (computer-aided design); Transmitter power output; Computer science; Power (physics); Max-min fairness; Convex optimization; Optimization problem; Regular polygon; Resource allocation; Mathematics; Telecommunications; Computer network","score_opus":0.024331128879375594,"score_gpt":0.23110350789876033,"score_spread":0.20677237901938472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315852694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008933144,0.00022065963,0.9836095,0.0048711323,0.00044184944,0.0011450535,0.00001588245,0.0005702691,0.00019253531],"genre_scores_gemma":[0.96680355,0.000115095674,0.030189084,0.00067285326,0.000107393265,0.0018490414,0.000077897275,0.00009438821,0.00009070094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990535,0.00007795165,0.00031597706,0.000184792,0.00013162351,0.00023619388],"domain_scores_gemma":[0.9980886,0.0003158645,0.00009741328,0.0013301475,0.00011901058,0.000048949445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015187841,0.00017320552,0.00015562892,0.00011365739,0.00019761165,0.000046401743,0.0004431527,0.00009709716,0.000006235345],"category_scores_gemma":[0.00002684524,0.00015940369,0.000060442984,0.00023782063,0.000063574946,0.00037927102,0.000027546828,0.000119008415,0.00002941073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012860661,0.00002857955,0.000059791084,0.00003920493,0.0000315583,7.3952236e-8,0.000037747224,0.8394553,0.15405999,0.0010552101,0.003014817,0.0022048657],"study_design_scores_gemma":[0.0022846134,0.000066818124,0.0013353272,0.0005856963,0.00006061014,0.000005711356,0.000054342334,0.9243356,0.0182671,0.00022033634,0.051841296,0.0009425776],"about_ca_topic_score_codex":0.0000068504455,"about_ca_topic_score_gemma":0.0000070666247,"teacher_disagreement_score":0.9578704,"about_ca_system_score_codex":0.00044329057,"about_ca_system_score_gemma":0.000022664113,"threshold_uncertainty_score":0.65002936},"labels":[],"label_agreement":null},{"id":"W2333118136","doi":"10.1109/lcomm.2016.2549011","title":"Secure Communications in Underlay Cognitive Radio Networks: User Scheduling and Performance Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eavesdropping; Computer science; Computer network; Underlay; Scheduling (production processes); Cognitive radio; Telecommunications link; Secrecy; Transmitter; Cognitive network; Telecommunications; Signal-to-noise ratio (imaging); Wireless; Computer security; Engineering","score_opus":0.025383898286585622,"score_gpt":0.2679925894506053,"score_spread":0.24260869116401965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333118136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8103974,0.0042103776,0.1731574,0.009884901,0.000055796758,0.00046080118,0.000031342483,0.00079816865,0.0010038348],"genre_scores_gemma":[0.9601776,0.019838052,0.019216958,0.00043186356,0.00001785061,0.00020511085,0.000052416915,0.00004589838,0.000014262547],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985289,0.00031935994,0.0004942102,0.0002169275,0.00013602871,0.00030457313],"domain_scores_gemma":[0.99483323,0.0010568745,0.00010304072,0.0038304105,0.000092561786,0.000083873936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004444837,0.00023058568,0.00032593266,0.00057918264,0.0002786623,0.00007348106,0.0020096647,0.00013095049,0.000013820236],"category_scores_gemma":[0.000042945856,0.00022194652,0.000089952926,0.0012712871,0.0005662908,0.00051745155,0.00046368223,0.0005373146,0.000015164738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011265027,0.001074249,0.6570496,0.00030525163,0.005694201,0.000008916177,0.018692924,0.093308724,0.0531643,0.022223786,0.0056878333,0.14267758],"study_design_scores_gemma":[0.0017022132,0.000043945893,0.14921278,0.0010216598,0.0006085168,0.00001774567,0.0008164557,0.8345976,0.0020856753,0.0002063697,0.008247887,0.0014391732],"about_ca_topic_score_codex":0.000045167675,"about_ca_topic_score_gemma":0.0006899502,"teacher_disagreement_score":0.74128884,"about_ca_system_score_codex":0.00018766003,"about_ca_system_score_gemma":0.000016293221,"threshold_uncertainty_score":0.9050717},"labels":[],"label_agreement":null},{"id":"W2342910849","doi":"10.1109/lcomm.2016.2558144","title":"Adaptive Delivery in Caching Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Redundancy (engineering); Computer network; Content delivery; Upper and lower bounds; Transmission (telecommunications); Monte Carlo method; Distributed computing; Mathematical optimization; Telecommunications; Mathematics; Statistics","score_opus":0.03457221836502291,"score_gpt":0.23808526651254291,"score_spread":0.20351304814752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342910849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14059934,0.00046411343,0.83172035,0.025953157,0.000306283,0.00011359266,0.000001941176,0.00017280618,0.00066842785],"genre_scores_gemma":[0.9911913,0.00021643827,0.0051699975,0.003296899,0.000034566747,0.000028565524,0.0000010845511,0.000007908622,0.000053198346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989617,0.00025255865,0.0002091242,0.00022423289,0.000116232535,0.00023619276],"domain_scores_gemma":[0.9973855,0.00047357238,0.00006847859,0.0019882193,0.00003459567,0.00004961744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998335,0.0001046145,0.00011282272,0.00015523036,0.00017030451,0.000064866064,0.0023160356,0.000038583297,0.0000018394885],"category_scores_gemma":[0.000020026497,0.00008450693,0.00006348014,0.0002715125,0.000093400915,0.0005343491,0.00041141902,0.0002197872,0.00004853069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006385562,0.0005520963,0.02335363,0.00000907344,0.00017868917,0.00009978146,0.0028349115,0.03503974,0.18293768,0.07052303,0.02798349,0.65642405],"study_design_scores_gemma":[0.0022638077,0.00009394385,0.018762179,0.0006154837,0.00002333354,0.000054994987,0.00013188737,0.9667969,0.0006101591,0.0011223491,0.008353713,0.001171256],"about_ca_topic_score_codex":0.00034318754,"about_ca_topic_score_gemma":0.00022105513,"teacher_disagreement_score":0.93175715,"about_ca_system_score_codex":0.00012409076,"about_ca_system_score_gemma":0.000023858465,"threshold_uncertainty_score":0.43038088},"labels":[],"label_agreement":null},{"id":"W2344696675","doi":"10.1109/lcomm.2016.2558145","title":"The Gaussian Diamond-Wiretap Channel with Conferencing Relays","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Confidentiality; Computer science; Computer network; Channel (broadcasting); Computer security; Teleconference; Gaussian; Degrees of freedom (physics and chemistry); Internet privacy; Telecommunications; Physics","score_opus":0.021851700120953246,"score_gpt":0.231995442580198,"score_spread":0.21014374245924475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344696675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29071993,0.0052876915,0.3660389,0.28951618,0.0006781073,0.0026606673,0.00008848668,0.007774521,0.03723554],"genre_scores_gemma":[0.99204546,0.0029830926,0.003883771,0.00046780892,0.000029640316,0.0004588316,0.000008393392,0.000058740563,0.000064239146],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989327,0.00016163632,0.00029860073,0.00013882005,0.00016963625,0.00029860303],"domain_scores_gemma":[0.994977,0.0006963897,0.00008059128,0.004099287,0.00007237108,0.000074378106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002886231,0.00018892539,0.00015481871,0.00009540183,0.00053258234,0.00009408621,0.0023096658,0.00006844765,0.000007035009],"category_scores_gemma":[0.000029083409,0.000114771115,0.000054084587,0.0002383699,0.00048290807,0.00025318682,0.00018237554,0.00033692218,0.00007110738],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072874725,0.00025759838,0.004584663,0.00012101337,0.0009919273,0.0000133625235,0.012681339,0.001734942,0.60050917,0.097998515,0.13064049,0.15039411],"study_design_scores_gemma":[0.003376236,0.00021561074,0.020357765,0.0022044175,0.00023159751,0.00014375539,0.0015776176,0.040627446,0.18430616,0.0053222384,0.7378228,0.0038144044],"about_ca_topic_score_codex":0.00003224975,"about_ca_topic_score_gemma":0.0003187777,"teacher_disagreement_score":0.70132554,"about_ca_system_score_codex":0.00014236654,"about_ca_system_score_gemma":0.00002193036,"threshold_uncertainty_score":0.46802303},"labels":[],"label_agreement":null},{"id":"W2392237044","doi":"10.1109/lcomm.2016.2540625","title":"A Secure Code Based Cryptosystem via Random Insertions, Deletions, and Errors","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cryptosystem; Hybrid cryptosystem; Goldwasser–Micali cryptosystem; Paillier cryptosystem; Computer science; Plaintext; Plaintext-aware encryption; Code word; Key encapsulation; Theoretical computer science; Key (lock); Public-key cryptography; Deterministic encryption; Threshold cryptosystem; Code (set theory); Cryptography; Key size; Decoding methods; Symmetric-key algorithm; Encryption; Algorithm; Computer security; Public key cryptosystem","score_opus":0.019223036240413736,"score_gpt":0.24071628676366347,"score_spread":0.22149325052324972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392237044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054368123,0.00030692865,0.87493783,0.06955972,0.00015131681,0.0002191293,0.000013412956,0.0002923499,0.0001511962],"genre_scores_gemma":[0.94360894,0.000093183226,0.0527419,0.0033705158,0.000022515322,0.0001320605,0.000004475432,0.000012464976,0.000013927337],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847984,0.00054311927,0.00029158752,0.00029340724,0.00016232682,0.00022969661],"domain_scores_gemma":[0.9964219,0.0007362038,0.00012083941,0.0025423751,0.00007343418,0.000105279585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052860397,0.0001581887,0.00016915568,0.0002511856,0.00055959687,0.000108875036,0.0018476364,0.00005847761,0.000009876362],"category_scores_gemma":[0.00004209951,0.00012429128,0.00010498665,0.0004892271,0.00027776568,0.00040011827,0.00023646996,0.00014835065,0.000044153425],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019460569,0.00066779216,0.007942831,0.00010771552,0.00025021573,0.000016494225,0.002792926,0.00021003417,0.39892197,0.3728321,0.029331664,0.18673168],"study_design_scores_gemma":[0.022937039,0.0005088163,0.010850706,0.0021340318,0.00034166416,0.0003454673,0.0003660954,0.15727189,0.029580677,0.05849665,0.71287566,0.004291279],"about_ca_topic_score_codex":0.000012362051,"about_ca_topic_score_gemma":0.000054734766,"teacher_disagreement_score":0.88924086,"about_ca_system_score_codex":0.00004595337,"about_ca_system_score_gemma":0.000041224124,"threshold_uncertainty_score":0.5068452},"labels":[],"label_agreement":null},{"id":"W2401760951","doi":"10.1109/lcomm.2016.2571691","title":"Optimal Polynomial Time Algorithm for Restoring Multicast Cloud Services","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qatar National Research Fund","keywords":"Multicast; Computer science; Computer network; Unicast; Cloud computing; Distributed computing; Source-specific multicast; Data center; Pragmatic General Multicast; Network topology; Protocol Independent Multicast; Xcast; Node (physics); Multicast address; Engineering","score_opus":0.020754873203313554,"score_gpt":0.2586445345679753,"score_spread":0.23788966136466178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401760951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10414251,0.00009650337,0.85095906,0.043031454,0.0007076945,0.00033366334,0.000010197993,0.00039721563,0.00032168117],"genre_scores_gemma":[0.24697906,0.000015532385,0.74888563,0.0022743624,0.00064430555,0.00010813503,0.000004716432,0.00003106743,0.0010572005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882174,0.000108177854,0.0002540578,0.00032085663,0.00016929084,0.00032590376],"domain_scores_gemma":[0.99676675,0.00046610992,0.00011651695,0.0025127674,0.000056868364,0.00008096242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003579519,0.0001459304,0.00014332705,0.000114576134,0.00044864084,0.00014049186,0.0033701467,0.000040805564,0.000002527533],"category_scores_gemma":[0.000011960666,0.00011540728,0.000103705526,0.0001839301,0.0001094417,0.00006941246,0.000917493,0.00009667823,0.00013897555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140197535,0.0002829386,0.00013151659,0.0000364121,0.0001850713,0.000006847795,0.002331291,0.004298159,0.049666688,0.0013183415,0.036285114,0.9054436],"study_design_scores_gemma":[0.0009958463,0.00005351487,0.00025136652,0.00013082758,0.000021894102,0.0000099731515,0.000033942048,0.80990857,0.0012834433,0.000029754037,0.18691833,0.00036254412],"about_ca_topic_score_codex":0.000038137026,"about_ca_topic_score_gemma":0.0000032761275,"teacher_disagreement_score":0.90508103,"about_ca_system_score_codex":0.00009819277,"about_ca_system_score_gemma":0.000015399693,"threshold_uncertainty_score":0.6262627},"labels":[],"label_agreement":null},{"id":"W2414979911","doi":"10.1109/lcomm.2016.2578314","title":"Average Rate Analysis for the Full-Duplex MISO Interference Channel","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interference (communication); Channel (broadcasting); Transceiver; Computer science; Duplex (building); Co-channel interference; Telecommunications; Adjacent-channel interference; Signal-to-noise ratio (imaging); Wireless","score_opus":0.042299094225818096,"score_gpt":0.25847619784958703,"score_spread":0.21617710362376893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414979911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17280138,0.00084618217,0.7782508,0.04647057,0.00027764583,0.00056186976,0.00015398693,0.00046907677,0.00016850074],"genre_scores_gemma":[0.9921866,0.002091304,0.0038158044,0.00075941224,0.00005412699,0.000820027,0.000055587483,0.000051604464,0.00016554934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875534,0.00016737684,0.0004179709,0.00020779653,0.0001075591,0.00034393696],"domain_scores_gemma":[0.9921738,0.002520648,0.00009650821,0.005017524,0.000116779804,0.00007473214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003828358,0.00023099579,0.00025413441,0.0002506582,0.00051678426,0.00009003908,0.0033641444,0.000070834496,0.000052038933],"category_scores_gemma":[0.00011045855,0.00016141012,0.0002610145,0.0007715095,0.0003243586,0.00021583545,0.00024828737,0.0002536753,0.00011649239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014944133,0.000052974996,0.00017256146,0.00001884421,0.0011944046,3.2169763e-7,0.0008566259,0.77590775,0.20699444,0.00097068324,0.0084533915,0.005363061],"study_design_scores_gemma":[0.0004802158,0.000016398419,0.002134864,0.000053670297,0.00030175576,0.000002728354,0.00010454729,0.9706978,0.002895529,0.000018218969,0.02291779,0.00037647923],"about_ca_topic_score_codex":0.000051076287,"about_ca_topic_score_gemma":0.00061647396,"teacher_disagreement_score":0.81938523,"about_ca_system_score_codex":0.0001479484,"about_ca_system_score_gemma":0.000017051665,"threshold_uncertainty_score":0.65821135},"labels":[],"label_agreement":null},{"id":"W2464210557","doi":"10.1109/lcomm.2016.2587698","title":"Ternary Convolutional Codes for Ternary Phase Shift Keying","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Ternary operation; Binary number; Keying; Notation; Convolutional code; Mathematics; Combinatorics; Discrete mathematics; Algorithm; Computer science; Arithmetic; Decoding methods; Telecommunications","score_opus":0.04351049413457335,"score_gpt":0.3080357761184908,"score_spread":0.26452528198391745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464210557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056545563,0.00019188914,0.8964496,0.045735788,0.00032098513,0.00020460265,0.000043433327,0.00023595418,0.00027213164],"genre_scores_gemma":[0.9223343,0.00004834851,0.07415571,0.0031509025,0.00008691322,0.00015428023,0.000009846224,0.0000116241545,0.00004804079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989557,0.00015556987,0.00023770642,0.0002623532,0.00013659935,0.0002520349],"domain_scores_gemma":[0.99680007,0.00093864166,0.0001080544,0.002030179,0.000048564823,0.00007450684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036508628,0.00013121603,0.00012520383,0.00015826781,0.00047329007,0.00008854294,0.0029602675,0.000038077866,0.0000117269365],"category_scores_gemma":[0.00003141232,0.00010731682,0.00014711874,0.00020051571,0.00030558766,0.0005172109,0.00034052046,0.0001000174,0.000042540687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013833215,0.0007449596,0.0034452588,0.000028331491,0.00020877992,0.000008824473,0.0016544596,0.000037253812,0.277213,0.5749926,0.027139073,0.11438915],"study_design_scores_gemma":[0.016298441,0.0012078085,0.013271321,0.0010340087,0.00018179661,0.0001921025,0.00012672677,0.061626326,0.029451873,0.31393823,0.55949366,0.003177694],"about_ca_topic_score_codex":0.000008138922,"about_ca_topic_score_gemma":0.000006541923,"teacher_disagreement_score":0.86578876,"about_ca_system_score_codex":0.0000456644,"about_ca_system_score_gemma":0.000032313055,"threshold_uncertainty_score":0.5500963},"labels":[],"label_agreement":null},{"id":"W2471957423","doi":"10.1109/lcomm.2016.2583431","title":"Relay Pre-Selection for Reducing CSI Transmission in Wireless Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Channel state information; Fading; Computer science; Relay channel; Node (physics); Computer network; Transmission (telecommunications); Channel (broadcasting); Wireless; Selection (genetic algorithm); Upper and lower bounds; Telecommunications; Power (physics); Mathematics; Engineering","score_opus":0.019642096623759746,"score_gpt":0.25909668989291434,"score_spread":0.2394545932691546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471957423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13680112,0.0001377952,0.84428483,0.017779,0.00032353547,0.00035148612,0.0000012115398,0.00023045945,0.00009057057],"genre_scores_gemma":[0.8576967,0.0003302875,0.14083645,0.0006919524,0.0000918868,0.00015817078,0.0000063790103,0.000030860865,0.00015728173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980857,0.00033427365,0.00045444837,0.00047171506,0.00018241655,0.00047143977],"domain_scores_gemma":[0.9967661,0.00097120815,0.0001697215,0.0019117359,0.000089053996,0.00009220565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050161046,0.00019669936,0.00020725536,0.0002366157,0.00034198008,0.000088022774,0.001965818,0.00011790031,0.0000023764849],"category_scores_gemma":[0.000029397643,0.00016541556,0.000107984364,0.00071304425,0.00012952194,0.0004256305,0.00013801114,0.00027972847,0.0000058967216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040660667,0.00019313184,0.0007644141,0.000014138417,0.00002783709,0.0000020177417,0.00061993586,0.66697,0.18071868,0.0042949,0.0030002813,0.14335398],"study_design_scores_gemma":[0.0007125529,0.000039903804,0.00068868493,0.00030873864,0.000009616638,0.000014392184,0.0000068527984,0.9840653,0.007213947,0.000035811532,0.0066047367,0.0002994632],"about_ca_topic_score_codex":0.000071644274,"about_ca_topic_score_gemma":0.00007461092,"teacher_disagreement_score":0.7208956,"about_ca_system_score_codex":0.00021869825,"about_ca_system_score_gemma":0.00003631925,"threshold_uncertainty_score":0.6745451},"labels":[],"label_agreement":null},{"id":"W2472984298","doi":"10.1109/lcomm.2016.2585126","title":"Designing an Optimal Energy Efficient Cluster-Based Spectrum Sensing for Cognitive Radio Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Cognitive radio; Computer science; Computational complexity theory; Transmission (telecommunications); False alarm; Key (lock); Data transmission; Energy (signal processing); Efficient energy use; Algorithm; Mathematical optimization; Real-time computing; Wireless; Computer network; Telecommunications; Mathematics; Engineering; Artificial intelligence","score_opus":0.02527992770065711,"score_gpt":0.25784109011279455,"score_spread":0.23256116241213742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472984298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020749612,0.00020283149,0.9629188,0.014982867,0.00038181417,0.0003410262,0.0000076201636,0.00027826923,0.00013713114],"genre_scores_gemma":[0.8149958,0.000031887783,0.18124251,0.0033976026,0.00024363972,0.00002352132,0.000017020839,0.000036433325,0.000011547008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976588,0.0005168559,0.0003837405,0.00057492714,0.00020870767,0.0006569678],"domain_scores_gemma":[0.9952966,0.0024525565,0.00021209511,0.0017076738,0.00015254832,0.00017851345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005724263,0.00028161224,0.00027824796,0.00023030383,0.0008245951,0.00027825084,0.0012777639,0.00008682991,0.000003022517],"category_scores_gemma":[0.00005829318,0.00024645717,0.00017022231,0.00044733443,0.00030426378,0.00033218088,0.00020344711,0.00018902657,0.0000048228358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003145236,0.00049785763,0.000111192545,0.000014688671,0.00026343777,0.00004379857,0.0012612494,0.41310447,0.055652753,0.009714855,0.002984964,0.5160362],"study_design_scores_gemma":[0.0012688495,0.00011809481,0.00008773557,0.00021746322,0.00003719119,0.00003559525,0.000033797005,0.98654157,0.010293948,0.00010278565,0.0008507039,0.00041227977],"about_ca_topic_score_codex":0.000029903427,"about_ca_topic_score_gemma":0.0000680533,"teacher_disagreement_score":0.79424626,"about_ca_system_score_codex":0.00019521223,"about_ca_system_score_gemma":0.00008126333,"threshold_uncertainty_score":0.99999875},"labels":[],"label_agreement":null},{"id":"W2493986615","doi":"10.1109/lcomm.2016.2597226","title":"Coupling Information Transmission With Approximate Message-Passing","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Message passing; Computer science; Coupling (piping); Transmission (telecommunications); Information transmission; Computer network; Telecommunications; Theoretical computer science; Distributed computing; Materials science","score_opus":0.021551926895202692,"score_gpt":0.2557015308772711,"score_spread":0.2341496039820684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493986615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011572132,0.000033972272,0.9598586,0.026580313,0.0000753036,0.00018870318,0.0000010698113,0.00093019113,0.0007597448],"genre_scores_gemma":[0.6210299,0.000048938964,0.37811032,0.0007292117,0.000008257207,0.0000508538,0.0000024231617,0.000009164547,0.0000109419225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990647,0.00006719974,0.0002635045,0.00016387399,0.00022422873,0.00021648288],"domain_scores_gemma":[0.9973165,0.00023433854,0.0001713794,0.0021232893,0.00009613683,0.00005836405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038022135,0.00013249442,0.00011381672,0.00017962584,0.0003623587,0.0001734548,0.0020986316,0.00004437418,0.0000024854496],"category_scores_gemma":[0.000021107542,0.000090805435,0.00003876147,0.00036776214,0.00012593159,0.0020544347,0.00017744559,0.0001657513,0.000027025164],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025280084,0.00011756316,0.001428057,0.00005648317,0.000052360137,0.000004225399,0.0047260737,0.0011658255,0.47479087,0.011816595,0.0050742556,0.50074244],"study_design_scores_gemma":[0.0020103436,0.00020441788,0.0020274613,0.0020776656,0.000058146332,0.00014949312,0.00017730222,0.65357184,0.2632161,0.0017472134,0.07310737,0.0016526402],"about_ca_topic_score_codex":0.000022262806,"about_ca_topic_score_gemma":0.000005294215,"teacher_disagreement_score":0.652406,"about_ca_system_score_codex":0.000104995124,"about_ca_system_score_gemma":0.000042379615,"threshold_uncertainty_score":0.38998148},"labels":[],"label_agreement":null},{"id":"W2507577160","doi":"10.1109/lcomm.2016.2606503","title":"Context-Aware Relay Selection in Buffer-Aided Wireless Relay Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of Tabriz; Iran's National Elites Foundation","keywords":"Relay; Computer science; Computer network; Relay channel; Network packet; Scheduling (production processes); Queue; Wireless network; Link Access Procedure for Frame Relay; Wireless; Telecommunications; Mathematical optimization","score_opus":0.03764916306932005,"score_gpt":0.2745392827465888,"score_spread":0.23689011967726875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507577160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081868924,0.00080358726,0.8442352,0.0714037,0.00042196325,0.00039873776,0.000001667016,0.00039359732,0.000472643],"genre_scores_gemma":[0.9863831,0.0031186254,0.006106637,0.0038882997,0.00006907318,0.00016300475,0.0000063793077,0.00002393469,0.00024093594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974435,0.0010097112,0.00053585245,0.00041284558,0.00019591695,0.00040215603],"domain_scores_gemma":[0.99571025,0.00097738,0.00019933659,0.0028412424,0.00016755998,0.00010425487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072660693,0.0002270419,0.00025724733,0.0002644142,0.00052399916,0.00014361566,0.0037751803,0.000117297044,0.000018798166],"category_scores_gemma":[0.00006785192,0.00019307046,0.00009340228,0.0011443923,0.00024487328,0.00077940477,0.00073585374,0.00052865746,0.00009218399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005558383,0.0006429104,0.022284413,0.00001660654,0.00015562653,0.0000160893,0.0035658767,0.008616525,0.11903736,0.085891046,0.06068516,0.6990328],"study_design_scores_gemma":[0.0036756266,0.0001352196,0.02796595,0.0009925121,0.000029058758,0.00008676646,0.000108897904,0.8646626,0.0042872294,0.00029084293,0.09616372,0.001601607],"about_ca_topic_score_codex":0.00004301275,"about_ca_topic_score_gemma":0.00084741256,"teacher_disagreement_score":0.9045142,"about_ca_system_score_codex":0.00033023383,"about_ca_system_score_gemma":0.0000657161,"threshold_uncertainty_score":0.7873185},"labels":[],"label_agreement":null},{"id":"W2516177554","doi":"10.1109/lcomm.2016.2599868","title":"Joint Power Allocation and Subcarrier-Relay Assignment for OFDM-Based Decode-and-Forward Relay Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subcarrier; Orthogonal frequency-division multiplexing; Relay; Computer science; Joint (building); Resource allocation; Optimization problem; Signal-to-noise ratio (imaging); Multiplexing; Mathematical optimization; Computational complexity theory; Channel (broadcasting); Power (physics); Computer network; Telecommunications; Algorithm; Mathematics; Engineering","score_opus":0.03998087911710258,"score_gpt":0.27230909251842506,"score_spread":0.23232821340132248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516177554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011015134,0.0010856428,0.8799877,0.10696518,0.00018626502,0.0004780996,0.0000053616586,0.00013363952,0.00014294572],"genre_scores_gemma":[0.9241971,0.0016577264,0.06785308,0.0058141053,0.000028337594,0.000305955,0.000011321998,0.000021207938,0.000111180816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983392,0.00037610202,0.00042716306,0.00039060242,0.00016397683,0.00030296564],"domain_scores_gemma":[0.99575824,0.0009614582,0.00019899603,0.0027568259,0.00017487237,0.00014959947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084621913,0.00020821547,0.00021811835,0.0001454102,0.0006912485,0.00018327612,0.0014857744,0.000084976644,0.000009151583],"category_scores_gemma":[0.00010547573,0.00016958138,0.00008011063,0.00027145987,0.00029797043,0.0004109061,0.0005388851,0.00019735818,0.000008526217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001029412,0.0005462616,0.005543978,0.000058789978,0.00039187272,0.0000030939352,0.0036412799,0.011349839,0.17208898,0.23450653,0.06750232,0.5042641],"study_design_scores_gemma":[0.0037211196,0.00028862536,0.01028623,0.00044120164,0.000071997856,0.000019329513,0.00006637889,0.7549738,0.0055775275,0.0006374783,0.22269225,0.0012240271],"about_ca_topic_score_codex":0.000004952164,"about_ca_topic_score_gemma":0.00004268939,"teacher_disagreement_score":0.91318196,"about_ca_system_score_codex":0.00014040057,"about_ca_system_score_gemma":0.000057191646,"threshold_uncertainty_score":0.69153285},"labels":[],"label_agreement":null},{"id":"W2525110762","doi":"10.1109/lcomm.2016.2614512","title":"Quaternion Modulation for Dual-Polarized Antennas","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quaternion; Modulation (music); Spatial multiplexing; Computer science; Spectral efficiency; Multiplexing; Wireless; Transmission (telecommunications); Scheme (mathematics); Electronic engineering; Spatial modulation; Topology (electrical circuits); MIMO; Telecommunications; Mathematics; Physics; Engineering; Acoustics; Beamforming","score_opus":0.035761123061737204,"score_gpt":0.2705017207026306,"score_spread":0.23474059764089342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525110762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04758858,0.0003183278,0.93449914,0.015324672,0.0002386511,0.00037477273,0.000034062832,0.0015135248,0.00010823572],"genre_scores_gemma":[0.9311787,0.001081171,0.06703804,0.00018823068,0.00003062589,0.0003551501,0.00003606051,0.00004669796,0.000045360877],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992011,0.000052344763,0.0003012898,0.00014141269,0.000087414155,0.00021641533],"domain_scores_gemma":[0.9966981,0.00043583644,0.00007466544,0.0026915749,0.000068123874,0.000031703436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014526678,0.00014727034,0.00015088447,0.00016529775,0.0001882787,0.000025585126,0.0009847734,0.00008499282,0.0000057082507],"category_scores_gemma":[0.00008783499,0.00012602325,0.00006976593,0.0001800631,0.00019053188,0.00033524042,0.00011882763,0.00012983533,0.000054919044],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006334873,0.000018464887,0.00019900457,0.000012254937,0.000030427525,1.18501426e-7,0.000077162564,0.0021096778,0.9581538,0.0028132615,0.0016074069,0.03497211],"study_design_scores_gemma":[0.0058331704,0.00010804494,0.006840403,0.00056655257,0.000071574636,0.000025380841,0.00030762455,0.41191038,0.3160874,0.018735021,0.23729485,0.0022195755],"about_ca_topic_score_codex":0.000005675221,"about_ca_topic_score_gemma":0.000017799868,"teacher_disagreement_score":0.8835901,"about_ca_system_score_codex":0.0001422918,"about_ca_system_score_gemma":0.0000061558167,"threshold_uncertainty_score":0.5139079},"labels":[],"label_agreement":null},{"id":"W2532967233","doi":"10.1109/lcomm.2016.2619338","title":"Uplink Modeling of $K$ -Tier Heterogeneous Networks: A Queuing Theory Approach","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heterogeneous network; Telecommunications link; Queueing theory; User equipment; Network packet; Computer network; Stochastic geometry; Queue; Base station; Throughput; Queue management system; Mathematical optimization; Wireless network; Wireless; Telecommunications; Mathematics","score_opus":0.02172646501703544,"score_gpt":0.22890889087678895,"score_spread":0.20718242585975352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532967233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008716566,0.0010812031,0.9887562,0.00018031578,0.00014741391,0.00020096533,0.0000042482106,0.00025517342,0.0006579094],"genre_scores_gemma":[0.9351814,0.0003807297,0.06414362,0.00008682255,0.000046200996,0.00007914881,0.0000106454645,0.00005365559,0.000017816357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991461,0.000102992555,0.00035838163,0.00013006786,0.00006758769,0.00019487372],"domain_scores_gemma":[0.9982135,0.00015576363,0.000059870825,0.0014773069,0.000053732718,0.000039778137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022282066,0.00013658541,0.0001746404,0.00010391798,0.00008353957,0.000012068302,0.00061219686,0.00006691667,0.0000037262923],"category_scores_gemma":[0.000021326181,0.000117927106,0.0000653075,0.00016765934,0.00008730098,0.00018340461,0.0000688831,0.00011959564,0.0000070566434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031824611,0.000012192021,0.00002047198,0.000017545575,0.000040282055,1.7014987e-7,0.00018335144,0.98103786,0.0155657595,0.0004290306,0.000071880444,0.0026182502],"study_design_scores_gemma":[0.00017760013,0.0000035492258,0.0000011332537,0.000091256494,0.000015447711,0.000008313379,0.000032217093,0.9985665,0.0007723852,0.00011300298,0.0000720014,0.00014656581],"about_ca_topic_score_codex":0.000006129066,"about_ca_topic_score_gemma":0.000003203883,"teacher_disagreement_score":0.9264648,"about_ca_system_score_codex":0.00009634858,"about_ca_system_score_gemma":0.0000061122387,"threshold_uncertainty_score":0.48089278},"labels":[],"label_agreement":null},{"id":"W2537496845","doi":"10.1109/lcomm.2016.2619706","title":"Generic Linear Network Code Construction Using Transversal Matroids","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Matroid; Transversal (combinatorics); Linear network coding; Code (set theory); Computer science; Dual code; Algorithm; Representation (politics); Systematic code; Matrix (chemical analysis); Coding (social sciences); Theoretical computer science; Independence (probability theory); Discrete mathematics; Mathematics; Low-density parity-check code; Decoding methods; Programming language","score_opus":0.07720417784015142,"score_gpt":0.2965778877077936,"score_spread":0.21937370986764215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537496845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026939739,0.00061151735,0.9418839,0.029173627,0.0005060265,0.00017503444,0.0000053550957,0.00028658388,0.00041819346],"genre_scores_gemma":[0.582059,0.0019634448,0.4132189,0.0024859228,0.00017110833,0.000029013667,0.0000052134947,0.000020118934,0.000047271955],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998347,0.00047787902,0.00036883823,0.0002913644,0.0001792824,0.000335674],"domain_scores_gemma":[0.9960309,0.00029941826,0.0001511866,0.003294731,0.00012613558,0.00009759333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003629533,0.00017717826,0.00018302821,0.000114114104,0.000726724,0.00009878991,0.0030211331,0.00006058041,0.00002403493],"category_scores_gemma":[0.000021125188,0.00015011909,0.00010175805,0.0007062135,0.00036322974,0.0005876408,0.00045907355,0.0002096804,0.000069728034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021421843,0.00015775832,0.0031520964,0.00001215588,0.0001811726,0.000005450587,0.0011706643,0.010211625,0.6125661,0.12258719,0.016731681,0.23320267],"study_design_scores_gemma":[0.0027552445,0.000101446116,0.0024462002,0.0004438393,0.00009736264,0.00023868047,0.00007538169,0.69497484,0.010255451,0.0016048502,0.2853107,0.0016960283],"about_ca_topic_score_codex":0.000007664015,"about_ca_topic_score_gemma":0.000041410305,"teacher_disagreement_score":0.6847632,"about_ca_system_score_codex":0.00015680863,"about_ca_system_score_gemma":0.000070430855,"threshold_uncertainty_score":0.61216784},"labels":[],"label_agreement":null},{"id":"W2547895477","doi":"10.1109/lcomm.2016.2624727","title":"Enabling Energy Efficient Molecular Communication via Molecule Energy Transfer","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Molecular communication; Energy (signal processing); Energy transfer; Computer science; Molecule; Chemistry; Computer network; Chemical physics; Physics; Channel (broadcasting); Transmitter","score_opus":0.00962420260158211,"score_gpt":0.2011699689084712,"score_spread":0.19154576630688908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547895477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018843548,0.0063209767,0.96292806,0.0066789715,0.0001473619,0.00013185012,0.000010087906,0.0005866338,0.004352503],"genre_scores_gemma":[0.9877349,0.0049558003,0.004441581,0.0023906254,0.000025955776,0.00021221279,0.00007243072,0.00010117192,0.00006533778],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981153,0.00043766334,0.00052153284,0.00025056873,0.00025865957,0.00041626775],"domain_scores_gemma":[0.9943852,0.00027313828,0.000054301214,0.0050385557,0.00009809842,0.00015070748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024552396,0.00030095602,0.0002505742,0.0002593869,0.00030708147,0.000061003837,0.002354389,0.00014881219,0.00005309221],"category_scores_gemma":[0.000014476202,0.00027861292,0.00018425751,0.0005167462,0.00027235213,0.00012906721,0.00021641496,0.00024225451,0.000048969927],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007880317,0.000091313705,0.000008689483,0.000008247077,0.000114524686,0.0000033462397,0.00013915868,0.018526178,0.93444633,0.015643964,0.0023794074,0.028630927],"study_design_scores_gemma":[0.0017270991,0.00003383022,0.00004976922,0.0003035284,0.00011579195,0.000039235663,0.000041117546,0.20136815,0.52817744,0.0005188255,0.26629916,0.0013260718],"about_ca_topic_score_codex":0.000084546686,"about_ca_topic_score_gemma":0.00007949452,"teacher_disagreement_score":0.9688913,"about_ca_system_score_codex":0.00017497953,"about_ca_system_score_gemma":0.00002054395,"threshold_uncertainty_score":0.9999666},"labels":[],"label_agreement":null},{"id":"W2549737148","doi":"10.1109/lcomm.2016.2626278","title":"The Gaussian Diamond-Wiretap Channel With Rate-Limited Relay Cooperation","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Qatar National Research Fund","keywords":"Relay; Relay channel; Computer science; Computer network; Channel state information; Gaussian; Channel (broadcasting); Topology (electrical circuits); Transmission (telecommunications); Hop (telecommunications); Telecommunications; Wireless; Mathematics; Physics","score_opus":0.018198626645912916,"score_gpt":0.23114702632383127,"score_spread":0.21294839967791834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549737148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3345822,0.003499514,0.3260197,0.31720152,0.00063084194,0.0022843617,0.00008594137,0.006321457,0.009374443],"genre_scores_gemma":[0.9915603,0.0036459155,0.003259269,0.0008392243,0.000034714794,0.0004514262,0.000030990093,0.00006732803,0.000110831854],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987403,0.00032091155,0.0003437376,0.00015955724,0.00015001198,0.0002854694],"domain_scores_gemma":[0.99502164,0.00074595213,0.00008612319,0.0039571933,0.00011531874,0.00007375584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041430356,0.00020808243,0.00015704709,0.00011359846,0.0006473982,0.00012919534,0.001906247,0.000083477804,0.000008320543],"category_scores_gemma":[0.000049942857,0.00012790655,0.00005082129,0.0003943951,0.00045650674,0.00036769017,0.00013758634,0.0003266904,0.00009087901],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008874143,0.00023070717,0.0009757361,0.000054204313,0.0005556503,0.0000067323767,0.0047458606,0.006679633,0.7767346,0.027876455,0.13985242,0.042199243],"study_design_scores_gemma":[0.0034827434,0.00023875575,0.011968189,0.0011841247,0.00020252446,0.00007792054,0.00055420294,0.09540698,0.24794328,0.0009953856,0.6348705,0.0030753522],"about_ca_topic_score_codex":0.000023791054,"about_ca_topic_score_gemma":0.000315658,"teacher_disagreement_score":0.6569781,"about_ca_system_score_codex":0.00015380068,"about_ca_system_score_gemma":0.000021586979,"threshold_uncertainty_score":0.5215878},"labels":[],"label_agreement":null},{"id":"W2551643367","doi":"10.1109/lcomm.2016.2631173","title":"Robust TC-OLA Reception With Frequency Domain Equalization for Ultrawideband (UWB) Applications","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cyclic prefix; Computer science; Equalization (audio); Redundancy (engineering); Frequency domain; Algorithm; Signal processing; Overhead (engineering); Electronic engineering; Bit error rate; Orthogonal frequency-division multiplexing; Telecommunications; Digital signal processing; Computer hardware; Channel (broadcasting); Decoding methods; Engineering","score_opus":0.027264501730588635,"score_gpt":0.23100895021178858,"score_spread":0.20374444848119994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551643367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03181132,0.0004947473,0.94540966,0.01774238,0.00009447375,0.0012577893,0.0000876487,0.0012270709,0.0018749204],"genre_scores_gemma":[0.82319295,0.0013465978,0.17068158,0.00044970267,0.00005786175,0.0038802489,0.00023054126,0.00009602103,0.00006450147],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986417,0.000112907335,0.00046789018,0.0002794734,0.00014853713,0.00034948825],"domain_scores_gemma":[0.9953972,0.00063871534,0.0001312374,0.0035877284,0.00017058814,0.00007450239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026349223,0.00025154598,0.00023124747,0.0002947417,0.00045816886,0.000053896252,0.0016588172,0.00016480198,0.000026585876],"category_scores_gemma":[0.00005354652,0.00021008794,0.000079934456,0.00061948714,0.00038985777,0.00036848316,0.00005402432,0.0002241405,0.00007664985],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001901818,0.00018287475,0.0034435273,0.00006788701,0.00020376814,3.386049e-7,0.00052655843,0.0019556154,0.89285654,0.061625205,0.011419143,0.027699506],"study_design_scores_gemma":[0.01003345,0.0005272106,0.0073725004,0.0010886604,0.0006505708,0.00019257108,0.0011074486,0.0049308906,0.083769105,0.056281224,0.8290117,0.0050346646],"about_ca_topic_score_codex":0.000020111409,"about_ca_topic_score_gemma":0.00029251102,"teacher_disagreement_score":0.81759256,"about_ca_system_score_codex":0.0002835409,"about_ca_system_score_gemma":0.00003171884,"threshold_uncertainty_score":0.8567138},"labels":[],"label_agreement":null},{"id":"W2556413940","doi":"10.1109/lcomm.2016.2632731","title":"Sparse Random Linear Network Coding With Precoded Band Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Code (set theory); Lossy compression; Linear network coding; Overhead (engineering); Algorithm; Linear code; Concatenated error correction code; Sparse matrix; Coding (social sciences); Theoretical computer science; Block code; Computer network; Mathematics; Artificial intelligence","score_opus":0.0501694703091445,"score_gpt":0.2759008394902195,"score_spread":0.22573136918107498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556413940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012173491,0.0007101433,0.933927,0.049744513,0.00021580987,0.00038363895,0.0000041512526,0.0003646669,0.0024765641],"genre_scores_gemma":[0.8986423,0.0031882531,0.094336234,0.0033103817,0.0001163624,0.00012329125,0.000007349018,0.000022983057,0.00025285836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808234,0.00061743014,0.0003645416,0.00033913442,0.00021212928,0.000384403],"domain_scores_gemma":[0.9941041,0.001214427,0.00018801136,0.004200961,0.00017203223,0.00012050711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665536,0.00021550972,0.00026608683,0.00010315748,0.0007973822,0.00016303026,0.0037663507,0.000050411098,0.000026591832],"category_scores_gemma":[0.000060684833,0.00014899424,0.00007590018,0.00063547754,0.00033066465,0.00061628455,0.0005295746,0.00024715567,0.00009898139],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045583016,0.0008145674,0.01713613,0.000050591676,0.0009119,0.00002953407,0.0061865337,0.01233967,0.2936568,0.17722884,0.17204082,0.3191488],"study_design_scores_gemma":[0.020836858,0.00046619982,0.009490399,0.0029671078,0.00020722054,0.00020409781,0.000113542264,0.24852206,0.036081802,0.0020371578,0.6750801,0.003993429],"about_ca_topic_score_codex":0.0000064900632,"about_ca_topic_score_gemma":0.0001663325,"teacher_disagreement_score":0.88646877,"about_ca_system_score_codex":0.00008722998,"about_ca_system_score_gemma":0.00006407201,"threshold_uncertainty_score":0.69988793},"labels":[],"label_agreement":null},{"id":"W2557270251","doi":"10.1109/lcomm.2016.2634532","title":"Resource Savings in Submarine Networks Using Agility of Filterless Architectures","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada); École de Technologie Supérieure","funders":"","keywords":"Control reconfiguration; Computer science; Subsea; Submarine; Computer network; Transceiver; Resource allocation; Resource management (computing); Distributed computing; Telecommunications; Engineering; Wireless; Embedded system","score_opus":0.022262330718137584,"score_gpt":0.24832001361396683,"score_spread":0.22605768289582925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557270251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8477734,0.00036174248,0.14957388,0.0015989257,0.00004632934,0.00012359102,0.0000049440937,0.00028659662,0.00023063963],"genre_scores_gemma":[0.9566104,0.00010873843,0.043096025,0.00011984563,0.000016926326,0.000017366543,0.0000023623863,0.000023756153,0.0000046172977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921775,0.000058161986,0.0002985166,0.00010621811,0.000074864234,0.00024449988],"domain_scores_gemma":[0.9978809,0.0004970831,0.000048177328,0.0015298277,0.000016882102,0.000027170181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001355787,0.00012226947,0.00018275694,0.00012873385,0.000043581695,0.0000068212676,0.0008981227,0.00007495556,0.0000049050996],"category_scores_gemma":[0.000068634225,0.00010260593,0.00004294837,0.00031911573,0.00041379425,0.000056691897,0.00022172875,0.00028316458,0.000001482994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013339922,0.000036286074,0.010037693,0.000028522385,0.000027729613,0.0000019869763,0.00013018942,0.81018955,0.11424405,0.00044482102,0.00044335864,0.06440246],"study_design_scores_gemma":[0.0024231174,0.00007450409,0.0797156,0.0017850705,0.00007779566,0.00003785826,0.00028856244,0.8626049,0.030305656,0.005618512,0.015178587,0.0018898139],"about_ca_topic_score_codex":0.00002297161,"about_ca_topic_score_gemma":0.00011796216,"teacher_disagreement_score":0.108837,"about_ca_system_score_codex":0.00010815069,"about_ca_system_score_gemma":0.0000035048668,"threshold_uncertainty_score":0.41841483},"labels":[],"label_agreement":null},{"id":"W2557427393","doi":"10.1109/lcomm.2016.2634014","title":"Analytical Framework for Space Shift Keying MIMO Systems With Hardware Impairments and Co-Channel Interference","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Transmitter; Expression (computer science); Interference (communication); Rayleigh fading; Channel (broadcasting); Keying; Upper and lower bounds; Topology (electrical circuits); Computer science; Mathematics; Transmitter power output; Fading; Telecommunications; Control theory (sociology); Combinatorics; Mathematical analysis","score_opus":0.03441091590442055,"score_gpt":0.28765839658657216,"score_spread":0.25324748068215164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557427393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047072034,0.0007774193,0.9410854,0.009651888,0.0000838174,0.0004320842,0.000052483458,0.00074343226,0.0001014235],"genre_scores_gemma":[0.94999266,0.00068597327,0.04871804,0.00011685537,0.000016031256,0.000395447,0.000010741923,0.000046535173,0.000017748187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912155,0.000052013485,0.00025484833,0.00019684619,0.00009930434,0.00027544942],"domain_scores_gemma":[0.9965984,0.00088786904,0.00008074488,0.0023156118,0.0000518409,0.0000655357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012041536,0.00019734123,0.0002271601,0.00014986763,0.0001886475,0.00006885117,0.0011893776,0.000105543564,0.0000021333642],"category_scores_gemma":[0.000093559676,0.00015346479,0.000036930745,0.0001777018,0.00039967193,0.0002471406,0.00017665129,0.00027574503,0.000012528975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007145433,0.0011299589,0.046009403,0.0031909558,0.0043911263,0.000041966265,0.020225352,0.27686498,0.1322194,0.345799,0.04778551,0.12162781],"study_design_scores_gemma":[0.011172417,0.0013391315,0.014851405,0.017667843,0.0005771253,0.0002745414,0.011820162,0.7712877,0.0542534,0.037444368,0.07088195,0.008429998],"about_ca_topic_score_codex":0.000008774596,"about_ca_topic_score_gemma":0.000011340011,"teacher_disagreement_score":0.9029206,"about_ca_system_score_codex":0.00013283355,"about_ca_system_score_gemma":0.0000098564005,"threshold_uncertainty_score":0.6258112},"labels":[],"label_agreement":null},{"id":"W2558955488","doi":"10.1109/lcomm.2016.2635146","title":"Virtual Small Cells Formation in 5G Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Macrocell; Base station; Computer science; Computer network; Small cell; Virtual network; Cellular network; Mobile telephony; Mobile radio","score_opus":0.017535267710654792,"score_gpt":0.21547034363625614,"score_spread":0.19793507592560133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558955488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027373632,0.00013296255,0.97004,0.0010531791,0.00030129563,0.00021161242,0.000004812651,0.00024013466,0.00064237573],"genre_scores_gemma":[0.9899389,0.00044026406,0.009198743,0.0002110087,0.000041882857,0.00008448976,0.000015050372,0.000029544974,0.00004010643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993431,0.00006670579,0.0002844427,0.0000829196,0.000045715722,0.00017710903],"domain_scores_gemma":[0.9988103,0.00015481394,0.00004790996,0.0009317783,0.000023137687,0.0000320823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010592392,0.00010241449,0.00010139193,0.00012881153,0.000055320026,0.000017419985,0.00044632,0.00005737249,0.0000054250468],"category_scores_gemma":[0.000010830312,0.0000936392,0.000027060094,0.000208375,0.00004608626,0.00036546594,0.000030456025,0.000119683296,0.00006704855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017972169,0.000010392566,0.000050033592,0.000006161932,0.000006088497,5.855713e-7,0.00023567557,0.8340398,0.15324554,0.00018397081,0.0016699117,0.010550058],"study_design_scores_gemma":[0.0012081289,0.000020616837,0.00036096398,0.00033840715,0.000013732959,0.000011791503,0.0001459878,0.9526358,0.035644498,0.00006150379,0.008994295,0.00056423765],"about_ca_topic_score_codex":0.000011855005,"about_ca_topic_score_gemma":0.0001689356,"teacher_disagreement_score":0.9625653,"about_ca_system_score_codex":0.00019448265,"about_ca_system_score_gemma":0.0000030490478,"threshold_uncertainty_score":0.3818496},"labels":[],"label_agreement":null},{"id":"W2567721228","doi":"10.1109/lcomm.2016.2638823","title":"A New Turbo Equalizer Conditioned on Estimated Channel for MIMO MMSE Receiver","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Turbo equalizer; Minimum mean square error; Turbo; Equalization (audio); Computer science; Channel (broadcasting); Turbo code; Bit error rate; MIMO; Autocorrelation; Algorithm; A priori and a posteriori; Adaptive equalizer; Covariance matrix; Control theory (sociology); Mathematics; Decoding methods; Statistics; Telecommunications; Block code; Concatenated error correction code; Artificial intelligence; Engineering","score_opus":0.06104215242847155,"score_gpt":0.31421034807702525,"score_spread":0.2531681956485537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567721228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010545468,0.0003282803,0.96004385,0.024472954,0.0002322275,0.0008656499,0.00014164035,0.002265011,0.0011049054],"genre_scores_gemma":[0.8822598,0.0009104488,0.11413703,0.0014646203,0.000052871954,0.0006882536,0.000114221584,0.00009516838,0.0002776042],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990106,0.00008562404,0.00034009584,0.0001810168,0.000118247066,0.0002643972],"domain_scores_gemma":[0.9961311,0.00081078283,0.00009259257,0.0027823567,0.00008440103,0.00009875432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013315509,0.00021292476,0.00020317893,0.00019500787,0.00021156331,0.00002994391,0.0013146761,0.000094547664,0.000043410844],"category_scores_gemma":[0.000086159445,0.00019048744,0.00009068896,0.00021970083,0.0001379428,0.00027572952,0.00008366014,0.00018036031,0.000110265064],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061173196,0.00011606662,0.000029121164,0.00004908284,0.00017531498,0.0000010311043,0.00065260206,0.006890237,0.65629995,0.009241198,0.26071936,0.06576489],"study_design_scores_gemma":[0.0052612936,0.00021663115,0.0011993402,0.0015281558,0.00012692098,0.000017777871,0.000096192794,0.033918038,0.73044276,0.021645354,0.2033075,0.002240058],"about_ca_topic_score_codex":0.000014375042,"about_ca_topic_score_gemma":0.000011018126,"teacher_disagreement_score":0.8717143,"about_ca_system_score_codex":0.0001994613,"about_ca_system_score_gemma":0.000018516608,"threshold_uncertainty_score":0.7767852},"labels":[],"label_agreement":null},{"id":"W2569916663","doi":"10.1109/lcomm.2017.2653121","title":"On the Optimal Set of Channels to Sense in Cognitive Radio Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Notation; Set (abstract data type); Selection (genetic algorithm); Mathematics; Channel (broadcasting); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Arithmetic; Programming language; Telecommunications","score_opus":0.054193840751055024,"score_gpt":0.3031889859053778,"score_spread":0.24899514515432278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569916663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54207313,0.000059854643,0.35026655,0.105436854,0.00034210793,0.00041460662,0.000005998238,0.000036035173,0.0013648636],"genre_scores_gemma":[0.9925838,0.0000404657,0.003141045,0.004108742,0.000074852236,0.000022863502,0.0000027549765,0.000009681086,0.000015761307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988857,0.00025566237,0.0002215525,0.00023070541,0.00014500513,0.0002613969],"domain_scores_gemma":[0.99582523,0.0012251239,0.00016758581,0.0026515706,0.00007269398,0.000057767473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051234296,0.00012769488,0.00017711392,0.00011548189,0.00058082567,0.0002283504,0.0020096085,0.000038305963,0.0000032622825],"category_scores_gemma":[0.00013685992,0.0001075709,0.0000683701,0.00023716262,0.00026268454,0.00019271774,0.00048476248,0.00033866082,0.000008736964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032529442,0.00073883956,0.0027738004,0.000021929753,0.0005292513,0.00029395518,0.030046651,0.35301027,0.010766164,0.39658698,0.047144905,0.15776196],"study_design_scores_gemma":[0.00080569164,0.00013159448,0.013148769,0.00040989454,0.00002060664,0.000038635408,0.00020710919,0.98103726,0.0018732554,0.0007996717,0.0010769014,0.00045060815],"about_ca_topic_score_codex":0.0000735791,"about_ca_topic_score_gemma":0.00010941084,"teacher_disagreement_score":0.62802696,"about_ca_system_score_codex":0.000045221055,"about_ca_system_score_gemma":0.000020096422,"threshold_uncertainty_score":0.44673005},"labels":[],"label_agreement":null},{"id":"W2577665255","doi":"10.1109/lcomm.2017.2655052","title":"Antenna Selection in MIMO Cognitive AF Relay Networks With Mutual Interference and Limited Feedback","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Lakehead University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Semiconductor Research Corporation","keywords":"Cognitive radio; Computer science; Rayleigh fading; Relay; MIMO; Interference (communication); Diversity gain; Antenna (radio); Selection (genetic algorithm); Mutual information; Transmitter; Fading; Electronic engineering; Telecommunications; Topology (electrical circuits); Control theory (sociology); Power (physics); Mathematics; Wireless; Channel (broadcasting); Engineering; Machine learning; Artificial intelligence","score_opus":0.026122959389862286,"score_gpt":0.24840306905221227,"score_spread":0.22228010966234998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577665255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9758385,0.00050879706,0.01878604,0.0035620003,0.00008189106,0.00032290135,0.000010833451,0.00022411467,0.0006649679],"genre_scores_gemma":[0.993554,0.0013074568,0.004592519,0.00025097962,0.000026743324,0.00015475105,0.000036907364,0.000046458048,0.000030174346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990409,0.00013385728,0.00027303788,0.00019845355,0.000085445725,0.00026831822],"domain_scores_gemma":[0.9975534,0.00039850356,0.00011421676,0.0017758295,0.00008869907,0.000069317975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015945261,0.00020267814,0.00020373473,0.00017707673,0.00056768,0.00019544698,0.0012971691,0.00009686142,0.0000059894514],"category_scores_gemma":[0.00007838091,0.00021522623,0.000029213332,0.00024068839,0.00054047356,0.00043692623,0.0002557735,0.000761663,0.000019767176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004091367,0.0007393505,0.19488123,0.00018638575,0.00092530216,0.000027548296,0.013055389,0.6039558,0.14427315,0.0012314611,0.005609327,0.03470594],"study_design_scores_gemma":[0.00084844267,0.00004186719,0.1189895,0.00044898296,0.000037644113,0.000027788348,0.0003079801,0.8782903,0.00034055064,0.0000027436415,0.00031874966,0.00034547178],"about_ca_topic_score_codex":0.00019135817,"about_ca_topic_score_gemma":0.003398679,"teacher_disagreement_score":0.2743345,"about_ca_system_score_codex":0.00010472911,"about_ca_system_score_gemma":0.000016125785,"threshold_uncertainty_score":0.87766707},"labels":[],"label_agreement":null},{"id":"W2588162691","doi":"10.1109/lcomm.2017.2669319","title":"On-Line Fountain Codes With Unequal Error Protection","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Beijing Council of Science and Technology","keywords":"Fountain code; Computer science; Overhead (engineering); Algorithm; Encoding (memory); Line (geometry); Luby transform code; Scheme (mathematics); Decoding methods; Fountain; Property (philosophy); Theoretical computer science; Block code; Error floor; Mathematics; Artificial intelligence","score_opus":0.10624791661529759,"score_gpt":0.34462253197676407,"score_spread":0.23837461536146648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588162691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08062665,0.00001334958,0.86631316,0.050013978,0.0002337468,0.00045509342,0.0000025432196,0.0007744035,0.0015670967],"genre_scores_gemma":[0.87662274,0.000007254066,0.12149018,0.0015535171,0.000033401207,0.00020654008,0.000002732447,0.000017647533,0.000065985616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988472,0.00018303233,0.0001967196,0.00031045152,0.00023673716,0.00022585674],"domain_scores_gemma":[0.9926512,0.00018533561,0.00029884768,0.00670551,0.00010577477,0.00005328955],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045025756,0.00016262957,0.00014775738,0.00014191626,0.0013670826,0.00039247985,0.005010407,0.000053008964,0.0000018156239],"category_scores_gemma":[0.00014573433,0.00014636722,0.000047771802,0.0001576617,0.00029184195,0.0005856143,0.0004722284,0.00042488732,0.000049833874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003710806,0.0024720766,0.007335494,0.00015872472,0.00050218374,0.000117286865,0.010950083,0.018238975,0.24239208,0.3493957,0.03967809,0.3283882],"study_design_scores_gemma":[0.0030202465,0.0026025637,0.011296025,0.0012961841,0.000096778575,0.00020165741,0.00022387263,0.8269025,0.11160861,0.016690848,0.023112021,0.0029487102],"about_ca_topic_score_codex":0.0004608539,"about_ca_topic_score_gemma":0.0005606969,"teacher_disagreement_score":0.8086635,"about_ca_system_score_codex":0.00011699589,"about_ca_system_score_gemma":0.00004586588,"threshold_uncertainty_score":0.999933},"labels":[],"label_agreement":null},{"id":"W2603904802","doi":"10.1109/lcomm.2017.2688451","title":"Exploiting the Fast Spectral Roll-Off of CPM Sidelobes to Improve Bandwidth Efficiency in Satellite Communications","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ultra Electronics (Canada)","funders":"ASELSAN","keywords":"Computer science; Continuous phase modulation; Spectral efficiency; Demodulation; Detector; Bandwidth (computing); Multiplexing; Electronic engineering; Bit error rate; Minimum mean square error; Adjacent-channel interference; Communications satellite; Single antenna interference cancellation; Interference (communication); Decoding methods; Channel (broadcasting); Algorithm; Telecommunications; Satellite; Physics; Engineering; Mathematics","score_opus":0.028309379044767664,"score_gpt":0.29292479430272395,"score_spread":0.2646154152579563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603904802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7574554,0.013608032,0.090415046,0.09083729,0.0006628974,0.0040296437,0.0001907382,0.0019463339,0.04085462],"genre_scores_gemma":[0.9507758,0.00691667,0.041403275,0.00040794516,0.000026254565,0.00037527308,0.00001989388,0.000054900822,0.00001999573],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983376,0.00020518257,0.0007071544,0.00020166155,0.0001914638,0.000356916],"domain_scores_gemma":[0.98635536,0.0006316966,0.00026939475,0.0125694405,0.000100922465,0.00007315531],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00055224047,0.00023832731,0.00031092006,0.00023808157,0.00084434415,0.00013011153,0.008495052,0.00007468322,0.0000045625034],"category_scores_gemma":[0.00019284795,0.0002295346,0.00010697206,0.00033884466,0.00071346044,0.00043224014,0.0011001952,0.0006661046,0.000024623589],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024617408,0.0004243201,0.008337835,0.00010473326,0.00013359958,0.0000022629597,0.010941338,0.02573647,0.68637747,0.013656493,0.0011542913,0.25310656],"study_design_scores_gemma":[0.0034323607,0.00027089284,0.11521315,0.0023042876,0.00020271167,0.000035352685,0.0069716447,0.2501679,0.458644,0.0062320535,0.15247752,0.004048131],"about_ca_topic_score_codex":0.0002108641,"about_ca_topic_score_gemma":0.00085866475,"teacher_disagreement_score":0.24905844,"about_ca_system_score_codex":0.00017751666,"about_ca_system_score_gemma":0.000025914607,"threshold_uncertainty_score":0.99686944},"labels":[],"label_agreement":null},{"id":"W2604412474","doi":"10.1109/lcomm.2017.2691344","title":"Energy Efficient Coverage Extension Relay Node Placement in LTE-A Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Relay; LTE Advanced; Node (physics); Extension (predicate logic); Energy (signal processing); Telecommunications link; Telecommunications; Engineering; Mathematics; Power (physics)","score_opus":0.045010590172655025,"score_gpt":0.29215756610505045,"score_spread":0.24714697593239543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604412474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028495172,0.0012649873,0.92646676,0.038316343,0.0005883491,0.00022682265,0.0000014974663,0.00014211664,0.0044979407],"genre_scores_gemma":[0.975902,0.0037624422,0.014584951,0.005456229,0.000041687876,0.00008670934,0.0000126112645,0.000015910487,0.00013745285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981957,0.0004456028,0.0004105984,0.00038179316,0.00022135851,0.00034491948],"domain_scores_gemma":[0.99032015,0.00031367387,0.00027880343,0.0088937655,0.00010079734,0.000092822556],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00066194264,0.00019429311,0.00021352747,0.000171903,0.0015112624,0.0004740646,0.0063836486,0.00006863332,0.000011189563],"category_scores_gemma":[0.00006531098,0.00020245605,0.00008023043,0.00027824758,0.00022152528,0.0003623406,0.002256002,0.00041856544,0.000030316996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025147963,0.00060316996,0.0023089757,0.000006809136,0.00004890866,0.00002259164,0.001448244,0.8331073,0.012873119,0.049063012,0.019611292,0.08088146],"study_design_scores_gemma":[0.00061125157,0.0000149073385,0.007267872,0.00010849638,0.000004863178,0.0000057046827,0.000010477601,0.9633687,0.00025325158,0.000033405217,0.028045412,0.00027562684],"about_ca_topic_score_codex":0.00008584189,"about_ca_topic_score_gemma":0.00034495277,"teacher_disagreement_score":0.9474068,"about_ca_system_score_codex":0.00019208885,"about_ca_system_score_gemma":0.000042215277,"threshold_uncertainty_score":0.99978864},"labels":[],"label_agreement":null},{"id":"W2610823049","doi":"10.1109/lcomm.2017.2700864","title":"On the Cell Search and Initial Synchronization for NB-IoT LTE Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Synchronization (alternating current); Internet of Things; Narrowband; Bandwidth (computing); Signal-to-noise ratio (imaging); Lock (firearm); Real-time computing; Computer network; Telecommunications; Embedded system","score_opus":0.0499179202888724,"score_gpt":0.3128990778313673,"score_spread":0.26298115754249485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610823049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11052193,0.0010483536,0.8684758,0.0129621625,0.00028500386,0.0014933674,0.00007141059,0.0006492527,0.0044927355],"genre_scores_gemma":[0.99036723,0.0006487537,0.008123636,0.00028369602,0.00004236303,0.00044261402,0.000025748775,0.000041910538,0.00002405637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993643,0.00010128492,0.00018744411,0.000107053675,0.00008556405,0.000154311],"domain_scores_gemma":[0.99556845,0.00063481164,0.00006788621,0.003626696,0.00006875937,0.00003339555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026803528,0.0001174582,0.000111994996,0.000068273745,0.001083209,0.00020873228,0.0017541639,0.000053483913,0.000002120976],"category_scores_gemma":[0.000067074565,0.000106529784,0.000031154475,0.000051070263,0.0002818889,0.0001483689,0.00018530338,0.0002677636,0.000009991964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056533823,0.00032599206,0.00068260654,0.0008090037,0.00029615953,0.0000016506356,0.003944156,0.25041458,0.2888945,0.32408392,0.04814371,0.08234716],"study_design_scores_gemma":[0.0007512994,0.000059319274,0.0003207052,0.00025873727,0.0000359365,0.0000039943875,0.0001937117,0.9222705,0.05070666,0.0016619848,0.023200393,0.0005367621],"about_ca_topic_score_codex":0.000039575767,"about_ca_topic_score_gemma":0.000013584469,"teacher_disagreement_score":0.8798453,"about_ca_system_score_codex":0.00008155335,"about_ca_system_score_gemma":0.00001009555,"threshold_uncertainty_score":0.83312774},"labels":[],"label_agreement":null},{"id":"W2611384886","doi":"10.1109/lcomm.2017.2748940","title":"Blind Detection With Polar Codes","year":2017,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Decodes; False alarm; Real-time computing; Constraint (computer-aided design); Latency (audio); Identifier; Error detection and correction; Algorithm; Wireless; Set (abstract data type); Computer network; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.0600659378126206,"score_gpt":0.3191707891389228,"score_spread":0.2591048513263022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611384886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033868104,0.00035723232,0.94477504,0.015999695,0.00086913345,0.0006340227,0.000012784482,0.0016515763,0.001832394],"genre_scores_gemma":[0.7608598,0.00015796267,0.2377844,0.0007890946,0.00007148244,0.00023471956,0.000017999297,0.000034121535,0.000050432613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998091,0.00033278522,0.00032619195,0.00061678217,0.00033178463,0.00030146557],"domain_scores_gemma":[0.98539907,0.00023519683,0.00064960594,0.013418144,0.00021652528,0.00008146336],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005828598,0.0003359811,0.00032501764,0.00034541773,0.00092311465,0.0008200197,0.011217547,0.0002306523,0.0000012266446],"category_scores_gemma":[0.000086939704,0.00033585413,0.0001277769,0.00018690512,0.00036131265,0.00044623253,0.0033479324,0.0016087511,0.000035785295],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025303676,0.001816138,0.012330274,0.0009072223,0.0020792924,0.00018187781,0.02136316,0.0071533476,0.41172847,0.010702051,0.048563365,0.48292175],"study_design_scores_gemma":[0.0046188273,0.0010116762,0.019738793,0.0072915335,0.0009734478,0.0010286451,0.00027530603,0.41508847,0.366746,0.03168364,0.13964334,0.011900295],"about_ca_topic_score_codex":0.0009876951,"about_ca_topic_score_gemma":0.0013192132,"teacher_disagreement_score":0.72699165,"about_ca_system_score_codex":0.00022438675,"about_ca_system_score_gemma":0.0001526563,"threshold_uncertainty_score":0.99990934},"labels":[],"label_agreement":null},{"id":"W2619905542","doi":"10.1109/lcomm.2017.2707553","title":"Lower Bounds on the Size of Smallest Elementary and Non-Elementary Trapping Sets in Variable-Regular LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Low-density parity-check code; Elementary proof; Mathematics; Elementary function; Computer science; Decoding methods; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.03360030439567426,"score_gpt":0.29009017800646447,"score_spread":0.25648987361079023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619905542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9123604,0.00008671807,0.027770942,0.057139367,0.0002270611,0.0005208566,0.000013025362,0.00010883186,0.0017727948],"genre_scores_gemma":[0.91007304,0.00008581332,0.0858577,0.0038746966,0.000013139388,0.00006979383,0.000004594221,0.000011172311,0.000010045075],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9987749,0.00019788755,0.00034525408,0.00026188372,0.00019331735,0.0002267502],"domain_scores_gemma":[0.99442244,0.000774804,0.0002848461,0.004438651,0.000043781158,0.000035491626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095832,0.00015420529,0.00018912725,0.00011031342,0.00070710585,0.00019179669,0.0043111253,0.000042546617,0.000008243133],"category_scores_gemma":[0.0000835687,0.00013798109,0.000047791982,0.0001622645,0.00037300333,0.00031148666,0.00088347093,0.00033511015,0.0000019628028],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011757322,0.0018403422,0.1736405,0.00021564956,0.00061144837,0.000055985143,0.01734339,0.0008375844,0.63020396,0.04617887,0.08863592,0.040318754],"study_design_scores_gemma":[0.0070298286,0.0015379693,0.57317305,0.0050573098,0.00029834974,0.00012572645,0.0031894809,0.19703972,0.14059992,0.026556425,0.040856898,0.0045353128],"about_ca_topic_score_codex":0.00096163095,"about_ca_topic_score_gemma":0.00079146953,"teacher_disagreement_score":0.48960406,"about_ca_system_score_codex":0.00007700639,"about_ca_system_score_gemma":0.00003824858,"threshold_uncertainty_score":0.80112153},"labels":[],"label_agreement":null},{"id":"W2728954613","doi":"10.1109/lcomm.2017.2720583","title":"Closed-Form BER Expressions of QPSK Constellation for Uplink Non-Orthogonal Multiple Access","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Noma; Telecommunications link; Bit error rate; Phase-shift keying; Computer science; Constellation; Additive white Gaussian noise; Expression (computer science); Channel capacity; Channel (broadcasting); Closed-form expression; Algorithm; Mathematics; Telecommunications; Physics","score_opus":0.06396600704195661,"score_gpt":0.33341744104825216,"score_spread":0.26945143400629556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728954613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35886002,0.00044610808,0.62593484,0.008384938,0.00042002584,0.001236056,0.00016583869,0.0007956184,0.0037565508],"genre_scores_gemma":[0.9323052,0.0006672578,0.06654592,0.00009268055,0.000021840478,0.0002185284,0.00008883005,0.000042209685,0.000017534141],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990398,0.000022930732,0.00044474346,0.00015836026,0.00011262526,0.00022148946],"domain_scores_gemma":[0.9935074,0.0006417371,0.00031001898,0.0053757434,0.00012128048,0.000043832864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014672562,0.00017757097,0.00024730817,0.00016209275,0.00092034077,0.000089841735,0.0038902268,0.00012761961,0.000010191713],"category_scores_gemma":[0.00015726466,0.00019332509,0.00011297617,0.00010658375,0.00059112784,0.0006389748,0.00060317694,0.00030695912,0.000008941993],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041693573,0.00021766683,0.022091793,0.00025996516,0.00026743865,6.337071e-7,0.0007753986,0.14375497,0.69211125,0.0059783673,0.011424109,0.12307668],"study_design_scores_gemma":[0.0028260415,0.00004286062,0.03989569,0.00049806637,0.00008741784,0.0000049904106,0.00026709144,0.5306088,0.37347266,0.005109089,0.0460345,0.0011528354],"about_ca_topic_score_codex":0.00001452741,"about_ca_topic_score_gemma":0.00003555755,"teacher_disagreement_score":0.5734452,"about_ca_system_score_codex":0.000064167136,"about_ca_system_score_gemma":0.000019263101,"threshold_uncertainty_score":0.78835684},"labels":[],"label_agreement":null},{"id":"W2746588124","doi":"10.1109/lcomm.2017.2743175","title":"Generalized Relay Selection for Network-Coded Cooperation Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Selection (genetic algorithm); Relay; Computer network; Linear network coding; Decoding methods; Theoretical computer science; Telecommunications; Artificial intelligence","score_opus":0.08290666875693752,"score_gpt":0.32381838451125644,"score_spread":0.2409117157543189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746588124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067598587,0.00094412325,0.96362996,0.02565163,0.0010096176,0.0007882102,0.000004609537,0.00028000426,0.0009319762],"genre_scores_gemma":[0.8500701,0.0013308692,0.1452429,0.0019233081,0.00030396922,0.0006193152,0.000051278756,0.000024789859,0.0004334518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998397,0.00042263154,0.00040715685,0.0003284832,0.00012839597,0.00031632933],"domain_scores_gemma":[0.9936998,0.00027007444,0.0003747778,0.0052071894,0.0003673639,0.00008081306],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008420444,0.00018066537,0.00022211345,0.00008539356,0.0041526463,0.0012921112,0.005011109,0.000078050856,0.0000038456087],"category_scores_gemma":[0.00013193306,0.00018958571,0.00009888597,0.0002219562,0.0001560733,0.0009562676,0.0005926064,0.0002506725,0.00002784196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016872009,0.00010579121,0.0011621264,0.000017159684,0.00011254828,2.63992e-7,0.00056287827,0.0547109,0.052067153,0.7974396,0.07237887,0.021425854],"study_design_scores_gemma":[0.00067900773,0.000027567756,0.000365098,0.000049810962,0.000016059415,0.000005209077,0.0000040527407,0.86718595,0.00057637814,0.00018134537,0.13064364,0.0002658659],"about_ca_topic_score_codex":0.000059593825,"about_ca_topic_score_gemma":0.00022051316,"teacher_disagreement_score":0.84331024,"about_ca_system_score_codex":0.00012535519,"about_ca_system_score_gemma":0.00006572921,"threshold_uncertainty_score":0.99974465},"labels":[],"label_agreement":null},{"id":"W2750302792","doi":"10.1109/lcomm.2017.2741458","title":"On the Secrecy Performance Analysis of SIMO Systems Over $\\kappa$ – $\\mu$ Fading Channels","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fading; Secrecy; Notation; Computer science; Noise (video); Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Arithmetic; Artificial intelligence","score_opus":0.043293201592725795,"score_gpt":0.281125965585593,"score_spread":0.2378327639928672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750302792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98388517,0.00032546808,0.006833614,0.0031905656,0.00020842953,0.00033590678,0.000031674484,0.00032585408,0.004863332],"genre_scores_gemma":[0.9980291,0.0009966753,0.00043251438,0.00027450465,0.00002417701,0.00016610301,0.000025845162,0.000031821255,0.000019271389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.00015872618,0.00038156143,0.00012803862,0.00021499845,0.0001923653],"domain_scores_gemma":[0.99144363,0.0005795636,0.00024919622,0.0076139937,0.000074612035,0.000039027964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052494695,0.00016863875,0.00030459155,0.00033112097,0.000701265,0.00017538719,0.004033825,0.000074004936,0.00001675091],"category_scores_gemma":[0.00006514929,0.00014947206,0.00014677316,0.00038387554,0.00029459206,0.00027207087,0.00028584828,0.00040469295,0.00001723616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019426132,0.00025653106,0.01206704,0.00027739964,0.004341488,0.0000015302155,0.007001256,0.7351155,0.13686676,0.07589726,0.023006033,0.0051497505],"study_design_scores_gemma":[0.00015703966,0.000015942678,0.013067723,0.00023121123,0.0002718661,0.0000010751388,0.000102816186,0.97044665,0.00866675,0.00008554406,0.0066136043,0.0003397613],"about_ca_topic_score_codex":0.00016619622,"about_ca_topic_score_gemma":0.000038776274,"teacher_disagreement_score":0.23533115,"about_ca_system_score_codex":0.000099885176,"about_ca_system_score_gemma":0.000008440097,"threshold_uncertainty_score":0.7495917},"labels":[],"label_agreement":null},{"id":"W2750544224","doi":"10.1109/lcomm.2017.2740305","title":"Fast Successive-Cancellation Decoding of Polar Codes: Identification and Decoding of New Nodes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Computer science; Sequential decoding; Berlekamp–Welch algorithm; Algorithm; Polar; Latency (audio); Arithmetic; Concatenated error correction code; Telecommunications; Block code; Mathematics","score_opus":0.054219544283517496,"score_gpt":0.3318252000715529,"score_spread":0.2776056557880354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750544224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29850778,0.00023133923,0.695285,0.0051419167,0.00017021933,0.00015876675,0.0000044275203,0.00010426523,0.00039623037],"genre_scores_gemma":[0.85146534,0.0001832185,0.14820006,0.00008328118,0.000017177366,0.000008769618,0.0000036231545,0.000009237982,0.000029302713],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890876,0.000108619395,0.0004378594,0.0002320523,0.00017482277,0.00013788496],"domain_scores_gemma":[0.995321,0.00034146267,0.00094336685,0.0031927917,0.00015320943,0.000048219674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144752,0.00011292554,0.00019496465,0.00019331793,0.0005365907,0.00020123519,0.00299754,0.00005119974,0.0000014277326],"category_scores_gemma":[0.00026912926,0.00012892362,0.000052176096,0.00015983703,0.0002617481,0.00091276754,0.0005148686,0.00015116364,0.0000021024389],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005979035,0.00005711585,0.056617208,0.00006736277,0.000039158505,5.3355257e-7,0.004086836,0.00018799935,0.8462846,0.008321307,0.0010461615,0.08328568],"study_design_scores_gemma":[0.0007661801,0.00006150219,0.1149456,0.00086852297,0.000076288416,0.000017925771,0.00032913094,0.2474891,0.6301877,0.0038888003,0.00067012117,0.00069917785],"about_ca_topic_score_codex":0.00081508927,"about_ca_topic_score_gemma":0.00027020284,"teacher_disagreement_score":0.55295753,"about_ca_system_score_codex":0.000052332616,"about_ca_system_score_gemma":0.00005110519,"threshold_uncertainty_score":0.5570225},"labels":[],"label_agreement":null},{"id":"W2759905166","doi":"10.1109/lcomm.2017.2752714","title":"User Association and Scheduling With Hard Deadlines in Heterogeneous Cellular Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Approximation algorithm; Benchmark (surveying); Mathematical optimization; Heuristic; Computational complexity theory; Distributed computing; Algorithm; Mathematics; Artificial intelligence","score_opus":0.014403599111896157,"score_gpt":0.22731443454175787,"score_spread":0.21291083542986172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759905166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6575858,0.0007031071,0.33973143,0.0014586712,0.00013358094,0.00016870961,0.0000018866191,0.00013323184,0.00008356479],"genre_scores_gemma":[0.95151365,0.0010147418,0.047127385,0.00016239674,0.00006328703,0.000044746444,0.000020478388,0.000037468566,0.00001582638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993894,0.000041969175,0.00017271281,0.0001220128,0.0000796941,0.00019420391],"domain_scores_gemma":[0.9986086,0.000099941,0.000110872716,0.0011105487,0.000035176778,0.000034898996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001228956,0.00012009047,0.00013692044,0.00006223448,0.00030007566,0.00012631078,0.00044587927,0.00007319979,0.0000013309563],"category_scores_gemma":[0.000023901724,0.00013120414,0.00001757238,0.000078094905,0.00006643982,0.00030534665,0.00006648089,0.00024242523,0.0000030142292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029476266,0.0000072945945,0.02802493,0.0000060631232,0.00002229702,0.0000019471593,0.000058738387,0.96838504,0.002283869,0.000020167905,0.00007090797,0.0011158115],"study_design_scores_gemma":[0.00034544355,0.000005158368,0.0070786322,0.00007417861,0.000016012047,0.000002524588,0.000009410164,0.99087775,0.0007357994,0.000011262489,0.0006565002,0.0001873313],"about_ca_topic_score_codex":0.000018739036,"about_ca_topic_score_gemma":0.0002487036,"teacher_disagreement_score":0.29392785,"about_ca_system_score_codex":0.0001321626,"about_ca_system_score_gemma":0.0000044324834,"threshold_uncertainty_score":0.53503495},"labels":[],"label_agreement":null},{"id":"W2762666685","doi":"10.1109/lcomm.2017.2759780","title":"Video Transcoding, Caching, and Multicast for Heterogeneous Networks Over Wireless Network Virtualization","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Multicast; Transcoding; Computer network; Heterogeneous network; Distributed computing; Wireless network; Network virtualization; Source-specific multicast; Virtualization; Scheme (mathematics); Xcast; Wireless; Cloud computing; Operating system","score_opus":0.037138828447178966,"score_gpt":0.28651696772635443,"score_spread":0.24937813927917546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762666685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12893301,0.00041668158,0.86391807,0.0057704225,0.00048242343,0.00028400644,0.000005416146,0.00012093323,0.00006906014],"genre_scores_gemma":[0.99017835,0.00028109326,0.0064614615,0.0027952169,0.0001449264,0.00007448227,0.000013487614,0.000018892386,0.000032112413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989254,0.0001268605,0.00024120584,0.00030841818,0.00011460306,0.00028354902],"domain_scores_gemma":[0.996584,0.00028458194,0.00018893041,0.00280754,0.00005293547,0.000081984566],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033745842,0.00015622292,0.0001737727,0.00005104203,0.0018532295,0.00066033076,0.002330296,0.00006619887,9.0032415e-7],"category_scores_gemma":[0.000031709977,0.00016636387,0.00009821111,0.000058074253,0.0001928002,0.0005056139,0.00031694185,0.00019075925,0.0000021987353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017498339,0.00065698964,0.042026695,0.00016600551,0.0008483218,0.000034379376,0.0065506613,0.48131683,0.062934324,0.111328945,0.04233201,0.25162986],"study_design_scores_gemma":[0.00054930366,0.000026628939,0.001947088,0.000070160255,0.000027856302,0.000013551075,0.000005477071,0.9931553,0.000081997016,0.00012498151,0.0037632342,0.00023444869],"about_ca_topic_score_codex":0.00018736198,"about_ca_topic_score_gemma":0.00023330869,"teacher_disagreement_score":0.86124533,"about_ca_system_score_codex":0.00003536062,"about_ca_system_score_gemma":0.000013223763,"threshold_uncertainty_score":0.9994462},"labels":[],"label_agreement":null},{"id":"W2762753333","doi":"10.1109/lcomm.2017.2759106","title":"Two-Way Relay Selection for Millimeter Wave Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Selection (genetic algorithm); Computer network; Extremely high frequency; Telecommunications; Physics; Artificial intelligence; Power (physics)","score_opus":0.06177513743133975,"score_gpt":0.28195480218844526,"score_spread":0.22017966475710551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762753333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08012393,0.0002544842,0.91471076,0.0023520826,0.0005777467,0.00033900762,0.000008361025,0.00024034259,0.00139331],"genre_scores_gemma":[0.94221437,0.0002642223,0.0562079,0.00078978017,0.00017184418,0.00017158479,0.000040315157,0.00004818631,0.00009178917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924284,0.00004271767,0.00025062976,0.00015006929,0.00007588389,0.00023784771],"domain_scores_gemma":[0.99801373,0.00010588964,0.000086191976,0.0016630705,0.00007174869,0.00005937946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024199339,0.00014327902,0.00013702875,0.000087701366,0.0008209476,0.0001603,0.00064623996,0.000067427776,0.000012370166],"category_scores_gemma":[0.000032915308,0.00015611893,0.00010192216,0.000052997686,0.00008230903,0.0002313702,0.00006925762,0.00025249005,0.000023374494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017227567,0.00004539337,0.00038506,0.00004489168,0.00021939976,5.87753e-7,0.00045333034,0.5793461,0.36419675,0.0002885326,0.021751394,0.033251304],"study_design_scores_gemma":[0.00040129342,0.000011197533,0.00016661554,0.000027988832,0.00003607806,0.000005062358,0.00000919932,0.9750948,0.015539787,0.000049471633,0.008448537,0.00020995582],"about_ca_topic_score_codex":0.00003629485,"about_ca_topic_score_gemma":0.00010256468,"teacher_disagreement_score":0.86209047,"about_ca_system_score_codex":0.000077449855,"about_ca_system_score_gemma":0.0000059579615,"threshold_uncertainty_score":0.63663447},"labels":[],"label_agreement":null},{"id":"W2765492968","doi":"10.1109/lcomm.2018.2815018","title":"Anti-Jamming Communications Using Spectrum Waterfall: A Deep Reinforcement Learning Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":248,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Jamming; Waterfall; Reinforcement learning; Computer science; Waterfall model; Artificial neural network; Artificial intelligence; Software","score_opus":0.05123723027287137,"score_gpt":0.2837576061952535,"score_spread":0.23252037592238212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765492968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06506305,0.00030130992,0.9183953,0.011600378,0.00037007756,0.0003982148,5.54286e-7,0.00053087634,0.0033402625],"genre_scores_gemma":[0.7665755,0.00021184831,0.23139906,0.0015512619,0.0001418181,0.000037021167,0.000026253929,0.000031535757,0.000025680385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973349,0.00060295087,0.0005921318,0.0004611891,0.00036928142,0.00063955237],"domain_scores_gemma":[0.9907516,0.00031570732,0.00032066353,0.00832121,0.00015653754,0.0001342477],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006174147,0.00028736526,0.00030628606,0.0003018466,0.0018878016,0.0004301039,0.008616295,0.0001137759,0.000009376267],"category_scores_gemma":[0.00004262641,0.0003186223,0.00012587027,0.0009449204,0.0008847433,0.00072633836,0.0025111414,0.000850964,0.0001278901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025458123,0.0010968954,0.0053739734,0.00010415358,0.0006984354,0.000015830243,0.061185535,0.68362373,0.13124762,0.09250859,0.0034190516,0.020700747],"study_design_scores_gemma":[0.0002600067,0.000041667296,0.00014509562,0.00005379285,0.000026304673,0.000050357492,0.00017967827,0.98900294,0.0015946061,0.00013886917,0.008121301,0.00038538675],"about_ca_topic_score_codex":0.00033809387,"about_ca_topic_score_gemma":0.00007594621,"teacher_disagreement_score":0.70151246,"about_ca_system_score_codex":0.00025268734,"about_ca_system_score_gemma":0.00005044127,"threshold_uncertainty_score":0.99992657},"labels":[],"label_agreement":null},{"id":"W2765645554","doi":"10.1109/lcomm.2017.2766223","title":"An Iterative Check Polytope Projection Algorithm for ADMM-Based LP Decoding of LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Low-density parity-check code; Linear programming; Decoding methods; Polytope; Mathematics; Projection (relational algebra); Computer science; Computational complexity theory; Euclidean distance; Combinatorics; Artificial intelligence","score_opus":0.0692624273249454,"score_gpt":0.37085774638206986,"score_spread":0.30159531905712444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765645554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02584063,0.000028853205,0.9665866,0.006072044,0.00029299647,0.00054736144,0.000017159582,0.0003501515,0.00026420745],"genre_scores_gemma":[0.49390352,0.0000053080703,0.5054613,0.00040634326,0.00003669804,0.00015558544,0.000009207516,0.000011257607,0.000010827673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988345,0.00018687858,0.00030694104,0.0003058474,0.00015509315,0.00021073414],"domain_scores_gemma":[0.9943449,0.00031298588,0.00047428434,0.004563514,0.00025237736,0.000051962503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006143754,0.00015113773,0.00020027487,0.00019828674,0.000985397,0.0003280997,0.004370917,0.000064350126,9.940924e-7],"category_scores_gemma":[0.00013543198,0.00016106752,0.00009744933,0.00015549535,0.00023895534,0.00096118916,0.00024757115,0.00019891324,0.0000022525119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021376027,0.00059873046,0.0029242933,0.00006398315,0.000089463865,0.000002300691,0.0068463446,0.00022880168,0.480059,0.0038258203,0.0051620067,0.50017786],"study_design_scores_gemma":[0.0003459733,0.00016634869,0.0009855008,0.00012149516,0.000017146658,0.0000051948186,0.00007859216,0.74822235,0.2484769,0.00035833407,0.0009644075,0.00025778898],"about_ca_topic_score_codex":0.00027413626,"about_ca_topic_score_gemma":0.00014479642,"teacher_disagreement_score":0.7479935,"about_ca_system_score_codex":0.000096921474,"about_ca_system_score_gemma":0.00008961122,"threshold_uncertainty_score":0.8122324},"labels":[],"label_agreement":null},{"id":"W2765719825","doi":"10.1109/lcomm.2017.2764911","title":"Cooperative Low-Power Wideband Sensing Based on 1-bit Quantization","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wideband; Computer science; Quantization (signal processing); Power (physics); Bit (key); Electronic engineering; Telecommunications; Computer network; Algorithm; Engineering; Physics","score_opus":0.028934147498866268,"score_gpt":0.279438112374871,"score_spread":0.25050396487600474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765719825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037223704,0.00003733295,0.9068346,0.04799036,0.00046264968,0.00020942236,0.0000028169802,0.00013360915,0.007105527],"genre_scores_gemma":[0.9576449,0.000026848125,0.035268825,0.006951932,0.000057003574,0.0000032976827,0.0000085949505,0.000015591115,0.00002300331],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987974,0.00022650759,0.00021233801,0.00031554105,0.00020215615,0.0002460556],"domain_scores_gemma":[0.99541557,0.0003898718,0.00020116821,0.00377706,0.00014791715,0.00006839167],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00027652187,0.00016507746,0.00016789597,0.00012007285,0.0018818544,0.00083386025,0.0016469429,0.000047869707,0.0000047411663],"category_scores_gemma":[0.00012557984,0.00016609089,0.00007230718,0.00017197602,0.00027379097,0.0005107677,0.00020511709,0.0002721455,0.000046720023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020357124,0.0014877865,0.0059519084,0.00006275325,0.0004758707,0.00032997312,0.009933322,0.092198454,0.3316047,0.17696086,0.05778875,0.32300207],"study_design_scores_gemma":[0.0005338522,0.00004686287,0.0036904998,0.00020292393,0.000010788844,0.000009190041,0.000018446384,0.9881195,0.0044539305,0.00020024324,0.0023908634,0.00032288858],"about_ca_topic_score_codex":0.00005617207,"about_ca_topic_score_gemma":0.00011460874,"teacher_disagreement_score":0.9204212,"about_ca_system_score_codex":0.00008121487,"about_ca_system_score_gemma":0.000049487167,"threshold_uncertainty_score":0.99941754},"labels":[],"label_agreement":null},{"id":"W2765930120","doi":"10.1109/lcomm.2017.2765642","title":"Distributed TOA-Based Positioning in Wireless Sensor Networks: A Potential Game Approach","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wireless sensor network; Nash equilibrium; Potential game; Convergence (economics); Cognitive radio; Wireless; Game theory; Node (physics); Best response; Algorithm; Position (finance); Mathematical optimization; Computer network; Mathematics; Telecommunications","score_opus":0.01618347142301384,"score_gpt":0.2347993585775521,"score_spread":0.21861588715453825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765930120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15988654,0.00009076754,0.8354917,0.0029378114,0.00019089915,0.00020801653,0.0000307086,0.0005901221,0.0005734201],"genre_scores_gemma":[0.99307936,0.00006365331,0.00622567,0.0002585549,0.000035526595,0.00008113887,0.00022399134,0.00002746944,0.000004612196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923253,0.000053385113,0.0002348456,0.00013558705,0.00009383274,0.00024980292],"domain_scores_gemma":[0.99787736,0.000046072808,0.00007192453,0.001938862,0.000034649853,0.000031139436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001140083,0.00013938424,0.0001566044,0.00012787252,0.00039804078,0.0001819169,0.001207769,0.00011201195,0.000003410814],"category_scores_gemma":[0.00002667234,0.00015855633,0.000058580135,0.00015712241,0.00024344114,0.00017338111,0.00009576617,0.0003357571,0.000008565596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006110734,0.000048800273,0.0019762742,0.000021505297,0.000024489125,0.0000062337604,0.00007795658,0.9874993,0.0074319276,0.00044179623,0.001135661,0.0013299412],"study_design_scores_gemma":[0.00046244165,0.0000045382817,0.0052705603,0.000048905396,0.000013474607,0.0000044099734,0.0000731067,0.9911665,0.0023844338,0.000020562004,0.00034132827,0.00020975909],"about_ca_topic_score_codex":0.000056890065,"about_ca_topic_score_gemma":0.000030074276,"teacher_disagreement_score":0.8331928,"about_ca_system_score_codex":0.00011278781,"about_ca_system_score_gemma":0.00000937274,"threshold_uncertainty_score":0.64657396},"labels":[],"label_agreement":null},{"id":"W2766124948","doi":"10.1109/lcomm.2017.2767028","title":"Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code (set theory); Upper and lower bounds; Combinatorics; Computer science; Discrete mathematics; Mathematics; Algorithm; Programming language","score_opus":0.03862617650656103,"score_gpt":0.2988150922925174,"score_spread":0.2601889157859564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766124948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60447,0.00034421674,0.15262967,0.22844414,0.0006734612,0.00041449608,0.00001066739,0.0003379448,0.012675402],"genre_scores_gemma":[0.97470725,0.00008451189,0.022889271,0.0021463025,0.000015486456,0.000034225588,6.684712e-7,0.000008473221,0.00011383186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923116,0.00012567798,0.00017195806,0.00018386997,0.00014968436,0.00013765754],"domain_scores_gemma":[0.99323195,0.00053400564,0.0002216302,0.0059244656,0.00005931741,0.000028643934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037578205,0.000102222264,0.000118182,0.000051987736,0.0008359916,0.00024214109,0.004682973,0.000032987256,0.0000021767096],"category_scores_gemma":[0.0001338442,0.00007793788,0.00004729543,0.00007920422,0.0006539368,0.0002735278,0.0006097519,0.0002198124,0.000008285602],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046925852,0.0006984656,0.03769747,0.00006574548,0.00017975661,0.000011956053,0.010482435,0.000029137342,0.19606058,0.53648984,0.18369222,0.034545474],"study_design_scores_gemma":[0.0018696915,0.00080442266,0.21618026,0.0022277765,0.00014500866,0.00009507736,0.0004594738,0.091594316,0.21628006,0.035108548,0.4321565,0.0030788418],"about_ca_topic_score_codex":0.00006577726,"about_ca_topic_score_gemma":0.000085549495,"teacher_disagreement_score":0.5013813,"about_ca_system_score_codex":0.000027908676,"about_ca_system_score_gemma":0.00001820717,"threshold_uncertainty_score":0.8702207},"labels":[],"label_agreement":null},{"id":"W2768421325","doi":"10.1109/lcomm.2017.2776225","title":"Simple and Accurate Low SNR Ergodic Capacity Approximations","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Ergodic theory; Simple (philosophy); Moment (physics); Approximations of π; Signal-to-noise ratio (imaging); Moment-generating function; Function (biology); Mathematics; Probability density function; Computer science; Channel (broadcasting); Channel capacity; Applied mathematics; Algorithm; Mathematical analysis; Telecommunications; Statistics; Physics","score_opus":0.08519627122166555,"score_gpt":0.33039826758115615,"score_spread":0.24520199635949058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768421325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16066983,0.0004129238,0.7086861,0.12364849,0.00023684824,0.0006958671,0.000020228426,0.0004068966,0.005222793],"genre_scores_gemma":[0.9338332,0.00057294767,0.06415906,0.0011531509,0.000037799273,0.00015808501,0.000015501362,0.000016022244,0.000054276334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982614,0.00041798688,0.00032617504,0.0003371806,0.0002916723,0.0003655713],"domain_scores_gemma":[0.9866827,0.0005356679,0.00028608,0.012173365,0.00016096815,0.00016118931],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006566058,0.00017028768,0.00019255387,0.00015576859,0.0030257034,0.001287315,0.0105192885,0.00007385708,0.000007423777],"category_scores_gemma":[0.0002149673,0.00017937415,0.00006363173,0.00023850094,0.00095145404,0.0015297531,0.0028891605,0.00056132325,0.00008630178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025583337,0.0012716111,0.020279448,0.00021026762,0.00042384228,0.000017386486,0.00859508,0.0043288204,0.07830851,0.56108457,0.096609935,0.22884493],"study_design_scores_gemma":[0.0010739539,0.000034217894,0.055173438,0.00011944278,0.000020979058,0.00003822766,0.00009016449,0.89369076,0.0021498587,0.006280694,0.040500738,0.0008275018],"about_ca_topic_score_codex":0.00018414941,"about_ca_topic_score_gemma":0.00021277815,"teacher_disagreement_score":0.889362,"about_ca_system_score_codex":0.000078974525,"about_ca_system_score_gemma":0.00006346862,"threshold_uncertainty_score":0.9997494},"labels":[],"label_agreement":null},{"id":"W2768477051","doi":"10.1109/lcomm.2017.2777441","title":"An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Algorithm; Computer science; Variable (mathematics); Tree (set theory); Variable-length code; Theoretical computer science; Mathematics; Decoding methods; Combinatorics","score_opus":0.057150610431607914,"score_gpt":0.3419300642919074,"score_spread":0.2847794538602995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768477051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009018591,0.0001393917,0.9796441,0.009300294,0.00055154815,0.00054875517,0.000030948762,0.00030649794,0.00045986916],"genre_scores_gemma":[0.5325645,0.000015661702,0.46695918,0.0002608143,0.00003899423,0.0001239669,0.0000030916974,0.000015329648,0.00001841651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837685,0.00026394316,0.000354747,0.0003601714,0.00030486652,0.00033940785],"domain_scores_gemma":[0.98580986,0.0017825895,0.00038695397,0.011689125,0.0002703378,0.00006115859],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017429788,0.00017101307,0.00021726401,0.000103653845,0.002075861,0.00034893185,0.014588528,0.000058405338,0.0000010922313],"category_scores_gemma":[0.00038014082,0.00014585885,0.00010138306,0.00023571555,0.00051811663,0.0003957957,0.0010828443,0.00038493462,0.000002102029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022516,0.000717199,0.0023131734,0.00006608243,0.00016859718,0.000002579058,0.009167776,0.011088294,0.03810608,0.033265624,0.006825462,0.8982566],"study_design_scores_gemma":[0.00025957284,0.00006104822,0.0013177515,0.00008468789,0.000022116781,0.000008603274,0.00020231816,0.98500574,0.011357627,0.00046606397,0.0010090332,0.00020542381],"about_ca_topic_score_codex":0.0007733809,"about_ca_topic_score_gemma":0.00033354855,"teacher_disagreement_score":0.9739175,"about_ca_system_score_codex":0.00009415592,"about_ca_system_score_gemma":0.00007718572,"threshold_uncertainty_score":0.9992233},"labels":[],"label_agreement":null},{"id":"W2789459579","doi":"10.1109/lcomm.2018.2813360","title":"Call Admission Control for Non-Standalone 5G Ultra-Dense Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Exfo Electro-Optical Engineering (Canada)","funders":"","keywords":"Macrocell; Handover; Computer science; Computer network; Blocking (statistics); Call Admission Control; Call blocking; Admission control; Markov chain; Markov process; Service (business); Resource allocation; Base station; Quality of service; Telecommunications; Wireless; Wireless network","score_opus":0.03424410912685341,"score_gpt":0.3145049319825051,"score_spread":0.2802608228556517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789459579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002648304,0.00035222407,0.94260263,0.05160803,0.00038073352,0.00089659134,0.000012711988,0.00026274254,0.0012360365],"genre_scores_gemma":[0.9317275,0.00037174512,0.06096066,0.005981401,0.00028821718,0.00040139697,0.000032393822,0.00003769819,0.00019896394],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746674,0.0005424338,0.0005251666,0.00044883808,0.0003754828,0.00064133736],"domain_scores_gemma":[0.9897958,0.0017376461,0.00022270423,0.007417133,0.0005572471,0.00026943703],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011375273,0.00024066975,0.00029812148,0.00020931607,0.0011901753,0.0003267903,0.007987723,0.00014073016,0.000012248596],"category_scores_gemma":[0.00015344018,0.00024096652,0.00015403003,0.000786348,0.0006217545,0.00050105044,0.00041727358,0.00055966387,0.00008691752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003419424,0.0010005602,0.0014667427,0.000064625696,0.0004185145,0.00000954943,0.0034610836,0.014191349,0.1611806,0.025399487,0.6800124,0.112453125],"study_design_scores_gemma":[0.0016907678,0.00014709962,0.00080624997,0.00009569618,0.000018688908,0.000013851655,0.000017911763,0.9070394,0.0024410135,0.00023119176,0.08708871,0.00040940242],"about_ca_topic_score_codex":0.000049481936,"about_ca_topic_score_gemma":0.00010353424,"teacher_disagreement_score":0.92907923,"about_ca_system_score_codex":0.0001688416,"about_ca_system_score_gemma":0.00012966432,"threshold_uncertainty_score":0.99737954},"labels":[],"label_agreement":null},{"id":"W2789497997","doi":"10.1109/lcomm.2018.2808182","title":"Exact Solutions for Certain Weighted Sum-Rate and Common-Rate Maximization Problems","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Algorithm; Combinatorics; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.07643602099072798,"score_gpt":0.2970351139120086,"score_spread":0.2205990929212806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789497997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015230763,0.00080494717,0.8985771,0.083224736,0.0002725971,0.00082585023,0.000014712406,0.00032715264,0.00072215596],"genre_scores_gemma":[0.9201513,0.002006424,0.07174819,0.0053577116,0.00009100115,0.0003439519,0.000087175016,0.000026797472,0.0001874772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998043,0.0007085841,0.0004015675,0.00034769048,0.00009942994,0.00039972586],"domain_scores_gemma":[0.9956613,0.0007236207,0.00019366057,0.0029734913,0.0003408348,0.00010710205],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010702295,0.00019831058,0.0002038689,0.00019392616,0.0019624447,0.00033738706,0.0023559048,0.0000670251,0.000010434235],"category_scores_gemma":[0.000071472656,0.00020468817,0.00006379362,0.0007037387,0.00039175732,0.0006323946,0.00085295003,0.00022612234,0.000035707188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052081698,0.00069344486,0.0018739306,0.000092464645,0.00032424147,0.000001605017,0.01027398,0.0014142203,0.21324678,0.5406621,0.08399178,0.14737335],"study_design_scores_gemma":[0.0008714925,0.00010890819,0.0033858155,0.00010259947,0.000030421685,0.000009088132,0.000039533625,0.87201536,0.0012635692,0.003356118,0.118321985,0.00049510866],"about_ca_topic_score_codex":0.000037654594,"about_ca_topic_score_gemma":0.000675654,"teacher_disagreement_score":0.9049205,"about_ca_system_score_codex":0.00010891851,"about_ca_system_score_gemma":0.00005478846,"threshold_uncertainty_score":0.99933684},"labels":[],"label_agreement":null},{"id":"W2789766054","doi":"10.1109/lcomm.2018.2810211","title":"Distributed Caching Enabled Peak Traffic Reduction in Ultra-Dense IoT Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Telecommunications link; Computer network; Scheduling (production processes); Cache; Reduction (mathematics); Transmission (telecommunications); Internet of Things; Wireless network; Distributed computing; Wireless; Real-time computing; Embedded system","score_opus":0.024575150984852082,"score_gpt":0.24983360906833982,"score_spread":0.22525845808348774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789766054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7467959,0.00023196028,0.23183149,0.019702626,0.0006733359,0.00019353608,0.0000036514728,0.00031870272,0.00024881787],"genre_scores_gemma":[0.9962253,0.00006463453,0.0021172613,0.0013368041,0.0001525005,0.000029966914,0.00002953907,0.000011791942,0.00003217858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985293,0.00037792692,0.00031700116,0.00030693444,0.00015169846,0.00031713574],"domain_scores_gemma":[0.9972879,0.00016847809,0.00011182027,0.0022880223,0.00007572512,0.00006804543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047887326,0.00014475567,0.0001541066,0.00018504138,0.0004691277,0.00018575908,0.002032856,0.00006397668,0.0000027174372],"category_scores_gemma":[0.000036758058,0.00015719853,0.00007655389,0.0006809147,0.00019325601,0.00030319483,0.00014146145,0.00045342743,0.00003530391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009508732,0.000988842,0.0011755294,0.000026735768,0.00018337554,0.000043903976,0.009870404,0.4466605,0.40577194,0.0056664958,0.061970443,0.06754677],"study_design_scores_gemma":[0.0008261435,0.0000671118,0.0029821217,0.00013453685,0.000022500475,0.00010204172,0.00019306934,0.9889299,0.00082126155,0.00007290061,0.0053405827,0.00050778186],"about_ca_topic_score_codex":0.00029515036,"about_ca_topic_score_gemma":0.00023083958,"teacher_disagreement_score":0.54226947,"about_ca_system_score_codex":0.00016017623,"about_ca_system_score_gemma":0.00003245111,"threshold_uncertainty_score":0.64103705},"labels":[],"label_agreement":null},{"id":"W2791285730","doi":"10.1109/lcomm.2018.2797877","title":"A Power-Efficient and Social-Aware Relay Selection Method for Multi-Hop D2D Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Relay; Computer science; Hop (telecommunications); Exploit; Computer network; Upload; Selection (genetic algorithm); Power consumption; Transmission (telecommunications); Power (physics); Telecommunications; Computer security; Artificial intelligence","score_opus":0.1046367194452691,"score_gpt":0.3780376339120289,"score_spread":0.2734009144667598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791285730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024757045,0.0005323349,0.9311536,0.06429308,0.00018079473,0.00062500895,0.0000121394105,0.00030976214,0.0004176082],"genre_scores_gemma":[0.48646417,0.00034266585,0.5087097,0.0040302635,0.000042922642,0.00028005947,0.000021859478,0.00002147886,0.000086838176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977265,0.000886623,0.00045336236,0.0004177866,0.00016950858,0.000346244],"domain_scores_gemma":[0.9943531,0.00079002575,0.00024349151,0.0039288765,0.0005955544,0.00008894345],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010686001,0.00022564012,0.00024714644,0.000247659,0.0030048923,0.0002852533,0.004389046,0.00009965364,0.000009193599],"category_scores_gemma":[0.000059713064,0.00024550772,0.000113232265,0.00084150565,0.00059615937,0.00031352893,0.0016032549,0.0004047985,0.000034851684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006092908,0.0020035522,0.0007597791,0.00007613199,0.00051904266,9.0544427e-7,0.056948703,0.00061551086,0.17335322,0.3693897,0.06915349,0.327119],"study_design_scores_gemma":[0.0006032112,0.000058564834,0.0005640479,0.00003083246,0.000020892718,0.000012285795,0.00016984304,0.8873305,0.0008051487,0.0000621909,0.1100361,0.00030641648],"about_ca_topic_score_codex":0.00002026959,"about_ca_topic_score_gemma":0.00022680589,"teacher_disagreement_score":0.88671494,"about_ca_system_score_codex":0.00015976263,"about_ca_system_score_gemma":0.00007827817,"threshold_uncertainty_score":0.9999997},"labels":[],"label_agreement":null},{"id":"W2792354310","doi":"10.1109/lcomm.2018.2804928","title":"An Optimal Real-Time Distributed Algorithm for Utility Maximization of Mobile Ad Hoc Cloud","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Wireless ad hoc network; Utility maximization; Distributed computing; Mobile ad hoc network; Maximization; Algorithm; Computer network; Wireless; Mathematical optimization; Telecommunications; Mathematics; Operating system","score_opus":0.025658116954062952,"score_gpt":0.28064813046438725,"score_spread":0.2549900135103243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792354310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11441643,0.00011962919,0.8833041,0.0012849664,0.00020413099,0.0002938366,0.0001519275,0.00016918387,0.00005577221],"genre_scores_gemma":[0.67123955,0.00015896997,0.32760802,0.00041941696,0.00008571044,0.00012028829,0.00032323203,0.000013825932,0.000031014435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989456,0.00018613374,0.00029537905,0.00025118908,0.00013698282,0.00018471613],"domain_scores_gemma":[0.99658924,0.00017462242,0.00015916163,0.0027446798,0.0002687878,0.00006348871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037431822,0.00010957733,0.00016098701,0.00007603525,0.00030841565,0.00007551484,0.0020918923,0.000049471266,0.0000073351202],"category_scores_gemma":[0.000019356949,0.00011774788,0.000086096574,0.00028418485,0.00025384309,0.0003728217,0.00019320504,0.0000940916,0.000015871676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093862654,0.001240164,0.0002412134,0.00003082503,0.000160924,0.0000016827853,0.0033558684,0.0020697142,0.23211376,0.001060213,0.030696005,0.7289358],"study_design_scores_gemma":[0.00035819612,0.0002007185,0.00040355523,0.000017753013,0.000018883567,0.000003532002,0.00004471686,0.98994964,0.0030341074,0.00007573189,0.005731719,0.00016145596],"about_ca_topic_score_codex":0.00005090038,"about_ca_topic_score_gemma":0.0000085098245,"teacher_disagreement_score":0.98787993,"about_ca_system_score_codex":0.00004657406,"about_ca_system_score_gemma":0.000040238996,"threshold_uncertainty_score":0.4801619},"labels":[],"label_agreement":null},{"id":"W2792456449","doi":"10.1109/lcomm.2018.2807425","title":"Distributed-Relay Beamforming for Secrecy Energy Efficiency With Coordinated Eavesdroppers","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Nanjing University of Posts and Telecommunications; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Relay; Beamforming; Computer science; Secrecy; Computer network; Efficient energy use; Energy (signal processing); Computer security; Telecommunications; Electrical engineering; Engineering; Power (physics); Mathematics","score_opus":0.01576881900403084,"score_gpt":0.24671002828887,"score_spread":0.23094120928483916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792456449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05545261,0.00022219383,0.93713355,0.0030986639,0.00012560019,0.00038488407,0.00009581294,0.0014867161,0.0019999396],"genre_scores_gemma":[0.94440126,0.00020957289,0.053958204,0.0005957733,0.000051296203,0.00040313,0.00028750746,0.00007300536,0.00002026367],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988746,0.00007505622,0.00034918936,0.00019574529,0.00014138987,0.00036403214],"domain_scores_gemma":[0.99663955,0.00027689687,0.00009003156,0.0027047435,0.00019918289,0.00008958545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020566801,0.00023519316,0.00022078455,0.00019698974,0.00051543576,0.000076113516,0.0018681104,0.00010075738,0.000008167473],"category_scores_gemma":[0.000027446038,0.00023912513,0.000076291624,0.0005847359,0.00054991926,0.00024713684,0.00014916096,0.00025701016,0.000014003223],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020783668,0.0011093462,0.001660993,0.00034264568,0.0013960596,0.000010094358,0.01108183,0.058057476,0.5969147,0.11578868,0.16328286,0.050147507],"study_design_scores_gemma":[0.0018180568,0.00038596886,0.00022866252,0.0003858371,0.00015681748,0.00008235236,0.00056786364,0.35867515,0.19658603,0.0005028847,0.43881118,0.0017991944],"about_ca_topic_score_codex":0.000053910306,"about_ca_topic_score_gemma":0.00017931357,"teacher_disagreement_score":0.8889486,"about_ca_system_score_codex":0.00018935215,"about_ca_system_score_gemma":0.000027267415,"threshold_uncertainty_score":0.975124},"labels":[],"label_agreement":null},{"id":"W2795905224","doi":"10.1109/lcomm.2018.2825428","title":"Mixed Quality of Service in Cell-Free Massive MIMO","year":2018,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; Queen's University; Queen's University Belfast","keywords":"Quality of service; MIMO; Telecommunications link; Computer science; Benchmark (surveying); Throughput; Channel (broadcasting); Mathematical optimization; Wireless; Computer network; Real-time computing; Mathematics; Telecommunications","score_opus":0.05417333655387082,"score_gpt":0.28976618352194794,"score_spread":0.2355928469680771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795905224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3566115,0.0024783185,0.60777366,0.012757848,0.0035147658,0.0027463683,0.0007674315,0.0010426635,0.012307477],"genre_scores_gemma":[0.87463427,0.00030436696,0.123981245,0.00035767563,0.00007229569,0.00026477818,0.0002804091,0.000086067565,0.000018880239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981789,0.00031121823,0.0008784701,0.00025417216,0.00015831037,0.00021893],"domain_scores_gemma":[0.99348253,0.00027726984,0.00036873028,0.0056401202,0.00018465662,0.00004667803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035268578,0.00027466475,0.00046425583,0.00026701632,0.000052015064,0.000022550437,0.0025521773,0.00025628274,0.0000095217665],"category_scores_gemma":[0.00006879861,0.00034828944,0.00009407206,0.000367465,0.0001257264,0.00010266311,0.000898822,0.00065879885,0.000028370527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066267894,0.00006604109,0.0003549488,0.00100648,0.000057523215,6.134851e-7,0.0012818499,0.9494605,0.042061906,0.00012023844,0.0054480736,0.00013519303],"study_design_scores_gemma":[0.0046754777,0.00004224663,0.009164133,0.003759643,0.00023174484,0.0000049645682,0.0015172735,0.9030273,0.06546742,0.0034983102,0.0049062944,0.003705173],"about_ca_topic_score_codex":0.0005262752,"about_ca_topic_score_gemma":0.0014917532,"teacher_disagreement_score":0.5180228,"about_ca_system_score_codex":0.00028736913,"about_ca_system_score_gemma":0.00003965528,"threshold_uncertainty_score":0.9998969},"labels":[],"label_agreement":null},{"id":"W2796115129","doi":"10.1109/lcomm.2018.2822798","title":"Dynamic Pricing Mechanism in Smart Grid Communications Is Shaping Up","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Exfo Electro-Optical Engineering (Canada)","funders":"","keywords":"Dynamic pricing; Smart grid; Computer science; Demand response; Dynamic demand; Electricity; Load management; Supply and demand; Environmental economics; Key (lock); Electricity pricing; Electricity market; Microeconomics; Power (physics); Computer security; Economics","score_opus":0.03698678857456441,"score_gpt":0.26603147157523727,"score_spread":0.22904468300067285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796115129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61027175,0.0023998043,0.2438034,0.08797871,0.008144327,0.0019675193,0.00007278834,0.0034106025,0.041951086],"genre_scores_gemma":[0.97095287,0.0008935605,0.024331694,0.003354747,0.00006836055,0.00019323092,0.00005459474,0.00006989263,0.000081059094],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986858,0.00012247854,0.00044171943,0.00021292857,0.00016660498,0.00037046557],"domain_scores_gemma":[0.99486613,0.00016366327,0.00006439536,0.004791305,0.000052316434,0.000062212086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033926265,0.0002140572,0.00019899105,0.0004016721,0.0003455297,0.00007132597,0.0026150444,0.00007091602,0.000038307517],"category_scores_gemma":[0.000020375299,0.00026682575,0.00006821739,0.00067567994,0.00025751162,0.00025457484,0.00060917676,0.0004088701,0.00027436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036397483,0.0008201297,0.0070372564,0.00046442662,0.0015348077,0.000020174475,0.037514053,0.11599529,0.49177632,0.061925832,0.2513578,0.031517543],"study_design_scores_gemma":[0.0005778035,0.000020413605,0.0042238105,0.00020835604,0.00004810112,0.0000075868825,0.00035863247,0.88912195,0.0034995337,0.0005478864,0.10076523,0.0006206727],"about_ca_topic_score_codex":0.00019736984,"about_ca_topic_score_gemma":0.0013419623,"teacher_disagreement_score":0.77312666,"about_ca_system_score_codex":0.00038356034,"about_ca_system_score_gemma":0.000013714633,"threshold_uncertainty_score":0.9999784},"labels":[],"label_agreement":null},{"id":"W2801133560","doi":"10.1109/lcomm.2018.2829706","title":"Capacity-Approaching Variable-Length Pearson Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Computer science; Redundancy (engineering); Algorithm; Pearson product-moment correlation coefficient; Variable (mathematics); Variable-length code; Theoretical computer science; Mathematics; Decoding methods; Statistics","score_opus":0.03745906696476733,"score_gpt":0.2626898693912623,"score_spread":0.22523080242649499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801133560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067436,0.00053177285,0.8936513,0.00339792,0.00030489094,0.00042786213,0.000033506098,0.0034199615,0.030796772],"genre_scores_gemma":[0.6985534,0.00037777427,0.30015734,0.00062460743,0.00007323272,0.00011350436,0.00002726292,0.0000522945,0.00002063111],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888986,0.00017827396,0.00032618118,0.00017058014,0.00014539962,0.00028967235],"domain_scores_gemma":[0.99588645,0.000247625,0.0000721304,0.0036329124,0.000089808265,0.00007105265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003153832,0.00020066372,0.00019618661,0.00017328141,0.00045621805,0.00006789437,0.0020203593,0.000086314685,0.000023745224],"category_scores_gemma":[0.00004526593,0.00023354439,0.000051991152,0.00040953688,0.00047599754,0.00036395437,0.00020973371,0.00055890874,0.000099601944],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012239807,0.00023005523,0.0007050372,0.000120231016,0.00027098175,0.0000011292707,0.0048717503,0.011491421,0.8483999,0.054054264,0.03649369,0.043349333],"study_design_scores_gemma":[0.00084800075,0.000090774825,0.0011357769,0.00038670722,0.00009762649,0.000051267947,0.00041293504,0.38954145,0.157175,0.00514548,0.44320098,0.0019140281],"about_ca_topic_score_codex":0.000050282695,"about_ca_topic_score_gemma":0.00003975324,"teacher_disagreement_score":0.6912249,"about_ca_system_score_codex":0.00015873551,"about_ca_system_score_gemma":0.00001180176,"threshold_uncertainty_score":0.95236635},"labels":[],"label_agreement":null},{"id":"W2803035418","doi":"10.1109/lcomm.2018.2829479","title":"Secrecy Rate Closed-Form Expressions for the SISO VLC Wiretap Channel With Discrete Input Signaling","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qatar National Research Fund; Fonds Québécois de la Recherche sur la Nature et les Technologies; Concordia University","keywords":"Secrecy; Computer science; Channel (broadcasting); Expression (computer science); Closed-form expression; Set (abstract data type); Function (biology); Topology (electrical circuits); Theoretical computer science; Computer network; Mathematics; Computer security","score_opus":0.03073018981937342,"score_gpt":0.2627522773811729,"score_spread":0.23202208756179948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803035418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16957729,0.0020959703,0.76760554,0.053785168,0.00041563273,0.0017168775,0.000089820845,0.00270091,0.0020128172],"genre_scores_gemma":[0.9744826,0.00053499726,0.022993272,0.00091741234,0.00008265127,0.00084262184,0.000038120605,0.000075126874,0.000033215554],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988469,0.00008913262,0.00035465113,0.0001952423,0.00014316353,0.00037093656],"domain_scores_gemma":[0.9945342,0.0011412886,0.000098260054,0.0040209834,0.00013898227,0.00006631748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033428628,0.00024979835,0.00021940864,0.00012737351,0.0009913325,0.00012149803,0.002923354,0.000111077505,0.000011271916],"category_scores_gemma":[0.00010532016,0.00018011141,0.00009419266,0.00043528844,0.0009873711,0.00027417956,0.00035359155,0.0005076651,0.000046698515],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002307855,0.0003768423,0.00052160694,0.00029370488,0.001465732,0.000003096559,0.011765049,0.06363238,0.77001554,0.052917134,0.02710761,0.07167053],"study_design_scores_gemma":[0.0021913801,0.00031750457,0.0018140604,0.00075687905,0.00030265708,0.000015399104,0.0032377152,0.6511645,0.25040802,0.006949815,0.08094551,0.001896594],"about_ca_topic_score_codex":0.000019895571,"about_ca_topic_score_gemma":0.0000899584,"teacher_disagreement_score":0.8049053,"about_ca_system_score_codex":0.00008594028,"about_ca_system_score_gemma":0.00002118103,"threshold_uncertainty_score":0.76246285},"labels":[],"label_agreement":null},{"id":"W2804130399","doi":"10.1109/lcomm.2018.2837913","title":"Multistatic Radar Placement Optimization for Cooperative Radar-Communication Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Radar; Bistatic radar; Multistatic radar; Radar engineering details; Interference (communication); Radar lock-on; Continuous-wave radar; Man-portable radar; Low probability of intercept radar; Real-time computing; Electronic engineering; Channel (broadcasting); Telecommunications; Radar imaging; Engineering","score_opus":0.026091255908003635,"score_gpt":0.2641810494406821,"score_spread":0.23808979353267848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804130399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00828836,0.0020217435,0.985354,0.00092507544,0.00051586423,0.00097362907,0.00005005266,0.0003244825,0.0015467762],"genre_scores_gemma":[0.8778237,0.00016441123,0.12104178,0.0002151168,0.00012151871,0.00033660803,0.00017358559,0.000055717315,0.00006755218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886626,0.00015701092,0.00045912,0.0001617716,0.00013009923,0.0002257205],"domain_scores_gemma":[0.99800485,0.00025386608,0.000114087925,0.0013529154,0.00021464017,0.00005962587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035417467,0.00018357304,0.00021177098,0.00011754147,0.0006461777,0.00018483124,0.0007592175,0.00006345484,0.000012140097],"category_scores_gemma":[0.000033323933,0.00019321132,0.00004897112,0.00024199353,0.00019132535,0.00030891612,0.000047931164,0.00015049627,0.000023649623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026067175,0.00008208853,0.000032907436,0.00025930206,0.0002314035,3.553736e-7,0.0038785853,0.89735025,0.058868274,0.0033931758,0.0329873,0.002890291],"study_design_scores_gemma":[0.0005909501,0.000036348603,0.000007066567,0.00018427576,0.00003316131,0.0000039049664,0.00047098252,0.97371334,0.0018633582,0.000017373332,0.022814307,0.00026494902],"about_ca_topic_score_codex":0.000067514964,"about_ca_topic_score_gemma":0.000027911683,"teacher_disagreement_score":0.8695353,"about_ca_system_score_codex":0.00019466438,"about_ca_system_score_gemma":0.000026976802,"threshold_uncertainty_score":0.7878929},"labels":[],"label_agreement":null},{"id":"W2806594972","doi":"10.1109/lcomm.2018.2843347","title":"Performance Analysis and Code Optimization of IDMA With 5G New Radio LDPC Code","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Low-density parity-check code; Computer science; Spectral efficiency; Code rate; Code (set theory); Enhanced Data Rates for GSM Evolution; Algorithm; Program optimization; Base station; Theoretical computer science; Decoding methods; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.038808881529345474,"score_gpt":0.2751331165543144,"score_spread":0.2363242350249689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806594972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0761473,0.00034700023,0.9108128,0.011352747,0.0000454873,0.00015299897,0.0000042569327,0.00009255228,0.0010448482],"genre_scores_gemma":[0.781702,0.001723642,0.21564807,0.0007970965,0.000024722644,0.000012078016,0.0000129251375,0.000008148528,0.00007133781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894154,0.00020208432,0.00029738378,0.00023378355,0.0001641735,0.0001610417],"domain_scores_gemma":[0.9964161,0.00017134767,0.00020338125,0.0028986917,0.00022529304,0.000085208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028133023,0.00013131204,0.00021511482,0.00028246845,0.0004339758,0.00010006839,0.0020936145,0.00003453224,0.0000166141],"category_scores_gemma":[0.000019350347,0.0001221274,0.000044973225,0.00175595,0.00042316504,0.00047253317,0.00031992837,0.00015344619,0.00000668617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018509693,0.0007739741,0.18161008,0.0000943976,0.0033065185,0.0000033480771,0.030293904,0.38680893,0.068058014,0.030103507,0.026674027,0.2720882],"study_design_scores_gemma":[0.00042630578,0.00008929353,0.01163047,0.000049892493,0.00011469274,0.0000069830626,0.000022047687,0.97841,0.0035872206,0.0000087918115,0.0054353653,0.00021894743],"about_ca_topic_score_codex":0.00002332352,"about_ca_topic_score_gemma":0.00043744603,"teacher_disagreement_score":0.70555466,"about_ca_system_score_codex":0.000040309962,"about_ca_system_score_gemma":0.00006395159,"threshold_uncertainty_score":0.49802107},"labels":[],"label_agreement":null},{"id":"W2807479447","doi":"10.1109/lcomm.2018.2844366","title":"Performance Analysis of Secondary Users in Cognitive Radio Networks With Dynamic Spectrum Allocation","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Cognitive radio; Computer science; Frequency allocation; Computer network; Cognition; Telecommunications; Wireless","score_opus":0.014575871073672178,"score_gpt":0.25091529697936177,"score_spread":0.2363394259056896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807479447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5963502,0.00011488596,0.400165,0.0023600599,0.00006970486,0.00015034515,0.0000026585842,0.000043712087,0.0007434609],"genre_scores_gemma":[0.9912374,0.00026110586,0.007620046,0.00077880535,0.00002983639,0.000013117262,0.000036725232,0.00001192596,0.000011049603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871045,0.00018096068,0.00033370694,0.00031527283,0.00017024968,0.0002893419],"domain_scores_gemma":[0.9979557,0.00031741036,0.00020946405,0.0013429499,0.00012381142,0.000050683237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032476135,0.00015557486,0.00028905243,0.0006241846,0.00021281176,0.00006421732,0.001037605,0.00004732625,0.000010490678],"category_scores_gemma":[0.000009851353,0.00015531231,0.00007822036,0.0030326475,0.00047759118,0.00043730089,0.00013787628,0.00030537418,0.0000040027285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051301473,0.0012673414,0.2651137,0.00007303994,0.006863173,0.00005402522,0.021064261,0.362757,0.010433387,0.004247006,0.0011863599,0.3264277],"study_design_scores_gemma":[0.00032430925,0.000078459205,0.17853852,0.00008337743,0.00013656274,0.0000072971857,0.00006156685,0.82027507,0.00027512334,0.000010424237,0.000041034633,0.00016824299],"about_ca_topic_score_codex":0.000119919096,"about_ca_topic_score_gemma":0.003417883,"teacher_disagreement_score":0.4575181,"about_ca_system_score_codex":0.00012774208,"about_ca_system_score_gemma":0.00006186927,"threshold_uncertainty_score":0.63334525},"labels":[],"label_agreement":null},{"id":"W2807732674","doi":"10.1109/lcomm.2018.2846727","title":"Network-Coded Cooperation With Outdated CSI","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.052149056840526946,"score_gpt":0.2846018946823751,"score_spread":0.23245283784184817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807732674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013000499,0.00037629844,0.9280482,0.051100157,0.0003280934,0.00038246549,0.000001949655,0.0005375528,0.006224808],"genre_scores_gemma":[0.871598,0.00030338223,0.11494849,0.012652079,0.00018521641,0.000081040045,0.00003348803,0.000019404086,0.00017890205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838257,0.0004554775,0.0003170864,0.00032213496,0.00019032355,0.00033243498],"domain_scores_gemma":[0.99459916,0.00018941014,0.0001426478,0.004545564,0.00042971707,0.00009350058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042499715,0.00018964561,0.00017565023,0.00010770643,0.0011783075,0.00033048962,0.0037716513,0.000050585222,0.00002948903],"category_scores_gemma":[0.000028463828,0.00017071782,0.00003800844,0.0011935825,0.00043578286,0.0006841895,0.00063562306,0.00030118442,0.0002441871],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009746185,0.0006088572,0.0029931641,0.000015565896,0.0003368407,0.000010411681,0.008550175,0.006832132,0.1102038,0.41803187,0.33983284,0.11248688],"study_design_scores_gemma":[0.0022306351,0.00044060254,0.0041963034,0.00025610082,0.000056901114,0.000073635805,0.00006277258,0.5368799,0.0075404537,0.0006087586,0.44616872,0.0014852254],"about_ca_topic_score_codex":0.0000123548525,"about_ca_topic_score_gemma":0.00034972097,"teacher_disagreement_score":0.8585975,"about_ca_system_score_codex":0.00007681862,"about_ca_system_score_gemma":0.00007476737,"threshold_uncertainty_score":0.90627074},"labels":[],"label_agreement":null},{"id":"W2809267483","doi":"10.1109/lcomm.2018.2848273","title":"Modified Sphere Decoding for Sparse Code Multiple Access","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities","keywords":"Decoding methods; Computer science; Code (set theory); Algorithm; Theoretical computer science; Set (abstract data type); Programming language","score_opus":0.09792129822379252,"score_gpt":0.3436101301921242,"score_spread":0.2456888319683317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809267483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06405711,0.0002956567,0.9278118,0.0025040186,0.00023681164,0.0006755707,0.000059419242,0.0016412959,0.0027183106],"genre_scores_gemma":[0.7912837,0.00038353537,0.2068974,0.0007042883,0.00007412216,0.00051501696,0.000050823593,0.00006574394,0.000025342737],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903935,0.000059939237,0.00035549625,0.00017097047,0.00009349301,0.00028073174],"domain_scores_gemma":[0.9960316,0.00051649316,0.00008525893,0.0031725462,0.00012758699,0.00006654031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016791381,0.0001835082,0.0001868035,0.00011730517,0.0004028002,0.00009254891,0.0027663102,0.00007929818,0.00001444645],"category_scores_gemma":[0.000077870085,0.00021783146,0.00007782772,0.0002685731,0.00028984636,0.00045212114,0.00027569264,0.00024007543,0.000035217086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000727401,0.00026171314,0.0022192579,0.00021207314,0.0003015947,0.0000012045463,0.001903373,0.09720179,0.6117449,0.008964504,0.14443703,0.13267982],"study_design_scores_gemma":[0.00069624017,0.000024810155,0.00031291298,0.00010501529,0.000028861648,0.0000040166233,0.00006917891,0.7574342,0.134603,0.0011682898,0.10498515,0.0005683502],"about_ca_topic_score_codex":0.000022723316,"about_ca_topic_score_gemma":0.00037797925,"teacher_disagreement_score":0.7272266,"about_ca_system_score_codex":0.0001383753,"about_ca_system_score_gemma":0.000013106428,"threshold_uncertainty_score":0.8882909},"labels":[],"label_agreement":null},{"id":"W2829439033","doi":"10.1109/lcomm.2018.2854279","title":"An Adaptive and Energy-Efficient Algorithm for Surface Gateway Deployment in Underwater Optical/Acoustic Hybrid Sensor Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wireless sensor network; Software deployment; Default gateway; Energy consumption; Node (physics); Bandwidth (computing); Underwater; Transmission (telecommunications); Algorithm; Fuzzy logic; Efficient energy use; Computer network; Distributed computing; Electronic engineering; Telecommunications; Acoustics; Engineering; Artificial intelligence; Electrical engineering","score_opus":0.02261145975886448,"score_gpt":0.241068884621411,"score_spread":0.21845742486254652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2829439033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13829628,0.000379141,0.8597937,0.0008562664,0.00009968903,0.00024657103,0.000017851311,0.00018982771,0.00012063733],"genre_scores_gemma":[0.91984767,0.00019609217,0.079159066,0.0004798744,0.00007229096,0.00012875884,0.00003593774,0.000056194924,0.000024108558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987702,0.00015644313,0.00038147977,0.0002286351,0.000111991365,0.00035127465],"domain_scores_gemma":[0.99808025,0.00022346507,0.000048933987,0.0014526733,0.00008086175,0.00011383779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027531793,0.00020338621,0.00021434655,0.00009676335,0.00023504197,0.000100362515,0.0007003283,0.00006486971,0.0000033459753],"category_scores_gemma":[0.0000010811146,0.00020633751,0.000044557753,0.00015970397,0.00025518436,0.00010657917,0.00011028299,0.00018475563,0.000007991529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024685363,0.00024081451,0.00010597815,0.000022063376,0.0001272945,0.0000027030153,0.0011580355,0.8453472,0.11890072,0.00024169215,0.0007290727,0.033099696],"study_design_scores_gemma":[0.0004143396,0.00007332177,0.00009353726,0.00004487158,0.000021279282,0.00001142984,0.00027312886,0.984233,0.010284633,0.000027612468,0.0042657303,0.00025711677],"about_ca_topic_score_codex":0.000115541574,"about_ca_topic_score_gemma":0.00020473688,"teacher_disagreement_score":0.7815514,"about_ca_system_score_codex":0.00014551483,"about_ca_system_score_gemma":0.000010508821,"threshold_uncertainty_score":0.84142},"labels":[],"label_agreement":null},{"id":"W2883563989","doi":"10.1109/lcomm.2018.2859928","title":"Probability Distribution of the Re-Healing Delay in a One-Way Highway VANET","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Probability distribution; Computer science; Vehicular ad hoc network; Network packet; Expression (computer science); Distribution (mathematics); Closed-form expression; Cluster (spacecraft); Coverage probability; Frequentist probability; Algorithm; Computer network; Wireless ad hoc network; Mathematics; Statistics; Telecommunications; Wireless; Artificial intelligence","score_opus":0.037964721615111906,"score_gpt":0.2413691303418029,"score_spread":0.203404408726691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883563989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9830793,0.0002259376,0.010504596,0.004782193,0.0002803692,0.0004392822,0.000035542493,0.00014789877,0.00050483993],"genre_scores_gemma":[0.99680823,0.000047419046,0.0026964978,0.00025111783,0.000061200284,0.00005428676,0.000057517856,0.000020167021,0.0000035758462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887437,0.0002233936,0.00037288602,0.00013400558,0.00014881104,0.0002465498],"domain_scores_gemma":[0.9974581,0.0001576845,0.00007114402,0.002216139,0.00005982824,0.000037127473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045976118,0.00011807229,0.00015790357,0.000041275267,0.00013285932,0.000017732302,0.000988329,0.0000775797,0.000008900066],"category_scores_gemma":[0.000050158145,0.00010943321,0.00006454299,0.0004687796,0.00033356147,0.00010086389,0.00013337971,0.0003702542,0.00001635808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001323237,0.00016745791,0.0062446073,0.000090319285,0.0000792245,8.500128e-7,0.0012182622,0.927701,0.047470152,0.0012288841,0.013792865,0.0019931702],"study_design_scores_gemma":[0.0007572905,0.000040800172,0.06596642,0.00043740147,0.000068428286,0.000009938769,0.00006021637,0.88099694,0.016278315,0.0009147254,0.03394337,0.00052612467],"about_ca_topic_score_codex":0.00014808885,"about_ca_topic_score_gemma":0.0019730912,"teacher_disagreement_score":0.059721813,"about_ca_system_score_codex":0.00024342684,"about_ca_system_score_gemma":0.000017873446,"threshold_uncertainty_score":0.44625568},"labels":[],"label_agreement":null},{"id":"W2884182684","doi":"10.1109/lcomm.2018.2856746","title":"Bayesian MMSE Estimation of a Gaussian Source in the Presence of Bursty Impulsive Noise","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; École de Technologie Supérieure; Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Minimum mean square error; Estimator; Maximum a posteriori estimation; Computer science; Gaussian noise; Noise (video); Algorithm; Bayesian probability; Statistics; Mean squared error; Mathematics; Gaussian; Artificial intelligence; Maximum likelihood; Physics","score_opus":0.015357388160739909,"score_gpt":0.26386562847685535,"score_spread":0.24850824031611543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884182684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82830197,0.00092843064,0.15511163,0.009895248,0.00016146668,0.00065535796,0.000037364916,0.00012253117,0.004786003],"genre_scores_gemma":[0.9876664,0.00016851399,0.011853856,0.00018578647,0.000020340465,0.00006115679,0.000018627601,0.000016796845,0.0000084811],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990222,0.00020150418,0.00040620964,0.000087307584,0.00013357057,0.00014921172],"domain_scores_gemma":[0.9964741,0.00039151183,0.000116478564,0.0029218553,0.000067898574,0.00002818801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003569328,0.00011022772,0.00015652126,0.00017621653,0.00010298084,0.000015111975,0.0018294739,0.000044470806,0.000009693221],"category_scores_gemma":[0.0000808115,0.0000965898,0.0000569686,0.00055695407,0.00045370113,0.00015266097,0.00011572019,0.00022672236,0.000009386943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010287099,0.0016299402,0.011378786,0.000519945,0.00036151608,0.000003820492,0.096649386,0.33705154,0.4109058,0.006839702,0.031936854,0.10261982],"study_design_scores_gemma":[0.0007110236,0.00008605385,0.022491015,0.00035042517,0.00006515807,0.000013238283,0.0011596074,0.94785905,0.01782611,0.00050008507,0.008554831,0.00038341686],"about_ca_topic_score_codex":0.00019551592,"about_ca_topic_score_gemma":0.00020463737,"teacher_disagreement_score":0.6108075,"about_ca_system_score_codex":0.000034453205,"about_ca_system_score_gemma":0.000018862103,"threshold_uncertainty_score":0.39388177},"labels":[],"label_agreement":null},{"id":"W2890391580","doi":"10.1109/lcomm.2018.2871442","title":"Deep-Learning-Based Channel Estimation for Wireless Energy Transfer","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel state information; Channel (broadcasting); Transmitter; Autoencoder; Energy (signal processing); Deep learning; Wireless; Mean squared error; Scheme (mathematics); Artificial intelligence; Algorithm; Telecommunications; Statistics; Mathematics","score_opus":0.017638090220542194,"score_gpt":0.23461963620059198,"score_spread":0.2169815459800498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890391580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020849185,0.00016009304,0.97583616,0.0014593661,0.00039318544,0.00012770758,0.0000041855546,0.0007243713,0.0004457776],"genre_scores_gemma":[0.97868603,0.00006490255,0.019487236,0.0009431161,0.00021581104,0.00034549442,0.00013881565,0.00008727657,0.000031309155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990767,0.00008929662,0.00026479585,0.00016505299,0.00010846538,0.0002956654],"domain_scores_gemma":[0.99837387,0.0004142518,0.000031004744,0.0010203944,0.000093657196,0.00006684927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000158884,0.00018267671,0.0001593855,0.0001256286,0.00035123256,0.000054050728,0.00072891935,0.00010642454,0.0000075738003],"category_scores_gemma":[0.000025024912,0.00021657902,0.00007882133,0.00026053755,0.00022978113,0.00013239714,0.000021813617,0.00021724238,0.000015461332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006397861,0.000023178043,0.000015885136,0.000026032281,0.000034738256,2.5281707e-7,0.00019035865,0.9788693,0.007582872,0.0008980565,0.0018993522,0.010453558],"study_design_scores_gemma":[0.0003289698,0.00003123968,0.000055770965,0.00006670982,0.000024344363,0.0000015043069,0.000009546431,0.9785576,0.009944928,0.00005375507,0.010689552,0.00023612105],"about_ca_topic_score_codex":0.00002946346,"about_ca_topic_score_gemma":0.00020385419,"teacher_disagreement_score":0.95783687,"about_ca_system_score_codex":0.00008663264,"about_ca_system_score_gemma":0.000012347195,"threshold_uncertainty_score":0.8831836},"labels":[],"label_agreement":null},{"id":"W2890807948","doi":"10.1109/lcomm.2018.2870425","title":"Distributed Resource Allocation for IBFD-Enabled NOMA Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Noma; Computer science; Resource allocation; Computer network; Resource management (computing); Resource (disambiguation); Distributed computing; Telecommunications link","score_opus":0.02770037302485319,"score_gpt":0.25967332111375196,"score_spread":0.2319729480888988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890807948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0139477905,0.001035497,0.9737214,0.006844592,0.00025487837,0.00071140996,0.00011285019,0.0022121053,0.0011595092],"genre_scores_gemma":[0.96342,0.00023320147,0.0347624,0.00022987876,0.00007814053,0.00078498694,0.00039792582,0.00005743203,0.000036078243],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989928,0.0000735398,0.00037868318,0.0001762606,0.000094228555,0.0002845007],"domain_scores_gemma":[0.9954583,0.00037378725,0.00010365416,0.003857906,0.00016049163,0.00004582998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000204076,0.00017848115,0.00018906771,0.00015986332,0.00043175626,0.00007514681,0.0020768612,0.000110427776,0.0000032870184],"category_scores_gemma":[0.000108557295,0.00020400553,0.00005822956,0.00044020507,0.0003982733,0.00021452333,0.00017246303,0.00023653447,0.000055250104],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040510815,0.00019827869,0.00041958469,0.0002657489,0.0003827054,5.4765144e-7,0.0011205606,0.18842155,0.5070898,0.079557836,0.18980648,0.03269638],"study_design_scores_gemma":[0.0005818612,0.000041226693,0.00017289793,0.00009368883,0.000027794576,0.0000046586124,0.0004357124,0.31866935,0.024778698,0.0007159454,0.6540045,0.00047364054],"about_ca_topic_score_codex":0.000015701897,"about_ca_topic_score_gemma":0.000019553481,"teacher_disagreement_score":0.9494722,"about_ca_system_score_codex":0.00021340801,"about_ca_system_score_gemma":0.000012036958,"threshold_uncertainty_score":0.8319104},"labels":[],"label_agreement":null},{"id":"W2894608018","doi":"10.1109/lcomm.2018.2873725","title":"Physical Layer Security For Dual-Hop VLC/RF Communication Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Department of Education of Guangdong Province; Southeast University; National Natural Science Foundation of China","keywords":"Visible light communication; Physical layer; Computer science; Radio frequency; Relay; Secrecy; Computer network; Communications system; Energy (signal processing); Electronic engineering; Wireless; Telecommunications; Mathematics; Optics; Light-emitting diode; Physics; Computer security; Engineering; Power (physics)","score_opus":0.028086067547027208,"score_gpt":0.27084447492995783,"score_spread":0.24275840738293064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894608018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8857594,0.0022420594,0.08979348,0.00508501,0.0017973452,0.0011005293,0.00009991354,0.0022948317,0.011827413],"genre_scores_gemma":[0.99052703,0.0001727907,0.007663667,0.0003751153,0.000581738,0.00042860277,0.0001262355,0.0000822474,0.000042584314],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887973,0.0001610782,0.0003226316,0.0001832987,0.00012763674,0.00032564916],"domain_scores_gemma":[0.995816,0.0007178428,0.000089084264,0.003142382,0.00015501525,0.00007967294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003118183,0.0002075971,0.00023139027,0.000090312125,0.00044570773,0.00011459268,0.0012678495,0.000103492974,0.0000033040592],"category_scores_gemma":[0.000047707254,0.00023616428,0.00009246427,0.00028978678,0.00038357003,0.0002236542,0.0001640385,0.00037661655,0.00006572307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027085674,0.00044013988,0.0006490372,0.00029022904,0.0005634394,0.0000012830671,0.007678343,0.3198855,0.1829113,0.080270045,0.403384,0.0038996025],"study_design_scores_gemma":[0.00042330055,0.000030695355,0.000113660164,0.00017869737,0.00005511371,0.0000063224225,0.000090230744,0.89855415,0.0038402064,0.0006775259,0.09559021,0.0004398907],"about_ca_topic_score_codex":0.000080702164,"about_ca_topic_score_gemma":0.000089220586,"teacher_disagreement_score":0.57866865,"about_ca_system_score_codex":0.00013331299,"about_ca_system_score_gemma":0.00001298116,"threshold_uncertainty_score":0.96305},"labels":[],"label_agreement":null},{"id":"W2896051417","doi":"10.1109/lcomm.2018.2876441","title":"Adaptive Rate and Energy Harvesting Interval Control Based on Reinforcement Learning for SWIPT","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fading; Markov decision process; Reinforcement learning; Mathematical optimization; Markov process; Interval (graph theory); Energy harvesting; Wireless; Power control; Energy (signal processing); Control theory (sociology); Throughput; Channel (broadcasting); Power (physics); Artificial intelligence; Mathematics; Control (management); Telecommunications; Statistics","score_opus":0.022518017379840497,"score_gpt":0.23467164536386903,"score_spread":0.21215362798402854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896051417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014322684,0.00008988805,0.9805938,0.0014469358,0.00031103243,0.00013595492,0.00000327288,0.00041174915,0.0026846954],"genre_scores_gemma":[0.98534995,0.000026170976,0.011677661,0.0023495848,0.00018410929,0.0001923981,0.00002556071,0.000053866774,0.00014070435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990845,0.00014588854,0.00026169253,0.00016363215,0.000079321486,0.00026499756],"domain_scores_gemma":[0.99798244,0.0010781244,0.00008124576,0.0007180554,0.000073614596,0.000066489636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031142303,0.00017450178,0.00016742878,0.00010558593,0.00034673177,0.000070658934,0.00042064517,0.00005949675,0.000004225706],"category_scores_gemma":[0.00010817628,0.00019380411,0.000048750608,0.0001233018,0.00021259216,0.00011840609,0.00004775384,0.00025401197,0.0000049681844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025629164,0.000008445578,0.000101099664,0.000011139692,0.00004552025,4.484735e-7,0.00010708224,0.98352766,0.008073526,0.0007050585,0.0013267258,0.006067662],"study_design_scores_gemma":[0.0006413089,0.00012358578,0.00016345934,0.00017647404,0.000022526263,0.000001071801,0.000018999468,0.9846438,0.0016188592,0.000014231959,0.012378426,0.00019723359],"about_ca_topic_score_codex":0.00005326131,"about_ca_topic_score_gemma":0.00008334702,"teacher_disagreement_score":0.97102726,"about_ca_system_score_codex":0.00008913115,"about_ca_system_score_gemma":0.000011352032,"threshold_uncertainty_score":0.7903102},"labels":[],"label_agreement":null},{"id":"W2896806510","doi":"10.1109/lcomm.2018.2876869","title":"Outage Performance of UAV-Assisted Relaying Systems With RF Energy Harvesting","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Department of Education of Guangdong Province; Southeast University; National Natural Science Foundation of China","keywords":"Rician fading; Computer science; Fading; Energy harvesting; Rayleigh fading; Outage probability; Monte Carlo method; Weibull fading; Energy (signal processing); Channel (broadcasting); Shadow mapping; Wireless; Communications system; Electronic engineering; Telecommunications; Statistics; Engineering; Mathematics","score_opus":0.019264968404093263,"score_gpt":0.2101015709879745,"score_spread":0.19083660258388124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896806510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8125767,0.00028722626,0.17790426,0.0004082995,0.00016145922,0.00018748382,0.0000103621305,0.00035778733,0.008106437],"genre_scores_gemma":[0.97870415,0.0001248952,0.020799115,0.0000901046,0.000047840604,0.00008998143,0.00003057798,0.000032352087,0.00008097199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993612,0.000029638455,0.00026842154,0.00010155876,0.000098757024,0.00014042029],"domain_scores_gemma":[0.9985141,0.000068655456,0.000094874296,0.0011825319,0.000105722334,0.0000341089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105469495,0.000105714505,0.00012403092,0.000107990905,0.00022059355,0.00003892747,0.00047571614,0.000041210464,0.000003956],"category_scores_gemma":[0.000005641594,0.00010408675,0.000021057627,0.00039408568,0.00017154615,0.00019134066,0.00003766937,0.00010315309,0.000011295832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022842074,0.00012149318,0.010581511,0.00026636673,0.0002284462,9.356426e-7,0.0017245583,0.7054088,0.25997376,0.0027914667,0.0035986865,0.015281104],"study_design_scores_gemma":[0.00029540944,0.00005051327,0.004425958,0.00022669406,0.000043356555,0.000017169381,0.00014000558,0.9741129,0.006630945,0.0000018262341,0.0137766665,0.00027850916],"about_ca_topic_score_codex":0.00014840692,"about_ca_topic_score_gemma":0.00006259463,"teacher_disagreement_score":0.26870412,"about_ca_system_score_codex":0.000056494606,"about_ca_system_score_gemma":0.000011622488,"threshold_uncertainty_score":0.42445344},"labels":[],"label_agreement":null},{"id":"W2898896200","doi":"10.1109/lcomm.2018.2878714","title":"On the Detection of Passive Malicious Providers in Cloud Federations","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cloud computing; Computer science; Service provider; Profit maximization; Computer security; Competitor analysis; Profit (economics); Game theory; Computer network; Service (business); Business; Microeconomics","score_opus":0.018468559841369424,"score_gpt":0.2512746251500759,"score_spread":0.2328060653087065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898896200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30694348,0.000046719982,0.5293931,0.16201898,0.0001677274,0.00051275175,0.0000030180906,0.00014697427,0.0007672536],"genre_scores_gemma":[0.9925766,0.000019799321,0.0039000558,0.00321532,0.000022744434,0.00025047592,0.0000012820652,0.0000053805948,0.000008333227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991572,0.00017733409,0.00023911642,0.00018212118,0.00010372086,0.00014052574],"domain_scores_gemma":[0.996791,0.0004061188,0.00013195587,0.0025615937,0.00009090172,0.000018450335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024894087,0.00008381424,0.00009073521,0.0001617243,0.0005141839,0.000052782623,0.0019767173,0.000066482186,0.0000028455377],"category_scores_gemma":[0.00007317217,0.00006948223,0.00003857681,0.0006809586,0.00052534667,0.00011471602,0.00019298136,0.00028368915,0.000032309876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064042683,0.00030981025,0.00015439645,0.00000469181,0.000029975265,6.751741e-7,0.0029158404,0.00011874031,0.092888944,0.8733698,0.0050000492,0.025200674],"study_design_scores_gemma":[0.0016960254,0.0007277059,0.010321841,0.00018925192,0.00004554238,0.00005299429,0.0013316134,0.2890439,0.46795857,0.18198715,0.045463897,0.001181524],"about_ca_topic_score_codex":0.00015876807,"about_ca_topic_score_gemma":0.0009679765,"teacher_disagreement_score":0.69138265,"about_ca_system_score_codex":0.00005630414,"about_ca_system_score_gemma":0.000029053555,"threshold_uncertainty_score":0.39547387},"labels":[],"label_agreement":null},{"id":"W2899127396","doi":"10.1109/lcomm.2018.2878704","title":"Enhanced Gaussian Process-Based Localization Using a Low Power Wide Area Network","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"LPWAN; Computer science; Throughput; Network packet; Real-time computing; Computer network; Packet loss; Physical layer; Mean squared error; Wide area network; Telecommunications; Wireless; Statistics","score_opus":0.01840436064994636,"score_gpt":0.2579601780426334,"score_spread":0.23955581739268703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899127396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081478946,0.00010991964,0.91442305,0.00085275626,0.0003258621,0.00022462002,0.000004985844,0.0010610239,0.0015188667],"genre_scores_gemma":[0.9900149,0.000025280988,0.0074744704,0.002286292,0.000055935798,0.000048451147,0.000038593666,0.00004994571,0.0000061025053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990439,0.00004597556,0.0002937361,0.00016145683,0.000140578,0.00031437547],"domain_scores_gemma":[0.99836844,0.00007615373,0.00007208947,0.00131066,0.00012870294,0.00004395776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010647414,0.00018137599,0.00015640029,0.00015219045,0.00038674843,0.000062405656,0.00074684946,0.000118823504,0.000050122537],"category_scores_gemma":[0.000051895415,0.00019469763,0.000050317798,0.00077294384,0.0003615171,0.00017596163,0.000043842687,0.00019251947,0.00004861615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010420466,0.0000406761,0.0015083175,0.000048740207,0.00004285563,0.0000011277482,0.00065312226,0.9673149,0.022119673,0.00035842098,0.007289351,0.0006123949],"study_design_scores_gemma":[0.0003455827,0.000022204602,0.00022128089,0.0002003535,0.000026667747,0.0000021025207,0.00012814783,0.8947327,0.09998023,0.00027545783,0.0036755875,0.0003896539],"about_ca_topic_score_codex":0.000008070511,"about_ca_topic_score_gemma":0.000042628624,"teacher_disagreement_score":0.90853596,"about_ca_system_score_codex":0.00011849894,"about_ca_system_score_gemma":0.00003147637,"threshold_uncertainty_score":0.7939539},"labels":[],"label_agreement":null},{"id":"W2901302572","doi":"10.1109/lcomm.2018.2882387","title":"Contract-Based Incentive Mechanism for Cooperative NOMA Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Noma; Base station; Incentive; Adverse selection; Contract theory; Channel state information; Computer network; Wireless; Selection (genetic algorithm); Mechanism design; Set (abstract data type); Channel (broadcasting); Process (computing); Incentive compatibility; Mathematical optimization; Business; Telecommunications; Telecommunications link; Microeconomics; Finance; Artificial intelligence","score_opus":0.029838795731685623,"score_gpt":0.2722240139433533,"score_spread":0.2423852182116677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901302572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015851699,0.00044618058,0.9767428,0.0035437073,0.0004026794,0.0008257271,0.00010450753,0.0012964322,0.00078627956],"genre_scores_gemma":[0.9432455,0.00014990044,0.054782525,0.00067953597,0.000045938752,0.0009662742,0.000067276254,0.000049300837,0.000013798273],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910754,0.000079154925,0.00031427908,0.00016324832,0.00008266772,0.0002530978],"domain_scores_gemma":[0.99646026,0.00050552725,0.00009322486,0.0025710594,0.00032933842,0.000040592942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012658851,0.00018513383,0.0002103655,0.00014702302,0.00040631235,0.000066001856,0.0016260088,0.00009947639,0.0000053755207],"category_scores_gemma":[0.00009027277,0.0002026399,0.00005785915,0.00026992807,0.0004727292,0.00020432897,0.00010315606,0.0002453542,0.000054791915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027558868,0.00014450648,0.000097459495,0.000078717305,0.00024939983,5.83574e-7,0.00082469406,0.04019023,0.53976804,0.40303153,0.008515892,0.007071416],"study_design_scores_gemma":[0.0010119601,0.00008429835,0.000045171924,0.000113747876,0.000027973369,0.0000016326869,0.00039255986,0.7629834,0.20545158,0.0013201385,0.028052548,0.00051498966],"about_ca_topic_score_codex":0.000022378617,"about_ca_topic_score_gemma":0.000046055586,"teacher_disagreement_score":0.92739373,"about_ca_system_score_codex":0.00018888203,"about_ca_system_score_gemma":0.000021953369,"threshold_uncertainty_score":0.8263415},"labels":[],"label_agreement":null},{"id":"W2902345525","doi":"10.1109/lcomm.2018.2883432","title":"Joint Transmit Power and Time-Switching Control for Device-to-Device Communications in SWIPT Cellular Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Research Foundation of Korea","keywords":"Computer science; Power control; Cellular network; Computer network; Transmitter power output; Wireless; Transmission (telecommunications); Fading; Maximum power transfer theorem; Maximization; Throughput; Joint (building); Cellular communication; Power (physics); Electronic engineering; Telecommunications; Channel (broadcasting); Transmitter; Engineering; Mathematics; Mathematical optimization","score_opus":0.02311689086139127,"score_gpt":0.24644453132982205,"score_spread":0.2233276404684308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902345525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19386569,0.0028206087,0.7844871,0.01434736,0.0003879139,0.0012633847,0.000024440027,0.00065386924,0.0021496238],"genre_scores_gemma":[0.9547705,0.00019766536,0.041035913,0.0033471652,0.000120909644,0.00037258296,0.000037763868,0.00009727053,0.000020225543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983801,0.00021641461,0.00056782574,0.00025853157,0.00011186587,0.0004652423],"domain_scores_gemma":[0.9958212,0.00095933786,0.00008267947,0.002891707,0.000101572485,0.00014351396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006313293,0.00026885845,0.00034331682,0.00021780048,0.0004170183,0.00010877014,0.001568844,0.00014493127,0.000008523501],"category_scores_gemma":[0.000054404496,0.0003177336,0.00008061091,0.0004563638,0.00023731569,0.00020518278,0.00016163176,0.0005635514,0.000033333377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000448578,0.00020039552,0.0016887266,0.000106417065,0.00033704212,0.000003125531,0.0042217835,0.71321183,0.2531598,0.0029049022,0.011353812,0.012767328],"study_design_scores_gemma":[0.0008581707,0.0000392444,0.0013147122,0.00029309103,0.00005453748,0.0000044438007,0.000050492723,0.97118646,0.0006714982,0.00006668934,0.025014943,0.00044570232],"about_ca_topic_score_codex":0.00007600775,"about_ca_topic_score_gemma":0.0005577739,"teacher_disagreement_score":0.76090485,"about_ca_system_score_codex":0.00012564697,"about_ca_system_score_gemma":0.000016788963,"threshold_uncertainty_score":0.99992746},"labels":[],"label_agreement":null},{"id":"W2907331177","doi":"10.1109/lcomm.2018.2890223","title":"A Cache-Level Quality of Experience Metric to Characterize ICNs for Adaptive Streaming","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Quality of experience; Metric (unit); Benchmark (surveying); Computer network; Cache algorithms; CPU cache; Quality of service","score_opus":0.23308534621945545,"score_gpt":0.3574024185030219,"score_spread":0.12431707228356645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907331177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42416307,0.00003111134,0.57100004,0.0041882345,0.00017180631,0.00020553161,0.000037789043,0.000055636367,0.00014676785],"genre_scores_gemma":[0.919816,0.0000067952283,0.077623196,0.002321485,0.00004453845,0.00012856621,0.0000055965124,0.000007250969,0.000046568093],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99883115,0.00017099566,0.00034293407,0.00026302278,0.00018216933,0.00020971608],"domain_scores_gemma":[0.9966582,0.00056113064,0.00018003598,0.0022838844,0.00024132954,0.00007540629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004346625,0.00011223763,0.00019134706,0.00021891276,0.00027591968,0.000060912167,0.0025579599,0.00003128054,0.000001650704],"category_scores_gemma":[0.00017834952,0.000116749325,0.000099629084,0.00063846685,0.00017154319,0.00031456686,0.00040597073,0.000100918594,0.000014513091],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005823713,0.00026839154,0.0011992087,0.000018658398,0.00008719505,5.9196685e-7,0.017591411,0.0000386969,0.9023838,0.013309685,0.0018973835,0.063146725],"study_design_scores_gemma":[0.00692342,0.0028535025,0.3706548,0.0010325796,0.00021784505,0.000050759496,0.008759239,0.28442112,0.2761829,0.0015680884,0.04203407,0.005301697],"about_ca_topic_score_codex":0.0007397312,"about_ca_topic_score_gemma":0.00012314059,"teacher_disagreement_score":0.6262009,"about_ca_system_score_codex":0.00006921943,"about_ca_system_score_gemma":0.000038328868,"threshold_uncertainty_score":0.47608992},"labels":[],"label_agreement":null},{"id":"W2911232490","doi":"10.1109/lcomm.2019.2896929","title":"Collaborative Distributed Q-Learning for RACH Congestion Minimization in Cellular IoT Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer network; Aloha; Random access; Scheme (mathematics); Channel (broadcasting); Network congestion; Minification; Throughput; Distributed computing; Wireless; Telecommunications; Network packet","score_opus":0.010604591661533604,"score_gpt":0.24165670078773052,"score_spread":0.23105210912619692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911232490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20132327,0.0008892278,0.7800005,0.0037878354,0.00068307825,0.0121529745,0.00003569435,0.00045757458,0.00066982186],"genre_scores_gemma":[0.99252933,0.00008696121,0.003989263,0.00020849766,0.00007146689,0.0024628458,0.00058903184,0.000034207627,0.000028371438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922216,0.00014041207,0.00024973296,0.00012060762,0.00006202706,0.00020504917],"domain_scores_gemma":[0.99893904,0.00034201832,0.00006331488,0.0005546595,0.0000708122,0.000030151716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020782358,0.0001214408,0.00015735073,0.000078307545,0.000107832675,0.000052062915,0.00032538857,0.00009957295,0.0000130798635],"category_scores_gemma":[0.000020761801,0.00014173833,0.0000353067,0.0004497423,0.000036408936,0.00009331199,0.000027040629,0.00029833292,0.000016145486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014327309,0.000014803897,0.0022756204,0.000021645397,0.000016499598,2.2532292e-7,0.00017808417,0.9881338,0.0043967585,0.00015776008,0.0038392993,0.00095117785],"study_design_scores_gemma":[0.0006075979,0.000022691815,0.0013564128,0.00007605741,0.000009597866,3.6378245e-7,0.00006734909,0.95636445,0.000485893,0.000022313625,0.040810972,0.00017631295],"about_ca_topic_score_codex":0.000006648182,"about_ca_topic_score_gemma":0.000022772809,"teacher_disagreement_score":0.79120606,"about_ca_system_score_codex":0.0001105702,"about_ca_system_score_gemma":0.000012098301,"threshold_uncertainty_score":0.57799214},"labels":[],"label_agreement":null},{"id":"W2911913033","doi":"10.1109/lcomm.2019.2895819","title":"An Efficient Dynamic Anti-Collision Protocol for Mobile RFID Tags Identification","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"RFID technology advancements","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Collision; Radio-frequency identification; Identification (biology); Protocol (science); Reading (process); Computer network; Collision problem; Embedded system; Real-time computing; Computer security","score_opus":0.013027738590323724,"score_gpt":0.3176021723158231,"score_spread":0.30457443372549936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911913033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.796193,0.000020548014,0.0974249,0.00056320144,0.0003071605,0.10451564,0.00003561023,0.0008409713,0.00009893742],"genre_scores_gemma":[0.74535936,0.0000059142253,0.01038379,0.0000960441,0.000008117935,0.24400568,0.0000747486,0.00004124165,0.000025084875],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990552,0.00004197802,0.00033431346,0.00022282031,0.000119598844,0.00022606736],"domain_scores_gemma":[0.99699086,0.00007219677,0.00009059128,0.0027486254,0.00006271912,0.000035031924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019643991,0.00014781811,0.00014349793,0.00018749574,0.0001667409,0.000044489516,0.0011872527,0.00008961518,0.000012508447],"category_scores_gemma":[0.000009617649,0.00016644316,0.000049688577,0.00026907562,0.000087742985,0.00021902153,0.00005905825,0.0001927644,0.00017733984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061950295,0.00012715273,0.0003755744,0.00006095116,0.000019015863,1.2700072e-7,0.00009820807,0.3728079,0.62383693,0.00014432517,0.00065786194,0.0018657562],"study_design_scores_gemma":[0.0013319884,0.00007505178,0.002837471,0.00007290295,0.00001693315,0.0000029689895,0.00008529505,0.8961742,0.06497641,0.00009235722,0.033965714,0.0003687479],"about_ca_topic_score_codex":0.0000025486063,"about_ca_topic_score_gemma":0.000005321831,"teacher_disagreement_score":0.55886054,"about_ca_system_score_codex":0.00017923902,"about_ca_system_score_gemma":0.000009535053,"threshold_uncertainty_score":0.67873555},"labels":[],"label_agreement":null},{"id":"W2913328761","doi":"10.1109/lcomm.2019.2895631","title":"Multiuser Diversity in Network-Coded Cooperation: Outage and Diversity Analysis","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh fading; Computer science; Relay; Independent and identically distributed random variables; Outage probability; Diversity (politics); Fading; Diversity gain; Function (biology); Cooperative diversity; Algorithm; Telecommunications; Statistics; Mathematics; Decoding methods; Random variable; Physics","score_opus":0.05467499295677989,"score_gpt":0.2726342791329736,"score_spread":0.21795928617619373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913328761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8263167,0.00069773156,0.15582839,0.0149637,0.00022529461,0.0004787614,0.0000047756384,0.00017478569,0.0013098585],"genre_scores_gemma":[0.9818355,0.00091650843,0.013647533,0.0034028403,0.000015442029,0.000011093037,0.000018825525,0.0000053551216,0.00014691797],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848694,0.00048724763,0.000256099,0.0003460217,0.00017825738,0.00024546764],"domain_scores_gemma":[0.9965913,0.00031574516,0.00010522301,0.0028042523,0.00010476627,0.00007867587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005824369,0.00015080525,0.00026022224,0.000265743,0.0011762207,0.00015216447,0.002894986,0.00005640719,0.000032363012],"category_scores_gemma":[0.000018957266,0.00016543469,0.00008491641,0.001695853,0.00013046616,0.00067695463,0.007528535,0.00032990938,0.00005321532],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013987228,0.00017123643,0.92986345,0.000008970257,0.00032610327,0.000004516521,0.009587921,0.030723264,0.0017393236,0.01908242,0.0024937885,0.0059850137],"study_design_scores_gemma":[0.0012853148,0.000028332786,0.3556516,0.000038893388,0.00010839345,0.00000283091,0.00009742157,0.63727355,0.0000654186,0.00015257185,0.0047342354,0.00056146167],"about_ca_topic_score_codex":0.00017326364,"about_ca_topic_score_gemma":0.001844532,"teacher_disagreement_score":0.6065503,"about_ca_system_score_codex":0.00009998387,"about_ca_system_score_gemma":0.000018201748,"threshold_uncertainty_score":0.93837804},"labels":[],"label_agreement":null},{"id":"W2942184420","doi":"10.1109/lcomm.2019.2913424","title":"Energy-Efficient Power Allocation for Cooperative NOMA Systems With IBFD-Enabled Two-Way Cognitive Transmission","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Spectral efficiency; Noma; Transmission (telecommunications); Efficient energy use; Wireless; Relay; Telecommunications link; Mathematical optimization; Computer network; Channel (broadcasting); Power (physics); Telecommunications; Mathematics","score_opus":0.013036629716214793,"score_gpt":0.23754286952489534,"score_spread":0.22450623980868054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942184420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08685816,0.0013278024,0.9064471,0.0017314911,0.00015180794,0.0011282604,0.000037355647,0.0008601667,0.0014578265],"genre_scores_gemma":[0.9849168,0.00033008461,0.013042182,0.00024885312,0.000011262403,0.0011148533,0.00016554003,0.00007674446,0.00009366584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987913,0.00011661455,0.0003644543,0.00026049194,0.00017093867,0.00029620036],"domain_scores_gemma":[0.99695426,0.0005935241,0.00011706511,0.0020031424,0.0002751431,0.000056869798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015851604,0.0002647561,0.00027637905,0.00020917773,0.00028259124,0.00007199966,0.0011018878,0.0000981594,0.000010929959],"category_scores_gemma":[0.000017941462,0.0002459619,0.00006101746,0.00044002623,0.0002108966,0.0002289339,0.00007877461,0.00029857186,0.000037582802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050964187,0.00010920539,0.000049760798,0.00005679787,0.00014212281,4.748064e-7,0.000890389,0.85926473,0.12738755,0.006010907,0.00056887674,0.005468217],"study_design_scores_gemma":[0.0022911194,0.00014694627,0.00010653018,0.00048504522,0.000050006598,0.00001127673,0.002150818,0.9215183,0.053054135,0.000047920235,0.01944967,0.0006882148],"about_ca_topic_score_codex":0.000024437877,"about_ca_topic_score_gemma":0.000015772719,"teacher_disagreement_score":0.89805865,"about_ca_system_score_codex":0.00019623323,"about_ca_system_score_gemma":0.000029393295,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W2942720829","doi":"10.1109/lcomm.2019.2914196","title":"Bringing the Functionality of Tag Sampling to Reality for COTS RFID Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"RFID technology advancements","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Key Research and Development Program of China; Natural Science Foundation of Tianjin City; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Sampling (signal processing); Sample (material); Scheme (mathematics); Sampling scheme; Real-time computing; Embedded system; Telecommunications","score_opus":0.05887943769268173,"score_gpt":0.30281706895173693,"score_spread":0.2439376312590552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942720829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4864087,0.00035730324,0.50444716,0.005693159,0.00085017656,0.0010629862,0.00008474039,0.0003218,0.00077395665],"genre_scores_gemma":[0.98972714,0.000021518239,0.009644766,0.000298339,0.00002321355,0.00021364418,0.000024601684,0.000019931495,0.000026857642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999338,0.00003817725,0.00026773423,0.00011141792,0.00008394369,0.00016078397],"domain_scores_gemma":[0.99764585,0.0003529861,0.00006214407,0.0018577314,0.00005972183,0.000021561977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003511966,0.000088166125,0.00013755354,0.00007317703,0.00012166813,0.000015201636,0.0008219207,0.000041843494,0.0000038371104],"category_scores_gemma":[0.00004193928,0.00008483104,0.000045098495,0.00020549685,0.00006790698,0.00007830929,0.00009451557,0.00015900056,0.000021892856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013152798,0.000042751544,0.012510436,0.00024963036,0.00020879775,5.6453537e-8,0.0003387189,0.54745877,0.41223776,0.017034745,0.0070209615,0.0028842126],"study_design_scores_gemma":[0.0020744223,0.00009886042,0.044557743,0.00068950985,0.00017093642,0.000013352943,0.0008567082,0.25081462,0.03320358,0.002727591,0.6635216,0.001271085],"about_ca_topic_score_codex":0.000052299685,"about_ca_topic_score_gemma":0.000014352385,"teacher_disagreement_score":0.65650064,"about_ca_system_score_codex":0.000104380495,"about_ca_system_score_gemma":0.0000068134427,"threshold_uncertainty_score":0.3459309},"labels":[],"label_agreement":null},{"id":"W2944976497","doi":"10.1109/lcomm.2019.2917431","title":"Low Complexity Algorithms for Robust Multigroup Multicast Beamforming","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Beamforming; Multicast; Computational complexity theory; Mathematical optimization; Computer science; Relaxation (psychology); Algorithm; MIMO; Mathematics; Telecommunications; Distributed computing","score_opus":0.057091111863490314,"score_gpt":0.2770500401936769,"score_spread":0.2199589283301866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944976497","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015792726,0.000101487945,0.9811142,0.00055691774,0.0005477873,0.0009782015,0.00005616957,0.00044481372,0.00040771576],"genre_scores_gemma":[0.4179705,0.000035656692,0.5812655,0.00021565279,0.000059468282,0.00019581577,0.0001463944,0.00006111912,0.00004990767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999111,0.000033486132,0.00032601206,0.0001716251,0.00008462075,0.0002732647],"domain_scores_gemma":[0.99806046,0.0002380598,0.00006967441,0.0015007016,0.00007252911,0.00005857857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013602653,0.00017253708,0.00020234105,0.00010551217,0.00017364809,0.00003949241,0.0006720821,0.00006559261,0.000011634372],"category_scores_gemma":[0.00002333941,0.00020025572,0.000078030345,0.00017658641,0.00009554577,0.0003313137,0.000065123364,0.00018939639,0.000100564175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003402886,0.000035976827,0.00011462928,0.00011461502,0.000030183515,1.6856642e-7,0.00036111393,0.9487144,0.046348855,0.00020606717,0.0007983019,0.0032723127],"study_design_scores_gemma":[0.0006164435,0.000010503263,0.00008646491,0.000069839734,0.000012943602,0.0000040602076,0.00012596443,0.99310005,0.002610312,0.000016789389,0.0030944261,0.00025222191],"about_ca_topic_score_codex":0.000020876796,"about_ca_topic_score_gemma":0.000039340175,"teacher_disagreement_score":0.40217778,"about_ca_system_score_codex":0.0001654593,"about_ca_system_score_gemma":0.0000068863983,"threshold_uncertainty_score":0.8166191},"labels":[],"label_agreement":null},{"id":"W2945530546","doi":"10.1109/lcomm.2019.2917085","title":"Non-Coherent Index Modulation in Rayleigh Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rayleigh fading; Demodulation; Metric (unit); Modulation (music); Fading; Signal-to-noise ratio (imaging); Computer science; Modulation index; Algorithm; Mathematics; Statistics; Telecommunications; Channel (broadcasting); Physics; Decoding methods; Engineering; Acoustics","score_opus":0.019516853810657608,"score_gpt":0.24841394547248574,"score_spread":0.22889709166182814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945530546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88897824,0.0003260021,0.105166554,0.0021479134,0.0003406802,0.00054701266,0.0000037120776,0.00079103187,0.0016988541],"genre_scores_gemma":[0.99326056,0.00048167247,0.005766292,0.00017728512,0.000013932421,0.0002013069,0.000027308984,0.00004352882,0.000028103053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909407,0.000041446066,0.00033867403,0.00016055518,0.00012036272,0.00024489066],"domain_scores_gemma":[0.996876,0.00013853025,0.0000638652,0.0028653867,0.000028418686,0.00002781438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012932152,0.00016605725,0.00019641979,0.0003615159,0.00007964356,0.0000346381,0.0015055533,0.00010402983,0.000018632214],"category_scores_gemma":[0.000013727903,0.00019739909,0.00004622369,0.0005235639,0.000088244786,0.00034359316,0.00021597353,0.0004934168,0.00016375739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001950165,0.000025087655,0.009588341,0.000020267835,0.000015100292,3.2803032e-7,0.00038057985,0.89632905,0.086432524,0.00040428873,0.00029067884,0.0065117944],"study_design_scores_gemma":[0.00059707416,0.000010131601,0.017528221,0.00013609887,0.000003007473,0.0000023705243,0.00024359641,0.9643717,0.012492724,0.00064096117,0.003567401,0.00040670458],"about_ca_topic_score_codex":0.000027792428,"about_ca_topic_score_gemma":0.000038390415,"teacher_disagreement_score":0.104282334,"about_ca_system_score_codex":0.00024353414,"about_ca_system_score_gemma":0.000007239442,"threshold_uncertainty_score":0.80497015},"labels":[],"label_agreement":null},{"id":"W2945629519","doi":"10.1109/lcomm.2019.2917684","title":"Fast-OFDM With Index Modulation for NB-IoT","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Orthogonal frequency-division multiplexing; Spectral efficiency; Computer science; Modulation (music); Electronic engineering; Bandwidth (computing); Narrowband; Constellation; Bit error rate; Telecommunications; Channel (broadcasting); Engineering","score_opus":0.01638675139818752,"score_gpt":0.24042119169931556,"score_spread":0.22403444030112804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945629519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18537636,0.0002812631,0.807165,0.0041680397,0.000117970514,0.00072403485,0.00001764464,0.0012674467,0.0008821793],"genre_scores_gemma":[0.9119325,0.00014814496,0.08713002,0.00026675026,0.000012789484,0.000350065,0.00005299673,0.000053840555,0.000052862695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992742,0.000029319293,0.00022789236,0.000149988,0.00010915862,0.00020943061],"domain_scores_gemma":[0.9963055,0.00025095275,0.00007333478,0.0032729935,0.00006902492,0.000028143797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008543517,0.00015888525,0.00016730982,0.00017422352,0.00014135509,0.000033244483,0.0013691229,0.00008213647,0.000008676502],"category_scores_gemma":[0.00001672096,0.00016255476,0.000046219684,0.0003100668,0.00014081129,0.00020535346,0.000113162016,0.000283736,0.00006110554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011021982,0.000025909638,0.0020314432,0.000036705984,0.00005306821,9.607435e-8,0.00017472016,0.91563183,0.053067017,0.002263002,0.0010791135,0.025626043],"study_design_scores_gemma":[0.0012422139,0.00005646964,0.005593214,0.00010427937,0.000014484012,0.0000059006034,0.0003553064,0.9433386,0.011928956,0.0010085593,0.035739414,0.00061261136],"about_ca_topic_score_codex":0.0000071386376,"about_ca_topic_score_gemma":0.00003014192,"teacher_disagreement_score":0.7265562,"about_ca_system_score_codex":0.00011855828,"about_ca_system_score_gemma":0.000010228044,"threshold_uncertainty_score":0.66287905},"labels":[],"label_agreement":null},{"id":"W2947899572","doi":"10.1109/lcomm.2019.2920347","title":"Secrecy Performance of Correlated $\\alpha$ -$\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Secrecy; Fading; Computer science; Channel (broadcasting); Telecommunications; Topology (electrical circuits); Computer network; Mathematics; Computer security; Combinatorics","score_opus":0.01793768378011158,"score_gpt":0.2364878587204194,"score_spread":0.21855017494030785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947899572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896677,0.00054375466,0.0029596654,0.001021444,0.0003036153,0.00034018527,0.000008498669,0.0007242057,0.004430907],"genre_scores_gemma":[0.9936668,0.0010870907,0.004765261,0.00023854624,0.000015293741,0.000067310706,0.000043975924,0.000048739417,0.000066978726],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989917,0.00008458811,0.00042673887,0.00012366615,0.00015704063,0.0002162243],"domain_scores_gemma":[0.99657893,0.00016728955,0.000111748726,0.0030120406,0.000083006526,0.00004700579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002419094,0.00016737965,0.00024481202,0.0002357191,0.00015791423,0.000021434642,0.0018337923,0.00010225536,0.00005285189],"category_scores_gemma":[0.000011368829,0.00019833611,0.00007704449,0.00044214446,0.00013304825,0.0003179308,0.00028495165,0.0004846253,0.00011649486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020853537,0.00023171437,0.01419005,0.00036741229,0.00028401415,7.4425066e-7,0.0074083013,0.08389918,0.8697593,0.005501792,0.008186193,0.010150442],"study_design_scores_gemma":[0.0009028722,0.00013066479,0.0045158537,0.0007393534,0.00005541961,0.000022935892,0.00018808077,0.7346248,0.22350794,0.0001952785,0.03414093,0.0009758699],"about_ca_topic_score_codex":0.000023509936,"about_ca_topic_score_gemma":0.0000042051965,"teacher_disagreement_score":0.6507256,"about_ca_system_score_codex":0.00009812621,"about_ca_system_score_gemma":0.000012872754,"threshold_uncertainty_score":0.8087912},"labels":[],"label_agreement":null},{"id":"W2969069694","doi":"10.1109/lcomm.2019.2933828","title":"Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Trillium Foundation","keywords":"Low-density parity-check code; Tanner graph; Girth (graph theory); Block code; Linear code; Code (set theory); Tornado code; Computer science; Concatenated error correction code; Mathematics; Discrete mathematics; Raptor code; Combinatorics; Decoding methods; Algorithm; Set (abstract data type)","score_opus":0.03327658837706519,"score_gpt":0.2668818608246346,"score_spread":0.23360527244756943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969069694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6420605,0.000121546225,0.3488996,0.005687529,0.00037346795,0.0003158603,0.000010509479,0.0003285466,0.0022023995],"genre_scores_gemma":[0.6592856,0.00003655358,0.3403941,0.0002464015,0.0000052672353,0.000012590582,0.0000030466167,0.000007784881,0.000008637279],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882936,0.00020415091,0.00042157192,0.00021038165,0.0001763066,0.00015819808],"domain_scores_gemma":[0.9948635,0.00042135167,0.00038039056,0.004150695,0.0001526552,0.000031404412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979065,0.00011885822,0.00023681931,0.0002363813,0.0000817307,0.000025660505,0.0036496182,0.00006252066,0.0000049836926],"category_scores_gemma":[0.000064810905,0.00013256299,0.00009698922,0.0004716403,0.00026045158,0.0002457411,0.0005002284,0.00023737323,0.000008420232],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010091975,0.000179193,0.018417347,0.00014320323,0.00010123345,9.177418e-7,0.003829651,0.00047941194,0.91223216,0.030774375,0.0031988465,0.030633578],"study_design_scores_gemma":[0.0017168277,0.00036391852,0.019590752,0.0012245481,0.000090448004,0.00013361036,0.00077989337,0.09615241,0.862661,0.011171492,0.004864012,0.00125106],"about_ca_topic_score_codex":0.00019420237,"about_ca_topic_score_gemma":0.000081726284,"teacher_disagreement_score":0.095673,"about_ca_system_score_codex":0.000044469456,"about_ca_system_score_gemma":0.00004820522,"threshold_uncertainty_score":0.67819595},"labels":[],"label_agreement":null},{"id":"W2975591067","doi":"10.1109/lcomm.2019.2942926","title":"Analysis and Optimization of Successful Symbol Transmission Rate for Grant-free Massive Access With Massive MIMO","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Shanghai Jiao Tong University; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); MIMO; Network packet; Random access; Computer network; Performance metric; Metric (unit); Beamforming; Data transmission; Channel (broadcasting); Phase-shift keying; Bit error rate; Algorithm; Telecommunications","score_opus":0.012839662846591491,"score_gpt":0.24786387528226775,"score_spread":0.23502421243567626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975591067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041178484,0.00020463673,0.9561637,0.0012341229,0.00006033552,0.0008624121,0.000060197464,0.000106469844,0.00012965713],"genre_scores_gemma":[0.8732013,0.0003943188,0.12588689,0.00007796637,0.000011009272,0.0001721412,0.00018629438,0.00004781035,0.000022262751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991027,0.00008209762,0.0003472819,0.00020117972,0.00009963964,0.00016708412],"domain_scores_gemma":[0.9979216,0.0002643455,0.0001809947,0.0014097274,0.00017001196,0.000053305776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012510948,0.00017675992,0.0003287477,0.00035668814,0.0001052881,0.000052378324,0.0007885815,0.00006977015,0.0000145862705],"category_scores_gemma":[0.000017255092,0.00016836698,0.000074748554,0.00077079586,0.00009014255,0.0005502936,0.000057410103,0.00011171526,0.0000010640738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027977323,0.000015573823,0.0023595358,0.00014606294,0.0002947215,2.2140635e-7,0.00030325528,0.9814617,0.014828728,0.000039787203,0.000099806486,0.00042263832],"study_design_scores_gemma":[0.0010827442,0.000031378815,0.00056430476,0.0001198685,0.0004085584,0.000001021038,0.0001535302,0.98906815,0.008190778,0.000024087076,0.00010935738,0.00024622038],"about_ca_topic_score_codex":0.000037477854,"about_ca_topic_score_gemma":0.000048646038,"teacher_disagreement_score":0.83202285,"about_ca_system_score_codex":0.000056158493,"about_ca_system_score_gemma":0.000013765793,"threshold_uncertainty_score":0.6865806},"labels":[],"label_agreement":null},{"id":"W2977160802","doi":"10.1109/lcomm.2019.2942919","title":"Coverage Analysis of Cooperative NOMA in Millimeter Wave Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Relay; Decoding methods; Computer science; Computer network; Transmission (telecommunications); Selection (genetic algorithm); Set (abstract data type); Telecommunications; Algorithm; Telecommunications link; Power (physics); Artificial intelligence","score_opus":0.018697136312606784,"score_gpt":0.24109754114360776,"score_spread":0.222400404831001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977160802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8277077,0.0011308992,0.16818742,0.00084099587,0.00008530488,0.00029612714,0.000023121936,0.0002682688,0.0014601648],"genre_scores_gemma":[0.98980904,0.0017167024,0.008058576,0.00023879984,0.0000029291728,0.00006277039,0.000073064904,0.00002236742,0.00001573507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914217,0.00009204984,0.0003795292,0.00012993289,0.00008470742,0.00017161854],"domain_scores_gemma":[0.99639356,0.00041807018,0.00008129423,0.0030401244,0.000047595637,0.000019348445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011607333,0.00013626892,0.00033533084,0.0005497745,0.0000412223,0.000014288394,0.0010738575,0.00008396324,0.000032914177],"category_scores_gemma":[0.000019307026,0.00015000445,0.00009488656,0.001625995,0.00016019716,0.00016965647,0.00018521844,0.00037122032,0.0000182303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028804614,0.000028778522,0.0062705516,0.0000066955813,0.00029484017,4.1791284e-7,0.00022240078,0.9679793,0.02183582,0.0005462235,0.0001514278,0.002660633],"study_design_scores_gemma":[0.0003279643,0.00001441621,0.018596573,0.000038694692,0.000077595476,6.6396717e-7,0.00015922547,0.97381634,0.005295849,0.000035192177,0.0013730174,0.0002644753],"about_ca_topic_score_codex":0.00002067619,"about_ca_topic_score_gemma":0.00014229697,"teacher_disagreement_score":0.16210136,"about_ca_system_score_codex":0.00011231937,"about_ca_system_score_gemma":0.000005823442,"threshold_uncertainty_score":0.61170036},"labels":[],"label_agreement":null},{"id":"W2980350661","doi":"10.1109/lcomm.2019.2948179","title":"Collision-Free Sequential Task Offloading for Mobile Edge Computing","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mobile edge computing; Server; Benchmark (surveying); Edge computing; Enhanced Data Rates for GSM Evolution; Latency (audio); Heuristic; Task (project management); Optimization problem; Scheme (mathematics); Mathematical optimization; Distributed computing; Algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.02899697527961946,"score_gpt":0.285949286398784,"score_spread":0.2569523111191645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980350661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27985957,0.00023925248,0.7011702,0.006252043,0.009828995,0.0009795557,0.0000036545596,0.0004050289,0.0012616982],"genre_scores_gemma":[0.7700731,0.000016206692,0.22542103,0.0031542259,0.0010355499,0.000078988014,0.000031881504,0.0000368468,0.00015215404],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982888,0.00015176476,0.0004283086,0.00042440498,0.00022913104,0.0004775648],"domain_scores_gemma":[0.99467355,0.00085756404,0.00020824156,0.004028924,0.00014170693,0.000089984205],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006482169,0.00019907478,0.00025094766,0.00019304147,0.0007154464,0.0003236396,0.005545319,0.000074703086,0.0000019477768],"category_scores_gemma":[0.000055336823,0.00021711274,0.00016905155,0.0005036973,0.000099437835,0.0004605981,0.0016078562,0.00028881856,0.0001677455],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003136108,0.00048513646,0.003400774,0.00022799203,0.00027489368,0.000007997078,0.010944063,0.018309388,0.30635917,0.014717066,0.57137716,0.073865004],"study_design_scores_gemma":[0.0015100983,0.00011207825,0.00041381526,0.0001798967,0.000027191854,0.000027025462,0.00007413026,0.73802006,0.0060663484,0.0008009289,0.25205964,0.0007087698],"about_ca_topic_score_codex":0.000034975685,"about_ca_topic_score_gemma":0.0000027013477,"teacher_disagreement_score":0.7197107,"about_ca_system_score_codex":0.00013848304,"about_ca_system_score_gemma":0.0000777374,"threshold_uncertainty_score":0.99983513},"labels":[],"label_agreement":null},{"id":"W2982559964","doi":"10.1109/lcomm.2019.2950193","title":"Generalized $M_{m,r}$ -Network: A Case for Fixed Message Dimensions","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Computer network; Combinatorics; Mathematics","score_opus":0.06178577956205216,"score_gpt":0.3082794003259665,"score_spread":0.24649362076391435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982559964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16073014,0.0032641944,0.7540643,0.07434941,0.0013945281,0.0023188854,0.000022293305,0.00075459166,0.0031016634],"genre_scores_gemma":[0.7826086,0.0008037672,0.206787,0.008825103,0.00007201103,0.00033894315,0.000037514135,0.000026466396,0.0005005657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981427,0.00048951386,0.0004181518,0.00037889034,0.00015112809,0.00041961033],"domain_scores_gemma":[0.992954,0.00091778586,0.0001750309,0.0056486554,0.00018860151,0.00011591436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585359,0.00021113231,0.0002719534,0.0001237591,0.00095664227,0.00021047702,0.0033262281,0.00006707744,0.000036414116],"category_scores_gemma":[0.000046107976,0.00021466818,0.00016733063,0.0006542726,0.000113958784,0.0004267654,0.0010552229,0.0002977595,0.00013666129],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036836533,0.0004364207,0.0011355664,0.00004668936,0.0003432714,0.00005810628,0.003496663,0.01422116,0.09534414,0.5771568,0.27137965,0.03634469],"study_design_scores_gemma":[0.0022837026,0.00007900217,0.00025629302,0.000112318674,0.000049375558,0.00034406013,0.00006835013,0.55699795,0.0010759046,0.0010498385,0.43682685,0.0008563467],"about_ca_topic_score_codex":0.000017344166,"about_ca_topic_score_gemma":0.00012907301,"teacher_disagreement_score":0.6218785,"about_ca_system_score_codex":0.00008779478,"about_ca_system_score_gemma":0.00006005359,"threshold_uncertainty_score":0.8753914},"labels":[],"label_agreement":null},{"id":"W2984932593","doi":"10.1109/lcomm.2019.2953722","title":"Topology Verification Enabled Intrusion Detection for In-Vehicle CAN-FD Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Subnet; Intrusion detection system; Computer network; Topology (electrical circuits); Network topology; Controller (irrigation); Distributed computing; Computer security; Engineering","score_opus":0.01102350400820651,"score_gpt":0.22228549062998276,"score_spread":0.21126198662177625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984932593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9092673,0.00044205162,0.08423746,0.0035281798,0.00080967945,0.0009660333,0.0000054658813,0.00030555666,0.0004382595],"genre_scores_gemma":[0.99634373,0.0002500561,0.002219831,0.00063158036,0.0001217626,0.00027029123,0.00008337773,0.000046112535,0.00003322697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989947,0.00010014771,0.0003024996,0.00018715346,0.00007691505,0.0003385615],"domain_scores_gemma":[0.9983208,0.00020958782,0.000058166657,0.001322622,0.000040343442,0.000048455764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026628198,0.00014611841,0.0001789534,0.00015099176,0.00011895633,0.00003255535,0.0005600172,0.00014659856,0.000016378475],"category_scores_gemma":[0.000010603444,0.00017425654,0.000061522136,0.0002723907,0.00005696404,0.00014503751,0.000056523295,0.00035604212,0.00004458449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012837864,0.000019430434,0.0005667207,0.000018812572,0.000020450869,3.4621732e-7,0.00017230277,0.8645499,0.12402034,0.00011891751,0.0010697411,0.009430256],"study_design_scores_gemma":[0.00056474167,0.00002322215,0.0028183565,0.000027870667,0.000014107785,0.000004692945,0.00004190342,0.97323924,0.004637089,0.00006462205,0.018358711,0.00020544087],"about_ca_topic_score_codex":0.000103947285,"about_ca_topic_score_gemma":0.0010259424,"teacher_disagreement_score":0.119383246,"about_ca_system_score_codex":0.00028497583,"about_ca_system_score_gemma":0.000012083465,"threshold_uncertainty_score":0.7105975},"labels":[],"label_agreement":null},{"id":"W2988549429","doi":"10.1109/lcomm.2019.2951404","title":"Channel Equalization and Detection With ELM-Based Regressors for OFDM Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Equalization (audio); Orthogonal frequency-division multiplexing; Computer science; Extreme learning machine; Benchmark (surveying); Computational complexity theory; Channel (broadcasting); Reduction (mathematics); Adaptability; Algorithm; Artificial intelligence; Artificial neural network; Mathematics; Telecommunications","score_opus":0.021320108762653105,"score_gpt":0.25698370645031965,"score_spread":0.23566359768766654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988549429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0524051,0.00013221582,0.94090533,0.005692676,0.00019165843,0.0003671569,0.0000023295493,0.00015571821,0.00014780115],"genre_scores_gemma":[0.9886585,0.000009852828,0.0102925785,0.00079631293,0.000019710113,0.00010783682,0.000014254721,0.000012082856,0.00008886636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992884,0.00014922596,0.00013324754,0.00019582218,0.000097420125,0.00013593212],"domain_scores_gemma":[0.99827313,0.00022022179,0.00012170359,0.0012815585,0.0000663258,0.00003705936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002874531,0.00009003556,0.00010240772,0.00011673369,0.00024524628,0.00014050204,0.0006739124,0.00003524594,4.2964774e-7],"category_scores_gemma":[0.000019490519,0.00008006401,0.000022541222,0.00022370183,0.000044203978,0.00020373875,0.000059467093,0.00008987139,0.000009092171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020496086,0.00056644157,0.008817604,0.0011547514,0.00031480214,0.0000021211674,0.008191682,0.6313941,0.14503998,0.074910425,0.0045550126,0.12484811],"study_design_scores_gemma":[0.00055768766,0.00009387168,0.00031324604,0.00006786815,0.0000089236055,0.0000038740673,0.000027809718,0.989452,0.00088005845,0.000056340337,0.008394448,0.00014387531],"about_ca_topic_score_codex":0.00012483186,"about_ca_topic_score_gemma":0.000020020696,"teacher_disagreement_score":0.9362534,"about_ca_system_score_codex":0.000030122259,"about_ca_system_score_gemma":0.000016711027,"threshold_uncertainty_score":0.32649156},"labels":[],"label_agreement":null},{"id":"W2989794282","doi":"10.1109/lcomm.2019.2956514","title":"Mobility-Aware Computation Offloading in MEC-Based Vehicular Wireless Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Mobile edge computing; Computation offloading; Server; Computer network; Handover; Wireless; Computation; Enhanced Data Rates for GSM Evolution; Wireless network; Task (project management); Edge computing; Real-time computing; Algorithm; Telecommunications","score_opus":0.020713712639190234,"score_gpt":0.2588731170195438,"score_spread":0.23815940438035357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989794282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42766485,0.00008002711,0.56525874,0.0046322998,0.0017651109,0.00027498315,1.7145051e-7,0.00016380007,0.00016001698],"genre_scores_gemma":[0.9798835,0.000007399521,0.017354278,0.0025401467,0.00013825274,0.000029045419,0.000023798397,0.000016506838,0.0000071057893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828357,0.00035717533,0.00040229346,0.00037721818,0.00021295309,0.00036676668],"domain_scores_gemma":[0.9970503,0.0005333303,0.00015048942,0.0021192813,0.000083152256,0.00006346171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006429214,0.00017512955,0.00022899888,0.00023939843,0.00024081985,0.00017612864,0.0022935977,0.00008392742,0.0000013336045],"category_scores_gemma":[0.000011630963,0.00019729427,0.00009144834,0.0008355803,0.0000816675,0.00039153875,0.00037935984,0.0004552524,0.00007664948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012200231,0.00041394256,0.037994795,0.00008387312,0.000045507393,0.0000138331225,0.0018027268,0.9014276,0.010489652,0.0012173763,0.0060492815,0.040449165],"study_design_scores_gemma":[0.0004020718,0.000015865742,0.005304134,0.00010526926,0.0000040364407,0.0000026630082,0.000015673828,0.9925165,0.00029937216,0.000082046565,0.0010268596,0.00022550391],"about_ca_topic_score_codex":0.000105757426,"about_ca_topic_score_gemma":0.000015697788,"teacher_disagreement_score":0.5522186,"about_ca_system_score_codex":0.00018580232,"about_ca_system_score_gemma":0.000060413488,"threshold_uncertainty_score":0.80454266},"labels":[],"label_agreement":null},{"id":"W2990585754","doi":"10.1109/lcomm.2019.2955450","title":"Spatially Coupled LDPC Codes With Small Constraint Length and Low Error Floor","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Error floor; Forward error correction; Computer science; Constraint (computer-aided design); Turbo code; Concatenated error correction code; Serial concatenated convolutional codes; Decoding methods; Algorithm; Telecommunications; Mathematics; Block code","score_opus":0.02731998949343267,"score_gpt":0.25372740180921854,"score_spread":0.22640741231578587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990585754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6274403,0.000090491514,0.35752675,0.012708007,0.00016854295,0.00052753073,0.000004303616,0.00068427937,0.00084982836],"genre_scores_gemma":[0.73331344,0.000034206183,0.26431638,0.0022083034,0.00001244214,0.00005193627,0.00000559461,0.000018115286,0.000039546034],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868304,0.00018293962,0.00026991323,0.0003874709,0.00019305387,0.00028360804],"domain_scores_gemma":[0.9961105,0.00037342508,0.00017773679,0.0031228228,0.00012796612,0.00008754241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004046782,0.00020781285,0.00024083065,0.00015104694,0.0002257424,0.00018666367,0.0024360868,0.00006353308,0.00000802416],"category_scores_gemma":[0.000039066126,0.00019320412,0.00004465127,0.00029899884,0.00036087882,0.0002968135,0.00046509033,0.00038251525,0.000056848443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012758364,0.0010853979,0.04607515,0.00036775606,0.0005733575,0.00007312802,0.016633056,0.0030234242,0.778387,0.042238723,0.00494137,0.10647403],"study_design_scores_gemma":[0.0037084755,0.0009600479,0.020906108,0.0012083268,0.00013103202,0.0005409533,0.0006149967,0.92360276,0.035785723,0.0010181131,0.00871411,0.0028093795],"about_ca_topic_score_codex":0.0003276398,"about_ca_topic_score_gemma":0.000643648,"teacher_disagreement_score":0.9205793,"about_ca_system_score_codex":0.000067719935,"about_ca_system_score_gemma":0.00010241765,"threshold_uncertainty_score":0.78786355},"labels":[],"label_agreement":null},{"id":"W2994819845","doi":"10.1109/lcomm.2019.2958809","title":"Secure Communications With a Full-Duplex Relay Network Under Residual Self-Interference","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Institute of Information and Communications Technology; Ministry of Science, ICT and Future Planning","keywords":"Secrecy; Relay; Jamming; Computer science; Residual; Computer network; Interference (communication); Secure communication; SIGNAL (programming language); Telecommunications; Computer security; Algorithm; Encryption; Physics","score_opus":0.01753952414956646,"score_gpt":0.22884526093572458,"score_spread":0.2113057367861581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994819845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.950893,0.0030503878,0.01333835,0.023880031,0.0004330423,0.0013673583,0.000073144896,0.0025818646,0.004382808],"genre_scores_gemma":[0.8981759,0.0018042412,0.09760992,0.001339393,0.000079756675,0.00039931003,0.0002782783,0.00015484792,0.00015836707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974582,0.00045974206,0.00068748393,0.00038790234,0.00032993517,0.00067674456],"domain_scores_gemma":[0.9851632,0.0010151449,0.00019041155,0.0132594425,0.0001952111,0.00017655875],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033462624,0.000473904,0.0004479664,0.0002254081,0.0006821617,0.00018740176,0.006430894,0.00020058251,0.00009976589],"category_scores_gemma":[0.000013689591,0.00049140083,0.00012661697,0.0010621131,0.00050249527,0.000487863,0.0009039676,0.0015027467,0.00082866865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022991337,0.00017702092,0.0014011937,0.00005578629,0.00038886906,0.0000013476406,0.0015298796,0.9534689,0.013472193,0.006953104,0.022115566,0.00041310338],"study_design_scores_gemma":[0.0011989794,0.00011615163,0.0027828182,0.0004243773,0.0001768224,0.0000821397,0.0007362858,0.92139596,0.00031270678,0.000026184493,0.071559444,0.001188122],"about_ca_topic_score_codex":0.00007471174,"about_ca_topic_score_gemma":0.001130216,"teacher_disagreement_score":0.08427157,"about_ca_system_score_codex":0.00036805295,"about_ca_system_score_gemma":0.000097731536,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W2994942200","doi":"10.1109/lcomm.2019.2960350","title":"Optimization of Rate Fairness in Multi-Pair Wireless-Powered Relaying Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministry of Education","keywords":"Relay; Computer science; Wireless; Iterative method; Energy harvesting; Power (physics); Fairness measure; Computer network; Wireless network; Energy (signal processing); Efficient energy use; Optimization problem; Mathematical optimization; Algorithm; Electrical engineering; Telecommunications; Throughput; Mathematics","score_opus":0.023664438726299995,"score_gpt":0.23522331031526547,"score_spread":0.21155887158896547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994942200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7055727,0.00072852615,0.2909192,0.00028362346,0.00082181237,0.00037518278,0.000007854563,0.0003863251,0.0009047518],"genre_scores_gemma":[0.9827725,0.00024182977,0.016693207,0.000056516183,0.000017752016,0.00007225524,0.00004867793,0.000059775797,0.000037479396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988549,0.00020786203,0.00047490982,0.00015343646,0.000090777714,0.00021816065],"domain_scores_gemma":[0.9979591,0.00032643412,0.00012070928,0.0015030871,0.000054802924,0.000035865552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033554927,0.00015585031,0.0002531182,0.00019408138,0.00005173185,0.000033896442,0.0007933134,0.00010681382,0.0000049608943],"category_scores_gemma":[0.00002365019,0.00018614218,0.000044926706,0.00046548896,0.000077320234,0.00022316731,0.00007816933,0.00032797025,0.000016240088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001957045,0.000026005166,0.0073609813,0.00008194525,0.000022319828,5.139172e-7,0.0002309161,0.9609572,0.03060116,0.00044552365,0.000111633715,0.00015984177],"study_design_scores_gemma":[0.0004364227,0.0000048754855,0.0011512126,0.0003784203,0.00000765317,0.0000013417588,0.000079776,0.99676657,0.00075301353,0.0000020692248,0.00022791974,0.00019070628],"about_ca_topic_score_codex":0.00013999206,"about_ca_topic_score_gemma":0.000038663893,"teacher_disagreement_score":0.2771998,"about_ca_system_score_codex":0.00013085507,"about_ca_system_score_gemma":0.000013053103,"threshold_uncertainty_score":0.7590658},"labels":[],"label_agreement":null},{"id":"W2996396392","doi":"10.1109/lcomm.2019.2959525","title":"Joint Channel Assignment and Occupancy Time Optimization in Frame-Based Listen-Before-Talk","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Memorial University of Newfoundland; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Frame (networking); Optimization problem; Lyapunov optimization; Assignment problem; Mathematical optimization; Time complexity; Integer programming; Linear programming; Computer network; Network packet; Algorithm; Mathematics","score_opus":0.021066649516192835,"score_gpt":0.24747285822023232,"score_spread":0.2264062087040395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996396392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03350243,0.00016082426,0.9282849,0.032227688,0.00020278913,0.0046216673,0.0000059224526,0.00017952039,0.0008142846],"genre_scores_gemma":[0.9127529,0.000024703368,0.08090922,0.0047925655,0.000032233384,0.0013771253,0.000023655703,0.000017897588,0.00006964744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988594,0.00019414148,0.00028387245,0.00027049964,0.00016434165,0.00022771371],"domain_scores_gemma":[0.99775976,0.00012417766,0.0001325209,0.001885766,0.000036091584,0.00006170377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003256101,0.00013800118,0.0001820983,0.00014654134,0.00012289002,0.00016774848,0.0011572388,0.00007062785,0.000018039367],"category_scores_gemma":[0.000008792189,0.00013633199,0.000043632903,0.00034926998,0.000073017756,0.00032863292,0.0002776438,0.00023181913,0.000053562388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002680053,0.00048897264,0.0065118074,0.00009291415,0.000043208885,0.000009130177,0.0017051832,0.95755804,0.008942363,0.0036913762,0.004221655,0.01670855],"study_design_scores_gemma":[0.00054455857,0.00005721582,0.0026177391,0.00013582318,0.0000028594652,0.0000026870941,0.000006945356,0.99467313,0.0002496918,0.00013584751,0.0013971247,0.00017640297],"about_ca_topic_score_codex":0.00004511852,"about_ca_topic_score_gemma":0.000012695829,"teacher_disagreement_score":0.8792505,"about_ca_system_score_codex":0.00008305197,"about_ca_system_score_gemma":0.00003772979,"threshold_uncertainty_score":0.5559457},"labels":[],"label_agreement":null},{"id":"W2997803101","doi":"10.1109/lcomm.2019.2962773","title":"Approximating Ergodic Mutual Information for Mixture Gamma Fading Channels With Discrete Inputs","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Beijing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Fading; Fading distribution; Nakagami distribution; Channel state information; Rayleigh fading; Computer science; Ergodic theory; Algorithm; Wireless; Topology (electrical circuits); Mathematics; Electronic engineering; Telecommunications; Engineering; Decoding methods","score_opus":0.01081132655471238,"score_gpt":0.23540016349517046,"score_spread":0.2245888369404581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997803101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067503735,0.0001399722,0.9257208,0.0025499782,0.00015173244,0.0011910504,0.00003292084,0.0011570858,0.0015527314],"genre_scores_gemma":[0.8174462,0.00010488567,0.18090233,0.0006366035,0.00002754907,0.0005862203,0.00022856312,0.00004782823,0.000019833977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.000054171098,0.00041824265,0.00012402084,0.00015336784,0.0002775223],"domain_scores_gemma":[0.9973015,0.00027161313,0.00016216618,0.0021170988,0.000093941715,0.000053649277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020215719,0.00021554466,0.00022342513,0.00021758286,0.0002235693,0.00009821395,0.0012173699,0.00008905989,0.0000056100694],"category_scores_gemma":[0.000028722214,0.00021538715,0.00006316032,0.00031323655,0.000101099795,0.0011530735,0.00012830461,0.0003806696,0.000049265574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011688215,0.00010863506,0.0021292337,0.0013213373,0.000441369,8.276297e-7,0.016781721,0.6628034,0.22633716,0.0131274965,0.010373211,0.06645872],"study_design_scores_gemma":[0.0016237935,0.00012273242,0.00022696205,0.0006718842,0.000057077694,0.0000151733675,0.0005569614,0.8214981,0.06915449,0.0005097293,0.10430965,0.0012534749],"about_ca_topic_score_codex":0.0000054945076,"about_ca_topic_score_gemma":0.000008211266,"teacher_disagreement_score":0.7499424,"about_ca_system_score_codex":0.00014242176,"about_ca_system_score_gemma":0.000014040134,"threshold_uncertainty_score":0.8783233},"labels":[],"label_agreement":null},{"id":"W2997975332","doi":"10.1109/lcomm.2019.2961312","title":"Code Design for Non-Coherent Index Modulation","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rayleigh fading; Constant-weight code; Algorithm; Additive white Gaussian noise; Computer science; Binary number; Modulation (music); Fading; Code (set theory); Mathematics; Decoding methods; Theoretical computer science; Set (abstract data type); Linear code; Block code; Telecommunications; Channel (broadcasting); Arithmetic; Physics","score_opus":0.03979673092530468,"score_gpt":0.27232668037985946,"score_spread":0.2325299494545548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997975332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04627196,0.00018226271,0.9487768,0.002370178,0.00018510497,0.00094072125,0.000016144944,0.00087213697,0.00038469813],"genre_scores_gemma":[0.87486225,0.0002792455,0.12395221,0.00021185323,0.000012006351,0.0005503452,0.00004427568,0.0000473913,0.00004042144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924165,0.00004242445,0.00027163405,0.00014374312,0.00009483642,0.00020571287],"domain_scores_gemma":[0.9963462,0.0003911678,0.00007176496,0.0031052013,0.00005779924,0.00002786386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013388436,0.00015112184,0.00016570026,0.00015454469,0.00013194635,0.000032138487,0.0015051204,0.000092058646,0.000009674693],"category_scores_gemma":[0.00002487723,0.00017350148,0.00005973753,0.00023003494,0.00009448991,0.00023005634,0.0001225848,0.00025363057,0.00009744541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056347317,0.000022913018,0.0004240619,0.000025864252,0.000034108532,4.6499128e-8,0.00012170397,0.84714746,0.13589977,0.00066214823,0.0037832605,0.011873029],"study_design_scores_gemma":[0.000443071,0.000017207389,0.001192613,0.000038522136,0.000006030345,0.0000012139859,0.000076229844,0.96676594,0.017942546,0.0008806127,0.012378508,0.0002574786],"about_ca_topic_score_codex":0.000003996161,"about_ca_topic_score_gemma":0.000010348276,"teacher_disagreement_score":0.8285903,"about_ca_system_score_codex":0.00014833744,"about_ca_system_score_gemma":0.00001030819,"threshold_uncertainty_score":0.70751846},"labels":[],"label_agreement":null},{"id":"W2998901236","doi":"10.1109/lcomm.2020.2965535","title":"Comments on “AN-Aided Secrecy Precoding for SWIPT in Cognitive MIMO Broadcast Channels”","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Precoding; Secrecy; MIMO; Artificial noise; Computer science; Channel (broadcasting); Cognitive radio; Maximization; Algorithm; Wireless; Transmitter; Topology (electrical circuits); Mathematics; Computer network; Telecommunications; Mathematical optimization; Combinatorics; Computer security","score_opus":0.10336969794502628,"score_gpt":0.3277937017716794,"score_spread":0.22442400382665312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998901236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75001615,0.00093869143,0.15948614,0.07633235,0.0004983333,0.004194055,0.00034150993,0.0032627913,0.004929955],"genre_scores_gemma":[0.9818134,0.00041828112,0.008852123,0.0076895957,0.00006227561,0.0008228366,0.00026293387,0.000073994874,0.0000046124383],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986886,0.00021679405,0.00043313633,0.00023263152,0.00013610315,0.00029273797],"domain_scores_gemma":[0.9976041,0.0006568938,0.00008271594,0.0014598253,0.00007270751,0.00012377424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025028695,0.00023033915,0.00026843455,0.00019984815,0.00018734863,0.00008480676,0.0016306799,0.000100587335,0.000014401169],"category_scores_gemma":[0.0001002018,0.00029156313,0.00008076864,0.00036651074,0.000102299164,0.00034161058,0.00017189725,0.0005464466,0.00003172064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074227387,0.0032656873,0.005254185,0.0011264551,0.0011200762,0.000018179944,0.12419288,0.073837064,0.43730524,0.0129613085,0.13582265,0.20435402],"study_design_scores_gemma":[0.005362456,0.00052034936,0.00127272,0.0013769403,0.00010993307,0.000008338655,0.0027682942,0.76345867,0.12582326,0.0010443759,0.09598229,0.0022723884],"about_ca_topic_score_codex":0.000037215395,"about_ca_topic_score_gemma":0.000060473954,"teacher_disagreement_score":0.68962157,"about_ca_system_score_codex":0.00014534242,"about_ca_system_score_gemma":0.0000131024735,"threshold_uncertainty_score":0.9999536},"labels":[],"label_agreement":null},{"id":"W3000504167","doi":"10.1109/lcomm.2020.2966477","title":"Optimal Channel Equalizer for mmWave Massive MIMO Using 1-bit ADCs in Frequency-Selective Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of British Columbia","funders":"","keywords":"MIMO; Computer science; Electronic engineering; Channel (broadcasting); Equalization (audio); Fading; Nonlinear distortion; Telecommunications; Bandwidth (computing); Engineering","score_opus":0.10395383750294905,"score_gpt":0.29283608521653587,"score_spread":0.1888822477135868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000504167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1174547,0.0004328296,0.8744536,0.006240003,0.00022704502,0.00063564256,0.000047876543,0.00018897362,0.00031930947],"genre_scores_gemma":[0.9187152,0.00008400392,0.07852189,0.0022412378,0.0001161132,0.00020475582,0.00005168142,0.00006077426,0.000004355201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884677,0.00009018952,0.00039300043,0.00022688958,0.00011385305,0.00032927864],"domain_scores_gemma":[0.99899906,0.00015233274,0.00007340167,0.00057917205,0.000093206014,0.00010284713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016228539,0.00020395918,0.00023822163,0.00017330871,0.00015566585,0.000051606537,0.00055419916,0.00008927169,0.00001103262],"category_scores_gemma":[0.000062147,0.00024211995,0.00009978914,0.00035723628,0.0000637588,0.00021187248,0.000073718285,0.00032740727,0.000018448038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011456039,0.00002318138,0.00001329728,0.000055844288,0.00006365864,0.0000018097502,0.0046009403,0.6609739,0.3329055,0.00013322641,0.000979382,0.00023781158],"study_design_scores_gemma":[0.00052701164,0.000026688072,0.0000062840804,0.00006048534,0.000026510526,0.0000023527405,0.00029435864,0.9608267,0.037327033,0.00021802541,0.00038422327,0.00030032473],"about_ca_topic_score_codex":0.00004312762,"about_ca_topic_score_gemma":0.000019467887,"teacher_disagreement_score":0.8012605,"about_ca_system_score_codex":0.00017304793,"about_ca_system_score_gemma":0.000028495519,"threshold_uncertainty_score":0.98733646},"labels":[],"label_agreement":null},{"id":"W3005317772","doi":"10.1109/lcomm.2020.2970717","title":"New Semi Blind Tag Separation Method for Efficient Tags to Reader Collision Recovery in RFID Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"RFID technology advancements","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Aloha; Ultra high frequency; Computer science; Collision; Throughput; Physical layer; Cumulant; Multilateration; Exploit; Antenna (radio); Protocol (science); Algorithm; Radio-frequency identification; Collision problem; Telecommunications; Wireless; Mathematics; Statistics; Computer security","score_opus":0.045673889559499435,"score_gpt":0.3321177378033687,"score_spread":0.28644384824386926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005317772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053990044,0.00033151277,0.9271922,0.016509125,0.00034765355,0.00112898,0.000036168065,0.00029851764,0.00016578288],"genre_scores_gemma":[0.547681,0.000105413426,0.44853702,0.0026481515,0.000089139714,0.00070054474,0.00011026052,0.00006709706,0.00006138797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905455,0.000075116135,0.00035752702,0.00020591971,0.000097228876,0.00020966474],"domain_scores_gemma":[0.9985861,0.00023410835,0.000056157107,0.0010059068,0.0000368801,0.00008085668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021355784,0.00013939971,0.00019302429,0.0001983339,0.000084622094,0.00003701577,0.0006927939,0.00010181763,0.0000027665728],"category_scores_gemma":[0.00008704351,0.00016705423,0.000039975854,0.0006194943,0.00001911992,0.0001151781,0.00008382218,0.00022825816,0.00005024391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018944005,0.00001444114,0.000052662137,0.000026734275,0.000023438282,3.3762427e-7,0.00047878348,0.8386768,0.13369568,0.00023956377,0.02484186,0.0019307313],"study_design_scores_gemma":[0.001286785,0.000067555375,0.00009638263,0.00012017205,0.0000284539,0.0000022788033,0.00018554964,0.8401333,0.024612883,0.00006647642,0.13306734,0.00033279636],"about_ca_topic_score_codex":0.00004438331,"about_ca_topic_score_gemma":0.00003071014,"teacher_disagreement_score":0.49369094,"about_ca_system_score_codex":0.00021960131,"about_ca_system_score_gemma":0.000019460973,"threshold_uncertainty_score":0.6812274},"labels":[],"label_agreement":null},{"id":"W3008718568","doi":"10.1109/lcomm.2020.2974958","title":"Beamforming for Maximal Coverage in mmWave Drones: A Reinforcement Learning Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Beamforming; Computer science; Drone; Base station; Telecommunications link; Reinforcement learning; Wireless; Channel (broadcasting); Quality of service; Convergence (economics); Throughput; Computer network; Mathematical optimization; Real-time computing; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.02798702002264898,"score_gpt":0.22961271335140612,"score_spread":0.20162569332875713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008718568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015727365,0.00008729919,0.9784635,0.0023974879,0.000027238002,0.00054174644,0.0000045387656,0.00019339887,0.0025574758],"genre_scores_gemma":[0.9168279,0.0001850187,0.08134404,0.00082137604,0.000038269023,0.00052391284,0.00020976352,0.000032410757,0.000017304768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933964,0.000020592272,0.00026552854,0.00012524432,0.00007278287,0.00017622308],"domain_scores_gemma":[0.9993522,0.00006701109,0.00004301836,0.00046757082,0.00002198068,0.00004822876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100184174,0.00010966735,0.00012205686,0.000077502955,0.00014500499,0.000041122104,0.00040209308,0.00004339343,0.000005751786],"category_scores_gemma":[0.000017323388,0.00013108751,0.000045713758,0.0002846505,0.00003326392,0.00016171258,0.000050708626,0.00021618084,0.000012449596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046383934,0.000014189558,0.000102456135,0.000039843762,0.000013616684,9.425856e-8,0.0012087391,0.99009115,0.0057332087,0.000639394,0.00063251035,0.001520139],"study_design_scores_gemma":[0.00037589864,0.0000142522085,0.000051178544,0.000011700848,0.000010068537,8.75656e-7,0.000148362,0.97974956,0.00038332664,0.000017233835,0.019090608,0.00014691676],"about_ca_topic_score_codex":0.000013401755,"about_ca_topic_score_gemma":0.000005328426,"teacher_disagreement_score":0.9011005,"about_ca_system_score_codex":0.00009590439,"about_ca_system_score_gemma":0.000009328495,"threshold_uncertainty_score":0.53455937},"labels":[],"label_agreement":null},{"id":"W3011208115","doi":"10.1109/lcomm.2019.2958996","title":"Power Control for Massive MIMO Systems with Nonorthogonal Pilots","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"MIMO; Power control; Computer science; Power (physics); Telecommunications; Control (management); Computer network; Channel (broadcasting); Artificial intelligence; Physics","score_opus":0.010197049974815398,"score_gpt":0.22118763950085205,"score_spread":0.21099058952603664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011208115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02487284,0.00042382974,0.96886826,0.0010775416,0.000620212,0.0016982894,0.000091930975,0.00033773246,0.002009396],"genre_scores_gemma":[0.98452103,0.000018327786,0.014555932,0.00027616406,0.000041114527,0.0003486489,0.00006161092,0.000065055436,0.000112105765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992414,0.000046973695,0.0002544717,0.00014813559,0.00009114092,0.00021784633],"domain_scores_gemma":[0.99822676,0.0002422445,0.000086997665,0.0012844396,0.00010972672,0.000049818722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009781927,0.0001596936,0.00021140628,0.00009282718,0.00010383603,0.000046206136,0.00048497977,0.000051283478,0.000008087896],"category_scores_gemma":[0.000008454846,0.00015440049,0.000046535548,0.00014036028,0.00005506716,0.00023011849,0.000017958637,0.00013979377,0.00008071691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001887372,0.00001660261,0.0007940819,0.00005831506,0.000097075485,4.4206024e-7,0.00014881098,0.9802686,0.01578274,0.0006707029,0.0021008495,0.000042883825],"study_design_scores_gemma":[0.0041617365,0.00015865287,0.0007136421,0.00031909122,0.000082652696,0.000029036022,0.0004205067,0.9615079,0.0005582448,0.000019835556,0.031178897,0.0008498107],"about_ca_topic_score_codex":0.000007780313,"about_ca_topic_score_gemma":0.000011205779,"teacher_disagreement_score":0.9596482,"about_ca_system_score_codex":0.00011710494,"about_ca_system_score_gemma":0.000015208139,"threshold_uncertainty_score":0.6296269},"labels":[],"label_agreement":null},{"id":"W3011948907","doi":"10.1109/lcomm.2020.2980537","title":"Kennedy Receiver Using Threshold Detection and Optimized Displacement Under Thermal Noise","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Noise (video); Photon; Limit (mathematics); Quantum limit; Displacement (psychology); Receiver operating characteristic; Detection threshold; Homodyne detection; Thermal; Physics; Signal-to-noise ratio (imaging); Upper and lower bounds; Computer science; Optics; Electronic engineering; Algorithm; Quantum; Mathematics; Statistics; Quantum mechanics; Artificial intelligence; Engineering; Mathematical analysis; Real-time computing","score_opus":0.048008883022018826,"score_gpt":0.2640808826793782,"score_spread":0.21607199965735935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011948907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27633697,0.00009034237,0.7009259,0.021877691,0.000086657885,0.0001687023,0.0000015561535,0.00012887086,0.0003833099],"genre_scores_gemma":[0.9451121,0.00008557709,0.041262638,0.013489329,0.000019959693,0.000018296047,0.0000030861677,0.0000070155,0.000002007105],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992472,0.000088385685,0.00021799993,0.00015601507,0.00014381704,0.00014660282],"domain_scores_gemma":[0.9988165,0.000056217203,0.00010132258,0.0008926191,0.000038078535,0.000095251664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013263695,0.000108081644,0.00010008593,0.000088691304,0.00034309144,0.0001777757,0.0009036948,0.000033890825,0.000009363082],"category_scores_gemma":[0.0000059983076,0.00010565545,0.000054786113,0.00037141857,0.000117832285,0.0006813734,0.00025700853,0.0001706135,0.00002184726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017333204,0.0003151354,0.0013092172,0.00007317267,0.0002986851,0.000003911098,0.0132249985,0.107217476,0.8106834,0.04094974,0.0034098863,0.022340989],"study_design_scores_gemma":[0.00073179335,0.000035138142,0.0012607696,0.000013378869,0.000017596229,0.0000054444467,0.00015648277,0.99234545,0.0028327121,0.0001076574,0.0022817864,0.00021180094],"about_ca_topic_score_codex":0.00002047102,"about_ca_topic_score_gemma":0.0000042823754,"teacher_disagreement_score":0.88512796,"about_ca_system_score_codex":0.000029836312,"about_ca_system_score_gemma":0.00001395933,"threshold_uncertainty_score":0.4308504},"labels":[],"label_agreement":null},{"id":"W3013487134","doi":"10.1109/lcomm.2020.2982388","title":"Self-Coupling Data Transmission for Random Multiple Access Communications","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network packet; Random access; Coupling (piping); Transmission (telecommunications); Bit error rate; Throughput; Single antenna interference cancellation; Computer network; Packet switching; Transmission delay; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Engineering","score_opus":0.21913910819825577,"score_gpt":0.3663347960160265,"score_spread":0.1471956878177707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013487134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036793796,0.0023750088,0.7975177,0.19786589,0.000088916095,0.0008719431,0.000031708423,0.0005623862,0.00031848525],"genre_scores_gemma":[0.4744241,0.008292628,0.50562227,0.010903724,0.00007846415,0.0002751034,0.00036227476,0.00003197507,0.000009482103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797434,0.00034798606,0.0005859973,0.0005509198,0.00021560169,0.00032514642],"domain_scores_gemma":[0.9849147,0.0020264662,0.00022730461,0.012391271,0.00022383385,0.00021643381],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007373845,0.00023804001,0.00030576368,0.00011109577,0.0014881251,0.0005456741,0.029938681,0.000071329116,0.000006767275],"category_scores_gemma":[0.00017785627,0.0002485932,0.00012207798,0.00088971376,0.00019126775,0.0016475999,0.0055383346,0.00047909925,0.00003303773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030322094,0.0023761112,0.0027835015,0.0004819024,0.0010663677,0.0000047949725,0.02774428,0.01287071,0.13959023,0.06264171,0.22987428,0.5202629],"study_design_scores_gemma":[0.0010477353,0.000013747742,0.000053301806,0.000030433808,0.000023826498,0.0000014525799,0.000020342586,0.66850626,0.00043458494,0.00004250054,0.32961786,0.00020796883],"about_ca_topic_score_codex":0.000009787513,"about_ca_topic_score_gemma":0.00004354474,"teacher_disagreement_score":0.65563554,"about_ca_system_score_codex":0.00006245602,"about_ca_system_score_gemma":0.00011460714,"threshold_uncertainty_score":0.9999966},"labels":[],"label_agreement":null},{"id":"W3016390056","doi":"10.1109/lcomm.2020.2987639","title":"Completion-Time-Driven Scheduling for Uplink NOMA-Enabled Wireless Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Noma; Telecommunications link; Computer science; Scheduling (production processes); Wireless network; Wireless; Computer network; Distributed computing; Pairing; Computational complexity theory; Mathematical optimization; Algorithm; Mathematics; Telecommunications","score_opus":0.03607211356565994,"score_gpt":0.25036681936520916,"score_spread":0.21429470579954923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016390056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024542471,0.0009151237,0.94844055,0.022624943,0.0001161279,0.0006149978,0.000017697146,0.0024853447,0.00024272162],"genre_scores_gemma":[0.7955715,0.00090215594,0.20118704,0.0016380878,0.00007313472,0.00039631422,0.00014078108,0.000084305866,0.0000066878133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987575,0.00006424152,0.00046503244,0.00024325143,0.000109005916,0.00036098016],"domain_scores_gemma":[0.99665976,0.00057607435,0.00011921859,0.0024404775,0.0001047109,0.00009975967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011308149,0.0002529367,0.00034140007,0.00010919501,0.00043093905,0.00007158846,0.0026020175,0.00013889745,0.000012549016],"category_scores_gemma":[0.00007369158,0.00030533795,0.00012481345,0.0004901857,0.00026966058,0.00024908822,0.0003264763,0.00058361865,0.000079625024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008249954,0.000023212622,0.00012596043,0.000039738705,0.00007725418,4.1191095e-7,0.00018481562,0.9031466,0.0841954,0.0014937868,0.004231552,0.006473017],"study_design_scores_gemma":[0.00043385083,0.00001659678,0.00006667179,0.00004462016,0.000019766703,0.0000016828672,0.00007637214,0.9810081,0.0032509603,0.00008867999,0.014659069,0.00033359125],"about_ca_topic_score_codex":0.0000034167015,"about_ca_topic_score_gemma":0.0000041121484,"teacher_disagreement_score":0.771029,"about_ca_system_score_codex":0.00011853739,"about_ca_system_score_gemma":0.000014138023,"threshold_uncertainty_score":0.99993986},"labels":[],"label_agreement":null},{"id":"W3019262619","doi":"10.1109/lcomm.2020.2990487","title":"Graph Neural Network-Based Channel Tracking for Massive MIMO Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; MIMO; Channel (broadcasting); Graph; Artificial neural network; Factor graph; Feedforward neural network; Computation; Virtual channel; Algorithm; Decoding methods; Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.03677419753259306,"score_gpt":0.2483154060959105,"score_spread":0.21154120856331743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019262619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093419803,0.00081665604,0.98630273,0.010190907,0.00045626762,0.00062431785,0.000017752685,0.00057442853,0.000082732455],"genre_scores_gemma":[0.95381075,0.00007379727,0.041041054,0.0041345106,0.0003660994,0.00032911455,0.000157006,0.00008502642,0.0000026314544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990436,0.00006781516,0.00031980124,0.00017554231,0.00006836965,0.00032486167],"domain_scores_gemma":[0.99865097,0.00026837536,0.00009130302,0.0008248961,0.00006750202,0.000096957236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008988592,0.00018717037,0.00020235924,0.000057780522,0.00023792619,0.000051328057,0.0006646688,0.000076646764,0.0000027456892],"category_scores_gemma":[0.000028544924,0.00022364534,0.000112250804,0.00040890957,0.00006803519,0.00020711991,0.000035664718,0.00026218506,0.0000055781397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075042303,0.0000065606323,0.00004561889,0.000031179614,0.000028998162,5.989609e-7,0.00015722048,0.9866202,0.0017595469,0.00005814675,0.010552942,0.0007314832],"study_design_scores_gemma":[0.00040322615,0.000015864069,0.000029121671,0.0000396946,0.000026652215,8.213169e-7,0.0000307648,0.9968646,0.00026680686,0.000025390249,0.0020726162,0.00022440685],"about_ca_topic_score_codex":0.0000034776676,"about_ca_topic_score_gemma":0.00001312505,"teacher_disagreement_score":0.95287657,"about_ca_system_score_codex":0.000057866484,"about_ca_system_score_gemma":0.0000074521236,"threshold_uncertainty_score":0.9119993},"labels":[],"label_agreement":null},{"id":"W3023634272","doi":"10.1109/lcomm.2020.2993533","title":"A Joint CoMP C-NOMA for Enhanced Cellular System Performance","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Computer science; Interference (communication); Base station; Enhanced Data Rates for GSM Evolution; Single antenna interference cancellation; Computer network; Cellular network; Decoding methods; Telecommunications link; Expression (computer science); Transmission (telecommunications); Ergodic theory; Telecommunications; Channel (broadcasting); Mathematics","score_opus":0.04543887917680482,"score_gpt":0.2253530767953249,"score_spread":0.17991419761852007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023634272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20846613,0.0007121776,0.7782605,0.00824163,0.00013426572,0.000570202,0.000023407116,0.0026942932,0.00089735433],"genre_scores_gemma":[0.9259069,0.00037660298,0.072493844,0.00058482215,0.000033942408,0.00049853406,0.000045200653,0.000053974127,0.0000062032173],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905634,0.00004286944,0.0003831606,0.00017294074,0.000099215,0.00024549858],"domain_scores_gemma":[0.9972426,0.00015177082,0.00009010371,0.0023890203,0.000061675426,0.00006482431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009005479,0.00018625564,0.0002490337,0.00008581129,0.00027326256,0.000033899847,0.0018332552,0.00007431042,0.0000030794795],"category_scores_gemma":[0.000032754637,0.00021400729,0.000085949025,0.00030386922,0.00017274295,0.00019075861,0.00020828524,0.0003382672,0.00008310687],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071229065,0.000017494662,0.000025432804,0.0003153917,0.000053739914,3.5309665e-7,0.0006081737,0.09075874,0.8956729,0.0025304395,0.0024895717,0.0075206296],"study_design_scores_gemma":[0.0004439593,0.000033761582,0.000078883924,0.000102790356,0.00001619384,0.0000020314876,0.00046742352,0.47369543,0.5046147,0.000020904596,0.020173928,0.00034998052],"about_ca_topic_score_codex":0.0000017586041,"about_ca_topic_score_gemma":0.0000016919045,"teacher_disagreement_score":0.7174407,"about_ca_system_score_codex":0.00014832974,"about_ca_system_score_gemma":0.000010022366,"threshold_uncertainty_score":0.8726964},"labels":[],"label_agreement":null},{"id":"W3027314774","doi":"10.1109/lcomm.2020.3029178","title":"Power Allocation and Link Selection for Multicell Cooperative NOMA Hybrid VLC/RF Systems","year":2020,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; King Fahd University of Petroleum and Minerals; King Abdullah University of Science and Technology","keywords":"Visible light communication; Computer science; Noma; Computer network; Transmitter power output; Context (archaeology); Interference (communication); Quality of service; Throughput; Power (physics); Telecommunications; Transmitter; Wireless; Telecommunications link; Engineering; Electrical engineering; Physics; Channel (broadcasting)","score_opus":0.033732310255750596,"score_gpt":0.27051001495515137,"score_spread":0.23677770469940077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027314774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022494175,0.005461751,0.9493711,0.01691654,0.00064244296,0.0022628054,0.00022104334,0.0023168905,0.00031328344],"genre_scores_gemma":[0.930314,0.003506572,0.0631804,0.00030117648,0.00007332488,0.0019715147,0.00051967846,0.000114000984,0.00001931299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847853,0.00013209539,0.0005869789,0.00041996734,0.00012059029,0.00026186267],"domain_scores_gemma":[0.996138,0.00052926346,0.00024284462,0.002753049,0.00026231047,0.00007453097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017780229,0.00040247195,0.0004372259,0.00023363526,0.00034355893,0.0001933653,0.0017701917,0.00025990335,0.000002451777],"category_scores_gemma":[0.00015315364,0.00048730374,0.00009204444,0.00022956578,0.00027765197,0.00020906597,0.0007429503,0.0012178733,0.000018994842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001756922,0.00006163584,0.000083516425,0.0005944969,0.0003851845,4.2084406e-7,0.0009863044,0.8210727,0.15809935,0.0059303828,0.0061376854,0.0066307522],"study_design_scores_gemma":[0.0004599961,0.00003764552,0.000058516907,0.0002500199,0.00006424015,0.000004759667,0.00022753388,0.94275707,0.017693102,0.0005456979,0.03721263,0.00068878237],"about_ca_topic_score_codex":0.00003492792,"about_ca_topic_score_gemma":0.000018817671,"teacher_disagreement_score":0.90781987,"about_ca_system_score_codex":0.00032426076,"about_ca_system_score_gemma":0.00004321974,"threshold_uncertainty_score":0.9997579},"labels":[],"label_agreement":null},{"id":"W3036626785","doi":"10.1109/lcomm.2020.3002859","title":"A Novel Distributed Algorithm for Phase Synchronization in Unmanned Aerial Vehicles","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"RSS; Drone; Computer science; Algorithm; Synchronizing; Convergence (economics); Synchronization (alternating current); Base station; Real-time computing; Control theory (sociology); Telecommunications; Artificial intelligence; Channel (broadcasting)","score_opus":0.026915635109185255,"score_gpt":0.26117901501899177,"score_spread":0.2342633799098065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036626785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010726367,0.000088324334,0.9808271,0.0071704504,0.00007388725,0.0005205529,0.0003287188,0.00023404449,0.000030541356],"genre_scores_gemma":[0.80779964,0.00012296544,0.18882258,0.00081209815,0.00012559669,0.0004864841,0.0017870353,0.000041977317,0.0000016222153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993761,0.000018739755,0.00026247423,0.00013065145,0.0000611439,0.0001508598],"domain_scores_gemma":[0.9992822,0.00007798626,0.000041144896,0.0004971589,0.00004722073,0.000054322118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006211857,0.00010832319,0.00012077898,0.000064402186,0.00011015845,0.000044644516,0.00041231772,0.000053657262,0.0000054463344],"category_scores_gemma":[0.000021409214,0.0001322471,0.000037130452,0.00047057934,0.000048102782,0.0001479627,0.00003229934,0.00010936887,0.000010422631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026507561,0.00038455197,0.00006234652,0.00006537203,0.00007116964,5.4427744e-7,0.0011028498,0.661703,0.23161164,0.00078849116,0.013567363,0.090616174],"study_design_scores_gemma":[0.0015277937,0.000018099694,0.000060129616,0.000011307986,0.000015265536,7.142699e-7,0.000034342913,0.9866673,0.0018003506,0.000014920643,0.009706475,0.00014330375],"about_ca_topic_score_codex":0.000014373894,"about_ca_topic_score_gemma":0.000018040064,"teacher_disagreement_score":0.79707325,"about_ca_system_score_codex":0.00009425516,"about_ca_system_score_gemma":0.000014156669,"threshold_uncertainty_score":0.5392881},"labels":[],"label_agreement":null},{"id":"W3038849551","doi":"10.1109/lcomm.2020.3007191","title":"Robust Recursive RSSD Based Source Localization in Gaussian Mixture Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cramér–Rao bound; Estimator; Gaussian noise; Algorithm; Gaussian; Mathematics; Noise (video); Upper and lower bounds; Noise measurement; Benchmark (surveying); Signal-to-noise ratio (imaging); Mathematical optimization; Computer science; Applied mathematics; Estimation theory; Noise reduction; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.03282035298952111,"score_gpt":0.2222320983360919,"score_spread":0.1894117453465708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038849551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073039187,0.00036042405,0.9513705,0.038744606,0.0002038535,0.00030145544,0.00001216003,0.001050766,0.0006523255],"genre_scores_gemma":[0.98769325,0.000116260504,0.004639439,0.0072852,0.000049384344,0.00006298142,0.00010261889,0.00004360277,0.000007243834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991715,0.00007467794,0.00026408222,0.00015938337,0.0001135532,0.00021680932],"domain_scores_gemma":[0.99899,0.00007173298,0.00004449806,0.0008002753,0.000036578025,0.000056936304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073906114,0.00015826238,0.00015985778,0.00017704023,0.000118955766,0.000047056263,0.00079233485,0.00013187736,0.000022517208],"category_scores_gemma":[0.00007005374,0.00017754208,0.000048960017,0.0008015437,0.00012146683,0.00013289189,0.000056383193,0.00034642933,0.00005090749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040809464,0.000016861839,0.00037919116,0.000036654128,0.00001149422,0.000002253279,0.0017934255,0.9794188,0.0023811387,0.0002893033,0.0146624595,0.0010043042],"study_design_scores_gemma":[0.00041016474,0.000015141628,0.00006456211,0.00006612571,0.000012242262,0.0000012484811,0.0004813199,0.93917876,0.012119012,0.000053107775,0.047319107,0.00027918047],"about_ca_topic_score_codex":0.000019519182,"about_ca_topic_score_gemma":0.000038832048,"teacher_disagreement_score":0.98038936,"about_ca_system_score_codex":0.00009648752,"about_ca_system_score_gemma":0.000011842732,"threshold_uncertainty_score":0.72399557},"labels":[],"label_agreement":null},{"id":"W3044698225","doi":"10.1109/lcomm.2020.3010698","title":"RFF Based Detection for SCMA in Presence of PA Nonlinearity","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Codebook; Computer science; Robustness (evolution); Message passing; Bit error rate; Multiuser detection; Algorithm; Nonlinear system; Amplifier; Random access; Coding (social sciences); Computer engineering; Decoding methods; Code division multiple access; Bandwidth (computing); Distributed computing; Telecommunications; Computer network; Mathematics","score_opus":0.047617748879650416,"score_gpt":0.2729470894435615,"score_spread":0.22532934056391107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044698225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10129482,0.00038702154,0.8837547,0.013287124,0.000058919082,0.00047584844,0.00004369985,0.000590398,0.00010748843],"genre_scores_gemma":[0.9009478,0.00017878393,0.09824449,0.00038321142,0.000008194247,0.00019751191,0.000020238045,0.000019274456,4.9538113e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936664,0.000048757774,0.00028424876,0.000104692765,0.00006995626,0.00012573146],"domain_scores_gemma":[0.9979532,0.00043994575,0.00006487477,0.0014687913,0.000047545807,0.000025682457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009830188,0.000093419956,0.00014711235,0.00010893766,0.000061959945,0.000009104015,0.0011915604,0.000062359904,0.0000018821593],"category_scores_gemma":[0.00021443002,0.00011293743,0.000046931833,0.00042861054,0.00016422509,0.00013464293,0.00010040827,0.00027349746,0.000003269915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001761272,0.000057179688,0.00065410475,0.00013047957,0.000016601003,2.0309129e-7,0.00031282834,0.44530347,0.5272554,0.00024384036,0.00050088303,0.025507383],"study_design_scores_gemma":[0.0003484324,0.000020167752,0.000715247,0.000035063145,0.0000044338985,2.3732035e-7,0.00009164916,0.8024027,0.19216716,0.00011013908,0.003975741,0.00012903135],"about_ca_topic_score_codex":0.000023258228,"about_ca_topic_score_gemma":0.00016611864,"teacher_disagreement_score":0.799653,"about_ca_system_score_codex":0.000054993157,"about_ca_system_score_gemma":0.000010656536,"threshold_uncertainty_score":0.46054545},"labels":[],"label_agreement":null},{"id":"W3044716756","doi":"10.1109/lcomm.2020.3010324","title":"Optimal Resource Allocation for Wireless Powered Sensors: A Perspective From Age of Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Age of Information Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Energy harvesting; Computer science; Wireless sensor network; Bandwidth (computing); Base station; Wireless; Resource allocation; Transmitter power output; Real-time computing; Energy (signal processing); Computer network; Mathematical optimization; Telecommunications; Channel (broadcasting); Mathematics","score_opus":0.0244651112847504,"score_gpt":0.25236688654312495,"score_spread":0.22790177525837454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044716756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014196462,0.000026675682,0.9339526,0.050157774,0.00005542876,0.00050214224,0.000048314036,0.00017193731,0.0008886201],"genre_scores_gemma":[0.5629781,0.000022838047,0.43152902,0.004931066,0.00003448411,0.00007072888,0.00041935334,0.000009442101,0.0000049872174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988446,0.00010952318,0.0005111118,0.00015536214,0.00023398883,0.00014537685],"domain_scores_gemma":[0.9975729,0.00027827994,0.0004327889,0.001258161,0.00038271386,0.000075131626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017963086,0.00012987418,0.0001699145,0.00014120074,0.00018713175,0.00015114315,0.0018072131,0.000064116175,0.0000044828075],"category_scores_gemma":[0.00018032905,0.0001472895,0.00008438633,0.00046913468,0.00011801332,0.0021362493,0.0002243798,0.00014112778,0.000032621643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000255786,0.00025369567,0.00009592208,0.00013486703,0.00035283607,0.0000018771365,0.25141716,0.44214982,0.06877553,0.18279037,0.037909996,0.01586213],"study_design_scores_gemma":[0.00085352483,0.000068994865,0.0002118532,0.00003562977,0.000020466736,0.0000015722541,0.0028297685,0.97531694,0.006153616,0.00016535426,0.014090373,0.00025189348],"about_ca_topic_score_codex":0.00006974628,"about_ca_topic_score_gemma":0.000003348611,"teacher_disagreement_score":0.54878163,"about_ca_system_score_codex":0.00011740995,"about_ca_system_score_gemma":0.000058011152,"threshold_uncertainty_score":0.60062915},"labels":[],"label_agreement":null},{"id":"W3046846865","doi":"10.1109/lcomm.2020.3013377","title":"No Cross-Validation Required: An Analytical Framework for Regularized Mixed-Integer Problems","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Regularization (linguistics); Mathematical optimization; Upper and lower bounds; Rate of convergence; Differentiable function; Computer science; Algorithm; Benchmark (surveying); Applied mathematics; Mathematics; Convergence (economics); Artificial intelligence; Mathematical analysis","score_opus":0.05706915218197176,"score_gpt":0.31891226958177826,"score_spread":0.2618431173998065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046846865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005297827,0.00006542718,0.9882155,0.0042473045,0.00034143074,0.00072697207,0.000035096586,0.0006875718,0.00038287035],"genre_scores_gemma":[0.6306992,0.00004618049,0.36703297,0.0010837404,0.00026539175,0.00036246152,0.00036210511,0.00010054563,0.00004739385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987929,0.00009828864,0.00047580752,0.00025289028,0.00012617931,0.00025395094],"domain_scores_gemma":[0.99783856,0.0002420342,0.00009932982,0.0015035215,0.00017939077,0.00013718408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020446646,0.00019021398,0.00023423422,0.00007519486,0.00020114743,0.00013654986,0.00081121485,0.00014641845,0.000014884883],"category_scores_gemma":[0.00028613865,0.00021746046,0.00009157488,0.00033823127,0.00012666197,0.00059659884,0.000058028698,0.00029544625,0.0000870749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028346267,0.000043944103,0.00017712392,0.00014452096,0.00008120103,4.779378e-7,0.0007118195,0.9325956,0.053407725,0.007745215,0.004588036,0.0004759995],"study_design_scores_gemma":[0.00046605928,0.000041825864,0.00003179548,0.00007636649,0.00003805338,0.00000208901,0.00003944615,0.98275536,0.0024662183,0.00060104154,0.013171123,0.0003106167],"about_ca_topic_score_codex":0.000004638068,"about_ca_topic_score_gemma":0.0000033015438,"teacher_disagreement_score":0.6254014,"about_ca_system_score_codex":0.00011871104,"about_ca_system_score_gemma":0.000014866168,"threshold_uncertainty_score":0.886778},"labels":[],"label_agreement":null},{"id":"W3053826104","doi":"10.1109/lcomm.2020.3017219","title":"Exploiting Antenna Diversity to Enhance Hybrid Cooperative Non-Orthogonal Multiple Access","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Computer science; Robustness (evolution); Single antenna interference cancellation; Spectral efficiency; Interference (communication); Diversity gain; Cooperative diversity; Electronic engineering; Computer network; Computer engineering; Computer architecture; Telecommunications; MIMO; Fading; Telecommunications link; Beamforming; Engineering; Decoding methods","score_opus":0.052572578215624305,"score_gpt":0.2947786316662139,"score_spread":0.24220605345058957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3053826104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40061933,0.00016628126,0.5792174,0.018209616,0.000075264696,0.00032725759,0.000048408136,0.0010958805,0.0002405841],"genre_scores_gemma":[0.9666776,0.0004998419,0.028536202,0.0040179873,0.00003041053,0.00015371002,0.00004059803,0.000039064867,0.0000045616734],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895227,0.00006456732,0.00029871945,0.0002495218,0.00015571772,0.00027921464],"domain_scores_gemma":[0.9974529,0.00031129128,0.00007001687,0.0019387527,0.00010330476,0.00012373061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008317301,0.00020986576,0.00023018576,0.000113881455,0.0006213914,0.00007788776,0.0037446944,0.000043526943,0.000012054121],"category_scores_gemma":[0.0001988544,0.0002516433,0.00006210276,0.0004971249,0.00019742826,0.0005982958,0.002499291,0.0005286562,0.00012644219],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026398413,0.00007699247,0.005258211,0.000062216546,0.0001379644,0.000009200978,0.004192563,0.26611578,0.69215924,0.00026380963,0.012630495,0.019067165],"study_design_scores_gemma":[0.0006996348,0.00006927474,0.0044819447,0.00020721143,0.0000326152,0.000007888047,0.0015064493,0.47683033,0.49969348,0.00012661342,0.014888589,0.001455953],"about_ca_topic_score_codex":0.000019807869,"about_ca_topic_score_gemma":0.000035148187,"teacher_disagreement_score":0.5660583,"about_ca_system_score_codex":0.00011022533,"about_ca_system_score_gemma":0.000011922619,"threshold_uncertainty_score":0.99999356},"labels":[],"label_agreement":null},{"id":"W3080469496","doi":"10.1109/lcomm.2020.3018937","title":"Codes With Minimum Bandwidth Cooperative Local Regeneration","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bandwidth (computing); Computer science; Locality; Distributed data store; Block code; Computer network; Distributed computing; Algorithm; Decoding methods","score_opus":0.03726197317733011,"score_gpt":0.26376556011861674,"score_spread":0.22650358694128664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080469496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038614285,0.00015626218,0.87607855,0.11888471,0.000039620205,0.00017184735,0.000012835619,0.0005547183,0.00024000481],"genre_scores_gemma":[0.6687472,0.00008140312,0.32334694,0.0076987497,0.000018813193,0.00005558515,0.00003258374,0.000009551265,0.000009196241],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904954,0.00011284804,0.00018324515,0.00031222522,0.00016505555,0.00017709733],"domain_scores_gemma":[0.99730104,0.00014690775,0.00009429323,0.0023018536,0.00009139038,0.000064536216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074226635,0.0001425392,0.00014760757,0.00006073036,0.0003018086,0.00012099935,0.002866073,0.000042556974,0.000002697612],"category_scores_gemma":[0.000053111347,0.00012440038,0.000023267436,0.00059700344,0.0004913255,0.00080684945,0.00050591526,0.0002608952,0.000058739093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007139992,0.0002964184,0.00048135576,0.000042250886,0.00022361598,0.00006205763,0.008356971,0.068931065,0.3945413,0.29839855,0.11892939,0.10966562],"study_design_scores_gemma":[0.0017957885,0.0006438928,0.0002348024,0.000092764814,0.000045707533,0.00006653467,0.0012384048,0.6368342,0.2400772,0.0009877556,0.11662317,0.0013597803],"about_ca_topic_score_codex":0.00001068036,"about_ca_topic_score_gemma":0.0000447643,"teacher_disagreement_score":0.66488576,"about_ca_system_score_codex":0.00006230888,"about_ca_system_score_gemma":0.000047498652,"threshold_uncertainty_score":0.5325924},"labels":[],"label_agreement":null},{"id":"W3081405700","doi":"10.1109/lcomm.2020.3019437","title":"Distributed Intelligence: A Verification for Multi-Agent DRL-Based Multibeam Satellite Resource Allocation","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Computer science; Resource allocation; Resource management (computing); Reinforcement learning; Schedule; Scheduling (production processes); Distributed computing; Bandwidth (computing); Bandwidth allocation; Computer network; Communications satellite; Computational complexity theory; Broadband; Satellite; Telecommunications; Artificial intelligence; Mathematical optimization; Algorithm","score_opus":0.12670761563871524,"score_gpt":0.3064243155205307,"score_spread":0.17971669988181543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081405700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052584666,0.003399093,0.96843934,0.019494375,0.00021667371,0.001633597,0.00019421682,0.0011923474,0.00017190038],"genre_scores_gemma":[0.92251927,0.00093810784,0.070942886,0.002527242,0.00008620565,0.0008995971,0.0019745482,0.000100914775,0.000011240587],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802786,0.0002709254,0.00080223486,0.00033948224,0.00022592647,0.00033358717],"domain_scores_gemma":[0.9958496,0.00052692904,0.00018745297,0.0030452437,0.00019632326,0.00019441587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039532527,0.0002995343,0.0002875727,0.00014298795,0.00030714917,0.00012322886,0.002079494,0.00013694381,0.000008821126],"category_scores_gemma":[0.00017480881,0.00035529936,0.00016183102,0.0007084815,0.00018601007,0.00019441335,0.000092337745,0.0003497526,0.0001947769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014915585,0.00054080546,0.0014918081,0.00084462203,0.00041995556,0.0000016785955,0.011146466,0.32657966,0.539625,0.0015211591,0.014186347,0.10349334],"study_design_scores_gemma":[0.00044245218,0.000020991542,0.0006114687,0.00005934702,0.000034696717,0.0000011543674,0.0003813854,0.5893538,0.021454915,0.000005371897,0.3872791,0.0003553524],"about_ca_topic_score_codex":0.00001645616,"about_ca_topic_score_gemma":0.000017554403,"teacher_disagreement_score":0.91726077,"about_ca_system_score_codex":0.00028456672,"about_ca_system_score_gemma":0.00003506754,"threshold_uncertainty_score":0.9998899},"labels":[],"label_agreement":null},{"id":"W3083445715","doi":"10.1109/lcomm.2020.3021976","title":"Channel Coding Rate for Finite Blocklength Faster-Than-Nyquist Signaling","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nyquist–Shannon sampling theorem; Computer science; Code rate; Transmission (telecommunications); Bandwidth (computing); Orthogonal frequency-division multiplexing; Channel (broadcasting); Nyquist rate; Algorithm; Topology (electrical circuits); Mathematics; Electronic engineering; Telecommunications; Decoding methods; Sampling (signal processing); Combinatorics","score_opus":0.06371007039176334,"score_gpt":0.2639869924057777,"score_spread":0.20027692201401437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083445715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15262234,0.00083427114,0.7692819,0.070038594,0.0019666601,0.001201519,0.00018828118,0.0020265328,0.001839872],"genre_scores_gemma":[0.9892963,0.00013344851,0.0069967676,0.0028809255,0.00033054457,0.00020846735,0.000051590312,0.00006774799,0.000034194723],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990767,0.000070882,0.0003176605,0.0001764004,0.000089427514,0.00026891803],"domain_scores_gemma":[0.9984595,0.00044972342,0.00006501572,0.0008611033,0.000052429357,0.00011223974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016501624,0.00017771462,0.00018456815,0.00009351565,0.00027512157,0.00007501034,0.00084599474,0.000055501143,0.000012562187],"category_scores_gemma":[0.00009286845,0.0002177451,0.00010438556,0.0002649493,0.00009896327,0.00015709775,0.00007725101,0.00027846213,0.00007668606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016863738,0.000029774284,0.00003363391,0.00016776832,0.00017292978,0.0000017198084,0.0033972596,0.38233668,0.5820571,0.0002095089,0.03078623,0.00079054944],"study_design_scores_gemma":[0.0008631177,0.000038525875,0.000039929477,0.0001162217,0.00007630357,0.0000059209488,0.000566372,0.8294547,0.065378286,0.000084054634,0.102754146,0.00062242575],"about_ca_topic_score_codex":0.000004250595,"about_ca_topic_score_gemma":0.0000028842678,"teacher_disagreement_score":0.836674,"about_ca_system_score_codex":0.00006784964,"about_ca_system_score_gemma":0.000010902742,"threshold_uncertainty_score":0.88793874},"labels":[],"label_agreement":null},{"id":"W3086252326","doi":"10.1109/lcomm.2020.3023967","title":"Wideband Modeling of the Mud-Pulse Communications Channel","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Acoustic Wave Resonator Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Drill string; Attenuation; Computer science; Wideband; Channel (broadcasting); Wireless; Pulse (music); Electronic engineering; Transmission (telecommunications); Acoustics; Electrical engineering; Telecommunications; Engineering; Drill; Physics; Optics; Detector; Mechanical engineering","score_opus":0.053991714353330285,"score_gpt":0.24756930831875443,"score_spread":0.19357759396542415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086252326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28810313,0.010378485,0.41115373,0.27722847,0.00055062305,0.0014043252,0.00018218777,0.0029639136,0.008035123],"genre_scores_gemma":[0.99112886,0.00082576316,0.0068620057,0.0010708257,0.000017008284,0.00005223225,0.000007788193,0.000032387812,0.000003104021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924207,0.00006631105,0.00029887861,0.00009887246,0.0001314484,0.00016239812],"domain_scores_gemma":[0.9961056,0.0001730476,0.000058048325,0.0035719918,0.000050167502,0.000041108407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008525205,0.00012888206,0.00016233047,0.000055522625,0.00020444328,0.000017218514,0.003571442,0.0000719081,0.0000035400064],"category_scores_gemma":[0.00012016239,0.000113863374,0.000087365785,0.00042429127,0.0003856542,0.00009088522,0.00059897755,0.00045602347,0.000014303357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038262265,0.000057545196,0.00023748343,0.0001052377,0.00014967713,5.824099e-7,0.002254569,0.7770928,0.20559967,0.001677751,0.010203939,0.0026168895],"study_design_scores_gemma":[0.00013122051,0.000004905479,0.00005501776,0.00004495495,0.000031986005,0.0000021233266,0.00029090414,0.9924384,0.004481265,0.00019592076,0.0021884786,0.00013482492],"about_ca_topic_score_codex":0.000025549414,"about_ca_topic_score_gemma":0.000015885284,"teacher_disagreement_score":0.70302576,"about_ca_system_score_codex":0.00005305703,"about_ca_system_score_gemma":0.000014166316,"threshold_uncertainty_score":0.66366875},"labels":[],"label_agreement":null},{"id":"W3086990738","doi":"10.1109/lcomm.2020.3023074","title":"Reliable Broadcast Based on Online Fountain Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Glycemic Index Laboratories; University of Alberta","funders":"Natural Science Foundation of Beijing Municipality; China Scholarship Council; National Natural Science Foundation of China","keywords":"Fountain code; Computer science; Fountain; Decoding methods; Raptor code; Luby transform code; Scheme (mathematics); Code (set theory); Wireless; Theoretical computer science; Algorithm; Computer network; Telecommunications; Block code; Concatenated error correction code; Mathematics","score_opus":0.062511879357247,"score_gpt":0.3026936390537778,"score_spread":0.24018175969653077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086990738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00999414,0.00006758679,0.74455243,0.24150595,0.0001795461,0.00026514073,0.0000118133885,0.0016046045,0.0018187681],"genre_scores_gemma":[0.6047639,0.000021275831,0.34320667,0.0518767,0.000043465996,0.000035689478,0.000018401297,0.000017925078,0.000015965152],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871975,0.00019533178,0.00026648832,0.00033946478,0.0002422442,0.00023669298],"domain_scores_gemma":[0.9960552,0.00040745712,0.0001251471,0.003230187,0.00007598137,0.00010606615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024370982,0.00016211941,0.00016701387,0.00012152547,0.0002762406,0.0001291689,0.0041859844,0.000050028797,0.0000061549194],"category_scores_gemma":[0.00013268518,0.00017345436,0.00007939699,0.00067480165,0.00011243448,0.0002452595,0.00040193362,0.00044993166,0.000098901786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093876704,0.0018849564,0.007973455,0.00012889625,0.00010904149,0.00006647831,0.0066954577,0.036882173,0.24527244,0.026204828,0.57737994,0.097308464],"study_design_scores_gemma":[0.00031577286,0.00016923918,0.00042599652,0.000094931806,0.0000103018,0.0000049657865,0.000040503783,0.91017467,0.008390526,0.0001947648,0.079802506,0.00037581666],"about_ca_topic_score_codex":0.00010072627,"about_ca_topic_score_gemma":0.000029281371,"teacher_disagreement_score":0.8732925,"about_ca_system_score_codex":0.00009500487,"about_ca_system_score_gemma":0.000057315854,"threshold_uncertainty_score":0.77786696},"labels":[],"label_agreement":null},{"id":"W3088483589","doi":"10.1109/lcomm.2020.3025903","title":"Physical Layer Security Over Mixture Gamma Distributed Fading Channels With Discrete Inputs: A Unified and General Analytical Framework","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Fading; Computer science; Physical layer; Secrecy; Gaussian; Signal-to-noise ratio (imaging); Algorithm; Channel (broadcasting); Applied mathematics; Topology (electrical circuits); Mathematics; Telecommunications; Wireless","score_opus":0.023026879415238108,"score_gpt":0.2733684997219714,"score_spread":0.2503416203067333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088483589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8038106,0.0002665124,0.15554164,0.038475215,0.000044218654,0.00038227564,0.0001370918,0.0010854705,0.00025698097],"genre_scores_gemma":[0.9857268,0.00023501698,0.010930516,0.0026489177,0.00013857758,0.000094059535,0.00016351441,0.000060815855,0.0000017889845],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987425,0.00017821185,0.00028381875,0.0002666546,0.00022108827,0.00030768116],"domain_scores_gemma":[0.99757475,0.0002928163,0.00006978464,0.0017920315,0.000059639766,0.0002110089],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009937814,0.00029000183,0.0003484909,0.000083880215,0.00020831433,0.00014997534,0.0011726393,0.0001431394,0.0000089063615],"category_scores_gemma":[0.000050255003,0.00028256932,0.00007901631,0.0006042413,0.00034979475,0.00028307142,0.00033906265,0.00108533,0.0000082218785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059016334,0.001436436,0.019871524,0.0015175443,0.0040199296,0.00014047165,0.123015426,0.115347445,0.3786875,0.20892599,0.14070934,0.0057382104],"study_design_scores_gemma":[0.00073816924,0.000086923974,0.0014553525,0.0002613584,0.00015242805,0.00001596227,0.00015383986,0.9555705,0.012075832,0.0015358756,0.026902627,0.0010511108],"about_ca_topic_score_codex":0.000021319507,"about_ca_topic_score_gemma":0.000014524656,"teacher_disagreement_score":0.8402231,"about_ca_system_score_codex":0.0000832027,"about_ca_system_score_gemma":0.000013660905,"threshold_uncertainty_score":0.9999626},"labels":[],"label_agreement":null},{"id":"W3094666940","doi":"10.1109/lcomm.2020.3034956","title":"Low-Complexity SCMA Detection for Unsupervised User Access","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"Engineering and Physical Sciences Research Council; Huawei Technologies","keywords":"Computer science; Base station; Computer network; Transmission (telecommunications); Latency (audio); Multiuser detection; Noma; Rendering (computer graphics); Telecommunications link; Telecommunications; Artificial intelligence; Code division multiple access","score_opus":0.10325987788694148,"score_gpt":0.30334534118669315,"score_spread":0.2000854632997517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094666940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09182441,0.0003164746,0.87974083,0.024461273,0.00014517973,0.000625996,0.00004099484,0.002598852,0.00024597222],"genre_scores_gemma":[0.95241135,0.0004651056,0.04447039,0.0020370216,0.000039799754,0.0004653152,0.00005018658,0.000057216253,0.0000035948751],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913067,0.000053649917,0.0003062566,0.000182728,0.00009706633,0.00022963133],"domain_scores_gemma":[0.9972547,0.00024447366,0.00006358123,0.002298305,0.000072072624,0.00006686201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007530292,0.00017743287,0.00018839269,0.00010562536,0.00030244203,0.000084485975,0.0028948935,0.00008685753,0.000011573694],"category_scores_gemma":[0.00009735568,0.00020914382,0.00008664909,0.00047411452,0.00026245133,0.00047479646,0.00032655091,0.00036297218,0.000040503946],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031466312,0.0000814999,0.00026176055,0.0002565554,0.00010670217,5.415927e-7,0.000695181,0.11867237,0.7977507,0.0026832887,0.008336104,0.07112383],"study_design_scores_gemma":[0.0012004292,0.000046116227,0.0013729745,0.000064585394,0.000036733105,0.000003001853,0.00029534084,0.34306514,0.5718327,0.0016131966,0.079643786,0.0008259754],"about_ca_topic_score_codex":0.000008780154,"about_ca_topic_score_gemma":0.00005175583,"teacher_disagreement_score":0.86058694,"about_ca_system_score_codex":0.000103025755,"about_ca_system_score_gemma":0.000008799526,"threshold_uncertainty_score":0.8528637},"labels":[],"label_agreement":null},{"id":"W3101863493","doi":"10.1109/lcomm.2021.3069668","title":"On Systematic Polarization-Adjusted Convolutional (PAC) Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Convolutional code; Algorithm; Systematic error; Turbo code; Coding (social sciences); Upper and lower bounds; Code (set theory); Channel code; Polarization (electrochemistry); Theoretical computer science; Decoding methods; Mathematics; Statistics","score_opus":0.05154111491655979,"score_gpt":0.29351126158759155,"score_spread":0.24197014667103176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101863493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017051904,0.0009824272,0.9581941,0.01816905,0.0016903521,0.0012402167,0.000035487807,0.0017786608,0.0008578376],"genre_scores_gemma":[0.8135965,0.00009078074,0.18082343,0.0044872365,0.000049839327,0.00054304,0.00023106766,0.00004409449,0.00013403222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962088,0.0013085717,0.00081113353,0.00072948635,0.0006070898,0.0003349247],"domain_scores_gemma":[0.9882213,0.001516699,0.00069027726,0.00901198,0.00045825084,0.000101475714],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007786167,0.00041632482,0.0006280158,0.0004732224,0.00048710915,0.00065998593,0.0074759685,0.0002936327,0.000007720147],"category_scores_gemma":[0.0005543394,0.00046117557,0.00026332674,0.00061896804,0.00021576766,0.00029948496,0.0030277565,0.0014429567,0.00006328652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035926103,0.0037483575,0.0041723046,0.038023714,0.0030858577,0.00018027375,0.021698056,0.045077495,0.1238663,0.6727811,0.0853656,0.0019649784],"study_design_scores_gemma":[0.0011019227,0.00017396858,0.003622277,0.055618946,0.00063918205,0.00028939996,0.0005661801,0.90710986,0.012107565,0.013573738,0.000546348,0.004650607],"about_ca_topic_score_codex":0.00025520692,"about_ca_topic_score_gemma":0.00012498928,"teacher_disagreement_score":0.86203235,"about_ca_system_score_codex":0.00049819326,"about_ca_system_score_gemma":0.00032817168,"threshold_uncertainty_score":0.999784},"labels":[],"label_agreement":null},{"id":"W3103796002","doi":"10.1109/lcomm.2021.3058142","title":"Reconfigurable Intelligent Surface-Assisted Uplink Sparse Code Multiple Access","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; Decoding methods; Transmission (telecommunications); Code (set theory); Spectral efficiency; Message passing; Wireless; Scheme (mathematics); Bit error rate; Computer engineering; Algorithm; Parallel computing; Computer network; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.10880599096037007,"score_gpt":0.3174725588141571,"score_spread":0.208666567853787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103796002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30284372,0.018614719,0.6397858,0.021274457,0.0027688763,0.0020563812,0.0003261854,0.008259925,0.004069922],"genre_scores_gemma":[0.87709403,0.025054665,0.09570484,0.000438704,0.000028409435,0.0005091516,0.000938122,0.00016613552,0.00006591627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741894,0.00025151798,0.0010009854,0.00057447975,0.00024273226,0.00051132403],"domain_scores_gemma":[0.9871251,0.0007798863,0.00034579562,0.01139109,0.00024494302,0.00011321047],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00028796928,0.00059964857,0.0007119032,0.00030304526,0.00035833044,0.00047122678,0.008666276,0.00054951553,0.00007178029],"category_scores_gemma":[0.00019089691,0.00074843026,0.00027067735,0.0005914874,0.0004639125,0.00038861178,0.002897917,0.0028322353,0.000089614885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050236313,0.00013264126,0.00047912318,0.00022504368,0.00031291283,0.000006134897,0.00036393336,0.91372925,0.0552462,0.000094995194,0.0069735236,0.022431202],"study_design_scores_gemma":[0.00077300606,0.00001580814,0.001577713,0.0017041673,0.00016765528,0.000032191667,0.0010053804,0.62583387,0.30398858,0.00079479377,0.06128584,0.002821014],"about_ca_topic_score_codex":0.00017362555,"about_ca_topic_score_gemma":0.00070171605,"teacher_disagreement_score":0.57425034,"about_ca_system_score_codex":0.0006426467,"about_ca_system_score_gemma":0.000095300464,"threshold_uncertainty_score":0.9994967},"labels":[],"label_agreement":null},{"id":"W3106800228","doi":"10.1109/lcomm.2020.3039436","title":"Low-Complexity Coding and Spreading for Unsourced Random Access","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Random access; Algorithm; Coding (social sciences); Permutation (music); Payload (computing); Reduction (mathematics); Interference (communication); Transmission (telecommunications); Computational complexity theory; Theoretical computer science; Computer network; Mathematics; Telecommunications","score_opus":0.10595939857259591,"score_gpt":0.3134487988049234,"score_spread":0.20748940023232748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106800228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12374335,0.00037521115,0.8303664,0.033657033,0.00029037983,0.008509156,0.000049728318,0.0008427809,0.0021659688],"genre_scores_gemma":[0.9889757,0.00007821746,0.006522218,0.0027993072,0.000157714,0.0014094835,0.000022019423,0.00003118291,0.0000041377502],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946624,0.000042212807,0.00017369243,0.000105272135,0.000047320675,0.00016526556],"domain_scores_gemma":[0.99909884,0.0003158188,0.00003124965,0.0004649988,0.000017238493,0.000071859424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012041731,0.00010431629,0.00015440206,0.000031136584,0.00021802679,0.00012781276,0.00061876816,0.000035901845,0.000008071974],"category_scores_gemma":[0.00002210415,0.000113410766,0.000045641467,0.00012744962,0.000083245664,0.00015633406,0.000095405674,0.00016560382,0.000005266121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004710168,0.00010109244,0.0030500316,0.0023490884,0.0005200478,0.0000053094377,0.00994567,0.24359097,0.4396265,0.0075115277,0.24240239,0.050426383],"study_design_scores_gemma":[0.003343154,0.00002793492,0.0006400682,0.00019483069,0.000053884985,0.0000037514878,0.000059403974,0.9018235,0.012987659,0.0004175402,0.07991074,0.0005375213],"about_ca_topic_score_codex":0.000006629656,"about_ca_topic_score_gemma":0.000007494847,"teacher_disagreement_score":0.86523235,"about_ca_system_score_codex":0.000021638072,"about_ca_system_score_gemma":0.000003854035,"threshold_uncertainty_score":0.4624757},"labels":[],"label_agreement":null},{"id":"W3110671580","doi":"10.1109/lcomm.2020.3043974","title":"Error Analysis of Localization Based on Minimum-Error Entropy With Fiducial Points","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Non-line-of-sight propagation; Computer science; Algorithm; Fiducial marker; Entropy (arrow of time); Gaussian; Context (archaeology); Variance (accounting); Artificial intelligence; Wireless; Telecommunications","score_opus":0.02699204944762141,"score_gpt":0.24778490621889712,"score_spread":0.22079285677127572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110671580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14588393,0.00006520599,0.8328185,0.018777182,0.00013467699,0.0003758,0.00009036976,0.00096127583,0.00089304027],"genre_scores_gemma":[0.9921997,0.000017254451,0.00443988,0.0030772516,0.000015531235,0.000028172875,0.00019409294,0.000025854268,0.0000022286474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918365,0.000064459906,0.0002797708,0.00014338008,0.00018379306,0.00014493921],"domain_scores_gemma":[0.99872005,0.00010780565,0.00007884341,0.0009857273,0.00006277156,0.000044808836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006296134,0.00014128821,0.0002396936,0.00033667486,0.00009452741,0.000018918885,0.00062379724,0.00007522348,0.00004701055],"category_scores_gemma":[0.00005150434,0.00013500839,0.00008397826,0.0014907988,0.00015886618,0.000072063274,0.000029724708,0.00017000215,0.00001784626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003313105,0.000044716497,0.0021919126,0.00002973024,0.00027779536,0.0000012241441,0.00061693124,0.9863687,0.0057400665,0.00058892264,0.003790444,0.00031638693],"study_design_scores_gemma":[0.00037289018,0.000052284646,0.0008689177,0.000020290203,0.0002875927,1.6639984e-7,0.00014819074,0.98246247,0.0130489925,0.0000053870817,0.002566818,0.00016600125],"about_ca_topic_score_codex":0.000012201153,"about_ca_topic_score_gemma":0.00003378087,"teacher_disagreement_score":0.8463158,"about_ca_system_score_codex":0.000052633615,"about_ca_system_score_gemma":0.00001499516,"threshold_uncertainty_score":0.55054826},"labels":[],"label_agreement":null},{"id":"W3111511957","doi":"10.1109/lcomm.2020.3045665","title":"Deep Learning for MMSE Estimation of a Gaussian Source in the Presence of Bursty Impulsive Noise","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal; Carleton University; Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Noise (video); Minimum mean square error; Mean squared error; Algorithm; Gaussian noise; Computational complexity theory; Deep learning; Artificial neural network; Gaussian; Artificial intelligence; Speech recognition; Pattern recognition (psychology); Statistics; Mathematics","score_opus":0.027679636782947863,"score_gpt":0.28080002373538737,"score_spread":0.2531203869524395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111511957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07787688,0.0001812159,0.8827825,0.03882859,0.000017953307,0.00021699395,7.337463e-7,0.000025142159,0.00006996602],"genre_scores_gemma":[0.8617003,0.000015295118,0.13690549,0.0013217687,0.000010575925,0.00003651389,0.000003616306,0.0000043330897,0.0000020983837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920887,0.00015938746,0.00024594567,0.00012941721,0.00013628525,0.00012009372],"domain_scores_gemma":[0.9983779,0.0005394478,0.00022883681,0.00077129167,0.000055720706,0.000026794178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002721479,0.00006698853,0.00011551876,0.000061603474,0.00013108991,0.000042724252,0.0020088812,0.000022378304,5.902676e-7],"category_scores_gemma":[0.00029491607,0.00005641684,0.000048237223,0.00048109033,0.00012422282,0.00027173894,0.00014905857,0.00016888659,0.0000016092373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003465934,0.00019527334,0.0034416858,0.00025320984,0.000036424684,0.0000017936044,0.07722678,0.3765052,0.23051511,0.0012064773,0.0008607475,0.30972263],"study_design_scores_gemma":[0.0003455274,0.00006327533,0.0019100957,0.00008548068,0.000010757291,0.0000032566704,0.0006478422,0.9581246,0.037820604,0.0002928381,0.00058955443,0.00010617326],"about_ca_topic_score_codex":0.000029059302,"about_ca_topic_score_gemma":0.000009406747,"teacher_disagreement_score":0.78382343,"about_ca_system_score_codex":0.0000131814095,"about_ca_system_score_gemma":0.00002766012,"threshold_uncertainty_score":0.37330344},"labels":[],"label_agreement":null},{"id":"W3116062642","doi":"10.1109/lcomm.2020.3047994","title":"Detection for Hybrid Beamforming Millimeter Wave Massive MIMO Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; MIMO; Computer science; Precoding; Channel (broadcasting); Extremely high frequency; Electronic engineering; Computational complexity theory; Detector; Channel state information; Telecommunications; Algorithm; Wireless; Engineering","score_opus":0.0618964789667658,"score_gpt":0.2397026670872917,"score_spread":0.1778061881205259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116062642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047751237,0.00048479805,0.94760734,0.0025804967,0.00040763986,0.0005176218,0.00004781032,0.0003374593,0.00026557918],"genre_scores_gemma":[0.97568417,0.00012828408,0.022213912,0.0014222721,0.00015502842,0.00026440507,0.000069522466,0.000052956344,0.000009429542],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991533,0.00004656838,0.000330988,0.00016280738,0.00009020072,0.00021614014],"domain_scores_gemma":[0.9989841,0.0001257041,0.000063202344,0.00065874297,0.00007019119,0.00009803204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011692482,0.00015565052,0.00016570705,0.00009425579,0.00021966164,0.00007474001,0.00035871973,0.000043552653,0.000004786401],"category_scores_gemma":[0.000032611406,0.00017253455,0.00010474269,0.00013039255,0.000039240575,0.00017293287,0.000047877274,0.00020276604,0.000033963777],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063949055,0.00000843255,0.0000040556392,0.0001085876,0.00008302991,5.0362365e-7,0.0005782533,0.06862283,0.92007524,0.000030618645,0.0018823474,0.008599697],"study_design_scores_gemma":[0.00024600717,0.000019530535,0.0000013823892,0.000027119024,0.0000352148,0.000003897274,0.00008977257,0.7976853,0.18715379,0.000022046279,0.014523403,0.00019251436],"about_ca_topic_score_codex":0.000012176438,"about_ca_topic_score_gemma":0.0000037054217,"teacher_disagreement_score":0.927933,"about_ca_system_score_codex":0.00008727238,"about_ca_system_score_gemma":0.0000072620574,"threshold_uncertainty_score":0.7035755},"labels":[],"label_agreement":null},{"id":"W3116264770","doi":"10.1109/lcomm.2020.3046644","title":"Outage Analysis of NOMA-Based Multiple-Antenna Hybrid Satellite-Terrestrial Relay Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Relay; Single antenna interference cancellation; Noma; Interference (communication); Antenna (radio); Satellite; Communications satellite; Computer network; Outage probability; Telecommunications; Topology (electrical circuits); Electronic engineering; Power (physics); Fading; Telecommunications link; Electrical engineering; Decoding methods; Engineering","score_opus":0.055251972873539196,"score_gpt":0.25506331982366043,"score_spread":0.19981134695012123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116264770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47462064,0.015419832,0.48342445,0.019811556,0.001174749,0.0015802629,0.00031273576,0.0020253258,0.0016304414],"genre_scores_gemma":[0.99130064,0.0011257196,0.005311074,0.0016090731,0.000075871256,0.00007318738,0.00043514106,0.00006501574,0.0000042638726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997831,0.00041389244,0.0009646723,0.00025125436,0.0002448658,0.00029431356],"domain_scores_gemma":[0.994351,0.0011948015,0.00024592254,0.00396987,0.000074553354,0.00016384744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003272985,0.00026922973,0.0005886425,0.0003878031,0.00012973209,0.00006365752,0.0024456964,0.00009351945,0.000023041717],"category_scores_gemma":[0.00012256578,0.00030623394,0.00038994162,0.0016823849,0.00022683191,0.000151445,0.00016030075,0.00048373724,0.000052258754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067626526,0.00010249101,0.028025072,0.000059495454,0.002016584,0.0000062704203,0.0013490359,0.887413,0.074991725,0.00003720108,0.0016678363,0.0042636185],"study_design_scores_gemma":[0.00059640995,0.0000140448765,0.0035306357,0.00003663864,0.00038773465,9.612157e-7,0.00007101598,0.9593059,0.0015391811,6.241221e-7,0.034219205,0.0002976458],"about_ca_topic_score_codex":0.000072524206,"about_ca_topic_score_gemma":0.000066376786,"teacher_disagreement_score":0.51668,"about_ca_system_score_codex":0.00009597927,"about_ca_system_score_gemma":0.000020519576,"threshold_uncertainty_score":0.99993896},"labels":[],"label_agreement":null},{"id":"W3116341528","doi":"10.1109/lcomm.2020.3045719","title":"SVD-Based Design for Non-Orthogonal Frequency Division Multiplexing","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Orthogonal frequency-division multiplexing; Orthogonality; Spectral efficiency; Algorithm; Cyclic prefix; Additive white Gaussian noise; Computer science; Singular value decomposition; Bandwidth (computing); Multiplexing; Channel (broadcasting); Mathematics; Electronic engineering; Telecommunications; Engineering","score_opus":0.0825673144198651,"score_gpt":0.28100488158369186,"score_spread":0.19843756716382677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116341528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03189678,0.00012463861,0.95173293,0.014708791,0.00030998886,0.00047960275,0.000039092673,0.00046847714,0.00023971124],"genre_scores_gemma":[0.78241915,0.000016011985,0.21545944,0.0016682368,0.00010600061,0.00023116305,0.000054453452,0.000043005224,0.0000025426366],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999179,0.0000633073,0.00027045523,0.00015768154,0.00011833805,0.00021119749],"domain_scores_gemma":[0.9985273,0.00039331615,0.00004792595,0.0008836215,0.00004669137,0.00010116411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000138597,0.00014896384,0.00013996576,0.00008118047,0.00022622483,0.00004154459,0.0007914263,0.000054405253,0.000015275364],"category_scores_gemma":[0.000080272825,0.00017485945,0.00009713264,0.00019228987,0.00009169882,0.00014997233,0.000038316088,0.0002329658,0.000055092256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062245954,0.000022583652,0.0003020652,0.000044694476,0.0000369741,6.2030034e-7,0.0003664086,0.4613979,0.5209875,0.00009503812,0.015169218,0.0015707742],"study_design_scores_gemma":[0.0006343211,0.000029409308,0.00056883023,0.000045726894,0.000017902683,0.0000012883703,0.000028907489,0.9591822,0.030377435,0.00008792815,0.008724409,0.0003016571],"about_ca_topic_score_codex":0.0000046897753,"about_ca_topic_score_gemma":0.0000019028671,"teacher_disagreement_score":0.7505224,"about_ca_system_score_codex":0.00008028065,"about_ca_system_score_gemma":0.00002395415,"threshold_uncertainty_score":0.71305615},"labels":[],"label_agreement":null},{"id":"W3118018712","doi":"10.1109/lcomm.2020.3047379","title":"Rate-Power Trade-Off in Simultaneous Lightwave Information and Power Transfer Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Photovoltaic system; Computer science; Maximum power transfer theorem; Maximum power point tracking; Voltage; Power (physics); Bandwidth (computing); Maximum power principle; Electrical engineering; Electronic engineering; Telecommunications; Engineering; Physics","score_opus":0.011957150532076787,"score_gpt":0.20023200061952814,"score_spread":0.18827485008745135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118018712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89442843,0.0032612397,0.07667281,0.019438803,0.0007004441,0.0006768396,0.000043495846,0.0010917502,0.003686218],"genre_scores_gemma":[0.9972969,0.00042393376,0.00062777527,0.0015298467,0.000024047375,0.00003179526,0.00003284053,0.000030333129,0.000002523267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991269,0.00010707796,0.00038246292,0.00010135493,0.00008319925,0.00019897668],"domain_scores_gemma":[0.9987794,0.0005025349,0.000024902394,0.0005880268,0.000017055727,0.000088064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001267912,0.00015799867,0.00017358195,0.00008858892,0.000075626245,0.000100854304,0.00044257124,0.00009599596,0.0000050935428],"category_scores_gemma":[0.000053967662,0.00017621611,0.000029293235,0.0002821328,0.00007870945,0.000387206,0.000031850483,0.00040019728,0.000019678298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052965142,0.0000107270735,0.00021505609,0.000044641307,0.00002815174,0.0000037909097,0.004145596,0.98456615,0.007932215,0.0007866582,0.001351345,0.00091038056],"study_design_scores_gemma":[0.00048391384,0.000024494488,0.0004028974,0.000110277775,0.000014852854,0.0000061011206,0.00023127398,0.94121194,0.000423259,0.000006040613,0.056739558,0.0003453778],"about_ca_topic_score_codex":0.000016922068,"about_ca_topic_score_gemma":0.000019273051,"teacher_disagreement_score":0.1028685,"about_ca_system_score_codex":0.0000593875,"about_ca_system_score_gemma":0.000008470008,"threshold_uncertainty_score":0.7185885},"labels":[],"label_agreement":null},{"id":"W3118848851","doi":"10.1109/lcomm.2021.3049188","title":"Lower Bounds on Bandwidth Requirements of Regenerating Code Parameter Scaling in Distributed Storage Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Bandwidth (computing); Distributed computing; Scaling; Fault tolerance; Distributed data store; Upper and lower bounds; Reliability (semiconductor); Code (set theory); Variety (cybernetics); Set (abstract data type); Computer network; Mathematics","score_opus":0.06078671273120112,"score_gpt":0.3076918176642665,"score_spread":0.2469051049330654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118848851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1607575,0.00085129775,0.83316797,0.004247782,0.00039505074,0.0001749856,0.00011051547,0.00020639959,0.00008847917],"genre_scores_gemma":[0.8905613,0.00006393812,0.10875788,0.00044211515,0.000010830033,0.00005190938,0.000093515824,0.0000111636455,0.000007390696],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984644,0.00025155387,0.00046878643,0.00034399098,0.00022235408,0.00024893606],"domain_scores_gemma":[0.99491805,0.00041970005,0.00022986061,0.004300198,0.0000994821,0.000032718614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033660608,0.00014376771,0.00023231738,0.0001616155,0.00017494455,0.00013274937,0.002383479,0.00006721774,0.0000011398445],"category_scores_gemma":[0.0003411024,0.00015426062,0.00004880796,0.0007962248,0.00018538444,0.00047814404,0.00073045027,0.0003146309,0.000006142989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027725378,0.0014032,0.006932288,0.00017504861,0.00020459609,0.00017329787,0.0015096582,0.24376689,0.38524193,0.3266026,0.009245983,0.024716776],"study_design_scores_gemma":[0.00293752,0.00023533625,0.0025455533,0.0022009886,0.000051347215,0.00005742427,0.00068119407,0.77451485,0.1923859,0.0035703676,0.018988563,0.0018309695],"about_ca_topic_score_codex":0.00002986727,"about_ca_topic_score_gemma":0.00003713692,"teacher_disagreement_score":0.72980374,"about_ca_system_score_codex":0.00021790268,"about_ca_system_score_gemma":0.000045844805,"threshold_uncertainty_score":0.6290565},"labels":[],"label_agreement":null},{"id":"W3119620493","doi":"10.1109/lcomm.2021.3051558","title":"Delay Minimization in Sliced Multi-Cell Mobile Edge Computing (MEC) Systems","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mobile edge computing; Computer science; Mathematical optimization; Convergence (economics); Resource allocation; Edge computing; Integer programming; Optimization problem; Computational complexity theory; Enhanced Data Rates for GSM Evolution; Algorithm; Mathematics","score_opus":0.045780734199146626,"score_gpt":0.2872771969416882,"score_spread":0.24149646274254155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119620493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13140513,0.0035385962,0.84852123,0.0014059313,0.013237304,0.00096778834,0.0000024549252,0.00041116367,0.00051042094],"genre_scores_gemma":[0.7956854,0.00019240612,0.20211564,0.0008692483,0.00063159614,0.0001799884,0.00022603087,0.000052802447,0.000046894464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961997,0.0009767463,0.0010523015,0.0009012908,0.00029806298,0.0005718525],"domain_scores_gemma":[0.99297917,0.00058202795,0.0006299961,0.005425668,0.00026400833,0.00011912397],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008001993,0.00044629665,0.00058409397,0.00051180884,0.00046264287,0.001015047,0.00613962,0.00032474287,8.2907854e-7],"category_scores_gemma":[0.000049441544,0.0005456328,0.00020632088,0.0008806003,0.00011552905,0.00033766907,0.0051602484,0.0014584451,0.000035138175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006833495,0.002013046,0.0056090336,0.0011788751,0.00022514962,0.00008612674,0.038683165,0.88105613,0.01764549,0.00043412804,0.020940546,0.03212145],"study_design_scores_gemma":[0.00052849454,0.000010567547,0.00038009472,0.0005915083,0.000019605446,0.000011753091,0.00015767838,0.9928003,0.00032564835,0.00000921543,0.0045738625,0.0005913032],"about_ca_topic_score_codex":0.00072434737,"about_ca_topic_score_gemma":0.000037395934,"teacher_disagreement_score":0.6642803,"about_ca_system_score_codex":0.000409578,"about_ca_system_score_gemma":0.0002682819,"threshold_uncertainty_score":0.99969953},"labels":[],"label_agreement":null},{"id":"W3120100215","doi":"10.1109/lcomm.2021.3051463","title":"Input-Distribution-Aware Successive Cancellation List Decoding of Polar Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Decoding methods; Computer science; Polar code; Reduction (mathematics); Code (set theory); Parallel computing; List decoding; Algorithm; Latency (audio); Block (permutation group theory); Set (abstract data type); Block code; Concatenated error correction code; Telecommunications; Mathematics","score_opus":0.03907823316342272,"score_gpt":0.31394910339522136,"score_spread":0.2748708702317986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120100215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06475564,0.0009971736,0.92048085,0.011519583,0.00090753194,0.00039008353,0.00015124447,0.00055516395,0.00024272368],"genre_scores_gemma":[0.8978459,0.00039251262,0.100297,0.0005898256,0.0000537434,0.00010981171,0.00067318924,0.000024369743,0.0000136151075],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749744,0.00056071783,0.0007140945,0.0005825322,0.00035827348,0.00028693076],"domain_scores_gemma":[0.9918036,0.0007519499,0.00092896627,0.0058045,0.0006359376,0.00007508452],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005358012,0.0003101036,0.00046438456,0.0002306371,0.0003830565,0.00032404767,0.0056459564,0.00024977818,0.0000067442284],"category_scores_gemma":[0.00024501825,0.00038264433,0.00021794932,0.0006422884,0.00026459008,0.00037651503,0.0033803678,0.0010977054,0.0000034382222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006316859,0.0025251105,0.10776685,0.0039109667,0.0023592026,0.00017335358,0.049974184,0.068907216,0.47610733,0.04971548,0.14194436,0.09655277],"study_design_scores_gemma":[0.00080773945,0.0001028542,0.0065571573,0.005698332,0.0003025737,0.00008181921,0.0008420619,0.7322429,0.23856907,0.0032577391,0.008058407,0.0034793876],"about_ca_topic_score_codex":0.002513372,"about_ca_topic_score_gemma":0.0013929819,"teacher_disagreement_score":0.8330903,"about_ca_system_score_codex":0.0005017583,"about_ca_system_score_gemma":0.00038977264,"threshold_uncertainty_score":0.99986255},"labels":[],"label_agreement":null},{"id":"W3120935988","doi":"10.1109/lcomm.2021.3050326","title":"Few-Shot Learning Based Hybrid Beamforming Under Birth-Death Process of Scattering Paths","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Initialization; Computer science; Beamforming; Channel (broadcasting); Process (computing); Range (aeronautics); Algorithm; Telecommunications; Engineering","score_opus":0.046977693853235074,"score_gpt":0.2712964865068999,"score_spread":0.22431879265366483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120935988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5081485,0.00032359982,0.48942542,0.0010299982,0.00010588384,0.000092018585,0.000007654497,0.00019754823,0.00066941325],"genre_scores_gemma":[0.98442495,0.0001436954,0.014395987,0.0008142786,0.000028005948,0.000042826,0.00007138055,0.000052931628,0.000025972444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895537,0.00008582524,0.0003854107,0.00016968232,0.00017165706,0.00023206425],"domain_scores_gemma":[0.99866027,0.00012488138,0.00008340226,0.0009463487,0.00012222923,0.000062851475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020083431,0.00016193867,0.0001968603,0.00015848679,0.0002070194,0.00004913335,0.000451553,0.000038961032,0.00004574967],"category_scores_gemma":[0.00003373829,0.00019139313,0.00009092642,0.0002479438,0.000060067676,0.00017122614,0.000075455915,0.00036299223,0.000015610005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014896591,0.000022452465,0.00026294732,0.00012633884,0.000030629948,0.000001735804,0.00030681625,0.50702506,0.4908712,0.000012829377,0.000043016793,0.001295521],"study_design_scores_gemma":[0.00029479095,0.000008703109,0.00010932023,0.00020400947,0.000028051041,0.000014077555,0.00031946864,0.502007,0.49567595,0.00004616086,0.0010269036,0.00026555723],"about_ca_topic_score_codex":0.000011135457,"about_ca_topic_score_gemma":0.000009179098,"teacher_disagreement_score":0.47627646,"about_ca_system_score_codex":0.00007482541,"about_ca_system_score_gemma":0.00004407182,"threshold_uncertainty_score":0.78047854},"labels":[],"label_agreement":null},{"id":"W3124416748","doi":"10.1109/lcomm.2021.3053151","title":"Blind Identification of Sparse Systems Using Symbolic Dynamics Encoding","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; York University","funders":"","keywords":"Chaotic; Computer science; Identification (biology); Novelty; System identification; Encoding (memory); Pattern recognition (psychology); SIGNAL (programming language); Algorithm; Mean squared error; ENCODE; Artificial intelligence; Noise (video); Sparse approximation; Signal processing; Speech recognition; Mathematics; Data modeling; Statistics; Telecommunications","score_opus":0.07380075025941525,"score_gpt":0.32230382908754335,"score_spread":0.2485030788281281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124416748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12745723,0.0002559256,0.86598337,0.0052081235,0.00024245314,0.00017528447,0.0000074085833,0.00016685898,0.00050332356],"genre_scores_gemma":[0.9296505,0.0000996085,0.06966907,0.00046089882,0.000017609196,0.000025531226,0.000025723924,0.000011306294,0.00003976696],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984501,0.00041051288,0.00054254476,0.00022880793,0.00022617073,0.00014188448],"domain_scores_gemma":[0.99616444,0.00016356338,0.0003567382,0.0029981376,0.00027630944,0.00004083862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005817006,0.00010316671,0.00017038273,0.00021761359,0.00020001248,0.00023632424,0.001764141,0.000061677834,0.0000011796066],"category_scores_gemma":[0.000058282596,0.00012456815,0.00006945171,0.00078258256,0.00013419155,0.0005348303,0.00033041943,0.00019141844,0.000009859553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018439289,0.00017967801,0.000573987,0.00004624649,0.00005498259,0.000004755962,0.002653115,0.011088796,0.6893673,0.29400474,0.00048599925,0.0015385506],"study_design_scores_gemma":[0.00019689437,0.0000067449514,0.0004076645,0.00008732898,0.000022491678,0.00005766871,0.00022992233,0.93175125,0.0657117,0.00060896965,0.00070556736,0.00021379524],"about_ca_topic_score_codex":0.00007489322,"about_ca_topic_score_gemma":0.000030782798,"teacher_disagreement_score":0.92066246,"about_ca_system_score_codex":0.00013471261,"about_ca_system_score_gemma":0.00011036734,"threshold_uncertainty_score":0.50797415},"labels":[],"label_agreement":null},{"id":"W3126407728","doi":"10.1109/lcomm.2021.3057116","title":"Reconfigurable Intelligent Surface for Mixed FSO-RF Systems With Co-Channel Interference","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Bit error rate; Radio frequency; Subcarrier; Computer science; Co-channel interference; Interference (communication); Optical wireless; Electronic engineering; Wireless; Communications system; Radio over fiber; Channel (broadcasting); Telecommunications; Engineering; Orthogonal frequency-division multiplexing","score_opus":0.047393895553048355,"score_gpt":0.2742068251500264,"score_spread":0.22681292959697807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126407728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03440415,0.0048323064,0.9510354,0.005253225,0.00039973596,0.00062322157,0.000082519706,0.0013678969,0.0020015694],"genre_scores_gemma":[0.967335,0.002816657,0.028896265,0.00016822145,0.000013019354,0.0004099973,0.00014025076,0.00006234474,0.00015825756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989169,0.00008372904,0.00038089973,0.0002222938,0.00010337833,0.00029278515],"domain_scores_gemma":[0.9955175,0.00056714437,0.000099700614,0.0035668,0.00019608921,0.000052772004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015694945,0.00021587424,0.00027488885,0.0000925938,0.00024214844,0.00009748889,0.0016343415,0.000093846436,0.000007759607],"category_scores_gemma":[0.00006129524,0.00022609955,0.00006044303,0.000343828,0.00022799417,0.00020573643,0.00010337954,0.00039678588,0.000042381627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015164302,0.00007987736,0.00007768751,0.00017364488,0.00020349986,0.0000026299008,0.0005118365,0.84852254,0.12972246,0.0025175111,0.0136600835,0.004513068],"study_design_scores_gemma":[0.0008178582,0.0000822684,0.000071072114,0.0006856082,0.00005367303,0.0000681557,0.004925131,0.27774504,0.60844433,0.0005061451,0.10551771,0.0010830166],"about_ca_topic_score_codex":0.000019542676,"about_ca_topic_score_gemma":0.00008490614,"teacher_disagreement_score":0.9329308,"about_ca_system_score_codex":0.0001853287,"about_ca_system_score_gemma":0.000032644595,"threshold_uncertainty_score":0.9220072},"labels":[],"label_agreement":null},{"id":"W3126764447","doi":"10.1109/lcomm.2021.3058189","title":"Energy Efficient Subchannel and Power Allocation in Cooperative VLC Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada","keywords":"Visible light communication; Computer science; Fractional programming; Mathematical optimization; Transmitter power output; Interference (communication); Efficient energy use; Optimization problem; Bandwidth (computing); Nonlinear programming; Power (physics); Quadratic programming; Power optimization; Bandwidth allocation; Nonlinear system; Computer network; Algorithm; Mathematics; Transmitter","score_opus":0.01676217593694278,"score_gpt":0.22761528177440937,"score_spread":0.21085310583746658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126764447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84449023,0.025558898,0.09981589,0.02184429,0.0005088705,0.00037384348,0.000027766324,0.0012037463,0.006176455],"genre_scores_gemma":[0.99501634,0.002534162,0.0019652082,0.00024405337,0.0000061422147,0.00015419102,0.000035948466,0.00002387313,0.00002010538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991543,0.000144119,0.00028627866,0.00015273923,0.00008591307,0.00017660618],"domain_scores_gemma":[0.99783033,0.00026082125,0.00003168877,0.001744645,0.00009391711,0.000038571365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012762123,0.00013014567,0.00016627905,0.00014775012,0.000110165776,0.00007796486,0.00062062015,0.00008721754,0.0000041527114],"category_scores_gemma":[0.000052404943,0.00014781124,0.000023266697,0.00047567204,0.00019753937,0.00008990408,0.00021773785,0.00026685785,0.000012478422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005460058,0.00031418717,0.00060272135,0.00006923315,0.00012512787,0.000008617495,0.0018680907,0.4911004,0.2753991,0.2203768,0.0022934587,0.007836816],"study_design_scores_gemma":[0.0005761173,0.000018041514,0.0010219598,0.00017607043,0.000013430193,0.00001808161,0.0017842836,0.94872206,0.03324426,0.00018090481,0.013722267,0.0005225495],"about_ca_topic_score_codex":0.000050383373,"about_ca_topic_score_gemma":0.00008872622,"teacher_disagreement_score":0.45762163,"about_ca_system_score_codex":0.00012883893,"about_ca_system_score_gemma":0.000017621633,"threshold_uncertainty_score":0.60275674},"labels":[],"label_agreement":null},{"id":"W3127861993","doi":"10.1109/lcomm.2021.3057850","title":"Secrecy Outage Probability and Average Rate of RIS-Aided Communications Using Quantized Phases","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec à Montréal","funders":"","keywords":"Secrecy; Outage probability; Computer science; Artificial noise; Signal-to-noise ratio (imaging); Scaling law; Phase (matter); Telecommunications; Statistical physics; Applied mathematics; Topology (electrical circuits); Scaling; Theoretical computer science; Mathematics; Physical layer; Wireless; Fading; Physics; Computer security; Combinatorics","score_opus":0.08114882328879597,"score_gpt":0.30605678819642457,"score_spread":0.2249079649076286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127861993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7605371,0.006982119,0.22478144,0.0054948283,0.00010624722,0.00048495037,0.00009898561,0.00093034905,0.00058398576],"genre_scores_gemma":[0.8114642,0.0051742536,0.18297346,0.00018547088,0.0000054305856,0.00007522096,0.00007528921,0.000036726637,0.000009935812],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836016,0.0004276318,0.00064349786,0.00022372577,0.000105055646,0.00023995907],"domain_scores_gemma":[0.9910501,0.00097194675,0.00018933974,0.0075418456,0.000189462,0.00005728448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003437261,0.00022740538,0.00038960172,0.00017118106,0.00036213436,0.000051458566,0.002020955,0.00010991409,0.000015117945],"category_scores_gemma":[0.00030906775,0.0002695782,0.000094081246,0.00063306995,0.0009534538,0.000338542,0.0009013576,0.00053343724,0.000004693802],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009162857,0.00023011287,0.0015593958,0.00014037336,0.00016727674,0.000002128191,0.00081985496,0.033600383,0.9443046,0.012958093,0.00018645516,0.006022163],"study_design_scores_gemma":[0.0032780108,0.000049419366,0.0040426766,0.0006871863,0.00022610073,0.00008382828,0.0020841903,0.4412426,0.5047406,0.02583533,0.015930861,0.0017992011],"about_ca_topic_score_codex":0.000055178483,"about_ca_topic_score_gemma":0.0001473999,"teacher_disagreement_score":0.43956402,"about_ca_system_score_codex":0.00012291508,"about_ca_system_score_gemma":0.00004678232,"threshold_uncertainty_score":0.9999756},"labels":[],"label_agreement":null},{"id":"W3131063976","doi":"10.1109/lcomm.2021.3058731","title":"Data-Oriented View for Convolutional Coding With Adaptive Irregular Constellations","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Carleton University","funders":"Academy of Finland","keywords":"Convolutional code; Computer science; Algorithm; Decoding methods; Fading; Encoder; Network packet; Coding (social sciences); Forward error correction; Performance improvement; Constellation; Viterbi algorithm; Viterbi decoder; Coding gain; Theoretical computer science; Computer network; Mathematics; Statistics","score_opus":0.07129909907981043,"score_gpt":0.29762322386984474,"score_spread":0.22632412479003433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131063976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012500196,0.002300605,0.9891721,0.004089287,0.000097415665,0.0004792619,0.00056442316,0.0006930843,0.001353797],"genre_scores_gemma":[0.5303679,0.0011949604,0.46552014,0.0005981247,0.000031791544,0.00030009655,0.0018947528,0.00005437939,0.000037828897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989842,0.000107332795,0.00032625016,0.00023051018,0.00014090663,0.0002107539],"domain_scores_gemma":[0.9948203,0.0006350482,0.00008366016,0.0041274927,0.00027324018,0.000060237606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001597221,0.00017024504,0.00020841113,0.00009180631,0.00038028485,0.00003618431,0.0012646272,0.000055285895,0.00001749515],"category_scores_gemma":[0.000044581346,0.00019202966,0.00004587104,0.00040232923,0.0003350346,0.00037018766,0.00026386662,0.00026259577,0.000011501058],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008613974,0.0005963783,0.0008066418,0.0003825079,0.0016796616,0.00001412657,0.001240486,0.13875265,0.27830127,0.42174906,0.118976794,0.037414297],"study_design_scores_gemma":[0.0011265245,0.00003379544,0.00029008513,0.0003921361,0.0001567144,0.0000715055,0.0005613342,0.42708278,0.0216598,0.0007392977,0.54706657,0.00081947714],"about_ca_topic_score_codex":0.000003896552,"about_ca_topic_score_gemma":0.000078821984,"teacher_disagreement_score":0.5291179,"about_ca_system_score_codex":0.00013827463,"about_ca_system_score_gemma":0.000069733076,"threshold_uncertainty_score":0.78307426},"labels":[],"label_agreement":null},{"id":"W3131663650","doi":"10.1109/lcomm.2021.3061717","title":"Distributed Q-Learning Based Joint Relay Selection and Access Control Scheme for IoT-Oriented Satellite Terrestrial Relay Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Computer science; Throughput; Selection (genetic algorithm); Computer network; Scheme (mathematics); Internet of Things; Joint (building); Access control; Satellite; Distributed computing; Wireless; Power (physics); Telecommunications; Artificial intelligence; Mathematics; Engineering","score_opus":0.03690785620114835,"score_gpt":0.272028948324842,"score_spread":0.23512109212369364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131663650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09688577,0.007714934,0.88436335,0.0076897372,0.00090012525,0.0011906299,0.000070928414,0.0010205052,0.00016398684],"genre_scores_gemma":[0.97942334,0.0014794657,0.017059393,0.00054195727,0.00015483402,0.00042489762,0.0008145312,0.00008180814,0.000019779001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979462,0.0005770483,0.00066840486,0.00028990352,0.00016316342,0.00035530425],"domain_scores_gemma":[0.9967084,0.0010728139,0.00018694162,0.0017183201,0.00019340086,0.00012011903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055878185,0.00025518818,0.00035024693,0.00015293513,0.00049508753,0.00024547373,0.00071629666,0.0001780993,0.000009165102],"category_scores_gemma":[0.00026849404,0.00030192838,0.00013085574,0.0006898318,0.00011181339,0.00021814676,0.00012844891,0.00069618697,0.000007734938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009284985,0.00010444602,0.012514326,0.00011111185,0.0003693996,0.000003001232,0.00030560154,0.88348895,0.09447864,0.0002228265,0.002477047,0.0058317767],"study_design_scores_gemma":[0.0017908415,0.000018200375,0.003086089,0.00013119953,0.000059326765,0.000013017451,0.00006619983,0.84433126,0.0025477395,0.000004208697,0.14763318,0.0003187161],"about_ca_topic_score_codex":0.000027041382,"about_ca_topic_score_gemma":0.00007834776,"teacher_disagreement_score":0.88253754,"about_ca_system_score_codex":0.00023256181,"about_ca_system_score_gemma":0.0000552177,"threshold_uncertainty_score":0.99994326},"labels":[],"label_agreement":null},{"id":"W3131770355","doi":"10.1109/lcomm.2021.3058988","title":"Secrecy Outage Analysis of Two-Hop Decode-and-Forward Mixed RF/UWOC Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Relay; Algorithm; Radio frequency; Signal-to-noise ratio (imaging); Exponential function; Transmitter; Applied mathematics; Topology (electrical circuits); Channel (broadcasting); Mathematics; Telecommunications; Power (physics); Physics; Mathematical analysis; Quantum mechanics; Combinatorics","score_opus":0.02969172233931489,"score_gpt":0.2601319645976866,"score_spread":0.23044024225837173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131770355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7463105,0.006270485,0.24196415,0.0021603145,0.0002346884,0.00025425878,0.000120242395,0.00031667532,0.0023687226],"genre_scores_gemma":[0.9938875,0.00082868926,0.004708271,0.00020906427,0.000022965414,0.00007663326,0.00016919809,0.000035006393,0.000062702085],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985293,0.00027560128,0.0006331186,0.00018591389,0.00016225228,0.00021379214],"domain_scores_gemma":[0.9963709,0.00028073078,0.00012708301,0.0029907369,0.00013820145,0.00009233231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003219439,0.00017963059,0.00046598984,0.00031706376,0.00016465328,0.000111070214,0.0009887748,0.00007060283,0.000016377024],"category_scores_gemma":[0.0000067348815,0.00019618931,0.00019017095,0.0010236232,0.00011670279,0.00011600853,0.00023323862,0.0002333637,0.000018744438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066945345,0.00016782581,0.024964137,0.00031418705,0.0066910926,0.000005407159,0.004691871,0.14285243,0.80202186,0.009951354,0.0010492816,0.0072838706],"study_design_scores_gemma":[0.0020370355,0.00003095609,0.0093185725,0.0003634215,0.0032301052,0.00004591625,0.0042489553,0.8454068,0.055149693,0.0005721599,0.078039594,0.0015568355],"about_ca_topic_score_codex":0.00027330208,"about_ca_topic_score_gemma":0.00044378333,"teacher_disagreement_score":0.7468722,"about_ca_system_score_codex":0.00007777852,"about_ca_system_score_gemma":0.000019772535,"threshold_uncertainty_score":0.80003685},"labels":[],"label_agreement":null},{"id":"W3134238047","doi":"10.1109/lcomm.2021.3062111","title":"Simultaneous Cellular and D2D Communications Exploiting Cooperative Uplink NOMA","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Sejong University","keywords":"Telecommunications link; Noma; Base station; Computer science; Ergodic theory; Transmission (telecommunications); Computer network; Throughput; Telecommunications; Wireless; Mathematics","score_opus":0.02778601893423916,"score_gpt":0.25624003319705146,"score_spread":0.2284540142628123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134238047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19844428,0.037549622,0.7156602,0.037242457,0.00030691712,0.0007548377,0.00007827848,0.0041000172,0.005863406],"genre_scores_gemma":[0.86903036,0.01273498,0.11716045,0.00062268594,0.000017159431,0.0001840783,0.00013886747,0.00006332876,0.000048083293],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986558,0.00019719152,0.00046704925,0.0002548875,0.00012163941,0.00030345132],"domain_scores_gemma":[0.9915073,0.0013978521,0.00009323593,0.0067229075,0.00019935309,0.0000793505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014309025,0.00025666377,0.00028364232,0.00014326208,0.000699942,0.000115843635,0.0023052224,0.00012547168,0.000014550487],"category_scores_gemma":[0.000170943,0.00031467757,0.00006283448,0.0005642311,0.0007351253,0.00030846708,0.0010946332,0.0007863016,0.000057199337],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039350457,0.00016740123,0.0002748988,0.00007152253,0.00021190762,0.000024866227,0.002152717,0.053577576,0.8242604,0.009988217,0.0013061373,0.10796039],"study_design_scores_gemma":[0.0007355189,0.000023801776,0.000069181544,0.00019972194,0.00005939889,0.00007610337,0.003419256,0.7406729,0.17790425,0.0008772554,0.074923255,0.0010393937],"about_ca_topic_score_codex":0.000010637489,"about_ca_topic_score_gemma":0.000066377936,"teacher_disagreement_score":0.6870953,"about_ca_system_score_codex":0.00013782816,"about_ca_system_score_gemma":0.000030496327,"threshold_uncertainty_score":0.9999305},"labels":[],"label_agreement":null},{"id":"W3135509084","doi":"10.1109/lcomm.2021.3064596","title":"Ordinary Differential Equation-Based CNN for Channel Extrapolation Over RIS-Assisted Communication","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Ordinary differential equation; Ode; Computer science; Channel (broadcasting); Convergence (economics); Extrapolation; Convolutional neural network; Partial differential equation; Wireless; Set (abstract data type); Algorithm; Scheme (mathematics); Cellular neural network; Differential equation; Artificial neural network; Artificial intelligence; Applied mathematics; Mathematics; Telecommunications; Mathematical analysis","score_opus":0.05261102504792083,"score_gpt":0.2814156825316446,"score_spread":0.22880465748372378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135509084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042174958,0.0021283256,0.94268745,0.009870453,0.00028460685,0.0006263762,0.00008702243,0.0015949386,0.0005458688],"genre_scores_gemma":[0.8979787,0.00091587397,0.098319806,0.00045842468,0.00003108865,0.00081447634,0.0013656372,0.00007939889,0.000036573805],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984243,0.00022703953,0.00057147624,0.0002603767,0.00019917419,0.0003176238],"domain_scores_gemma":[0.9934727,0.001080221,0.00018367627,0.004956927,0.00024593828,0.00006052969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018289422,0.00027654218,0.00028663554,0.0002607941,0.00061941013,0.00010257882,0.0017638529,0.00015934961,0.000035563848],"category_scores_gemma":[0.00014988075,0.00034191555,0.00016861041,0.0006184311,0.00027481746,0.00037874433,0.00023320955,0.00047130676,0.000022296723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007444045,0.0008136341,0.00067044614,0.00032046577,0.00044700436,0.000003182599,0.00078784814,0.3473894,0.53345907,0.014217377,0.020034872,0.081782244],"study_design_scores_gemma":[0.0017681557,0.000026966987,0.004802921,0.00017781045,0.00008036057,0.000006786723,0.00025379568,0.9235196,0.04977551,0.0024039145,0.016447783,0.000736359],"about_ca_topic_score_codex":0.000016043377,"about_ca_topic_score_gemma":0.00008009483,"teacher_disagreement_score":0.8558038,"about_ca_system_score_codex":0.000279336,"about_ca_system_score_gemma":0.00005195534,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W3139338289","doi":"10.1109/lcomm.2021.3068051","title":"Generic BER Analysis of VLC Channels Impaired by 3D User-Mobility and Imperfect CSI","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Visible light communication; Computer science; Bit error rate; Channel (broadcasting); Channel state information; Electronic engineering; Telecommunications; Computer network; Wireless; Physics; Optics; Engineering; Light-emitting diode","score_opus":0.019666835689850854,"score_gpt":0.24641786067771737,"score_spread":0.2267510249878665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139338289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818919,0.0059933276,0.006682442,0.0044589113,0.000065669694,0.00014014017,0.00006891889,0.0004412569,0.00025743898],"genre_scores_gemma":[0.98240775,0.004246893,0.012852458,0.00024241977,0.0000052124833,0.00008512172,0.00011982016,0.00002479954,0.000015548516],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989157,0.00015518811,0.00040306826,0.00019478372,0.0001242572,0.00020703032],"domain_scores_gemma":[0.99560255,0.000448683,0.00007215489,0.0037184726,0.00010142374,0.000056725494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019591284,0.00016592463,0.00037688584,0.00022616479,0.00012776692,0.000045968278,0.0010416579,0.000110816625,0.000026447007],"category_scores_gemma":[0.000099079334,0.00018387321,0.00013014108,0.0014654214,0.00039515801,0.00014005823,0.0004007999,0.00029607894,0.0000061050728],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060054476,0.00038502557,0.009985713,0.00011025639,0.0026454877,0.000002123627,0.0008604159,0.028004685,0.92751074,0.00080353837,0.0092044845,0.020481544],"study_design_scores_gemma":[0.0009851855,0.00006502246,0.035091676,0.00009249431,0.001628188,0.0000131692095,0.0009029178,0.5981711,0.33566102,0.00016010371,0.02585846,0.0013706331],"about_ca_topic_score_codex":0.00004606967,"about_ca_topic_score_gemma":0.00006411776,"teacher_disagreement_score":0.5918497,"about_ca_system_score_codex":0.00008280826,"about_ca_system_score_gemma":0.000013832711,"threshold_uncertainty_score":0.7498132},"labels":[],"label_agreement":null},{"id":"W3155762846","doi":"10.1109/lcomm.2021.3073026","title":"Robust Beamforming for Enhancing Security in Multibeam Satellite Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Shanghai Aerospace Science and Technology Innovation Foundation; Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Computer science; Beamforming; Telecommunications link; Transmitter power output; Quality of service; Mathematical optimization; Convex optimization; Physical layer; Optimization problem; Algorithm; Computer network; Regular polygon; Telecommunications; Mathematics; Wireless; Transmitter","score_opus":0.05496088347337532,"score_gpt":0.26595954055221505,"score_spread":0.21099865707883972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155762846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31582552,0.15245472,0.49577487,0.0068382835,0.005355207,0.0048103067,0.00027446527,0.0028184864,0.015848158],"genre_scores_gemma":[0.9702589,0.0041966336,0.02435203,0.00024941118,0.00008965117,0.0005411528,0.00019357594,0.000077793884,0.000040857132],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982646,0.00023377483,0.00075688376,0.0002341082,0.00013690045,0.00037375005],"domain_scores_gemma":[0.9956173,0.00084411097,0.00009837105,0.0032134817,0.00014861686,0.00007816972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062981894,0.0002161992,0.00032782528,0.00021201308,0.00019357777,0.00013612576,0.0011910445,0.00011620614,0.000004003095],"category_scores_gemma":[0.000091632166,0.00027224296,0.00010890591,0.0005753587,0.00007536749,0.00028762143,0.00015160623,0.0003873888,0.0000381256],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000121287885,0.00026186206,0.004631409,0.0013111988,0.00027377674,0.000007927499,0.013257098,0.27096507,0.69025826,0.0045453743,0.0013646267,0.01311124],"study_design_scores_gemma":[0.0015927742,0.000014077103,0.0005796768,0.0010968598,0.00005172851,0.000056041663,0.0040318323,0.45168817,0.041534074,0.00016872506,0.4979914,0.0011946326],"about_ca_topic_score_codex":0.00010194422,"about_ca_topic_score_gemma":0.0009820573,"teacher_disagreement_score":0.65443337,"about_ca_system_score_codex":0.00034762526,"about_ca_system_score_gemma":0.000037557533,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W3155950182","doi":"10.1109/lcomm.2021.3137203","title":"Error Floor Analysis of LDPC Column Layered Decoders","year":2021,"lang":"en","type":"preprint","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Schedule; Computer science; Algorithm; Word error rate; Scheduling (production processes); Column (typography); Decoding methods; Frame (networking); Mathematical optimization; Mathematics; Speech recognition; Telecommunications","score_opus":0.06555428777193542,"score_gpt":0.334487312338807,"score_spread":0.2689330245668716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155950182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20220195,0.00072829047,0.78078544,0.013122799,0.00086436403,0.00052086584,0.000056675806,0.00093041133,0.00078919233],"genre_scores_gemma":[0.6721863,0.00019019644,0.3257408,0.0014728894,0.000016584765,0.0001719603,0.00016104282,0.000026563557,0.00003362984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674094,0.000787247,0.00088004005,0.000781797,0.00046366622,0.00034630683],"domain_scores_gemma":[0.9858979,0.0005474388,0.0008277031,0.0122325225,0.0003920899,0.000102368285],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00078261184,0.0003567761,0.0008658942,0.0011326486,0.00023982902,0.0003038172,0.0100929905,0.00030632614,0.000022253376],"category_scores_gemma":[0.00018798003,0.00044432757,0.00064145186,0.002448295,0.00028517077,0.00025711802,0.0048644813,0.001243826,0.000010426025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058323392,0.004225496,0.028299786,0.0012992263,0.035854794,0.00016315849,0.06737951,0.3985132,0.2821602,0.0062830956,0.11085317,0.064910054],"study_design_scores_gemma":[0.00031197033,0.000040904713,0.009718689,0.0004825151,0.0020445767,0.000011977162,0.0004414891,0.9701845,0.01272144,0.0003679875,0.002258544,0.0014154279],"about_ca_topic_score_codex":0.0018001517,"about_ca_topic_score_gemma":0.0027782104,"teacher_disagreement_score":0.5716713,"about_ca_system_score_codex":0.00025159394,"about_ca_system_score_gemma":0.00029154154,"threshold_uncertainty_score":0.99980086},"labels":[],"label_agreement":null},{"id":"W3157110449","doi":"10.1109/lcomm.2021.3077686","title":"Outage Constrained Robust Secure Beamforming in Cognitive Satellite-Aerial Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Shanghai Aerospace Science and Technology Innovation Foundation; Nanjing University of Posts and Telecommunications","keywords":"Computer science; Beamforming; Transmitter power output; Quality of service; Cognitive radio; Secure transmission; Physical layer; Multicast; Transmission (telecommunications); Channel (broadcasting); Channel state information; Mathematical optimization; Computer network; Wireless; Telecommunications; Transmitter; Mathematics","score_opus":0.047692279282703975,"score_gpt":0.26586412452092595,"score_spread":0.21817184523822197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157110449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6220173,0.07008732,0.21475647,0.013545557,0.005186408,0.0031264583,0.0003077964,0.0031410968,0.067831546],"genre_scores_gemma":[0.98629344,0.0046724877,0.007442489,0.00082817086,0.00011957977,0.00014163597,0.00039491372,0.000066634566,0.00004062706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818736,0.0003555846,0.0006619524,0.00023742516,0.00016780736,0.00038985885],"domain_scores_gemma":[0.9966421,0.0008194993,0.00009537254,0.002218808,0.00012925405,0.00009492663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038550142,0.00025314876,0.00033295943,0.00018543942,0.00017482333,0.00012917981,0.0010466344,0.00016039018,0.00005176129],"category_scores_gemma":[0.000088015266,0.00031695073,0.00010560915,0.0007726141,0.00024128468,0.00026449346,0.00020524045,0.00070560706,0.00005978424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104991705,0.0007934756,0.024459273,0.00045598712,0.0012218332,0.00026882076,0.027596083,0.6085548,0.2148529,0.0044402443,0.004251697,0.1129999],"study_design_scores_gemma":[0.009402496,0.00006482996,0.011763088,0.003389061,0.00030097898,0.0005716969,0.01875841,0.6114593,0.021074781,0.00021849986,0.31823838,0.0047584893],"about_ca_topic_score_codex":0.00003289506,"about_ca_topic_score_gemma":0.00046358907,"teacher_disagreement_score":0.3642761,"about_ca_system_score_codex":0.00021202193,"about_ca_system_score_gemma":0.00004795796,"threshold_uncertainty_score":0.99992824},"labels":[],"label_agreement":null},{"id":"W3157878946","doi":"10.1109/lcomm.2021.3074890","title":"Harmonic Retrieval Joint Multiple Regression: Robust DOA Estimation for FMCW Radar in the Presence of Unknown Spatially Colored Noise","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Colors of noise; Robustness (evolution); Direction of arrival; Computer science; Noise (video); Algorithm; White noise; Radar; Colored; Gaussian noise; Mathematics; Artificial intelligence; Telecommunications","score_opus":0.06117261001555043,"score_gpt":0.30143712307621157,"score_spread":0.24026451306066113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157878946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042406935,0.00018863386,0.93025154,0.025875967,0.00021712073,0.000794751,0.000017401479,0.00011901729,0.00012862243],"genre_scores_gemma":[0.54582196,0.000059463066,0.45366353,0.0003030941,0.000008790756,0.000095788084,0.000028553195,0.0000073916667,0.000011396246],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998093,0.0004937089,0.00063720986,0.00025851408,0.0003509326,0.00016660294],"domain_scores_gemma":[0.99508554,0.0014775831,0.0004681828,0.002547498,0.00038784693,0.000033334938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009113751,0.00013440769,0.0002419295,0.0001820944,0.0001953168,0.000078505764,0.0021744198,0.00006819324,0.0000028663096],"category_scores_gemma":[0.001232526,0.0001167809,0.000110942216,0.0009851067,0.00023569106,0.0004919907,0.00030675903,0.00021738681,0.0000024007752],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011341785,0.0011205785,0.00064771896,0.00030100177,0.00008005348,0.00000824383,0.007296199,0.042686068,0.8706665,0.026120806,0.015784,0.03517541],"study_design_scores_gemma":[0.00056700537,0.000062029496,0.0023077114,0.00028512467,0.00001859353,0.000012184346,0.000056836227,0.6017458,0.39228672,0.0014093366,0.0010807177,0.0001679596],"about_ca_topic_score_codex":0.000092680864,"about_ca_topic_score_gemma":0.00010334132,"teacher_disagreement_score":0.55905974,"about_ca_system_score_codex":0.00008660536,"about_ca_system_score_gemma":0.00019304201,"threshold_uncertainty_score":0.4762187},"labels":[],"label_agreement":null},{"id":"W3161665684","doi":"10.1109/lcomm.2021.3079201","title":"An Intelligent Transaction Migration Scheme for RAFT-Based Private Blockchain in Internet of Things Applications","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Blockchain; Computer network; Database transaction; Distributed transaction; Scheme (mathematics); Edge computing; Enhanced Data Rates for GSM Evolution; Distributed computing; The Internet; Internet of Things; Transaction processing; Distributed database; Raft; Latency (audio); Computer security; Telecommunications; Database; Operating system","score_opus":0.022179672664972883,"score_gpt":0.2750636097779662,"score_spread":0.2528839371129933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161665684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10512115,0.00016205199,0.8715085,0.022396067,0.00003893538,0.00059577444,0.0000060049074,0.00015083548,0.000020697727],"genre_scores_gemma":[0.655392,0.000036243768,0.3425751,0.0009954005,0.0000068790614,0.0009240227,0.00005505475,0.000009038652,0.000006260606],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867487,0.0001483839,0.00049105525,0.00037343957,0.00012419479,0.00018806933],"domain_scores_gemma":[0.9965913,0.00022980923,0.00019609494,0.0027491173,0.00018628495,0.00004739318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043789242,0.0001352465,0.0001884905,0.00027200798,0.00014639541,0.000049627994,0.0019835073,0.00012675823,0.000003543028],"category_scores_gemma":[0.000021671516,0.00015929039,0.000092297036,0.00088078505,0.00017177674,0.00019420065,0.0000811934,0.00027650426,0.00000411745],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001998147,0.0018399182,0.0012835715,0.00009830564,0.00005698598,0.0000011139908,0.0030612543,0.0024284145,0.59056205,0.3164519,0.0003711641,0.083825365],"study_design_scores_gemma":[0.00038858963,0.000040034996,0.00031510048,0.00003710388,0.000012522455,0.000004269229,0.000076854616,0.75405407,0.23009722,0.0047353953,0.010039168,0.00019966367],"about_ca_topic_score_codex":0.00008732429,"about_ca_topic_score_gemma":0.00022223449,"teacher_disagreement_score":0.75162566,"about_ca_system_score_codex":0.00009015529,"about_ca_system_score_gemma":0.00007687587,"threshold_uncertainty_score":0.6495673},"labels":[],"label_agreement":null},{"id":"W3165173280","doi":"10.1109/lcomm.2021.3082214","title":"STAR-RISs: Simultaneous Transmitting and Reflecting Reconfigurable Intelligent Surfaces","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":490,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Star (game theory); Computer science; Reflection (computer programming); Transmission (telecommunications); Channel (broadcasting); Field (mathematics); Telecommunications; Electronic engineering; Physics; Engineering; Mathematics; Astrophysics","score_opus":0.04116816728878759,"score_gpt":0.28902091094726173,"score_spread":0.24785274365847415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165173280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8370296,0.024366735,0.11582779,0.0147275245,0.00028322655,0.00035933548,0.000021688442,0.0029379535,0.0044461736],"genre_scores_gemma":[0.90971595,0.011025324,0.07881618,0.00028655847,0.0000097071,0.000040045717,0.00001948286,0.00004151754,0.0000452577],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989796,0.00010909354,0.00036860988,0.00019558628,0.00009428658,0.00025281377],"domain_scores_gemma":[0.9966199,0.0011143512,0.00006503865,0.002070937,0.00008289539,0.000046892703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016853375,0.00017153194,0.0002032175,0.00009880841,0.00034291582,0.0000806083,0.0008373676,0.00008253516,0.000016276688],"category_scores_gemma":[0.00020770002,0.00020489199,0.000043611577,0.00038742003,0.00019474543,0.00019239151,0.000110151115,0.00054401887,0.000016706426],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033293502,0.000043081614,0.00021771133,0.000088902234,0.000108968416,0.000011496767,0.001853999,0.27066258,0.57705575,0.0005471345,0.00046490566,0.14894216],"study_design_scores_gemma":[0.00036608073,0.000022510703,0.00011697269,0.00029158877,0.000037867998,0.000080319216,0.005315234,0.32465377,0.5946956,0.0010104899,0.072589375,0.00082016917],"about_ca_topic_score_codex":0.000020088248,"about_ca_topic_score_gemma":0.00012621396,"teacher_disagreement_score":0.148122,"about_ca_system_score_codex":0.00010114203,"about_ca_system_score_gemma":0.000015333664,"threshold_uncertainty_score":0.8355253},"labels":[],"label_agreement":null},{"id":"W3169625709","doi":"10.1109/lcomm.2021.3089725","title":"Bursty Impulsive Noise Mitigation in NOMA: A MAP Receiver-Based Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Ericsson (Canada); Carleton University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Computer science; Telecommunications link; Impulse noise; Noma; Noise (video); Gaussian noise; Real-time computing; Decoding methods; Single antenna interference cancellation; Bit error rate; Context (archaeology); Electronic engineering; Algorithm; Telecommunications; Artificial intelligence","score_opus":0.01718716937853881,"score_gpt":0.24158100664506818,"score_spread":0.22439383726652937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169625709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.233362,0.01058113,0.7228709,0.025869798,0.00045581104,0.00084199285,0.00006732466,0.0025912698,0.0033597935],"genre_scores_gemma":[0.87391025,0.0008639394,0.124239095,0.0003671548,0.000013914262,0.00031203707,0.00024043629,0.000040789266,0.000012405002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988659,0.00016191445,0.0003655356,0.00022064373,0.00013262725,0.00025337393],"domain_scores_gemma":[0.99604434,0.0002733261,0.00007796833,0.0034681712,0.00009419039,0.00004198667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012635383,0.00018723118,0.0002110511,0.0002495432,0.00014736861,0.00004182273,0.0013563079,0.000106615815,0.000007958189],"category_scores_gemma":[0.000081141654,0.00023465502,0.00007189731,0.000780383,0.0002509312,0.00024156804,0.00018411636,0.0006484946,0.000044717177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009668926,0.00040107963,0.0027698514,0.00019355117,0.000063281994,0.000010391081,0.0009321943,0.67129624,0.27782214,0.002426398,0.0049070953,0.039168105],"study_design_scores_gemma":[0.0034286308,0.000031249532,0.013220852,0.00057935825,0.00006132072,0.000028992017,0.0023551648,0.64101565,0.26772308,0.0031023107,0.06637346,0.0020799066],"about_ca_topic_score_codex":0.000013701965,"about_ca_topic_score_gemma":0.000063493535,"teacher_disagreement_score":0.6405482,"about_ca_system_score_codex":0.00031193634,"about_ca_system_score_gemma":0.000041827545,"threshold_uncertainty_score":0.9568954},"labels":[],"label_agreement":null},{"id":"W3174042897","doi":"10.1109/lcomm.2021.3091807","title":"Coverage Characterization of STAR-RIS Networks: NOMA and OMA","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":211,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Resource allocation; Noma; Maximization; Convex optimization; Star (game theory); Transmission (telecommunications); Optimization problem; Constraint (computer-aided design); Regular polygon; Decoding methods; Range (aeronautics); Algorithm; Telecommunications link; Mathematics; Telecommunications; Computer network; Engineering","score_opus":0.013896619999004647,"score_gpt":0.22246216197878332,"score_spread":0.20856554197977867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174042897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72808677,0.0015090227,0.26616055,0.003333042,0.00009513339,0.000118747914,0.000027797478,0.00042712543,0.00024185529],"genre_scores_gemma":[0.97701627,0.009883506,0.012549102,0.0003170994,0.000009494542,0.000043813878,0.00014100088,0.000027178343,0.000012527817],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935424,0.00006616715,0.0002725803,0.00010842047,0.00007046439,0.00012811381],"domain_scores_gemma":[0.99758303,0.00015521227,0.000079716054,0.0020894303,0.00006724628,0.000025362891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006225371,0.00011134024,0.00016372208,0.00008508496,0.00010569744,0.00002296704,0.00060754287,0.000067930334,0.000008868515],"category_scores_gemma":[0.00003041438,0.00013691925,0.000031550175,0.0003331593,0.00019022226,0.00021038116,0.00023016606,0.00022747924,0.000003882108],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026609562,0.000045573186,0.0010999442,0.00003891543,0.000060879556,0.0000019174825,0.00025865372,0.024055867,0.944894,0.0013562244,0.00030566545,0.02787969],"study_design_scores_gemma":[0.0012996913,0.000044388187,0.0564334,0.00034204122,0.000067862326,0.00005195423,0.00049639365,0.46858183,0.4081978,0.0007853367,0.06254473,0.0011546098],"about_ca_topic_score_codex":0.000003895858,"about_ca_topic_score_gemma":0.0000135737055,"teacher_disagreement_score":0.53669626,"about_ca_system_score_codex":0.00004327402,"about_ca_system_score_gemma":0.000008874543,"threshold_uncertainty_score":0.5583405},"labels":[],"label_agreement":null},{"id":"W3175772452","doi":"10.1109/lcomm.2021.3091997","title":"Performance Improvement of LoRa Modulation With Signal Combining and Semi-Coherent Detection","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Additive white Gaussian noise; Rayleigh fading; Overhead (engineering); Channel state information; Electronic engineering; Modulation (music); Algorithm; Detection theory; Fading; Channel (broadcasting); Telecommunications; Detector; Wireless; Physics; Engineering","score_opus":0.01530963068123922,"score_gpt":0.2187001532102205,"score_spread":0.20339052252898127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175772452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9655676,0.000101614714,0.033070575,0.00020170798,0.000049437782,0.00064704655,0.0000016634269,0.000052069914,0.0003082946],"genre_scores_gemma":[0.99740463,0.000085034975,0.0019725885,0.00007499434,0.00002009406,0.00041265952,0.000011329468,0.000012775064,0.000005864678],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960744,0.000022115506,0.0001449902,0.0000680518,0.00007063853,0.000086781954],"domain_scores_gemma":[0.99943095,0.000037175316,0.000039571933,0.0004321646,0.000039839728,0.000020275464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007252061,0.000069657384,0.00008325229,0.00003182031,0.00008861238,0.000019781297,0.00010806287,0.000025945401,0.000007192208],"category_scores_gemma":[9.651451e-7,0.00007031761,0.00001438986,0.00012727776,0.00004233738,0.00009858414,0.000031391162,0.00012519734,0.0000014015235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011363671,0.000026784504,0.0021058826,0.000105657,0.000052164036,4.633028e-7,0.00031526107,0.23203339,0.68582326,0.000017962355,0.00014047135,0.07936736],"study_design_scores_gemma":[0.000497385,0.000083677194,0.0069495696,0.00016478293,0.000020789661,0.000007231429,0.00005554053,0.8146652,0.17611083,0.000014247047,0.0012716579,0.00015907035],"about_ca_topic_score_codex":0.000008088943,"about_ca_topic_score_gemma":0.000025088479,"teacher_disagreement_score":0.5826318,"about_ca_system_score_codex":0.000033273493,"about_ca_system_score_gemma":0.0000061941264,"threshold_uncertainty_score":0.28674692},"labels":[],"label_agreement":null},{"id":"W3176951782","doi":"10.1109/lcomm.2021.3091994","title":"Decentralized Online Learning With Compressed Communication for Near-Sensor Data Analytics","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Key Research and Development Projects of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Bottleneck; Wireless sensor network; Overhead (engineering); Analytics; Distributed computing; Bandwidth (computing); Data analysis; Computer network; Real-time computing; Embedded system; Data mining","score_opus":0.07762911208816047,"score_gpt":0.30513663983919054,"score_spread":0.22750752775103006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176951782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04091761,0.0011162586,0.92278814,0.03418994,0.00013362672,0.00030068078,0.00004741198,0.00035192614,0.00015437693],"genre_scores_gemma":[0.32730347,0.00069791917,0.66778934,0.0023161294,0.000025967778,0.000027855987,0.0017111388,0.000032454533,0.00009570372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977734,0.00059819245,0.00041965113,0.0005242115,0.0002891019,0.00039542076],"domain_scores_gemma":[0.98776,0.0013352751,0.00027476661,0.01014221,0.00037898065,0.00010875566],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003483016,0.00021171776,0.0002887881,0.000075107964,0.00088633056,0.0004570527,0.0066938414,0.000075488955,0.0000045364054],"category_scores_gemma":[0.00013897996,0.00021648694,0.000069980604,0.0008315841,0.00032837255,0.00047274056,0.0014507748,0.00049537217,0.000008038085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034242425,0.00067447877,0.0016052016,0.000031067826,0.00024404837,0.000011945918,0.000752975,0.9636701,0.010550407,0.006309505,0.0073624332,0.008753594],"study_design_scores_gemma":[0.00086482335,0.00002089695,0.00055317144,0.00008332063,0.00005188737,0.000021504798,0.000100668236,0.91589296,0.0006378906,0.000019694342,0.08148432,0.00026888683],"about_ca_topic_score_codex":0.000050889448,"about_ca_topic_score_gemma":0.00042906427,"teacher_disagreement_score":0.28638586,"about_ca_system_score_codex":0.0000721807,"about_ca_system_score_gemma":0.000117172334,"threshold_uncertainty_score":0.9986804},"labels":[],"label_agreement":null},{"id":"W3182656491","doi":"10.1109/lcomm.2021.3095895","title":"Sequential Decoding of Short Length Binary Codes: Performance Versus Complexity","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequential decoding; Convolutional code; Decoding methods; List decoding; Algorithm; Computer science; Viterbi algorithm; Metric (unit); Viterbi decoder; Serial concatenated convolutional codes; Block code; Theoretical computer science; Concatenated error correction code","score_opus":0.14654994843227864,"score_gpt":0.345389028460019,"score_spread":0.19883908002774037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182656491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8139083,0.00020883456,0.17600724,0.0055792374,0.00081503013,0.00015514721,0.000006851296,0.0005409742,0.0027783972],"genre_scores_gemma":[0.767079,0.00016405669,0.23229848,0.00038055127,0.00002090198,0.000020701247,0.000014410978,0.00001066655,0.000011219199],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985995,0.00026926055,0.0003623006,0.0002870264,0.0002445563,0.00023731869],"domain_scores_gemma":[0.9958559,0.00038764314,0.00012525603,0.003384077,0.0001936993,0.00005340719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039683038,0.00014222559,0.00021010576,0.00013682625,0.00033116565,0.00006944372,0.0029057623,0.000052952313,0.000007517008],"category_scores_gemma":[0.00007001471,0.00016902514,0.00010047496,0.00061912026,0.00030273144,0.00045653895,0.0010014758,0.00034293102,0.000012462986],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006765919,0.0007152906,0.012309011,0.00016800014,0.00028521803,0.000041987736,0.0047578765,0.0015251345,0.8780636,0.025423976,0.012051052,0.0645912],"study_design_scores_gemma":[0.001046373,0.00025304974,0.008962172,0.00041800918,0.000088036984,0.00012404597,0.0003098294,0.36097702,0.61877656,0.00045133076,0.007520106,0.0010734648],"about_ca_topic_score_codex":0.000058602138,"about_ca_topic_score_gemma":0.00010808336,"teacher_disagreement_score":0.3594519,"about_ca_system_score_codex":0.00012943917,"about_ca_system_score_gemma":0.00011228956,"threshold_uncertainty_score":0.6892645},"labels":[],"label_agreement":null},{"id":"W3186661962","doi":"10.1109/lcomm.2021.3097290","title":"A Novel Distributed Multi-Agent Reinforcement Learning Algorithm Against Jamming Attacks","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Jamming; Reinforcement learning; Convergence (economics); Interference (communication); Context (archaeology); Transmission (telecommunications); Wireless; Algorithm; Wireless network; Distributed algorithm; Computer network; Distributed computing; Artificial intelligence; Telecommunications; Channel (broadcasting)","score_opus":0.043746524920391466,"score_gpt":0.2835009846907155,"score_spread":0.23975445977032403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186661962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00560983,0.0003237726,0.9784371,0.014384612,0.00049812725,0.00018856258,0.000010736413,0.00034127172,0.00020593533],"genre_scores_gemma":[0.50496244,0.00043891554,0.488773,0.0051849857,0.000090199486,0.000072391646,0.00035130838,0.000027987837,0.000098784156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979824,0.00026606643,0.00048222538,0.00044078403,0.000352462,0.00047605328],"domain_scores_gemma":[0.9956511,0.00037780733,0.00021886479,0.0033908742,0.00022110358,0.00014025395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030527325,0.00023100109,0.00023464157,0.00010933457,0.0007084947,0.00033241746,0.0027234163,0.000093767616,0.0000068269433],"category_scores_gemma":[0.000100787525,0.00027569948,0.00014229209,0.00079881813,0.000151073,0.00037344187,0.0012152717,0.0007585446,0.000077879224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041300877,0.0007964212,0.0004494453,0.000039216513,0.00035485826,0.00013352168,0.007910215,0.6640893,0.1423641,0.0033439095,0.009356832,0.17115802],"study_design_scores_gemma":[0.0006195181,0.000012391279,0.00023319139,0.00007877596,0.000013860918,0.00003440007,0.00020797616,0.9540468,0.003166444,0.0000048861198,0.041249365,0.0003324335],"about_ca_topic_score_codex":0.000048979,"about_ca_topic_score_gemma":0.0000302474,"teacher_disagreement_score":0.49935263,"about_ca_system_score_codex":0.00026594062,"about_ca_system_score_gemma":0.000075518095,"threshold_uncertainty_score":0.99996954},"labels":[],"label_agreement":null},{"id":"W3196804222","doi":"10.1109/lcomm.2021.3107897","title":"Topological Interference Management With Inaccurate Topology of Network","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Topology (electrical circuits); Network topology; Rank (graph theory); Interference (communication); Computer science; Matrix (chemical analysis); Extension topology; Logical topology; Low-rank approximation; General topology; Mathematics; Algorithm; Computer network; Discrete mathematics; Topological space; Combinatorics","score_opus":0.032734349991414315,"score_gpt":0.25835366550823,"score_spread":0.22561931551681572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196804222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678191,0.0015551428,0.27377132,0.007475467,0.00039008242,0.0002550504,0.000005015974,0.00079118257,0.037565712],"genre_scores_gemma":[0.9532852,0.00049543206,0.045564406,0.0005845168,0.00001651647,0.000017588269,0.000006865648,0.0000087966955,0.00002063207],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955183,0.000060737937,0.00013882642,0.00008305816,0.000042870415,0.00012267275],"domain_scores_gemma":[0.9988603,0.000066428955,0.000028897806,0.0009886443,0.000038133352,0.000017567101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003883065,0.000075052136,0.00011920796,0.000030907744,0.00004841447,0.00001100548,0.00040865346,0.000030155808,0.000016348446],"category_scores_gemma":[0.0000028363238,0.00006916735,0.00002486503,0.00016829139,0.0001582422,0.000034030534,0.0001285875,0.00013701613,0.000004594239],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120477256,0.000534052,0.009730974,0.00022644714,0.0017796472,0.00046427618,0.0018340008,0.2065616,0.34034705,0.21813153,0.1648931,0.055376858],"study_design_scores_gemma":[0.002807876,0.0005852195,0.034886826,0.0025220427,0.0006321646,0.00063882774,0.0022700466,0.08452711,0.68287677,0.023996538,0.16115744,0.0030991528],"about_ca_topic_score_codex":0.000008033827,"about_ca_topic_score_gemma":0.000032130993,"teacher_disagreement_score":0.3425297,"about_ca_system_score_codex":0.000019763873,"about_ca_system_score_gemma":0.000004185797,"threshold_uncertainty_score":0.28205624},"labels":[],"label_agreement":null},{"id":"W3197648599","doi":"10.1109/lcomm.2021.3109888","title":"Secrecy Energy Efficiency in Full-Duplex AF Relay Systems With Untrusted Energy Harvesters","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Relay; Beamforming; Artificial noise; Computer science; Efficient energy use; Maximization; Energy harvesting; Mathematical optimization; Optimization problem; Energy (signal processing); Iterative method; Signal-to-noise ratio (imaging); Convex optimization; Wireless; Power (physics); Algorithm; Telecommunications; Mathematics; Regular polygon; Electrical engineering; Physical layer; Engineering","score_opus":0.015711897489439314,"score_gpt":0.21263138329355388,"score_spread":0.19691948580411456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197648599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8710882,0.008412824,0.10740489,0.008349339,0.0007458754,0.00033149667,0.00006549638,0.0011000878,0.0025017597],"genre_scores_gemma":[0.99121904,0.0012899984,0.005516276,0.00075703184,0.00004794646,0.00043216412,0.0003311627,0.00012142447,0.00028497266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752784,0.0005218191,0.00071240717,0.00037566398,0.00030990047,0.0005523889],"domain_scores_gemma":[0.99386597,0.0005834073,0.00012929784,0.005105327,0.00015968486,0.00015629665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002071378,0.00037920848,0.00042346923,0.00040740208,0.000314669,0.00020451579,0.0021140054,0.00016438424,0.00002433344],"category_scores_gemma":[0.000042280313,0.00041562226,0.00009764227,0.0017034706,0.0003059697,0.00037554765,0.00028361217,0.0005685392,0.00003103157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009092546,0.00013505213,0.00028526856,0.000039173377,0.000093138224,0.00002269986,0.00050530524,0.9313638,0.05680811,0.008693346,0.0014373878,0.0006076142],"study_design_scores_gemma":[0.0010964527,0.000032483265,0.0010119354,0.00037948505,0.000053517313,0.00014679416,0.0007247924,0.9481484,0.002942949,0.0000044121307,0.04467135,0.0007873784],"about_ca_topic_score_codex":0.0011555128,"about_ca_topic_score_gemma":0.0056594824,"teacher_disagreement_score":0.12013079,"about_ca_system_score_codex":0.00043329186,"about_ca_system_score_gemma":0.000115577895,"threshold_uncertainty_score":0.9998296},"labels":[],"label_agreement":null},{"id":"W3198326787","doi":"10.1109/lcomm.2022.3169270","title":"Outage Analysis and Beamwidth Optimization for Positioning-Assisted Beamforming","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Beamwidth; Beamforming; Computer science; Antenna array; Antenna (radio); Power (physics); Transmitter power output; Channel (broadcasting); Algorithm; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.01540506013230922,"score_gpt":0.2446476693891757,"score_spread":0.2292426092568665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198326787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009397282,0.00025318985,0.9885906,0.0006929841,0.00012844516,0.00039203672,0.00008956839,0.00027668665,0.00017919422],"genre_scores_gemma":[0.685543,0.00007188484,0.31279406,0.00027394432,0.000019053328,0.00054922857,0.000682421,0.00003705485,0.00002935179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927396,0.00006368505,0.00027300706,0.00014560143,0.000089157504,0.00015460831],"domain_scores_gemma":[0.9989498,0.00014008966,0.000086311426,0.0007463927,0.00003844749,0.00003890953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017129428,0.00011468438,0.0001658324,0.00035489647,0.0007049494,0.00004885144,0.00033501277,0.000026533084,0.000017635855],"category_scores_gemma":[0.00001399795,0.00015058457,0.000074301744,0.0007551426,0.0000447934,0.00022528668,0.000090535075,0.00013977113,6.995095e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031149946,0.000014242866,0.00019484178,0.000018806497,0.00016728186,1.8089194e-7,0.00033945308,0.99287874,0.0052521955,0.00009104418,0.0002543679,0.0007857293],"study_design_scores_gemma":[0.00026457774,0.000013835082,0.00011180051,0.0000072550342,0.00022435482,0.000006651872,0.00019270385,0.99751496,0.00021242953,0.00001270444,0.0012635295,0.00017521787],"about_ca_topic_score_codex":0.000019932193,"about_ca_topic_score_gemma":0.00002468205,"teacher_disagreement_score":0.67614573,"about_ca_system_score_codex":0.00019899778,"about_ca_system_score_gemma":0.000008003606,"threshold_uncertainty_score":0.61406606},"labels":[],"label_agreement":null},{"id":"W3200892586","doi":"10.1109/lcomm.2021.3114594","title":"Intelligent Reflecting Surface-Aided Indoor Visible Light Communication Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visible light communication; Computer science; Transmitter; Orientation (vector space); Maximization; Communications system; Optimization problem; Iterative method; Mathematical optimization; Algorithm; Telecommunications; Mathematics; Electrical engineering; Light-emitting diode; Engineering","score_opus":0.050054514993203195,"score_gpt":0.2946502120312418,"score_spread":0.24459569703803863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200892586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58391404,0.09812256,0.14161482,0.109296784,0.0020205544,0.0018896237,0.0000727327,0.012043059,0.051025797],"genre_scores_gemma":[0.93847096,0.008448225,0.052320052,0.00031089562,0.000021935333,0.00013514655,0.00010581662,0.000077639874,0.00010935922],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99800706,0.00040206924,0.00073253247,0.0002598187,0.000212885,0.0003856417],"domain_scores_gemma":[0.9915597,0.0007015226,0.00013497265,0.0072608236,0.0002513866,0.00009161803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004298215,0.00027194837,0.00034367508,0.00017733593,0.000501499,0.00027462406,0.0029444797,0.00019040947,0.000023316186],"category_scores_gemma":[0.0002019498,0.0003176321,0.00011255559,0.0009967105,0.00023737406,0.00034073985,0.0007613417,0.00096230244,0.00022645057],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072552302,0.00035987818,0.002059557,0.00017015605,0.00048179564,0.0000069606,0.0020135257,0.08629256,0.8088748,0.06631385,0.020114625,0.013305078],"study_design_scores_gemma":[0.0008704789,0.00003806963,0.00048799705,0.0007876113,0.00010695975,0.00006639412,0.0035477055,0.2254232,0.5026216,0.0018623441,0.26253557,0.001652052],"about_ca_topic_score_codex":0.00006195203,"about_ca_topic_score_gemma":0.00007754911,"teacher_disagreement_score":0.35455686,"about_ca_system_score_codex":0.0003515758,"about_ca_system_score_gemma":0.000041917632,"threshold_uncertainty_score":0.9999276},"labels":[],"label_agreement":null},{"id":"W3202620893","doi":"10.1109/lcomm.2021.3117929","title":"Deep Reinforcement Learning for Optimizing RIS-Assisted HD-FD Wireless Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Telecommunications link; Computer science; Computational complexity theory; Wireless; Monte Carlo method; Algorithm; Regular polygon; Convex optimization; Mathematical optimization; Artificial intelligence; Mathematics; Computer network; Telecommunications; Statistics","score_opus":0.033674359267899454,"score_gpt":0.26592424661906855,"score_spread":0.23224988735116908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202620893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005055808,0.003959069,0.9851183,0.0022564537,0.00026819383,0.00041283778,0.0000034748707,0.0016504588,0.0012753461],"genre_scores_gemma":[0.8910115,0.0027528554,0.10489385,0.0001729937,0.000029206849,0.00075747276,0.0002062111,0.00007557531,0.00010036298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986125,0.00012927836,0.0005368055,0.00021771571,0.00014416478,0.0003595131],"domain_scores_gemma":[0.99589276,0.0005636863,0.00015036302,0.0031550364,0.00018069551,0.000057479036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019760281,0.00023116727,0.00030570608,0.00016706903,0.00055607886,0.00012371849,0.0015739636,0.00012675846,0.0000062996974],"category_scores_gemma":[0.00008320994,0.0002837209,0.000114419345,0.0004560991,0.00016314605,0.00025163352,0.00033820537,0.0005871095,0.000021111346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021960757,0.000020272624,0.000050174807,0.000075440395,0.00008856287,8.5437813e-7,0.00022591696,0.9079772,0.07451457,0.0038385612,0.00061092625,0.012595323],"study_design_scores_gemma":[0.00047426406,0.000012966528,0.000040117007,0.00015069549,0.00003043751,0.00001154662,0.001287794,0.94433075,0.016452223,0.0000777347,0.036732737,0.00039873307],"about_ca_topic_score_codex":0.000015130136,"about_ca_topic_score_gemma":0.00002269773,"teacher_disagreement_score":0.8859557,"about_ca_system_score_codex":0.00030134383,"about_ca_system_score_gemma":0.000024101148,"threshold_uncertainty_score":0.9999615},"labels":[],"label_agreement":null},{"id":"W3205584014","doi":"10.1109/lcomm.2021.3120560","title":"Reconfigurable Intelligent Surface Optimization for Uplink Sparse Code Multiple Access","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; Computational complexity theory; Reduction (mathematics); Algorithm; Signal-to-noise ratio (imaging); Wireless; Code (set theory); Computer engineering; Real-time computing; Set (abstract data type); Telecommunications; Mathematics","score_opus":0.08006676452302545,"score_gpt":0.3082743611976618,"score_spread":0.2282075966746363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205584014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011751201,0.0017959436,0.9747959,0.009059194,0.00027550533,0.00044129213,0.000055378165,0.0011877648,0.00063783687],"genre_scores_gemma":[0.62721705,0.00653341,0.3650628,0.00046658516,0.000014866561,0.0002642212,0.00031007352,0.00006399845,0.00006698273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896926,0.00006587435,0.00040331337,0.00021450967,0.0000853453,0.00026168398],"domain_scores_gemma":[0.9956054,0.000675434,0.000095046744,0.003381629,0.00019474677,0.00004774866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014475134,0.0001828857,0.0002129272,0.000093018156,0.00029099165,0.00011768336,0.002004035,0.00010875681,0.00003994511],"category_scores_gemma":[0.00019946662,0.0002267709,0.00008315985,0.0004462394,0.00014927919,0.0003986877,0.00021733454,0.0003242739,0.000025727508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032018377,0.000038805138,0.0001345524,0.00003120227,0.000041235395,4.1193596e-7,0.000084083906,0.9561487,0.032462984,0.00037824403,0.0041334876,0.0065431166],"study_design_scores_gemma":[0.00025538565,0.0000047735048,0.000025332369,0.00004718945,0.000013027032,0.000003647965,0.00013905948,0.7648535,0.2016602,0.00021214018,0.03253556,0.000250184],"about_ca_topic_score_codex":0.000009734776,"about_ca_topic_score_gemma":0.00009051764,"teacher_disagreement_score":0.6154659,"about_ca_system_score_codex":0.00017323313,"about_ca_system_score_gemma":0.000028472075,"threshold_uncertainty_score":0.92474496},"labels":[],"label_agreement":null},{"id":"W3208817945","doi":"10.1109/lcomm.2021.3124902","title":"QoS-Aware Secrecy Rate Maximization in Untrusted NOMA With Trusted Relay","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Relay; Computer network; Quality of service; Maximization; Secrecy; Noma; Bottleneck; Transmitter power output; Power (physics); Telecommunications link; Mathematical optimization; Computer security; Mathematics; Transmitter; Embedded system","score_opus":0.016506359256156716,"score_gpt":0.2239467702172368,"score_spread":0.2074404109610801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208817945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.533902,0.002082938,0.43547806,0.0220267,0.00033823762,0.00068400195,0.000040985262,0.003143471,0.0023035978],"genre_scores_gemma":[0.95047116,0.0017593681,0.046718832,0.000496839,0.000013205245,0.00019606313,0.00023132654,0.00006693842,0.000046256584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.00021467637,0.00039092748,0.00021862186,0.00011690064,0.00026936588],"domain_scores_gemma":[0.9959105,0.0002911656,0.000087431705,0.003551703,0.0001166596,0.000042535798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012911331,0.000212231,0.00023774905,0.00026853968,0.00016503604,0.00005539188,0.0012099948,0.00012543076,0.000027531401],"category_scores_gemma":[0.00007239836,0.00023434586,0.000038862825,0.0013933263,0.000196691,0.0003319772,0.00020381366,0.00060128164,0.000036401318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018958492,0.00011755297,0.003228204,0.000063345404,0.00009483245,0.000030081965,0.00065181055,0.90129524,0.08187948,0.002289305,0.0015324659,0.008798711],"study_design_scores_gemma":[0.0054775756,0.00007691765,0.035981007,0.0010059666,0.00009894649,0.00016116316,0.004629376,0.7333346,0.1739071,0.0010417032,0.041663595,0.0026220353],"about_ca_topic_score_codex":0.000018333762,"about_ca_topic_score_gemma":0.00047667525,"teacher_disagreement_score":0.41656917,"about_ca_system_score_codex":0.00024597425,"about_ca_system_score_gemma":0.000037101334,"threshold_uncertainty_score":0.9556347},"labels":[],"label_agreement":null},{"id":"W3210267130","doi":"10.1109/lcomm.2021.3122468","title":"Performance Analysis of RIS-Aided Networks With Co-Channel Interference","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"National Natural Science Foundation of China","keywords":"Interference (communication); Computer science; Signal-to-noise ratio (imaging); Bit error rate; Channel (broadcasting); Signal-to-interference ratio; Independent and identically distributed random variables; Outage probability; Co-channel interference; Interference alignment; Algorithm; Electronic engineering; Computer network; Telecommunications; Statistics; Mathematics; Random variable; Fading; Engineering","score_opus":0.024134109980009387,"score_gpt":0.2526973264330537,"score_spread":0.2285632164530443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210267130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38940793,0.0012211065,0.60605365,0.0011625012,0.000049873204,0.00010653192,0.000017538057,0.00056233566,0.0014185271],"genre_scores_gemma":[0.97535783,0.004088957,0.020198828,0.00014072156,0.0000045465367,0.00006848869,0.00010277204,0.000023668152,0.000014160753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991922,0.000065500666,0.0003206869,0.00013973212,0.00010325401,0.00017866617],"domain_scores_gemma":[0.99594235,0.00023863612,0.00010523632,0.0035616856,0.00012246035,0.000029641249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008723963,0.00014504037,0.00029369327,0.00028856783,0.000120610144,0.000019997118,0.0013879535,0.00006486211,0.000013639162],"category_scores_gemma":[0.000021029302,0.0001497017,0.00007419836,0.0016143958,0.00032327318,0.00017647771,0.00017502517,0.00037638654,0.000005800578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003916964,0.00002739583,0.0026736287,0.00001581633,0.0004898937,7.477621e-7,0.00019655224,0.9836879,0.009243992,0.00012667254,0.00028961353,0.003243915],"study_design_scores_gemma":[0.0001824706,0.000016206672,0.006873301,0.00008307483,0.00018831671,0.000004122809,0.00031903767,0.9633938,0.028086387,0.000012936495,0.00059167633,0.00024867526],"about_ca_topic_score_codex":0.000007701347,"about_ca_topic_score_gemma":0.00009171817,"teacher_disagreement_score":0.5859499,"about_ca_system_score_codex":0.00006874783,"about_ca_system_score_gemma":0.000013746365,"threshold_uncertainty_score":0.61046576},"labels":[],"label_agreement":null},{"id":"W3212854205","doi":"10.1109/lcomm.2021.3128354","title":"On the Capacity of RIS-Assisted Intensity-Modulation Optical Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Channel (broadcasting); Channel capacity; Intensity modulation; Intensity (physics); Signal-to-noise ratio (imaging); Modulation (music); Computer science; Transmission (telecommunications); Optical wireless; Wireless; Spectral efficiency; Topology (electrical circuits); SIGNAL (programming language); Algorithm; Mathematics; Electronic engineering; Telecommunications; Optics; Acoustics; Physics; Engineering; Phase modulation","score_opus":0.05725422476685725,"score_gpt":0.25165385466698104,"score_spread":0.19439962990012377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212854205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9379351,0.00019361882,0.013855127,0.044353083,0.00022612896,0.00016811011,0.000010054473,0.00048660874,0.0027721566],"genre_scores_gemma":[0.98839676,0.00025004134,0.010567683,0.00066873495,0.000011373103,0.000053292883,0.000021177091,0.00002154837,0.000009394448],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991076,0.00013248944,0.00031960674,0.00011665376,0.00016170263,0.00016192753],"domain_scores_gemma":[0.9952881,0.0009721201,0.000059042843,0.0034791925,0.00016985586,0.00003173273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019943225,0.00012840545,0.00019346339,0.00008750868,0.00017370314,0.000037203074,0.0012487214,0.000097172284,0.000017912973],"category_scores_gemma":[0.00036363327,0.000112534726,0.00008465595,0.00045731966,0.00046999753,0.00008206985,0.0002459191,0.0005579515,0.000046239693],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010211835,0.00030476047,0.00019247981,0.00004699146,0.00021530227,0.0000023330804,0.0006062885,0.022292092,0.7687471,0.1885654,0.007031399,0.01198566],"study_design_scores_gemma":[0.0005697727,0.000054303007,0.02089928,0.0003057429,0.000067013425,0.000032943553,0.0007874801,0.27043018,0.6930775,0.0077901743,0.005286483,0.0006991287],"about_ca_topic_score_codex":0.000007964668,"about_ca_topic_score_gemma":0.000014902455,"teacher_disagreement_score":0.24813809,"about_ca_system_score_codex":0.000088506036,"about_ca_system_score_gemma":0.000010960464,"threshold_uncertainty_score":0.4589033},"labels":[],"label_agreement":null},{"id":"W3214484149","doi":"10.1109/lcomm.2021.3127160","title":"Deep Learning-Based Time-Varying Channel Estimation for RIS Assisted Communication","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Channel (broadcasting); Artificial intelligence; Computer network; Telecommunications","score_opus":0.02559352699645717,"score_gpt":0.2659061862021836,"score_spread":0.24031265920572642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214484149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003798913,0.003143793,0.97951233,0.009998951,0.000094952105,0.00043699262,0.000015820118,0.0022971148,0.00070110016],"genre_scores_gemma":[0.7273194,0.0008645169,0.2697742,0.00041538812,0.000011348853,0.00062870025,0.0008646604,0.000074921976,0.000046848945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858636,0.0002483708,0.00047863336,0.00022740531,0.0001569833,0.00030226033],"domain_scores_gemma":[0.99433684,0.0011415901,0.00017188411,0.0040512136,0.00024404666,0.000054392767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026493787,0.00024163257,0.00027465404,0.00022376381,0.00071742485,0.00010126082,0.0017055904,0.00015779294,0.00001972593],"category_scores_gemma":[0.00036777445,0.00031037,0.0001303851,0.00063245284,0.0002476186,0.00033155945,0.00023118498,0.00059961365,0.00007780303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005267952,0.00006523431,0.000021326512,0.000049785893,0.000055794855,4.8891167e-7,0.00017929316,0.9273681,0.041857593,0.00026668067,0.0011986821,0.02893174],"study_design_scores_gemma":[0.00053248537,0.00001197165,0.0001572778,0.00009468623,0.000030745534,0.000005907762,0.000108199536,0.9622789,0.028160868,0.00048317,0.007810947,0.00032482186],"about_ca_topic_score_codex":0.000006205912,"about_ca_topic_score_gemma":0.000025576883,"teacher_disagreement_score":0.7235205,"about_ca_system_score_codex":0.00025462042,"about_ca_system_score_gemma":0.00003176717,"threshold_uncertainty_score":0.99993485},"labels":[],"label_agreement":null},{"id":"W3216004325","doi":"10.1109/lcomm.2022.3157161","title":"Decentralized Beamforming for Cell-Free Massive MIMO With Unsupervised Learning","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Beamforming; Computer science; Unsupervised learning; Artificial intelligence; Telecommunications","score_opus":0.014010027692343415,"score_gpt":0.22218452636296854,"score_spread":0.20817449867062512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216004325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024324875,0.0005482661,0.970722,0.0019875583,0.00022271794,0.00090277934,0.000044646764,0.00054199214,0.0007051242],"genre_scores_gemma":[0.75760573,0.0001251301,0.24012445,0.0003472049,0.000028259192,0.0013170841,0.0002389807,0.00010637679,0.000106756794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912107,0.0000942117,0.00024402502,0.0001480237,0.00012518476,0.0002674959],"domain_scores_gemma":[0.9983689,0.00021014032,0.000083801904,0.0012403134,0.000047430512,0.000049391056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013648917,0.00015040505,0.00016074622,0.00012225065,0.00067755947,0.000031814598,0.00094037206,0.00002583184,0.00002042605],"category_scores_gemma":[0.000022440565,0.00017161724,0.000054942277,0.00030463366,0.000048222144,0.00019147035,0.00013921947,0.00031732407,0.0000039396336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015377713,0.000021218686,0.0001136118,0.00003606714,0.000032265536,7.401118e-7,0.000843478,0.96360075,0.032683015,0.00009390474,0.0022262377,0.0003333352],"study_design_scores_gemma":[0.0038148207,0.00010908629,0.000023381115,0.00005463266,0.00008975972,0.000017540917,0.0025021771,0.8781252,0.0077307974,0.000059466136,0.10680993,0.0006631975],"about_ca_topic_score_codex":0.0000144612795,"about_ca_topic_score_gemma":0.000016994953,"teacher_disagreement_score":0.7332809,"about_ca_system_score_codex":0.0002577602,"about_ca_system_score_gemma":0.000018474104,"threshold_uncertainty_score":0.69983476},"labels":[],"label_agreement":null},{"id":"W4200121540","doi":"10.1109/lcomm.2021.3114483","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200121540","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4200218040","doi":"10.1109/lcomm.2021.3129867","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200218040","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4200365041","doi":"10.1109/lcomm.2021.3114477","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200365041","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4205271048","doi":"10.1109/lcomm.2020.2995036","title":"IEEE Communications Letters Publication Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05797539128489154,"score_gpt":0.27898466830002394,"score_spread":0.2210092770151324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205271048","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007189346,0.00013607834,0.41478828,0.57438135,0.00047876927,0.00040560172,0.000013947456,0.00094824284,0.0016583728],"genre_scores_gemma":[0.8627619,0.00015009892,0.06914053,0.06727743,0.00008997263,0.00036952086,0.00017043989,0.000016263008,0.000023831486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979259,0.0003626707,0.0007550055,0.00030880232,0.00030384914,0.00034380623],"domain_scores_gemma":[0.99167436,0.00028091646,0.00046646365,0.007094466,0.0002953531,0.00018842754],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046989377,0.00022236077,0.0002274718,0.00035461018,0.0008151506,0.00046549202,0.009567253,0.00013528082,0.000013156967],"category_scores_gemma":[0.00019103786,0.0002498703,0.00011138767,0.0015824543,0.0004259127,0.0032424782,0.00074856635,0.0006019305,0.0016384905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009592869,0.000267503,0.0024921463,0.00006166526,0.00015682935,8.9491124e-7,0.017498834,0.0003136759,0.06917057,0.12137197,0.75064063,0.0380157],"study_design_scores_gemma":[0.0006668667,0.00004110721,0.002682547,0.000042017065,0.000033159202,0.000034665514,0.0005192517,0.044455662,0.0037137216,0.0002699236,0.9468413,0.00069979863],"about_ca_topic_score_codex":0.00006878373,"about_ca_topic_score_gemma":0.000013131693,"teacher_disagreement_score":0.8555726,"about_ca_system_score_codex":0.00014316535,"about_ca_system_score_gemma":0.00011282951,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W4205510022","doi":"10.1109/lcomm.2021.3140100","title":"On Allocation of Systematic Blocks in Coded Distributed Computing","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; List decoding; Sequential decoding; Computation; Reduction (mathematics); Encoding (memory); Task (project management); Multiplication (music); Algorithm; Separable space; Parallel computing; Block code; Mathematics; Concatenated error correction code; Artificial intelligence","score_opus":0.03326909376298774,"score_gpt":0.27195373687974683,"score_spread":0.23868464311675908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205510022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017344357,0.00005032398,0.97717613,0.0043910197,0.00012730154,0.00059959537,0.000012219488,0.00017485699,0.00012418818],"genre_scores_gemma":[0.9431976,0.0000035925775,0.055830866,0.0007201457,0.0000025949253,0.00019410673,0.000039543345,0.0000073980927,0.0000041345907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984402,0.00043283866,0.0005078311,0.00018783455,0.00029016408,0.00014113041],"domain_scores_gemma":[0.9967876,0.0006846825,0.00032140696,0.0021129574,0.00006732878,0.000026019883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060968957,0.00009585219,0.00020541986,0.0003318537,0.00023395517,0.000031773056,0.0026082178,0.000019284402,0.0000041938692],"category_scores_gemma":[0.00012954528,0.00010950662,0.00004546075,0.0010196484,0.0000690737,0.00009786098,0.00051602436,0.00022365066,0.000002269017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011104516,0.00079715287,0.0004122248,0.0006384014,0.000052433166,0.0000038993903,0.0044872565,0.6869911,0.009599941,0.29272798,0.0038248403,0.00045367292],"study_design_scores_gemma":[0.00031312255,0.00006525848,0.00030622978,0.00047665546,0.000009807684,0.000009668838,0.00011639578,0.99616593,0.0011611145,0.0011968674,0.000018364615,0.00016057208],"about_ca_topic_score_codex":0.00003687035,"about_ca_topic_score_gemma":0.0000038958137,"teacher_disagreement_score":0.92585325,"about_ca_system_score_codex":0.00021591228,"about_ca_system_score_gemma":0.000032538013,"threshold_uncertainty_score":0.4846761},"labels":[],"label_agreement":null},{"id":"W4205949327","doi":"10.1109/lcomm.2021.3135968","title":"IEEE Communications Society","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network; Computer security","score_opus":0.044030290110430685,"score_gpt":0.29305345605132105,"score_spread":0.24902316594089036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205949327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903597,0.0010060646,0.5485204,0.43473244,0.0010451078,0.00045333093,0.000028219742,0.00094725384,0.0033635881],"genre_scores_gemma":[0.61256945,0.00045774874,0.37073115,0.015227582,0.000031771735,0.0006055618,0.000098600234,0.000016758946,0.00026134317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986006,0.00035616793,0.0002942193,0.00027260763,0.00024678602,0.0002296365],"domain_scores_gemma":[0.99254686,0.00037574308,0.00017212085,0.006762093,0.00009225708,0.00005092353],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004915119,0.00012713058,0.000119502714,0.0001451832,0.0024293126,0.00008092937,0.009274151,0.000052089577,0.00003324403],"category_scores_gemma":[0.0000224821,0.00015665083,0.00012396474,0.0010600613,0.00039478685,0.0004126836,0.0018196187,0.0006974699,0.00006735524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789567,0.001313058,0.001985665,0.000013441212,0.0001999724,0.0000017270618,0.007672926,0.017579198,0.020011554,0.5194754,0.41948688,0.012255389],"study_design_scores_gemma":[0.00076430215,0.00007873938,0.0017321083,0.00001784746,0.000050258404,0.000102099104,0.0011245214,0.36054036,0.0016328745,0.010611189,0.6224708,0.00087492465],"about_ca_topic_score_codex":0.00003271938,"about_ca_topic_score_gemma":0.000013753008,"teacher_disagreement_score":0.6026659,"about_ca_system_score_codex":0.00022108544,"about_ca_system_score_gemma":0.00013027567,"threshold_uncertainty_score":0.99886936},"labels":[],"label_agreement":null},{"id":"W4206139663","doi":"10.1109/lcomm.2022.3140247","title":"Cooperation in Space: HAPS-Aided Optical Inter-Satellite Connectivity With Opportunistic Scheduling","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Satellite; Constellation; Satellite constellation; Real-time computing; Zenith; Computer network; Remote sensing; Aerospace engineering; Mathematical optimization","score_opus":0.030205907231370396,"score_gpt":0.2464006358451232,"score_spread":0.2161947286137528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206139663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8849899,0.0008421187,0.07578296,0.030649098,0.00020812544,0.0006851241,0.00002787872,0.0015437531,0.0052710474],"genre_scores_gemma":[0.9707807,0.0005138105,0.027771948,0.00033714273,0.00000857559,0.00044828074,0.00007916207,0.00004721788,0.000013197564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871105,0.00022222575,0.00037628337,0.00021308343,0.00018635034,0.0002910046],"domain_scores_gemma":[0.99689966,0.00053776754,0.000060746446,0.0023890203,0.000050692834,0.000062132174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039318044,0.00019563128,0.00024514942,0.000285083,0.00036102126,0.00007989662,0.0014977391,0.00006250066,0.00003456286],"category_scores_gemma":[0.00011356762,0.00021745128,0.000041085084,0.000717691,0.00035936784,0.00022911858,0.0005029796,0.001099157,0.000025540145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010445157,0.00084918464,0.00718117,0.000113255264,0.00023921298,0.000043883254,0.0017034911,0.5068101,0.24992694,0.18668187,0.0008438761,0.04550253],"study_design_scores_gemma":[0.0021366708,0.00025831984,0.004488676,0.00021203262,0.00006507955,0.00010318538,0.0031159513,0.9527687,0.017466115,0.00078611,0.01704774,0.0015514498],"about_ca_topic_score_codex":0.00002806358,"about_ca_topic_score_gemma":0.00017840814,"teacher_disagreement_score":0.44595852,"about_ca_system_score_codex":0.0004117091,"about_ca_system_score_gemma":0.00003755467,"threshold_uncertainty_score":0.88674057},"labels":[],"label_agreement":null},{"id":"W4206542241","doi":"10.1109/lcomm.2022.3140271","title":"NOMA Empowered Integrated Sensing and Communication","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":227,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Noma; Computer science; Base station; Throughput; Beamforming; Single antenna interference cancellation; Power (physics); Mathematical optimization; Computer network; Wireless; Telecommunications; Telecommunications link; Channel (broadcasting); Mathematics","score_opus":0.013824821486929971,"score_gpt":0.21752816697317226,"score_spread":0.20370334548624228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206542241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9000841,0.0034889528,0.070875384,0.016319295,0.0004947981,0.00053681125,0.000072401555,0.00320242,0.0049258745],"genre_scores_gemma":[0.9900663,0.00035414172,0.008642829,0.00074045826,0.000005445574,0.00003765286,0.000103728074,0.000026671061,0.000022804375],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993493,0.00012869222,0.00019732256,0.00009411635,0.000093290924,0.0001372663],"domain_scores_gemma":[0.99842215,0.000107879365,0.000037483187,0.0013797235,0.00002911168,0.000023658324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015527038,0.00010462962,0.000106892476,0.00016584255,0.0006056097,0.000045022272,0.0006854916,0.000034428092,0.000025192729],"category_scores_gemma":[0.000019878944,0.00012387313,0.000027436958,0.0003706243,0.00017828487,0.000093085095,0.00029199576,0.00039792559,0.000008660938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045578156,0.00022837058,0.0043517733,0.00012802058,0.00046721543,0.000018782788,0.015075389,0.17395078,0.40011397,0.014780996,0.18614697,0.20469216],"study_design_scores_gemma":[0.0010519836,0.00004786685,0.0016233017,0.000052543703,0.00006153016,0.00012466937,0.006398231,0.615082,0.013768449,0.0010866143,0.359786,0.0009167861],"about_ca_topic_score_codex":0.000071652794,"about_ca_topic_score_gemma":0.000045705554,"teacher_disagreement_score":0.44113123,"about_ca_system_score_codex":0.00012725535,"about_ca_system_score_gemma":0.000008783031,"threshold_uncertainty_score":0.50514},"labels":[],"label_agreement":null},{"id":"W4206662770","doi":"10.1109/lcomm.2014.02.cover3","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Institut National de la Recherche Scientifique","funders":"Indian Institute of Technology Bombay; King's College London; Universitat Pompeu Fabra; Drexel University; Jackson State University; Arizona State University; George Washington University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.03827669833861502,"score_gpt":0.2926258265940878,"score_spread":0.2543491282554728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206662770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661598,0.00019901372,0.012848773,0.14147368,0.00052449695,0.0005330528,0.00009062828,0.001448069,0.07672251],"genre_scores_gemma":[0.98383445,0.000013996835,0.01151777,0.004171342,0.00007538329,0.000067488756,0.000065124535,0.00006992108,0.00018454637],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986885,0.00043970533,0.00024219968,0.00017799213,0.0001912502,0.00026034474],"domain_scores_gemma":[0.9945015,0.00034520953,0.000116127434,0.00488133,0.000067027366,0.000088831555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045067442,0.00013573497,0.00013841617,0.00014864486,0.00037277286,0.00008226,0.0021314474,0.000039201735,0.00006905045],"category_scores_gemma":[0.00011729809,0.00014793056,0.00007409182,0.00037301116,0.00041765757,0.00018909323,0.00021817854,0.00028622837,0.0054552373],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010099839,0.00032665965,0.0026422008,0.000009194312,0.000058621437,7.542337e-7,0.00083016173,0.00031872137,0.4916554,0.020128783,0.47963455,0.0043848297],"study_design_scores_gemma":[0.0003849516,0.000021156075,0.0015726715,0.000018079229,0.000029651163,0.000006608109,0.00006193783,0.0030237865,0.0026534686,0.0002282205,0.9917187,0.00028075112],"about_ca_topic_score_codex":0.000121674944,"about_ca_topic_score_gemma":0.00023441148,"teacher_disagreement_score":0.5120841,"about_ca_system_score_codex":0.0001099388,"about_ca_system_score_gemma":0.00001589479,"threshold_uncertainty_score":0.9953191},"labels":[],"label_agreement":null},{"id":"W4206993101","doi":"10.1109/lcomm.2021.3108385","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association; Memorial University of Newfoundland","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206993101","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4207055619","doi":"10.1109/lcomm.2022.3145364","title":"Copula-Based Modeling of RIS-Assisted Communications: Outage Probability Analysis","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Copula (linguistics); Computer science; Rayleigh fading; Bivariate analysis; Outage probability; Joint probability distribution; Exploit; Fading; Algorithm; Statistics; Decoding methods; Mathematics; Econometrics; Machine learning","score_opus":0.06631402444628051,"score_gpt":0.2831627209932037,"score_spread":0.2168486965469232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207055619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18788144,0.0042918986,0.7915202,0.010994406,0.00014230105,0.0010429283,0.0003387833,0.002593215,0.0011948723],"genre_scores_gemma":[0.8598097,0.0003750859,0.13833345,0.00023709184,0.0000029171179,0.00084037054,0.00035410238,0.00004218893,0.0000050858343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977761,0.00054109935,0.00085183984,0.0002421335,0.00031939452,0.0002694573],"domain_scores_gemma":[0.98648953,0.0005409011,0.00025098608,0.012533551,0.00013574352,0.00004926875],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00058253814,0.00023295348,0.00045537093,0.0007099962,0.00076258485,0.00002748891,0.0062850285,0.00007252089,0.000038128484],"category_scores_gemma":[0.00009044197,0.00029197024,0.00026996978,0.002587413,0.00054288097,0.00017934435,0.0012860022,0.0009022624,0.0000061640485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061205183,0.00019782432,0.0013279201,0.000031531777,0.00027967241,2.3350314e-7,0.00023883776,0.98558426,0.008670658,0.0010470989,0.0001684016,0.0024474617],"study_design_scores_gemma":[0.00028083377,0.000014936423,0.0004312569,0.0000143300695,0.00016844607,0.0000012352862,0.000454601,0.9944665,0.0009575049,0.00054077606,0.002385279,0.00028432818],"about_ca_topic_score_codex":0.00011581057,"about_ca_topic_score_gemma":0.00019133395,"teacher_disagreement_score":0.6719283,"about_ca_system_score_codex":0.00046361054,"about_ca_system_score_gemma":0.000042065312,"threshold_uncertainty_score":0.99995327},"labels":[],"label_agreement":null},{"id":"W4210587527","doi":"10.1109/lcomm.2020.3000620","title":"IEEE Communications Letters Publication Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05797539128489154,"score_gpt":0.27898466830002394,"score_spread":0.2210092770151324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210587527","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007189346,0.00013607834,0.41478828,0.57438135,0.00047876927,0.00040560172,0.000013947456,0.00094824284,0.0016583728],"genre_scores_gemma":[0.8627619,0.00015009892,0.06914053,0.06727743,0.00008997263,0.00036952086,0.00017043989,0.000016263008,0.000023831486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979259,0.0003626707,0.0007550055,0.00030880232,0.00030384914,0.00034380623],"domain_scores_gemma":[0.99167436,0.00028091646,0.00046646365,0.007094466,0.0002953531,0.00018842754],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046989377,0.00022236077,0.0002274718,0.00035461018,0.0008151506,0.00046549202,0.009567253,0.00013528082,0.000013156967],"category_scores_gemma":[0.00019103786,0.0002498703,0.00011138767,0.0015824543,0.0004259127,0.0032424782,0.00074856635,0.0006019305,0.0016384905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009592869,0.000267503,0.0024921463,0.00006166526,0.00015682935,8.9491124e-7,0.017498834,0.0003136759,0.06917057,0.12137197,0.75064063,0.0380157],"study_design_scores_gemma":[0.0006668667,0.00004110721,0.002682547,0.000042017065,0.000033159202,0.000034665514,0.0005192517,0.044455662,0.0037137216,0.0002699236,0.9468413,0.00069979863],"about_ca_topic_score_codex":0.00006878373,"about_ca_topic_score_gemma":0.000013131693,"teacher_disagreement_score":0.8555726,"about_ca_system_score_codex":0.00014316535,"about_ca_system_score_gemma":0.00011282951,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W4210839730","doi":"10.1109/lcomm.2022.3150666","title":"SSK-ICS LoRa: A LoRa-Based Modulation Scheme With Constant Envelope and Enhanced Data Rate","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Thompson Rivers University","funders":"Thompson Rivers University","keywords":"Modulation (music); Computer science; Pulse-amplitude modulation; Pulse-position modulation; Delta modulation; Keying; Electronic engineering; Quadrature amplitude modulation; Bit error rate; Transmission (telecommunications); Bandwidth (computing); Chirp; Detector; Phase-shift keying; Algorithm; Real-time computing; Telecommunications; Decoding methods; Optics; Pulse (music); Physics; Engineering","score_opus":0.046092828638791924,"score_gpt":0.2627267692078231,"score_spread":0.21663394056903118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210839730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20208947,0.0009310223,0.7698686,0.014491187,0.00038931696,0.008338765,0.0003775112,0.0008240137,0.0026901127],"genre_scores_gemma":[0.98022026,0.000055957466,0.016540892,0.0010138245,0.000028182736,0.0016946647,0.0004005679,0.000034474586,0.000011166568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919003,0.00013796381,0.00019609404,0.00017796304,0.00012147603,0.0001764809],"domain_scores_gemma":[0.9979236,0.00015282258,0.000059604492,0.0017924716,0.000027737464,0.00004377662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032041213,0.00013084723,0.00013301443,0.00007120603,0.0003755757,0.00006129552,0.0007928797,0.00002656313,0.000029082683],"category_scores_gemma":[0.0000063224993,0.00013780258,0.000014086092,0.0003007342,0.00012429974,0.00017709349,0.00025416372,0.00033687195,0.0000065889485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015534431,0.00014177943,0.0014463569,0.00016034025,0.00023965859,0.000011985872,0.00078116416,0.8113365,0.13819526,0.0011067042,0.028447269,0.017977623],"study_design_scores_gemma":[0.00079333415,0.000033432636,0.00048801614,0.00005087471,0.000019565647,0.0000048489746,0.000057763093,0.95606434,0.0010933403,0.000044639062,0.041050613,0.00029922475],"about_ca_topic_score_codex":0.000014837369,"about_ca_topic_score_gemma":0.000032485932,"teacher_disagreement_score":0.77813077,"about_ca_system_score_codex":0.0000749538,"about_ca_system_score_gemma":0.000039224215,"threshold_uncertainty_score":0.56194264},"labels":[],"label_agreement":null},{"id":"W4210916635","doi":"10.1109/lcomm.2022.3149467","title":"UAV Placement and Resource Allocation for Intelligent Reflecting Surface Assisted UAV-Based Wireless Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Computer science; Wireless; Optimization problem; Channel allocation schemes; Bandwidth allocation; Linear programming; Mathematical optimization; Computer network; Wireless network; Resource allocation; Bandwidth (computing); Distributed computing; Algorithm; Telecommunications; Mathematics","score_opus":0.05408082142630096,"score_gpt":0.2981267549745121,"score_spread":0.2440459335482111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210916635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06838162,0.001760319,0.917081,0.010456571,0.00016274358,0.000799131,0.00002352845,0.0011878524,0.00014720384],"genre_scores_gemma":[0.9310071,0.00036102373,0.0667565,0.0007210657,0.000013924627,0.00083762134,0.00020622625,0.00006409421,0.000032463126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871314,0.00019757585,0.000413435,0.00023308025,0.00016247253,0.0002802753],"domain_scores_gemma":[0.9965978,0.0008314135,0.00014981923,0.0023225148,0.00005405033,0.00004434844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046981787,0.00019496941,0.0001953959,0.00015395883,0.0009449019,0.000053444764,0.0013891503,0.000069008325,0.000006725021],"category_scores_gemma":[0.00004302387,0.00024883635,0.000057507998,0.00044572004,0.0001748788,0.000099496356,0.0004255085,0.00062466715,0.0000015771622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015777,0.00004521588,0.000112736816,0.00002452672,0.000039513878,2.0111709e-7,0.00024104909,0.96034145,0.023019146,0.0004685988,0.002454975,0.013236829],"study_design_scores_gemma":[0.00043090672,0.000043720727,0.000091411166,0.000039436578,0.000022595366,0.0000046065466,0.0014771146,0.928986,0.008270176,0.00005288353,0.060243,0.00033814786],"about_ca_topic_score_codex":0.000013423484,"about_ca_topic_score_gemma":0.00003665534,"teacher_disagreement_score":0.8626255,"about_ca_system_score_codex":0.00046454722,"about_ca_system_score_gemma":0.000017771968,"threshold_uncertainty_score":0.99999636},"labels":[],"label_agreement":null},{"id":"W4211108548","doi":"10.1109/lcomm.2022.3145250","title":"IEEE Communications Society","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.044030290110430685,"score_gpt":0.29305345605132105,"score_spread":0.24902316594089036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211108548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903597,0.0010060646,0.5485204,0.43473244,0.0010451078,0.00045333093,0.000028219742,0.00094725384,0.0033635881],"genre_scores_gemma":[0.61256945,0.00045774874,0.37073115,0.015227582,0.000031771735,0.0006055618,0.000098600234,0.000016758946,0.00026134317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986006,0.00035616793,0.0002942193,0.00027260763,0.00024678602,0.0002296365],"domain_scores_gemma":[0.99254686,0.00037574308,0.00017212085,0.006762093,0.00009225708,0.00005092353],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004915119,0.00012713058,0.000119502714,0.0001451832,0.0024293126,0.00008092937,0.009274151,0.000052089577,0.00003324403],"category_scores_gemma":[0.0000224821,0.00015665083,0.00012396474,0.0010600613,0.00039478685,0.0004126836,0.0018196187,0.0006974699,0.00006735524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789567,0.001313058,0.001985665,0.000013441212,0.0001999724,0.0000017270618,0.007672926,0.017579198,0.020011554,0.5194754,0.41948688,0.012255389],"study_design_scores_gemma":[0.00076430215,0.00007873938,0.0017321083,0.00001784746,0.000050258404,0.000102099104,0.0011245214,0.36054036,0.0016328745,0.010611189,0.6224708,0.00087492465],"about_ca_topic_score_codex":0.00003271938,"about_ca_topic_score_gemma":0.000013753008,"teacher_disagreement_score":0.6026659,"about_ca_system_score_codex":0.00022108544,"about_ca_system_score_gemma":0.00013027567,"threshold_uncertainty_score":0.99886936},"labels":[],"label_agreement":null},{"id":"W4213003533","doi":"10.1109/lcomm.2020.3046394","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; South China University of Technology; University of Akron; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213003533","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4213372665","doi":"10.1109/lcomm.2021.3097421","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213372665","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4214494401","doi":"10.1109/lcomm.2022.3143850","title":"Path Loss of RIS-Aided Spatial Modulation With On/Off Pattern","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada","keywords":"Path loss; Modulation (music); Spatial modulation; Computer science; Wireless; Path (computing); Leakage (economics); Power (physics); Electronic engineering; Telecommunications; Topology (electrical circuits); Electrical engineering; Physics; Acoustics; Computer network; Engineering","score_opus":0.017318330181301675,"score_gpt":0.2310918926104767,"score_spread":0.213773562429175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214494401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6989814,0.0003450527,0.29343185,0.0051773465,0.0001350378,0.00039396374,0.00009180363,0.0009214954,0.0005220403],"genre_scores_gemma":[0.9915299,0.0002950104,0.007382883,0.00031283032,0.000010155631,0.00031960808,0.00009456849,0.000046810248,0.000008261383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989968,0.00013301248,0.0003122783,0.00014444353,0.00024256998,0.00017089359],"domain_scores_gemma":[0.99634993,0.00021357155,0.00014191467,0.0032270122,0.00004277251,0.000024825114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012221414,0.00015534274,0.00018314825,0.0002077655,0.00029956142,0.000012233956,0.0016522858,0.000037249618,0.000029432356],"category_scores_gemma":[0.00001582584,0.000168712,0.00004780361,0.0003839622,0.00022705998,0.00012094872,0.00031092658,0.00053336076,0.000013712592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013413465,0.00009574941,0.002065143,0.000020500527,0.00005353898,0.0000017990221,0.00041278944,0.92647815,0.0135517875,0.0005163933,0.00063283753,0.05615792],"study_design_scores_gemma":[0.0022726308,0.00038052132,0.02233182,0.00017962244,0.000056119636,0.00003784162,0.0013287425,0.9112659,0.033600505,0.0009659622,0.026295122,0.0012851806],"about_ca_topic_score_codex":0.00005684697,"about_ca_topic_score_gemma":0.00004848857,"teacher_disagreement_score":0.29254845,"about_ca_system_score_codex":0.00017650376,"about_ca_system_score_gemma":0.000012477222,"threshold_uncertainty_score":0.68798757},"labels":[],"label_agreement":null},{"id":"W4214543783","doi":"10.1109/lcomm.2019.2942404","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; University of Science and Technology Beijing; Tarbiat Modares University; Universidad Carlos III de Madrid; University of Akron; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Qatar University; Indian Institute of Technology Delhi; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; Indian Institute of Technology Indore; Santa Clara University; Deakin University; University of Macedonia; Heriot-Watt University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214543783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4214605553","doi":"10.1109/lcomm.2022.3155442","title":"Signal Space Diversity-Based Distributed RIS-Aided Dual-Hop Mixed RF-FSO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Relay; Fading; Computer science; Nakagami distribution; Independent and identically distributed random variables; Diversity combining; Wireless; Bit error rate; Communications system; Radio frequency; Optical wireless; Electronic engineering; Topology (electrical circuits); Algorithm; Telecommunications; Decoding methods; Mathematics; Physics; Electrical engineering; Statistics; Random variable; Engineering; Power (physics)","score_opus":0.027967259519227704,"score_gpt":0.23154181623050263,"score_spread":0.20357455671127492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214605553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12781098,0.0029122839,0.8371986,0.022428926,0.0010657149,0.0010440395,0.0010532704,0.0058180382,0.00066812115],"genre_scores_gemma":[0.99154484,0.00016510229,0.0067894924,0.00032224634,0.000021342708,0.0004784796,0.0005990973,0.000057719157,0.000021667482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983615,0.00032714792,0.00039240796,0.00023938814,0.00031158637,0.00036792312],"domain_scores_gemma":[0.9950172,0.0005536273,0.0001601644,0.0041233734,0.00007222415,0.00007345609],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00029935077,0.0002585142,0.00028718196,0.0003086479,0.001717747,0.00006609195,0.003143273,0.00007903568,0.00003416811],"category_scores_gemma":[0.000042758988,0.0003314269,0.00011481458,0.0009125535,0.0003236137,0.00020108167,0.0020135199,0.0009609897,0.00004410005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008262728,0.000092233626,0.00079588435,0.000032578322,0.00009867821,0.0000045182073,0.00021144045,0.9194999,0.04697478,0.002894426,0.02885522,0.00053208723],"study_design_scores_gemma":[0.002529904,0.00010319246,0.0009926084,0.000113366004,0.00013982762,0.000028276207,0.0046766135,0.62480795,0.024236789,0.0009302395,0.33950326,0.0019379593],"about_ca_topic_score_codex":0.000108501044,"about_ca_topic_score_gemma":0.000021408503,"teacher_disagreement_score":0.8637339,"about_ca_system_score_codex":0.00064016646,"about_ca_system_score_gemma":0.000028212506,"threshold_uncertainty_score":0.99991375},"labels":[],"label_agreement":null},{"id":"W4220899214","doi":"10.1109/lcomm.2022.3154277","title":"IEEE Communications Society","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; National Technical University of Athens; Shenzhen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; Chinese University of Hong Kong; Southwest Jiaotong University; Università degli Studi di Firenze; Qatar University; Tsinghua University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Loughborough University; Hunan University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; Eidgenössische Technische Hochschule Zürich; Jinan University; Technische Universiteit Eindhoven; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Nanjing University; Oulun Yliopisto; Pohang University of Science and Technology; Beijing Institute of Technology; Sun Yat-sen University; Shanghai Educational Development Foundation; Hanyang University; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Indian Institute of Technology Kanpur; University of Sussex; Southeast University; Kungliga Tekniska Högskolan; University of Science and Technology Beijing; University of Warwick; University of Alberta; Universidad de Málaga; University of Glasgow; York University; Trường Đại học Bách Khoa Hà Nội; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Indian Institute of Technology Indore; Santa Clara University; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; South China University of Technology; University of Surrey; University of Akron; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; University of Electronic Science and Technology of China; Soongsil University; Università di Bologna; Università degli Studi di Napoli Parthenope; Singapore University of Technology and Design; Northumbria University; University College London; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.044030290110430685,"score_gpt":0.29305345605132105,"score_spread":0.24902316594089036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220899214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903597,0.0010060646,0.5485204,0.43473244,0.0010451078,0.00045333093,0.000028219742,0.00094725384,0.0033635881],"genre_scores_gemma":[0.61256945,0.00045774874,0.37073115,0.015227582,0.000031771735,0.0006055618,0.000098600234,0.000016758946,0.00026134317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986006,0.00035616793,0.0002942193,0.00027260763,0.00024678602,0.0002296365],"domain_scores_gemma":[0.99254686,0.00037574308,0.00017212085,0.006762093,0.00009225708,0.00005092353],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004915119,0.00012713058,0.000119502714,0.0001451832,0.0024293126,0.00008092937,0.009274151,0.000052089577,0.00003324403],"category_scores_gemma":[0.0000224821,0.00015665083,0.00012396474,0.0010600613,0.00039478685,0.0004126836,0.0018196187,0.0006974699,0.00006735524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789567,0.001313058,0.001985665,0.000013441212,0.0001999724,0.0000017270618,0.007672926,0.017579198,0.020011554,0.5194754,0.41948688,0.012255389],"study_design_scores_gemma":[0.00076430215,0.00007873938,0.0017321083,0.00001784746,0.000050258404,0.000102099104,0.0011245214,0.36054036,0.0016328745,0.010611189,0.6224708,0.00087492465],"about_ca_topic_score_codex":0.00003271938,"about_ca_topic_score_gemma":0.000013753008,"teacher_disagreement_score":0.6026659,"about_ca_system_score_codex":0.00022108544,"about_ca_system_score_gemma":0.00013027567,"threshold_uncertainty_score":0.99886936},"labels":[],"label_agreement":null},{"id":"W4225665835","doi":"10.1109/lcomm.2022.3163468","title":"An Adaptive Rate Allocation Scheme for Time-Varying Graph Signal Quantization","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Quantization (signal processing); Computer science; Telecommunications link; Rate distortion; Graph; Algorithm; Rate–distortion theory; Data compression; Real-time computing; Theoretical computer science; Mathematics; Coding (social sciences); Telecommunications","score_opus":0.039847276622123874,"score_gpt":0.2868055933345587,"score_spread":0.24695831671243482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225665835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011601466,0.00011675011,0.9784778,0.008733741,0.00018240676,0.00053726067,0.000013900484,0.00028767792,0.000049046284],"genre_scores_gemma":[0.6785768,0.00001663908,0.31662798,0.004042509,0.000036323672,0.000504869,0.00015438334,0.000021809738,0.00001863529],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983861,0.000508128,0.0002795476,0.00036732724,0.00019877065,0.00026013234],"domain_scores_gemma":[0.99718094,0.00039866284,0.00021843317,0.0020205386,0.000115750794,0.00006565662],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00046772824,0.00014552902,0.00013109088,0.0002181446,0.0013178706,0.00010084526,0.0028171886,0.000028424462,0.000008495873],"category_scores_gemma":[0.000013100805,0.00017719851,0.00008342762,0.00096548954,0.00010545362,0.0009682585,0.00034662784,0.00028789646,0.000010027042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006087676,0.00025541944,0.00010303672,0.0000065428444,0.00005689273,0.0000017743424,0.0009203781,0.37007234,0.5557419,0.05063679,0.004951325,0.017192721],"study_design_scores_gemma":[0.00032576622,0.00017467362,0.000102420345,0.000007744128,0.000009900747,0.0000057326147,0.00003546976,0.9911251,0.0023729887,0.0033760483,0.002216694,0.00024748396],"about_ca_topic_score_codex":0.000011235187,"about_ca_topic_score_gemma":0.0000052247956,"teacher_disagreement_score":0.6669754,"about_ca_system_score_codex":0.00009575591,"about_ca_system_score_gemma":0.000037822876,"threshold_uncertainty_score":0.9999823},"labels":[],"label_agreement":null},{"id":"W4225921667","doi":"10.1109/lcomm.2022.3163622","title":"Optimization and Simplification of PCPA Decoder for Reed-Muller Codes","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Soft-decision decoder; Algorithm; Computer science; Computational complexity theory; Projection (relational algebra); Pruning; Mathematics","score_opus":0.041252821202650516,"score_gpt":0.29731938619624476,"score_spread":0.25606656499359426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225921667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011142706,0.0001402675,0.97445345,0.013364036,0.00011963784,0.00039682243,0.00001236412,0.00022402093,0.00014671261],"genre_scores_gemma":[0.56070167,0.000037783862,0.43809727,0.0008331558,0.000006249705,0.00027903152,0.00001930342,0.000009460906,0.00001604763],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990831,0.00018241355,0.00026332212,0.00021059158,0.00014018248,0.000120399935],"domain_scores_gemma":[0.99745667,0.0004508771,0.00021372575,0.0017427199,0.00010960914,0.000026418984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062367,0.00008359219,0.000116941184,0.00016768831,0.00047598965,0.000042342755,0.0016208052,0.000023272376,0.000003863849],"category_scores_gemma":[0.000064464264,0.00009984531,0.0000418482,0.0003425702,0.000095534044,0.0002206079,0.00051647634,0.00013942472,5.5922914e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068951216,0.00090747577,0.0048309406,0.00015840464,0.00018588369,0.0000012285968,0.013673129,0.3579666,0.37776357,0.1013532,0.07892436,0.06416628],"study_design_scores_gemma":[0.00031348644,0.00009374412,0.0004075101,0.000016557946,0.000020244064,0.000015293086,0.00015571383,0.9795033,0.008264763,0.0013031164,0.009666629,0.00023966114],"about_ca_topic_score_codex":0.000037857684,"about_ca_topic_score_gemma":0.000012780566,"teacher_disagreement_score":0.6215367,"about_ca_system_score_codex":0.00006948016,"about_ca_system_score_gemma":0.00002894826,"threshold_uncertainty_score":0.40715736},"labels":[],"label_agreement":null},{"id":"W4226045776","doi":"10.1109/lcomm.2022.3156134","title":"IEEE Communications Society","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; National Technical University of Athens; Shenzhen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; Chinese University of Hong Kong; Southwest Jiaotong University; Università degli Studi di Firenze; Qatar University; Tsinghua University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Loughborough University; Hunan University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; Eidgenössische Technische Hochschule Zürich; Jinan University; Technische Universiteit Eindhoven; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Nanjing University; Oulun Yliopisto; Pohang University of Science and Technology; Beijing Institute of Technology; Sun Yat-sen University; Shanghai Educational Development Foundation; Hanyang University; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Indian Institute of Technology Kanpur; University of Sussex; Southeast University; Kungliga Tekniska Högskolan; University of Science and Technology Beijing; University of Warwick; University of Alberta; Universidad de Málaga; University of Glasgow; York University; Trường Đại học Bách Khoa Hà Nội; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Indian Institute of Technology Indore; Santa Clara University; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; South China University of Technology; University of Surrey; University of Akron; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; University of Electronic Science and Technology of China; Soongsil University; Università di Bologna; Università degli Studi di Napoli Parthenope; Singapore University of Technology and Design; Northumbria University; University College London; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.044030290110430685,"score_gpt":0.29305345605132105,"score_spread":0.24902316594089036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226045776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903597,0.0010060646,0.5485204,0.43473244,0.0010451078,0.00045333093,0.000028219742,0.00094725384,0.0033635881],"genre_scores_gemma":[0.61256945,0.00045774874,0.37073115,0.015227582,0.000031771735,0.0006055618,0.000098600234,0.000016758946,0.00026134317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986006,0.00035616793,0.0002942193,0.00027260763,0.00024678602,0.0002296365],"domain_scores_gemma":[0.99254686,0.00037574308,0.00017212085,0.006762093,0.00009225708,0.00005092353],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004915119,0.00012713058,0.000119502714,0.0001451832,0.0024293126,0.00008092937,0.009274151,0.000052089577,0.00003324403],"category_scores_gemma":[0.0000224821,0.00015665083,0.00012396474,0.0010600613,0.00039478685,0.0004126836,0.0018196187,0.0006974699,0.00006735524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789567,0.001313058,0.001985665,0.000013441212,0.0001999724,0.0000017270618,0.007672926,0.017579198,0.020011554,0.5194754,0.41948688,0.012255389],"study_design_scores_gemma":[0.00076430215,0.00007873938,0.0017321083,0.00001784746,0.000050258404,0.000102099104,0.0011245214,0.36054036,0.0016328745,0.010611189,0.6224708,0.00087492465],"about_ca_topic_score_codex":0.00003271938,"about_ca_topic_score_gemma":0.000013753008,"teacher_disagreement_score":0.6026659,"about_ca_system_score_codex":0.00022108544,"about_ca_system_score_gemma":0.00013027567,"threshold_uncertainty_score":0.99886936},"labels":[],"label_agreement":null},{"id":"W4226153432","doi":"10.1109/lcomm.2022.3170061","title":"Deep Reinforcement Learning for RIS-Assisted FD Systems: Single or Distributed RIS?","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Artificial intelligence","score_opus":0.05522470545053315,"score_gpt":0.2647961494591553,"score_spread":0.20957144400862215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226153432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008393121,0.0006951578,0.98778135,0.0012510909,0.00048047333,0.0005934101,0.000024855606,0.00037908094,0.00040147142],"genre_scores_gemma":[0.9950362,0.0000915351,0.0030395237,0.000247573,0.00003964064,0.00082430465,0.00044251358,0.00004329582,0.00023541675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988812,0.00013757676,0.0003805906,0.00014791942,0.00017714662,0.00027554616],"domain_scores_gemma":[0.9984281,0.00024412965,0.00009072527,0.0011291641,0.000050139708,0.0000577578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024780486,0.00014999029,0.00017993429,0.00009470765,0.00078980526,0.000079625686,0.00092156406,0.00002813372,0.00006863049],"category_scores_gemma":[0.00003488785,0.00015586507,0.000080838276,0.00028495223,0.000051928848,0.000087930974,0.00017118237,0.00036598017,0.000017335078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011302476,0.000037068286,0.000038086877,0.000045070294,0.00006882548,0.0000016844361,0.0003725764,0.98168,0.008591644,0.00016767335,0.006825678,0.002160411],"study_design_scores_gemma":[0.00021631178,0.000055093442,0.00005050595,0.000023568673,0.00003150925,0.000013957842,0.000575693,0.7979641,0.0006550238,0.0000043808122,0.20018941,0.00022047633],"about_ca_topic_score_codex":0.000080816426,"about_ca_topic_score_gemma":0.000036037574,"teacher_disagreement_score":0.9866431,"about_ca_system_score_codex":0.00037620644,"about_ca_system_score_gemma":0.0000136329345,"threshold_uncertainty_score":0.6355993},"labels":[],"label_agreement":null},{"id":"W4226155980","doi":"10.1109/lcomm.2022.3170319","title":"Robust Secure Energy Efficient Beamforming for mmWave UAV Communications With Jittering","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Benchmark (surveying); Mathematical optimization; Convex optimization; Optimization problem; Transmitter power output; Channel (broadcasting); Robustness (evolution); Iterative method; Artificial noise; Energy consumption; Energy (signal processing); Algorithm; Regular polygon; Telecommunications; Mathematics; Transmitter","score_opus":0.028466507814938032,"score_gpt":0.22569186242195974,"score_spread":0.1972253546070217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226155980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044300095,0.0005262289,0.99020666,0.0026219443,0.00023834928,0.00053324475,0.00009575891,0.00048048072,0.0008673346],"genre_scores_gemma":[0.7842475,0.00010867861,0.2126734,0.0005497927,0.000040569266,0.0018697332,0.00035538975,0.00010252279,0.000052407086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887145,0.00010565216,0.0003612334,0.00019556173,0.0001575942,0.00030851818],"domain_scores_gemma":[0.9964419,0.00026703544,0.00012359009,0.0030322268,0.000073492876,0.00006177149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000203203,0.00020455106,0.00020065912,0.00020702452,0.0011499781,0.00004862749,0.0016377523,0.000036826455,0.000009482904],"category_scores_gemma":[0.00000923909,0.00023687525,0.00007146676,0.00047314298,0.0001272311,0.0001550857,0.00038731215,0.00032824263,0.000003024768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065203853,0.0000414297,0.000015923017,0.000025772597,0.000052495783,4.623721e-7,0.00083267264,0.98633164,0.009278177,0.0012226409,0.001315169,0.0008771121],"study_design_scores_gemma":[0.0004364233,0.00002892259,0.00000474809,0.000040965653,0.000036123754,0.000030091942,0.00069813046,0.9345836,0.0006831647,0.000016502087,0.06312637,0.00031498022],"about_ca_topic_score_codex":0.00003701576,"about_ca_topic_score_gemma":0.00010200734,"teacher_disagreement_score":0.7798175,"about_ca_system_score_codex":0.00042999687,"about_ca_system_score_gemma":0.000024202673,"threshold_uncertainty_score":0.96594924},"labels":[],"label_agreement":null},{"id":"W4226177089","doi":"10.1109/lcomm.2022.3163668","title":"3-D Antenna Array Structures for Millimeter Wave Multi-User Massive MIMO Hybrid Precoder Design: A Performance Comparison","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Baseband; Precoding; MIMO; Computer science; Singular value decomposition; Beamforming; Extremely high frequency; Electronic engineering; Spectral efficiency; Antenna (radio); Channel (broadcasting); Antenna array; Multi-user MIMO; Interference (communication); Topology (electrical circuits); Algorithm; Telecommunications; Bandwidth (computing); Engineering; Electrical engineering","score_opus":0.09014299472495557,"score_gpt":0.2765768072314071,"score_spread":0.18643381250645152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226177089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092094846,0.0006305176,0.90451175,0.0013013659,0.00044393304,0.00063361897,0.00011126889,0.000211838,0.000060856477],"genre_scores_gemma":[0.78191507,0.00012603206,0.21580327,0.0012234163,0.000034347846,0.00056904054,0.00014155333,0.000060258742,0.0001269937],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868137,0.00017878941,0.00041773805,0.00023457201,0.00017132741,0.00031619502],"domain_scores_gemma":[0.9983448,0.00020520159,0.000098649405,0.00119065,0.0000925104,0.00006821542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022504017,0.00021962362,0.00023695211,0.00016228578,0.00062951806,0.000059181526,0.00065553875,0.00003414384,0.00007885926],"category_scores_gemma":[0.000019244788,0.00024330377,0.00011935675,0.00015437901,0.00007155765,0.00015205181,0.00012136647,0.0004270369,0.000015062581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030270068,0.00006789556,0.00009161508,0.000059883718,0.00014748712,0.000001114425,0.0012923945,0.4010572,0.5819875,0.000010629878,0.011431568,0.0038224086],"study_design_scores_gemma":[0.0006189378,0.000032667303,0.00006543242,0.000014097168,0.000047087844,0.00001476188,0.00014972994,0.8155561,0.16580103,0.000036903682,0.017359385,0.00030388558],"about_ca_topic_score_codex":0.0000049335754,"about_ca_topic_score_gemma":0.000006397469,"teacher_disagreement_score":0.68982023,"about_ca_system_score_codex":0.00015759167,"about_ca_system_score_gemma":0.000024967636,"threshold_uncertainty_score":0.99216396},"labels":[],"label_agreement":null},{"id":"W4226314137","doi":"10.1109/lcomm.2022.3167368","title":"Multi-Objective GAN-Based Adversarial Attack Technique for Modulation Classifiers","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Université du Québec à Montréal","funders":"Mitacs","keywords":"Adversarial system; Computer science; Jamming; Classifier (UML); Artificial intelligence; Machine learning; Generative grammar; Wireless; Generative adversarial network; Deep learning; Modulation (music); Adversarial machine learning; Task (project management); Telecommunications; Engineering","score_opus":0.0837073165904719,"score_gpt":0.3144816481457586,"score_spread":0.23077433155528668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226314137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032297776,0.000013469541,0.97313875,0.021079421,0.0004717102,0.0015334387,0.000032634503,0.00030017763,0.00020063801],"genre_scores_gemma":[0.7430243,0.0000013023247,0.25216284,0.0017567476,0.00003819039,0.0028217833,0.0001301907,0.000024269584,0.00004037256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978796,0.00056167867,0.00041931708,0.00049132184,0.0003724724,0.00027561458],"domain_scores_gemma":[0.99620533,0.00058111444,0.00035082575,0.0026298878,0.00015899292,0.0000738435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006646369,0.0001889258,0.00017720442,0.00031239257,0.0012320786,0.00009828338,0.0026714979,0.000068946094,0.00001528632],"category_scores_gemma":[0.00008401925,0.00023688961,0.00015159448,0.00084840355,0.00015512705,0.0004678424,0.00023366173,0.00037024915,0.000013937339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043141517,0.00035903818,0.0005594637,0.000012454995,0.000039534156,8.598976e-7,0.00071289646,0.49964583,0.48348165,0.0037937565,0.0085683325,0.0027830414],"study_design_scores_gemma":[0.00093099393,0.0000597893,0.0029558437,0.00000769001,0.000014117989,0.0000034814536,0.00005151709,0.9753088,0.008185241,0.00024811577,0.011939053,0.00029536895],"about_ca_topic_score_codex":0.00004357093,"about_ca_topic_score_gemma":0.000021800392,"teacher_disagreement_score":0.73979455,"about_ca_system_score_codex":0.00075527007,"about_ca_system_score_gemma":0.00015227862,"threshold_uncertainty_score":0.96600777},"labels":[],"label_agreement":null},{"id":"W4229715086","doi":"10.1109/lcomm.2014.2333931","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.06302226251916647,"score_gpt":0.23385820484832695,"score_spread":0.1708359423291605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229715086","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02293461,0.0012570629,0.056192942,0.064366944,0.004444189,0.00069568295,0.0007732775,0.00040761085,0.8489277],"genre_scores_gemma":[0.94973606,0.0019332969,0.026457243,0.014728801,0.000119040444,0.00016778658,0.00018368816,0.000026209142,0.006647864],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988896,0.000039056205,0.0006034441,0.0001908683,0.00003524078,0.00024176884],"domain_scores_gemma":[0.9960307,0.00016519695,0.0003644102,0.0033296272,0.00004768503,0.0000623982],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008111955,0.00013234538,0.00024772173,0.0001417514,0.00070991984,0.00017308077,0.001962977,0.000061008624,0.0002648062],"category_scores_gemma":[0.000061157596,0.00016525446,0.00017924352,0.0002487438,0.0004968596,0.0007983081,0.00034263564,0.00021223385,0.015535557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022742329,0.000083461986,0.0023463909,0.000015218834,0.00012516613,2.4950651e-8,0.0035404232,0.00023031917,0.0001291775,0.16548494,0.82601446,0.0020281759],"study_design_scores_gemma":[0.0003129001,0.000007126731,0.00091719435,0.000008389996,0.000008985407,9.0851967e-7,0.00036775795,0.016442565,0.000027479275,0.0014022685,0.9802881,0.00021633421],"about_ca_topic_score_codex":0.00017200007,"about_ca_topic_score_gemma":0.000022718885,"teacher_disagreement_score":0.92680144,"about_ca_system_score_codex":0.00012684891,"about_ca_system_score_gemma":0.000010272432,"threshold_uncertainty_score":0.985231},"labels":[],"label_agreement":null},{"id":"W4230905788","doi":"10.1109/lcomm.2019.2906986","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Tarbiat Modares University; Indian Institute of Technology Delhi; Tsinghua University; Université de Bretagne Occidentale; University of Akron; South China University of Technology; Qatar University; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; University of Oxford; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; University of Ottawa; Deakin University; University of Macedonia; Heriot-Watt University; Santa Clara University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230905788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4230986973","doi":"10.1109/lcomm.2019.2924117","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; University of Science and Technology Beijing; Tarbiat Modares University; Universidad Carlos III de Madrid; University of Akron; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Qatar University; Indian Institute of Technology Delhi; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; Indian Institute of Technology Indore; Santa Clara University; Deakin University; University of Macedonia; Heriot-Watt University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230986973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4231224973","doi":"10.1109/lcomm.2021.3075044","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231224973","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4231556892","doi":"10.1109/lcomm.2019.2959753","title":"IEEE Communications Society","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; University of Science and Technology Beijing; Tarbiat Modares University; Tsinghua University; Université de Bretagne Occidentale; University of Akron; South China University of Technology; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Universidad Carlos III de Madrid; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Pohang University of Science and Technology; Sun Yat-sen University; Hanyang University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; Southeast University; Indian Institute of Technology, Patna; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Qatar University; Indian Institute of Technology Delhi; University of Ontario Institute of Technology; Queen Mary University of London; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; Indian Institute of Technology Indore; Santa Clara University; Deakin University; University of Macedonia; Heriot-Watt University","keywords":"Computer science; Telecommunications; Computer network; Computer security","score_opus":0.06609773803155293,"score_gpt":0.297207646891981,"score_spread":0.23110990886042804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231556892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021311152,0.00034680046,0.5286612,0.4667363,0.000180018,0.00017249491,0.000005420714,0.00051927345,0.0012474088],"genre_scores_gemma":[0.48325014,0.0007542224,0.47795877,0.03778306,0.00005810252,0.00010133889,0.000042407886,0.000013712783,0.00003826304],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988669,0.0001700632,0.000301772,0.0002858527,0.00016450725,0.00021087343],"domain_scores_gemma":[0.9946011,0.00031626475,0.00014789542,0.00470234,0.00012870318,0.00010374468],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00019899661,0.00014093287,0.00013763981,0.00006255639,0.00071720843,0.000108169384,0.0074973283,0.00010208264,0.000009636846],"category_scores_gemma":[0.00005729969,0.00015916151,0.000120651624,0.00089553464,0.00045494898,0.0005578006,0.00073572627,0.000490541,0.00024231746],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063761204,0.00067530654,0.0025162918,0.000040992087,0.00026671594,0.0000017493502,0.014668743,0.004435474,0.055635683,0.4131128,0.4919516,0.016688282],"study_design_scores_gemma":[0.0008162508,0.00007286496,0.001680603,0.000048391725,0.000060973845,0.000024226063,0.0005006077,0.6829562,0.0066529387,0.004102209,0.3021613,0.00092342554],"about_ca_topic_score_codex":0.000013262329,"about_ca_topic_score_gemma":0.000008264435,"teacher_disagreement_score":0.67852074,"about_ca_system_score_codex":0.00006616846,"about_ca_system_score_gemma":0.00009491583,"threshold_uncertainty_score":0.9978726},"labels":[],"label_agreement":null},{"id":"W4232360642","doi":"10.1109/lcomm.2005.1431160","title":"A tabu search heuristic for the routing and wavelength assignment problem in optical networks","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Routing and wavelength assignment; Heuristic; Computer science; Routing (electronic design automation); Guided Local Search; Mathematical optimization; Blocking (statistics); Set (abstract data type); Local search (optimization); Wavelength-division multiplexing; Algorithm; Wavelength; Mathematics; Computer network","score_opus":0.024577168069845744,"score_gpt":0.2628061420187564,"score_spread":0.23822897394891066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232360642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031006483,0.0013843428,0.9401356,0.0259047,0.00005745286,0.00079355075,0.000003184941,0.00037975435,0.00033496172],"genre_scores_gemma":[0.7913355,0.00077556545,0.20730905,0.00026397142,0.00004541914,0.00024070308,0.0000032311793,0.000021481721,0.0000050506055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921346,0.000028822109,0.00022851051,0.00012363818,0.00007683308,0.00032874648],"domain_scores_gemma":[0.9978468,0.0012934299,0.000017806851,0.0007936215,0.000015726433,0.00003264356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027008948,0.00011395341,0.0001201507,0.00004859365,0.00016930117,0.00004139613,0.00058809423,0.000063907624,0.0000011906681],"category_scores_gemma":[0.000049415317,0.00009553215,0.000025724894,0.00018569586,0.00024211778,0.00008242465,0.00016267765,0.00049093185,0.0000030694366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003364192,0.000020236906,0.00014761742,0.000010367047,0.000019795216,4.2877963e-7,0.00016599511,0.8861085,0.00048207724,0.00494677,0.00053158804,0.10756322],"study_design_scores_gemma":[0.00020696342,0.000010194482,0.00056454376,0.000036323014,0.000010750985,0.0000031293032,0.00012872438,0.99598944,0.00006466224,0.00015648651,0.0027108162,0.00011799231],"about_ca_topic_score_codex":0.0000031800669,"about_ca_topic_score_gemma":0.00002956915,"teacher_disagreement_score":0.76032907,"about_ca_system_score_codex":0.0001283106,"about_ca_system_score_gemma":0.0000047894778,"threshold_uncertainty_score":0.3895688},"labels":[],"label_agreement":null},{"id":"W4232364588","doi":"10.1109/lcomm.2013.02.cover2","title":"[Staff list]","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Royal Holloway, University of London; National Cheng Kung University; Università degli Studi di Ferrara; Singapore University of Technology and Design; Shanghai Jiao Tong University; Killam Trusts; Tongji University; Arizona State University; Università degli Studi di Trento; Institute for Infocomm Research; Chalmers Tekniska Högskola; Aalborg Universitet; Yonsei University; Chinese Academy of Sciences; University of Hong Kong; University College London; University College Dublin; University of Warwick; Queen's University; Swansea University; University of Massachusetts Dartmouth; Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional; Concordia University; Monash University; Santa Clara University; Georgia State University; University of Pretoria; Centre National de la Recherche Scientifique; Dartmouth College; Nanyang Technological University; Oklahoma State University; Lehigh University; City University of Hong Kong","keywords":"Computer science; Computer network","score_opus":0.04144133035103724,"score_gpt":0.2854916481421843,"score_spread":0.24405031779114705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232364588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8304796,0.0002546875,0.00086182123,0.13517596,0.00025978257,0.00073655415,0.00003855253,0.0008428254,0.031350218],"genre_scores_gemma":[0.9821266,0.000027003613,0.012318738,0.0045884037,0.000051559295,0.0003369023,0.00005827298,0.00007488659,0.000417616],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879783,0.0002517064,0.00027230202,0.00018079714,0.00019037774,0.00030698394],"domain_scores_gemma":[0.9947976,0.00022535602,0.0001140154,0.0046413573,0.000113337774,0.00010831856],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017676599,0.00014961079,0.00013550713,0.00016600302,0.00033743738,0.0001422566,0.002251684,0.000045591758,0.00052922894],"category_scores_gemma":[0.00005598637,0.00015748423,0.00008241423,0.00044309924,0.00041830508,0.00044084503,0.00025512784,0.0003123722,0.03242822],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000143405,0.00015347339,0.001181598,0.0000031865682,0.000033046552,5.626432e-7,0.00044379308,0.00004386025,0.4031386,0.0016499144,0.5917903,0.0015601774],"study_design_scores_gemma":[0.00077430217,0.00003429748,0.010643752,0.00004280335,0.000059778817,0.000025470275,0.00044082617,0.003306705,0.0071365586,0.0007600807,0.9760002,0.0007752107],"about_ca_topic_score_codex":0.0006407316,"about_ca_topic_score_gemma":0.000125692,"teacher_disagreement_score":0.39600205,"about_ca_system_score_codex":0.0001376368,"about_ca_system_score_gemma":0.000021740627,"threshold_uncertainty_score":0.96832514},"labels":[],"label_agreement":null},{"id":"W4234455155","doi":"10.1109/lcomm.2005.1431157","title":"Novel Nakagami-m parameter estimator for noisy channel samples","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Nakagami distribution; Fading; Moment (physics); Channel (broadcasting); Statistics; Estimation theory; Computer science; Algorithm; Applied mathematics; Mathematics; Telecommunications; Physics","score_opus":0.054738616849675625,"score_gpt":0.29640299537463655,"score_spread":0.24166437852496092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234455155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007723766,0.00065711245,0.97870135,0.010192256,0.00011055599,0.0005782896,0.000096946096,0.0014790776,0.000460649],"genre_scores_gemma":[0.49723288,0.00026733108,0.5004769,0.0010965134,0.00005271399,0.00071813463,0.00007516475,0.000061735765,0.000018628512],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899757,0.000033399225,0.00038766235,0.00017282853,0.00010828206,0.0003002555],"domain_scores_gemma":[0.9960423,0.0007171245,0.00008013004,0.003008806,0.00007693709,0.00007472047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015419805,0.00021860105,0.00021840786,0.0001641723,0.00027767027,0.00005187275,0.0017452405,0.00008597547,0.0000075191033],"category_scores_gemma":[0.00007786232,0.00025341343,0.000110870846,0.00020066724,0.0001852252,0.00034434066,0.00014198595,0.00028572688,0.00004041237],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018548708,0.0003572558,0.00007019826,0.00013295752,0.0002190219,2.970892e-7,0.0011417666,0.1455684,0.7161506,0.008767705,0.050283477,0.07728982],"study_design_scores_gemma":[0.00088369654,0.000028722185,0.00033425516,0.00012549835,0.000053397016,0.000017719176,0.00009513022,0.5872002,0.10166785,0.0009813238,0.30767125,0.0009409203],"about_ca_topic_score_codex":0.000011579484,"about_ca_topic_score_gemma":0.000045366574,"teacher_disagreement_score":0.6144827,"about_ca_system_score_codex":0.00016403115,"about_ca_system_score_gemma":0.000011596816,"threshold_uncertainty_score":0.99999183},"labels":[],"label_agreement":null},{"id":"W4235101927","doi":"10.1109/lcomm.2020.2967134","title":"IEEE Communications Society","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network; Computer security","score_opus":0.06609773803155293,"score_gpt":0.297207646891981,"score_spread":0.23110990886042804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235101927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021311152,0.00034680046,0.5286612,0.4667363,0.000180018,0.00017249491,0.000005420714,0.00051927345,0.0012474088],"genre_scores_gemma":[0.48325014,0.0007542224,0.47795877,0.03778306,0.00005810252,0.00010133889,0.000042407886,0.000013712783,0.00003826304],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988669,0.0001700632,0.000301772,0.0002858527,0.00016450725,0.00021087343],"domain_scores_gemma":[0.9946011,0.00031626475,0.00014789542,0.00470234,0.00012870318,0.00010374468],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00019899661,0.00014093287,0.00013763981,0.00006255639,0.00071720843,0.000108169384,0.0074973283,0.00010208264,0.000009636846],"category_scores_gemma":[0.00005729969,0.00015916151,0.000120651624,0.00089553464,0.00045494898,0.0005578006,0.00073572627,0.000490541,0.00024231746],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063761204,0.00067530654,0.0025162918,0.000040992087,0.00026671594,0.0000017493502,0.014668743,0.004435474,0.055635683,0.4131128,0.4919516,0.016688282],"study_design_scores_gemma":[0.0008162508,0.00007286496,0.001680603,0.000048391725,0.000060973845,0.000024226063,0.0005006077,0.6829562,0.0066529387,0.004102209,0.3021613,0.00092342554],"about_ca_topic_score_codex":0.000013262329,"about_ca_topic_score_gemma":0.000008264435,"teacher_disagreement_score":0.67852074,"about_ca_system_score_codex":0.00006616846,"about_ca_system_score_gemma":0.00009491583,"threshold_uncertainty_score":0.9978726},"labels":[],"label_agreement":null},{"id":"W4235573252","doi":"10.1109/lcomm.2020.2988113","title":"IEEE Communications Letters Publication Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05797539128489154,"score_gpt":0.27898466830002394,"score_spread":0.2210092770151324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235573252","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007189346,0.00013607834,0.41478828,0.57438135,0.00047876927,0.00040560172,0.000013947456,0.00094824284,0.0016583728],"genre_scores_gemma":[0.8627619,0.00015009892,0.06914053,0.06727743,0.00008997263,0.00036952086,0.00017043989,0.000016263008,0.000023831486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979259,0.0003626707,0.0007550055,0.00030880232,0.00030384914,0.00034380623],"domain_scores_gemma":[0.99167436,0.00028091646,0.00046646365,0.007094466,0.0002953531,0.00018842754],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046989377,0.00022236077,0.0002274718,0.00035461018,0.0008151506,0.00046549202,0.009567253,0.00013528082,0.000013156967],"category_scores_gemma":[0.00019103786,0.0002498703,0.00011138767,0.0015824543,0.0004259127,0.0032424782,0.00074856635,0.0006019305,0.0016384905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009592869,0.000267503,0.0024921463,0.00006166526,0.00015682935,8.9491124e-7,0.017498834,0.0003136759,0.06917057,0.12137197,0.75064063,0.0380157],"study_design_scores_gemma":[0.0006668667,0.00004110721,0.002682547,0.000042017065,0.000033159202,0.000034665514,0.0005192517,0.044455662,0.0037137216,0.0002699236,0.9468413,0.00069979863],"about_ca_topic_score_codex":0.00006878373,"about_ca_topic_score_gemma":0.000013131693,"teacher_disagreement_score":0.8555726,"about_ca_system_score_codex":0.00014316535,"about_ca_system_score_gemma":0.00011282951,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W4236046495","doi":"10.1109/lcomm.2021.3080064","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236046495","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4236056725","doi":"10.1109/lcomm.2005.1411006","title":"A simple, intuitive expression for the BER of a jointly optimal single cochannel interferer BPSK receiver","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Phase-shift keying; Additive white Gaussian noise; Interference (communication); Computer science; Bit error rate; Algorithm; Expression (computer science); Keying; Binary number; Telecommunications; Mathematics; Electronic engineering; White noise; Decoding methods; Engineering","score_opus":0.03602808058808123,"score_gpt":0.2824834797602303,"score_spread":0.2464553991721491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236056725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056552716,0.0012148807,0.9329389,0.006889932,0.000093550705,0.0008644381,0.0000712034,0.0005037227,0.0008706938],"genre_scores_gemma":[0.895842,0.0005081832,0.10236143,0.00060961756,0.000043274304,0.0005231763,0.00003657659,0.00004996079,0.000025749961],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990697,0.00008936109,0.00040390113,0.000129615,0.00010777443,0.00019968579],"domain_scores_gemma":[0.99652576,0.0008514453,0.00012437337,0.0023201609,0.00014141717,0.00003681853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018516886,0.00016920386,0.0001974577,0.0001181135,0.00020306953,0.000025254243,0.0015394633,0.00007028601,0.000020505084],"category_scores_gemma":[0.00006244014,0.00014874198,0.00011010196,0.0001891811,0.0002927065,0.0002797444,0.00025485197,0.00031437213,0.0000099583895],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002882821,0.0001494065,0.000024114845,0.00003645292,0.000098462624,8.591774e-8,0.0035719718,0.06749708,0.86987585,0.00079043006,0.028763514,0.0291638],"study_design_scores_gemma":[0.00056753546,0.00006562959,0.00017846942,0.00022853883,0.000048773527,0.0000036452607,0.00075158855,0.106708474,0.80034286,0.00033339855,0.09038264,0.00038842394],"about_ca_topic_score_codex":0.000010000272,"about_ca_topic_score_gemma":0.000029005181,"teacher_disagreement_score":0.8392893,"about_ca_system_score_codex":0.00014088185,"about_ca_system_score_gemma":0.000009016747,"threshold_uncertainty_score":0.6065522},"labels":[],"label_agreement":null},{"id":"W4236460812","doi":"10.1109/lcomm.2019.2928735","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; University of Science and Technology Beijing; Tarbiat Modares University; Universidad Carlos III de Madrid; University of Akron; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Qatar University; Indian Institute of Technology Delhi; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; Indian Institute of Technology Indore; Santa Clara University; Deakin University; University of Macedonia; Heriot-Watt University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236460812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4236625792","doi":"10.1109/lcomm.2016.2534118","title":"IEEE Communications Society","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Human auditory perception and evaluation","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.0758155415984171,"score_gpt":0.30357692817070564,"score_spread":0.22776138657228856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236625792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52912545,0.0012450417,0.26596418,0.15360467,0.0044868174,0.0014033171,0.00017938478,0.0052070795,0.038784035],"genre_scores_gemma":[0.982588,0.0023720958,0.011647824,0.0022230218,0.00022424928,0.00017533042,0.000040439198,0.000054175744,0.0006748841],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990285,0.00014316468,0.00030413945,0.00013344573,0.00017254957,0.0002181719],"domain_scores_gemma":[0.99594176,0.00023105451,0.00005198674,0.0036279187,0.000068947964,0.00007831032],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029094066,0.0001499448,0.00012772251,0.0000777313,0.00038423025,0.000044924825,0.0015482208,0.000077886136,0.0010279642],"category_scores_gemma":[0.000016176848,0.00013262915,0.0001356773,0.00018497472,0.00037756853,0.000286204,0.00009723876,0.0002201982,0.006332271],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010031503,0.00003958064,0.00015675194,0.000009714487,0.00005503841,8.9973426e-8,0.0009564518,0.0005396507,0.46137044,0.000114343144,0.5255733,0.011183629],"study_design_scores_gemma":[0.0010325062,0.00001763738,0.005897039,0.00013193663,0.00007350571,0.0000081052485,0.00025405543,0.039932054,0.004327871,0.00027175614,0.9473487,0.00070484827],"about_ca_topic_score_codex":0.000002100365,"about_ca_topic_score_gemma":0.00005064502,"teacher_disagreement_score":0.45704257,"about_ca_system_score_codex":0.00024308915,"about_ca_system_score_gemma":0.000017914175,"threshold_uncertainty_score":0.99988526},"labels":[],"label_agreement":null},{"id":"W4240360174","doi":"10.1109/lcomm.2005.1375227","title":"Parity bit selected spreading sequences: a block coding approach to spread spectrum","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Algorithm; Parity bit; Computer science; Spread spectrum; Matched filter; Sequence (biology); Coding (social sciences); Coding gain; Error detection and correction; Mathematics; Theoretical computer science; Decoding methods; Telecommunications; Code division multiple access; Statistics; Detector","score_opus":0.055528098605555104,"score_gpt":0.30166751898239097,"score_spread":0.24613942037683587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240360174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047638386,0.00046597957,0.78328377,0.15245698,0.0001742101,0.0011143519,0.000009131133,0.0010965853,0.013760596],"genre_scores_gemma":[0.7442686,0.00021237732,0.25227758,0.0027734577,0.000107602486,0.00021383741,0.000018202638,0.000025844014,0.00010253455],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966344,0.00082268653,0.00056759705,0.00061509956,0.0005734877,0.00078668504],"domain_scores_gemma":[0.99115014,0.00072864466,0.00017898026,0.0074011018,0.00021453889,0.00032657196],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010213958,0.0002859019,0.0003138264,0.0004866082,0.00094930123,0.0005901964,0.01123709,0.00011398047,0.0000074469262],"category_scores_gemma":[0.00014668658,0.00031239277,0.000101427104,0.0031276583,0.00027437555,0.00088321016,0.0020440777,0.0009986871,0.00031721688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058042333,0.0031663026,0.0073735276,0.00014262335,0.00060199125,0.000014712727,0.02058309,0.230793,0.2636675,0.22891901,0.15993968,0.08474052],"study_design_scores_gemma":[0.00055292377,0.000049063627,0.0027689096,0.00014816485,0.000019677193,0.00008617183,0.00008915432,0.92041737,0.009323125,0.0002636601,0.06537601,0.00090576574],"about_ca_topic_score_codex":0.0002621275,"about_ca_topic_score_gemma":0.00026807623,"teacher_disagreement_score":0.6966302,"about_ca_system_score_codex":0.0004991178,"about_ca_system_score_gemma":0.00015799132,"threshold_uncertainty_score":0.9999328},"labels":[],"label_agreement":null},{"id":"W4240757515","doi":"10.1109/lcomm.2005.1411012","title":"Maximum likelihood estimation of local average SNR in Ricean fading channels","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Rician fading; Fading; Mean squared error; Mathematics; Statistics; Minimum-variance unbiased estimator; Bias of an estimator; Efficient estimator; Estimation theory; Probability density function; Applied mathematics; Signal-to-noise ratio (imaging); Minimax estimator; Maximum likelihood; Maximum likelihood sequence estimation","score_opus":0.01542057146745428,"score_gpt":0.2597697651700511,"score_spread":0.24434919370259683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240757515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089637086,0.0005885778,0.90485746,0.0028255526,0.00009145234,0.00027666768,0.000006450052,0.00052512233,0.0011916093],"genre_scores_gemma":[0.8904389,0.0006075651,0.10850593,0.000254248,0.000018349676,0.00009763843,0.00003386848,0.000038766648,0.000004716336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892974,0.0000955521,0.00049397204,0.000121764184,0.00013003069,0.0002289478],"domain_scores_gemma":[0.99765706,0.00019278015,0.00010012428,0.0019660078,0.00003833211,0.000045686556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022818315,0.00015840877,0.00020782842,0.00033390138,0.000083134866,0.000018452418,0.0011942753,0.00007695238,0.000010738348],"category_scores_gemma":[0.00001625723,0.00019827111,0.000054757365,0.00044334622,0.00015473172,0.00041355618,0.00013936733,0.0003871067,0.00003097027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002259621,0.00006315721,0.000060677397,0.000026056256,0.0000145988215,4.0593287e-7,0.0008652845,0.8582007,0.02479203,0.0004360401,0.00059672014,0.11494202],"study_design_scores_gemma":[0.00034522766,0.000012009068,0.00031036464,0.0001679217,0.000009235378,0.0000049552546,0.00010334062,0.91055727,0.08317339,0.0010289511,0.0039857123,0.00030164354],"about_ca_topic_score_codex":0.000030381168,"about_ca_topic_score_gemma":0.00007848862,"teacher_disagreement_score":0.8008018,"about_ca_system_score_codex":0.00026890912,"about_ca_system_score_gemma":0.0000107355845,"threshold_uncertainty_score":0.80852616},"labels":[],"label_agreement":null},{"id":"W4241254295","doi":"10.1109/lcomm.2019.2917103","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Tarbiat Modares University; University of Akron; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Universidad Carlos III de Madrid; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Qatar University; Indian Institute of Technology Delhi; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; University of Ottawa; Indian Institute of Technology Indore; Santa Clara University; Deakin University; University of Macedonia; Heriot-Watt University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241254295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4242576998","doi":"10.1109/lcomm.2014.2366592","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.06302226251916647,"score_gpt":0.23385820484832695,"score_spread":0.1708359423291605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242576998","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02293461,0.0012570629,0.056192942,0.064366944,0.004444189,0.00069568295,0.0007732775,0.00040761085,0.8489277],"genre_scores_gemma":[0.94973606,0.0019332969,0.026457243,0.014728801,0.000119040444,0.00016778658,0.00018368816,0.000026209142,0.006647864],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988896,0.000039056205,0.0006034441,0.0001908683,0.00003524078,0.00024176884],"domain_scores_gemma":[0.9960307,0.00016519695,0.0003644102,0.0033296272,0.00004768503,0.0000623982],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008111955,0.00013234538,0.00024772173,0.0001417514,0.00070991984,0.00017308077,0.001962977,0.000061008624,0.0002648062],"category_scores_gemma":[0.000061157596,0.00016525446,0.00017924352,0.0002487438,0.0004968596,0.0007983081,0.00034263564,0.00021223385,0.015535557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022742329,0.000083461986,0.0023463909,0.000015218834,0.00012516613,2.4950651e-8,0.0035404232,0.00023031917,0.0001291775,0.16548494,0.82601446,0.0020281759],"study_design_scores_gemma":[0.0003129001,0.000007126731,0.00091719435,0.000008389996,0.000008985407,9.0851967e-7,0.00036775795,0.016442565,0.000027479275,0.0014022685,0.9802881,0.00021633421],"about_ca_topic_score_codex":0.00017200007,"about_ca_topic_score_gemma":0.000022718885,"teacher_disagreement_score":0.92680144,"about_ca_system_score_codex":0.00012684891,"about_ca_system_score_gemma":0.000010272432,"threshold_uncertainty_score":0.985231},"labels":[],"label_agreement":null},{"id":"W4242579053","doi":"10.1109/lcomm.2019.2948542","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; University of Science and Technology Beijing; Tarbiat Modares University; Universidad Carlos III de Madrid; University of Akron; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Qatar University; Indian Institute of Technology Delhi; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; Indian Institute of Technology Indore; Santa Clara University; Deakin University; University of Macedonia; Heriot-Watt University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242579053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4243196348","doi":"10.1109/lcomm.2020.2981803","title":"IEEE Communications Letters Publication Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05797539128489154,"score_gpt":0.27898466830002394,"score_spread":0.2210092770151324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243196348","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007189346,0.00013607834,0.41478828,0.57438135,0.00047876927,0.00040560172,0.000013947456,0.00094824284,0.0016583728],"genre_scores_gemma":[0.8627619,0.00015009892,0.06914053,0.06727743,0.00008997263,0.00036952086,0.00017043989,0.000016263008,0.000023831486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979259,0.0003626707,0.0007550055,0.00030880232,0.00030384914,0.00034380623],"domain_scores_gemma":[0.99167436,0.00028091646,0.00046646365,0.007094466,0.0002953531,0.00018842754],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046989377,0.00022236077,0.0002274718,0.00035461018,0.0008151506,0.00046549202,0.009567253,0.00013528082,0.000013156967],"category_scores_gemma":[0.00019103786,0.0002498703,0.00011138767,0.0015824543,0.0004259127,0.0032424782,0.00074856635,0.0006019305,0.0016384905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009592869,0.000267503,0.0024921463,0.00006166526,0.00015682935,8.9491124e-7,0.017498834,0.0003136759,0.06917057,0.12137197,0.75064063,0.0380157],"study_design_scores_gemma":[0.0006668667,0.00004110721,0.002682547,0.000042017065,0.000033159202,0.000034665514,0.0005192517,0.044455662,0.0037137216,0.0002699236,0.9468413,0.00069979863],"about_ca_topic_score_codex":0.00006878373,"about_ca_topic_score_gemma":0.000013131693,"teacher_disagreement_score":0.8555726,"about_ca_system_score_codex":0.00014316535,"about_ca_system_score_gemma":0.00011282951,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W4244405389","doi":"10.1109/lcomm.2014.03.cover3","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"Indian Institute of Technology Bombay; King's College London; Universitat Pompeu Fabra; Drexel University; Jackson State University; Arizona State University; George Washington University","keywords":"Computer science; Computer network","score_opus":0.03827669833861502,"score_gpt":0.2926258265940878,"score_spread":0.2543491282554728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244405389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661598,0.00019901372,0.012848773,0.14147368,0.00052449695,0.0005330528,0.00009062828,0.001448069,0.07672251],"genre_scores_gemma":[0.98383445,0.000013996835,0.01151777,0.004171342,0.00007538329,0.000067488756,0.000065124535,0.00006992108,0.00018454637],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986885,0.00043970533,0.00024219968,0.00017799213,0.0001912502,0.00026034474],"domain_scores_gemma":[0.9945015,0.00034520953,0.000116127434,0.00488133,0.000067027366,0.000088831555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045067442,0.00013573497,0.00013841617,0.00014864486,0.00037277286,0.00008226,0.0021314474,0.000039201735,0.00006905045],"category_scores_gemma":[0.00011729809,0.00014793056,0.00007409182,0.00037301116,0.00041765757,0.00018909323,0.00021817854,0.00028622837,0.0054552373],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010099839,0.00032665965,0.0026422008,0.000009194312,0.000058621437,7.542337e-7,0.00083016173,0.00031872137,0.4916554,0.020128783,0.47963455,0.0043848297],"study_design_scores_gemma":[0.0003849516,0.000021156075,0.0015726715,0.000018079229,0.000029651163,0.000006608109,0.00006193783,0.0030237865,0.0026534686,0.0002282205,0.9917187,0.00028075112],"about_ca_topic_score_codex":0.000121674944,"about_ca_topic_score_gemma":0.00023441148,"teacher_disagreement_score":0.5120841,"about_ca_system_score_codex":0.0001099388,"about_ca_system_score_gemma":0.00001589479,"threshold_uncertainty_score":0.9953191},"labels":[],"label_agreement":null},{"id":"W4245402965","doi":"10.1109/lcomm.2014.2386731","title":"IEEE Communications Society Information","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.1341104025353202,"score_gpt":0.25700416201791515,"score_spread":0.12289375948259496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245402965","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027235556,0.0035468026,0.019050391,0.0753973,0.0061009796,0.00085081294,0.0012602664,0.00043999375,0.8661179],"genre_scores_gemma":[0.9248875,0.002742362,0.0417596,0.016631834,0.00016062892,0.00026955176,0.00033261545,0.000038883507,0.013177026],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989119,0.000031093005,0.00059755327,0.00017853537,0.000044217206,0.00023669911],"domain_scores_gemma":[0.99633116,0.000087069224,0.00034718806,0.0030478402,0.00008131226,0.00010542391],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008221199,0.00012966437,0.00023766933,0.00014508811,0.00045936016,0.00017658221,0.0019304706,0.00006078873,0.00014482056],"category_scores_gemma":[0.00006426828,0.00016161945,0.0001517676,0.00029490408,0.0004941019,0.0010280596,0.00039982033,0.00020841847,0.01785507],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025401641,0.000063723426,0.0017636205,0.0000058223827,0.00008928371,6.292389e-8,0.005216248,0.00019937078,0.000028936382,0.04154194,0.9506148,0.00047363722],"study_design_scores_gemma":[0.00045261934,0.000008303786,0.00036956294,0.0000070720903,0.000009348137,0.0000016723972,0.0015683405,0.007293754,0.000020144118,0.001402942,0.98864496,0.0002212612],"about_ca_topic_score_codex":0.00027463923,"about_ca_topic_score_gemma":0.000025352088,"teacher_disagreement_score":0.897652,"about_ca_system_score_codex":0.00023445528,"about_ca_system_score_gemma":0.000029463203,"threshold_uncertainty_score":0.9829096},"labels":[],"label_agreement":null},{"id":"W4245717514","doi":"10.1109/lcomm.2021.3061228","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245717514","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4247845406","doi":"10.1109/lcomm.2019.2912542","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Tarbiat Modares University; Indian Institute of Technology Delhi; University of Akron; South China University of Technology; Qatar University; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Universidad Carlos III de Madrid; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; University of Oxford; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; University of Ottawa; Deakin University; University of Macedonia; Heriot-Watt University; Santa Clara University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247845406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4248316238","doi":"10.1109/lcomm.2019.2953405","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; University of Science and Technology Beijing; Tarbiat Modares University; Universidad Carlos III de Madrid; University of Akron; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Qatar University; Indian Institute of Technology Delhi; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; Indian Institute of Technology Indore; Santa Clara University; Deakin University; University of Macedonia; Heriot-Watt University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248316238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4248811861","doi":"10.1109/lcomm.2020.2973486","title":"IEEE Communications Society","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.06609773803155293,"score_gpt":0.297207646891981,"score_spread":0.23110990886042804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248811861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021311152,0.00034680046,0.5286612,0.4667363,0.000180018,0.00017249491,0.000005420714,0.00051927345,0.0012474088],"genre_scores_gemma":[0.48325014,0.0007542224,0.47795877,0.03778306,0.00005810252,0.00010133889,0.000042407886,0.000013712783,0.00003826304],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988669,0.0001700632,0.000301772,0.0002858527,0.00016450725,0.00021087343],"domain_scores_gemma":[0.9946011,0.00031626475,0.00014789542,0.00470234,0.00012870318,0.00010374468],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00019899661,0.00014093287,0.00013763981,0.00006255639,0.00071720843,0.000108169384,0.0074973283,0.00010208264,0.000009636846],"category_scores_gemma":[0.00005729969,0.00015916151,0.000120651624,0.00089553464,0.00045494898,0.0005578006,0.00073572627,0.000490541,0.00024231746],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063761204,0.00067530654,0.0025162918,0.000040992087,0.00026671594,0.0000017493502,0.014668743,0.004435474,0.055635683,0.4131128,0.4919516,0.016688282],"study_design_scores_gemma":[0.0008162508,0.00007286496,0.001680603,0.000048391725,0.000060973845,0.000024226063,0.0005006077,0.6829562,0.0066529387,0.004102209,0.3021613,0.00092342554],"about_ca_topic_score_codex":0.000013262329,"about_ca_topic_score_gemma":0.000008264435,"teacher_disagreement_score":0.67852074,"about_ca_system_score_codex":0.00006616846,"about_ca_system_score_gemma":0.00009491583,"threshold_uncertainty_score":0.9978726},"labels":[],"label_agreement":null},{"id":"W4250740642","doi":"10.1109/lcomm.2006.1673010","title":"On the capacity of indoor optical wireless communications","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Pulse-position modulation; Multipath propagation; Channel capacity; Modulation (music); Pulse-amplitude modulation; Optical wireless communications; Wireless; Telecommunications; Position (finance); Amplitude modulation; Optical communication; Computer science; Optical wireless; Dispersion (optics); Pulse (music); Electronic engineering; Physics; Channel (broadcasting); Optics; Radio frequency; Frequency modulation; Acoustics; Engineering; Business","score_opus":0.033707985786346276,"score_gpt":0.23886432775426267,"score_spread":0.20515634196791638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250740642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91272193,0.00063357124,0.008116356,0.0555001,0.000118251184,0.00048191915,0.000044926244,0.0010225372,0.02136042],"genre_scores_gemma":[0.98386174,0.0005855559,0.014793475,0.00044953165,0.00001365826,0.00021569128,0.000028481883,0.000039469684,0.000012411399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865925,0.00019319505,0.00053289084,0.00013298099,0.00022306023,0.00025860165],"domain_scores_gemma":[0.98909575,0.0022178085,0.00010501748,0.008448173,0.00009678611,0.000036482994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003064182,0.00020128126,0.00024415372,0.000157357,0.00034906456,0.00004700027,0.0053348634,0.00012651927,0.000014171931],"category_scores_gemma":[0.0001085393,0.00017083233,0.000112064656,0.0005551931,0.0017981557,0.000115107425,0.0005105834,0.00084174017,0.00009099476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044624267,0.00030267474,0.00034740966,0.00002290672,0.00007425373,2.8726475e-7,0.00014529025,0.0024965256,0.122198954,0.8595314,0.010980217,0.0038956155],"study_design_scores_gemma":[0.0019753021,0.00018279161,0.019096037,0.00065423606,0.00020907186,0.000031197236,0.0011125389,0.3145529,0.55609775,0.046894863,0.05668953,0.00250378],"about_ca_topic_score_codex":0.00007556153,"about_ca_topic_score_gemma":0.00011131637,"teacher_disagreement_score":0.81263655,"about_ca_system_score_codex":0.00011553154,"about_ca_system_score_gemma":0.000013898177,"threshold_uncertainty_score":0.99135923},"labels":[],"label_agreement":null},{"id":"W4251390688","doi":"10.1109/lcomm.2020.3031700","title":"IEEE Communications Letters Publication Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; South China University of Technology; University of Akron; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network; Information retrieval","score_opus":0.05797539128489154,"score_gpt":0.27898466830002394,"score_spread":0.2210092770151324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251390688","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007189346,0.00013607834,0.41478828,0.57438135,0.00047876927,0.00040560172,0.000013947456,0.00094824284,0.0016583728],"genre_scores_gemma":[0.8627619,0.00015009892,0.06914053,0.06727743,0.00008997263,0.00036952086,0.00017043989,0.000016263008,0.000023831486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979259,0.0003626707,0.0007550055,0.00030880232,0.00030384914,0.00034380623],"domain_scores_gemma":[0.99167436,0.00028091646,0.00046646365,0.007094466,0.0002953531,0.00018842754],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046989377,0.00022236077,0.0002274718,0.00035461018,0.0008151506,0.00046549202,0.009567253,0.00013528082,0.000013156967],"category_scores_gemma":[0.00019103786,0.0002498703,0.00011138767,0.0015824543,0.0004259127,0.0032424782,0.00074856635,0.0006019305,0.0016384905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009592869,0.000267503,0.0024921463,0.00006166526,0.00015682935,8.9491124e-7,0.017498834,0.0003136759,0.06917057,0.12137197,0.75064063,0.0380157],"study_design_scores_gemma":[0.0006668667,0.00004110721,0.002682547,0.000042017065,0.000033159202,0.000034665514,0.0005192517,0.044455662,0.0037137216,0.0002699236,0.9468413,0.00069979863],"about_ca_topic_score_codex":0.00006878373,"about_ca_topic_score_gemma":0.000013131693,"teacher_disagreement_score":0.8555726,"about_ca_system_score_codex":0.00014316535,"about_ca_system_score_gemma":0.00011282951,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W4252372790","doi":"10.1109/lcomm.2016.2520242","title":"IEEE Communications Society","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Human auditory perception and evaluation","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0758155415984171,"score_gpt":0.30357692817070564,"score_spread":0.22776138657228856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252372790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52912545,0.0012450417,0.26596418,0.15360467,0.0044868174,0.0014033171,0.00017938478,0.0052070795,0.038784035],"genre_scores_gemma":[0.982588,0.0023720958,0.011647824,0.0022230218,0.00022424928,0.00017533042,0.000040439198,0.000054175744,0.0006748841],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990285,0.00014316468,0.00030413945,0.00013344573,0.00017254957,0.0002181719],"domain_scores_gemma":[0.99594176,0.00023105451,0.00005198674,0.0036279187,0.000068947964,0.00007831032],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029094066,0.0001499448,0.00012772251,0.0000777313,0.00038423025,0.000044924825,0.0015482208,0.000077886136,0.0010279642],"category_scores_gemma":[0.000016176848,0.00013262915,0.0001356773,0.00018497472,0.00037756853,0.000286204,0.00009723876,0.0002201982,0.006332271],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010031503,0.00003958064,0.00015675194,0.000009714487,0.00005503841,8.9973426e-8,0.0009564518,0.0005396507,0.46137044,0.000114343144,0.5255733,0.011183629],"study_design_scores_gemma":[0.0010325062,0.00001763738,0.005897039,0.00013193663,0.00007350571,0.0000081052485,0.00025405543,0.039932054,0.004327871,0.00027175614,0.9473487,0.00070484827],"about_ca_topic_score_codex":0.000002100365,"about_ca_topic_score_gemma":0.00005064502,"teacher_disagreement_score":0.45704257,"about_ca_system_score_codex":0.00024308915,"about_ca_system_score_gemma":0.000017914175,"threshold_uncertainty_score":0.99988526},"labels":[],"label_agreement":null},{"id":"W4252522116","doi":"10.1109/lcomm.2020.3011234","title":"IEEE Communications Letters Publication Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05797539128489154,"score_gpt":0.27898466830002394,"score_spread":0.2210092770151324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252522116","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007189346,0.00013607834,0.41478828,0.57438135,0.00047876927,0.00040560172,0.000013947456,0.00094824284,0.0016583728],"genre_scores_gemma":[0.8627619,0.00015009892,0.06914053,0.06727743,0.00008997263,0.00036952086,0.00017043989,0.000016263008,0.000023831486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979259,0.0003626707,0.0007550055,0.00030880232,0.00030384914,0.00034380623],"domain_scores_gemma":[0.99167436,0.00028091646,0.00046646365,0.007094466,0.0002953531,0.00018842754],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046989377,0.00022236077,0.0002274718,0.00035461018,0.0008151506,0.00046549202,0.009567253,0.00013528082,0.000013156967],"category_scores_gemma":[0.00019103786,0.0002498703,0.00011138767,0.0015824543,0.0004259127,0.0032424782,0.00074856635,0.0006019305,0.0016384905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009592869,0.000267503,0.0024921463,0.00006166526,0.00015682935,8.9491124e-7,0.017498834,0.0003136759,0.06917057,0.12137197,0.75064063,0.0380157],"study_design_scores_gemma":[0.0006668667,0.00004110721,0.002682547,0.000042017065,0.000033159202,0.000034665514,0.0005192517,0.044455662,0.0037137216,0.0002699236,0.9468413,0.00069979863],"about_ca_topic_score_codex":0.00006878373,"about_ca_topic_score_gemma":0.000013131693,"teacher_disagreement_score":0.8555726,"about_ca_system_score_codex":0.00014316535,"about_ca_system_score_gemma":0.00011282951,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W4253567781","doi":"10.1109/lcomm.2021.3090184","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253567781","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4253999000","doi":"10.1109/lcomm.2005.1411008","title":"Outage and BER of MRC diversity in bandlimited micro-cellular systems with CCI","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Maximal-ratio combining; Rayleigh fading; Phase-shift keying; Fading distribution; Nakagami distribution; Diversity combining; Algorithm; Bandlimiting; Interference (communication); Computer science; Bit error rate; Gaussian; Mathematics; Shadow mapping; Statistics; Telecommunications; Physics; Decoding methods","score_opus":0.02060753652320981,"score_gpt":0.22363323631441787,"score_spread":0.20302569979120805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253999000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9693967,0.0016203236,0.026719693,0.0011481041,0.000021270702,0.0002915674,0.000011310254,0.00026226506,0.00052876864],"genre_scores_gemma":[0.97106785,0.0009270115,0.027817637,0.00008871065,0.0000072325633,0.00003808718,0.000017548822,0.000022091115,0.00001381541],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993567,0.00007896018,0.00024456362,0.000100532205,0.00008858864,0.00013067493],"domain_scores_gemma":[0.9981599,0.00012973606,0.000068245994,0.0015697539,0.00003826829,0.00003411094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001267056,0.000118227596,0.0001877573,0.00017631108,0.00010806198,0.000014689446,0.0007586657,0.00005050342,0.0000025839588],"category_scores_gemma":[0.000004945558,0.00012622481,0.000021220743,0.000227113,0.0001897957,0.00020579943,0.0002723798,0.00024776484,0.0000042504457],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035339865,0.0003296883,0.10477938,0.00029185342,0.00019593099,0.0000050630024,0.0064929607,0.15100506,0.72506005,0.0013926267,0.0018879889,0.008524076],"study_design_scores_gemma":[0.007399394,0.00018776617,0.084094405,0.0021572139,0.00027798524,0.000074446645,0.0023062015,0.392538,0.44011074,0.00023426843,0.0670576,0.0035619456],"about_ca_topic_score_codex":0.00013284839,"about_ca_topic_score_gemma":0.00015719535,"teacher_disagreement_score":0.28494927,"about_ca_system_score_codex":0.0000939616,"about_ca_system_score_gemma":0.000004539577,"threshold_uncertainty_score":0.51472986},"labels":[],"label_agreement":null},{"id":"W4254424594","doi":"10.1109/lcomm.2021.3067250","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254424594","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4254706718","doi":"10.1109/lcomm.2020.3023994","title":"IEEE Communications Letters Publication Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05797539128489154,"score_gpt":0.27898466830002394,"score_spread":0.2210092770151324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254706718","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007189346,0.00013607834,0.41478828,0.57438135,0.00047876927,0.00040560172,0.000013947456,0.00094824284,0.0016583728],"genre_scores_gemma":[0.8627619,0.00015009892,0.06914053,0.06727743,0.00008997263,0.00036952086,0.00017043989,0.000016263008,0.000023831486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979259,0.0003626707,0.0007550055,0.00030880232,0.00030384914,0.00034380623],"domain_scores_gemma":[0.99167436,0.00028091646,0.00046646365,0.007094466,0.0002953531,0.00018842754],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046989377,0.00022236077,0.0002274718,0.00035461018,0.0008151506,0.00046549202,0.009567253,0.00013528082,0.000013156967],"category_scores_gemma":[0.00019103786,0.0002498703,0.00011138767,0.0015824543,0.0004259127,0.0032424782,0.00074856635,0.0006019305,0.0016384905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009592869,0.000267503,0.0024921463,0.00006166526,0.00015682935,8.9491124e-7,0.017498834,0.0003136759,0.06917057,0.12137197,0.75064063,0.0380157],"study_design_scores_gemma":[0.0006668667,0.00004110721,0.002682547,0.000042017065,0.000033159202,0.000034665514,0.0005192517,0.044455662,0.0037137216,0.0002699236,0.9468413,0.00069979863],"about_ca_topic_score_codex":0.00006878373,"about_ca_topic_score_gemma":0.000013131693,"teacher_disagreement_score":0.8555726,"about_ca_system_score_codex":0.00014316535,"about_ca_system_score_gemma":0.00011282951,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W4255480926","doi":"10.1109/twc.2011.09.2016-cl1310-filler","title":"Call for papers: Context-aware networking and communications [future special issue]","year":2013,"lang":"en","type":"paratext","venue":"IEEE Communications Letters","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Context (archaeology); Computer network; Telecommunications; Call control","score_opus":0.04222633249207839,"score_gpt":0.28356853358060213,"score_spread":0.24134220108852375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255480926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024837253,0.026040737,0.60891473,0.19268441,0.017380055,0.0036163158,0.0004995198,0.00039632223,0.15044305],"genre_scores_gemma":[0.07398199,0.17428057,0.3304441,0.12944758,0.09920126,0.0064466586,0.01136768,0.00077517197,0.174055],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99700075,0.00044646708,0.00084593537,0.00073422154,0.00029995258,0.0006726676],"domain_scores_gemma":[0.9889602,0.0013332611,0.00062135584,0.00852108,0.00028447073,0.00027964587],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038174822,0.00059802545,0.00076266367,0.00021504413,0.001462915,0.00077707367,0.008574641,0.0005532526,0.0001909726],"category_scores_gemma":[0.0000062133377,0.000621799,0.0002614942,0.00038315065,0.0007767845,0.00043289794,0.0019802887,0.0013173963,0.0008205625],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046055907,0.000053678476,0.0000042128618,0.000038031416,0.00010478233,0.0000012171865,0.0005827984,0.000016098049,0.000019291012,0.001534646,0.83148307,0.16615756],"study_design_scores_gemma":[0.0004381065,0.000035127876,0.000007777379,0.00023792767,0.00007709428,0.00002151206,0.00013537108,0.07424257,0.0000017126482,0.00010531498,0.924072,0.00062548055],"about_ca_topic_score_codex":0.00012326671,"about_ca_topic_score_gemma":0.00017483061,"teacher_disagreement_score":0.27847067,"about_ca_system_score_codex":0.000146013,"about_ca_system_score_gemma":0.00020809301,"threshold_uncertainty_score":0.99995744},"labels":[],"label_agreement":null},{"id":"W4256170459","doi":"10.1109/lcomm.2019.2900830","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Tarbiat Modares University; Istanbul Teknik Üniversitesi; Indian Institute of Technology Delhi; Universidad Carlos III de Madrid; University of Akron; South China University of Technology; Qatar University; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Kungliga Tekniska Högskolan; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; University of Oxford; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; Beijing Jiaotong University; National Sun Yat-sen University; University of Ottawa; Deakin University; University of Macedonia; Heriot-Watt University; Santa Clara University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256170459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4256228233","doi":"10.1109/lcomm.2016.2621746","title":"Expansion Model for the Controller Placement Problem in Software Defined Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Software-defined networking; Software deployment; Key (lock); Controller (irrigation); Software; Face (sociological concept); Plan (archaeology); Control (management); Network architecture","score_opus":0.036951644617093736,"score_gpt":0.2590996700586773,"score_spread":0.22214802544158355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256228233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083406374,0.0006524086,0.9442289,0.053166304,0.00015489288,0.0007725845,0.0000054276898,0.00016392572,0.000021519027],"genre_scores_gemma":[0.72678494,0.00049593695,0.26290187,0.008284349,0.00005898316,0.0013144393,0.000006150154,0.000024230407,0.00012908745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987123,0.00011826235,0.00035268086,0.0002882767,0.0001577524,0.00037072707],"domain_scores_gemma":[0.99515396,0.0024034209,0.00012891032,0.0021871696,0.00007503764,0.0000514923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054015726,0.00016202405,0.00017724712,0.000081787104,0.0003731809,0.00009223631,0.002560795,0.000066690394,0.0000018909957],"category_scores_gemma":[0.00006419879,0.00009702997,0.00009924177,0.00028578934,0.00011338928,0.0002616605,0.00037686212,0.00016379991,0.000010173423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007684731,0.00018046347,0.0014183464,0.000009347956,0.00006724038,8.435884e-7,0.0008625464,0.776482,0.0014259148,0.017060619,0.069257855,0.13315798],"study_design_scores_gemma":[0.001461743,0.000022561198,0.0003288095,0.00007753766,0.000011042612,0.0000017154193,0.000007429669,0.9922519,0.000019937776,0.0017190569,0.003923474,0.00017483861],"about_ca_topic_score_codex":0.000023818639,"about_ca_topic_score_gemma":0.000095288815,"teacher_disagreement_score":0.7259509,"about_ca_system_score_codex":0.000100774494,"about_ca_system_score_gemma":0.00004529398,"threshold_uncertainty_score":0.4758637},"labels":[],"label_agreement":null},{"id":"W4256426024","doi":"10.1109/lcomm.2006.1576552","title":"Outage probability of MRC with unequal-power cochannel interferers in correlated rayleigh fading","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Maximal-ratio combining; Fading; Interference (communication); Mathematics; Covariance matrix; Outage probability; Fading distribution; Statistics; Correlation; Power (physics); Matrix (chemical analysis); Signal-to-noise ratio (imaging); Algorithm; Telecommunications; Computer science; Physics; Decoding methods","score_opus":0.03170879711192969,"score_gpt":0.2675246557463096,"score_spread":0.23581585863437993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256426024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6822042,0.00030224523,0.29940143,0.014168864,0.00012220175,0.00076258933,0.000006851327,0.00020929426,0.0028223672],"genre_scores_gemma":[0.969151,0.000046453788,0.030343138,0.00023851739,0.0000084685735,0.00012714548,0.00002176142,0.000021574375,0.000041892567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735177,0.0007798152,0.00068316783,0.00038409565,0.00039056252,0.0004106026],"domain_scores_gemma":[0.9930113,0.00083554845,0.0002872796,0.0055615385,0.00023532506,0.000068996276],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009221018,0.00020620292,0.00031718018,0.0003961946,0.00020067228,0.00010906215,0.0054750354,0.00009523014,0.000009599142],"category_scores_gemma":[0.000052959705,0.00019730144,0.00007355933,0.0016096542,0.0005981785,0.0005328561,0.000989124,0.0007315956,0.000020507492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026395902,0.0037642098,0.12686865,0.0001978392,0.00026485516,0.000038233746,0.014303696,0.60310364,0.087214574,0.14684951,0.009088236,0.008042599],"study_design_scores_gemma":[0.0037301914,0.00031339139,0.061578974,0.0009659544,0.00002806835,0.000027942897,0.0004530514,0.9159775,0.009165792,0.0035343445,0.0028374994,0.0013873202],"about_ca_topic_score_codex":0.000751696,"about_ca_topic_score_gemma":0.0008728472,"teacher_disagreement_score":0.31287384,"about_ca_system_score_codex":0.00024679475,"about_ca_system_score_gemma":0.000099612116,"threshold_uncertainty_score":0.9999058},"labels":[],"label_agreement":null},{"id":"W4256561911","doi":"10.1109/lcomm.2019.2936060","title":"IEEE Communications Society","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; University of West Attica; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; University of Science and Technology Beijing; Tarbiat Modares University; Universidad Carlos III de Madrid; University of Akron; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; Utah State University; University of the West of Scotland; Loughborough University; University of Alberta; Universidad de Málaga; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; Indian National Science Academy; Trường Đại học Duy Tân; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università degli Studi di Napoli Parthenope; Università di Bologna; Old Dominion University; Université de Bordeaux; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; University of British Columbia; Villanova University; Qatar University; Indian Institute of Technology Delhi; University of Ontario Institute of Technology; Queen Mary University of London; King Abdullah University of Science and Technology; Pohang University of Science and Technology; University of South Alabama; University of Science and Technology of China; Beijing Jiaotong University; National Sun Yat-sen University; Indian Institute of Technology Indore; Santa Clara University; Deakin University; University of Macedonia; Heriot-Watt University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.033141886674003064,"score_gpt":0.2880036349751675,"score_spread":0.2548617483011644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256561911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05142651,0.00088709954,0.5927881,0.3415751,0.0013977627,0.0007614555,0.0000113288825,0.001141581,0.010011058],"genre_scores_gemma":[0.6059585,0.00065340113,0.38396323,0.008841223,0.00002875209,0.00010785334,0.00004557576,0.000014486901,0.00038696887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988447,0.00016408296,0.00029338765,0.00028651697,0.00017568647,0.00023566953],"domain_scores_gemma":[0.9912286,0.00040814307,0.00015831031,0.008009742,0.00014058324,0.00005465017],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0003295538,0.00014264652,0.00014233124,0.000120743745,0.00053147523,0.00010626713,0.007292466,0.00011912719,0.00002094614],"category_scores_gemma":[0.000021636166,0.0001577969,0.00012411541,0.00073650485,0.0003457772,0.0006483093,0.0006718506,0.0004620948,0.0007257883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004932976,0.0010030211,0.012911002,0.00004274492,0.00027608598,7.326313e-7,0.005644777,0.0046437955,0.06710484,0.7123012,0.18241276,0.013654117],"study_design_scores_gemma":[0.00160667,0.0001040288,0.010295209,0.0001555131,0.00007640604,0.00006858811,0.0006987263,0.58004665,0.008883492,0.0130625535,0.38335243,0.0016497275],"about_ca_topic_score_codex":0.000023258071,"about_ca_topic_score_gemma":0.0000147409955,"teacher_disagreement_score":0.69923866,"about_ca_system_score_codex":0.00010881432,"about_ca_system_score_gemma":0.00009785393,"threshold_uncertainty_score":0.9980786},"labels":[],"label_agreement":null},{"id":"W4281619059","doi":"10.1109/lcomm.2022.3177828","title":"IEEE Communications Society","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Koç Üniversitesi; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Eidgenössische Technische Hochschule Zürich; Jinan University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; China Mobile Research Institute; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Shanghai Educational Development Foundation; Hanyang University; University of Akron; Vrije Universiteit Amsterdam; University of Surrey; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Glasgow; York University; Università di Bologna; Università degli Studi di Napoli Parthenope; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; University of Science and Technology of China; Beijing Jiaotong University; Trường Đại học Bách Khoa Hà Nội; Princeton University; Beijing Institute of Technology; Sun Yat-sen University; Université du Luxembourg; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.044030290110430685,"score_gpt":0.29305345605132105,"score_spread":0.24902316594089036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281619059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903597,0.0010060646,0.5485204,0.43473244,0.0010451078,0.00045333093,0.000028219742,0.00094725384,0.0033635881],"genre_scores_gemma":[0.61256945,0.00045774874,0.37073115,0.015227582,0.000031771735,0.0006055618,0.000098600234,0.000016758946,0.00026134317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986006,0.00035616793,0.0002942193,0.00027260763,0.00024678602,0.0002296365],"domain_scores_gemma":[0.99254686,0.00037574308,0.00017212085,0.006762093,0.00009225708,0.00005092353],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004915119,0.00012713058,0.000119502714,0.0001451832,0.0024293126,0.00008092937,0.009274151,0.000052089577,0.00003324403],"category_scores_gemma":[0.0000224821,0.00015665083,0.00012396474,0.0010600613,0.00039478685,0.0004126836,0.0018196187,0.0006974699,0.00006735524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789567,0.001313058,0.001985665,0.000013441212,0.0001999724,0.0000017270618,0.007672926,0.017579198,0.020011554,0.5194754,0.41948688,0.012255389],"study_design_scores_gemma":[0.00076430215,0.00007873938,0.0017321083,0.00001784746,0.000050258404,0.000102099104,0.0011245214,0.36054036,0.0016328745,0.010611189,0.6224708,0.00087492465],"about_ca_topic_score_codex":0.00003271938,"about_ca_topic_score_gemma":0.000013753008,"teacher_disagreement_score":0.6026659,"about_ca_system_score_codex":0.00022108544,"about_ca_system_score_gemma":0.00013027567,"threshold_uncertainty_score":0.99886936},"labels":[],"label_agreement":null},{"id":"W4285007394","doi":"10.1109/lcomm.2022.3186575","title":"IEEE Communications Society","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Koç Üniversitesi; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Eidgenössische Technische Hochschule Zürich; Jinan University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; China Mobile Research Institute; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Shanghai Educational Development Foundation; Hanyang University; University of Akron; Vrije Universiteit Amsterdam; University of Surrey; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Glasgow; York University; Università di Bologna; Università degli Studi di Napoli Parthenope; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; University of Science and Technology of China; Beijing Jiaotong University; Trường Đại học Bách Khoa Hà Nội; Princeton University; Beijing Institute of Technology; Sun Yat-sen University; Université du Luxembourg; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.044030290110430685,"score_gpt":0.29305345605132105,"score_spread":0.24902316594089036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285007394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903597,0.0010060646,0.5485204,0.43473244,0.0010451078,0.00045333093,0.000028219742,0.00094725384,0.0033635881],"genre_scores_gemma":[0.61256945,0.00045774874,0.37073115,0.015227582,0.000031771735,0.0006055618,0.000098600234,0.000016758946,0.00026134317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986006,0.00035616793,0.0002942193,0.00027260763,0.00024678602,0.0002296365],"domain_scores_gemma":[0.99254686,0.00037574308,0.00017212085,0.006762093,0.00009225708,0.00005092353],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004915119,0.00012713058,0.000119502714,0.0001451832,0.0024293126,0.00008092937,0.009274151,0.000052089577,0.00003324403],"category_scores_gemma":[0.0000224821,0.00015665083,0.00012396474,0.0010600613,0.00039478685,0.0004126836,0.0018196187,0.0006974699,0.00006735524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789567,0.001313058,0.001985665,0.000013441212,0.0001999724,0.0000017270618,0.007672926,0.017579198,0.020011554,0.5194754,0.41948688,0.012255389],"study_design_scores_gemma":[0.00076430215,0.00007873938,0.0017321083,0.00001784746,0.000050258404,0.000102099104,0.0011245214,0.36054036,0.0016328745,0.010611189,0.6224708,0.00087492465],"about_ca_topic_score_codex":0.00003271938,"about_ca_topic_score_gemma":0.000013753008,"teacher_disagreement_score":0.6026659,"about_ca_system_score_codex":0.00022108544,"about_ca_system_score_gemma":0.00013027567,"threshold_uncertainty_score":0.99886936},"labels":[],"label_agreement":null},{"id":"W4285123770","doi":"10.1109/lcomm.2022.3185152","title":"Envelope Distribution of Two Correlated Complex Gaussian Random Variables and Application to the Performance Evaluation of RIS-Assisted Communications","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Rician fading; Fading; Computer science; Phase-shift keying; Rayleigh fading; Channel (broadcasting); Random variable; Statistics; Algorithm; Telecommunications; Channel capacity; Bit error rate; Keying; Additive white Gaussian noise; Communications system; Mathematics; Topology (electrical circuits)","score_opus":0.038874263528038785,"score_gpt":0.2888698742472223,"score_spread":0.24999561071918353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285123770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55272853,0.0028178918,0.4243623,0.015408191,0.00015540485,0.0027248624,0.0004396625,0.0005857805,0.0007773838],"genre_scores_gemma":[0.98397696,0.001081131,0.012484869,0.000116369476,0.0000050005224,0.0014615462,0.00084360945,0.000027031949,0.0000034596292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800146,0.00063257536,0.0006496857,0.00016205384,0.00038293988,0.00017130443],"domain_scores_gemma":[0.9945271,0.0005622739,0.00031412003,0.004308366,0.00025222873,0.000035906003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013204762,0.0001647584,0.00026302366,0.00018093204,0.00083305297,0.00001758222,0.0026321062,0.00004575462,0.0000140380525],"category_scores_gemma":[0.000095887386,0.00016552163,0.000049384864,0.0011270106,0.00051642227,0.00015283878,0.0009468428,0.00047410454,0.0000044603216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028511067,0.00015569241,0.0012621378,0.000037028618,0.00012387584,2.9618084e-8,0.0010559914,0.7845769,0.1099976,0.0042407126,0.0016003479,0.09692119],"study_design_scores_gemma":[0.0012802089,0.000031285006,0.021806886,0.000042105356,0.000111842346,0.000008453104,0.0006725741,0.9581156,0.0043394584,0.00019762665,0.0131613705,0.00023261705],"about_ca_topic_score_codex":0.00009245692,"about_ca_topic_score_gemma":0.000081913524,"teacher_disagreement_score":0.43124846,"about_ca_system_score_codex":0.00028784675,"about_ca_system_score_gemma":0.000041206655,"threshold_uncertainty_score":0.67497766},"labels":[],"label_agreement":null},{"id":"W4285131565","doi":"10.1109/lcomm.2022.3182016","title":"Joint Subcarrier Allocation, Modulation Mode Selection, and Trajectory Design in a UAV-Based OFDMA Network","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Subcarrier; Computer science; Orthogonal frequency-division multiple access; Orthogonal frequency-division multiplexing; Mathematical optimization; Frequency-division multiple access; Transmission (telecommunications); Reliability (semiconductor); Selection (genetic algorithm); Joint (building); Optimization problem; Real-time computing; Computer network; Algorithm; Telecommunications; Engineering; Mathematics","score_opus":0.023946222482395804,"score_gpt":0.22192288699534407,"score_spread":0.19797666451294826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285131565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1901615,0.0004401267,0.80432916,0.00391335,0.000117195676,0.000646497,0.000016301618,0.0002914684,0.000084423045],"genre_scores_gemma":[0.9496609,0.00012449332,0.048080314,0.00057156855,0.000039131548,0.0013435928,0.00012905907,0.000038719143,0.000012200258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989751,0.00022138156,0.00031475796,0.0001729706,0.00013089861,0.0001848898],"domain_scores_gemma":[0.9991139,0.000102374914,0.000062273415,0.0006317063,0.0000487827,0.000040949388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003216727,0.00012909161,0.00012598888,0.00021615622,0.00044631216,0.000037735583,0.0002896206,0.000040797004,0.000032412067],"category_scores_gemma":[0.00000802727,0.00016934489,0.00002992038,0.0008115353,0.000046926296,0.00013857921,0.000042500826,0.00027419382,0.0000026005282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004997031,0.00003588537,0.0013905999,0.000007870882,0.0000138354135,1.208676e-7,0.00029643293,0.97957194,0.014461745,0.00020608817,0.0031730735,0.0008374253],"study_design_scores_gemma":[0.0002906504,0.00001088815,0.006473219,0.000008796191,0.000014521668,0.000002486904,0.0000333595,0.9902358,0.00046036768,0.00012641853,0.0021704657,0.00017299328],"about_ca_topic_score_codex":0.00011902981,"about_ca_topic_score_gemma":0.00019918528,"teacher_disagreement_score":0.75949943,"about_ca_system_score_codex":0.00026687843,"about_ca_system_score_gemma":0.000038210626,"threshold_uncertainty_score":0.6905684},"labels":[],"label_agreement":null},{"id":"W4285181561","doi":"10.1109/lcomm.2022.3173894","title":"Full Duplex Cooperative Rate Splitting Multiple Access for a MISO Broadcast Channel With Two Users","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; Base station; Precoding; Transmitter power output; Relay; Duplex (building); Channel (broadcasting); Power (physics); Computer network; Mathematical optimization; MIMO; Mathematics; Transmitter","score_opus":0.0475041005123558,"score_gpt":0.29286899053769844,"score_spread":0.24536489002534265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285181561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4574032,0.0009478425,0.52543736,0.0117902765,0.00021956554,0.001669713,0.0002448511,0.002112599,0.00017460148],"genre_scores_gemma":[0.9526751,0.0002683391,0.042717304,0.0008419793,0.000019920008,0.0031698414,0.0001831698,0.000094453004,0.000029884168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868953,0.00017236896,0.00036526687,0.00026136666,0.00014311472,0.00036834704],"domain_scores_gemma":[0.9959612,0.0008396148,0.00014593785,0.0029020626,0.000108349384,0.00004284862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028204804,0.00025469298,0.00025679465,0.0002299144,0.0011744612,0.000105874635,0.0031516193,0.000038204533,0.000014766728],"category_scores_gemma":[0.00009244135,0.00027984413,0.000070290946,0.0006874208,0.00028560573,0.00042993267,0.00080119283,0.0006365812,0.000007388401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051546955,0.000052824034,0.0001319741,0.000024932282,0.00008894903,0.0000010722246,0.0007360589,0.9426582,0.05097505,0.00043046058,0.0018086155,0.0030403177],"study_design_scores_gemma":[0.0023378707,0.00012572801,0.00017951417,0.00005971178,0.000036420195,0.000021904645,0.002692716,0.930425,0.01775779,0.0001237554,0.0454338,0.00080582796],"about_ca_topic_score_codex":0.00003821396,"about_ca_topic_score_gemma":0.00012601624,"teacher_disagreement_score":0.4952719,"about_ca_system_score_codex":0.00028188343,"about_ca_system_score_gemma":0.000029031311,"threshold_uncertainty_score":0.99996537},"labels":[],"label_agreement":null},{"id":"W4285217709","doi":"10.1109/lcomm.2022.3175206","title":"Recursive Approximation of Bitwise LLRs for Gray-Coded Generalized PAM and QAM","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea","keywords":"Quadrature amplitude modulation; Additive white Gaussian noise; QAM; Decoding methods; Mathematics; Algorithm; Bitwise operation; Discrete mathematics; White noise; Applied mathematics; Computer science; Bit error rate; Statistics","score_opus":0.025769338058931626,"score_gpt":0.2687005619952411,"score_spread":0.2429312239363095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285217709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37432015,0.0031347384,0.6088188,0.00942783,0.00023283064,0.0021145744,0.00027791076,0.0011194454,0.00055365614],"genre_scores_gemma":[0.79315794,0.00088722334,0.20388466,0.000331023,0.000009234971,0.0015032502,0.00017455591,0.00004023191,0.000011891297],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912816,0.00015061958,0.000341662,0.00012217902,0.000115628754,0.00014175518],"domain_scores_gemma":[0.99779356,0.00027529022,0.00013772302,0.0016951138,0.00006467872,0.00003363377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023200615,0.00012564141,0.00019241397,0.00018975929,0.0003095944,0.000013736264,0.00091482705,0.00003311034,0.000006634043],"category_scores_gemma":[0.000028883698,0.00015585146,0.00006198698,0.00027675112,0.00015627957,0.00014820103,0.00022267895,0.0002279602,7.2583435e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051163537,0.0001836119,0.00016980122,0.0001853225,0.00015182857,3.1876777e-7,0.0035231418,0.07228491,0.8546186,0.027885854,0.016427467,0.024517989],"study_design_scores_gemma":[0.003882499,0.00024988648,0.0006865499,0.00015020485,0.00019835812,0.000031464304,0.0017227767,0.46443743,0.32684407,0.0204052,0.17975903,0.0016325536],"about_ca_topic_score_codex":0.000017586299,"about_ca_topic_score_gemma":0.000009435679,"teacher_disagreement_score":0.5277745,"about_ca_system_score_codex":0.00011753871,"about_ca_system_score_gemma":0.000010353612,"threshold_uncertainty_score":0.6355438},"labels":[],"label_agreement":null},{"id":"W4285249872","doi":"10.1109/lcomm.2022.3182691","title":"Few-Shot Learning UAV Recognition Methods Based on the Tri-Residual Semantic Network","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Measurement and Detection Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Residual; Benchmark (surveying); Artificial intelligence; Noise (video); Feature (linguistics); Shot (pellet); Interference (communication); Feature extraction; Machine learning; Deep learning; Pattern recognition (psychology); Speech recognition; Channel (broadcasting); Telecommunications; Image (mathematics); Algorithm","score_opus":0.13057723385740044,"score_gpt":0.3373310623014214,"score_spread":0.20675382844402096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285249872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016098635,0.00048151193,0.96452916,0.009760131,0.0012076613,0.0005293762,0.000008379665,0.00079640455,0.006588745],"genre_scores_gemma":[0.7251454,0.00009767686,0.26874304,0.004820913,0.00023628822,0.0007120123,0.000069234826,0.00008090814,0.00009455933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971651,0.00198247,0.00024593255,0.00014334256,0.00022892265,0.00023425296],"domain_scores_gemma":[0.9972216,0.001612978,0.00007451326,0.001023154,0.00003131444,0.000036439294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021386384,0.00014336777,0.00013751085,0.00012113266,0.0012034398,0.000039395127,0.00057934143,0.000030238332,0.00017509525],"category_scores_gemma":[0.00014892253,0.00013795505,0.0000858411,0.0005701134,0.000064294276,0.0000694693,0.0000747252,0.00096471066,0.00002735993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016357417,0.000021203978,0.00005462148,0.00000687168,0.000030497138,5.7269045e-7,0.00013836479,0.93225694,0.034472223,0.0000496305,0.005856625,0.02709607],"study_design_scores_gemma":[0.0008065754,0.00013149364,0.00042318937,0.00006135958,0.00012102783,0.0000095358555,0.0005293789,0.74233586,0.017519861,0.0012214882,0.23620062,0.0006396361],"about_ca_topic_score_codex":0.0000058837645,"about_ca_topic_score_gemma":0.0000060224625,"teacher_disagreement_score":0.7090467,"about_ca_system_score_codex":0.00014803205,"about_ca_system_score_gemma":0.000012905239,"threshold_uncertainty_score":0.92560077},"labels":[],"label_agreement":null},{"id":"W4285257067","doi":"10.1109/lcomm.2022.3174774","title":"On the Capacity of Gaussian MIMO Channels With Memory","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"MIMO; Channel capacity; Channel (broadcasting); Covariance matrix; Topology (electrical circuits); Computer science; Spectral density; Mathematics; Telecommunications; Gaussian; Transmission (telecommunications); Mathematical optimization; Algorithm; Combinatorics","score_opus":0.025698013773248932,"score_gpt":0.22059500178635555,"score_spread":0.19489698801310662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285257067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62978184,0.00038245766,0.3277927,0.025198493,0.00096939283,0.0015847784,0.000117857344,0.000637393,0.01353507],"genre_scores_gemma":[0.99577403,0.000013207989,0.0033272284,0.0005481265,0.000014477417,0.00024902838,0.00001278133,0.000027049655,0.000034086293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.0001319025,0.00015458064,0.00007401268,0.00011687596,0.00010649811],"domain_scores_gemma":[0.9983103,0.00018830266,0.000063042244,0.0013995332,0.000019979558,0.000018839555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014973381,0.00008534123,0.00009638651,0.00007348596,0.00026889463,0.000008533916,0.00067406154,0.00001319197,0.000031218675],"category_scores_gemma":[0.0000103348,0.0000698075,0.000027382745,0.00027060826,0.000103732964,0.00006249834,0.000059372942,0.00025693557,0.000006328215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036047093,0.000020458103,0.000013180011,0.000010243085,0.000027470705,3.2060933e-7,0.0009928071,0.9795914,0.014307292,0.0016740185,0.003272078,0.0000870788],"study_design_scores_gemma":[0.0027916413,0.00045923257,0.00056378404,0.000429841,0.00018522023,0.00012615713,0.00765982,0.8602925,0.088880934,0.0013393306,0.03524315,0.0020284017],"about_ca_topic_score_codex":0.000027971453,"about_ca_topic_score_gemma":0.000016458935,"teacher_disagreement_score":0.36599216,"about_ca_system_score_codex":0.000099727695,"about_ca_system_score_gemma":0.000006765069,"threshold_uncertainty_score":0.28466672},"labels":[],"label_agreement":null},{"id":"W4285264033","doi":"10.1109/lcomm.2022.3186795","title":"Hybrid Multiple Access Transmission in Satellite-Aerial-Terrestrial Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications link; Computer science; Space-division multiple access; Computer network; Single antenna interference cancellation; Satellite; Transmission (telecommunications); Communications satellite; Monte Carlo method; Interference (communication); Random access; Scheme (mathematics); Real-time computing; Telecommunications; Engineering; Mathematics; Channel (broadcasting)","score_opus":0.051144251492994765,"score_gpt":0.27750972719198913,"score_spread":0.22636547569899437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285264033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89997077,0.0290513,0.045064528,0.010378773,0.005267204,0.0029984876,0.000100938465,0.002113575,0.0050544115],"genre_scores_gemma":[0.99314755,0.004047887,0.0012682116,0.00048940803,0.00009983091,0.00060122146,0.00025774032,0.00007280179,0.000015365873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977569,0.0007481444,0.0006787874,0.00022228347,0.0002486924,0.00034520827],"domain_scores_gemma":[0.99618006,0.00063384796,0.00009784844,0.0029840518,0.000017174078,0.00008700566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005862494,0.00021760087,0.00027441184,0.0003123989,0.00038869213,0.00012676936,0.0035526243,0.000049295468,0.00007432002],"category_scores_gemma":[0.00001640799,0.00026996317,0.00010621468,0.0006213474,0.00009724316,0.00029941057,0.0004510647,0.0007889572,0.00002368537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008891287,0.0002139374,0.00555046,0.000037646125,0.00008460254,0.00001394716,0.0015778579,0.86791795,0.042081114,0.000067661866,0.006516738,0.07584918],"study_design_scores_gemma":[0.00149864,0.000016617367,0.0032324612,0.000056361503,0.000017541506,0.000026501744,0.00013701577,0.3687889,0.0010722461,0.000038282753,0.6245947,0.00052073365],"about_ca_topic_score_codex":0.00020855544,"about_ca_topic_score_gemma":0.000076670134,"teacher_disagreement_score":0.618078,"about_ca_system_score_codex":0.00034955188,"about_ca_system_score_gemma":0.00002429033,"threshold_uncertainty_score":0.99997526},"labels":[],"label_agreement":null},{"id":"W4285741182","doi":"10.1109/lcomm.2022.3191706","title":"Joint Impact of Phase Error, Transceiver Hardware Impairments, and Mobile Interferers on RIS-Aided Wireless System Over <i>κ</i>-<i>μ</i> Fading Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Fading; Node (physics); Wireless; Computer science; Transmitter; Channel (broadcasting); Transceiver; Wireless network; Algorithm; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Engineering; Combinatorics","score_opus":0.029821013468392974,"score_gpt":0.2904071906649276,"score_spread":0.2605861771965346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285741182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98727536,0.00087598205,0.009318428,0.0004051345,0.00022942897,0.00066680973,0.0002334831,0.00084270316,0.00015269658],"genre_scores_gemma":[0.9976214,0.00043700027,0.000891807,0.00011874645,0.000011208647,0.0007654048,0.00007264352,0.000073918265,0.000007842784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984739,0.00020891943,0.00053538603,0.0002467499,0.00022637591,0.00030871335],"domain_scores_gemma":[0.9968481,0.00019607965,0.00019148008,0.0026519997,0.000041460436,0.00007085197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022715272,0.00029349103,0.00041442426,0.00039275942,0.00036176285,0.000032673077,0.0015006314,0.000065956665,0.000025107413],"category_scores_gemma":[0.000009709933,0.00031830478,0.00019116563,0.00044641868,0.00027359958,0.00023633533,0.00035565867,0.00072185183,0.000004937722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006100029,0.00031289324,0.00020404696,0.00015902513,0.0003227769,0.000006042293,0.0038862831,0.5506531,0.43356308,0.00018568015,0.0030990453,0.0075470097],"study_design_scores_gemma":[0.011572087,0.0022356142,0.0011056821,0.0013592547,0.0002605799,0.00020182718,0.016588192,0.7571988,0.19621629,0.000161779,0.010292895,0.00280701],"about_ca_topic_score_codex":0.00007475743,"about_ca_topic_score_gemma":0.000003376608,"teacher_disagreement_score":0.2373468,"about_ca_system_score_codex":0.00072734966,"about_ca_system_score_gemma":0.00001938062,"threshold_uncertainty_score":0.9999269},"labels":[],"label_agreement":null},{"id":"W4287890935","doi":"10.1109/lcomm.2022.3193409","title":"On the Error Performance of LoRa-Enabled Aerial Networks Over Shadowed Rician Fading Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rician fading; Computer science; Fading; Relay; Computer network; Default gateway; Real-time computing; Communications system; Channel (broadcasting); Telecommunications; Power (physics)","score_opus":0.028532178523301553,"score_gpt":0.24592170913124992,"score_spread":0.21738953060794836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287890935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98008865,0.00027116045,0.00398892,0.004717076,0.0018564826,0.0043742904,0.000021340098,0.00024949908,0.004432581],"genre_scores_gemma":[0.99503565,0.000040423514,0.00013852595,0.0016541705,0.00016838059,0.0028732636,0.000018563205,0.00003349291,0.00003750974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909633,0.00016568828,0.00024641718,0.000096640666,0.00015277947,0.00024213368],"domain_scores_gemma":[0.9983618,0.00027588135,0.00007772155,0.0012412014,0.000016473474,0.000026922546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037372817,0.00012766519,0.00014931851,0.00007343059,0.00054703676,0.000032758686,0.0011211009,0.000034934423,0.0001623027],"category_scores_gemma":[0.0000067507153,0.00011426279,0.00006998963,0.00037995088,0.00007499957,0.00007843903,0.00017610328,0.00053547265,0.000008756742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002484785,0.000021984517,0.00006514552,0.000010805772,0.00003355294,4.0115552e-7,0.0003772295,0.96808964,0.001913061,0.000572725,0.028324503,0.00056608673],"study_design_scores_gemma":[0.00033893704,0.000057435736,0.0002756604,0.000053045987,0.000013740245,0.0000020528144,0.000046619753,0.9668306,0.00040342903,0.000049881546,0.031738855,0.000189727],"about_ca_topic_score_codex":0.000018615596,"about_ca_topic_score_gemma":0.000005120602,"teacher_disagreement_score":0.0149470195,"about_ca_system_score_codex":0.0000931109,"about_ca_system_score_gemma":0.000009189947,"threshold_uncertainty_score":0.46595013},"labels":[],"label_agreement":null},{"id":"W4288059590","doi":"10.1109/lcomm.2022.3194024","title":"Low Complexity First: Duration-Centric ISI Mitigation in Molecular Communication via Diffusion","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Molecular communication; Duration (music); Interval (graph theory); Computer science; Bit error rate; Intersymbol interference; Interference (communication); Symbol (formal); Algorithm; Diffusion; Communications system; Electronic engineering; Telecommunications; Channel (broadcasting); Decoding methods; Mathematics; Engineering; Transmitter","score_opus":0.014162411627765879,"score_gpt":0.21976204588843087,"score_spread":0.205599634260665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288059590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.747812,0.0058118063,0.20730104,0.031453248,0.00058015675,0.0019099142,0.00005758648,0.0009995113,0.004074773],"genre_scores_gemma":[0.98680407,0.0011034322,0.009077061,0.0016317085,0.000013639597,0.00053032994,0.0007656458,0.00005737257,0.000016744249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771994,0.0007462502,0.0006637567,0.00021951582,0.00034137987,0.00030916257],"domain_scores_gemma":[0.9958814,0.0002261398,0.0001568527,0.0035962453,0.000056790177,0.00008258584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004944145,0.0002268502,0.00022735175,0.0003868322,0.0008796383,0.00006706255,0.002162174,0.00007339886,0.00014307075],"category_scores_gemma":[0.00002517535,0.00030336555,0.00011025875,0.001189812,0.00019204488,0.00020749371,0.0006035515,0.0008521854,0.00004217036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050533763,0.0013182788,0.004550368,0.0001502757,0.00013552867,0.000020659732,0.0041294494,0.6625135,0.28654122,0.009269246,0.018215826,0.013105149],"study_design_scores_gemma":[0.0017921033,0.00003595919,0.007284285,0.000102022954,0.00004323365,0.000037826645,0.00026302077,0.9433066,0.006159748,0.0011800166,0.0389135,0.0008816651],"about_ca_topic_score_codex":0.00012686629,"about_ca_topic_score_gemma":0.00042674562,"teacher_disagreement_score":0.28079316,"about_ca_system_score_codex":0.0005145502,"about_ca_system_score_gemma":0.000022298243,"threshold_uncertainty_score":0.9999418},"labels":[],"label_agreement":null},{"id":"W4288786134","doi":"10.1109/lcomm.2022.3195042","title":"Deep Unfolding Network for PAPR Reduction in Multicarrier OFDM Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Université du Québec à Montréal","funders":"Fonds de recherche du Québec; Mitacs","keywords":"Orthogonal frequency-division multiplexing; Reduction (mathematics); Computer science; Algorithm; Bit error rate; Backpropagation; Power (physics); Constraint (computer-aided design); Transmitter power output; Companding; Function (biology); Transfer function; Control theory (sociology); Channel (broadcasting); Artificial neural network; Mathematics; Telecommunications; Transmitter; Control (management); Decoding methods; Artificial intelligence; Physics","score_opus":0.029015181766679714,"score_gpt":0.25837035478869635,"score_spread":0.22935517302201663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288786134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66051334,0.0121417595,0.27455783,0.015635658,0.024249272,0.005053989,0.00016552286,0.0025876656,0.005094965],"genre_scores_gemma":[0.98801005,0.000075240176,0.009620693,0.00012187003,0.00023633373,0.0017685448,0.00006660738,0.00005123523,0.00004943288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895877,0.00015362198,0.00034677304,0.00014841525,0.00011498956,0.00027745034],"domain_scores_gemma":[0.998579,0.00016041983,0.000059859944,0.0011312237,0.000025621755,0.000043846758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036276272,0.00012084661,0.00015183982,0.00016906671,0.00043125148,0.000038567683,0.00067393103,0.00003707003,0.0000147303435],"category_scores_gemma":[0.00002094698,0.0001620983,0.00006303416,0.00047590685,0.00006515266,0.00013391463,0.000095288415,0.0003597419,0.000006552888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041723783,0.000017590073,0.00021203402,0.000020638876,0.00003268774,2.6561122e-7,0.0004869892,0.9602945,0.023980571,0.0010109523,0.013222838,0.00071678206],"study_design_scores_gemma":[0.0005506567,0.000014834193,0.0001415563,0.000036363792,0.00003003903,0.00003019092,0.0011621823,0.81980616,0.00041635588,0.00017546328,0.17730233,0.0003338408],"about_ca_topic_score_codex":0.0000570625,"about_ca_topic_score_gemma":0.000011603168,"teacher_disagreement_score":0.3274967,"about_ca_system_score_codex":0.00048232218,"about_ca_system_score_gemma":0.00001196194,"threshold_uncertainty_score":0.66101766},"labels":[],"label_agreement":null},{"id":"W4289824661","doi":"10.1109/lcomm.2022.3195410","title":"Spread Unsourced Random Access With an Iterative MIMO Receiver","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preamble; Payload (computing); Computer science; Random access; Network packet; Channel (broadcasting); MIMO; Single antenna interference cancellation; Interference (communication); Algorithm; Real-time computing; Computer network","score_opus":0.024832141848698856,"score_gpt":0.2590982576589669,"score_spread":0.23426611581026802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289824661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.845269,0.00045542876,0.13419166,0.008986901,0.0004553151,0.00090534246,0.00010889699,0.002946277,0.0066811303],"genre_scores_gemma":[0.99546707,0.00006937132,0.0026887383,0.0012544373,0.00001794084,0.00029945688,0.00011251921,0.000036902005,0.000053589494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921805,0.00015096633,0.00017149154,0.00013721238,0.00014790242,0.000174379],"domain_scores_gemma":[0.9984104,0.00010582572,0.000043305616,0.0013694525,0.00003784062,0.000033181124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011524682,0.00013383506,0.0001405909,0.00017655651,0.00051918504,0.00009191696,0.0015041949,0.0000319037,0.00009643318],"category_scores_gemma":[0.000010476231,0.00013107885,0.000034726338,0.0004749928,0.00015308101,0.0003188078,0.00018286753,0.00036088176,0.000011595769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020165267,0.00018699601,0.0030827303,0.000037709815,0.00028290792,0.000017549854,0.00812833,0.9120931,0.029374216,0.001764135,0.036118694,0.008711959],"study_design_scores_gemma":[0.011238068,0.00054450065,0.003554471,0.00012470408,0.00026307825,0.00013554617,0.0076815845,0.42839655,0.097473145,0.0007772216,0.44691217,0.0028989674],"about_ca_topic_score_codex":0.00004894332,"about_ca_topic_score_gemma":0.000064451146,"teacher_disagreement_score":0.48369658,"about_ca_system_score_codex":0.0001144804,"about_ca_system_score_gemma":0.000011608003,"threshold_uncertainty_score":0.534524},"labels":[],"label_agreement":null},{"id":"W4291910357","doi":"10.1109/lcomm.2022.3198908","title":"Self-Supervised Learning for CSI Compression in FDD Massive MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Mitacs","keywords":"Computer science; Channel state information; MIMO; Data compression; Base station; Bandwidth (computing); Overhead (engineering); Algorithm; Computer engineering; Channel (broadcasting); Real-time computing; Telecommunications; Wireless","score_opus":0.020238710841921505,"score_gpt":0.2466741036157282,"score_spread":0.2264353927738067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291910357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031533547,0.0027569395,0.9574008,0.0018168472,0.0013103898,0.0023374155,0.000056145196,0.0012616846,0.001526217],"genre_scores_gemma":[0.9637942,0.00010793242,0.033969328,0.0001056358,0.000040160376,0.0016798215,0.00019219334,0.00006563382,0.000045149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989103,0.0002584024,0.00035018226,0.00015676457,0.00010245593,0.00022191335],"domain_scores_gemma":[0.9986722,0.00028350265,0.00008541348,0.00088097225,0.000040671694,0.0000372652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022699982,0.00013743156,0.00018970437,0.00020659089,0.00041767786,0.00003664719,0.00069372286,0.000039171817,0.0000063413927],"category_scores_gemma":[0.000021396287,0.00017280366,0.00004961958,0.00033757644,0.000024634985,0.00017671462,0.0001389018,0.0004021366,0.0000064441856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038480875,0.000027389606,0.00033428866,0.00007962718,0.000019714176,5.6705164e-7,0.0009725865,0.9754644,0.021332424,0.00023150936,0.001216005,0.00031765475],"study_design_scores_gemma":[0.00057533744,0.0000149623,0.000022721306,0.000047170386,0.000010699269,0.0000030496662,0.00071241235,0.96339196,0.00018094781,0.000011890083,0.034841362,0.0001874907],"about_ca_topic_score_codex":0.00003443339,"about_ca_topic_score_gemma":0.000009343192,"teacher_disagreement_score":0.9322606,"about_ca_system_score_codex":0.0004139986,"about_ca_system_score_gemma":0.0000129520095,"threshold_uncertainty_score":0.7046729},"labels":[],"label_agreement":null},{"id":"W4292336827","doi":"10.1109/lcomm.2022.3191511","title":"IEEE Communications Society","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Educational Technology and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Koç Üniversitesi; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Eidgenössische Technische Hochschule Zürich; Jinan University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; China Mobile Research Institute; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Shanghai Educational Development Foundation; Hanyang University; University of Akron; Vrije Universiteit Amsterdam; University of Surrey; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Glasgow; York University; Università di Bologna; Università degli Studi di Napoli Parthenope; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; University of Science and Technology of China; Beijing Jiaotong University; Trường Đại học Bách Khoa Hà Nội; Princeton University; Beijing Institute of Technology; Sun Yat-sen University; Université du Luxembourg; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.044030290110430685,"score_gpt":0.29305345605132105,"score_spread":0.24902316594089036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292336827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903597,0.0010060646,0.5485204,0.43473244,0.0010451078,0.00045333093,0.000028219742,0.00094725384,0.0033635881],"genre_scores_gemma":[0.61256945,0.00045774874,0.37073115,0.015227582,0.000031771735,0.0006055618,0.000098600234,0.000016758946,0.00026134317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986006,0.00035616793,0.0002942193,0.00027260763,0.00024678602,0.0002296365],"domain_scores_gemma":[0.99254686,0.00037574308,0.00017212085,0.006762093,0.00009225708,0.00005092353],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004915119,0.00012713058,0.000119502714,0.0001451832,0.0024293126,0.00008092937,0.009274151,0.000052089577,0.00003324403],"category_scores_gemma":[0.0000224821,0.00015665083,0.00012396474,0.0010600613,0.00039478685,0.0004126836,0.0018196187,0.0006974699,0.00006735524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789567,0.001313058,0.001985665,0.000013441212,0.0001999724,0.0000017270618,0.007672926,0.017579198,0.020011554,0.5194754,0.41948688,0.012255389],"study_design_scores_gemma":[0.00076430215,0.00007873938,0.0017321083,0.00001784746,0.000050258404,0.000102099104,0.0011245214,0.36054036,0.0016328745,0.010611189,0.6224708,0.00087492465],"about_ca_topic_score_codex":0.00003271938,"about_ca_topic_score_gemma":0.000013753008,"teacher_disagreement_score":0.6026659,"about_ca_system_score_codex":0.00022108544,"about_ca_system_score_gemma":0.00013027567,"threshold_uncertainty_score":0.99886936},"labels":[],"label_agreement":null},{"id":"W4293057165","doi":"10.1109/lcomm.2022.3201625","title":"Data-Driven Soft Demapping for Residual Impairments Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Microwave Engineering and Waveguides","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Huawei Technologies","keywords":"Computer science; Codebook; Artificial neural network; Channel (broadcasting); Wireless; Pruning; Reliability (semiconductor); Residual; Deep learning; Artificial intelligence; Machine learning; Computer network; Algorithm; Power (physics); Telecommunications","score_opus":0.05855426435487303,"score_gpt":0.27658657524643143,"score_spread":0.2180323108915584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293057165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27505225,0.0032509482,0.6921877,0.016732883,0.004010661,0.0018430969,0.0030881334,0.0026871462,0.0011471272],"genre_scores_gemma":[0.9781948,0.000059883543,0.019632852,0.00062784145,0.00014474559,0.00033046445,0.00084533275,0.000060960476,0.00010315394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920785,0.000048306636,0.00022426057,0.00016470865,0.000108039094,0.00024681434],"domain_scores_gemma":[0.99767965,0.00016532808,0.00003109022,0.002063245,0.000016478898,0.000044229688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028308388,0.00012341184,0.00012599392,0.00011123808,0.00041209723,0.00003911539,0.0017405854,0.000022169344,0.000017839098],"category_scores_gemma":[0.000020704609,0.00015555133,0.000042970823,0.00014300656,0.00003685874,0.00009540641,0.00045280514,0.00024127593,0.000013117277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033365563,0.000029815388,0.000026158765,0.000043356817,0.00011030798,0.0000016615984,0.0004683951,0.67531824,0.03760853,0.0001025523,0.28550887,0.00077874766],"study_design_scores_gemma":[0.0003104752,0.00002092854,0.000041467072,0.000018585872,0.00002868687,0.000018104744,0.00013145241,0.6394935,0.0003951988,0.000049655293,0.3592333,0.00025865238],"about_ca_topic_score_codex":0.000010256224,"about_ca_topic_score_gemma":0.0000063826456,"teacher_disagreement_score":0.7031425,"about_ca_system_score_codex":0.000112567985,"about_ca_system_score_gemma":0.000012755323,"threshold_uncertainty_score":0.6343199},"labels":[],"label_agreement":null},{"id":"W4293211611","doi":"10.1109/lcomm.2022.3186789","title":"Error Bounds for 3D Localization and Maximum Likelihood Estimation of mm-Wave MISO OFDM Systems in the Presence of Hardware Impairments","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Estimator; Cramér–Rao bound; Notation; Channel (broadcasting); Mathematical notation; Algorithm; Computer science; Mathematics; Estimation theory; Theoretical computer science; Statistics; Telecommunications; Arithmetic","score_opus":0.038735698955994304,"score_gpt":0.26315537175623843,"score_spread":0.22441967280024414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293211611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17655095,0.0007314067,0.8210151,0.00064373895,0.00013530006,0.00074129185,0.00008426535,0.000033135322,0.00006480127],"genre_scores_gemma":[0.9896057,0.00007140354,0.009709744,0.00014730764,0.0000065733984,0.00031786656,0.00012321558,0.000015085235,0.0000030780593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991392,0.00015913483,0.0003524331,0.000087116314,0.00015563953,0.000106496314],"domain_scores_gemma":[0.9990869,0.00014608384,0.00010595467,0.0005973706,0.000047075864,0.00001660995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045706902,0.000078889985,0.00012372776,0.00013005266,0.00015346383,0.000020947235,0.0003284088,0.000024847865,0.0000032822663],"category_scores_gemma":[0.000029154417,0.000077837096,0.000028542545,0.00019702021,0.000054745935,0.00009903272,0.00006496218,0.00012244283,2.998309e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011380482,0.00007422349,0.00017445283,0.00030724978,0.000031855096,2.858314e-7,0.0052117067,0.967426,0.021620221,0.00007438818,0.0011498373,0.0039184187],"study_design_scores_gemma":[0.00030692466,0.000032976506,0.000092638234,0.000048921334,0.00001991973,0.0000056612857,0.00086370413,0.9967089,0.00091164815,0.00011314025,0.00082175364,0.0000737645],"about_ca_topic_score_codex":0.00008385987,"about_ca_topic_score_gemma":0.000018084038,"teacher_disagreement_score":0.81305474,"about_ca_system_score_codex":0.000057966605,"about_ca_system_score_gemma":0.000014060785,"threshold_uncertainty_score":0.31741047},"labels":[],"label_agreement":null},{"id":"W4294643363","doi":"10.1109/lcomm.2022.3204489","title":"IRS-Enabled Backscattering in a Downlink Non-Orthogonal Multiple Access System","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Alberta","funders":"Huawei Technologies","keywords":"Telecommunications link; Computer science; Decoding methods; Noma; Optimization problem; Quality of service; Relaxation (psychology); Transmitter power output; Signal-to-noise ratio (imaging); Power (physics); Algorithm; Mathematical optimization; Convex optimization; Transmitter; Real-time computing; Telecommunications; Mathematics; Regular polygon; Channel (broadcasting)","score_opus":0.026066254684890742,"score_gpt":0.25867976351813804,"score_spread":0.2326135088332473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294643363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89671797,0.0010239605,0.08916062,0.006657892,0.00051910104,0.00093217014,0.00007409162,0.0028240096,0.0020901717],"genre_scores_gemma":[0.9860723,0.00024087045,0.011587596,0.00034757218,0.000015686928,0.0015787,0.00008423156,0.00006240951,0.000010603233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985421,0.0001583354,0.0005072542,0.00022980534,0.00020375258,0.00035876877],"domain_scores_gemma":[0.9958299,0.0003802356,0.00010745838,0.0036095423,0.000029440225,0.000043453205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028413523,0.00021486776,0.0002666273,0.00046807848,0.000494877,0.00007256867,0.004432167,0.000058079393,0.000023758677],"category_scores_gemma":[0.000029741372,0.00027342816,0.00007482099,0.00080740865,0.00014404694,0.0003903097,0.0016654909,0.0009828333,0.000032381035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066902962,0.00007558344,0.007833075,0.00008388135,0.00004351161,0.000008157625,0.00047564495,0.9178938,0.06706962,0.00049904804,0.0018356688,0.004175302],"study_design_scores_gemma":[0.0019008414,0.000028158596,0.016259711,0.0002239435,0.0000217301,0.00006728561,0.0028207807,0.93704635,0.00969226,0.00017422649,0.030558234,0.0012064988],"about_ca_topic_score_codex":0.000060818988,"about_ca_topic_score_gemma":0.00011668203,"teacher_disagreement_score":0.08935434,"about_ca_system_score_codex":0.00079022476,"about_ca_system_score_gemma":0.000023012115,"threshold_uncertainty_score":0.9999718},"labels":[],"label_agreement":null},{"id":"W4295309830","doi":"10.1109/lcomm.2022.3191507","title":"IEEE Communications Letters Publication Information","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Koç Üniversitesi; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Eidgenössische Technische Hochschule Zürich; Jinan University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; China Mobile Research Institute; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Shanghai Educational Development Foundation; Hanyang University; University of Akron; Vrije Universiteit Amsterdam; University of Surrey; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Glasgow; York University; Università di Bologna; Università degli Studi di Napoli Parthenope; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; University of Science and Technology of China; Beijing Jiaotong University; Trường Đại học Bách Khoa Hà Nội; Princeton University; Beijing Institute of Technology; Sun Yat-sen University; Université du Luxembourg; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04008326719420618,"score_gpt":0.2754541085407782,"score_spread":0.235370841346572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295309830","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026161194,0.00032660094,0.35399714,0.61120325,0.002132326,0.00089110155,0.000056404515,0.0015041339,0.003727837],"genre_scores_gemma":[0.9303138,0.000087073815,0.039887894,0.02754942,0.00004753863,0.0016489973,0.00032775494,0.000017617043,0.000119906625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974551,0.0007019722,0.00073869433,0.00029623587,0.00043670484,0.00037129337],"domain_scores_gemma":[0.98902476,0.00032740217,0.0005336333,0.009795146,0.00021929205,0.00009977558],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010530861,0.00020282145,0.0002005178,0.00075157365,0.0024209414,0.00035934587,0.01156263,0.00007421615,0.000039781553],"category_scores_gemma":[0.000082933366,0.00024634937,0.00011411676,0.0018393829,0.00037530603,0.002480262,0.0016795257,0.0008240088,0.00052300986],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008578285,0.0005590273,0.0023292252,0.000026318634,0.00014001413,0.0000010210798,0.011339142,0.0012396346,0.032171167,0.17414275,0.7446978,0.033345316],"study_design_scores_gemma":[0.00044582508,0.000031230527,0.0019537346,0.000012226568,0.000019783518,0.00008868228,0.0007582764,0.017012566,0.0007513645,0.00044721633,0.97800624,0.00047282263],"about_ca_topic_score_codex":0.00015397555,"about_ca_topic_score_gemma":0.000020686532,"teacher_disagreement_score":0.90415263,"about_ca_system_score_codex":0.00042008734,"about_ca_system_score_gemma":0.00014965983,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W4304140769","doi":"10.1109/lcomm.2022.3206650","title":"IEEE Communications Letters Publication Information","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Koç Üniversitesi; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Eidgenössische Technische Hochschule Zürich; Jinan University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; China Mobile Research Institute; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Shanghai Educational Development Foundation; Hanyang University; University of Akron; Vrije Universiteit Amsterdam; University of Surrey; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Glasgow; York University; Università di Bologna; Università degli Studi di Napoli Parthenope; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; University of Science and Technology of China; Beijing Jiaotong University; Trường Đại học Bách Khoa Hà Nội; Princeton University; Beijing Institute of Technology; Sun Yat-sen University; Université du Luxembourg; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04008326719420618,"score_gpt":0.2754541085407782,"score_spread":0.235370841346572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304140769","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026161194,0.00032660094,0.35399714,0.61120325,0.002132326,0.00089110155,0.000056404515,0.0015041339,0.003727837],"genre_scores_gemma":[0.9303138,0.000087073815,0.039887894,0.02754942,0.00004753863,0.0016489973,0.00032775494,0.000017617043,0.000119906625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974551,0.0007019722,0.00073869433,0.00029623587,0.00043670484,0.00037129337],"domain_scores_gemma":[0.98902476,0.00032740217,0.0005336333,0.009795146,0.00021929205,0.00009977558],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010530861,0.00020282145,0.0002005178,0.00075157365,0.0024209414,0.00035934587,0.01156263,0.00007421615,0.000039781553],"category_scores_gemma":[0.000082933366,0.00024634937,0.00011411676,0.0018393829,0.00037530603,0.002480262,0.0016795257,0.0008240088,0.00052300986],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008578285,0.0005590273,0.0023292252,0.000026318634,0.00014001413,0.0000010210798,0.011339142,0.0012396346,0.032171167,0.17414275,0.7446978,0.033345316],"study_design_scores_gemma":[0.00044582508,0.000031230527,0.0019537346,0.000012226568,0.000019783518,0.00008868228,0.0007582764,0.017012566,0.0007513645,0.00044721633,0.97800624,0.00047282263],"about_ca_topic_score_codex":0.00015397555,"about_ca_topic_score_gemma":0.000020686532,"teacher_disagreement_score":0.90415263,"about_ca_system_score_codex":0.00042008734,"about_ca_system_score_gemma":0.00014965983,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W4309325579","doi":"10.1109/lcomm.2022.3217900","title":"IEEE Communications Letters Publication Information","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Koç Üniversitesi; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Eidgenössische Technische Hochschule Zürich; Jinan University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; China Mobile Research Institute; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Shanghai Educational Development Foundation; Hanyang University; University of Akron; Vrije Universiteit Amsterdam; University of Surrey; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Glasgow; York University; Università di Bologna; Università degli Studi di Napoli Parthenope; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; University of Science and Technology of China; Beijing Jiaotong University; Trường Đại học Bách Khoa Hà Nội; Princeton University; Beijing Institute of Technology; Sun Yat-sen University; Université du Luxembourg; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04008326719420618,"score_gpt":0.2754541085407782,"score_spread":0.235370841346572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309325579","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026161194,0.00032660094,0.35399714,0.61120325,0.002132326,0.00089110155,0.000056404515,0.0015041339,0.003727837],"genre_scores_gemma":[0.9303138,0.000087073815,0.039887894,0.02754942,0.00004753863,0.0016489973,0.00032775494,0.000017617043,0.000119906625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974551,0.0007019722,0.00073869433,0.00029623587,0.00043670484,0.00037129337],"domain_scores_gemma":[0.98902476,0.00032740217,0.0005336333,0.009795146,0.00021929205,0.00009977558],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010530861,0.00020282145,0.0002005178,0.00075157365,0.0024209414,0.00035934587,0.01156263,0.00007421615,0.000039781553],"category_scores_gemma":[0.000082933366,0.00024634937,0.00011411676,0.0018393829,0.00037530603,0.002480262,0.0016795257,0.0008240088,0.00052300986],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008578285,0.0005590273,0.0023292252,0.000026318634,0.00014001413,0.0000010210798,0.011339142,0.0012396346,0.032171167,0.17414275,0.7446978,0.033345316],"study_design_scores_gemma":[0.00044582508,0.000031230527,0.0019537346,0.000012226568,0.000019783518,0.00008868228,0.0007582764,0.017012566,0.0007513645,0.00044721633,0.97800624,0.00047282263],"about_ca_topic_score_codex":0.00015397555,"about_ca_topic_score_gemma":0.000020686532,"teacher_disagreement_score":0.90415263,"about_ca_system_score_codex":0.00042008734,"about_ca_system_score_gemma":0.00014965983,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W4310969247","doi":"10.1109/lcomm.2022.3226589","title":"IEEE Communications Letters Publication Information","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; National Chiao Tung University; Koç Üniversitesi; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Eidgenössische Technische Hochschule Zürich; Jinan University; Universitat Pompeu Fabra; Technische Universiteit Eindhoven; China Mobile Research Institute; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Shanghai Educational Development Foundation; Hanyang University; University of Akron; Vrije Universiteit Amsterdam; University of Surrey; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Glasgow; York University; Università di Bologna; Università degli Studi di Napoli Parthenope; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; University of Science and Technology of China; Beijing Jiaotong University; Trường Đại học Bách Khoa Hà Nội; Princeton University; Beijing Institute of Technology; Sun Yat-sen University; Université du Luxembourg; Universidad de Cantabria; Trường Đại học Duy Tân; Western Michigan University; Indian National Science Academy; National Sun Yat-sen University","keywords":"Computer science; Telecommunications; Computer network; Information retrieval; World Wide Web","score_opus":0.04008326719420618,"score_gpt":0.2754541085407782,"score_spread":0.235370841346572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310969247","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026161194,0.00032660094,0.35399714,0.61120325,0.002132326,0.00089110155,0.000056404515,0.0015041339,0.003727837],"genre_scores_gemma":[0.9303138,0.000087073815,0.039887894,0.02754942,0.00004753863,0.0016489973,0.00032775494,0.000017617043,0.000119906625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974551,0.0007019722,0.00073869433,0.00029623587,0.00043670484,0.00037129337],"domain_scores_gemma":[0.98902476,0.00032740217,0.0005336333,0.009795146,0.00021929205,0.00009977558],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010530861,0.00020282145,0.0002005178,0.00075157365,0.0024209414,0.00035934587,0.01156263,0.00007421615,0.000039781553],"category_scores_gemma":[0.000082933366,0.00024634937,0.00011411676,0.0018393829,0.00037530603,0.002480262,0.0016795257,0.0008240088,0.00052300986],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008578285,0.0005590273,0.0023292252,0.000026318634,0.00014001413,0.0000010210798,0.011339142,0.0012396346,0.032171167,0.17414275,0.7446978,0.033345316],"study_design_scores_gemma":[0.00044582508,0.000031230527,0.0019537346,0.000012226568,0.000019783518,0.00008868228,0.0007582764,0.017012566,0.0007513645,0.00044721633,0.97800624,0.00047282263],"about_ca_topic_score_codex":0.00015397555,"about_ca_topic_score_gemma":0.000020686532,"teacher_disagreement_score":0.90415263,"about_ca_system_score_codex":0.00042008734,"about_ca_system_score_gemma":0.00014965983,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W4312542919","doi":"10.1109/lcomm.2022.3210826","title":"Structural Design of Non-Uniform Linear Arrays for Favorable Propagation in Massive MIMO","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"MIMO; Beamforming; Multipath propagation; Grating; Computer science; Topology (electrical circuits); Telecommunications; Algorithm; Acoustics; Mathematics; Physics; Optics; Channel (broadcasting)","score_opus":0.031802143489354284,"score_gpt":0.24562458814502916,"score_spread":0.21382244465567488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312542919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015611085,0.000051546886,0.98253214,0.00082511076,0.00012570286,0.00067623233,0.00002683949,0.000059375754,0.000091933754],"genre_scores_gemma":[0.80646735,0.000038951064,0.19287576,0.00014066616,0.000014617907,0.00031324223,0.00010741651,0.000022876211,0.000019119108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993826,0.000066956636,0.00024427107,0.000082177416,0.000089738176,0.0001342601],"domain_scores_gemma":[0.99925166,0.00011160298,0.00006912862,0.00050607295,0.00004307554,0.00001847376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018624974,0.00008607801,0.00011897303,0.00015596564,0.00016926495,0.000009978882,0.00043494182,0.00002566796,0.000012720563],"category_scores_gemma":[0.000014416406,0.00009823202,0.000035929377,0.0002998402,0.00004691665,0.00013873717,0.000040022827,0.00016710407,0.0000017603281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012995985,0.000011964543,0.000040513572,0.000021115511,0.000011111619,2.1139009e-7,0.0005944983,0.9272524,0.07093784,0.000102380654,0.0007893671,0.00022556998],"study_design_scores_gemma":[0.00034688154,0.000031115957,0.00006467687,0.000012642906,0.000009065476,0.0000012060042,0.00021519548,0.99576145,0.003170297,0.00006279813,0.00021977429,0.00010490542],"about_ca_topic_score_codex":0.000019353814,"about_ca_topic_score_gemma":0.0000072620073,"teacher_disagreement_score":0.79085624,"about_ca_system_score_codex":0.00013600939,"about_ca_system_score_gemma":0.000023399272,"threshold_uncertainty_score":0.40057856},"labels":[],"label_agreement":null},{"id":"W4312725651","doi":"10.1109/lcomm.2022.3230202","title":"Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Decoding methods; Permutation (music); Constraint (computer-aided design); Algorithm; Computer science; List decoding; Function (biology); Set (abstract data type); Mathematics; Block code; Concatenated error correction code; Physics","score_opus":0.045549186185017944,"score_gpt":0.2814449723953956,"score_spread":0.23589578621037768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312725651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006290268,0.000085757645,0.97372246,0.017497856,0.00029428196,0.00074545556,0.00000987042,0.0012329997,0.00012105928],"genre_scores_gemma":[0.50656825,0.0000035488688,0.48922065,0.003225919,0.0000065938775,0.0008959707,0.000020793314,0.000023610346,0.00003463781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983017,0.0004643695,0.00027280903,0.0003857671,0.0002841294,0.00029126005],"domain_scores_gemma":[0.9957143,0.0010603584,0.00023157377,0.0028308562,0.00011096478,0.000051939915],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009195641,0.00018049426,0.0001789735,0.00030316832,0.0013675174,0.00012906583,0.0030998786,0.00003522963,0.000009190886],"category_scores_gemma":[0.000048894177,0.00019349008,0.00008304136,0.00063987577,0.000121181496,0.00028162566,0.00039977007,0.00039213183,0.000006804472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000592479,0.001271272,0.0020720651,0.00010083227,0.00039529835,0.000026148855,0.004476388,0.433275,0.29405415,0.019519534,0.19088075,0.05333607],"study_design_scores_gemma":[0.0005101675,0.00030677044,0.00017811122,0.000032538625,0.00003300208,0.0000209814,0.00005868443,0.9867093,0.0023966176,0.00067739136,0.008752208,0.00032424048],"about_ca_topic_score_codex":0.00005621231,"about_ca_topic_score_gemma":0.0000668699,"teacher_disagreement_score":0.55343425,"about_ca_system_score_codex":0.00040067674,"about_ca_system_score_gemma":0.00012931111,"threshold_uncertainty_score":0.9999326},"labels":[],"label_agreement":null},{"id":"W4312765029","doi":"10.1109/lcomm.2022.3211451","title":"On the Ergodic Mutual Information of Keyhole MIMO Channels With Finite-Alphabet Inputs","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Ergodic theory; Mutual information; Transmission (telecommunications); Keyhole; Computer science; Ergodicity; Transmitter; Precoding; Channel (broadcasting); Topology (electrical circuits); MIMO; Algorithm; Mathematics; Telecommunications; Statistics; Mathematical analysis; Engineering; Artificial intelligence","score_opus":0.013926756940194811,"score_gpt":0.20769952391789565,"score_spread":0.19377276697770082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312765029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23992294,0.0002446653,0.7383705,0.0134758735,0.00079639454,0.0014447981,0.00020169718,0.0005762767,0.0049668807],"genre_scores_gemma":[0.99618167,0.000022661132,0.0020383652,0.0012678223,0.000013756907,0.0003161827,0.00011876278,0.000021617305,0.000019186227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992519,0.00011483243,0.00026796566,0.00006241304,0.00017294675,0.00012992928],"domain_scores_gemma":[0.99831784,0.0003442631,0.00011475142,0.0011576873,0.00004322891,0.00002222584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018184283,0.00010815301,0.00011112761,0.00014913223,0.00028327666,0.000021582455,0.00069892785,0.000021528373,0.000028812214],"category_scores_gemma":[0.0000324077,0.000093441435,0.000030328503,0.00042415774,0.00008364372,0.00028597485,0.00009172298,0.000281673,0.000028096441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008737014,0.000018326666,0.00002563153,0.000014429646,0.000024799456,1.9119032e-7,0.0016477493,0.990108,0.0017177422,0.001018427,0.0051808287,0.00023513696],"study_design_scores_gemma":[0.001405329,0.00026333443,0.00014787649,0.00015044138,0.00005451045,0.000020466425,0.0016844042,0.92989284,0.009520638,0.00018195082,0.056028567,0.0006496339],"about_ca_topic_score_codex":0.000011248658,"about_ca_topic_score_gemma":0.0000061759724,"teacher_disagreement_score":0.7562587,"about_ca_system_score_codex":0.000109047425,"about_ca_system_score_gemma":0.000013879752,"threshold_uncertainty_score":0.3810431},"labels":[],"label_agreement":null},{"id":"W4312853625","doi":"10.1109/lcomm.2022.3214146","title":"Joint Lifetime-Outage Optimization in Relay-Enabled IoT Networks—A Deep Reinforcement Learning Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Relay; Benchmark (surveying); Reinforcement learning; Maximization; Joint (building); Internet of Things; Scheme (mathematics); Base station; Selection (genetic algorithm); Optimization problem; Transmission (telecommunications); Computer network; Nonlinear programming; Mathematical optimization; Nonlinear system; Artificial intelligence; Telecommunications; Algorithm; Power (physics); Engineering","score_opus":0.03643706991205457,"score_gpt":0.251818523258253,"score_spread":0.2153814533461984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312853625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014636989,0.0009894379,0.9809642,0.012358137,0.00017339668,0.000513917,2.8497593e-7,0.00025835348,0.003278579],"genre_scores_gemma":[0.8766092,0.0011810634,0.11615629,0.0050149164,0.000035016397,0.0005754711,0.000105812665,0.000028551405,0.00029368632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656767,0.0016371618,0.0006393744,0.0004046592,0.00034737305,0.00040374417],"domain_scores_gemma":[0.99608517,0.00024725698,0.00029278174,0.0031981901,0.00008673224,0.000089854206],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014057118,0.00021520085,0.00025501504,0.0003853248,0.0017018346,0.00021451098,0.0038525003,0.000047428828,0.00007882014],"category_scores_gemma":[0.000060920425,0.00025567063,0.000097567725,0.0017148732,0.00010455097,0.00034127684,0.0026056,0.0012620926,0.000013775032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052043833,0.00010973096,0.00018405495,0.000003378301,0.000017884413,0.000001681453,0.001814221,0.989836,0.00040684204,0.0039169393,0.0011157003,0.0025884067],"study_design_scores_gemma":[0.00049874565,0.00003778087,0.00017312691,0.000017641123,0.0000066839793,0.000010480198,0.00017636812,0.9875128,0.000018906005,0.00001057483,0.011260209,0.00027666672],"about_ca_topic_score_codex":0.000028860028,"about_ca_topic_score_gemma":0.000019180501,"teacher_disagreement_score":0.8751455,"about_ca_system_score_codex":0.00046440208,"about_ca_system_score_gemma":0.0000627153,"threshold_uncertainty_score":0.99998957},"labels":[],"label_agreement":null},{"id":"W4312866358","doi":"10.1109/lcomm.2022.3218513","title":"Communications Channel Characteristics Due to Aircraft Body Blockage in Urban Air Mobility","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Airframe; Air gap (plumbing); Channel (broadcasting); Computer science; Delay spread; Telecommunications; Acoustics; Aerospace engineering; Engineering; Fading; Physics; Materials science","score_opus":0.015609295936579642,"score_gpt":0.2342768669268534,"score_spread":0.21866757099027376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312866358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78312266,0.0010090416,0.134715,0.0690192,0.0008478107,0.003975046,0.0010602438,0.0018802135,0.004370802],"genre_scores_gemma":[0.9844523,0.00017393578,0.010406379,0.001999916,0.000036402616,0.002341464,0.0004839775,0.000057653448,0.000047991758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998555,0.00021337581,0.00051965803,0.00023442737,0.00017834082,0.0002992057],"domain_scores_gemma":[0.9949219,0.00019032524,0.00007398457,0.0046526496,0.000058329842,0.00010277162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003806966,0.00019407862,0.00023665332,0.0003237765,0.00065087836,0.00003841969,0.0024400093,0.000050227103,0.000042503078],"category_scores_gemma":[0.000025355077,0.0002609179,0.000067218054,0.0010808803,0.00012161263,0.00013729394,0.0007060631,0.0006128786,0.00006649164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003472644,0.002423625,0.0059486744,0.00012027058,0.00017473524,0.000012032532,0.0116824545,0.8388215,0.04927,0.004920783,0.07975661,0.006834629],"study_design_scores_gemma":[0.00073055393,0.000057351215,0.053235948,0.000050792893,0.000051886036,0.00002914417,0.0006371892,0.6897794,0.0006273172,0.00016360737,0.2536452,0.0009915746],"about_ca_topic_score_codex":0.0001264347,"about_ca_topic_score_gemma":0.00015512526,"teacher_disagreement_score":0.20132963,"about_ca_system_score_codex":0.00043859525,"about_ca_system_score_gemma":0.000028917952,"threshold_uncertainty_score":0.9999843},"labels":[],"label_agreement":null},{"id":"W4313068261","doi":"10.1109/lcomm.2022.3212074","title":"Coordinate Interleaved Faster-Than-Nyquist Signaling","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Intersymbol interference; Nyquist–Shannon sampling theorem; Computer science; Transmitter; Phase-shift keying; Nyquist rate; Detector; Transmission (telecommunications); Algorithm; Keying; Constructive; Spectral efficiency; Telecommunications; Bit error rate; Decoding methods; Sampling (signal processing)","score_opus":0.026912159486174904,"score_gpt":0.24670306632632188,"score_spread":0.219790906840147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313068261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94909346,0.00080428435,0.020730864,0.013417208,0.0031839835,0.00042201456,0.00007168488,0.0014690189,0.010807461],"genre_scores_gemma":[0.99599135,0.00002884925,0.0024471334,0.0008536507,0.00007291985,0.000258244,0.000041561878,0.00005131718,0.00025494775],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990417,0.00015665808,0.0002761497,0.00013874879,0.00016202137,0.00022477028],"domain_scores_gemma":[0.998289,0.00011052963,0.00005242017,0.0014689395,0.000024561728,0.00005454705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019367915,0.00013826706,0.00013511651,0.00018453396,0.00048163545,0.000051169267,0.0012959023,0.00002286026,0.00017391067],"category_scores_gemma":[0.000010945794,0.00018125177,0.00008115464,0.0003389398,0.0001232195,0.00012373224,0.00027295024,0.0005192086,0.0000948451],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009936383,0.00008350111,0.0003809491,0.000032862146,0.00016615358,0.000007212671,0.0025163025,0.20033781,0.71415615,0.00034907172,0.07858477,0.0033752753],"study_design_scores_gemma":[0.0011182994,0.00006744873,0.0004529168,0.00006752538,0.000085280815,0.00016687156,0.0032725167,0.10473865,0.0347428,0.0002375035,0.85387284,0.0011773502],"about_ca_topic_score_codex":0.000023638304,"about_ca_topic_score_gemma":0.000006301712,"teacher_disagreement_score":0.77528805,"about_ca_system_score_codex":0.00027029385,"about_ca_system_score_gemma":0.000010014685,"threshold_uncertainty_score":0.7391233},"labels":[],"label_agreement":null},{"id":"W4313306425","doi":"10.1109/lcomm.2022.3233524","title":"Outage Probability Analysis of LR-FHSS in Satellite IoT Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spread spectrum; Frequency-hopping spread spectrum; Chirp spread spectrum; Computer science; Aloha; LPWAN; Computer network; Fading; Communications satellite; Nakagami distribution; Range (aeronautics); Channel (broadcasting); Telecommunications; Wireless; Satellite; Throughput; Direct-sequence spread spectrum; Engineering","score_opus":0.028674626914603814,"score_gpt":0.2580714026260151,"score_spread":0.22939677571141126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313306425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9567197,0.0025743379,0.024829563,0.00453391,0.00042224416,0.007016079,0.000076835786,0.00039648084,0.0034308443],"genre_scores_gemma":[0.995089,0.000088433946,0.0018991069,0.00043672728,0.000018053262,0.0023760833,0.00006375358,0.000017781742,0.000011081143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.00027542945,0.00038652858,0.00012354592,0.00012034453,0.00019638009],"domain_scores_gemma":[0.9980344,0.00021559861,0.000064065505,0.0016390807,0.000017402057,0.000029430064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005579381,0.00010409433,0.0002517618,0.00024889322,0.000119979275,0.000015622667,0.0008744013,0.000035147154,0.00006652533],"category_scores_gemma":[0.0000058047926,0.00012260265,0.00012661933,0.0016504135,0.00007808593,0.00003833238,0.00016040268,0.00043753715,0.000001951899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005817385,0.000048795755,0.012120404,0.0000133409085,0.00015728288,6.958803e-7,0.00039771065,0.9830737,0.00060014735,0.000122819,0.00062513264,0.002834156],"study_design_scores_gemma":[0.00023315521,0.000016327194,0.029789275,0.000015357116,0.00013304983,7.1162583e-7,0.000051015602,0.9362569,0.000061836814,0.00010210852,0.033115435,0.0002248255],"about_ca_topic_score_codex":0.000083299856,"about_ca_topic_score_gemma":0.00031642738,"teacher_disagreement_score":0.046816796,"about_ca_system_score_codex":0.00014557422,"about_ca_system_score_gemma":0.0000082943225,"threshold_uncertainty_score":0.4999591},"labels":[],"label_agreement":null},{"id":"W4313643998","doi":"10.1109/lcomm.2022.3232864","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Università di Bologna; National Chiao Tung University; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Sun Yat-sen University; Beijing Institute of Technology; University of Science and Technology of China; Beijing Jiaotong University; Chinese University of Hong Kong; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Jinan University; Eidgenössische Technische Hochschule Zürich; Shanghai Educational Development Foundation; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Université du Luxembourg; Syracuse University; Beijing University of Posts and Telecommunications; Beihang University; University of Surrey; Vrije Universiteit Amsterdam; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Sussex; University of Glasgow; York University; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; Princeton University; Universidad de Cantabria; Memorial University of Newfoundland; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313643998","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4315474764","doi":"10.1109/lcomm.2023.3235834","title":"A Novel Nested Coded Delivery Strategy for Coded Caching Under Nonuniform File Popularity","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; St. Francis Xavier University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Scheme (mathematics); Popularity; Multicast; Computer network; Mathematics","score_opus":0.10726911798425552,"score_gpt":0.3046086345453457,"score_spread":0.19733951656109017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315474764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1815979,0.00009333516,0.7910833,0.023930985,0.0005331467,0.00067451096,0.0005061819,0.0011908115,0.00038986],"genre_scores_gemma":[0.97157365,0.000038253547,0.022132827,0.004959866,0.000057362166,0.00023400644,0.000624261,0.000028908877,0.0003508479],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850297,0.00012512466,0.00035732155,0.0003662746,0.00023136723,0.00041693443],"domain_scores_gemma":[0.9961383,0.0007741982,0.0001473251,0.002697767,0.00014160374,0.00010080977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044656152,0.00019897611,0.0002209277,0.00025332597,0.00082378567,0.0003166514,0.0029536008,0.000085518965,0.000007635017],"category_scores_gemma":[0.00006148032,0.00021502074,0.00017544783,0.00070925424,0.00010269899,0.0005637756,0.0004937414,0.00035857968,0.00008043622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000741479,0.0008189908,0.00051122694,0.00011599388,0.00044763595,0.000023071378,0.0024382898,0.11656361,0.55820525,0.060471985,0.23995334,0.020376481],"study_design_scores_gemma":[0.0012029567,0.000055721925,0.0038835974,0.00008537248,0.000039663566,0.000031055257,0.00029239318,0.9876244,0.00043144875,0.00075740146,0.0050489237,0.00054707145],"about_ca_topic_score_codex":0.0012455034,"about_ca_topic_score_gemma":0.0006098497,"teacher_disagreement_score":0.8710608,"about_ca_system_score_codex":0.0001212337,"about_ca_system_score_gemma":0.00009188955,"threshold_uncertainty_score":0.87682915},"labels":[],"label_agreement":null},{"id":"W4316661147","doi":"10.1109/lcomm.2023.3237540","title":"An Enhanced Interference Alignment Strategy With MIL Criterion and RCG Algorithm for IRS-Assisted Multiuser MIMO","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"China Scholarship Council; Hangzhou Dianzi University; National Natural Science Foundation of China","keywords":"Precoding; Zero-forcing precoding; Interference (communication); MIMO; Interference alignment; Algorithm; Computer science; Mathematics; Optimization problem; Control theory (sociology); Mathematical optimization; Beamforming; Channel (broadcasting); Telecommunications","score_opus":0.040570798573772944,"score_gpt":0.2985491257498791,"score_spread":0.25797832717610614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316661147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22962189,0.0003398121,0.76522136,0.0021387122,0.00007983757,0.00053938694,0.00006111718,0.0019216255,0.000076276316],"genre_scores_gemma":[0.8327561,0.0012603069,0.16492924,0.00013242365,0.000009703208,0.0006839985,0.00017223204,0.00003907828,0.000016918599],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907166,0.00006600015,0.00027404708,0.00022482054,0.000095637806,0.00026781546],"domain_scores_gemma":[0.99710625,0.00027118123,0.00006691663,0.0024267137,0.00007180043,0.000057139478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011961418,0.00020496106,0.00019352586,0.00019971482,0.00025116967,0.00007607991,0.001208429,0.00008248229,0.000002628544],"category_scores_gemma":[0.000014866653,0.0002064952,0.000030567746,0.0003651401,0.00027843198,0.0003229907,0.00015268562,0.00024232511,0.00000743503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011700784,0.00006784746,0.000043162243,0.000050864637,0.000076895034,0.0000010847591,0.00079891627,0.01654822,0.5671006,0.00020858274,0.00092207897,0.4141701],"study_design_scores_gemma":[0.0016645136,0.0002787832,0.004113939,0.00029735477,0.000047197183,0.0000123079735,0.0034226521,0.80147123,0.18172455,0.0004304245,0.005564173,0.0009728991],"about_ca_topic_score_codex":0.000016425005,"about_ca_topic_score_gemma":0.000092220165,"teacher_disagreement_score":0.78492296,"about_ca_system_score_codex":0.00010625203,"about_ca_system_score_gemma":0.000011462892,"threshold_uncertainty_score":0.84206295},"labels":[],"label_agreement":null},{"id":"W4316661249","doi":"10.1109/lcomm.2023.3236953","title":"Low Complexity Classification Approach for Faster-Than-Nyquist (FTN) Signaling Detection","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Classifier (UML); Algorithm; Mathematics; Nyquist–Shannon sampling theorem; Artificial intelligence; Computer science; Discrete mathematics; Arithmetic","score_opus":0.122258581716712,"score_gpt":0.295228279836751,"score_spread":0.17296969812003898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316661249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25544012,0.000065766886,0.7364641,0.002255239,0.00097176357,0.000806313,0.000059660873,0.0020628148,0.001874219],"genre_scores_gemma":[0.9781465,0.000051577597,0.020303153,0.00015417932,0.00019322101,0.00069163396,0.00032696294,0.00006297436,0.00006982975],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891603,0.00009126773,0.00034432558,0.00021498934,0.000149789,0.0002835814],"domain_scores_gemma":[0.99819875,0.00019119319,0.000078890815,0.0013925404,0.00007439034,0.00006422333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000300611,0.00016981781,0.00015920086,0.0002683573,0.0004358844,0.00008204868,0.0007303607,0.00008555468,0.000005321514],"category_scores_gemma":[0.000032243817,0.00020949569,0.00010748367,0.0006258378,0.00021062882,0.00020113788,0.00005461193,0.00026170915,0.000104396524],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008172137,0.000051465227,0.00006324304,0.00014373023,0.000057556786,1.7097679e-7,0.00048006503,0.0675318,0.91846174,0.0002987281,0.0069309305,0.0059724106],"study_design_scores_gemma":[0.00044425053,0.000018347013,0.0015858596,0.00003564621,0.00004210406,0.000009834766,0.00063317065,0.91746736,0.066618025,0.00020705721,0.012515941,0.00042242307],"about_ca_topic_score_codex":0.00001274735,"about_ca_topic_score_gemma":0.000015111144,"teacher_disagreement_score":0.8518437,"about_ca_system_score_codex":0.0002022568,"about_ca_system_score_gemma":0.0000099744375,"threshold_uncertainty_score":0.8542986},"labels":[],"label_agreement":null},{"id":"W4319865692","doi":"10.1109/lcomm.2023.3241007","title":"Age Minimization in Outdoor and Indoor Communications With Relay-Aided Dual RIS","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Sichuan Province; Natural Science Foundation of Shenzhen City","keywords":"Relay; Computer science; Wireless; Scheduling (production processes); Minification; Iterative method; Mathematical optimization; Convex optimization; Wireless network; Regular polygon; Dual (grammatical number); Algorithm; Mathematics; Telecommunications","score_opus":0.0332817607812193,"score_gpt":0.26526376037894406,"score_spread":0.23198199959772475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319865692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19643745,0.00020819847,0.6374089,0.15718749,0.00025017853,0.0011737378,0.000023620598,0.0013358265,0.0059745633],"genre_scores_gemma":[0.7374913,0.0005629702,0.25930324,0.0021283617,0.000011588036,0.00018302686,0.00019740549,0.000019912555,0.00010220425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868906,0.00023555414,0.00042168645,0.00020734989,0.00022167574,0.00022466057],"domain_scores_gemma":[0.9960603,0.0003913672,0.00021062332,0.0031760628,0.00009408009,0.000067576424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040415543,0.00014001918,0.0001423278,0.0005171197,0.00040291034,0.00023514683,0.0019708502,0.00007003672,0.0000036791541],"category_scores_gemma":[0.00007597547,0.0001479217,0.000027033297,0.0016881091,0.0003009178,0.0013047963,0.00076537696,0.00027584308,0.000094969095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001601355,0.0013542984,0.04515644,0.0003045328,0.0005033718,0.00018967,0.14425,0.27143958,0.01146103,0.25893682,0.14987858,0.116365544],"study_design_scores_gemma":[0.0013323348,0.00005236929,0.018549077,0.00011498232,0.00001723293,0.000037500322,0.00062198855,0.9705115,0.00028116268,0.00024663098,0.0077892053,0.00044603072],"about_ca_topic_score_codex":0.000068727524,"about_ca_topic_score_gemma":0.00022423158,"teacher_disagreement_score":0.6990719,"about_ca_system_score_codex":0.00007126749,"about_ca_system_score_gemma":0.000054522156,"threshold_uncertainty_score":0.60320723},"labels":[],"label_agreement":null},{"id":"W4319880342","doi":"10.1109/lcomm.2023.3239770","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Institut National des Sciences Appliquées de Lyon; Shenzhen University; Xiamen University; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Università di Bologna; National Chiao Tung University; Universidade de Coimbra; University of Electronic Science and Technology of China; Xidian University; National and Kapodistrian University of Athens; Sun Yat-sen University; Beijing Institute of Technology; University of Science and Technology of China; Beijing Jiaotong University; Chinese University of Hong Kong; Zhejiang University; Southwest Jiaotong University; National University of Singapore; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; Jinan University; Eidgenössische Technische Hochschule Zürich; Shanghai Educational Development Foundation; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università degli Studi Mediterranea di Reggio Calabria; Chalmers Tekniska Högskola; Scuola Superiore Sant'Anna; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; King Abdullah University of Science and Technology; Oulun Yliopisto; Pohang University of Science and Technology; Université du Luxembourg; Syracuse University; Beijing University of Posts and Telecommunications; Beihang University; University of Surrey; Vrije Universiteit Amsterdam; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Sussex; University of Glasgow; York University; Northumbria University; Centre National de la Recherche Scientifique; Deutsches Zentrum für Luft- und Raumfahrt; King's College London; Southeast University; Kungliga Tekniska Högskolan; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; Princeton University; Universidad de Cantabria; Memorial University of Newfoundland; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319880342","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4319993335","doi":"10.1109/lcomm.2023.3239823","title":"Iterative Semi-Coherent Receiver for Coded LoRa Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Demodulation; Decoding methods; Algorithm; Channel (broadcasting); Coding (social sciences); Electronic engineering; Mathematics; Telecommunications; Statistics","score_opus":0.054212969668166,"score_gpt":0.2953979791043153,"score_spread":0.24118500943614932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319993335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11392844,0.0040176003,0.7291989,0.033147205,0.01032345,0.07199147,0.0011426008,0.009739882,0.026510473],"genre_scores_gemma":[0.96951914,0.0002642702,0.0027728768,0.0006911843,0.0003629946,0.02538801,0.00036074364,0.0000916602,0.0005491508],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993343,0.00006912434,0.00020895858,0.000103932776,0.00006559216,0.0002180911],"domain_scores_gemma":[0.9986192,0.00029251142,0.000034588655,0.0009666125,0.000046222147,0.000040878436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001845021,0.00011773194,0.0001397947,0.00008167888,0.0001823202,0.0000855675,0.0005373711,0.000055100438,0.0000074396835],"category_scores_gemma":[0.000008200037,0.00012154324,0.0000598926,0.0002931436,0.00004685168,0.000096987584,0.000044508593,0.0001640792,0.00013777943],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103393095,0.000021883863,0.00013114445,0.00015841215,0.00014415682,0.0000010504327,0.0013883114,0.28640476,0.028066572,0.001847917,0.67880815,0.0030172875],"study_design_scores_gemma":[0.00041125805,0.000017371272,0.00008376123,0.00014622624,0.00001604615,0.0000011972367,0.000072855655,0.5513465,0.0009242831,0.00014022863,0.4466023,0.0002379681],"about_ca_topic_score_codex":0.00001295907,"about_ca_topic_score_gemma":0.00000974145,"teacher_disagreement_score":0.8555907,"about_ca_system_score_codex":0.00007186527,"about_ca_system_score_gemma":0.00000705875,"threshold_uncertainty_score":0.49563897},"labels":[],"label_agreement":null},{"id":"W4321065828","doi":"10.1109/lcomm.2021.3053853","title":"IEEE Communications Letters Publication Information","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of West Attica; National Technical University of Athens; National Institute of Informatics; Université Paris 13; Institut National des Sciences Appliquées de Lyon; University of Science and Technology Beijing; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; University of Science and Technology of China; Beijing Jiaotong University; South China University of Technology; Université de Bretagne Occidentale; Tsinghua University; Heriot-Watt University; Jinan University; Southwest Jiaotong University; Koç Üniversitesi; Universidade de Coimbra; Queen's University; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; Istanbul Teknik Üniversitesi; Chalmers Tekniska Högskola; Syracuse University; Beijing University of Posts and Telecommunications; Sun Yat-sen University; Università degli Studi di Firenze; Hanyang University; Southeast University; Indian Institute of Technology, Patna; Ulster University; University of the West of Scotland; Scuola Superiore Sant'Anna; King Fahd University of Petroleum and Minerals; Amirkabir University of Technology; Indian Institute of Technology Kanpur; Loughborough University; University of Alberta; Universitat Pompeu Fabra; York University; Northumbria University; University of Ottawa; Trường Đại học Bách Khoa Hà Nội; King Abdullah University of Science and Technology; Nanjing University; Pohang University of Science and Technology; University of South Alabama; University of Electronic Science and Technology of China; Soongsil University; National University of Singapore; Università di Bologna; Università degli Studi di Napoli Parthenope; Deakin University; University of Macedonia; ZTE Corporation; Indian Institute of Technology Indore; Santa Clara University; Chinese University of Hong Kong; Università degli Studi di Napoli Federico II; Universidade Nova de Lisboa; Villanova University; Qatar University; Indian Institute of Technology Delhi; Nanjing University of Posts and Telecommunications; University of Ontario Institute of Technology; Queen Mary University of London; Universidad de Cantabria; Trường Đại học Duy Tân; Indian National Science Academy; Western Michigan University; National Sun Yat-sen University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04242130665743279,"score_gpt":0.2835725961022919,"score_spread":0.2411512894448591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321065828","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428446,0.00044032864,0.4741727,0.5030341,0.0013378194,0.00037793294,0.000019876534,0.0009620561,0.004226696],"genre_scores_gemma":[0.8451891,0.00037912474,0.122189365,0.031088993,0.00007883146,0.00048310595,0.0003871212,0.000019012787,0.00018535642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.0004993842,0.0007567204,0.00031966047,0.00031353164,0.0003665823],"domain_scores_gemma":[0.9875335,0.00036953893,0.00041987447,0.010974176,0.00058281847,0.00012009605],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202584,0.00021291808,0.0002244881,0.00045283846,0.00096462615,0.0005816546,0.0070462143,0.00015138653,0.000019661218],"category_scores_gemma":[0.00020206843,0.0002483212,0.00012322867,0.0017412576,0.00040874173,0.0030796188,0.00082009315,0.0005688501,0.0010947289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047819117,0.0006084597,0.0032368712,0.000058841117,0.0002197748,0.000003198487,0.008457025,0.0002240413,0.12163398,0.24309754,0.5682962,0.054159306],"study_design_scores_gemma":[0.00064578565,0.000016860036,0.0050898474,0.00007435846,0.000038024824,0.0001716066,0.0006251422,0.01217894,0.012505296,0.0007504133,0.96718884,0.0007148687],"about_ca_topic_score_codex":0.00007413689,"about_ca_topic_score_gemma":0.000054459004,"teacher_disagreement_score":0.8297607,"about_ca_system_score_codex":0.00021679532,"about_ca_system_score_gemma":0.00022704921,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4323656575","doi":"10.1109/lcomm.2023.3248242","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Shenzhen University; Xiamen University; Zayed University; Università di Pisa; Technische Universität Berlin; Università degli Studi di Torino; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; Universidade Nova de Lisboa; Xidian University; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Chinese University of Hong Kong; Zhejiang University; Southwest Jiaotong University; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; King Abdullah University of Science and Technology; Jinan University; University of Akron; Vrije Universiteit Amsterdam; South China University of Technology; University of Surrey; Eidgenössische Technische Hochschule Zürich; Shanghai Educational Development Foundation; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Polytechnique Montréal; University College Dublin; University of Sydney; Université du Luxembourg; Intel Corporation; Al-Hussein Bin Talal University; King's College London; Beihang University; Dublin City University; Universidade de Coimbra; University of Hertfordshire; Coventry University; Universidad de Cantabria; Trường Đại học Duy Tân; Memorial University of Newfoundland; York University; University of Glasgow; University of Sussex; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Syracuse University; Princeton University; University of Electronic Science and Technology of China; University of Science and Technology of China; Beijing Jiaotong University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323656575","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4366590636","doi":"10.1109/lcomm.2023.3264429","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Shenzhen University; Xiamen University; Zayed University; Università di Pisa; Technische Universität Berlin; Università degli Studi di Torino; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; Universidade Nova de Lisboa; Xidian University; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Chinese University of Hong Kong; Zhejiang University; Southwest Jiaotong University; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; King Abdullah University of Science and Technology; Jinan University; University of Akron; Vrije Universiteit Amsterdam; South China University of Technology; University of Surrey; Eidgenössische Technische Hochschule Zürich; Shanghai Educational Development Foundation; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Polytechnique Montréal; University College Dublin; University of Sydney; Université du Luxembourg; Intel Corporation; Al-Hussein Bin Talal University; King's College London; Beihang University; Dublin City University; Universidade de Coimbra; University of Hertfordshire; Coventry University; Universidad de Cantabria; Trường Đại học Duy Tân; Memorial University of Newfoundland; York University; University of Glasgow; University of Sussex; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Syracuse University; Princeton University; University of Electronic Science and Technology of China; University of Science and Technology of China; Beijing Jiaotong University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366590636","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4366957393","doi":"10.1109/lcomm.2023.3269739","title":"Capacity Region of Asynchronous Multiple Access Channels With FTN","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Asynchronous communication; Computer science; Channel capacity; Channel (broadcasting); Power (physics); Computer network; Physics","score_opus":0.06986111955359676,"score_gpt":0.27364339798742265,"score_spread":0.2037822784338259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366957393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7407362,0.00030975958,0.24729523,0.007037861,0.00016918244,0.0004376064,0.000020136362,0.0033948454,0.0005992051],"genre_scores_gemma":[0.9865241,0.001337247,0.011729847,0.00009715167,0.000011458688,0.00021171184,0.000035274756,0.000044492524,0.000008713132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992071,0.000055769804,0.00026122268,0.00013150583,0.00012321485,0.0002212369],"domain_scores_gemma":[0.9961323,0.00034023225,0.000099837554,0.0033293727,0.000066373475,0.00003187298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009377444,0.00014980201,0.00019633092,0.00029175525,0.0001601203,0.00002824802,0.002381989,0.00007210159,0.000002244966],"category_scores_gemma":[0.000050761606,0.00015244677,0.00004315669,0.00096020853,0.00042878927,0.00032971907,0.00031874576,0.0003196875,0.000029986528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000128443,0.00008345416,0.0056902557,0.00015296003,0.00015405458,0.000005363021,0.0011691286,0.8885205,0.07624599,0.0014925681,0.007038325,0.01943458],"study_design_scores_gemma":[0.0023799979,0.00013261002,0.02164673,0.0007338375,0.00007497443,0.00007229061,0.001286818,0.5561923,0.3889367,0.0021961636,0.024462558,0.0018850217],"about_ca_topic_score_codex":0.000045382185,"about_ca_topic_score_gemma":0.000076859935,"teacher_disagreement_score":0.33232817,"about_ca_system_score_codex":0.0000887703,"about_ca_system_score_gemma":0.000009896581,"threshold_uncertainty_score":0.6216599},"labels":[],"label_agreement":null},{"id":"W4376105892","doi":"10.1109/lcomm.2023.3271100","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Shenzhen University; Xiamen University; Zayed University; Università di Pisa; Technische Universität Berlin; Università degli Studi di Torino; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; Universidade Nova de Lisboa; Xidian University; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Chinese University of Hong Kong; Zhejiang University; Southwest Jiaotong University; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; King Abdullah University of Science and Technology; Jinan University; University of Akron; Vrije Universiteit Amsterdam; South China University of Technology; University of Surrey; Eidgenössische Technische Hochschule Zürich; Shanghai Educational Development Foundation; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Polytechnique Montréal; University College Dublin; University of Sydney; Université du Luxembourg; Intel Corporation; Al-Hussein Bin Talal University; King's College London; Beihang University; Dublin City University; Universidade de Coimbra; University of Hertfordshire; Coventry University; Universidad de Cantabria; Trường Đại học Duy Tân; Memorial University of Newfoundland; York University; University of Glasgow; University of Sussex; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Syracuse University; Princeton University; University of Electronic Science and Technology of China; University of Science and Technology of China; Beijing Jiaotong University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376105892","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4376455162","doi":"10.1109/lcomm.2023.3274656","title":"ED-Based Spectrum Sensing for the Satellite Communication Networks Using Phased-Array Antennas","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; False alarm; Communications satellite; Satellite; Signal-to-noise ratio (imaging); Electronic engineering; Spectrum management; Phased array; Remote sensing; Telecommunications; Wireless; Cognitive radio; Antenna (radio); Artificial intelligence; Physics; Engineering; Geography","score_opus":0.04861015690349541,"score_gpt":0.29301993424736766,"score_spread":0.24440977734387226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376455162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004320035,0.0020218561,0.93128777,0.060540922,0.00059530954,0.000593186,0.000005251631,0.00045284073,0.00018285091],"genre_scores_gemma":[0.90652084,0.0014932199,0.08693612,0.0046637473,0.0002568262,0.000022493074,0.000048557937,0.000043827622,0.000014336801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979457,0.00043933428,0.00042747674,0.00037395977,0.00022589529,0.0005876052],"domain_scores_gemma":[0.9924165,0.0030268554,0.00024389292,0.0040991744,0.0001320566,0.00008150293],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011022098,0.00024374042,0.00024045784,0.00022858851,0.0020188857,0.0004949744,0.0025618805,0.00007584006,0.0000016292014],"category_scores_gemma":[0.00005802965,0.00021879394,0.00021156445,0.001450096,0.0003700969,0.000332047,0.00017525806,0.00044370262,0.000018378994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013559601,0.00036857615,0.0010128351,0.00007364696,0.0007443171,0.00002717379,0.0037969935,0.33346516,0.28765854,0.021274665,0.02340992,0.32803258],"study_design_scores_gemma":[0.0004136255,0.000017488272,0.0004499469,0.000109275665,0.000046220768,0.00002022869,0.000071885974,0.9778658,0.0016130037,0.0004326114,0.018674362,0.0002855231],"about_ca_topic_score_codex":0.00011078077,"about_ca_topic_score_gemma":0.00015670287,"teacher_disagreement_score":0.9022008,"about_ca_system_score_codex":0.00015208154,"about_ca_system_score_gemma":0.00007057096,"threshold_uncertainty_score":0.99928033},"labels":[],"label_agreement":null},{"id":"W4379984027","doi":"10.1109/lcomm.2023.3280024","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Shenzhen University; Xiamen University; Zayed University; Università di Pisa; Technische Universität Berlin; Università degli Studi di Torino; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; Universidade Nova de Lisboa; Xidian University; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Chinese University of Hong Kong; Zhejiang University; Southwest Jiaotong University; Orta Doğu Teknik Üniversitesi; Indian Institute of Technology Indore; Santa Clara University; Khalifa University of Science, Technology and Research; King Abdullah University of Science and Technology; Jinan University; University of Akron; Vrije Universiteit Amsterdam; South China University of Technology; University of Surrey; Eidgenössische Technische Hochschule Zürich; Shanghai Educational Development Foundation; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Polytechnique Montréal; University College Dublin; University of Sydney; Université du Luxembourg; Intel Corporation; Al-Hussein Bin Talal University; King's College London; Beihang University; Dublin City University; Universidade de Coimbra; University of Hertfordshire; Coventry University; Universidad de Cantabria; Trường Đại học Duy Tân; Memorial University of Newfoundland; York University; University of Glasgow; University of Sussex; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Syracuse University; Princeton University; University of Electronic Science and Technology of China; University of Science and Technology of China; Beijing Jiaotong University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379984027","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4380839029","doi":"10.1109/lcomm.2023.3286396","title":"NOMA Assisted Semi-Grant-Free Transmission Scheme in Satellite Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Nanjing University of Posts and Telecommunications","keywords":"Computer science; Telecommunications link; Throughput; Noma; Transmission (telecommunications); Computer network; Channel state information; Satellite system; Channel (broadcasting); Communications satellite; Interference (communication); Rician fading; Satellite; Telecommunications; Fading; Wireless; Global Positioning System; Engineering","score_opus":0.04145636773058244,"score_gpt":0.26390177378328084,"score_spread":0.22244540605269839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380839029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6745651,0.030184593,0.21511346,0.04628658,0.0010928822,0.002274086,0.0001414216,0.022259954,0.008081931],"genre_scores_gemma":[0.9667431,0.010931415,0.02164973,0.000101067555,0.000012875202,0.00032948115,0.0001171404,0.00006811124,0.000047083337],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986939,0.00012561654,0.00048861234,0.0001929095,0.00015446142,0.00034453114],"domain_scores_gemma":[0.9945153,0.00035948047,0.000065788314,0.0049701403,0.000036597303,0.000052708652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002574658,0.0002076558,0.00024981212,0.00054392207,0.00017286121,0.00005248768,0.0031293535,0.000145377,0.0000037051902],"category_scores_gemma":[0.000055669894,0.00023484895,0.000067840934,0.001528014,0.00019363541,0.00023911752,0.00029010288,0.00057978596,0.00012747572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007037869,0.00009504221,0.0030933488,0.00023233627,0.000088741195,0.000010224738,0.0009440265,0.20018421,0.6853973,0.0051536504,0.0077146664,0.09707939],"study_design_scores_gemma":[0.0019305451,0.000024265424,0.013894969,0.00090312614,0.000022762115,0.000020350495,0.0014494748,0.6698598,0.014234533,0.0013150551,0.29503265,0.0013124362],"about_ca_topic_score_codex":0.000051578256,"about_ca_topic_score_gemma":0.00005069516,"teacher_disagreement_score":0.6711628,"about_ca_system_score_codex":0.00018212918,"about_ca_system_score_gemma":0.000011608865,"threshold_uncertainty_score":0.95768625},"labels":[],"label_agreement":null},{"id":"W4381415977","doi":"10.1109/lcomm.2023.3287945","title":"Capacity Analysis of UAV Communications Under the Non-Ideal Transceiver Effects","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Confederation College; Lakehead University","funders":"","keywords":"Computer science; Fading; Rician fading; Trajectory; Transceiver; Channel (broadcasting); Communications system; Flexibility (engineering); MATLAB; Drone; Real-time computing; Telecommunications; Wireless; Mathematics; Statistics","score_opus":0.027210104694314365,"score_gpt":0.2528394183539714,"score_spread":0.22562931365965702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381415977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.699982,0.0004943953,0.26945636,0.023865657,0.00021127319,0.001028716,0.00016115927,0.0008521845,0.003948282],"genre_scores_gemma":[0.99231607,0.001069326,0.005608623,0.00042355838,0.000012558542,0.00026935452,0.00025234182,0.000026944726,0.000021214482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991067,0.00012662115,0.0003239293,0.000118193195,0.00014385686,0.00018071845],"domain_scores_gemma":[0.9953296,0.00069278915,0.00007079575,0.0037933236,0.0000722685,0.0000412153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026159792,0.00013117019,0.0002129046,0.000380146,0.00036784957,0.00003215287,0.0017289448,0.00006223473,0.000010718911],"category_scores_gemma":[0.000008937547,0.00011884066,0.00017266592,0.0030866622,0.00036480793,0.000107705426,0.00008924724,0.00025419545,0.000058228867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019944487,0.00007911823,0.0011701753,0.000042285876,0.0013224949,1.5203454e-7,0.0021096475,0.9191504,0.06163082,0.0047646426,0.007989503,0.0017387336],"study_design_scores_gemma":[0.0002166708,0.000006260591,0.07760769,0.000019946341,0.00084923895,5.9966334e-7,0.00017786093,0.9150661,0.001628735,0.00012556837,0.004095376,0.00020595557],"about_ca_topic_score_codex":0.00020836634,"about_ca_topic_score_gemma":0.0004791909,"teacher_disagreement_score":0.2923341,"about_ca_system_score_codex":0.00006293503,"about_ca_system_score_gemma":0.000011119928,"threshold_uncertainty_score":0.48461816},"labels":[],"label_agreement":null},{"id":"W4381748093","doi":"10.1109/lcomm.2023.3288483","title":"Robust Beamforming for IRS-Aided SWIPT in Cognitive Satellite and Terrestrial Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Nanjing University of Posts and Telecommunications","keywords":"Computer science; Beamforming; Maximum power transfer theorem; Robustness (evolution); Multicast; Transmitter power output; Base station; Computer network; Cognitive radio; Optimization problem; Wireless; Channel (broadcasting); Telecommunications; Power (physics); Transmitter; Algorithm","score_opus":0.08329329084454697,"score_gpt":0.291862092823448,"score_spread":0.20856880197890104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381748093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30710024,0.003507107,0.67662746,0.007436813,0.00040153007,0.0014523936,0.000042862204,0.0029730138,0.00045859767],"genre_scores_gemma":[0.96575415,0.008226123,0.025022576,0.00018488718,0.000030681702,0.00055253337,0.00018177551,0.000036010162,0.000011258568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991177,0.000046319365,0.00032301704,0.00015648414,0.00006314614,0.00029334408],"domain_scores_gemma":[0.9975018,0.0012434042,0.000058365018,0.0011424456,0.00002156846,0.000032454296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022403077,0.00015340636,0.00018966787,0.0003088666,0.00018588982,0.000042968513,0.0007808809,0.00010326865,9.2845005e-7],"category_scores_gemma":[0.000118490614,0.00018125663,0.000042011252,0.0006046326,0.00022804576,0.0002287997,0.00022732453,0.00037161235,0.000004761909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026167776,0.00002804994,0.0011411165,0.00003689872,0.00006536619,0.0000019451127,0.00079354714,0.82413995,0.0091308085,0.0006097367,0.0014424961,0.16258389],"study_design_scores_gemma":[0.0015140852,0.000023368979,0.002397991,0.0002615354,0.000022235847,0.000004544417,0.0013575352,0.9798845,0.0021876066,0.00080035196,0.011045886,0.00050036045],"about_ca_topic_score_codex":0.000012389203,"about_ca_topic_score_gemma":0.00012324675,"teacher_disagreement_score":0.6586539,"about_ca_system_score_codex":0.00008396288,"about_ca_system_score_gemma":0.0000075590924,"threshold_uncertainty_score":0.73914313},"labels":[],"label_agreement":null},{"id":"W4383752889","doi":"10.1109/lcomm.2023.3292859","title":"A New Design of CR-NOMA and Its Application to AoI Reduction","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Age of Information Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Noma; Computer science; Reduction (mathematics); Cognitive radio; Simple (philosophy); Scheme (mathematics); Computer network; Division (mathematics); Telecommunications link; Telecommunications; Wireless; Mathematics; Arithmetic","score_opus":0.038492276150741474,"score_gpt":0.273831604589912,"score_spread":0.23533932843917055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383752889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041273744,0.000034093962,0.9691845,0.025711833,0.00008429081,0.00044655983,0.000001399391,0.00023301221,0.00017692253],"genre_scores_gemma":[0.5205901,0.00013363146,0.47812563,0.0008475224,0.00002937154,0.00011912268,0.000020259547,0.000010666677,0.00012369991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921507,0.00008298586,0.00027858987,0.00014968499,0.00015482894,0.00011884694],"domain_scores_gemma":[0.99831367,0.000100647856,0.00014976774,0.0012515916,0.00010979507,0.000074553456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029831566,0.00007996039,0.00008910846,0.00031619033,0.00016139244,0.000059466987,0.001122354,0.0000356525,0.0000021782762],"category_scores_gemma":[0.000044981443,0.00009135684,0.000020138967,0.0011614943,0.00002885149,0.00074041117,0.00025584834,0.000073483636,0.00016099538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014959213,0.000048537284,0.00004471083,0.0000356509,0.000038204915,4.679777e-7,0.009939075,0.5198223,0.25701612,0.03350565,0.06756605,0.111968316],"study_design_scores_gemma":[0.0002294345,0.00003522443,0.0009368364,0.000027977876,0.000007513537,0.000011704391,0.000087776425,0.98206913,0.01312956,0.0004275727,0.0028611394,0.00017613074],"about_ca_topic_score_codex":0.000020603056,"about_ca_topic_score_gemma":0.0000012895049,"teacher_disagreement_score":0.51646274,"about_ca_system_score_codex":0.000043428445,"about_ca_system_score_gemma":0.0000443735,"threshold_uncertainty_score":0.37254238},"labels":[],"label_agreement":null},{"id":"W4383898714","doi":"10.1109/lcomm.2023.3284153","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Guwahati; Université Paris 13; Université Paris-Est Créteil Val-de-Marne; Shenzhen University; Xiamen University; Zayed University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; Università degli Studi di Torino; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Xidian University; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; University of Electronic Science and Technology of China; University of Science and Technology of China; Beijing Jiaotong University; Zhejiang University; Southwest Jiaotong University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Vrije Universiteit Amsterdam; South China University of Technology; University of Surrey; Shanghai Educational Development Foundation; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; China Mobile Research Institute; Chang'an University; Amirkabir University of Technology; Dublin City University; Beihang University; Polytechnique Montréal; University of Sydney; University College Dublin; Universidade de Coimbra; University of Hertfordshire; Nanjing University; Oulun Yliopisto; Trường Đại học Duy Tân; Memorial University of Newfoundland; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; York University; Universidade Nova de Lisboa; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Intel Corporation; Université du Luxembourg; University of Western Macedonia; Indian Institute of Technology Indore; Santa Clara University; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; Syracuse University; Università di Bologna; University of Sussex; City University of Hong Kong","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383898714","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4384080538","doi":"10.1109/lcomm.2023.3291721","title":"Intelligent Reflecting Surface Assisted Multi-Cluster AirComp via Dynamic Beamforming","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Science and Technology Planning Project of Guangdong Province; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Beamforming; Cluster (spacecraft); Computation; Resource allocation; Transmission (telecommunications); Algorithm; Computer network; Telecommunications","score_opus":0.07004593214470199,"score_gpt":0.3362426864870504,"score_spread":0.2661967543423484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384080538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1276019,0.0006649596,0.85677713,0.0078279255,0.0003360322,0.00041229546,0.000010628771,0.0061307536,0.00023833603],"genre_scores_gemma":[0.81487346,0.001192131,0.18329854,0.00026250217,0.000007655102,0.00010706319,0.00008506349,0.00008058438,0.000093013085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858534,0.000107371816,0.00050639693,0.00022613411,0.00015890869,0.0004158169],"domain_scores_gemma":[0.9956094,0.00050720974,0.00011126698,0.0036560749,0.000061382576,0.000054686825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002985682,0.00024689297,0.00023547017,0.00032660493,0.00046535116,0.0000569231,0.0023004508,0.000121001314,0.000006422619],"category_scores_gemma":[0.00007722766,0.00028817257,0.00009555363,0.0011304432,0.00023082415,0.00029584477,0.00061094563,0.0007213476,0.00034734377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023148698,0.00003853472,0.00022969198,0.00003831364,0.00007090152,0.0000015715317,0.0006175035,0.61869997,0.34359148,0.000062795414,0.0010056028,0.035641294],"study_design_scores_gemma":[0.00028236973,0.0000079772835,0.00086435897,0.00009724071,0.000013549757,0.000010310611,0.0006120094,0.9644421,0.023107572,0.00013693294,0.009991614,0.0004339777],"about_ca_topic_score_codex":0.000024226498,"about_ca_topic_score_gemma":0.0001731064,"teacher_disagreement_score":0.68727154,"about_ca_system_score_codex":0.00037116162,"about_ca_system_score_gemma":0.000010099532,"threshold_uncertainty_score":0.999957},"labels":[],"label_agreement":null},{"id":"W4385754936","doi":"10.1109/lcomm.2023.3295483","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Shenzhen University; Xiamen University; Zayed University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; Università degli Studi di Torino; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; Xidian University; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Southwest Jiaotong University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Vrije Universiteit Amsterdam; University of Akron; South China University of Technology; University of Surrey; Shanghai Educational Development Foundation; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Dublin City University; Beihang University; Polytechnique Montréal; University College Dublin; University of Sydney; Memorial University of Newfoundland; Trường Đại học Duy Tân; Trinity College Dublin; University of Hertfordshire; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; York University; Intel Corporation; Université du Luxembourg; University of Western Macedonia; Indian Institute of Technology Indore; Santa Clara University; University of Electronic Science and Technology of China; University of Science and Technology of China; Beijing Jiaotong University; Universidade Nova de Lisboa; Villanova University; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Munster Technological University; American University of Beirut; University of Sussex; City University of Hong Kong; Syracuse University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385754936","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4385757649","doi":"10.1109/lcomm.2023.3304324","title":"Ergodic Capacity Analysis for Cooperative Ambient Communication System Under Sensitivity Constraint","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Backscatter (email); Computer science; Sensitivity (control systems); Ergodic theory; Wireless; Transmission (telecommunications); Electronic engineering; Topology (electrical circuits); Telecommunications; Electrical engineering; Mathematics","score_opus":0.044075511916942756,"score_gpt":0.2538176277358139,"score_spread":0.20974211581887114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385757649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5633358,0.000118041906,0.4307271,0.002586399,0.00026069063,0.00043633112,0.000128201,0.0017948952,0.00061257667],"genre_scores_gemma":[0.9893459,0.0001398906,0.009288308,0.00031590933,0.000040181276,0.00033988917,0.0004601743,0.000047727503,0.000022009977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984357,0.00046056425,0.0004007269,0.00021464928,0.00015614516,0.000332241],"domain_scores_gemma":[0.99576837,0.0015047651,0.00009419605,0.0023916368,0.00015517519,0.00008587428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080888544,0.00021243688,0.00033461585,0.00032018818,0.0005368665,0.00009139556,0.0006549989,0.000109333545,0.0000025096713],"category_scores_gemma":[0.00005168869,0.0002439117,0.00017689347,0.0014979119,0.00039610447,0.00014129304,0.00012332626,0.0003637677,0.000038452523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021280352,0.000017811917,0.00035930975,0.000039408482,0.0005570714,0.0000010305816,0.00037524168,0.9700818,0.019278541,0.006346689,0.002751373,0.00018960123],"study_design_scores_gemma":[0.0002553396,0.0000072583152,0.004688372,0.00010034714,0.0002722757,0.000006319851,0.00049322215,0.9907666,0.0021231226,0.000020095553,0.0009582921,0.0003087784],"about_ca_topic_score_codex":0.00014698083,"about_ca_topic_score_gemma":0.0010161276,"teacher_disagreement_score":0.42601013,"about_ca_system_score_codex":0.00036301138,"about_ca_system_score_gemma":0.000019648414,"threshold_uncertainty_score":0.99464303},"labels":[],"label_agreement":null},{"id":"W4386609074","doi":"10.1109/lcomm.2023.3304431","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Shenzhen University; Xiamen University; Zayed University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; Xidian University; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Southwest Jiaotong University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Vrije Universiteit Amsterdam; University of Akron; South China University of Technology; University of Surrey; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Dublin City University; Beihang University; Polytechnique Montréal; University College Dublin; University of Sydney; Memorial University of Newfoundland; Trường Đại học Duy Tân; Trinity College Dublin; University of Hertfordshire; Universidade de Coimbra; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; York University; Intel Corporation; Université du Luxembourg; University of Western Macedonia; Santa Clara University; University of Electronic Science and Technology of China; University of Science and Technology of China; Beijing Jiaotong University; Universidade Nova de Lisboa; Villanova University; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Munster Technological University; American University of Beirut; University of Sussex; City University of Hong Kong; Syracuse University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386609074","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4386702634","doi":"10.1109/lcomm.2023.3315010","title":"InP-CRS: An Intra-Platoon Cooperative Resource Selection Scheme for C-V2X Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundamental Research Funds for the Central Universities; Simon Fraser University","keywords":"Platoon; Computer science; Scheme (mathematics); Computer network; Scheduling (production processes); Network packet; Selection (genetic algorithm); Resource (disambiguation); Distributed computing; Real-time computing; Engineering; Artificial intelligence; Control (management); Mathematics","score_opus":0.02597482159863401,"score_gpt":0.26314707509076357,"score_spread":0.23717225349212956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386702634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6458504,0.0008562309,0.33832702,0.0073718224,0.00077373214,0.0017686918,0.000049310984,0.004159863,0.00084292085],"genre_scores_gemma":[0.98406595,0.00023656018,0.012253187,0.0014998078,0.00039599836,0.0005388376,0.00079398527,0.00013349399,0.00008215499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986866,0.00016037148,0.00031500868,0.00023786689,0.00012876836,0.00047139524],"domain_scores_gemma":[0.9981308,0.0003068731,0.00005189571,0.0013184164,0.00007956607,0.000112436355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040706442,0.00022028762,0.00020694472,0.00017973622,0.0005193476,0.00014993912,0.0008172721,0.0001459188,0.000011676894],"category_scores_gemma":[0.0000329,0.00025913867,0.00007615573,0.00094087474,0.00013659526,0.0003017891,0.00007988899,0.00054527144,0.00008319426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008081517,0.00001860888,0.0000816738,0.000011858522,0.00007347193,8.747089e-7,0.0003674854,0.891666,0.0155140245,0.00018231175,0.090238534,0.0018370685],"study_design_scores_gemma":[0.00029604975,0.00003077991,0.00018354776,0.000035417008,0.000022725155,0.0000073116216,0.00008408422,0.8952875,0.0008609372,0.00001929895,0.10291103,0.00026128846],"about_ca_topic_score_codex":0.000017444167,"about_ca_topic_score_gemma":0.00021814696,"teacher_disagreement_score":0.33821556,"about_ca_system_score_codex":0.0001730766,"about_ca_system_score_gemma":0.000020900548,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W4387092561","doi":"10.1109/lcomm.2023.3320035","title":"Multi-Tag Localization in Cooperative AmBC","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Alberta","funders":"Huawei Technologies","keywords":"Computer science; SIGNAL (programming language); Backscatter (email); Subspace topology; Multiple signal classification; Signal subspace; Radio frequency; Power (physics); Direction of arrival; Signal-to-noise ratio (imaging); Algorithm; Speech recognition; Telecommunications; Artificial intelligence; Wireless; Antenna (radio); Noise (video)","score_opus":0.03590839213080798,"score_gpt":0.27289293883012383,"score_spread":0.23698454669931585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387092561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24920163,0.0007766434,0.72300136,0.012678136,0.0011065785,0.0011015399,0.00005694944,0.009039213,0.0030379423],"genre_scores_gemma":[0.9964418,0.00068633154,0.0018932634,0.0006675148,0.000012170895,0.00011697459,0.00010544516,0.000029701381,0.000046835445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934757,0.000053091375,0.00022311127,0.00010556226,0.00007880031,0.00019188436],"domain_scores_gemma":[0.99902546,0.00007902796,0.000020179743,0.00081786455,0.000036532183,0.000020925654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115411356,0.00010772705,0.00011117337,0.0003402844,0.00012365093,0.00003195202,0.0005541071,0.000076094606,0.000010077429],"category_scores_gemma":[0.000049793212,0.00011864271,0.000026846188,0.0012391004,0.00012660795,0.00013957573,0.000072145594,0.00019683852,0.0002812897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016711649,0.000032077707,0.0027462943,0.000024110825,0.00002132374,0.0000048601305,0.0012373806,0.9361528,0.031301316,0.0009843814,0.025322083,0.0021716782],"study_design_scores_gemma":[0.00038122715,0.0000056489703,0.0021534811,0.000035365876,0.0000048467164,0.0000012563376,0.0004363652,0.9677966,0.011566126,0.00003819603,0.017368078,0.0002127943],"about_ca_topic_score_codex":0.000025016447,"about_ca_topic_score_gemma":0.00020360958,"teacher_disagreement_score":0.7472401,"about_ca_system_score_codex":0.000094788404,"about_ca_system_score_gemma":0.000008335323,"threshold_uncertainty_score":0.48381093},"labels":[],"label_agreement":null},{"id":"W4387490514","doi":"10.1109/lcomm.2023.3317549","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Shenzhen University; Xiamen University; Zayed University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; Università Politecnica delle Marche; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Southwest Jiaotong University; Universidade de Coimbra; University of Hertfordshire; Queen's University; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Chang'an University; Amirkabir University of Technology; Vrije Universiteit Amsterdam; University of Akron; South China University of Technology; University of Surrey; Xidian University; Kyung Hee University; Dublin City University; Beihang University; Polytechnique Montréal; University College Dublin; University of Sydney; Memorial University of Newfoundland; Trường Đại học Duy Tân; Trinity College Dublin; King's College London; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; Intel Corporation; Université du Luxembourg; University of Western Macedonia; Université Mohammed V de Rabat; Santa Clara University; University of Electronic Science and Technology of China; University of Science and Technology of China; Aristotle University of Thessaloniki; Beijing Jiaotong University; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; Munster Technological University; American University of Beirut; University of Sussex; City University of Hong Kong; Syracuse University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387490514","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4388505095","doi":"10.1109/lcomm.2023.3331216","title":"Deep Recurrent Reinforcement Learning for Partially Observable User Association in a Vertical Heterogenous Network","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Reinforcement learning; Base station; Scalability; Association (psychology); Wireless network; Computer network; Deep learning; Channel state information; Wireless; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.03345750505697552,"score_gpt":0.26528527616802156,"score_spread":0.23182777111104602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388505095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053746045,0.00033534484,0.94111115,0.001990053,0.0007741464,0.00102736,0.0000020344612,0.00081923214,0.00019465729],"genre_scores_gemma":[0.98739433,0.00044093814,0.010591669,0.00024726085,0.00010665902,0.0008427793,0.00022920418,0.000058371246,0.0000887771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988621,0.00009911917,0.00039532807,0.00013036226,0.00011539663,0.0003977147],"domain_scores_gemma":[0.99891067,0.0003547716,0.000056167206,0.0005832807,0.00005207813,0.000043014035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040152276,0.00012105305,0.00016437843,0.00009473274,0.00018132852,0.00004090233,0.00032956674,0.00007555232,0.0000033659173],"category_scores_gemma":[0.00012387082,0.00015031928,0.000056385437,0.00049074524,0.000015606507,0.00018335441,0.000059113027,0.00023121308,0.00006009878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063219677,0.000009806808,0.0023355926,0.000025613203,0.000030856576,4.4114304e-7,0.0003990564,0.9915511,0.0020982581,0.000084687985,0.0029399197,0.00051836966],"study_design_scores_gemma":[0.000373243,0.000020359552,0.000602624,0.000060009006,0.0000149697025,4.3954068e-7,0.000038930455,0.98563606,0.00023230584,0.000027959077,0.012834462,0.00015862634],"about_ca_topic_score_codex":0.000013297925,"about_ca_topic_score_gemma":0.0002830059,"teacher_disagreement_score":0.9336483,"about_ca_system_score_codex":0.0005617063,"about_ca_system_score_gemma":0.000011141477,"threshold_uncertainty_score":0.6129842},"labels":[],"label_agreement":null},{"id":"W4388562399","doi":"10.1109/lcomm.2023.3326320","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Shenzhen University; Xiamen University; Zayed University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Southwest Jiaotong University; Universidade de Coimbra; University of Hertfordshire; Queen's University; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Chang'an University; Amirkabir University of Technology; Vrije Universiteit Amsterdam; University of Akron; South China University of Technology; University of Surrey; Xidian University; Kyung Hee University; Dublin City University; Beihang University; Polytechnique Montréal; University College Dublin; University of Sydney; Memorial University of Newfoundland; Trường Đại học Duy Tân; Trinity College Dublin; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; Université du Luxembourg; Intel Corporation; Università Politecnica delle Marche; University of Western Macedonia; Université Mohammed V de Rabat; Santa Clara University; University of Electronic Science and Technology of China; University of Science and Technology of China; Aristotle University of Thessaloniki; Beijing Jiaotong University; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; Munster Technological University; American University of Beirut; University of Sussex; City University of Hong Kong; Syracuse University","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388562399","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4389610477","doi":"10.1109/lcomm.2023.3334051","title":"IEEE Communications Letters Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Shenzhen University; Xiamen University; Zayed University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Southwest Jiaotong University; Universidade de Coimbra; University of Hertfordshire; Queen's University; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Chang'an University; Amirkabir University of Technology; Vrije Universiteit Amsterdam; University of Akron; South China University of Technology; University of Surrey; Xidian University; Kyung Hee University; Dublin City University; Beihang University; Polytechnique Montréal; University College Dublin; University of Sydney; Memorial University of Newfoundland; Trường Đại học Duy Tân; Trinity College Dublin; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; Université du Luxembourg; Intel Corporation; Università Politecnica delle Marche; University of Western Macedonia; Université Mohammed V de Rabat; Santa Clara University; University of Electronic Science and Technology of China; University of Science and Technology of China; Aristotle University of Thessaloniki; Beijing Jiaotong University; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; Munster Technological University; American University of Beirut; University of Sussex; City University of Hong Kong; Syracuse University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.05436156582273634,"score_gpt":0.29655615011645897,"score_spread":0.24219458429372265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389610477","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741269,0.00014035395,0.29507205,0.65750605,0.0018939778,0.00079262385,0.00003047466,0.0037403046,0.0034114772],"genre_scores_gemma":[0.9446389,0.00036225352,0.036042985,0.017300224,0.00008200802,0.0008862861,0.0004635589,0.000023283901,0.00020050709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978186,0.00037017852,0.0007398818,0.00029461415,0.00033728976,0.0004394533],"domain_scores_gemma":[0.9889104,0.00045071944,0.00041635317,0.009804765,0.00030067057,0.00011709246],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009872161,0.00021595578,0.0002091727,0.0010389934,0.0010972623,0.00047476537,0.009183225,0.0001483181,0.0000089947225],"category_scores_gemma":[0.00016487994,0.0002424057,0.000111608635,0.0030758616,0.00045465678,0.003093304,0.0008496998,0.0005204516,0.0042487397],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003253118,0.0001614565,0.0020586234,0.00003338899,0.0001000031,8.4899614e-7,0.0065623494,0.00029846557,0.032076858,0.095204175,0.8307241,0.032776468],"study_design_scores_gemma":[0.0006258797,0.000025334659,0.011726063,0.000068441324,0.000029177829,0.00004981469,0.0006561924,0.045167662,0.0025292023,0.0009617153,0.9373959,0.0007646501],"about_ca_topic_score_codex":0.000106994354,"about_ca_topic_score_gemma":0.000031133157,"teacher_disagreement_score":0.9072262,"about_ca_system_score_codex":0.00018744601,"about_ca_system_score_gemma":0.000109804765,"threshold_uncertainty_score":0.99652654},"labels":[],"label_agreement":null},{"id":"W4390604537","doi":"10.1109/lcomm.2024.3350378","title":"Fair Wireless Federated Learning Through the Identification of a Common Descent Direction","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Descent (aeronautics); Wireless; Identification (biology); Minification; Federated learning; Stochastic gradient descent; Gradient descent; Wireless network; Algorithm; Data mining; Computer network; Artificial intelligence; Machine learning; Telecommunications; Artificial neural network; World Wide Web","score_opus":0.04716151527323351,"score_gpt":0.30832199491885703,"score_spread":0.2611604796456235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390604537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053498853,0.0009165409,0.73449385,0.20857418,0.0005547132,0.00026844724,0.0000069034368,0.0013613539,0.00032516237],"genre_scores_gemma":[0.978565,0.00049932435,0.020429093,0.0003382172,0.000016758786,0.00008095609,0.000027687454,0.000014334678,0.00002865201],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844587,0.00039695547,0.00044787308,0.00029603686,0.00023260411,0.0001806367],"domain_scores_gemma":[0.98988485,0.0005483674,0.00018758258,0.009288791,0.000074739146,0.000015663096],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006281191,0.000122018406,0.00012955314,0.000120396406,0.0005648004,0.00043447383,0.019878807,0.00006633935,0.0000016845287],"category_scores_gemma":[0.00094145053,0.0001023576,0.000065123306,0.0010850286,0.00032758454,0.0007887394,0.012970138,0.00057472585,0.000037430786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071176523,0.00027962524,0.00057002873,0.00014113553,0.0002345523,0.0000069029097,0.0035140952,0.0013007139,0.5384629,0.027079139,0.24393286,0.18447098],"study_design_scores_gemma":[0.0001093069,0.000023178083,0.00092482154,0.00021136933,0.000028389179,0.00002223215,0.0002393034,0.90191287,0.060865533,0.014235049,0.021189602,0.00023832676],"about_ca_topic_score_codex":0.00026322258,"about_ca_topic_score_gemma":0.000052960102,"teacher_disagreement_score":0.9250661,"about_ca_system_score_codex":0.0001351844,"about_ca_system_score_gemma":0.000036104193,"threshold_uncertainty_score":0.99501276},"labels":[],"label_agreement":null},{"id":"W4390659319","doi":"10.1109/lcomm.2023.3343049","title":"IEEE Communications Letters Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Shenzhen University; Xiamen University; Zayed University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; Università di Bologna; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Southwest Jiaotong University; Universidade de Coimbra; University of Hertfordshire; Queen's University; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Chang'an University; Amirkabir University of Technology; Vrije Universiteit Amsterdam; University of Akron; South China University of Technology; University of Surrey; Xidian University; Kyung Hee University; Dublin City University; Beihang University; Polytechnique Montréal; University College Dublin; University of Sydney; Memorial University of Newfoundland; Trường Đại học Duy Tân; Trinity College Dublin; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; Université du Luxembourg; Intel Corporation; Università Politecnica delle Marche; University of Western Macedonia; Université Mohammed V de Rabat; Santa Clara University; University of Electronic Science and Technology of China; University of Science and Technology of China; Aristotle University of Thessaloniki; Beijing Jiaotong University; Southeast University; Kungliga Tekniska Högskolan; Università degli Studi Mediterranea di Reggio Calabria; Universidade Nova de Lisboa; Villanova University; Queen Mary University of London; Munster Technological University; American University of Beirut; University of Sussex; City University of Hong Kong; Syracuse University","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04030668573795067,"score_gpt":0.29264944787512476,"score_spread":0.2523427621371741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068571423,0.00089029217,0.53340477,0.45077723,0.0020913891,0.0004885774,0.000021729498,0.002099408,0.0033694534],"genre_scores_gemma":[0.93017447,0.0003733971,0.054287188,0.014027228,0.00010531986,0.0006340277,0.00021667352,0.000022454786,0.00015926015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797106,0.00032029697,0.0007228155,0.00032632943,0.0003020088,0.0003574952],"domain_scores_gemma":[0.99060893,0.0004540759,0.00022243663,0.00837561,0.00023096247,0.000107985536],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008104092,0.00022518214,0.00019065262,0.00086331007,0.00076577923,0.0010580933,0.0077940184,0.00014888044,0.000014489668],"category_scores_gemma":[0.00009062838,0.00024019592,0.00012771366,0.0018635718,0.00045483388,0.0041929577,0.0005904564,0.00066500914,0.002278534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002449591,0.00016085252,0.00043764725,0.00007934841,0.00015237262,0.0000013813184,0.007159729,0.00011098647,0.03021889,0.28977937,0.6039727,0.06792429],"study_design_scores_gemma":[0.00019191853,0.000015540674,0.00094426615,0.00010929665,0.00002855232,0.00007514149,0.00020758543,0.04068586,0.001599239,0.00071595504,0.9549795,0.00044716365],"about_ca_topic_score_codex":0.000104318875,"about_ca_topic_score_gemma":0.000026480737,"teacher_disagreement_score":0.9233173,"about_ca_system_score_codex":0.00026187918,"about_ca_system_score_gemma":0.0001602905,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W4391097015","doi":"10.1109/lcomm.2024.3357254","title":"Error Probability of Shadowed UAV-to-Ground Channels With Phase Noise","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Phase-shift keying; Channel (broadcasting); Keying; Computer science; Algorithm; Fading; Bit error rate; Phase (matter); Binary number; Telecommunications; Tikhonov regularization; Electronic engineering; Mathematics; Physics; Engineering; Mathematical analysis","score_opus":0.032279831576569606,"score_gpt":0.2799009691486149,"score_spread":0.2476211375720453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391097015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5995192,0.0004907463,0.3877737,0.008609215,0.00022890935,0.0010766153,0.000094548304,0.000705025,0.0015020596],"genre_scores_gemma":[0.96564215,0.000051602838,0.033552933,0.00020692551,0.000032107546,0.0003650603,0.000079096535,0.000036307712,0.000033797576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993285,0.000030897223,0.00024250719,0.00015534357,0.00010219235,0.00014054093],"domain_scores_gemma":[0.9984077,0.0000889214,0.000023787115,0.0013640056,0.00005533618,0.00006020205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013385575,0.0001214227,0.00012879279,0.00014527407,0.00008333593,0.00005959876,0.0004962548,0.000041165396,0.000025301642],"category_scores_gemma":[0.0000070034903,0.000115020506,0.00003666457,0.0006285209,0.000103516664,0.00016176446,0.000041383253,0.00016373454,0.0000476749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003354062,0.00047179477,0.00010568311,0.00041997485,0.00023160301,0.0000022113422,0.0039679855,0.7685688,0.19463511,0.0045004087,0.014610143,0.012452743],"study_design_scores_gemma":[0.00086052186,0.00012813776,0.00051993626,0.00028960028,0.00013871006,0.000012777096,0.00014229582,0.92530066,0.009159017,0.0002912125,0.06254533,0.0006118247],"about_ca_topic_score_codex":0.000039179118,"about_ca_topic_score_gemma":0.000038386344,"teacher_disagreement_score":0.366123,"about_ca_system_score_codex":0.00008374485,"about_ca_system_score_gemma":0.000020070287,"threshold_uncertainty_score":0.46904},"labels":[],"label_agreement":null},{"id":"W4391454334","doi":"10.1109/lcomm.2024.3361378","title":"Error Performance Analysis of UAV-Mounted RIS for NOMA Systems With Practical Constraints","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Global Affairs Canada; Natural Sciences and Engineering Research Council of Canada; Discovery Eye Foundation","keywords":"Noma; Computer science; Error analysis; Telecommunications; Algorithm; Telecommunications link; Mathematics; Applied mathematics","score_opus":0.040581938261015374,"score_gpt":0.3202997151910189,"score_spread":0.27971777693000355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391454334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.237976,0.0020678944,0.752704,0.004002985,0.00017890237,0.0006290852,0.00020297333,0.0015250617,0.0007130903],"genre_scores_gemma":[0.9507943,0.000623989,0.048010204,0.000044414915,0.000007911025,0.00036430877,0.00010645669,0.00003544025,0.000012996384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911255,0.000049770202,0.00037222705,0.00015353048,0.0001263637,0.00018555696],"domain_scores_gemma":[0.99668664,0.00084652926,0.0000812171,0.0022605597,0.000094573734,0.000030509447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018564388,0.0001526591,0.00029259146,0.00050221273,0.00011591048,0.000052003626,0.00087590376,0.000084239866,0.000006535043],"category_scores_gemma":[0.00004675911,0.00014371156,0.000082830746,0.0011955868,0.00057061797,0.00027470695,0.0000762907,0.00035050762,0.0000100013185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027264134,0.000098270895,0.0009936882,0.00059581024,0.0039726184,0.0000030765325,0.0007447046,0.92761433,0.034992848,0.013124653,0.0036267252,0.014206024],"study_design_scores_gemma":[0.00014944638,0.00002831506,0.00053542363,0.00014094997,0.00038979982,0.0000108380755,0.00044170895,0.9864537,0.002562986,0.000009468721,0.009078273,0.0001991016],"about_ca_topic_score_codex":0.000012134263,"about_ca_topic_score_gemma":0.000026115755,"teacher_disagreement_score":0.71281826,"about_ca_system_score_codex":0.00011868785,"about_ca_system_score_gemma":0.000025645762,"threshold_uncertainty_score":0.5860387},"labels":[],"label_agreement":null},{"id":"W4391559615","doi":"10.1109/lcomm.2024.3363234","title":"Massive MIMO Detection Method Based on Quasi-Newton Methods and Deep Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; MIMO; Deep learning; Artificial intelligence; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.019435852250607507,"score_gpt":0.32537117254908504,"score_spread":0.30593532029847753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391559615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006987726,0.0012876767,0.9942034,0.001731553,0.00040756952,0.00021960554,0.000002454161,0.0007799559,0.0006690348],"genre_scores_gemma":[0.46043652,0.00022393404,0.5388253,0.00020839483,0.0000490437,0.00013109104,0.000018336505,0.000066108856,0.000041292304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988011,0.0005140275,0.00023539645,0.00020526591,0.000079595105,0.00016458891],"domain_scores_gemma":[0.9981233,0.0009954533,0.000038928232,0.0007631812,0.000028545197,0.000050591872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004698694,0.00016420078,0.00015374654,0.00028481684,0.00019377364,0.00009065515,0.00023993182,0.000081666054,0.0000068658583],"category_scores_gemma":[0.000084433625,0.00018076031,0.00005234281,0.0003935135,0.000050807597,0.0002008157,0.000032495627,0.00047467448,0.00002299081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002669259,0.000007437098,0.0000071869513,0.0000625137,0.000028021512,0.0000011878868,0.000376501,0.78414,0.11013685,0.00012128082,0.00007808074,0.10503829],"study_design_scores_gemma":[0.00011430899,0.000025506453,0.000020132124,0.000100056175,0.00003165121,0.0000059329263,0.0001030345,0.9732557,0.013655473,0.000045541856,0.012467756,0.00017493236],"about_ca_topic_score_codex":0.000017429582,"about_ca_topic_score_gemma":0.000021845346,"teacher_disagreement_score":0.45973775,"about_ca_system_score_codex":0.00018213053,"about_ca_system_score_gemma":0.00000692676,"threshold_uncertainty_score":0.7371192},"labels":[],"label_agreement":null},{"id":"W4391741784","doi":"10.1109/lcomm.2024.3353063","title":"IEEE Communications Letters Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Indore; Shenzhen University; Xiamen University; Zayed University; Southeast University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; University of Science and Technology of China; Aristotle University of Thessaloniki; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; University of Electronic Science and Technology of China; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Henan Polytechnic University; Southwest Jiaotong University; Universidade de Coimbra; University of Hertfordshire; Queen's University; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Xidian University; Kyung Hee University; Beihang University; Vrije Universiteit Amsterdam; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Sydney; Trinity College Dublin; Nanjing University; Oulun Yliopisto; Memorial University of Newfoundland; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; Intel Corporation; Université du Luxembourg; University of Western Macedonia; Université Mohammed V de Rabat; New York University Abu Dhabi; Università di Bologna; University of Sussex; City University of Hong Kong; Villanova University; Universidade Nova de Lisboa; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Arizona State University; Munster Technological University; American University of Beirut","keywords":"Computer science; Computer network; Telecommunications; Information retrieval","score_opus":0.04030668573795067,"score_gpt":0.29264944787512476,"score_spread":0.2523427621371741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391741784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068571423,0.00089029217,0.53340477,0.45077723,0.0020913891,0.0004885774,0.000021729498,0.002099408,0.0033694534],"genre_scores_gemma":[0.93017447,0.0003733971,0.054287188,0.014027228,0.00010531986,0.0006340277,0.00021667352,0.000022454786,0.00015926015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797106,0.00032029697,0.0007228155,0.00032632943,0.0003020088,0.0003574952],"domain_scores_gemma":[0.99060893,0.0004540759,0.00022243663,0.00837561,0.00023096247,0.000107985536],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008104092,0.00022518214,0.00019065262,0.00086331007,0.00076577923,0.0010580933,0.0077940184,0.00014888044,0.000014489668],"category_scores_gemma":[0.00009062838,0.00024019592,0.00012771366,0.0018635718,0.00045483388,0.0041929577,0.0005904564,0.00066500914,0.002278534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002449591,0.00016085252,0.00043764725,0.00007934841,0.00015237262,0.0000013813184,0.007159729,0.00011098647,0.03021889,0.28977937,0.6039727,0.06792429],"study_design_scores_gemma":[0.00019191853,0.000015540674,0.00094426615,0.00010929665,0.00002855232,0.00007514149,0.00020758543,0.04068586,0.001599239,0.00071595504,0.9549795,0.00044716365],"about_ca_topic_score_codex":0.000104318875,"about_ca_topic_score_gemma":0.000026480737,"teacher_disagreement_score":0.9233173,"about_ca_system_score_codex":0.00026187918,"about_ca_system_score_gemma":0.0001602905,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W4391759548","doi":"10.1109/lcomm.2024.3365091","title":"Shortened Polar Codes Under Automorphism Ensemble Decoding","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Polar; List decoding; Computer science; Block code; Algorithm; Automorphism; Block (permutation group theory); Mathematics; Concatenated error correction code; Discrete mathematics; Combinatorics; Physics","score_opus":0.04822192735172226,"score_gpt":0.31186390321949553,"score_spread":0.26364197586777327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391759548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017951712,0.0011987055,0.92663854,0.047854178,0.0007705395,0.00018526553,0.000003836112,0.0033450054,0.0020521856],"genre_scores_gemma":[0.76673657,0.000121042845,0.22919719,0.0037216516,0.000039867922,0.000052986863,0.0000069474468,0.000025295314,0.00009844134],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856824,0.00021317734,0.000297681,0.00038377577,0.00022694284,0.00031021162],"domain_scores_gemma":[0.995995,0.00060585036,0.00005949343,0.0032015722,0.00006227893,0.000075833406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005463687,0.00017988123,0.0001652465,0.0003244065,0.00038500465,0.00048225012,0.0034378732,0.000072413284,0.000006326067],"category_scores_gemma":[0.00003574637,0.00018995855,0.000111937494,0.0007476323,0.00014387435,0.00063320796,0.00059437536,0.00046233018,0.0001437948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027720448,0.00013447597,0.0005615018,0.000055000037,0.00017581772,0.000059298723,0.003381504,0.0005040138,0.60383517,0.22135133,0.10124833,0.068690784],"study_design_scores_gemma":[0.00027404516,0.00008836876,0.0012355158,0.00071885757,0.00009840075,0.0003847666,0.00016323852,0.80475014,0.07636124,0.023941243,0.09049987,0.0014842938],"about_ca_topic_score_codex":0.00015328224,"about_ca_topic_score_gemma":0.00013577298,"teacher_disagreement_score":0.8042461,"about_ca_system_score_codex":0.00019900408,"about_ca_system_score_gemma":0.00008372394,"threshold_uncertainty_score":0.7746285},"labels":[],"label_agreement":null},{"id":"W4391768909","doi":"10.1109/lcomm.2024.3365475","title":"A Secret Multiuser Transmission Scheme With Dual-Phase-Shifter Structure for mmWave Wireless Communication","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless; Computer network; Scheme (mathematics); Dual (grammatical number); Phase shift module; Transmission (telecommunications); Telecommunications; Electronic engineering; Engineering; Mathematics; Microwave","score_opus":0.03949924641273332,"score_gpt":0.31371317827729617,"score_spread":0.27421393186456283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391768909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03286198,0.0040583136,0.90116817,0.059706356,0.00017648513,0.0009795426,0.000043146607,0.00065838033,0.00034762218],"genre_scores_gemma":[0.7593723,0.0014133087,0.23617029,0.0023596764,0.000047615136,0.00028549766,0.00019456491,0.000045245626,0.00011148628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802977,0.0004312199,0.00044557973,0.00048087732,0.00026204888,0.00035051926],"domain_scores_gemma":[0.9939995,0.0007581985,0.000119721706,0.004760946,0.00023037958,0.00013128475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043294686,0.00030647044,0.000265884,0.00025013468,0.00087732903,0.00062966376,0.0033831121,0.00011136006,0.000027630178],"category_scores_gemma":[0.000016444807,0.00026373798,0.0001315112,0.000891215,0.00028711415,0.00094871514,0.0004497854,0.0006369606,0.0000193531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013542635,0.00056777964,0.000118686214,0.0002572952,0.0005113995,0.000012993101,0.019295895,0.00061708427,0.34478006,0.17218779,0.03720119,0.4243144],"study_design_scores_gemma":[0.0016114,0.000115182265,0.00010058868,0.00060691155,0.000050571773,0.00004056946,0.00008370688,0.7159321,0.0059216986,0.00062480214,0.27429047,0.0006220438],"about_ca_topic_score_codex":0.000009783464,"about_ca_topic_score_gemma":0.000099484765,"teacher_disagreement_score":0.72651035,"about_ca_system_score_codex":0.00013166097,"about_ca_system_score_gemma":0.00012072214,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W4392172866","doi":"10.1109/lcomm.2024.3370698","title":"Enhancing Next-Generation Urban Connectivity: Is the Integrated HAPS-Terrestrial Network a Solution?","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Telecommunications; Distributed computing","score_opus":0.056046123470855504,"score_gpt":0.26900715203179326,"score_spread":0.21296102856093777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47035038,0.04344767,0.32704338,0.13960502,0.009605687,0.0018846908,0.00016216251,0.004005461,0.003895538],"genre_scores_gemma":[0.9922577,0.0012608704,0.0038556703,0.0014180077,0.0006938763,0.00021347396,0.00017447655,0.000052366093,0.000073557465],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871624,0.00027366093,0.0003907975,0.0001930317,0.00013369606,0.00029259242],"domain_scores_gemma":[0.9967527,0.0005571227,0.000041156512,0.0025534178,0.000039043454,0.00005659387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194234,0.00020533797,0.00016444083,0.0001220397,0.0006270253,0.00041348126,0.0012471863,0.00008226728,0.000039545153],"category_scores_gemma":[0.000044929347,0.00017573037,0.00012608683,0.00073699834,0.00014212976,0.00041615946,0.00016169375,0.0006672031,0.00013992582],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006594917,0.000050956096,0.00007602374,0.000024069162,0.00027657574,0.000002273915,0.0021493551,0.009576811,0.34204975,0.002072895,0.6350679,0.008646813],"study_design_scores_gemma":[0.00014163475,0.000010495967,0.000078011304,0.00012213718,0.000065969674,0.000008886972,0.00006470537,0.59188825,0.0035280169,0.000084261745,0.40376648,0.00024119004],"about_ca_topic_score_codex":0.00013156912,"about_ca_topic_score_gemma":0.00064793916,"teacher_disagreement_score":0.5823114,"about_ca_system_score_codex":0.00017544594,"about_ca_system_score_gemma":0.000060229046,"threshold_uncertainty_score":0.71660763},"labels":[],"label_agreement":null},{"id":"W4392399537","doi":"10.1109/lcomm.2024.3372585","title":"A General Analytical Framework for the Resolution of Near-Field Beamforming","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Field (mathematics); Telecommunications; Algorithm; Mathematics","score_opus":0.029654838238599712,"score_gpt":0.30194195652485467,"score_spread":0.27228711828625496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392399537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019667812,0.0016527765,0.9900502,0.0053185266,0.00038450977,0.00025354867,0.00001033676,0.0001724639,0.00019084541],"genre_scores_gemma":[0.66159946,0.00022742458,0.33756056,0.0002836043,0.00011754511,0.00013879446,0.000014419316,0.000030951865,0.00002722082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999496,0.000021635524,0.00022245811,0.00007675466,0.000060932474,0.0001222633],"domain_scores_gemma":[0.99814427,0.0009429954,0.000023411036,0.0008410399,0.000029573815,0.000018719144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001506767,0.0000738236,0.00008923022,0.000054884997,0.00013921552,0.00004510538,0.00038884796,0.00005695542,0.0000038615194],"category_scores_gemma":[0.000081116166,0.00006332166,0.00007066106,0.00025983367,0.00007454934,0.0001206231,0.00003335301,0.00020082101,0.0000055146893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004163764,0.0000070486017,0.00001616792,0.000087686225,0.00008397748,2.0783155e-7,0.0005556951,0.9492503,0.006192201,0.031416025,0.0067342957,0.005652221],"study_design_scores_gemma":[0.000041141353,0.000007973068,0.000010260574,0.00010395881,0.00003551835,0.0000024382452,0.000039530103,0.9821192,0.0009799522,0.00045748602,0.016134106,0.00006844928],"about_ca_topic_score_codex":0.000016153594,"about_ca_topic_score_gemma":0.00000924926,"teacher_disagreement_score":0.6596327,"about_ca_system_score_codex":0.00006218399,"about_ca_system_score_gemma":0.000012089503,"threshold_uncertainty_score":0.25821823},"labels":[],"label_agreement":null},{"id":"W4392638881","doi":"10.1109/lcomm.2024.3366052","title":"IEEE Communications Letters Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Indian Institute of Technology Indore; Shenzhen University; Xiamen University; Zayed University; Southeast University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; University of Science and Technology of China; Aristotle University of Thessaloniki; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; University of Electronic Science and Technology of China; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Henan Polytechnic University; Southwest Jiaotong University; Universidade de Coimbra; University of Hertfordshire; Queen's University; Trường Đại học Bách Khoa Hà Nội; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Xidian University; Kyung Hee University; Beihang University; Vrije Universiteit Amsterdam; South China University of Technology; Polytechnique Montréal; University College Dublin; University of Sydney; Trinity College Dublin; Nanjing University; Oulun Yliopisto; Memorial University of Newfoundland; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; Intel Corporation; Université du Luxembourg; University of Western Macedonia; Université Mohammed V de Rabat; New York University Abu Dhabi; Università di Bologna; University of Sussex; City University of Hong Kong; Villanova University; Universidade Nova de Lisboa; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Arizona State University; Munster Technological University; American University of Beirut","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04030668573795067,"score_gpt":0.29264944787512476,"score_spread":0.2523427621371741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392638881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068571423,0.00089029217,0.53340477,0.45077723,0.0020913891,0.0004885774,0.000021729498,0.002099408,0.0033694534],"genre_scores_gemma":[0.93017447,0.0003733971,0.054287188,0.014027228,0.00010531986,0.0006340277,0.00021667352,0.000022454786,0.00015926015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797106,0.00032029697,0.0007228155,0.00032632943,0.0003020088,0.0003574952],"domain_scores_gemma":[0.99060893,0.0004540759,0.00022243663,0.00837561,0.00023096247,0.000107985536],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008104092,0.00022518214,0.00019065262,0.00086331007,0.00076577923,0.0010580933,0.0077940184,0.00014888044,0.000014489668],"category_scores_gemma":[0.00009062838,0.00024019592,0.00012771366,0.0018635718,0.00045483388,0.0041929577,0.0005904564,0.00066500914,0.002278534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002449591,0.00016085252,0.00043764725,0.00007934841,0.00015237262,0.0000013813184,0.007159729,0.00011098647,0.03021889,0.28977937,0.6039727,0.06792429],"study_design_scores_gemma":[0.00019191853,0.000015540674,0.00094426615,0.00010929665,0.00002855232,0.00007514149,0.00020758543,0.04068586,0.001599239,0.00071595504,0.9549795,0.00044716365],"about_ca_topic_score_codex":0.000104318875,"about_ca_topic_score_gemma":0.000026480737,"teacher_disagreement_score":0.9233173,"about_ca_system_score_codex":0.00026187918,"about_ca_system_score_gemma":0.0001602905,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W4394707825","doi":"10.1109/lcomm.2024.3378429","title":"IEEE Communications Letters Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Munster Technological University; Indraprastha Institute of Information Technology, Delhi; Southern University of Science and Technology; National Institute of Informatics; Zayed University; Università di Pisa; Donghua University; King Fahd University of Petroleum and Minerals; Università Politecnica delle Marche; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Università degli Studi dell'Aquila; Jinan University; Southeast University; Henan Polytechnic University; Queen's University; University of Hertfordshire; Universidade de Coimbra; Memorial University of Newfoundland; University of Glasgow; Deutsches Zentrum für Luft- und Raumfahrt; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; King Abdullah University of Science and Technology; Shenzhen University; Xidian University; Kyung Hee University; Università di Bologna; King Saud University; South China University of Technology; Chongqing University; Beihang University; Université Mohammed V de Rabat; Southwest Jiaotong University; Polytechnique Montréal; Trinity College Dublin; Università degli Studi di Torino; Shanghai Educational Development Foundation; Nanjing University; New York University Abu Dhabi; Villanova University; Universidade Nova de Lisboa; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; City University of Hong Kong; Intel Corporation","keywords":"Computer science; Telecommunications; Computer network; World Wide Web","score_opus":0.04030668573795067,"score_gpt":0.29264944787512476,"score_spread":0.2523427621371741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394707825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068571423,0.00089029217,0.53340477,0.45077723,0.0020913891,0.0004885774,0.000021729498,0.002099408,0.0033694534],"genre_scores_gemma":[0.93017447,0.0003733971,0.054287188,0.014027228,0.00010531986,0.0006340277,0.00021667352,0.000022454786,0.00015926015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797106,0.00032029697,0.0007228155,0.00032632943,0.0003020088,0.0003574952],"domain_scores_gemma":[0.99060893,0.0004540759,0.00022243663,0.00837561,0.00023096247,0.000107985536],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008104092,0.00022518214,0.00019065262,0.00086331007,0.00076577923,0.0010580933,0.0077940184,0.00014888044,0.000014489668],"category_scores_gemma":[0.00009062838,0.00024019592,0.00012771366,0.0018635718,0.00045483388,0.0041929577,0.0005904564,0.00066500914,0.002278534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002449591,0.00016085252,0.00043764725,0.00007934841,0.00015237262,0.0000013813184,0.007159729,0.00011098647,0.03021889,0.28977937,0.6039727,0.06792429],"study_design_scores_gemma":[0.00019191853,0.000015540674,0.00094426615,0.00010929665,0.00002855232,0.00007514149,0.00020758543,0.04068586,0.001599239,0.00071595504,0.9549795,0.00044716365],"about_ca_topic_score_codex":0.000104318875,"about_ca_topic_score_gemma":0.000026480737,"teacher_disagreement_score":0.9233173,"about_ca_system_score_codex":0.00026187918,"about_ca_system_score_gemma":0.0001602905,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W4395680411","doi":"10.1109/lcomm.2024.3394323","title":"Semantic Extraction Model Selection for IoT Devices in Edge-Assisted Semantic Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Selection (genetic algorithm); Enhanced Data Rates for GSM Evolution; Computer network; Internet of Things; Telecommunications; Information retrieval; Artificial intelligence; World Wide Web","score_opus":0.05372233738359427,"score_gpt":0.32064393118843204,"score_spread":0.26692159380483776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395680411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034945007,0.001472124,0.9220651,0.039337136,0.0005350693,0.0005357021,0.000005671979,0.0006891498,0.0004150894],"genre_scores_gemma":[0.78755313,0.00029825562,0.21071048,0.0008971055,0.000046631976,0.00030845797,0.000041819923,0.00003490915,0.00010919985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796885,0.0003271957,0.0005676191,0.0004966999,0.00023081237,0.00040879182],"domain_scores_gemma":[0.9949002,0.0011520854,0.00014793265,0.0035924318,0.00013461322,0.00007270628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005996955,0.00023626747,0.00023504633,0.0005979161,0.00057564734,0.00044037594,0.0035579202,0.00013259274,0.0000015200577],"category_scores_gemma":[0.000039242546,0.00026407436,0.0001452313,0.0016291738,0.00018576694,0.00059837464,0.00040980364,0.0005837625,0.000036679605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010275636,0.0005453635,0.00055021764,0.00017311562,0.00011413013,0.0000033367758,0.0015559868,0.8196253,0.07048672,0.0652615,0.00629462,0.03537939],"study_design_scores_gemma":[0.00019739741,0.000016482776,0.00062158913,0.00024341044,0.00003502004,0.000028788005,0.000029481776,0.99210495,0.00057240686,0.00043226965,0.005442454,0.0002757265],"about_ca_topic_score_codex":0.00017777577,"about_ca_topic_score_gemma":0.0027018422,"teacher_disagreement_score":0.7526081,"about_ca_system_score_codex":0.0003217752,"about_ca_system_score_gemma":0.0001372844,"threshold_uncertainty_score":0.99998116},"labels":[],"label_agreement":null},{"id":"W4396529887","doi":"10.1109/lcomm.2024.3395439","title":"Hardware Impairments Effects on Over the Air System Assisted by Unmanned Aerial Vehicle","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Confederation College; Lakehead University","funders":"","keywords":"Computer science; Remotely operated underwater vehicle; Air traffic control; Aeronautics; Embedded system; Real-time computing; Telecommunications; Artificial intelligence; Mobile robot; Engineering; Aerospace engineering; Robot","score_opus":0.007958051845808566,"score_gpt":0.22576786370252208,"score_spread":0.21780981185671353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396529887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91554856,0.0024797062,0.04778766,0.020754345,0.0026568305,0.002085898,0.00024296576,0.0037820658,0.0046619624],"genre_scores_gemma":[0.99783397,0.00007252286,0.0005833392,0.000737143,0.00010917859,0.00041852274,0.00013879462,0.00004776789,0.0000587607],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927,0.00009296784,0.00019175446,0.00014519753,0.00013350062,0.00016656218],"domain_scores_gemma":[0.99838626,0.00023381444,0.000024445428,0.0012953865,0.000019235,0.000040865045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011641257,0.00014154137,0.00010296195,0.000072023446,0.00027616823,0.00012117572,0.0006128603,0.000058255042,0.000007252821],"category_scores_gemma":[0.0000053308872,0.00011648101,0.0000666526,0.00035647285,0.00005008152,0.00011355586,0.000048063484,0.00022431725,0.00017938089],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001756523,0.00013459055,0.00015072498,0.00049444474,0.0004203246,0.000007666001,0.0010247058,0.082465865,0.17205116,0.0028357084,0.7253065,0.015090734],"study_design_scores_gemma":[0.00082196394,0.000056447672,0.005398572,0.0005442121,0.00015582901,0.000014985298,0.00011467743,0.74142075,0.011621809,0.00002011774,0.23927623,0.000554436],"about_ca_topic_score_codex":0.000027555288,"about_ca_topic_score_gemma":0.00000795276,"teacher_disagreement_score":0.65895486,"about_ca_system_score_codex":0.00023008979,"about_ca_system_score_gemma":0.000009491681,"threshold_uncertainty_score":0.47499576},"labels":[],"label_agreement":null},{"id":"W4396564053","doi":"10.1109/lcomm.2024.3396050","title":"Joint Spectrum Partitioning and Power Allocation for Energy Efficient Semi-Integrated Sensing and Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quality of service; Wireless; Resource allocation; Computer network; Power budget; Bandwidth (computing); Distributed computing; Spectral efficiency; Convex optimization; Efficient energy use; Power (physics); Regular polygon; Telecommunications; Power control; Engineering","score_opus":0.025406270041957772,"score_gpt":0.25446357889744176,"score_spread":0.22905730885548398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396564053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019958716,0.0035684563,0.908326,0.06699605,0.00023293056,0.00021509624,0.000008812345,0.00027063547,0.00042324568],"genre_scores_gemma":[0.94370645,0.0008237775,0.05384744,0.0014735287,0.000042825817,0.000022745437,0.000038976723,0.000020877776,0.000023372371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876857,0.0001909976,0.0003038584,0.0003604437,0.0001133365,0.00026280162],"domain_scores_gemma":[0.99745464,0.0006819543,0.000074006035,0.0016193729,0.0000851798,0.000084871055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039624682,0.00016807184,0.00016945075,0.0002141934,0.00076119177,0.00063304254,0.0005413282,0.00005146679,0.000001223365],"category_scores_gemma":[0.000034972145,0.00017346565,0.00006293601,0.00046136006,0.00030734015,0.00023365411,0.00035108803,0.00023689408,0.0000029923804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016153033,0.00019079006,0.00009963139,0.00008729629,0.0003495244,0.000016745409,0.0073520397,0.004085861,0.106756546,0.6391228,0.008098771,0.23382385],"study_design_scores_gemma":[0.00015369603,0.000025783274,0.0002446801,0.0002258516,0.00002961047,0.000085650325,0.00010206289,0.9784713,0.0014304306,0.0018061929,0.01720845,0.00021631704],"about_ca_topic_score_codex":0.00018004999,"about_ca_topic_score_gemma":0.00031333076,"teacher_disagreement_score":0.97438544,"about_ca_system_score_codex":0.000107941516,"about_ca_system_score_gemma":0.000049963783,"threshold_uncertainty_score":0.7073724},"labels":[],"label_agreement":null},{"id":"W4396766335","doi":"10.1109/lcomm.2024.3388243","title":"IEEE Communications Letters Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Technology and Education Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Denver; Indraprastha Institute of Information Technology, Delhi; Jacobs University; Southern University of Science and Technology; National Institute of Informatics; Shenzhen University; Xiamen University; Zayed University; Southeast University; Peking University; Università degli Studi di Roma Tor Vergata; Università di Pisa; Technische Universität Berlin; Università degli Studi di Torino; Aristotle University of Thessaloniki; Universidad Carlos III de Madrid; Università degli Studi dell'Aquila; Donghua University; Nanjing University; Oulun Yliopisto; University of Electronic Science and Technology of China; National and Kapodistrian University of Athens; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Zhejiang University; Orta Doğu Teknik Üniversitesi; King Abdullah University of Science and Technology; Jinan University; Henan Polytechnic University; Southwest Jiaotong University; Universidade de Coimbra; University of Hertfordshire; Queen's University; Universidade de Macau; China Mobile Research Institute; Amirkabir University of Technology; Chang'an University; Università Politecnica delle Marche; King Fahd University of Petroleum and Minerals; Xidian University; Kyung Hee University; Università di Bologna; University of Sussex; King Saud University; Vrije Universiteit Amsterdam; South China University of Technology; Chongqing University; Beihang University; Polytechnique Montréal; University College Dublin; University of Sydney; Trinity College Dublin; Memorial University of Newfoundland; Deutsches Zentrum für Luft- und Raumfahrt; University of Glasgow; Intel Corporation; Université du Luxembourg; University of Western Macedonia; Université Mohammed V de Rabat; New York University Abu Dhabi; City University of Hong Kong; Villanova University; Universidade Nova de Lisboa; Università degli Studi Mediterranea di Reggio Calabria; Queen Mary University of London; Shanghai Educational Development Foundation; Arizona State University; Munster Technological University; American University of Beirut","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04030668573795067,"score_gpt":0.29264944787512476,"score_spread":0.2523427621371741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396766335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068571423,0.00089029217,0.53340477,0.45077723,0.0020913891,0.0004885774,0.000021729498,0.002099408,0.0033694534],"genre_scores_gemma":[0.93017447,0.0003733971,0.054287188,0.014027228,0.00010531986,0.0006340277,0.00021667352,0.000022454786,0.00015926015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797106,0.00032029697,0.0007228155,0.00032632943,0.0003020088,0.0003574952],"domain_scores_gemma":[0.99060893,0.0004540759,0.00022243663,0.00837561,0.00023096247,0.000107985536],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008104092,0.00022518214,0.00019065262,0.00086331007,0.00076577923,0.0010580933,0.0077940184,0.00014888044,0.000014489668],"category_scores_gemma":[0.00009062838,0.00024019592,0.00012771366,0.0018635718,0.00045483388,0.0041929577,0.0005904564,0.00066500914,0.002278534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002449591,0.00016085252,0.00043764725,0.00007934841,0.00015237262,0.0000013813184,0.007159729,0.00011098647,0.03021889,0.28977937,0.6039727,0.06792429],"study_design_scores_gemma":[0.00019191853,0.000015540674,0.00094426615,0.00010929665,0.00002855232,0.00007514149,0.00020758543,0.04068586,0.001599239,0.00071595504,0.9549795,0.00044716365],"about_ca_topic_score_codex":0.000104318875,"about_ca_topic_score_gemma":0.000026480737,"teacher_disagreement_score":0.9233173,"about_ca_system_score_codex":0.00026187918,"about_ca_system_score_gemma":0.0001602905,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W4398151476","doi":"10.1109/lcomm.2024.3403501","title":"Dynamic Compressed Sensing Approach for Unsourced Random Access","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Compressed sensing; Algorithm","score_opus":0.04118370713950655,"score_gpt":0.3001159809567612,"score_spread":0.25893227381725464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398151476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016671965,0.0014010603,0.9755533,0.0014928617,0.00029368684,0.00048076658,0.000018135957,0.0022873692,0.0018008862],"genre_scores_gemma":[0.88925415,0.00017221652,0.109848425,0.0004360702,0.00004252055,0.000061904946,0.0000962706,0.000065400054,0.000023067048],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992633,0.000059316728,0.00021309161,0.00017396196,0.00008435157,0.00020598185],"domain_scores_gemma":[0.99832976,0.0003479811,0.000022007052,0.0012260907,0.0000366966,0.000037440117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012224245,0.0001621335,0.00018475488,0.00017399012,0.00016966986,0.0002733249,0.0008199262,0.000060989372,0.000001918816],"category_scores_gemma":[0.000009950062,0.00016946762,0.00011453107,0.00023567927,0.000101571895,0.00017208926,0.000094142975,0.00024863298,0.000006112679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028711389,0.00004137307,0.000008484987,0.00022196848,0.00036793132,0.0000059016957,0.0007443702,0.24767676,0.6483884,0.0003973523,0.07935216,0.02276662],"study_design_scores_gemma":[0.00026382972,0.000003875857,0.000013742076,0.00010666096,0.00004784672,0.00001116055,0.000020034251,0.9683979,0.011833799,0.00017201339,0.018928327,0.00020080643],"about_ca_topic_score_codex":0.000017863735,"about_ca_topic_score_gemma":0.0000058570145,"teacher_disagreement_score":0.87258214,"about_ca_system_score_codex":0.00007001193,"about_ca_system_score_gemma":0.0000091844295,"threshold_uncertainty_score":0.6910689},"labels":[],"label_agreement":null},{"id":"W4399426462","doi":"10.1109/lcomm.2024.3411399","title":"Joint Power and User Allocation in Coexistence of eMBB and URLLC Services","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Joint (building); Computer science; Computer network; Power (physics); Telecommunications; Engineering","score_opus":0.019910927526759662,"score_gpt":0.25402422584114415,"score_spread":0.2341132983143845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399426462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95995927,0.017265987,0.012431823,0.008817758,0.000087245426,0.00023868767,0.000011389447,0.0006177203,0.0005701],"genre_scores_gemma":[0.97762734,0.0062465942,0.01590262,0.00013335927,0.000002309702,0.000054272055,0.000008201917,0.000018492608,0.000006830644],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994554,0.000033968743,0.00024096998,0.00011190989,0.000060313232,0.00009745528],"domain_scores_gemma":[0.9986159,0.0001533346,0.000029885807,0.001160967,0.000021796219,0.000018108585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011306226,0.00009518972,0.00012366839,0.00020833513,0.000044268985,0.00003469283,0.0004755922,0.00005296445,0.000002183209],"category_scores_gemma":[0.000011336441,0.00010291101,0.000015555877,0.00027900224,0.00023894433,0.00025907077,0.0001861655,0.00022955712,0.000004093514],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069659427,0.00008369782,0.0042251623,0.0012146013,0.00013517482,0.0000042903425,0.009544733,0.025600309,0.8859328,0.03569701,0.001186107,0.036369134],"study_design_scores_gemma":[0.0015653508,0.00012437928,0.10249462,0.0046222513,0.00009849238,0.0000968245,0.010960708,0.6429756,0.14531352,0.007081996,0.08250778,0.0021584295],"about_ca_topic_score_codex":0.00003384238,"about_ca_topic_score_gemma":0.00009967517,"teacher_disagreement_score":0.7406193,"about_ca_system_score_codex":0.000040112398,"about_ca_system_score_gemma":0.0000049735804,"threshold_uncertainty_score":0.41965896},"labels":[],"label_agreement":null},{"id":"W4399800992","doi":"10.1109/lcomm.2024.3416515","title":"Modified OSD Algorithm With Reduced Gaussian Elimination","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Algorithms and Applications","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Algorithm; Computer science","score_opus":0.01751941258473293,"score_gpt":0.257576836413961,"score_spread":0.24005742382922807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399800992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012995763,0.00095958536,0.96571857,0.013313061,0.00027748127,0.00034986244,0.00005300689,0.0014244195,0.004908265],"genre_scores_gemma":[0.8772858,0.00031053997,0.1214076,0.00022979398,0.00011193901,0.00034674394,0.000111459536,0.0000618469,0.00013431562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931276,0.00002057551,0.00018520378,0.00017412263,0.00011831078,0.00018900656],"domain_scores_gemma":[0.99870396,0.00008070074,0.000019020363,0.0011052798,0.00003077359,0.00006026611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006612082,0.00014833108,0.000104394785,0.00013868515,0.00017825801,0.00009689783,0.00047743344,0.000043456814,0.000009836474],"category_scores_gemma":[0.0000025218085,0.00013982534,0.000041933123,0.0004748294,0.000107450505,0.00024806827,0.000030638144,0.000282024,0.000087526125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034521465,0.000094698815,0.0000039056836,0.00010002042,0.0002245932,0.000013455482,0.0012778179,0.17424686,0.13169263,0.01748432,0.014376208,0.66048205],"study_design_scores_gemma":[0.00018293547,0.000015710697,0.00025336395,0.00011207377,0.00004780247,0.000027975751,0.00008629596,0.93965954,0.005702765,0.0005064274,0.053041372,0.00036375909],"about_ca_topic_score_codex":0.000012292425,"about_ca_topic_score_gemma":0.000010695994,"teacher_disagreement_score":0.86429,"about_ca_system_score_codex":0.00010590363,"about_ca_system_score_gemma":0.000015721707,"threshold_uncertainty_score":0.57019114},"labels":[],"label_agreement":null},{"id":"W4400188512","doi":"10.1109/lcomm.2024.3421370","title":"Localization in Multipath Environments via Active Sensing With Reconfigurable Intelligent Surfaces","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multipath propagation; Computer science; Computer network; Channel (broadcasting)","score_opus":0.01654868403826395,"score_gpt":0.22838314339523955,"score_spread":0.2118344593569756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400188512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1054802,0.0010439091,0.888675,0.0018884059,0.00030284238,0.00037027983,0.000012192345,0.0009044601,0.0013227578],"genre_scores_gemma":[0.996133,0.0007790234,0.0027207904,0.00023431356,0.000009013531,0.000020608806,0.000043466374,0.00003614092,0.000023601757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933827,0.0000465113,0.00020212236,0.00014535624,0.00009480677,0.00017291745],"domain_scores_gemma":[0.9992287,0.00009415977,0.000020343967,0.00062214746,0.000013017823,0.000021614009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008533703,0.00013283764,0.00011175746,0.00021662084,0.00008638348,0.00005754025,0.00028694075,0.000067887384,0.000012188196],"category_scores_gemma":[0.000010266431,0.00012805259,0.000023531078,0.00039707613,0.00012560446,0.00020824451,0.000024655532,0.00025094496,0.00006203471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007603764,0.00002980475,0.00038882438,0.00006175285,0.00007599484,0.000012753965,0.0023329656,0.88634723,0.04775234,0.00015557307,0.0010563985,0.061778765],"study_design_scores_gemma":[0.000112799156,0.000010761558,0.00012239661,0.00016450262,0.000013660435,0.000007362495,0.0004634862,0.85126805,0.13007912,0.00007200332,0.01747921,0.0002066328],"about_ca_topic_score_codex":0.000075387325,"about_ca_topic_score_gemma":0.00018169706,"teacher_disagreement_score":0.89065284,"about_ca_system_score_codex":0.00022985708,"about_ca_system_score_gemma":0.0000083053155,"threshold_uncertainty_score":0.5221833},"labels":[],"label_agreement":null},{"id":"W4400409937","doi":"10.1109/lcomm.2024.3424666","title":"User-Specific Channel Estimation Overhead Optimization and Resource Allocation for Multi-User OTFS Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Overhead (engineering); Channel (broadcasting); Resource allocation; Multi-user; Resource management (computing); Computer network; Distributed computing; Real-time computing","score_opus":0.04815476255070126,"score_gpt":0.2815178930216897,"score_spread":0.23336313047098847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400409937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037765973,0.004550638,0.9859039,0.0031484286,0.000948896,0.00067561585,0.00004150374,0.00078502606,0.00016939631],"genre_scores_gemma":[0.81640154,0.001693438,0.17895025,0.0002187516,0.00030445575,0.0011884074,0.0005829982,0.00016274792,0.0004973878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991447,0.00006460066,0.0003133291,0.00020436164,0.000101338745,0.00017169806],"domain_scores_gemma":[0.99878496,0.00018744898,0.00004295297,0.0008757275,0.00005534682,0.00005356994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002233055,0.00015819383,0.0001286317,0.00023396005,0.00021608605,0.00024208371,0.00032800858,0.000087282715,0.00000303148],"category_scores_gemma":[0.00002228054,0.00018524501,0.00004407649,0.0002842471,0.0000866773,0.00039789657,0.00003603213,0.00017850926,0.00002033192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022487352,0.000016200207,0.000006039852,0.00015115958,0.00004523837,1.4692215e-7,0.00055480335,0.96268356,0.00934881,0.0034200782,0.022138847,0.0016329],"study_design_scores_gemma":[0.00019047684,0.000006334007,0.000024921637,0.00013428797,0.000023073912,0.000007920853,0.00010350744,0.86602664,0.00050695555,0.0000138932055,0.13279763,0.00016435211],"about_ca_topic_score_codex":0.000014788712,"about_ca_topic_score_gemma":0.0000029370851,"teacher_disagreement_score":0.812625,"about_ca_system_score_codex":0.00019300978,"about_ca_system_score_gemma":0.000010365078,"threshold_uncertainty_score":0.7554072},"labels":[],"label_agreement":null},{"id":"W4400646697","doi":"10.1109/lcomm.2024.3428440","title":"Insights Into Visible Light Positioning: Range Tracking and Bayesian Cramér-Rao Lower Bound Analysis","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cramér–Rao bound; Visible light communication; Bayesian probability; Computer science; Range (aeronautics); Tracking (education); Upper and lower bounds; Telecommunications; Artificial intelligence; Mathematics; Algorithm; Light-emitting diode; Estimation theory; Physics; Optics; Engineering","score_opus":0.014311977464549767,"score_gpt":0.2556707148934809,"score_spread":0.24135873742893116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400646697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6846085,0.056588896,0.17893356,0.064404055,0.0005827326,0.0005609649,0.000014183089,0.005944616,0.008362467],"genre_scores_gemma":[0.9838537,0.0029370796,0.012641798,0.00033124065,0.000026647176,0.00009978156,0.00003557471,0.00004988608,0.000024271503],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890953,0.00008940942,0.00037059002,0.00024786437,0.00015744404,0.00022518737],"domain_scores_gemma":[0.99699855,0.0003778257,0.000033782613,0.0024617864,0.000052066465,0.00007597418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012730992,0.00021684337,0.00026325858,0.00073306455,0.0003982065,0.00051731576,0.0011727163,0.00014007454,0.0000199901],"category_scores_gemma":[0.00003177157,0.00022740437,0.00013566634,0.0016113804,0.00030646485,0.00051038124,0.00024264026,0.0005816839,0.00005922815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029127352,0.00057858403,0.0029715144,0.0008904492,0.008215363,0.0000976042,0.017305143,0.03502168,0.6271524,0.13942868,0.021871025,0.14643842],"study_design_scores_gemma":[0.00046665972,0.00006284242,0.004073813,0.00050659676,0.0010378448,0.0000180226,0.00067237025,0.8687094,0.024432246,0.007546242,0.09102054,0.0014534184],"about_ca_topic_score_codex":0.00003743571,"about_ca_topic_score_gemma":0.00016553861,"teacher_disagreement_score":0.8336877,"about_ca_system_score_codex":0.00016109015,"about_ca_system_score_gemma":0.000012617483,"threshold_uncertainty_score":0.9273281},"labels":[],"label_agreement":null},{"id":"W4400646890","doi":"10.1109/lcomm.2024.3428973","title":"Federated Learning-Enabled Smart Jammer Detection in Terrestrial and Non-Terrestrial Heterogeneous Joint Sensing and Communication Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Joint (building); Terrestrial plant; Telecommunications; Computer network; Engineering","score_opus":0.023107031652175602,"score_gpt":0.24935418669771406,"score_spread":0.22624715504553847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400646890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7034554,0.00228289,0.2846538,0.0076700235,0.0009842284,0.00050819985,7.05894e-7,0.00036386866,0.00008088949],"genre_scores_gemma":[0.99385655,0.0014410572,0.003926268,0.0005231525,0.00016045991,0.00002894296,0.000023472741,0.000032859232,0.000007249572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750847,0.0009259989,0.0005337496,0.0004778015,0.00017855946,0.00037543944],"domain_scores_gemma":[0.9976803,0.0007778793,0.00013709346,0.0012830576,0.000019453393,0.00010222579],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006955545,0.00025427015,0.00028690315,0.0003278076,0.00062784256,0.0011526423,0.00069598143,0.00018963874,8.508963e-7],"category_scores_gemma":[0.00006703233,0.00028288472,0.00006500573,0.0006414261,0.0002760197,0.000503269,0.0005575995,0.0011679815,0.000007437945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023470454,0.000254517,0.0011459774,0.00008119777,0.00040229177,0.00021956449,0.009482443,0.11449549,0.059169743,0.0002156444,0.0023440076,0.81195444],"study_design_scores_gemma":[0.00067734916,0.000044073116,0.0003603271,0.00021514791,0.000020474314,0.00014012211,0.00004520582,0.99516714,0.00086382835,0.00008197098,0.002102754,0.00028160986],"about_ca_topic_score_codex":0.0010903971,"about_ca_topic_score_gemma":0.0014959871,"teacher_disagreement_score":0.8806716,"about_ca_system_score_codex":0.00014596617,"about_ca_system_score_gemma":0.000036032125,"threshold_uncertainty_score":0.99996233},"labels":[],"label_agreement":null},{"id":"W4401070745","doi":"10.1109/lcomm.2024.3435487","title":"On the Impact of Reactive Region on the Near-Field Channel Gain","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Electromagnetic Compatibility and Measurements","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Channel (broadcasting); Computer science; Telecommunications; Computer network","score_opus":0.052736875749753595,"score_gpt":0.2788892348616562,"score_spread":0.22615235911190257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401070745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9545787,0.00027705263,0.0010433897,0.03720318,0.00012388891,0.00030163003,0.0000042929846,0.00010424222,0.0063636233],"genre_scores_gemma":[0.99895513,0.000071366914,0.000024790254,0.0008388037,0.00001891132,0.000051382707,0.0000026056646,0.000013607558,0.00002337419],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994313,0.00014166445,0.000112814036,0.000080309386,0.00011374637,0.00012014798],"domain_scores_gemma":[0.9971754,0.0013746681,0.000019941039,0.0013916616,0.000020299747,0.00001802547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026354415,0.0000920524,0.00007463353,0.000041098083,0.00012591039,0.000038023605,0.0005604072,0.000027835531,0.000016513886],"category_scores_gemma":[0.00008111347,0.00005456421,0.000094418596,0.00020636128,0.000081542225,0.000033767174,0.000024046361,0.0003990046,0.000028467075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007833546,0.0002976896,0.000078714314,0.00007316468,0.00071528094,0.000004558632,0.010529538,0.061709248,0.3654585,0.01589538,0.5327858,0.012373837],"study_design_scores_gemma":[0.0007001743,0.0019990974,0.0074978652,0.0020963973,0.00019361505,0.000028320674,0.00071807025,0.7728604,0.18997991,0.014763937,0.008152015,0.001010171],"about_ca_topic_score_codex":0.00014065849,"about_ca_topic_score_gemma":0.000025648002,"teacher_disagreement_score":0.7111512,"about_ca_system_score_codex":0.000102936996,"about_ca_system_score_gemma":0.000019122297,"threshold_uncertainty_score":0.22250639},"labels":[],"label_agreement":null},{"id":"W4401070761","doi":"10.1109/lcomm.2024.3434444","title":"Robust Semi-Blind Packing Ratio Estimation for Faster-Than-Nyquist Signaling","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; Nyquist–Shannon sampling theorem; Signal-to-noise ratio (imaging); Robustness (evolution); Algorithm; Mathematics; Telecommunications; Computer vision; Chemistry","score_opus":0.06956192672676201,"score_gpt":0.2938054877823033,"score_spread":0.2242435610555413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401070761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057948757,0.0011412692,0.9309436,0.0058149374,0.0016593894,0.00049320713,0.000037861857,0.0010656021,0.00089535234],"genre_scores_gemma":[0.9480903,0.00007508152,0.05065205,0.00023981575,0.00027881842,0.00032984075,0.00014515815,0.00007591685,0.00011302363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990657,0.000049562674,0.00034632647,0.00018422998,0.0001293062,0.00022486442],"domain_scores_gemma":[0.99849904,0.00037875766,0.00003917944,0.0009791465,0.000051201023,0.00005270347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002432799,0.00016997891,0.00013820671,0.00023594465,0.0002660594,0.0002786701,0.0005329213,0.00007119854,0.00001811695],"category_scores_gemma":[0.000041527415,0.000199737,0.00010019946,0.0003416643,0.000095405005,0.0003968287,0.00004214771,0.00028246598,0.00008267641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000424922,0.000014824268,0.000017532167,0.0001730823,0.000101998,0.0000010206718,0.0009997927,0.7731241,0.2007145,0.0006505009,0.018910028,0.0052883676],"study_design_scores_gemma":[0.0002272264,0.000008577979,0.000016888624,0.00021807246,0.00005362779,0.000015384736,0.00013464343,0.9574371,0.015770378,0.0001624026,0.025696782,0.0002589069],"about_ca_topic_score_codex":0.000007602966,"about_ca_topic_score_gemma":0.000010114526,"teacher_disagreement_score":0.89014155,"about_ca_system_score_codex":0.00019936255,"about_ca_system_score_gemma":0.000022614413,"threshold_uncertainty_score":0.81450385},"labels":[],"label_agreement":null},{"id":"W4402811220","doi":"10.1109/lcomm.2024.3466995","title":"Improving Channel Resilience for Task-Oriented Semantic Communications: A Unified Information Bottleneck Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Radiation Effects in Electronics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Computer science; Bottleneck; Task (project management); Resilience (materials science); Channel (broadcasting); Computer network","score_opus":0.012632757186692524,"score_gpt":0.2421678632156775,"score_spread":0.22953510602898497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402811220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007120482,0.0039219214,0.9791895,0.0047098356,0.0006633463,0.0013487124,0.00007902817,0.0014809992,0.0014861753],"genre_scores_gemma":[0.95167655,0.0006517768,0.045390684,0.0005274282,0.00006201126,0.0010902196,0.0005128147,0.000060498227,0.00002803881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866325,0.00011777546,0.00048462147,0.00017926373,0.00018143395,0.00037366073],"domain_scores_gemma":[0.99613017,0.0006338002,0.00008149968,0.002993123,0.00009492616,0.00006650166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005252262,0.00021719043,0.00018134536,0.000378636,0.00038323583,0.00021574942,0.0016793873,0.000104975,0.0000013812106],"category_scores_gemma":[0.0001259143,0.00024670907,0.00010174762,0.00079287105,0.00018943957,0.0010463923,0.00013870095,0.0004866215,0.00005660476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015744412,0.000110854555,0.000011036689,0.0012676793,0.00027790738,5.287143e-7,0.004105119,0.85983133,0.031486753,0.029562568,0.027384317,0.045946177],"study_design_scores_gemma":[0.00021368671,0.000019536805,0.000027052687,0.00007432929,0.00004749664,0.0000081495355,0.0001406883,0.94299245,0.0005160976,0.00014082488,0.055571303,0.00024837692],"about_ca_topic_score_codex":0.00003510733,"about_ca_topic_score_gemma":0.000022843955,"teacher_disagreement_score":0.94455606,"about_ca_system_score_codex":0.0003792012,"about_ca_system_score_gemma":0.00007830452,"threshold_uncertainty_score":0.9999985},"labels":[],"label_agreement":null},{"id":"W4402896632","doi":"10.1109/lcomm.2024.3468872","title":"Practical Configuration of a Discrete RIS With Phase-Dependent Amplitude Response","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Acoustic Wave Resonator Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amplitude; Computer science; Phase (matter); Phase response; Physics; Optics","score_opus":0.03471531680090165,"score_gpt":0.32550825831747005,"score_spread":0.2907929415165684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402896632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20150273,0.00083610875,0.77660745,0.018703314,0.00012699325,0.00030998598,0.000063660606,0.0013323734,0.0005173921],"genre_scores_gemma":[0.98118603,0.00016062259,0.018426174,0.000066077904,0.000012599977,0.00008034192,0.000013160966,0.000034775912,0.000020237303],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922585,0.0000920662,0.00023155996,0.00012522441,0.0001778797,0.00014742411],"domain_scores_gemma":[0.99797,0.0007208544,0.000033971217,0.0012086639,0.000035792367,0.000030717667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023654076,0.00012144371,0.00013460906,0.00016554662,0.000058131474,0.00005700814,0.00042788827,0.00006600718,0.000012791305],"category_scores_gemma":[0.00010664161,0.000106920525,0.000037742964,0.00025878407,0.0003489093,0.00017390668,0.000052101663,0.0003521915,0.00003285275],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012822522,0.00007225843,0.00002169157,0.00010758058,0.00023550943,0.000036215442,0.0005609296,0.0046730717,0.9755875,0.0042042886,0.01028576,0.0040869657],"study_design_scores_gemma":[0.0024863235,0.0005892058,0.00083380006,0.0010198221,0.00058259553,0.00038728342,0.0022520325,0.4021082,0.49209687,0.00062293257,0.095610805,0.0014101233],"about_ca_topic_score_codex":0.000008577901,"about_ca_topic_score_gemma":0.000006432369,"teacher_disagreement_score":0.7796833,"about_ca_system_score_codex":0.000118392745,"about_ca_system_score_gemma":0.00003751784,"threshold_uncertainty_score":0.43600926},"labels":[],"label_agreement":null},{"id":"W4402968332","doi":"10.1109/lcomm.2024.3470890","title":"Handover for Multi-Beam LEO Satellite Networks: A Multi-Objective Reinforcement Learning Method","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Handover; Reinforcement learning; Computer science; Satellite; Communications satellite; Computer network; Telecommunications; Artificial intelligence; Engineering; Aerospace engineering","score_opus":0.07050715014967232,"score_gpt":0.3353517132191587,"score_spread":0.26484456306948634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402968332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004675135,0.028272236,0.9663162,0.0007894656,0.0008279661,0.0011182923,0.0000111508125,0.0013299584,0.0008671979],"genre_scores_gemma":[0.72294325,0.011858142,0.26061237,0.0007991911,0.00021461093,0.0018421186,0.0003255374,0.0002439338,0.0011608846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981052,0.00032472698,0.0006553443,0.0003133709,0.00017001621,0.00043133533],"domain_scores_gemma":[0.99594665,0.0013573611,0.00008882813,0.0023876815,0.000119602504,0.00009990398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009187935,0.00032187678,0.00032929127,0.00029851147,0.00036284028,0.00026859457,0.0013283143,0.00013862259,0.0000122540605],"category_scores_gemma":[0.00007579448,0.0003479165,0.0002360284,0.00057480583,0.000116734154,0.000338865,0.00018962758,0.00072109315,0.00016192254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018405377,0.00006219568,0.00023061507,0.00027004365,0.00066283176,0.0000023487057,0.0060622646,0.9059883,0.040335856,0.000637193,0.0029545706,0.042775374],"study_design_scores_gemma":[0.00046902837,0.0000132762725,0.00012912162,0.00018653611,0.000047243473,0.000007734246,0.00020989486,0.71654564,0.0016982638,0.000004652467,0.28039217,0.00029644245],"about_ca_topic_score_codex":0.00005495853,"about_ca_topic_score_gemma":0.00006266673,"teacher_disagreement_score":0.7224757,"about_ca_system_score_codex":0.0003790455,"about_ca_system_score_gemma":0.000024739675,"threshold_uncertainty_score":0.9998973},"labels":[],"label_agreement":null},{"id":"W4403391452","doi":"10.1109/lcomm.2024.3479735","title":"Channel Estimation for RIS-Assisted Multiuser mmWave Systems With Direct Channels Based on a Novel Space Projection Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council","keywords":"Computer science; Channel (broadcasting); Projection (relational algebra); Signal-to-noise ratio (imaging); Electronic engineering; Algorithm; Computer network; Telecommunications; Engineering","score_opus":0.06269997577578706,"score_gpt":0.26442726215118567,"score_spread":0.2017272863753986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403391452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032212099,0.00022028197,0.9915812,0.0013353062,0.00049610756,0.0013228721,0.000053001815,0.00078838255,0.0009816076],"genre_scores_gemma":[0.94128585,0.000017848331,0.05650268,0.000198561,0.000086025255,0.0015059467,0.00023951747,0.00008459393,0.000078992714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990163,0.000064770335,0.0002656718,0.00026010274,0.00017283257,0.00022032789],"domain_scores_gemma":[0.9987133,0.000218511,0.0000520752,0.0008790638,0.00008263528,0.000054381493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030470584,0.0002198552,0.00018537734,0.00036166722,0.00021933069,0.00020373499,0.00027369088,0.00008156347,9.571454e-7],"category_scores_gemma":[0.000021765161,0.00020034738,0.000077619785,0.00038561568,0.000043493594,0.00018744066,0.000017027745,0.00024440227,0.000012034334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017864973,0.000073342264,0.0000010678609,0.000355104,0.00007453845,3.0768192e-7,0.0005708344,0.96904397,0.027516589,0.000043396154,0.0011912824,0.001111731],"study_design_scores_gemma":[0.00044467553,0.00004317959,0.000009048266,0.0003578849,0.00005766804,0.000008097328,0.000087761546,0.9918057,0.005704578,0.0000025449121,0.0012306919,0.0002481833],"about_ca_topic_score_codex":0.000048611913,"about_ca_topic_score_gemma":0.000007973655,"teacher_disagreement_score":0.93806463,"about_ca_system_score_codex":0.00020691348,"about_ca_system_score_gemma":0.000026302954,"threshold_uncertainty_score":0.8169929},"labels":[],"label_agreement":null},{"id":"W4404479890","doi":"10.1109/lcomm.2024.3501956","title":"Dynamic Offloading in Mobile Edge Computing With Traffic-Aware Network Slicing and Adaptive TD3 Strategy","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Science and Engineering Research Council","keywords":"Computer science; Mobile edge computing; Computer network; Slicing; Enhanced Data Rates for GSM Evolution; Distributed computing; Server; Telecommunications","score_opus":0.021553044777828108,"score_gpt":0.26752116960618494,"score_spread":0.24596812482835684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404479890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60817236,0.0029745924,0.3839735,0.0022464178,0.0014265456,0.00035786757,5.776971e-7,0.00047765812,0.00037046836],"genre_scores_gemma":[0.96495235,0.00006748385,0.034262497,0.00043598382,0.00021694697,0.000021809607,0.0000060094226,0.000024647554,0.000012253687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846184,0.0001883308,0.0003236863,0.00043107683,0.0001452566,0.0004498134],"domain_scores_gemma":[0.9981724,0.00057705014,0.000076646036,0.001065226,0.000037930004,0.000070741844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047322636,0.0002081597,0.00022094394,0.00022809464,0.00044458045,0.000440753,0.0012893578,0.000056456178,4.1922456e-7],"category_scores_gemma":[0.0000043292243,0.00020276337,0.000044336884,0.0010165597,0.00014907944,0.00046036887,0.00044754756,0.0005662562,0.000011775475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013183695,0.00010590433,0.0011977776,0.00013409877,0.00013878976,0.00011018645,0.016711805,0.5764325,0.001864267,0.0025468224,0.0055803144,0.3951643],"study_design_scores_gemma":[0.00016598518,0.00005787401,0.0010503532,0.00056669634,0.000010386675,0.000048009686,0.00019123203,0.9962935,0.000016873566,0.00006314024,0.0012763321,0.00025960934],"about_ca_topic_score_codex":0.000054243632,"about_ca_topic_score_gemma":0.00009755487,"teacher_disagreement_score":0.41986096,"about_ca_system_score_codex":0.0001508481,"about_ca_system_score_gemma":0.00007836373,"threshold_uncertainty_score":0.826845},"labels":[],"label_agreement":null},{"id":"W4404563332","doi":"10.1109/lcomm.2024.3504372","title":"UAV-Assisted NOMA for Enhancing ISAC: A Deep Reinforcement Learning Solution","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Noma; Reinforcement learning; Computer science; Computer network; Telecommunications; Artificial intelligence; Telecommunications link","score_opus":0.019713341242511576,"score_gpt":0.2520021349143819,"score_spread":0.23228879367187033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404563332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057233367,0.00088551687,0.9880977,0.0025646521,0.00024694114,0.0004026482,0.000002843267,0.0007353623,0.0013409593],"genre_scores_gemma":[0.9624509,0.0003128014,0.03588784,0.00021384012,0.00008135008,0.00064451847,0.00020973952,0.00004715169,0.0001518574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999262,0.000026670936,0.00028573576,0.0001445237,0.00008328442,0.00019781268],"domain_scores_gemma":[0.99901533,0.0001681698,0.000031326814,0.00069942174,0.000046101148,0.0000396264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016942236,0.00012293171,0.000099844525,0.00015341738,0.000320024,0.00012296098,0.0003354514,0.000056591944,0.000018598474],"category_scores_gemma":[0.000015881269,0.00014106973,0.0000765112,0.0003290344,0.000042985044,0.00019898696,0.000039863786,0.00020265272,0.00007116668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002696017,0.000015335834,0.000011763081,0.00011207925,0.000076853146,2.9776226e-7,0.0009151416,0.83116823,0.14391768,0.0015071407,0.0050342083,0.017238555],"study_design_scores_gemma":[0.00012072068,0.000011296288,0.00006884648,0.000061924715,0.000038884704,0.0000035116702,0.00006764455,0.94008446,0.002350351,0.000027593022,0.057006616,0.00015814794],"about_ca_topic_score_codex":0.000019563144,"about_ca_topic_score_gemma":0.00010504865,"teacher_disagreement_score":0.95672756,"about_ca_system_score_codex":0.00021438228,"about_ca_system_score_gemma":0.000015091902,"threshold_uncertainty_score":0.5752657},"labels":[],"label_agreement":null},{"id":"W4404914825","doi":"10.1109/lcomm.2024.3509916","title":"Optimal Quantized Multi-Cell MMSE Precoding With Low Resolution Data Converters","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Precoding; Converters; Computer science; Zero-forcing precoding; Algorithm; MIMO; Telecommunications; Beamforming; Power (physics); Physics","score_opus":0.05330582733265834,"score_gpt":0.2980121970386785,"score_spread":0.24470636970602014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404914825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022022977,0.0041925814,0.96619624,0.0028236192,0.00022536636,0.0004938634,0.00009377568,0.0033852684,0.0005663237],"genre_scores_gemma":[0.7100432,0.0021000814,0.287088,0.00019198332,0.000020926627,0.00012639689,0.00031170933,0.00007838018,0.000039313116],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987887,0.00013136423,0.00035039437,0.00030222992,0.00015383403,0.0002734512],"domain_scores_gemma":[0.9939624,0.00031690515,0.000053486725,0.0055554505,0.000043200624,0.00006852738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695153,0.00022863325,0.00019647113,0.00022553532,0.00021360045,0.00014509086,0.0028589452,0.00007704362,0.000010524053],"category_scores_gemma":[0.000016571666,0.00023579659,0.000045753637,0.00042495254,0.00024947018,0.00081284693,0.00041268126,0.00059042947,0.00008213911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064418855,0.000400061,0.00021818349,0.00087322114,0.0004789994,0.000026985257,0.0031931435,0.275332,0.61245733,0.0009357306,0.0671209,0.038899038],"study_design_scores_gemma":[0.00034398033,0.000012942332,0.000035173718,0.00029822043,0.00003717648,0.000011545196,0.00009581774,0.9643679,0.012243009,0.000005208928,0.022222819,0.00032615793],"about_ca_topic_score_codex":0.000032142343,"about_ca_topic_score_gemma":0.00004877374,"teacher_disagreement_score":0.68903595,"about_ca_system_score_codex":0.00017749709,"about_ca_system_score_gemma":0.00003058386,"threshold_uncertainty_score":0.9615506},"labels":[],"label_agreement":null},{"id":"W4404914955","doi":"10.1109/lcomm.2024.3510464","title":"Efficient Codebook Design and User Scheduling for Large STAR-RIS-Aided Downlink URLLC Transmission","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Satellite Communication Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Codebook; Telecommunications link; Computer science; Scheduling (production processes); Transmission (telecommunications); Computer network; Telecommunications; Mathematical optimization; Algorithm; Mathematics","score_opus":0.045996189325394336,"score_gpt":0.28305862030669293,"score_spread":0.2370624309812986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404914955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020497356,0.02803318,0.944414,0.004473101,0.00031392495,0.001114194,0.00004018134,0.00089874933,0.00021532316],"genre_scores_gemma":[0.80076987,0.002446674,0.19547434,0.00048441003,0.000058616683,0.00049661164,0.00007118964,0.0001069775,0.00009132989],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986274,0.00021882646,0.0004572633,0.00023381667,0.00015060783,0.0003120663],"domain_scores_gemma":[0.99679404,0.0011534981,0.000037487775,0.0018471748,0.00006296076,0.0001048339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078653684,0.00021924006,0.0002191938,0.00022215662,0.00031717567,0.00018697068,0.00088687864,0.000105913125,0.000011355945],"category_scores_gemma":[0.000021732609,0.00022424122,0.000097352,0.00027860465,0.000083069375,0.0001093185,0.000083428036,0.0003543607,0.00005683958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048679452,0.00015991363,0.00007495192,0.0011258615,0.0004791321,0.0000049258733,0.009841977,0.39647028,0.5398697,0.0042608897,0.01622746,0.031436197],"study_design_scores_gemma":[0.00031147455,0.000009749242,0.00002655232,0.00026128604,0.00003657174,0.0000069431912,0.000097412216,0.751507,0.0030520388,0.000038069127,0.24443337,0.00021953993],"about_ca_topic_score_codex":0.000006727261,"about_ca_topic_score_gemma":0.0000036045526,"teacher_disagreement_score":0.7802725,"about_ca_system_score_codex":0.00013416371,"about_ca_system_score_gemma":0.000029655534,"threshold_uncertainty_score":0.9144291},"labels":[],"label_agreement":null},{"id":"W4405717973","doi":"10.1109/lcomm.2024.3521080","title":"Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Polar; Latency (audio); Forward error correction; Computer network; Telecommunications; Arithmetic; Mathematics","score_opus":0.03960159787015575,"score_gpt":0.3286500417338338,"score_spread":0.289048443863678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405717973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010594617,0.001510603,0.9486652,0.03588114,0.00080251705,0.00042699627,0.000014186955,0.0013841515,0.0007205989],"genre_scores_gemma":[0.65359986,0.00010430153,0.3450563,0.0008866357,0.000057713678,0.00016738745,0.000019636616,0.000022679142,0.000085516986],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987806,0.00013376231,0.00030612203,0.0003700146,0.00014793499,0.00026155665],"domain_scores_gemma":[0.9968545,0.0008471283,0.000107942404,0.0020008872,0.00013550866,0.00005405412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041088296,0.00015987303,0.00015099761,0.00024177827,0.00044468205,0.00044127423,0.0023498577,0.000067789064,0.0000032746868],"category_scores_gemma":[0.00009050971,0.00017019993,0.00010702296,0.0005527684,0.00010072638,0.0006991827,0.0002722319,0.00028642698,0.000014956951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015698171,0.00015137444,0.00043242882,0.00023480206,0.00021171436,0.000015709807,0.016118765,0.004532559,0.7682259,0.06393077,0.08339687,0.06273343],"study_design_scores_gemma":[0.0001974731,0.000053440093,0.00010567259,0.00045091528,0.00005043609,0.000023297678,0.0000797037,0.9044962,0.05911185,0.003163304,0.031667814,0.00059988303],"about_ca_topic_score_codex":0.0003214503,"about_ca_topic_score_gemma":0.000251028,"teacher_disagreement_score":0.8999637,"about_ca_system_score_codex":0.00020536977,"about_ca_system_score_gemma":0.00010144602,"threshold_uncertainty_score":0.69405514},"labels":[],"label_agreement":null},{"id":"W4405812396","doi":"10.1109/lcomm.2024.3523421","title":"Optimal Service Placement for 6G Edge Computing With Quantum-Centric Optimization in Real Quantum Hardware","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Quantum computer; Enhanced Data Rates for GSM Evolution; Quantum; Service (business); Computer hardware; Computer network; Computer architecture; Telecommunications; Physics","score_opus":0.02505966446870764,"score_gpt":0.27588410906342137,"score_spread":0.2508244445947137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405812396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08066595,0.00038550972,0.8948532,0.02252,0.0004667687,0.00056209945,0.00001370123,0.00047252676,0.000060260176],"genre_scores_gemma":[0.5377516,0.00009208651,0.46030322,0.0015188017,0.00012698512,0.000076534656,0.00007700584,0.000042076597,0.00001168178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980592,0.00019611724,0.00044164323,0.0005608766,0.0002650924,0.00047707342],"domain_scores_gemma":[0.99742705,0.0006401155,0.00012353595,0.0015939382,0.00012507089,0.000090321926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051495427,0.00026334092,0.0002464151,0.000397425,0.00043514685,0.0004671711,0.0021753747,0.00006669696,0.0000022266074],"category_scores_gemma":[0.000017308419,0.00024163253,0.000080981205,0.0014907209,0.0000777767,0.0003269828,0.00046480322,0.00043279305,0.00001426378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013180592,0.00008738455,0.000083160645,0.000091952264,0.000036196245,0.000011605031,0.002373165,0.98590714,0.00028436724,0.0054033315,0.0011740472,0.004534501],"study_design_scores_gemma":[0.00052692066,0.00008480046,0.00018216575,0.000353121,0.00001709486,0.000029722916,0.000096224656,0.9956779,0.00006615077,0.000054029726,0.002600588,0.00031129166],"about_ca_topic_score_codex":0.00014402863,"about_ca_topic_score_gemma":0.00004283551,"teacher_disagreement_score":0.45708567,"about_ca_system_score_codex":0.00017057938,"about_ca_system_score_gemma":0.0001452501,"threshold_uncertainty_score":0.9853488},"labels":[],"label_agreement":null},{"id":"W4406948936","doi":"10.1109/lcomm.2025.3536182","title":"Deep Reinforcement Learning for Joint Time and Power Management in SWIPT-EH CIoT","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Joint (building); Reinforcement; Computer network; Artificial intelligence; Engineering","score_opus":0.014790705724665693,"score_gpt":0.250461686174553,"score_spread":0.2356709804498873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406948936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012846432,0.0003870964,0.961646,0.032189537,0.00008915379,0.0005347601,1.3644303e-7,0.00027700907,0.0035916541],"genre_scores_gemma":[0.7978008,0.00032668663,0.19739842,0.0030355896,0.0000058899027,0.00028794527,0.000011670735,0.000011112995,0.0011219096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991213,0.00006906293,0.000278962,0.00023086333,0.00009018633,0.00020959349],"domain_scores_gemma":[0.9982142,0.00013555126,0.00008598192,0.0015067519,0.000038357604,0.00001917347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028788386,0.00010801397,0.00012678822,0.00034998852,0.00024058828,0.00011046074,0.0014054431,0.00004386814,0.0000073674532],"category_scores_gemma":[0.000032760723,0.00011944428,0.00003214365,0.0005662408,0.000115382914,0.00019666848,0.0009241719,0.00017740962,0.000024898996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014818618,0.0001963184,0.0011543351,0.000121996345,0.00029585985,0.000007025332,0.0018050125,0.37775123,0.007658117,0.27695656,0.042982254,0.29105648],"study_design_scores_gemma":[0.00059173355,0.000031461943,0.0010871247,0.00009076481,0.00001142786,0.0000013550908,0.0000698026,0.9646608,0.00074458495,0.0018060524,0.030703083,0.00020176191],"about_ca_topic_score_codex":0.0000075012986,"about_ca_topic_score_gemma":0.000008368603,"teacher_disagreement_score":0.7965161,"about_ca_system_score_codex":0.00013587177,"about_ca_system_score_gemma":0.000014411308,"threshold_uncertainty_score":0.48707962},"labels":[],"label_agreement":null},{"id":"W4406983206","doi":"10.1109/lcomm.2025.3537457","title":"Low-Complexity Multi-Target Detection in ELAA ISAC","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.024113434147922167,"score_gpt":0.2646011756583158,"score_spread":0.24048774151039365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406983206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7107608,0.0010990895,0.27039796,0.0060952827,0.0025718375,0.00084751577,0.000018393719,0.0013192847,0.006889828],"genre_scores_gemma":[0.9974177,0.000046533307,0.0015188721,0.00072344404,0.000023042207,0.00016620144,0.0000062239474,0.000015370802,0.000082605984],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992367,0.00011691289,0.0002865874,0.00011890307,0.00006610064,0.0001748159],"domain_scores_gemma":[0.99883,0.00007584193,0.00002667159,0.00101774,0.000020504247,0.000029242568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015824613,0.000116526855,0.00014771243,0.00025619374,0.00013087424,0.000037936145,0.00048145547,0.000067935216,0.000009546057],"category_scores_gemma":[0.000020305493,0.00013677904,0.000060428403,0.00045634242,0.000074748714,0.00010852167,0.000035401426,0.00031708417,0.00007874281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024538254,0.0002358088,0.0024647582,0.00018506781,0.00013156196,0.0000031009436,0.0009037214,0.06892869,0.89222896,0.00037141115,0.0045049908,0.030017408],"study_design_scores_gemma":[0.0014600237,0.000008981482,0.011272899,0.00012074187,0.000015690091,0.0000041448166,0.00021027368,0.8940499,0.04788168,0.00017143803,0.044456758,0.00034749563],"about_ca_topic_score_codex":0.00021914188,"about_ca_topic_score_gemma":0.0017897482,"teacher_disagreement_score":0.84434724,"about_ca_system_score_codex":0.00020297241,"about_ca_system_score_gemma":0.000008509014,"threshold_uncertainty_score":0.55776876},"labels":[],"label_agreement":null},{"id":"W4407690989","doi":"10.1109/lcomm.2025.3543318","title":"A Hybrid Quantum-Classical Machine Learning Approach for Self-Interference Cancellation in Full-Duplex Transceivers","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Transceiver; Interference (communication); Single antenna interference cancellation; Quantum; Telecommunications; Electronic engineering; Decoding methods; Wireless; Physics; Quantum mechanics; Engineering","score_opus":0.020031547738283546,"score_gpt":0.24441267527913302,"score_spread":0.22438112754084946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407690989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45447257,0.0008993286,0.5302926,0.009673939,0.00020080674,0.0007666486,0.000020874339,0.0016396933,0.0020335899],"genre_scores_gemma":[0.9463223,0.00040796713,0.05282006,0.00013052185,0.000011795459,0.0002118468,0.000053715823,0.000020215432,0.000021543674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999169,0.00005983808,0.0002697146,0.00017933182,0.00006542177,0.00025669334],"domain_scores_gemma":[0.9989016,0.00031181576,0.000028160735,0.0007082192,0.000024996625,0.000025216306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001407244,0.00014978414,0.00018996335,0.0002095235,0.00012225701,0.000037171725,0.00078038516,0.0000744499,0.0000024134658],"category_scores_gemma":[0.00003901754,0.00016756439,0.00006489724,0.00034040815,0.00013040855,0.00009367506,0.000041101863,0.0005541278,0.000004123032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030467047,0.00010173932,0.0007380092,0.00013955109,0.00008701293,8.937857e-7,0.0003140148,0.95069045,0.029371016,0.0066741956,0.0030649381,0.008787687],"study_design_scores_gemma":[0.00037389665,0.000018974535,0.00018293837,0.00005056512,0.000021832175,0.0000012509302,0.00005819601,0.9931298,0.00080810406,0.000079987425,0.0051193377,0.00015515542],"about_ca_topic_score_codex":0.000023774894,"about_ca_topic_score_gemma":0.00007847136,"teacher_disagreement_score":0.49184975,"about_ca_system_score_codex":0.00022722395,"about_ca_system_score_gemma":0.000015329852,"threshold_uncertainty_score":0.68330777},"labels":[],"label_agreement":null},{"id":"W4408716400","doi":"10.1109/lcomm.2025.3553446","title":"Orthogonal Time Frequency Space With Sub-Band Index Modulation","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Beijing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Frequency modulation; Modulation (music); Time–frequency analysis; Computer science; Telecommunications; Index (typography); Radio frequency; Physics; Acoustics; Radar","score_opus":0.008853148297427378,"score_gpt":0.223236260293184,"score_spread":0.21438311199575663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408716400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461478,0.0004217376,0.107024886,0.013858958,0.00042740128,0.00035603088,0.000018294222,0.00076750736,0.030977413],"genre_scores_gemma":[0.995136,0.000058204587,0.0041336357,0.0003165117,0.00003502391,0.00006814163,0.00003543363,0.00002284311,0.00019415791],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939203,0.00005120384,0.00017643275,0.00011845488,0.000111132766,0.00015073006],"domain_scores_gemma":[0.99860317,0.000081112805,0.000034011184,0.0011985342,0.000048265178,0.000034907825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007931343,0.00012313848,0.00010958327,0.0001933836,0.00015763815,0.00003979734,0.00046278682,0.000053970627,0.000018997815],"category_scores_gemma":[0.000010156584,0.00013149576,0.000033145392,0.00044508354,0.00013933296,0.00017999792,0.00002574392,0.0002517807,0.00007791685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010816527,0.000057659694,0.013444302,0.00004425933,0.00022394383,0.0000020027057,0.00028059792,0.28860062,0.6607286,0.0025687125,0.031310935,0.002727547],"study_design_scores_gemma":[0.0039414796,0.00008108763,0.21336381,0.00087217236,0.00029369874,0.00011963622,0.00020022648,0.57695884,0.092176884,0.0034549632,0.1058605,0.002676702],"about_ca_topic_score_codex":0.000016920405,"about_ca_topic_score_gemma":0.00003055371,"teacher_disagreement_score":0.5685517,"about_ca_system_score_codex":0.00013909827,"about_ca_system_score_gemma":0.000028387514,"threshold_uncertainty_score":0.5362241},"labels":[],"label_agreement":null},{"id":"W4410115263","doi":"10.1109/lcomm.2025.3567387","title":"Over-the-Air Fair Federated Learning via Multi-Objective Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Computer network; Distributed computing","score_opus":0.028683998238863636,"score_gpt":0.2932410083323019,"score_spread":0.26455701009343824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410115263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024925477,0.0001591831,0.8355973,0.15975744,0.00024891863,0.00025543608,0.000002959587,0.0010306663,0.00045556287],"genre_scores_gemma":[0.49950522,0.00012583166,0.49620914,0.0039347736,0.000009295853,0.0001120383,0.000029842633,0.000012105118,0.00006175457],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848604,0.00042692118,0.000283659,0.000370167,0.00016593047,0.0002672739],"domain_scores_gemma":[0.98713714,0.00060946366,0.00015895098,0.011945214,0.000123549,0.00002570502],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00040946013,0.00016512469,0.00014512318,0.00024168179,0.0011848102,0.0002599591,0.03133029,0.00009772707,0.0000035978253],"category_scores_gemma":[0.0036670163,0.00015366287,0.000058582,0.0013760577,0.0003167838,0.0006479277,0.033547536,0.0007112579,0.000026445961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021197027,0.000658469,0.0055490173,0.0000534082,0.00054724014,0.000011924856,0.0014745556,0.28660718,0.048428044,0.0071550854,0.56216466,0.08732919],"study_design_scores_gemma":[0.0002669854,0.000010331658,0.0016862063,0.00003992096,0.000010182444,0.0000030547133,0.00005310523,0.9902633,0.0020728512,0.0016232574,0.0038069214,0.00016391813],"about_ca_topic_score_codex":0.00015452477,"about_ca_topic_score_gemma":0.000060800383,"teacher_disagreement_score":0.7036561,"about_ca_system_score_codex":0.00020867448,"about_ca_system_score_gemma":0.00006401392,"threshold_uncertainty_score":0.974269},"labels":[],"label_agreement":null},{"id":"W4410153260","doi":"10.1109/lcomm.2025.3567850","title":"Digital Twin Enabled Site Specific Channel Precoding: Over the Air CIR Inference","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"National Science Foundation","keywords":"Precoding; Computer science; Inference; Channel (broadcasting); Zero-forcing precoding; Computer network; Algorithm; Telecommunications; Artificial intelligence; MIMO","score_opus":0.032020616096664976,"score_gpt":0.25771112972228377,"score_spread":0.2256905136256188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410153260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8486719,0.0011392796,0.07038015,0.0071536433,0.0039558485,0.0012148248,0.00005594413,0.0011077045,0.0663207],"genre_scores_gemma":[0.9986971,0.0000902457,0.00004629889,0.00047964527,0.00011544816,0.00007794802,0.000012919201,0.000016054511,0.00046433017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992624,0.000067966,0.0002680625,0.00012182128,0.00010523305,0.00017450411],"domain_scores_gemma":[0.9982653,0.00033149516,0.000043086216,0.0012940884,0.000037378653,0.000028635608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018024266,0.00012842129,0.00013237189,0.00014309195,0.00028932645,0.00017014352,0.0005872541,0.00007841948,0.000014700154],"category_scores_gemma":[0.000034652167,0.00010759614,0.000079945414,0.0004414968,0.00008612517,0.00018221696,0.00009827029,0.00035540233,0.00012319257],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052681753,0.00017780319,0.0032352337,0.00013954067,0.00044424192,0.0000045324728,0.003835636,0.10450354,0.181203,0.0046107676,0.6341965,0.0675965],"study_design_scores_gemma":[0.0007391734,0.000019885882,0.006323138,0.00023197722,0.000027270751,0.0000055725905,0.0002364684,0.02765427,0.00573253,0.00016713228,0.95845395,0.0004086396],"about_ca_topic_score_codex":0.000028916711,"about_ca_topic_score_gemma":0.000017613942,"teacher_disagreement_score":0.3242574,"about_ca_system_score_codex":0.00010618772,"about_ca_system_score_gemma":0.000013022076,"threshold_uncertainty_score":0.43876433},"labels":[],"label_agreement":null},{"id":"W4410219629","doi":"10.1109/lcomm.2025.3548041","title":"Rethinking Power Minimization in a Downlink Hybrid NOMA Network","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Telecommunications link; Computer science; Minification; Power (physics); Computer network; Telecommunications; Mathematical optimization; Mathematics","score_opus":0.016057146173656292,"score_gpt":0.24884378146858277,"score_spread":0.2327866352949265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410219629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22907646,0.007853697,0.69782853,0.043145165,0.0009912805,0.0009659711,0.000016736205,0.004182021,0.015940117],"genre_scores_gemma":[0.9258953,0.0014485714,0.07114879,0.0012463416,0.000010554482,0.00015880792,0.000040130664,0.000026739453,0.000024798537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896896,0.00010193747,0.0004178255,0.00016114813,0.00008609406,0.00026401083],"domain_scores_gemma":[0.99647796,0.00036862923,0.00006407385,0.0030288885,0.00004087974,0.000019594354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018507446,0.00016203086,0.0001917039,0.00032547282,0.00019056314,0.000043544118,0.0017980821,0.0000900685,0.000007837405],"category_scores_gemma":[0.00007960009,0.00019840969,0.00004827239,0.00092185615,0.00018942972,0.0002153896,0.00030389972,0.00059710996,0.000022225706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078405565,0.00006548206,0.0030813534,0.00003997504,0.00006961244,0.0000033775243,0.00081322936,0.9259714,0.0097379405,0.01444691,0.025109138,0.020653734],"study_design_scores_gemma":[0.0024784936,0.000034620058,0.016981626,0.0016077475,0.000058059006,0.00001795042,0.00064995675,0.68843293,0.01954651,0.058688886,0.20957187,0.0019313506],"about_ca_topic_score_codex":0.000010535218,"about_ca_topic_score_gemma":0.00008055119,"teacher_disagreement_score":0.6968188,"about_ca_system_score_codex":0.0002244681,"about_ca_system_score_gemma":0.000018244868,"threshold_uncertainty_score":0.8090912},"labels":[],"label_agreement":null},{"id":"W4410809613","doi":"10.1109/lcomm.2025.3574633","title":"A Low-Complexity Placement Design of Pinching-Antenna Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Telecommunications; Antenna (radio); Computer network","score_opus":0.04642882720345637,"score_gpt":0.2627175375422573,"score_spread":0.21628871033880093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410809613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049455585,0.0009006793,0.9919402,0.0010458915,0.00015369772,0.00020559739,0.000011572492,0.0001607868,0.00063601334],"genre_scores_gemma":[0.99002194,0.00027166755,0.009245335,0.00028297037,0.000012461196,0.000055291206,0.000014524739,0.0000136590115,0.00008215769],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991798,0.00014144111,0.00033676936,0.000100914534,0.00008648897,0.00015459399],"domain_scores_gemma":[0.9984203,0.0001609866,0.000053552398,0.0012891302,0.00004603645,0.000030014693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024095281,0.000120183,0.00021910323,0.00021481844,0.00011720019,0.00003183817,0.0008006125,0.000035880974,0.000007677788],"category_scores_gemma":[0.0000147381215,0.00012429232,0.0000815641,0.000401295,0.00014684272,0.00006510266,0.00006335175,0.00015667369,0.000016870632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091006,0.00010509244,0.0002976,0.00022167456,0.00038595422,8.3489203e-7,0.0003629337,0.073856935,0.9126869,0.005559197,0.006106431,0.00040733488],"study_design_scores_gemma":[0.00023862885,0.000007634775,0.00013662037,0.00023370297,0.00008655029,7.523946e-7,0.00015630142,0.9968107,0.0014407274,0.00015834939,0.0005725655,0.00015746514],"about_ca_topic_score_codex":0.000079089485,"about_ca_topic_score_gemma":0.0000069251632,"teacher_disagreement_score":0.98507637,"about_ca_system_score_codex":0.00008132839,"about_ca_system_score_gemma":0.000016137325,"threshold_uncertainty_score":0.50684935},"labels":[],"label_agreement":null},{"id":"W4411270722","doi":"10.1109/lcomm.2025.3579670","title":"Optimizing Smart Helper Placement for Enhanced Cache Efficiency in F-RANs","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Cache; Computer science; Reynolds-averaged Navier–Stokes equations; Computer network; Computational fluid dynamics; Engineering","score_opus":0.01868066994284781,"score_gpt":0.2599191377492709,"score_spread":0.24123846780642308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411270722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.190965,0.00094570173,0.7967508,0.0035098277,0.0006367755,0.00046839745,0.000006149662,0.0003798113,0.0063375416],"genre_scores_gemma":[0.9582609,0.00017071934,0.040055297,0.00083066017,0.000024605823,0.00048463803,0.000025360534,0.000028201854,0.00011959869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914694,0.00005760773,0.00029919494,0.0001505332,0.00006758393,0.0002781165],"domain_scores_gemma":[0.99833494,0.0004923182,0.000028109007,0.0010897212,0.000027362727,0.000027527558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002328117,0.00013781345,0.00015360436,0.0001760555,0.00014609902,0.000036312307,0.00076550274,0.00006636918,0.0000032633948],"category_scores_gemma":[0.000036227237,0.00016383744,0.000053219443,0.00038810683,0.00007729879,0.000077636454,0.00006797314,0.00026420123,0.0000050290646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003428135,0.000031633383,0.000083393286,0.00003505367,0.000024154748,2.143124e-7,0.0005069615,0.929509,0.06625759,0.00040243892,0.0020032017,0.0011429605],"study_design_scores_gemma":[0.0011888278,0.000015774373,0.00043287105,0.00054571417,0.000036985086,7.322234e-7,0.00019909858,0.9403585,0.040816214,0.000041930118,0.015927248,0.00043607762],"about_ca_topic_score_codex":0.000030869018,"about_ca_topic_score_gemma":0.0002720936,"teacher_disagreement_score":0.7672959,"about_ca_system_score_codex":0.00020021162,"about_ca_system_score_gemma":0.000018959692,"threshold_uncertainty_score":0.66810966},"labels":[],"label_agreement":null},{"id":"W4412619189","doi":"10.1109/lcomm.2025.3588915","title":"Autoencoder for Position-Assisted Beam Prediction in mmWave ISAC Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Autoencoder; Position (finance); Beam (structure); Telecommunications; Computer network; Artificial intelligence; Artificial neural network; Physics; Optics","score_opus":0.03100532981568768,"score_gpt":0.26450361386707744,"score_spread":0.23349828405138975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412619189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026277175,0.0006275284,0.9671715,0.002482955,0.0006400234,0.0005689983,0.00006131989,0.00029658934,0.001873913],"genre_scores_gemma":[0.9878848,0.00009112332,0.010515682,0.0006566195,0.00003496919,0.0004976496,0.00017660804,0.000020509395,0.000122045494],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992483,0.000051238174,0.00036218012,0.00012340937,0.00006069515,0.00015416999],"domain_scores_gemma":[0.99899775,0.00013378455,0.000033423876,0.0007478014,0.000059897513,0.000027323435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001960964,0.00010593214,0.00012847754,0.0002743023,0.00014124678,0.00005474427,0.0003155583,0.000067190165,0.0000037653567],"category_scores_gemma":[0.000017521095,0.000124062,0.00005376443,0.00025764003,0.00003423142,0.000121151716,0.000028161738,0.00016645128,0.00001018638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009232092,0.00008930603,0.0004127142,0.00022933714,0.00012472783,3.430706e-7,0.0005719124,0.47111186,0.5041497,0.0011281123,0.019486826,0.002685921],"study_design_scores_gemma":[0.00047146354,0.000007837577,0.0005194655,0.00018569973,0.00003102414,0.000001822113,0.00008266205,0.98673147,0.006214665,0.00013699537,0.0054832282,0.00013365583],"about_ca_topic_score_codex":0.00004306831,"about_ca_topic_score_gemma":0.000052275434,"teacher_disagreement_score":0.96160764,"about_ca_system_score_codex":0.00020320303,"about_ca_system_score_gemma":0.000018928587,"threshold_uncertainty_score":0.50591016},"labels":[],"label_agreement":null},{"id":"W4414856525","doi":"10.1109/lcomm.2025.3617905","title":"Unsourced Random Access With Unequal Power Dynamic Compressed Sensing","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Encoding (memory); Power (physics); Random access; State (computer science); Range (aeronautics); Code (set theory); Distribution (mathematics)","score_opus":0.01635150211349717,"score_gpt":0.2750482620863227,"score_spread":0.25869675997282554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414856525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38047266,0.0004363177,0.6049945,0.0043728463,0.0002491615,0.0003794407,0.0000070433107,0.0016547956,0.007433259],"genre_scores_gemma":[0.9862979,0.00008027253,0.012038302,0.001471845,0.00000927615,0.000014966177,0.000020437672,0.000034589673,0.000032391166],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992082,0.00010361988,0.00021989652,0.00015256781,0.00010459259,0.00021113598],"domain_scores_gemma":[0.99788827,0.000252672,0.00004419861,0.0017166049,0.00006395509,0.000034311655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008097509,0.0001805102,0.00021939116,0.00021010418,0.00021084501,0.00013661341,0.0009405824,0.000057787707,0.000004610163],"category_scores_gemma":[0.000009538659,0.00017589722,0.000055120137,0.00038636127,0.000170618,0.00014476711,0.00014123556,0.00031124408,0.0000073198735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015256448,0.000100763544,0.00047885216,0.000056354394,0.0006669353,0.00002640693,0.00089757907,0.3093013,0.6327687,0.0005783126,0.045213982,0.009758297],"study_design_scores_gemma":[0.0030414346,0.000030285757,0.0017958491,0.0009199347,0.00018699985,0.000020065752,0.0001770003,0.87508196,0.086193465,0.00037222388,0.031252183,0.0009286233],"about_ca_topic_score_codex":0.000064900654,"about_ca_topic_score_gemma":0.00007629085,"teacher_disagreement_score":0.60582525,"about_ca_system_score_codex":0.0000764727,"about_ca_system_score_gemma":0.000016141568,"threshold_uncertainty_score":0.717288},"labels":[],"label_agreement":null},{"id":"W4415124252","doi":"10.1109/lcomm.2025.3621135","title":"Coordinated Full-Duplex Cooperative Transmission With RSMA in Multi-Cell Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund; Concordia University","keywords":"Telecommunications link; Base station; Transmitter power output; Beamforming; Transmission (telecommunications); Channel (broadcasting); Channel state information; Interference (communication); Wireless","score_opus":0.017476801118114196,"score_gpt":0.24694507690139758,"score_spread":0.22946827578328338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415124252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5171972,0.0038036986,0.46562552,0.010246818,0.0001679681,0.0009771443,0.000018163113,0.0007450399,0.0012184437],"genre_scores_gemma":[0.9730804,0.001174628,0.024328511,0.00069244707,0.000008179469,0.0003636521,0.00013463608,0.000056976663,0.0001605677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853635,0.00026600045,0.0004771255,0.00024397948,0.00010667985,0.00036989007],"domain_scores_gemma":[0.99673396,0.0004198938,0.00005702698,0.0025988938,0.00011012022,0.00008010744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018547557,0.0002976417,0.00030808809,0.00035738258,0.00033085316,0.00007769533,0.0017868383,0.00014135872,0.000019465511],"category_scores_gemma":[0.000014667055,0.00030056498,0.00006252306,0.001461151,0.00028492024,0.00022344527,0.00013267364,0.00090141513,0.000025058476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020317304,0.00019627075,0.0003550971,0.000027630616,0.00005105908,0.0000023682683,0.00059102185,0.9442331,0.049752086,0.00015138478,0.002656668,0.0019629842],"study_design_scores_gemma":[0.0015127931,0.000019531113,0.0013044253,0.000238733,0.00003022851,0.0000031455363,0.00021135822,0.9872139,0.0023402148,5.793678e-7,0.0068018497,0.0003232338],"about_ca_topic_score_codex":0.000154413,"about_ca_topic_score_gemma":0.0009770271,"teacher_disagreement_score":0.4558832,"about_ca_system_score_codex":0.00025370505,"about_ca_system_score_gemma":0.00005417232,"threshold_uncertainty_score":0.9999446},"labels":[],"label_agreement":null},{"id":"W4416366643","doi":"10.1109/lcomm.2025.3634519","title":"Unified Mathematical Framework for Channel Estimation in VLC Systems With Signal-Dependent Noise","year":2025,"lang":"","type":"article","venue":"IEEE Communications Letters","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visible light communication; Estimator; Channel (broadcasting); Noise (video); Upper and lower bounds; Noise power; Relative intensity noise; Noise measurement; Bayesian probability","score_opus":0.028076119506633485,"score_gpt":0.2829510638912655,"score_spread":0.25487494438463204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416366643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009405998,0.0035301272,0.9484799,0.033577032,0.00031671085,0.0026665635,0.000057040677,0.00073404337,0.0012325915],"genre_scores_gemma":[0.8125086,0.001211838,0.1834588,0.00033203594,0.000017003447,0.002256808,0.00005342549,0.00008267411,0.00007883195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968198,0.0003218661,0.0013506317,0.00048347295,0.0003380781,0.00068618526],"domain_scores_gemma":[0.9891026,0.0040984545,0.00028583175,0.006183548,0.00022828874,0.000101275305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007689457,0.0005532744,0.00078615913,0.0008665078,0.0004604109,0.00035036248,0.0038912254,0.0005729189,0.000011505418],"category_scores_gemma":[0.0005102945,0.00058686285,0.00013961853,0.0015408292,0.00071295816,0.00036315987,0.00054864667,0.0015708766,0.000074251366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009288094,0.0006801432,0.000095222706,0.0013092767,0.0003988535,0.000003077986,0.0010585338,0.55661935,0.0026047842,0.43019897,0.0006548957,0.006283996],"study_design_scores_gemma":[0.0011269926,0.000070503855,0.0001539456,0.0035258606,0.0001492381,0.0000055181968,0.0015524165,0.9674364,0.0024771786,0.022383837,0.00047289144,0.0006452448],"about_ca_topic_score_codex":0.000053482163,"about_ca_topic_score_gemma":0.00004090884,"teacher_disagreement_score":0.8031026,"about_ca_system_score_codex":0.0007582632,"about_ca_system_score_gemma":0.000112310016,"threshold_uncertainty_score":0.9996583},"labels":[],"label_agreement":null},{"id":"W4416707339","doi":"10.1109/lcomm.2025.3637721","title":"Backdoor Attacks on Semantic Communications Systems With Joint Source and Channel Coding","year":2025,"lang":"","type":"article","venue":"IEEE Communications Letters","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Backdoor; Joint (building); Focus (optics); Coding (social sciences); Channel (broadcasting); Encoder; Communications system","score_opus":0.044237613860515515,"score_gpt":0.2937851249402814,"score_spread":0.24954751107976592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416707339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067602783,0.0027761448,0.8616975,0.12265996,0.0010620791,0.001248133,0.0000133688745,0.0003291713,0.0034533977],"genre_scores_gemma":[0.96788937,0.0016825906,0.023876486,0.005331404,0.000097861775,0.00022272335,0.000027095972,0.0000708871,0.00080160366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945355,0.0020759676,0.001081205,0.0009840648,0.0005378205,0.0007854069],"domain_scores_gemma":[0.98359644,0.0021589966,0.0007504565,0.012963768,0.00030981007,0.00022055193],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00145535,0.0006683773,0.0007986136,0.00081355247,0.0035456761,0.0012287054,0.008162901,0.00022976422,0.0000049600817],"category_scores_gemma":[0.00024685758,0.0006890607,0.00015117053,0.0017922218,0.0019406901,0.00071360666,0.004271348,0.002222149,0.000081334176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018624497,0.0016580409,0.0042955196,0.0014918166,0.0020474738,0.000038611437,0.02252018,0.7201965,0.0056965896,0.1889583,0.01748149,0.03542925],"study_design_scores_gemma":[0.0012173168,0.00012220356,0.0011489445,0.0029367167,0.00023466993,0.000051422085,0.0010227019,0.979302,0.00007975175,0.00008642268,0.01305224,0.0007455939],"about_ca_topic_score_codex":0.0005498173,"about_ca_topic_score_gemma":0.0001071028,"teacher_disagreement_score":0.96112907,"about_ca_system_score_codex":0.00041491375,"about_ca_system_score_gemma":0.00024898813,"threshold_uncertainty_score":0.99980813},"labels":[],"label_agreement":null},{"id":"W7082992673","doi":"10.1109/lcomm.2025.3613390","title":"UE Position Sensing in Non-LoS Propagation for U6G Wideband XL-MIMO Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Department for the Economy","keywords":"Non-line-of-sight propagation; Position (finance); Wideband; Channel (broadcasting); User equipment; Wireless; Joint (building); Ultra-wideband","score_opus":0.019722614671206513,"score_gpt":0.26365045837534584,"score_spread":0.24392784370413934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082992673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017187864,0.000092797905,0.923726,0.054190636,0.00029236294,0.00056992425,0.0000032890473,0.00008387016,0.0038532491],"genre_scores_gemma":[0.97589815,0.000009396063,0.02227499,0.0014313117,0.000025648267,0.00009451787,0.000032851967,0.0000023107189,0.00023079924],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991535,0.00011174536,0.0002695625,0.00022083435,0.00006778686,0.00017658746],"domain_scores_gemma":[0.9981721,0.0002633183,0.000100710844,0.0013156297,0.00012597571,0.000022235792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037580248,0.00009634095,0.00012429677,0.00013617091,0.00027164654,0.0001320903,0.0009221587,0.000060902512,3.4273302e-7],"category_scores_gemma":[0.00007739506,0.00010407037,0.000040176954,0.00042407538,0.00006174592,0.00022543859,0.00015467947,0.00015143448,0.0000036429926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020832014,0.00022241937,0.001970881,0.0005530515,0.000080114754,0.0000072473404,0.0018346354,0.022843115,0.8712752,0.056780692,0.023407422,0.021004407],"study_design_scores_gemma":[0.00080581784,0.0000219575,0.0013034319,0.0006146299,0.000020463876,0.000019760746,0.00010639289,0.95024693,0.025227273,0.0041796775,0.017130401,0.00032324987],"about_ca_topic_score_codex":0.00007971881,"about_ca_topic_score_gemma":0.00002366833,"teacher_disagreement_score":0.9587103,"about_ca_system_score_codex":0.00009758619,"about_ca_system_score_gemma":0.000042809486,"threshold_uncertainty_score":0.42438665},"labels":[],"label_agreement":null},{"id":"W7085149933","doi":"10.1109/lcomm.2025.3618864","title":"A Hypergraph Approach to Distributed Broadcast","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Plant Reproductive Biology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Hypergraph; Atomic broadcast; Context (archaeology); Key (lock); Distributed data store; Wireless sensor network; Broadcasting (networking); Upper and lower bounds","score_opus":0.017395731326895654,"score_gpt":0.2698902865295685,"score_spread":0.25249455520267283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7085149933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8779759,0.0011241658,0.08343121,0.022273423,0.00036474576,0.00057002436,0.00023479092,0.00006658972,0.013959173],"genre_scores_gemma":[0.98215455,0.00010302046,0.0114791095,0.004793081,0.00007143062,0.0001453242,0.0009525252,0.000009325308,0.0002916501],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911815,0.00013822614,0.00017912417,0.00033801634,0.00004670369,0.00017980725],"domain_scores_gemma":[0.9977476,0.000023635372,0.000043067772,0.0020735494,0.00006459014,0.00004755505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015528282,0.00011379098,0.00012887472,0.00008935242,0.00013953331,0.000016361253,0.0009491604,0.00007932847,9.795506e-7],"category_scores_gemma":[0.00012453504,0.000114615155,0.0000667171,0.0002951318,0.0001641288,0.0000023297532,0.0003074942,0.0001165201,0.000017844122],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002929643,0.0001010533,0.002041622,0.000004919418,0.00006942412,2.0127213e-7,0.000019547177,0.00014723351,0.9326999,0.00053233665,0.06286185,0.001492596],"study_design_scores_gemma":[0.00031510033,0.000034823777,0.010660491,0.000012075103,0.000025193489,0.000016100523,0.000057625846,0.00008780615,0.07119842,0.000034847242,0.9173265,0.00023101777],"about_ca_topic_score_codex":0.000031898242,"about_ca_topic_score_gemma":0.000013559928,"teacher_disagreement_score":0.8615015,"about_ca_system_score_codex":0.00001786136,"about_ca_system_score_gemma":0.000040472252,"threshold_uncertainty_score":0.46738705},"labels":[],"label_agreement":null},{"id":"W7124142880","doi":"10.1109/lcomm.2005.11015","title":"PAPR reduction of OFDM signals using partial transmit sequence: an optimal approach using sphere decoding","year":2005,"lang":"","type":"article","venue":"IEEE Communications Letters","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Reduction (mathematics); Decoding methods; Computation; Computational complexity theory; Multiplexing; Sequence (biology)","score_opus":0.13559077628918212,"score_gpt":0.33931337285666224,"score_spread":0.20372259656748012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124142880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7236927,0.001757528,0.27147314,0.0010484603,0.0007542577,0.00060126686,0.000055503435,0.00020288443,0.00041424524],"genre_scores_gemma":[0.6704466,0.00038971982,0.32824275,0.000072504714,0.00064966927,0.000035334197,0.00003771071,0.00011521252,0.00001051837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954884,0.0008714657,0.0016681447,0.0006334142,0.00053353683,0.0008050205],"domain_scores_gemma":[0.9954583,0.0001419838,0.00057755056,0.0033191158,0.00021971934,0.00028331325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010102603,0.0006071475,0.0007011763,0.0004363323,0.0008554055,0.00018733426,0.0018833047,0.00036610826,0.00021233618],"category_scores_gemma":[0.000037238922,0.00081340276,0.00034810818,0.001077029,0.0009775688,0.001924732,0.0001388529,0.0010931287,0.000016335645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021417893,0.0001734839,0.0000312315,0.0000822932,0.00014349,6.264349e-7,0.0021946582,0.51681703,0.47527236,0.000042104686,0.00007659868,0.005144669],"study_design_scores_gemma":[0.0005418183,0.000031522242,0.000011713206,0.00027222713,0.00037435105,0.00021529864,0.001567984,0.8604704,0.13457826,0.000009352488,0.0012543728,0.0006727199],"about_ca_topic_score_codex":0.00024050569,"about_ca_topic_score_gemma":0.0000067985006,"teacher_disagreement_score":0.34365332,"about_ca_system_score_codex":0.0010501131,"about_ca_system_score_gemma":0.00021532757,"threshold_uncertainty_score":0.99943167},"labels":[],"label_agreement":null}]}